Learn with Anil · TGPSC HMWSSB Manager (Engineering) PYQsPractise online →Subscribe ₹149

TGPSC HMWSSB Manager 2015 Paper 2 CSE question paper with answers

TSPSC Manager (Engineering), HMWSSB, 2015: Paper 2 (Computer Science & Information Technology). Paper 2: Computer Science & Information Technology (discrete mathematics, digital logic, computer organisation, programming, data structures and algorithms, theory of computation, operating systems, databases, computer networks and software engineering), 150 questions, 300 marks, 150 minutes, in English only. Held on 1 November 2015 (Notification 13/2015, Series A). All four options with the answer from TSPSC's final key, plus a short explanation for every question (the first 10 here, all of them in the app).

టీజీపీఎస్సీ జలమండలి (HMWSSB) మేనేజర్ (ఇంజనీరింగ్) పేపర్-2 కంప్యూటర్ సైన్స్ & ఇన్ఫర్మేషన్ టెక్నాలజీ 2015 ప్రశ్నపత్రం సమాధానాలతో

Attempt this paper · 147 min timerMake a topic-wise quiz

The correct answer to every question is free on this page, and so are the explanations of the first 10. For all 147 explanations, practise the paper in the app with the ₹149 All-in-One Pass, one payment for every exam on the site.

Subjects in this paper

All 147 questions

  1. Q1 · Discrete Mathematics · Sets, Relations & Functions

    Which of the following are partitions of {1,2,......8}?

    1. {{1,3,5},{1,2,6},{4,7,8}}
    2. {{1,3,5},{2,6,7},{4,8}}
    3. {{1,3,5},{2,6},{2,6},{4,7,8}}
    4. {{1,5},{2,6},{4,8}}
    Show answer

    Answer: (2) {{1,3,5},{2,6,7},{4,8}}

    A partition of a set is a collection of non-empty, pairwise disjoint blocks whose union is the whole set. In (2) the blocks {1,3,5}, {2,6,7}, {4,8} share no element and together contain 1 to 8, so it is a partition. (1) has 1 in two blocks; (3) lists the block {2,6} twice, so its listed blocks are not pairwise disjoint (read strictly as a set, the repeated block would collapse into one, but the examiner treats the repetition as overlapping blocks); (4) leaves out 3 and 7.

  2. Q2 · Discrete Mathematics · Combinatorics & Probability

    Let S = {1,2,..., n}. Let S₁ be the set of all subsets of S that contain 1. Let T₁ denote the set of all subsets of S that don't contain 1. Which of the following statement is correct?

    1. |T₁| = |S₁| = 2⁽ⁿ⁻¹⁾
    2. |T₁| ≠ |S₁|
    3. |T₁| + |S₁| = 2⁽ⁿ⁻¹⁾
    4. |T₁| + |S₁| = 2ⁿ
    Show answer

    Answer: (1) |T₁| = |S₁| = 2⁽ⁿ⁻¹⁾ / (4) |T₁| + |S₁| = 2ⁿ

    A subset of S that contains 1 is fixed by choosing any subset of the other n − 1 elements, so |S₁| = 2ⁿ⁻¹; likewise a subset without 1 is any subset of {2,...,n}, so |T₁| = 2ⁿ⁻¹. Hence statement (1) is true, and since every subset of S falls in exactly one of the two classes, |T₁| + |S₁| = 2ⁿ⁻¹ + 2ⁿ⁻¹ = 2ⁿ, so statement (4) is also true. Because both are correct, TSPSC accepted both (1) and (4); (2) and (3) are false.

  3. Q3 · Discrete Mathematics · Sets, Relations & Functions

    Let A = {0,1} × {0,1} and B = {a, b, c}. Suppose A is listed in lexicographic order based on 0 < 1 and B is in alphabetic order. If A × B × A is listed in lexicographic order, then the next element after ((1,0), c, (1,1)) is ________.

    1. ((1,0), a, (0,0))
    2. ((1,1), c, (0,0))
    3. ((1,1) a, (0,0))
    4. ((1,1), a, (1,1))
    Show answer

    Answer: (3) ((1,1) a, (0,0))

    A in lexicographic order is (0,0), (0,1), (1,0), (1,1). In ((1,0), c, (1,1)) the last component (1,1) is the largest element of A and c is the largest element of B, so both "roll over" to their smallest values (0,0) and a, and the first component moves up from (1,0) to (1,1). The next element is ((1,1), a, (0,0)).

  4. Q4 · Discrete Mathematics · Sets, Relations & Functions

    Let P(A) denote the power set of A. If P(A) ⊆ B then

    1. 2^|A| ≤ |B|
    2. 2^|A| ≥ |B|
    3. 2^|A| ≥ 2^|B|
    4. 2|A| < |B|
    Show answer

    Answer: (1) 2^|A| ≤ |B|

    The power set of A has 2^|A| elements. If P(A) is a subset of B, then B has at least as many elements as P(A), so |P(A)| = 2^|A| ≤ |B|.

  5. Q5 · Discrete Mathematics · Sets, Relations & Functions

    The inverse of the function f(x) = x² − 5 is

    1. f⁻¹(y) = √(y + 5)
    2. f⁻¹(y) = √(y − 5)
    3. f⁻¹(y) = √y − 5
    4. f⁻¹(y) = √y + 5
    Show answer

    Answer: (1) f⁻¹(y) = √(y + 5)

    Put y = x² − 5 and solve for x: x² = y + 5, so x = √(y + 5) (taking the non-negative root, i.e. treating f on x ≥ 0, where it is one-one). Check: f(√(y + 5)) = (y + 5) − 5 = y.

  6. Q6 · Discrete Mathematics · Lattices & Algebraic Structures

    Let D₃₀ = {1,2,3,5,6,10,15,30} and let the relation / (divides) be a partial order relation on D₃₀. Which of the following statements is correct?

    1. All the lower bounds of 10 and 15 are 1,2,3,5,6
    2. All the lower bounds of 10 and 15 are 1,2,3,5
    3. All the lower bounds of 10 and 15 are 1,5
    4. All the lower bounds of 10 and 15 are 2,3,5
    Show answer

    Answer: (3) All the lower bounds of 10 and 15 are 1,5

    Under divisibility, a lower bound of 10 and 15 is an element of D₃₀ that divides both 10 and 15, i.e. a common divisor. The divisors of 10 are 1, 2, 5, 10 and of 15 are 1, 3, 5, 15, so the common ones are 1 and 5 (the greatest lower bound is 5 = gcd(10, 15)). 2, 3 and 6 each fail to divide one of the two numbers.

  7. Q7 · Discrete Mathematics · Lattices & Algebraic Structures

    Let P(S) be the power set of S = {1,2,3}, and then define a lattice L under partial ordering of set inclusion induced on P(S). Which of the following sets are the sub-lattices of L. A = {∅, {1,2}, {2,3}, {1,2,3}} B = {∅, {1},{1,2}, {1,2,3}} C = {∅, {3}, {1,3}, {1,2,3}} D = {{1}, {3}, {1,3}, {1,2,3}} E = {∅,{3}, {1,2}, {1,2,3}}

    1. A and D are sub-lattices of L
    2. B and C are sub-lattices of L
    3. A is a sub-lattice of L
    4. D is a sub-lattice of L
    Show answer

    Answer: (2) B and C are sub-lattices of L

    In L the join is ∪ and the meet is ∩, and a sub-lattice must be closed under both. B and C are chains (∅ ⊆ {1} ⊆ {1,2} ⊆ {1,2,3} and ∅ ⊆ {3} ⊆ {1,3} ⊆ {1,2,3}), and a chain is always closed under ∪ and ∩, so both are sub-lattices. A is not, because {1,2} ∩ {2,3} = {2} ∉ A, and D is not, because {1} ∩ {3} = ∅ ∉ D. (E is also closed under ∪ and ∩, but no option mentions it.)

  8. Q8 · Digital Logic · Boolean Algebra & Minimisation

    In a 5-variable Boolean function, what are the "minterms" that differ from m₂₀ by one literal?

    1. m₀, m₅, m₁₀, m₁₅, m₂₅
    2. m₄, m₈, m₁₆, m₂₄, m₂₈
    3. m₄, m₁₆, m₂₁, m₂₂, m₂₈
    4. m₄, m₂₁, m₂₂, m₂₄, m₂₈
    Show answer

    Answer: (3) m₄, m₁₆, m₂₁, m₂₂, m₂₈

    m₂₀ = 10100 in binary. A minterm differing in exactly one literal differs in exactly one bit: flipping each bit in turn gives 00100 = 4, 11100 = 28, 10000 = 16, 10110 = 22 and 10101 = 21. So the adjacent minterms are m₄, m₁₆, m₂₁, m₂₂, m₂₈ (m₂₄ = 11000 differs in two bits).

  9. Q9 · Digital Logic · Boolean Algebra & Minimisation

    Given the Boolean function J(A, B, C) = Σ(0,1,7) + d(2,5,6), which of the following sum of products expressions (not necessarily minimal) represent J(A, B, C)? (i) A'B' + AB (ii) A'B' + BC (iii) A'C' + B'C + AB (iv) A'B' + AC (v) A'B' + ABC

    1. (i), (ii) and (iii)
    2. (iii), (iv) and (v)
    3. (i), (ii), (iv) and (v)
    4. (i), (iii), (iv) and (v)
    Show answer

    Answer: (4) (i), (iii), (iv) and (v)

    A valid expression must cover minterms 0, 1, 7 and may use only the don't-cares 2, 5, 6, never 3 or 4 (the 0s). (i) A'B' = {0,1}, AB = {6,7}: valid. (ii) BC = {3,7} covers the 0-minterm 3: invalid. (iii) A'C' = {0,2}, B'C = {1,5}, AB = {6,7}: valid. (iv) AC = {5,7}: valid. (v) ABC = {7}: valid. So (i), (iii), (iv) and (v).

  10. Q10 · Discrete Mathematics · Lattices & Algebraic Structures

    A group has 11 elements. The number of proper sub-groups it can have is

    1. 0
    2. 4
    3. 5
    4. 8
    Show answer

    Answer: (1) 0

    By Lagrange's theorem the order of a subgroup divides the order of the group. Since 11 is prime, the only subgroups are {e} (order 1) and the whole group (order 11), which are the trivial (improper) subgroups, so the group has no proper (non-trivial) subgroup. (Under the convention that {e} counts as proper there would be exactly one, which is not offered.)

  11. Q11 · Operating Systems · Memory Management & Virtual Memory

    Which of the following techniques can be used to counter the problem of external fragmentation that occurs in dynamic partitioning memory management?

    1. Compaction
    2. Segmentation
    3. Swapping
    4. Splitting
    Show answer

    Answer: (1) Compaction

    Explanation: open it in the practice app. It needs the ₹149 All-in-One Pass: one payment for every exam on the site.

  12. Q12 · Operating Systems · Memory Management & Virtual Memory

    The addresses generated by a particular program in a pure demand paging system with 100 records per page and one free main memory frame are as follows 0100, 0200, 0420, 0489, 0510, 0530, 0599, 0120, 0220, 0230, 0260, 0320, 0370 The number of page faults generated in order to execute the program is

    1. 13
    2. 8
    3. 7
    4. 10
    Show answer

    Answer: (3) 7

    Explanation: open it in the practice app. It needs the ₹149 All-in-One Pass: one payment for every exam on the site.

  13. Q13 · Operating Systems · Processes, Threads & CPU Scheduling

    In the process state transition diagram, transition from running to ready state indicates that

    1. the running process is preempted by a higher priority process
    2. the running process initiated an input/output operation
    3. the running process is blocked for a semaphore operation
    4. that the OS is not ready to service the running process
    Show answer

    Answer: (1) the running process is preempted by a higher priority process

    Explanation: open it in the practice app. It needs the ₹149 All-in-One Pass: one payment for every exam on the site.

  14. Q14 · Operating Systems · Memory Management & Virtual Memory

    Which of the following activities is not done by memory management?

    1. Keep an account of which parts of memory are currently being used by each of the processes
    2. Decide which processes are to be brought into memory when memory space becomes available
    3. Allocate and de-allocate memory space as needed
    4. Storage allocation
    Show answer

    Answer: (4) Storage allocation

    Explanation: open it in the practice app. It needs the ₹149 All-in-One Pass: one payment for every exam on the site.

  15. Q15 · Operating Systems · Processes, Threads & CPU Scheduling

    Which of the following statements is incorrect with regard to operating system design?

    1. Layered approach is easy to design and debug
    2. Layered approach is less efficient
    3. Changes to the kernel tend to be fewer with microkernel approach
    4. Microkernels are less secure and reliable
    Show answer

    Answer: (4) Microkernels are less secure and reliable

    Explanation: open it in the practice app. It needs the ₹149 All-in-One Pass: one payment for every exam on the site.

  16. Q16 · Operating Systems · Processes, Threads & CPU Scheduling

    When a process creates a new process using the fork() operation, then which of the following structures are shared between the parent process and the child process?

    1. Stack
    2. Heap
    3. Shared Memory Segments
    4. Stack, Heap and Shared Memory Segments
    Show answer

    Answer: (3) Shared Memory Segments

    Explanation: open it in the practice app. It needs the ₹149 All-in-One Pass: one payment for every exam on the site.

  17. Q17 · Operating Systems · Processes, Threads & CPU Scheduling

    Which of the following statements is incorrect with respect to threads?

    1. User-level threads are unknown by the kernel
    2. Kernel threads are more expensive
    3. User-level threads are more expensive
    4. Thread creation uses fewer resources than process creation
    Show answer

    Answer: (3) User-level threads are more expensive

    Explanation: open it in the practice app. It needs the ₹149 All-in-One Pass: one payment for every exam on the site.

  18. Q18 · Operating Systems · Synchronisation & Deadlocks

    Semaphore can be used for ________.

    1. detecting deadlock
    2. process synchronization
    3. process scheduling
    4. defining priority of the processes
    Show answer

    Answer: (2) process synchronization

    Explanation: open it in the practice app. It needs the ₹149 All-in-One Pass: one payment for every exam on the site.

  19. Q19 · Operating Systems · Processes, Threads & CPU Scheduling

    Which scheduler controls the degree of multiprogramming?

    1. Short-term scheduler
    2. Long-term scheduler
    3. Middle-term scheduler
    4. Disk Scheduler
    Show answer

    Answer: (2) Long-term scheduler

    Explanation: open it in the practice app. It needs the ₹149 All-in-One Pass: one payment for every exam on the site.

  20. Q20 · Operating Systems · Synchronisation & Deadlocks

    Let S and Q be two semaphores initialized to 1, where P₀ and P₁ are the processes defined as follows:

    Process P₁      Process P₂
    wait (S);       wait(Q);
    wait(Q);        wait(S);
        ---;            ----;
    signal(S);      signal(Q);
    signal(Q);      signal(S);

    Which one of the following statements is correct with respect to the above construct?

    1. Causes starvation
    2. Causes livelock
    3. Causes a deadlock
    4. Does not ensure mutual exclusion
    Show answer

    Answer: (3) Causes a deadlock

    Explanation: open it in the practice app. It needs the ₹149 All-in-One Pass: one payment for every exam on the site.

  21. Q21 · Computer Organisation & Architecture · Memory Hierarchy & I/O

    The number of address and data lines for a memory of 4K × 16 is:

    1. 12 and 16
    2. 10 and 16
    3. 12 and 12
    4. 16 and 16
    Show answer

    Answer: (1) 12 and 16

    Explanation: open it in the practice app. It needs the ₹149 All-in-One Pass: one payment for every exam on the site.

  22. Q22 · Computer Organisation & Architecture · CPU, Pipelining & Computer Arithmetic

    The instruction of a micro programmed control unit is called as

    1. micro-instruction
    2. micro-operation
    3. machine instruction
    4. micro-program
    Show answer

    Answer: (1) micro-instruction

    Explanation: open it in the practice app. It needs the ₹149 All-in-One Pass: one payment for every exam on the site.

  23. Q23 · Computer Organisation & Architecture · Memory Hierarchy & I/O

    Suppose that a bus has 16 data lines and requires 4 cycles of 250nsecs each to transfer data. The bandwidth of this bus would be 2 Megabytes/sec. If the cycle time of the bus was reduced to 125nsecs and the number of cycles required for transfer stayed the same what would the bandwidth of the bus?

    1. 1 Megabyte/sec
    2. 4 Megabytes/sec
    3. 8 Megabytes/sec
    4. 2 Megabytes/sec
    Show answer

    Answer: (4) 2 Megabytes/sec

    Explanation: open it in the practice app. It needs the ₹149 All-in-One Pass: one payment for every exam on the site.

  24. Q24 · Computer Organisation & Architecture · Memory Hierarchy & I/O

    In a memory-mapped I/O system, which of the following will not be there?

    1. LOAD
    2. IN
    3. OUT
    4. ADD
    Show answer

    Answer: (1) LOAD

    Explanation: open it in the practice app. It needs the ₹149 All-in-One Pass: one payment for every exam on the site.

  25. Q25 · Computer Organisation & Architecture · CPU, Pipelining & Computer Arithmetic

    In signed-magnitude binary division, if the dividend is (11100)₂ and divisor is (10011)₂ then the result is

    1. (00100)₂
    2. (10100)₂
    3. (11001)₂
    4. (01100)₂
    Show answer

    Answer: (2) (10100)₂

    Explanation: open it in the practice app. It needs the ₹149 All-in-One Pass: one payment for every exam on the site.

  26. Q26 · Computer Organisation & Architecture · Memory Hierarchy & I/O

    How many RAM chips of size 8K×16 are required to build 1 Megabyte memory?

    1. 128
    2. 64
    3. 32
    4. 16
    Show answer

    Answer: (2) 64

    Explanation: open it in the practice app. It needs the ₹149 All-in-One Pass: one payment for every exam on the site.

  27. Q27 · Digital Logic · Number Systems & Codes

    How many 1's are present in 5×512+3×64+7×8+4

    1. 9
    2. 8
    3. 7
    4. 6
    Show answer

    Answer: (2) 8

    Explanation: open it in the practice app. It needs the ₹149 All-in-One Pass: one payment for every exam on the site.

  28. Q28 · Computer Organisation & Architecture · CPU, Pipelining & Computer Arithmetic

    In a 32-bit floating-point format, the leftmost bit stores the sign of the number. The exponent value is stored in the next eight bits. A bias of 127 is subtracted from the field to get the true exponent value. The base is assumed to be 2. The format stores a normalized floating-point number, with the left-most being implicit. Thus remaining 23 bits are used to store 24-bit significand. What is the highest positive integer that can be represented

    1. 2¹²⁸
    2. (2−2⁻²³)×2¹²⁸
    3. 2¹²⁷
    4. (2−2⁻²³)×2¹²⁷
    Show answer

    Answer: (2) (2−2⁻²³)×2¹²⁸

    Explanation: open it in the practice app. It needs the ₹149 All-in-One Pass: one payment for every exam on the site.

  29. Q29 · Operating Systems · Processes, Threads & CPU Scheduling

    Listed below are some of the Operating System abstractions and related hardware components:

    i. Threadp) Interrupt
    ii. Virtual Address Spaceq) Memory
    iii. File Systemr) CPU
    iv. Signals) Disk

    Which of the following correctly relates the Operating System abstractions and related hardware components?

    1. i-p ii-q iii-r iv-s
    2. i-r ii-s iii-q iv-p
    3. i-r ii-q iii-s iv-p
    4. i-r ii-p iii-q iv-s
    Show answer

    Answer: (3) i-r ii-q iii-s iv-p

    Explanation: open it in the practice app. It needs the ₹149 All-in-One Pass: one payment for every exam on the site.

  30. Q30 · Computer Organisation & Architecture · CPU, Pipelining & Computer Arithmetic

    A non-pipeline system takes 50ns to process a task. The same task can be processed in six-segment pipeline with a clock cycle of 10ns. What is the speed-up ratio of the pipeline for 100 tasks?

    1. 4.76ns
    2. 40ns
    3. 40.76ns
    4. 1ns
    Show answer

    Answer: (1) 4.76ns

    Explanation: open it in the practice app. It needs the ₹149 All-in-One Pass: one payment for every exam on the site.

  31. Q31 · Computer Organisation & Architecture · Memory Hierarchy & I/O

    An interface that provides I/O transfer of data directly to and from the memory unit and peripheral is termed as

    1. DMA
    2. UART
    3. USRT
    4. Serial Interface
    Show answer

    Answer: (1) DMA

    Explanation: open it in the practice app. It needs the ₹149 All-in-One Pass: one payment for every exam on the site.

  32. Q32 · Database Management Systems · Normalisation

    Which of the following normal forms eliminates the anomalies of multivalued dependencies?

    1. 3NF
    2. BCNF
    3. 4NF
    4. 5NF
    Show answer

    Answer: (3) 4NF

    Explanation: open it in the practice app. It needs the ₹149 All-in-One Pass: one payment for every exam on the site.

  33. Q33 · Database Management Systems · Transactions, Concurrency & Indexing

    Which one of the following state transitions is made when the transaction has been rolled back and the database is restored to the state prior to the start of the transition?

    1. Active→Partially Committed
    2. Active→Committed
    3. Active→Aborted
    4. Partially Committed→Committed
    Show answer

    Answer: (3) Active→Aborted

    Explanation: open it in the practice app. It needs the ₹149 All-in-One Pass: one payment for every exam on the site.

  34. Q34 · Database Management Systems · SQL & Relational Algebra

    Consider relations R(A,B) and S(C,D); and the following SQL query.

    Select distinct A,B,
    from R,S

    Under what conditions the result is guaranteed to be same as R.

    1. R has no duplicate and S is non-empty
    2. R and S have no duplicates
    3. S has no duplicates and R is non-empty
    4. R and S have the same number of tuples
    Show answer

    Answer: (1) R has no duplicate and S is non-empty

    Explanation: open it in the practice app. It needs the ₹149 All-in-One Pass: one payment for every exam on the site.

  35. Q35 · Database Management Systems · Normalisation

    Let R = (A, B, C, D) and F = {A → B, A → C, BC → D}, then which of the following is correct?

    1. B → D
    2. A → B
    3. A → D
    4. D → A
    Show answer

    Answer: (3) A → D

    Explanation: open it in the practice app. It needs the ₹149 All-in-One Pass: one payment for every exam on the site.

  36. Q36 · Database Management Systems · SQL & Relational Algebra

    Which one of the following relational algebra transformations is incorrect?

    1. σ_C1(σ_C1(R)) → σ_C2(σ_C2(R))
    2. σ_C(π_A(R)) → π_A(σ_C(R))
    3. σ_C(R ∪ S) → σ_C(R) ∪ σ_C(S)
    4. σ_C(R) → π_A(R)
    Show answer

    Answer: (4) σ_C(R) → π_A(R)

    Explanation: open it in the practice app. It needs the ₹149 All-in-One Pass: one payment for every exam on the site.

  37. Q37 · Database Management Systems · SQL & Relational Algebra

    If relation R has m tuples and S has n tuples, what is the maximum and minimum number of tuples in R ⋈ S?

    1. m + n and 0
    2. mn and 0
    3. m + n and |m − n|
    4. mn and m + n
    Show answer

    Answer: (2) mn and 0

    Explanation: open it in the practice app. It needs the ₹149 All-in-One Pass: one payment for every exam on the site.

  38. Q38 · Database Management Systems · ER & Relational Model

    The referential integrity rule requires that

    1. Every null foreign key value must reference an existing primary key value.
    2. It makes it possible for an attribute to have a corresponding value.
    3. Every non-null foreign key value must reference an existing primary key value.
    4. It makes it possible to delete a row in one table whose primary key does not have a matching foreign key value in another table.
    Show answer

    Answer: (3) Every non-null foreign key value must reference an existing primary key value.

    Explanation: open it in the practice app. It needs the ₹149 All-in-One Pass: one payment for every exam on the site.

  39. Q39 · Database Management Systems · Normalisation

    Which of the following statements is correct?

    1. Every relation in 2NF is also in BCNF
    2. Every relation in BCNF is also in 3NF
    3. No relation can be in both BCNF and 3NF
    4. Every relation is ZNF is also in 3 NF
    Show answer

    Answer: (2) Every relation in BCNF is also in 3NF

    Explanation: open it in the practice app. It needs the ₹149 All-in-One Pass: one payment for every exam on the site.

  40. Q40 · Database Management Systems · Transactions, Concurrency & Indexing

    Consider the schedule S and determine which one of the following schedules is conflict equivalent schedule to S. S: R₁(X); R₂(Z); R₁(Z); R₃(X); R₃(Y); W₁(X); W₃(Y); R₂(Y); W₂(Z); W₂(Y)

    1. T1→T2→T3
    2. T2→T1→T3
    3. T3→T1→T2
    4. T3→T2→T1
    Show answer

    Answer: (3) T3→T1→T2

    Explanation: open it in the practice app. It needs the ₹149 All-in-One Pass: one payment for every exam on the site.

  41. Q41 · Database Management Systems · Transactions, Concurrency & Indexing

    Which one of the following file organization techniques provides very fast direct access?

    1. Hashed File Organization
    2. B-Tree Organization
    3. B+ Tree Organization
    4. Indexed-Sequential File Organization
    Show answer

    Answer: (1) Hashed File Organization

    Explanation: open it in the practice app. It needs the ₹149 All-in-One Pass: one payment for every exam on the site.

  42. Q42 · Algorithms · Complexity & Recurrences

    Consider the following functions f(n) = 3n^√n g(n) = 2^(√n log₂n) h(n) = n!

    1. h(n)=O(f(n))
    2. h(n) is O(g(n))
    3. g(n) is not O(f(n))
    4. f(n) is O(g(n))
    Show answer

    Answer: (4) f(n) is O(g(n))

    Explanation: open it in the practice app. It needs the ₹149 All-in-One Pass: one payment for every exam on the site.

  43. Q43 · Algorithms · Complexity & Recurrences

    Which one of the following recurrence relation denotes the running time of selection sort algorithm.

    1. T(n) = 2T(n/2) + cn
    2. T(n) = T(n−1) + cn
    3. T(n) = T(n−1) + c
    4. T(n) = 2T(n/2) + c
    Show answer

    Answer: (2) T(n) = T(n−1) + cn

    Explanation: open it in the practice app. It needs the ₹149 All-in-One Pass: one payment for every exam on the site.

  44. Q44 · Algorithms · Algorithm Design Techniques

    Match the following:

    a. Divide and Conqueri. Graph Coloring
    b. Dynamic Programmingii. Travelling Salesperson Problem
    c. Backtrackingiii. Quicksort
    1. a:iii; b:i; c:ii
    2. a:iii; b:ii; c:i
    3. a:ii; b:iii; c:i
    4. a:ii; b:i; c:iii
    Show answer

    Answer: (2) a:iii; b:ii; c:i

    Explanation: open it in the practice app. It needs the ₹149 All-in-One Pass: one payment for every exam on the site.

  45. Q45 · Algorithms · Complexity & Recurrences

    Which one of the following statements is correct? i) The Euler tour of a graph can be determined in polynomial time ii) The Hamiltonian cycle can be determined in polynomial time. iii) Determining whether a directed graph has a Euler tour is NP-complete iv) Determining whether a directed graph has a Hamiltonian cycle is NP-complete

    1. (i) and (ii)
    2. (i) and (iv)
    3. (ii) and (iii)
    4. (iii) and (iv)
    Show answer

    Answer: (2) (i) and (iv)

    Explanation: open it in the practice app. It needs the ₹149 All-in-One Pass: one payment for every exam on the site.

  46. Q46 · Algorithms · Complexity & Recurrences

    Which of the following statements is incorrect?

    1. If the output of one polynomial-time algorithm is fed into the input of another, the composite algorithm is polynomial
    2. Halting problem is NP-hard problem
    3. Travelling salesperson problem has a polynomial time algorithm
    4. Satisfiability problem is np-complete
    Show answer

    Answer: (3) Travelling salesperson problem has a polynomial time algorithm

    Explanation: open it in the practice app. It needs the ₹149 All-in-One Pass: one payment for every exam on the site.

  47. Q47 · Algorithms · Algorithm Design Techniques

    Which one of the algorithms obtains global optimal solutions?

    1. Greedy algorithm
    2. Dynamic Programming
    3. Greedy algorithm and Dynamic Programming
    4. Divide and Conquer
    Show answer

    Answer: (2) Dynamic Programming

    Explanation: open it in the practice app. It needs the ₹149 All-in-One Pass: one payment for every exam on the site.

  48. Q48 · Data Structures · Hashing & Graph Representation

    Consider a hash function h(k) = k mod 9 and a hash table consisting of 9 slots, where the collisions are resolved by chaining. If the following keys are inserted in the order: 5, 28, 19, 15, 20, 33, 12, 17, 10, then what are the maximum, minimum and average chain lengths for the given instance.

    1. 3, 0, and 1
    2. 3, 3, and 3
    3. 4, 0, and 1
    4. 3, 0, and 2
    Show answer

    Answer: (1) 3, 0, and 1

    Explanation: open it in the practice app. It needs the ₹149 All-in-One Pass: one payment for every exam on the site.

  49. Q49 · Algorithms · Graph Algorithms

    What is the time complexity of depth first search traversal of a graph consisting of n vertices and m edges represented using adjacency list?

    1. O(n)
    2. O(m + n)
    3. O(n²)
    4. O(mm)
    Show answer

    Answer: (2) O(m + n)

    Explanation: open it in the practice app. It needs the ₹149 All-in-One Pass: one payment for every exam on the site.

  50. Q50 · Algorithms · Graph Algorithms

    What is the time complexity of Kruskal's algorithm for finding the minimum spanning tree of an undirected graph containing n vertices and m edges?

    1. O(n)
    2. O(m + n)
    3. O(n²)
    4. O(m log n)
    Show answer

    Answer: (4) O(m log n)

    Explanation: open it in the practice app. It needs the ₹149 All-in-One Pass: one payment for every exam on the site.

  51. Q51 · Computer Networks · Network Models & Data Link Layer

    The maximum window size for data transmission using selective reject protocol with n-bit frame sequence is

    1. 2ⁿ
    2. 2ⁿ⁻¹
    3. 2ⁿ − 1
    4. 2ⁿ⁻²
    Show answer

    Answer: (2) 2ⁿ⁻¹

    Explanation: open it in the practice app. It needs the ₹149 All-in-One Pass: one payment for every exam on the site.

  52. Q52 · Computer Networks · Transport & Application Layers

    Which of the following is not a client-server application

    1. Internet chat
    2. Web browsing
    3. E-mail
    4. Ping
    Show answer

    Answer: (4) Ping

    Explanation: open it in the practice app. It needs the ₹149 All-in-One Pass: one payment for every exam on the site.

  53. Q53 · Computer Networks · Network Models & Data Link Layer

    In Ethernet when Manchester encoding is used, the bit rate is

    1. Half the baud rate
    2. Twice the baud rate
    3. Same as the baud rate
    4. Thrice the baud rate
    Show answer

    Answer: (1) Half the baud rate

    Explanation: open it in the practice app. It needs the ₹149 All-in-One Pass: one payment for every exam on the site.

  54. Q54 · Computer Networks · Network Models & Data Link Layer

    In a network of LANs connected by bridges, packets are sent from one LAN to another through intermediate bridges. Since more than one may exist between two LANs, packets may have to be routed through multiple bridges. Why is the spanning tree algorithm used for bridge-routing?

    1. For shortest path routing between LANs
    2. For avoiding loops in the routing paths
    3. For fault tolerance
    4. For minimizing collisions
    Show answer

    Answer: (2) For avoiding loops in the routing paths

    Explanation: open it in the practice app. It needs the ₹149 All-in-One Pass: one payment for every exam on the site.

  55. Q55 · Computer Networks · Transport & Application Layers

    Which of the following functionalities must be implemented by a transport protocol over and above the network protocol?

    1. Recovery from packet losses
    2. Detection of duplicate packets
    3. Packet delivery in the correct order
    4. End to end connectivity
    Show answer

    Answer: (4) End to end connectivity

    Explanation: open it in the practice app. It needs the ₹149 All-in-One Pass: one payment for every exam on the site.

  56. Q56 · Computer Networks · IP Addressing & Routing

    An organization has a class B network and wishes to form subnets for 64 departments. The subnet mask would be:

    1. 255.255.0.0
    2. 255.255.64.0
    3. 255.255.128.0
    4. 255.255.252.0
    Show answer

    Answer: (4) 255.255.252.0

    Explanation: open it in the practice app. It needs the ₹149 All-in-One Pass: one payment for every exam on the site.

  57. Q57 · Computer Networks · Transport & Application Layers

    What is the maximum size of data that the application layer can pass on to the TCP layer below?

    1. Any size
    2. 2¹⁶ bytes-size of TCP header
    3. 2¹⁶ bytes
    4. 1500 bytes
    Show answer

    Answer: (1) Any size

    Explanation: open it in the practice app. It needs the ₹149 All-in-One Pass: one payment for every exam on the site.

  58. Q58 · Computer Networks · IP Addressing & Routing

    The subnet mask for a particular network is 255.255.31.0. Which of the following pairs of IP addresses could belong to this network

    1. 172.57.88.62 and 172.56.87.233
    2. 10.35.28.2 and 10.35.29.4
    3. 191.203.31.87 and 191.234.31.88
    4. 128.8.129.43 and 128.8.161.55
    Show answer

    Answer: (4) 128.8.129.43 and 128.8.161.55

    Explanation: open it in the practice app. It needs the ₹149 All-in-One Pass: one payment for every exam on the site.

  59. Q59 · Computer Networks · IP Addressing & Routing

    In an IPv4 datagram, the M bit is 0, the value of HLEN is 10, the value of total length is 400 and the fragment offset value is 300. The position of the datagram, the sequence numbers of the first and the last bytes of the payload, respectively are

    1. Last fragment, 2400 and 2789
    2. First fragment, 2400 and 2759
    3. Last fragment, 2400 and 2759
    4. Middle fragment, 300 and 689
    Show answer

    Answer: (3) Last fragment, 2400 and 2759

    Explanation: open it in the practice app. It needs the ₹149 All-in-One Pass: one payment for every exam on the site.

  60. Q60 · Computer Networks · Transport & Application Layers

    Consider different activities related to email m1: Send an email from a mail client to a mail server m2: Download an email from mailbox server to a mail client m3: Checking email in a web browser What is the application level protocol used in each activity?

    1. M1:HTTP m2: SMTP m3:POP
    2. m1:HSMTP m2: FTP m3:HTTP
    3. m1:SMTP m2: POP m3:HTTP
    4. m1:POP m2: SMTP m3: IMAP
    Show answer

    Answer: (3) m1:SMTP m2: POP m3:HTTP

    Explanation: open it in the practice app. It needs the ₹149 All-in-One Pass: one payment for every exam on the site.

  61. Q61 · Computer Networks · IP Addressing & Routing

    A computer on a 10 Mbps network is regulated by a token bucket. The token bucket is filled at a rate of 2Mbps. It is initially filled to capacity with 16 Megabits. What is the maximum duration for which the computer can transmit at the full 10 Mbps?

    1. 1.6 sec
    2. 2 sec
    3. 5 sec
    4. 8 sec
    Show answer

    Answer: (2) 2 sec

    Explanation: open it in the practice app. It needs the ₹149 All-in-One Pass: one payment for every exam on the site.

  62. Q62 · Software Engineering · Design, Coding & Testing

    The process of defining a problem in terms of few steps and then exploring each of the steps further is known as

    1. step-wise refinement
    2. modularization
    3. Integration
    4. Divide and Conquer
    Show answer

    Answer: (1) step-wise refinement

    Explanation: open it in the practice app. It needs the ₹149 All-in-One Pass: one payment for every exam on the site.

  63. Q63 · Software Engineering · Design, Coding & Testing

    The following program is to be tested for statement coverage,

    begin
    f(a=b)
    {
    S1;
    exit;
    }
    else if (c=d)
    {
    s2;
    }
    else
    {
    S3;
    exit;
    }
    s4
    end

    The test cases T1,T2,T3 and T4 given below are expressed in terms of the properties satisfied by the values of variables a, b, c & d. The exact values are not given: T1: a, b, c &d are all equal T2: a ,b, c & d are all distinct T3: a=b & c!=d T4: a!=b & c=d Which of the test suites given below ensures coverage of statement S1,S2, S3 & S4

    1. T1,T2,T3
    2. T2,T3
    3. T3,T4
    4. T1,T2,T4
    Show answer

    Answer: (4) T1,T2,T4

    Explanation: open it in the practice app. It needs the ₹149 All-in-One Pass: one payment for every exam on the site.

  64. Q64 · Computer Networks · Transport & Application Layers

    Which of the following statements is FALSE?

    1. HTTP runs over TCP
    2. HTTP describes the structure of web pages
    3. HTTP allows information to be stored in URL
    4. HTTP can be used to test the validity of a hypertext link
    Show answer

    Answer: (2) HTTP describes the structure of web pages

    Explanation: open it in the practice app. It needs the ₹149 All-in-One Pass: one payment for every exam on the site.

  65. Q65 · Web Technologies · Web Technologies

    Consider the HTML table definition given below:

    <table border=1>
    <tr><td rowspan=2>ab</td>
    <td colspan=2>cb</td>
    </tr>
    <tr><td>ef</td>
    <td rowspan=2>gh</td>
    </tr>
    <tr><td colspan=2>ij</td>
    </tr>
    </table>

    The number of rows in each column and the number of columns in each row are:

    1. (2,2,3) and (2,3,2)
    2. (2,2,3) and (2,2,3)
    3. (2,3,2) and (2,3,2)
    4. (2,3,2) and (2,2,3)
    Show answer

    Answer: (3) (2,3,2) and (2,3,2)

    Explanation: open it in the practice app. It needs the ₹149 All-in-One Pass: one payment for every exam on the site.

  66. Q66 · Theory of Computation & Compilers · Regular Languages & Finite Automata

    The language represented by the regular expression 1*01* + 1* + 1*01*01* is

    1. All strings over {0,1} which contains exactly one zero
    2. All strings over {0,1} which contain at least two zeros.
    3. All strings over {0,1} which contain at most two zeros
    4. All strings over {0,1} containing exactly two zeros
    Show answer

    Answer: (3) All strings over {0,1} which contain at most two zeros

    Explanation: open it in the practice app. It needs the ₹149 All-in-One Pass: one payment for every exam on the site.

  67. Q67 · Computer Networks · Network Models & Data Link Layer

    In CSMA/CD, after the 4th collision, what is the probability that the node will attempt to retransmit immediately?

    1. 0.0625
    2. 0.5
    3. 0.125
    4. 0.25s
    Show answer

    Answer: (1) 0.0625

    Explanation: open it in the practice app. It needs the ₹149 All-in-One Pass: one payment for every exam on the site.

  68. Q68 · Computer Organisation & Architecture · Instruction Sets & Addressing Modes

    An array of 32 bit integers is stored in a byte addressable memory starting from the location 2000H. The size of the array is 100. If the index addressing is used to access the array elements, what would be the contents of index register?

    1. 100
    2. 4
    3. 32
    4. 2000H
    Show answer

    Answer: (2) 4

    Explanation: open it in the practice app. It needs the ₹149 All-in-One Pass: one payment for every exam on the site.

  69. Q69 · Theory of Computation & Compilers · Context-Free Languages & Turing Machines

    Which of the following statements is incorrect?

    1. Every recursively enumerable language is recursive
    2. The union of two recursively enumerable languages is recursively enumerable
    3. The union of two recursive languages is recursive enumerable language
    4. If the language L and it's complement L' are recursively enumerable then L is recursive
    Show answer

    Answer: (1) Every recursively enumerable language is recursive

    Explanation: open it in the practice app. It needs the ₹149 All-in-One Pass: one payment for every exam on the site.

  70. Q70 · Database Management Systems · ER & Relational Model

    The entity integrity rule requires that

    1. All primary key entries are unique
    2. A part of the key may be null
    3. Foreign key values do not reference primary key values
    4. Duplicate object values are allowed
    Show answer

    Answer: (1) All primary key entries are unique

    Explanation: open it in the practice app. It needs the ₹149 All-in-One Pass: one payment for every exam on the site.

  71. Q71 · Theory of Computation & Compilers · Regular Languages & Finite Automata

    Let L₁ = {ba, ab}, L₂ = {a, b} be two languages, then the length of the minimum string in L₁L₂* is

    1. 0
    2. 1
    3. 2
    4. 3
    Show answer

    Answer: (3) 2

    Explanation: open it in the practice app. It needs the ₹149 All-in-One Pass: one payment for every exam on the site.

  72. Q73 · Theory of Computation & Compilers · Regular Languages & Finite Automata

    Number of strings in the language represented by the Regular expression (0 + 1)(0 + 1)1(0 + 1) is

    1. 4
    2. 6
    3. 8
    4. 16
    Show answer

    Answer: (3) 8

    Explanation: open it in the practice app. It needs the ₹149 All-in-One Pass: one payment for every exam on the site.

  73. Q74 · Discrete Mathematics · Graph Theory

    The chromatic number of null graph Nₙ is

    1. 0
    2. 1
    3. 2
    4. 3
    Show answer

    Answer: (2) 1

    Explanation: open it in the practice app. It needs the ₹149 All-in-One Pass: one payment for every exam on the site.

  74. Q75 · Computer Organisation & Architecture · CPU, Pipelining & Computer Arithmetic

    Booth's algorithm is used to ____ signed numbers (2's complement)

    1. add
    2. subtract
    3. multiply
    4. divide
    Show answer

    Answer: (3) multiply

    Explanation: open it in the practice app. It needs the ₹149 All-in-One Pass: one payment for every exam on the site.

  75. Q76 · Discrete Mathematics · Graph Theory

    A connected graph contains 'n' vertices and 'm' edges then circuit rank is

    1. n−m
    2. m−(n−1)
    3. n−(m−1)
    4. m+n
    Show answer

    Answer: (2) m−(n−1)

    Explanation: open it in the practice app. It needs the ₹149 All-in-One Pass: one payment for every exam on the site.

  76. Q77 · Discrete Mathematics · Graph Theory

    A connected planar graph has 35 regions with degree 6 each, then number of vertices is____

    1. 35
    2. 70
    3. 72
    4. 96
    Show answer

    Answer: (3) 72

    Explanation: open it in the practice app. It needs the ₹149 All-in-One Pass: one payment for every exam on the site.

  77. Q78 · Algorithms · Graph Algorithms

    Which of the following minimal spanning tree algorithm assures connectivity of tree at all steps?

    1. Kruskal
    2. Prims
    3. Both Kruskal and Prims
    4. Dijkstra
    Show answer

    Answer: (2) Prims

    Explanation: open it in the practice app. It needs the ₹149 All-in-One Pass: one payment for every exam on the site.

  78. Q79 · Discrete Mathematics · Graph Theory

    If G is a connected plane graph with E edges, V vertices and R regions, then the following is true

    1. |V| − |E| = 2
    2. |V| − |E| + |R| = 1
    3. |V| − |E| = 2 + |R|
    4. |V| + |R| = |E| + 2
    Show answer

    Answer: (4) |V| + |R| = |E| + 2

    Explanation: open it in the practice app. It needs the ₹149 All-in-One Pass: one payment for every exam on the site.

  79. Q80 · Discrete Mathematics · Graph Theory

    The minimum number of colours required to colour any connected planar graph is

    1. 3
    2. 4
    3. 5
    4. Connot decide
    Show answer

    Answer: (2) 4

    Explanation: open it in the practice app. It needs the ₹149 All-in-One Pass: one payment for every exam on the site.

  80. Q81 · Discrete Mathematics · Combinatorics & Probability

    The number of ways of placing 7-similar balls in 5 distinct boxes is

    1. C(11,7)
    2. C(12,7)
    3. C(11,5)
    4. C(12,5)
    Show answer

    Answer: (1) C(11,7)

    Explanation: open it in the practice app. It needs the ₹149 All-in-One Pass: one payment for every exam on the site.

  81. Q82 · Discrete Mathematics · Combinatorics & Probability

    The number of ways of forming 5-member committee consisting of 2 girls and 3 boys from 10 girls and 20 boys

    1. C(10,2)+C(20,3)
    2. P(10,2)+P(20,3)
    3. P(10,2)P(20,3)
    4. C(10,2)C(20,3)
    Show answer

    Answer: (4) C(10,2)C(20,3)

    Explanation: open it in the practice app. It needs the ₹149 All-in-One Pass: one payment for every exam on the site.

  82. Q83 · Discrete Mathematics · Combinatorics & Probability

    How many terms will be there in the expansion of (x + y + z)⁶

    1. 15
    2. 28
    3. 35
    4. 45
    Show answer

    Answer: (2) 28

    Explanation: open it in the practice app. It needs the ₹149 All-in-One Pass: one payment for every exam on the site.

  83. Q84 · Theory of Computation & Compilers · Compiler Design

    A shift reduce parser generates actions specified in the braces following the corresponding rule of grammar S → xxS {PRINT "1"} S → y {PRINT "2"} S → Sz {PRINT "3"} What is the translation of xxxxyzz using the syntax directed translation?

    1. 23131
    2. 11231
    3. 33211
    4. none of these
    Show answer

    Answer: (1) 23131

    Explanation: open it in the practice app. It needs the ₹149 All-in-One Pass: one payment for every exam on the site.

  84. Q85 · Theory of Computation & Compilers · Compiler Design

    Which one of the following is the loader function accomplished by the programmer, in an absolute loading scheme? (i) Allocation (ii) Linking (iii) Reallocation

    1. Both (i) and (ii)
    2. (i) only
    3. (ii) only
    4. (iii) only
    Show answer

    Answer: (1) Both (i) and (ii)

    Explanation: open it in the practice app. It needs the ₹149 All-in-One Pass: one payment for every exam on the site.

  85. Q86 · Theory of Computation & Compilers · Compiler Design

    Which one of the following statements is correct?

    1. In operator precedence parsing precedence relations are defined for every pair of a non-terminal
    2. In operator precedence parsing, precedence relations are defined for every pair of a terminal
    3. In operator precedence parsing, precedence relations are defined to delimit the handle
    4. In operator precedence parsing precedence relations are defined to delimit a statement
    Show answer

    Answer: (3) In operator precedence parsing, precedence relations are defined to delimit the handle

    Explanation: open it in the practice app. It needs the ₹149 All-in-One Pass: one payment for every exam on the site.

  86. Q87 · Theory of Computation & Compilers · Compiler Design

    Which of the following statements is correct? (i) LR parsers can handle a larger range of languages and grammars than LL parsing (ii) LR parsers do not backtrack (iii) LR parser is a bottom-up parser

    1. (i) only
    2. (ii) only
    3. (iii) only
    4. (i), (ii) and (iii)
    Show answer

    Answer: (4) (i), (ii) and (iii)

    Explanation: open it in the practice app. It needs the ₹149 All-in-One Pass: one payment for every exam on the site.

  87. Q88 · Theory of Computation & Compilers · Compiler Design

    Which of the following is the most powerful parser?

    1. SLR
    2. LALR
    3. Canonical LR
    4. Operator-precedence
    Show answer

    Answer: (3) Canonical LR

    Explanation: open it in the practice app. It needs the ₹149 All-in-One Pass: one payment for every exam on the site.

  88. Q89 · Theory of Computation & Compilers · Compiler Design

    A top down parser generates ________

    1. Right-most derivation
    2. Right-most derivation in reverse
    3. Left-most derivation
    4. Left-most derivation in reverse
    Show answer

    Answer: (3) Left-most derivation

    Explanation: open it in the practice app. It needs the ₹149 All-in-One Pass: one payment for every exam on the site.

  89. Q90 · Theory of Computation & Compilers · Compiler Design

    Which one of the following statements is correct with respect to the grammar give below? S → 1A | 1B A → 1 B → 1

    1. LL(1) and LR(1)
    2. LL(1) but not LR(1)
    3. LR(1) but not LL(1)
    4. Neither LL(1) not LR(1)
    Show answer

    Answer: (4) Neither LL(1) not LR(1)

    Explanation: open it in the practice app. It needs the ₹149 All-in-One Pass: one payment for every exam on the site.

  90. Q91 · Theory of Computation & Compilers · Compiler Design

    Which one of the following statements is correct with respect to the grammar given below?

    E → E + TF
    T → T * FF

    F → id

    1. Both + and * are right associative
    2. Both + and * are left associative
    3. + is left associative but * is right associative
    4. * is left associative but + is right associative
    Show answer

    Answer: (2) Both + and * are left associative

    Explanation: open it in the practice app. It needs the ₹149 All-in-One Pass: one payment for every exam on the site.

  91. Q92 · Theory of Computation & Compilers · Context-Free Languages & Turing Machines

    Which of the following statement is true about Push Down Automata(PDA)?

    1. PDAs recognize Context-sensitive Languages
    2. PDAs recognize Context-free Languages
    3. PDAs recognize Type 1 Languages
    4. PDAs recognize Type 0 Languages
    Show answer

    Answer: (2) PDAs recognize Context-free Languages

    Explanation: open it in the practice app. It needs the ₹149 All-in-One Pass: one payment for every exam on the site.

  92. Q93 · Theory of Computation & Compilers · Context-Free Languages & Turing Machines

    Consider the grammar G=(N,T,P,S), where N={S,A,B}, T={a,b}, P={(S → AB),(B → ab), (A → aa), (A → a), (B → b)}. Which of the following statement is true about the above grammar.

    1. It is Context Sensitive
    2. It is Context free
    3. It is type 0 grammar
    4. It is unrestricted language
    Show answer

    Answer: (2) It is Context free

    Explanation: open it in the practice app. It needs the ₹149 All-in-One Pass: one payment for every exam on the site.

  93. Q94 · Computer Organisation & Architecture · CPU, Pipelining & Computer Arithmetic

    What would be the speed of a processor in terms instructions per second if the processor has two types of instructions A and B. Type A instructions take 18 clock cycles and type B instructions take 8 clock cycles. Programs on an average use 20% of type A and 80% of type B instructions. The clock rate is of 1 GHz.

    1. 1000 MIPS
    2. 10 MIPS
    3. 100 MIPS
    4. 10000 MIPS
    Show answer

    Answer: (3) 100 MIPS

    Explanation: open it in the practice app. It needs the ₹149 All-in-One Pass: one payment for every exam on the site.

  94. Q95 · Programming in C, C++ & Java · C Programming

    Consider the following sequence of C language statements.

    typedef int * IntegerPointer
    IntegerPointer A,B;
    A= (IntegerPointer) malloc(sizeof(int));
    B= (IntegerPointer) malloc(sizeof(int));
    *A = 5;
    *B = 17;
    free (A);
    A=B;
    free (B);

    The above situation wherein A contains a pointer pointing to the location that B's pointer used to point to is known as

    1. dangling pointer
    2. side effect
    3. null pointer
    4. free pointer
    Show answer

    Answer: (1) dangling pointer

    Explanation: open it in the practice app. It needs the ₹149 All-in-One Pass: one payment for every exam on the site.

  95. Q97 · Computer Organisation & Architecture · Instruction Sets & Addressing Modes

    Consider the following sequence of instructions of stack based CPU.

    PUSH a
    PUSH b
    ADD
    PUSH a
    PUSH b
    ADD
    MUL
    PUSH c
    MUL

    Which of the following is implemented by the above sequence?

    1. 2c(a+b)
    2. 2c²(a+b)
    3. c(a²+b²)
    4. c(a+b)²
    Show answer

    Answer: (4) c(a+b)²

    Explanation: open it in the practice app. It needs the ₹149 All-in-One Pass: one payment for every exam on the site.

  96. Q98 · Theory of Computation & Compilers · Compiler Design

    Which of the following is a top-down parser?

    1. Predictive recursive descent
    2. Shift-reduce
    3. Canonical LR(1)
    4. LALR(1)
    Show answer

    Answer: (1) Predictive recursive descent

    Explanation: open it in the practice app. It needs the ₹149 All-in-One Pass: one payment for every exam on the site.

  97. Q99 · Computer Networks · Network Models & Data Link Layer

    Consider the following code with four valid code words: 0000000000 0000011111 1111100000 1111111111 Which of the following is correct sequence of hamming distance of the above code and the number of bit errors that can be corrected using the above code?

    1. 4,2
    2. 5,2
    3. 5,3
    4. 4,3
    Show answer

    Answer: (2) 5,2

    Explanation: open it in the practice app. It needs the ₹149 All-in-One Pass: one payment for every exam on the site.

  98. Q100 · Operating Systems · File Systems & Disk Scheduling

    List of objects together with the operations allowed on these objects is called ________.

    1. Capability list
    2. access list
    3. available list
    4. access matrix
    Show answer

    Answer: (1) Capability list

    Explanation: open it in the practice app. It needs the ₹149 All-in-One Pass: one payment for every exam on the site.

  99. Q101 · Programming in C, C++ & Java · C Programming

    What is the output of following C language code?

    #include <stdio.h>
    int main ( )
    {
    static int i = 1;
    tun (i);
    tun (i);
    tun (i);
    printf("%d", i);
    }
    tun (int i)
    {
    i++;
    }
    1. 1
    2. 2
    3. 3
    4. 4
    Show answer

    Answer: (1) 1

    Explanation: open it in the practice app. It needs the ₹149 All-in-One Pass: one payment for every exam on the site.

  100. Q102 · Data Structures · Trees & Heaps

    Which of the following tree need not be a binary tree

    1. BST
    2. AVL
    3. Heap
    4. B-Tree
    Show answer

    Answer: (4) B-Tree

    Explanation: open it in the practice app. It needs the ₹149 All-in-One Pass: one payment for every exam on the site.

  101. Q103 · Algorithms · Sorting & Searching

    Which data structure is used to implement radix sort

    1. Stacks
    2. Queue
    3. Linked list
    4. Tree
    Show answer

    Answer: (2) Queue

    Explanation: open it in the practice app. It needs the ₹149 All-in-One Pass: one payment for every exam on the site.

  102. Q104 · Algorithms · Sorting & Searching

    Which of the following sorting algorithm does not have worst case time complexity of O(n²)

    1. Bubble Sort
    2. Quick Sort
    3. Insertion Sort
    4. Heap Sort
    Show answer

    Answer: (4) Heap Sort

    Explanation: open it in the practice app. It needs the ₹149 All-in-One Pass: one payment for every exam on the site.

  103. Q105 · Digital Logic · Number Systems & Codes

    A decimal number has 25 digits. The number of bits needed for its equivalent binary representation is, approximately_______.

    1. 50
    2. 60
    3. 75
    4. 80
    Show answer

    Answer: (3) 75

    Explanation: open it in the practice app. It needs the ₹149 All-in-One Pass: one payment for every exam on the site.

  104. Q107 · Programming in C, C++ & Java · C Programming

    Consider the following C program:

    main()
    {
        int x=5;
        printf("%d,%d,%d\n",x,x<<2,x>>2);
    }

    What could be the output of the above program?

    1. 5,20,5
    2. 4,4,1
    3. 5,20,1
    4. 20,20,5
    Show answer

    Answer: (3) 5,20,1

    Explanation: open it in the practice app. It needs the ₹149 All-in-One Pass: one payment for every exam on the site.

  105. Q108 · Programming in C, C++ & Java · C Programming

    According to the precedence defined in the C language, arrange the operators ., ||, <, = in the ascending order of precedence.

    1. ., ||, <, =
    2. =, <, ||, .
    3. =, ||, <, .
    4. <, ||, =, .
    Show answer

    Answer: (3) =, ||, <, .

    Explanation: open it in the practice app. It needs the ₹149 All-in-One Pass: one payment for every exam on the site.

  106. Q109 · Programming in C, C++ & Java · C Programming

    What is the output of the following programming C language code?

    for (i=1;i<5;++i)
    if(i==3) continue;
    else
    printf("%d", i);
    1. 1 2 4 5
    2. 1 2 4
    3. 2 4 5
    4. 3 3 3
    Show answer

    Answer: (2) 1 2 4

    Explanation: open it in the practice app. It needs the ₹149 All-in-One Pass: one payment for every exam on the site.

  107. Q110 · Programming in C, C++ & Java · C Programming

    If n has the value 3, then the statement a[++n]=n++ results in _____

    1. a[5]=3
    2. a[5]=4
    3. a[4]=4
    4. a[4]=3
    Show answer

    Answer: (1) a[5]=3

    Explanation: open it in the practice app. It needs the ₹149 All-in-One Pass: one payment for every exam on the site.

  108. Q111 · Programming in C, C++ & Java · C Programming

    Aliasing in the context of programming languages refers to

    1. Multiple variables having the same memory location
    2. Multiple variables having the same value
    3. Multiple variables having the same identifier
    4. Multiple use of the same variable
    Show answer

    Answer: (1) Multiple variables having the same memory location

    Explanation: open it in the practice app. It needs the ₹149 All-in-One Pass: one payment for every exam on the site.

  109. Q112 · Computer Networks · Network Models & Data Link Layer

    Error detection at the data link level is achieved by

    1. bit stuffing
    2. cyclic redundancy codes
    3. hamming codes
    4. equalization
    Show answer

    Answer: (2) cyclic redundancy codes

    Explanation: open it in the practice app. It needs the ₹149 All-in-One Pass: one payment for every exam on the site.

  110. Q113 · Computer Networks · Network Models & Data Link Layer

    In the carrier sense network if the prevailing condition is a 'channel busy', then which of the following statements is correct?

    1. Non-persistent CSMA results in randomized wait and sense
    2. With 1-persistent CSMA, the channel is continually sensed
    3. p-persistent CSMA results in randomized retransmission
    4. Non-persistent CSMA does not sense the channel
    Show answer

    Answer: (2) With 1-persistent CSMA, the channel is continually sensed

    Explanation: open it in the practice app. It needs the ₹149 All-in-One Pass: one payment for every exam on the site.

  111. Q114 · Algorithms · Sorting & Searching

    The average time required to perform a successful sequential search for an element in an array A(1:n) is given by

    1. (n+1)/2
    2. log₂n
    3. n(n+1)/2
    4. n²
    Show answer

    Answer: (1) (n+1)/2

    Explanation: open it in the practice app. It needs the ₹149 All-in-One Pass: one payment for every exam on the site.

  112. Q115 · Programming in C, C++ & Java · C Programming

    Consider the following C program

    int x;
    main()
    {
        int x=0;
        {
            int x=10;
            x++;
            change_x(x);
            x++;
            modify_x();
            printf("%d ",x);
        }
        x++;
        change_x(x);
        printf("%d ",x);
        modify_x();
        printf("%d\n",x);
    }
    modify_x()
    {
        return (x+=10);
    }
    change_x()
    {
        return(x+=1);
    }

    What would be the output of the above program?

    1. 23 14 24
    2. 23 1 1
    3. 13 1 1
    4. 12 1 1
    Show answer

    Answer: (4) 12 1 1

    Explanation: open it in the practice app. It needs the ₹149 All-in-One Pass: one payment for every exam on the site.

  113. Q116 · Algorithms · Sorting & Searching

    Average successful search time taken by binary search on a sorted array of 10 items is

    1. 2.6
    2. 2.7
    3. 2.8
    4. 2.9
    Show answer

    Answer: (4) 2.9

    Explanation: open it in the practice app. It needs the ₹149 All-in-One Pass: one payment for every exam on the site.

  114. Q117 · Algorithms · Sorting & Searching

    What is the number of comparisons required for merging two sorted lists of sizes m and n into a sorted list of size m + n.

    1. O(m)
    2. O(n)
    3. O(m+n)
    4. O(log n + log m)
    Show answer

    Answer: (3) O(m+n)

    Explanation: open it in the practice app. It needs the ₹149 All-in-One Pass: one payment for every exam on the site.

  115. Q118 · Data Structures · Trees & Heaps

    The number of binary trees with 3 nodes which when traversed in post-order gives the sequence A, B, C is

    1. 3
    2. 9
    3. 7
    4. 5
    Show answer

    Answer: (4) 5

    Explanation: open it in the practice app. It needs the ₹149 All-in-One Pass: one payment for every exam on the site.

  116. Q119 · Algorithms · Complexity & Recurrences

    A machine needs a minimum of 100 sec to sort 1000 names by quick sort. The minimum time needed to sort 100 names will be approximately

    1. 50.2
    2. 6.7
    3. 72.7
    4. 11.2
    Show answer

    Answer: (2) 6.7

    Explanation: open it in the practice app. It needs the ₹149 All-in-One Pass: one payment for every exam on the site.

  117. Q120 · Software Engineering · Process Models & Requirements

    What is the disadvantage of spiral model?

    1. It is inefficient for smaller projects
    2. High amount of risk analysis
    3. Strong approval and documentation control
    4. Additional functionalities can be added later
    Show answer

    Answer: (1) It is inefficient for smaller projects

    Explanation: open it in the practice app. It needs the ₹149 All-in-One Pass: one payment for every exam on the site.

  118. Q121 · Software Engineering · Design, Coding & Testing

    In software engineering, acceptance testing is also known as

    1. black-box testing
    2. white-box testing
    3. Alpha testing
    4. Beta testing
    Show answer

    Answer: (4) Beta testing

    Explanation: open it in the practice app. It needs the ₹149 All-in-One Pass: one payment for every exam on the site.

  119. Q122 · Software Engineering · Design, Coding & Testing

    Cohesion is a qualitative indication of the degree to which a module

    1. can be written more compactly
    2. focuses on just one thing
    3. is able to complete its function in a timely manner
    4. is connected to other modules and the outside world
    Show answer

    Answer: (2) focuses on just one thing

    Explanation: open it in the practice app. It needs the ₹149 All-in-One Pass: one payment for every exam on the site.

  120. Q123 · Software Engineering · Design, Coding & Testing

    Cyclomatic complexity is related to which of the following testing methods?

    1. White-box
    2. Black-box testing
    3. White-box and black-box testing
    4. Functional-test
    Show answer

    Answer: (1) White-box

    Explanation: open it in the practice app. It needs the ₹149 All-in-One Pass: one payment for every exam on the site.

  121. Q124 · Discrete Mathematics · Mathematical Logic

    A sufficient condition that a triangle T be a right triangle is that a² + b² + = c². An equivalent statement is

    1. If T is a right triangle then a² + b² = c²
    2. If a² + b² = c² then T is a right triangle
    3. T is a right triangle only if a² + b² = c²
    4. T is a right triangle unless a² + b² = c²
    Show answer

    Answer: (2) If a² + b² = c² then T is a right triangle

    Explanation: open it in the practice app. It needs the ₹149 All-in-One Pass: one payment for every exam on the site.

  122. Q125 · Discrete Mathematics · Mathematical Logic

    Consider the statement, "Given that people who are in need of refuge and consolation are apt to do odd things, it is clear that people who are apt to do odd things are in need of refuge and consolation." This statement, of the form (P ⇒ Q) ⇒ (Q ⇒ P)

    1. People who are in need of refuge and consolation are not apt to do odd things
    2. People are apt to do odd things if and only if they are in need of refuge and consolation
    3. People who are apt to do odd things are in need of refuge and consolation
    4. People who are in need of refuge and consolation are apt to do odd things
    Show answer

    Answer: (3) People who are apt to do odd things are in need of refuge and consolation

    Explanation: open it in the practice app. It needs the ₹149 All-in-One Pass: one payment for every exam on the site.

  123. Q126 · Digital Logic · Combinational & Sequential Circuits

    Which of the following statements is correct?

    1. A ripple counter is an asynchronous counter.
    2. In an asynchronous counter, each state is clocked by the same pulse
    3. An asynchronous decade counter increases its value by ten for each clock pulse
    4. Asynchronous inputs will cause the flip-flop to respond immediately with regard to the clock input
    Show answer

    Answer: (1) A ripple counter is an asynchronous counter.

    Explanation: open it in the practice app. It needs the ₹149 All-in-One Pass: one payment for every exam on the site.

  124. Q127 · Programming in C, C++ & Java · Object-Oriented Programming

    Which one of the following statements is correct?

    1. Abstraction is the classification of objects, grouped according to their significant similarities
    2. Abstraction is the classification of objects, grouped according to their significant differences
    3. Abstraction is the classification of objects, grouped according to their names
    4. Abstraction is hiding information inside a class so that it can only be known in an abstract manner
    Show answer

    Answer: (4) Abstraction is hiding information inside a class so that it can only be known in an abstract manner

    Explanation: open it in the practice app. It needs the ₹149 All-in-One Pass: one payment for every exam on the site.

  125. Q128 · Engineering Mathematics · Numerical Methods

    If the given function isknown only at some selected points, which method you would use to solve the differential equation.

    1. Euler method
    2. modified Euler method
    3. Runge-Kutte Method
    4. Simpson's Rule
    Show answer

    Answer: (1) Euler method

    Explanation: open it in the practice app. It needs the ₹149 All-in-One Pass: one payment for every exam on the site.

  126. Q129 · Web Technologies · Web Technologies

    XML validated against a ____ is a valid XML

    1. DTD
    2. JQUERY
    3. CFG
    4. Parser
    Show answer

    Answer: (1) DTD

    Explanation: open it in the practice app. It needs the ₹149 All-in-One Pass: one payment for every exam on the site.

  127. Q130 · Discrete Mathematics · Mathematical Logic

    Consider the logical statement q → (p → q) Which of the following statements is true about the above statement?

    1. It is a Contradiction.
    2. It is a Tautology
    3. It is not a well formed statement
    4. It is a Inverse
    Show answer

    Answer: (2) It is a Tautology

    Explanation: open it in the practice app. It needs the ₹149 All-in-One Pass: one payment for every exam on the site.

  128. Q131 · Discrete Mathematics · Combinatorics & Probability

    The mean of the distribution whose probability density function f(x) = {αe^(−αx), x ≥ 0; 0, x < 0} is

    1. 0
    2. 1
    3. 1/α
    4. α
    Show answer

    Answer: (3) 1/α

    Explanation: open it in the practice app. It needs the ₹149 All-in-One Pass: one payment for every exam on the site.

  129. Q132 · Discrete Mathematics · Combinatorics & Probability

    For a poisson distribution

    1. Mean = standard deviation
    2. Mean = variance
    3. Mean = mean deviation
    4. Mean = median
    Show answer

    Answer: (2) Mean = variance

    Explanation: open it in the practice app. It needs the ₹149 All-in-One Pass: one payment for every exam on the site.

  130. Q133 · Engineering Mathematics · Linear Algebra

    The Eigen values of a matrix are 1,2,−1 then the sum of Eigenvalues of the inverse of that matrix are

    1. 0
    2. 1/2
    3. 2
    4. 4
    Show answer

    Answer: (2) 1/2

    Explanation: open it in the practice app. It needs the ₹149 All-in-One Pass: one payment for every exam on the site.

  131. Q134 · Engineering Mathematics · Linear Algebra

    The possible Eigenvector of the matrix

    30−2
    020
    −200

    corresponding to one of its Eigen value (-1) is

    1. [1, 1, 1]ᵀ
    2. [1, 0, 2]ᵀ
    3. [−1, 0, 12]ᵀ
    4. [2, 0, 1]ᵀ
    Show answer

    Answer: (2) [1, 0, 2]ᵀ

    Explanation: open it in the practice app. It needs the ₹149 All-in-One Pass: one payment for every exam on the site.

  132. Q135 · Engineering Mathematics · Numerical Methods

    In the LU factorization method, to solve the system of equations AX=B, we solve the system of equations in the order

    1. First UX=Y and then LY=B
    2. First LY=B and then UX=Y
    3. First LY=X and then UY=B
    4. First UY=B and then LX=Y
    Show answer

    Answer: (2) First LY=B and then UX=Y

    Explanation: open it in the practice app. It needs the ₹149 All-in-One Pass: one payment for every exam on the site.

  133. Q136 · Engineering Mathematics · Numerical Methods

    If f(a)f(b) < 0, then at least one root of the equation f(x) = 0 lies between a and b. The repeated application of this is

    1. Newton-Raphson method
    2. Bisection method
    3. Secant method
    4. LU decomposition method
    Show answer

    Answer: (2) Bisection method

    Explanation: open it in the practice app. It needs the ₹149 All-in-One Pass: one payment for every exam on the site.

  134. Q137 · Engineering Mathematics · Calculus

    If f(x) = (e^(1/x) − 1)/(e^(1/x) + 1) for x ≠ 0, f(0) = 0 then at x=0 f(x) is

    1. continuous
    2. discontinuous
    3. differentiable
    4. continuous but not differentiable
    Show answer

    Answer: (2) discontinuous

    Explanation: open it in the practice app. It needs the ₹149 All-in-One Pass: one payment for every exam on the site.

  135. Q138 · Engineering Mathematics · Calculus

    If y = √(x + √(x + √(x……..∞))), then dy/dx =

    1. 1/y
    2. 1/x
    3. 1/(2x−1)
    4. 1/(2y−1)
    Show answer

    Answer: (4) 1/(2y−1)

    Explanation: open it in the practice app. It needs the ₹149 All-in-One Pass: one payment for every exam on the site.

  136. Q139 · Engineering Mathematics · Calculus

    ∫₋₁¹ (x − [2x]) dx =

    1. 1
    2. 0
    3. 2
    4. 4
    Show answer

    Answer: (1) 1

    Explanation: open it in the practice app. It needs the ₹149 All-in-One Pass: one payment for every exam on the site.

  137. Q140 · Programming in C, C++ & Java · C Programming

    Consider the following C declaration

    int (*f)();

    Which of the following statements correctly interprets the above declaration?

    1. f is a function which returns an integer
    2. f is a function which returns a pointer to an integer
    3. f is a function to pointer which returns an integer
    4. f is pointer to a function which returns an integer
    Show answer

    Answer: (4) f is pointer to a function which returns an integer

    Explanation: open it in the practice app. It needs the ₹149 All-in-One Pass: one payment for every exam on the site.

  138. Q141 · Computer Networks · Transport & Application Layers

    Which of the following statements is false about DNS?

    1. DNS uses TCP for its implementation
    2. DNS uses both TCP and UDP for its implementation.
    3. DNS is implemented as a distributed database system.
    4. DNS maps internet domain name onto the IP address.
    Show answer

    Answer: (1) DNS uses TCP for its implementation

    Explanation: open it in the practice app. It needs the ₹149 All-in-One Pass: one payment for every exam on the site.

  139. Q142 · Data Structures · Arrays, Stacks, Queues & Linked Lists

    Which of the following is the correct sequence of the statements to be executed to insert a node after a node whose address is p? The pointer field nextptr points to the next node and the address of the new node is q.

    1. p->nextptr=q; q->nextptr=p;
    2. p->nextptr=q; q->nextptr=p->nextptr;
    3. q->nextptr=p->nextptr; p->nextptr=q;
    4. q->nextptr=p->nextptr; p->nextptr=q->nextptr;
    Show answer

    Answer: (3) q->nextptr=p->nextptr; p->nextptr=q;

    Explanation: open it in the practice app. It needs the ₹149 All-in-One Pass: one payment for every exam on the site.

  140. Q143 · Computer Networks · Network Models & Data Link Layer

    A bit string, 0111101111101111110, needs to be transmitted at the data link layer. What is the string actually transmitted after the bit stuffing?

    1. 011110111110011111100
    2. 011110111110011111010
    3. 011110111110111111000
    4. 011110011111011111100
    Show answer

    Answer: (2) 011110111110011111010

    Explanation: open it in the practice app. It needs the ₹149 All-in-One Pass: one payment for every exam on the site.

  141. Q144 · Computer Networks · Network Models & Data Link Layer

    A channel has a bit rate of 4000 bps and a propagation delay of 20 msec. For what range of frame sizes(S) (in number of bits) does stop-and-wait protocol give an efficiency of at least 50 percent?

    1. S ≤ 160
    2. S ≥ 160
    3. 80 ≤ S ≤ 160
    4. S ≥ 40, 20 ≤ S ≤ 30
    Show answer

    Answer: (2) S ≥ 160

    Explanation: open it in the practice app. It needs the ₹149 All-in-One Pass: one payment for every exam on the site.

  142. Q145 · Computer Networks · Network Models & Data Link Layer

    Which of the following sliding window protocols has the receiver window size more than 1?

    1. Stop-and-wait protocol
    2. One-bit window protocol
    3. Go-Back-N protocol
    4. Selective Repeat protocol
    Show answer

    Answer: (4) Selective Repeat protocol

    Explanation: open it in the practice app. It needs the ₹149 All-in-One Pass: one payment for every exam on the site.

  143. Q146 · Computer Networks · Network Models & Data Link Layer

    Consider building a CSMA/CD network running at 1 Gbps over a 1-km cable with no repeaters. The signal speed in the cable is 200,000 km/sec. What is the minimum frame size?

    1. 10⁶ bits
    2. 64 bytes
    3. 1250 bytes
    4. 125 bytes
    Show answer

    Answer: (3) 1250 bytes

    Explanation: open it in the practice app. It needs the ₹149 All-in-One Pass: one payment for every exam on the site.

  144. Q147 · Computer Networks · IP Addressing & Routing

    Which one of the following statements is incorrect about Count-to-infinity problem?

    1. It reacts rapidly to good news
    2. It reacts slowly to good news
    3. It reacts leisurely to bad news
    4. Distance Vector Routing suffers from Count-to-infinity problem
    Show answer

    Answer: (2) It reacts slowly to good news

    Explanation: open it in the practice app. It needs the ₹149 All-in-One Pass: one payment for every exam on the site.

  145. Q148 · Computer Networks · IP Addressing & Routing

    A network on the Internet has a subnet mask of 255.255.240.0. What is the maximum number of hosts it can handle?

    1. 4096
    2. 3556
    3. 4080
    4. 4094
    Show answer

    Answer: (4) 4094

    Explanation: open it in the practice app. It needs the ₹149 All-in-One Pass: one payment for every exam on the site.

  146. Q149 · Computer Networks · Transport & Application Layers

    Consider a transport layer with maximum segment size as 1KB. Also, consider at a particular point of time, the parameters receiver's window, congestion window are set to 1024KB, 256KB respectively, at which time, the transmission of a packet resulted in a timeout. What will be the values of congestion window and threshold respectively for the next transmission?

    1. 1024KB, 256KB
    2. 1KB, 128KB
    3. 1KB,256KB
    4. 1024KB, 128Kb
    Show answer

    Answer: (2) 1KB, 128KB

    Explanation: open it in the practice app. It needs the ₹149 All-in-One Pass: one payment for every exam on the site.

  147. Q150 · Computer Networks · IP Addressing & Routing

    Dynamic Host Configuration Protocol (DHCP) is used to:

    1. assign CIDR subnet masks to routers
    2. allocate the host part of an IP address to a host
    3. assign the network component of an IP address to a router
    4. manage the assignment of MAC addresses
    Show answer

    Answer: (2) allocate the host part of an IP address to a host

    Explanation: open it in the practice app. It needs the ₹149 All-in-One Pass: one payment for every exam on the site.