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 quizThe 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
Which of the following are partitions of {1,2,......8}?
- {{1,3,5},{1,2,6},{4,7,8}}
- {{1,3,5},{2,6,7},{4,8}}
- {{1,3,5},{2,6},{2,6},{4,7,8}}
- {{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.
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?
- |T₁| = |S₁| = 2⁽ⁿ⁻¹⁾
- |T₁| ≠ |S₁|
- |T₁| + |S₁| = 2⁽ⁿ⁻¹⁾
- |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.
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,0), a, (0,0))
- ((1,1), c, (0,0))
- ((1,1) a, (0,0))
- ((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)).
Let P(A) denote the power set of A. If P(A) ⊆ B then
- 2^|A| ≤ |B|
- 2^|A| ≥ |B|
- 2^|A| ≥ 2^|B|
- 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|.
The inverse of the function f(x) = x² − 5 is
- f⁻¹(y) = √(y + 5)
- f⁻¹(y) = √(y − 5)
- f⁻¹(y) = √y − 5
- 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.
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?
- All the lower bounds of 10 and 15 are 1,2,3,5,6
- All the lower bounds of 10 and 15 are 1,2,3,5
- All the lower bounds of 10 and 15 are 1,5
- 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.
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}}
- A and D are sub-lattices of L
- B and C are sub-lattices of L
- A is a sub-lattice of L
- 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.)
In a 5-variable Boolean function, what are the "minterms" that differ from m₂₀ by one literal?
- m₀, m₅, m₁₀, m₁₅, m₂₅
- m₄, m₈, m₁₆, m₂₄, m₂₈
- m₄, m₁₆, m₂₁, m₂₂, m₂₈
- 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).
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
- (i), (ii) and (iii)
- (iii), (iv) and (v)
- (i), (ii), (iv) and (v)
- (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).
A group has 11 elements. The number of proper sub-groups it can have is
- 0
- 4
- 5
- 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.)
Which of the following techniques can be used to counter the problem of external fragmentation that occurs in dynamic partitioning memory management?
- Compaction
- Segmentation
- Swapping
- 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.
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
- 13
- 8
- 7
- 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.
In the process state transition diagram, transition from running to ready state indicates that
- the running process is preempted by a higher priority process
- the running process initiated an input/output operation
- the running process is blocked for a semaphore operation
- 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.
Which of the following activities is not done by memory management?
- Keep an account of which parts of memory are currently being used by each of the processes
- Decide which processes are to be brought into memory when memory space becomes available
- Allocate and de-allocate memory space as needed
- 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.
Which of the following statements is incorrect with regard to operating system design?
- Layered approach is easy to design and debug
- Layered approach is less efficient
- Changes to the kernel tend to be fewer with microkernel approach
- 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.
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?
- Stack
- Heap
- Shared Memory Segments
- 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.
Which of the following statements is incorrect with respect to threads?
- User-level threads are unknown by the kernel
- Kernel threads are more expensive
- User-level threads are more expensive
- 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.
Semaphore can be used for ________.
- detecting deadlock
- process synchronization
- process scheduling
- 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.
Which scheduler controls the degree of multiprogramming?
- Short-term scheduler
- Long-term scheduler
- Middle-term scheduler
- 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.
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?
- Causes starvation
- Causes livelock
- Causes a deadlock
- 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.
The number of address and data lines for a memory of 4K × 16 is:
- 12 and 16
- 10 and 16
- 12 and 12
- 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.
The instruction of a micro programmed control unit is called as
- micro-instruction
- micro-operation
- machine instruction
- 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.
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 Megabyte/sec
- 4 Megabytes/sec
- 8 Megabytes/sec
- 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.
In a memory-mapped I/O system, which of the following will not be there?
- LOAD
- IN
- OUT
- 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.
In signed-magnitude binary division, if the dividend is (11100)₂ and divisor is (10011)₂ then the result is
- (00100)₂
- (10100)₂
- (11001)₂
- (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.
How many RAM chips of size 8K×16 are required to build 1 Megabyte memory?
- 128
- 64
- 32
- 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.
How many 1's are present in 5×512+3×64+7×8+4
- 9
- 8
- 7
- 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.
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
- 2¹²⁸
- (2−2⁻²³)×2¹²⁸
- 2¹²⁷
- (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.
Listed below are some of the Operating System abstractions and related hardware components:
i. Thread p) Interrupt ii. Virtual Address Space q) Memory iii. File System r) CPU iv. Signal s) Disk Which of the following correctly relates the Operating System abstractions and related hardware components?
- i-p ii-q iii-r iv-s
- i-r ii-s iii-q iv-p
- i-r ii-q iii-s iv-p
- 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.
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?
- 4.76ns
- 40ns
- 40.76ns
- 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.
An interface that provides I/O transfer of data directly to and from the memory unit and peripheral is termed as
- DMA
- UART
- USRT
- 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.
Which of the following normal forms eliminates the anomalies of multivalued dependencies?
- 3NF
- BCNF
- 4NF
- 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.
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?
- Active→Partially Committed
- Active→Committed
- Active→Aborted
- 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.
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.
- R has no duplicate and S is non-empty
- R and S have no duplicates
- S has no duplicates and R is non-empty
- 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.
Let R = (A, B, C, D) and F = {A → B, A → C, BC → D}, then which of the following is correct?
- B → D
- A → B
- A → D
- 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.
Which one of the following relational algebra transformations is incorrect?
- σ_C1(σ_C1(R)) → σ_C2(σ_C2(R))
- σ_C(π_A(R)) → π_A(σ_C(R))
- σ_C(R ∪ S) → σ_C(R) ∪ σ_C(S)
- σ_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.
If relation R has m tuples and S has n tuples, what is the maximum and minimum number of tuples in R ⋈ S?
- m + n and 0
- mn and 0
- m + n and |m − n|
- 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.
The referential integrity rule requires that
- Every null foreign key value must reference an existing primary key value.
- It makes it possible for an attribute to have a corresponding value.
- Every non-null foreign key value must reference an existing primary key value.
- 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.
Which of the following statements is correct?
- Every relation in 2NF is also in BCNF
- Every relation in BCNF is also in 3NF
- No relation can be in both BCNF and 3NF
- 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.
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)
- T1→T2→T3
- T2→T1→T3
- T3→T1→T2
- 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.
Which one of the following file organization techniques provides very fast direct access?
- Hashed File Organization
- B-Tree Organization
- B+ Tree Organization
- 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.
Consider the following functions f(n) = 3n^√n g(n) = 2^(√n log₂n) h(n) = n!
- h(n)=O(f(n))
- h(n) is O(g(n))
- g(n) is not O(f(n))
- 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.
Which one of the following recurrence relation denotes the running time of selection sort algorithm.
- T(n) = 2T(n/2) + cn
- T(n) = T(n−1) + cn
- T(n) = T(n−1) + c
- 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.
Match the following:
a. Divide and Conquer i. Graph Coloring b. Dynamic Programming ii. Travelling Salesperson Problem c. Backtracking iii. Quicksort - a:iii; b:i; c:ii
- a:iii; b:ii; c:i
- a:ii; b:iii; c:i
- 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.
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
- (i) and (ii)
- (i) and (iv)
- (ii) and (iii)
- (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.
Which of the following statements is incorrect?
- If the output of one polynomial-time algorithm is fed into the input of another, the composite algorithm is polynomial
- Halting problem is NP-hard problem
- Travelling salesperson problem has a polynomial time algorithm
- 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.
Which one of the algorithms obtains global optimal solutions?
- Greedy algorithm
- Dynamic Programming
- Greedy algorithm and Dynamic Programming
- 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.
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.
- 3, 0, and 1
- 3, 3, and 3
- 4, 0, and 1
- 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.
What is the time complexity of depth first search traversal of a graph consisting of n vertices and m edges represented using adjacency list?
- O(n)
- O(m + n)
- O(n²)
- 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.
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?
- O(n)
- O(m + n)
- O(n²)
- 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.
The maximum window size for data transmission using selective reject protocol with n-bit frame sequence is
- 2ⁿ
- 2ⁿ⁻¹
- 2ⁿ − 1
- 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.
Which of the following is not a client-server application
- Internet chat
- Web browsing
- 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.
In Ethernet when Manchester encoding is used, the bit rate is
- Half the baud rate
- Twice the baud rate
- Same as the baud rate
- 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.
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?
- For shortest path routing between LANs
- For avoiding loops in the routing paths
- For fault tolerance
- 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.
Which of the following functionalities must be implemented by a transport protocol over and above the network protocol?
- Recovery from packet losses
- Detection of duplicate packets
- Packet delivery in the correct order
- 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.
An organization has a class B network and wishes to form subnets for 64 departments. The subnet mask would be:
- 255.255.0.0
- 255.255.64.0
- 255.255.128.0
- 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.
What is the maximum size of data that the application layer can pass on to the TCP layer below?
- Any size
- 2¹⁶ bytes-size of TCP header
- 2¹⁶ bytes
- 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.
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
- 172.57.88.62 and 172.56.87.233
- 10.35.28.2 and 10.35.29.4
- 191.203.31.87 and 191.234.31.88
- 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.
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
- Last fragment, 2400 and 2789
- First fragment, 2400 and 2759
- Last fragment, 2400 and 2759
- 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.
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?
- M1:HTTP m2: SMTP m3:POP
- m1:HSMTP m2: FTP m3:HTTP
- m1:SMTP m2: POP m3:HTTP
- 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.
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.6 sec
- 2 sec
- 5 sec
- 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.
The process of defining a problem in terms of few steps and then exploring each of the steps further is known as
- step-wise refinement
- modularization
- Integration
- 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.
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 endThe 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
- T1,T2,T3
- T2,T3
- T3,T4
- 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.
Which of the following statements is FALSE?
- HTTP runs over TCP
- HTTP describes the structure of web pages
- HTTP allows information to be stored in URL
- 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.
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:
- (2,2,3) and (2,3,2)
- (2,2,3) and (2,2,3)
- (2,3,2) and (2,3,2)
- (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.
The language represented by the regular expression 1*01* + 1* + 1*01*01* is
- All strings over {0,1} which contains exactly one zero
- All strings over {0,1} which contain at least two zeros.
- All strings over {0,1} which contain at most two zeros
- 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.
In CSMA/CD, after the 4th collision, what is the probability that the node will attempt to retransmit immediately?
- 0.0625
- 0.5
- 0.125
- 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.
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?
- 100
- 4
- 32
- 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.
Which of the following statements is incorrect?
- Every recursively enumerable language is recursive
- The union of two recursively enumerable languages is recursively enumerable
- The union of two recursive languages is recursive enumerable language
- 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.
The entity integrity rule requires that
- All primary key entries are unique
- A part of the key may be null
- Foreign key values do not reference primary key values
- 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.
Let L₁ = {ba, ab}, L₂ = {a, b} be two languages, then the length of the minimum string in L₁L₂* is
- 0
- 1
- 2
- 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.
Number of strings in the language represented by the Regular expression (0 + 1)(0 + 1)1(0 + 1) is
- 4
- 6
- 8
- 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.
The chromatic number of null graph Nₙ is
- 0
- 1
- 2
- 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.
Booth's algorithm is used to ____ signed numbers (2's complement)
- add
- subtract
- multiply
- 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.
A connected graph contains 'n' vertices and 'm' edges then circuit rank is
- n−m
- m−(n−1)
- n−(m−1)
- 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.
A connected planar graph has 35 regions with degree 6 each, then number of vertices is____
- 35
- 70
- 72
- 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.
Which of the following minimal spanning tree algorithm assures connectivity of tree at all steps?
- Kruskal
- Prims
- Both Kruskal and Prims
- 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.
If G is a connected plane graph with E edges, V vertices and R regions, then the following is true
- |V| − |E| = 2
- |V| − |E| + |R| = 1
- |V| − |E| = 2 + |R|
- |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.
The minimum number of colours required to colour any connected planar graph is
- 3
- 4
- 5
- 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.
The number of ways of placing 7-similar balls in 5 distinct boxes is
- C(11,7)
- C(12,7)
- C(11,5)
- 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.
The number of ways of forming 5-member committee consisting of 2 girls and 3 boys from 10 girls and 20 boys
- C(10,2)+C(20,3)
- P(10,2)+P(20,3)
- P(10,2)P(20,3)
- 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.
How many terms will be there in the expansion of (x + y + z)⁶
- 15
- 28
- 35
- 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.
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?
- 23131
- 11231
- 33211
- 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.
Which one of the following is the loader function accomplished by the programmer, in an absolute loading scheme? (i) Allocation (ii) Linking (iii) Reallocation
- Both (i) and (ii)
- (i) only
- (ii) only
- (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.
Which one of the following statements is correct?
- In operator precedence parsing precedence relations are defined for every pair of a non-terminal
- In operator precedence parsing, precedence relations are defined for every pair of a terminal
- In operator precedence parsing, precedence relations are defined to delimit the handle
- 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.
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
- (i) only
- (ii) only
- (iii) only
- (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.
Which of the following is the most powerful parser?
- SLR
- LALR
- Canonical LR
- 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.
A top down parser generates ________
- Right-most derivation
- Right-most derivation in reverse
- Left-most derivation
- 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.
Which one of the following statements is correct with respect to the grammar give below? S → 1A | 1B A → 1 B → 1
- LL(1) and LR(1)
- LL(1) but not LR(1)
- LR(1) but not LL(1)
- 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.
Which one of the following statements is correct with respect to the grammar given below?
E → E + T F T → T * F F F → id
- Both + and * are right associative
- Both + and * are left associative
- + is left associative but * is right associative
- * 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.
Which of the following statement is true about Push Down Automata(PDA)?
- PDAs recognize Context-sensitive Languages
- PDAs recognize Context-free Languages
- PDAs recognize Type 1 Languages
- 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.
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.
- It is Context Sensitive
- It is Context free
- It is type 0 grammar
- 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.
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.
- 1000 MIPS
- 10 MIPS
- 100 MIPS
- 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.
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
- dangling pointer
- side effect
- null pointer
- 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.
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?
- 2c(a+b)
- 2c²(a+b)
- c(a²+b²)
- 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.
Which of the following is a top-down parser?
- Predictive recursive descent
- Shift-reduce
- Canonical LR(1)
- 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.
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?
- 4,2
- 5,2
- 5,3
- 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.
List of objects together with the operations allowed on these objects is called ________.
- Capability list
- access list
- available list
- 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.
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
- 2
- 3
- 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.
Which of the following tree need not be a binary tree
- BST
- AVL
- Heap
- 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.
Which data structure is used to implement radix sort
- Stacks
- Queue
- Linked list
- 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.
Which of the following sorting algorithm does not have worst case time complexity of O(n²)
- Bubble Sort
- Quick Sort
- Insertion Sort
- 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.
A decimal number has 25 digits. The number of bits needed for its equivalent binary representation is, approximately_______.
- 50
- 60
- 75
- 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.
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?
- 5,20,5
- 4,4,1
- 5,20,1
- 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.
According to the precedence defined in the C language, arrange the operators ., ||, <, = in the ascending order of precedence.
- ., ||, <, =
- =, <, ||, .
- =, ||, <, .
- <, ||, =, .
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.
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 2 4 5
- 1 2 4
- 2 4 5
- 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.
If n has the value 3, then the statement a[++n]=n++ results in _____
- a[5]=3
- a[5]=4
- a[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.
Aliasing in the context of programming languages refers to
- Multiple variables having the same memory location
- Multiple variables having the same value
- Multiple variables having the same identifier
- 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.
Error detection at the data link level is achieved by
- bit stuffing
- cyclic redundancy codes
- hamming codes
- 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.
In the carrier sense network if the prevailing condition is a 'channel busy', then which of the following statements is correct?
- Non-persistent CSMA results in randomized wait and sense
- With 1-persistent CSMA, the channel is continually sensed
- p-persistent CSMA results in randomized retransmission
- 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.
The average time required to perform a successful sequential search for an element in an array A(1:n) is given by
- (n+1)/2
- log₂n
- n(n+1)/2
- 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.
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?
- 23 14 24
- 23 1 1
- 13 1 1
- 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.
Average successful search time taken by binary search on a sorted array of 10 items is
- 2.6
- 2.7
- 2.8
- 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.
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.
- O(m)
- O(n)
- O(m+n)
- 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.
The number of binary trees with 3 nodes which when traversed in post-order gives the sequence A, B, C is
- 3
- 9
- 7
- 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.
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
- 50.2
- 6.7
- 72.7
- 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.
What is the disadvantage of spiral model?
- It is inefficient for smaller projects
- High amount of risk analysis
- Strong approval and documentation control
- 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.
In software engineering, acceptance testing is also known as
- black-box testing
- white-box testing
- Alpha testing
- 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.
Cohesion is a qualitative indication of the degree to which a module
- can be written more compactly
- focuses on just one thing
- is able to complete its function in a timely manner
- 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.
Cyclomatic complexity is related to which of the following testing methods?
- White-box
- Black-box testing
- White-box and black-box testing
- 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.
A sufficient condition that a triangle T be a right triangle is that a² + b² + = c². An equivalent statement is
- If T is a right triangle then a² + b² = c²
- If a² + b² = c² then T is a right triangle
- T is a right triangle only if a² + b² = c²
- 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.
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)
- People who are in need of refuge and consolation are not apt to do odd things
- People are apt to do odd things if and only if they are in need of refuge and consolation
- People who are apt to do odd things are in need of refuge and consolation
- 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.
Which of the following statements is correct?
- A ripple counter is an asynchronous counter.
- In an asynchronous counter, each state is clocked by the same pulse
- An asynchronous decade counter increases its value by ten for each clock pulse
- 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.
Which one of the following statements is correct?
- Abstraction is the classification of objects, grouped according to their significant similarities
- Abstraction is the classification of objects, grouped according to their significant differences
- Abstraction is the classification of objects, grouped according to their names
- 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.
If the given function isknown only at some selected points, which method you would use to solve the differential equation.
- Euler method
- modified Euler method
- Runge-Kutte Method
- 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.
XML validated against a ____ is a valid XML
- DTD
- JQUERY
- CFG
- 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.
Consider the logical statement q → (p → q) Which of the following statements is true about the above statement?
- It is a Contradiction.
- It is a Tautology
- It is not a well formed statement
- 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.
The mean of the distribution whose probability density function f(x) = {αe^(−αx), x ≥ 0; 0, x < 0} is
- 0
- 1
- 1/α
- α
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.
For a poisson distribution
- Mean = standard deviation
- Mean = variance
- Mean = mean deviation
- 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.
The Eigen values of a matrix are 1,2,−1 then the sum of Eigenvalues of the inverse of that matrix are
- 0
- 1/2
- 2
- 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.
The possible Eigenvector of the matrix
3 0 −2 0 2 0 −2 0 0 corresponding to one of its Eigen value (-1) is
- [1, 1, 1]ᵀ
- [1, 0, 2]ᵀ
- [−1, 0, 12]ᵀ
- [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.
In the LU factorization method, to solve the system of equations AX=B, we solve the system of equations in the order
- First UX=Y and then LY=B
- First LY=B and then UX=Y
- First LY=X and then UY=B
- 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.
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
- Newton-Raphson method
- Bisection method
- Secant method
- 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.
If f(x) = (e^(1/x) − 1)/(e^(1/x) + 1) for x ≠ 0, f(0) = 0 then at x=0 f(x) is
- continuous
- discontinuous
- differentiable
- 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.
If y = √(x + √(x + √(x……..∞))), then dy/dx =
- 1/y
- 1/x
- 1/(2x−1)
- 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.
∫₋₁¹ (x − [2x]) dx =
- 1
- 0
- 2
- 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.
Consider the following C declaration
int (*f)();
Which of the following statements correctly interprets the above declaration?
- f is a function which returns an integer
- f is a function which returns a pointer to an integer
- f is a function to pointer which returns an integer
- 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.
Which of the following statements is false about DNS?
- DNS uses TCP for its implementation
- DNS uses both TCP and UDP for its implementation.
- DNS is implemented as a distributed database system.
- 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.
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.
- p->nextptr=q; q->nextptr=p;
- p->nextptr=q; q->nextptr=p->nextptr;
- q->nextptr=p->nextptr; p->nextptr=q;
- 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.
A bit string, 0111101111101111110, needs to be transmitted at the data link layer. What is the string actually transmitted after the bit stuffing?
- 011110111110011111100
- 011110111110011111010
- 011110111110111111000
- 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.
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?
- S ≤ 160
- S ≥ 160
- 80 ≤ S ≤ 160
- 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.
Which of the following sliding window protocols has the receiver window size more than 1?
- Stop-and-wait protocol
- One-bit window protocol
- Go-Back-N protocol
- 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.
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?
- 10⁶ bits
- 64 bytes
- 1250 bytes
- 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.
Which one of the following statements is incorrect about Count-to-infinity problem?
- It reacts rapidly to good news
- It reacts slowly to good news
- It reacts leisurely to bad news
- 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.
A network on the Internet has a subnet mask of 255.255.240.0. What is the maximum number of hosts it can handle?
- 4096
- 3556
- 4080
- 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.
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?
- 1024KB, 256KB
- 1KB, 128KB
- 1KB,256KB
- 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.
Dynamic Host Configuration Protocol (DHCP) is used to:
- assign CIDR subnet masks to routers
- allocate the host part of an IP address to a host
- assign the network component of an IP address to a router
- 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.