Here Total Question: 100
To show all question with answer click: See Answer or take exam
1. Which one is not an ACID property?
2. Which of the following is a guided transmission medium?
3. In C, to retain the values of variables between function calls, we should use:
4. Thrashing in memory management occurs when:
5. _____ is used to store web addresses for future use?
6. Which one is false with respect to a VLAN?
7. In virtual memory, TLB is used to:
8. A router processes packets at 1 Gbps; if 10 packets (1200 bytes each) arrive at once, queuing delay for the 10th packet is:
9. _____ method is a first order optimization method.
10. Which criterion is not mandatory for a solution of critical section problem?
11. For a n-element min-Heap:
12. Cache hit rate = 80%; cache access time = 5 ns; memory access time = 50 ns. Effective access time is:
13. What will be the time complexity of the following algorithm?
sum = 0;
for (i=1; i <= n; i=i*2)
for (j=1; j<n; j++)
sum+=i*j;
14. 114. What output will be generated by the compiler after lexical and syntax analyses, respectively?
15. Which one is a compile time polymorphism?
16. A relation R on a set B is an equivalence relation if it is:
17. _____ operates at the network layer and is used to connect different networks?
18. The chromatic index of a bipartite graph with at least one e
19. Which loop is an exit-controlled loop?
21. For BFS of a graph, we should use:
22. In Agile, backlog refers to the list of:
23. _____ uses disk space as an extension of RAM.
24. Newton's backward interpolation formula is most effective when:
25. The address block 192.168.16.0/20 contains _____ IP addresses.
26. In Huffman coding, the algorithm repeatedly picks two nodes and merges those two nodes that are:
27. Direct Memory Access allows:
28. _____ testing is performed without knowledge of internal implementation.
29. Which one is not an addressing mode?
30. Assuming P1, P2, P3 have burst time 6, 8, 3 ms respectively, which statement is true about SJF?
31. Using _____ order we can delete tree nodes in such a way that a child node is deleted before its parent.
32. During a phone conversation, which mode of communication takes place?
33. A priority queue is best implemented using a:
34. Which protocol is used to send an email over the Internet?
35. What does the 'continue' statement do inside a loop?
36. In Agile, software is delivered:
37. Intel 8086 (16-bit) microprocessor has a _____ bit address bus.
38. OS system calls perform the following basic operations on files:
39. The bisection method is used to:
40. In an array-based implementation of a complete binary tree (zero-based indexing), the index of left child of node at index i is:
41. Which optimization technique is not used for eliminating redundant codes?
42. Which register in a CPU points to the next instruction to be executed?
43. _____ layer of the TCP/IP model is responsible for port binding.
44. The main difference between a latch and a flip-flop is
45. Which phase in compiler design performs data type checking?
46. Which one below is an example of a NoSQL database?
47. The space complexity of a recursive algorithm is mainly due to:
48. What is the role of an index in a database?
49. _____ is a non-preemptive algorithm.
50. Which one below is an iterative method?
52. A page fault occurs when:
53. OSI _____ Layer establishes, manages & terminates logical connections between applications.
54. Which of the following is the simplified version of boolean function F = Y'(X + X'Y)?
55. Which one is true for a DFA?
56. _____ combines multiple signals over a single medium by assigning different time slots.
57. Data _____ is the ability to modify a schema definition in a level without affecting the next higher level.
58. In OOP, _____ is used to restrict access to certain details of an object.
59. Garbage collection is required in SSD because:
60. Which one is a supervised learning algorithm?
61. Contrapositive of "If it rains, the home team wins":
62. Pushdown automata (PDA) is equivalent in power to:
63. OSI model Data Link Layer's primary function:
64. Which command can we use to save all transactions?
65. Intel 8085 microprocessor is a _____ bit microprocessor.
66. "Either all of its operations are executed or none." refers to:
67. Interrupt-driven I/O is preferred over polling because it:
68. What is the output of the following C code?
#include
int main() {
int arr[5]={1,2,3,4,5};
int *p = (arr+2);
printf("%d", p[-1]);
return 0
}
69. In machine learning, supervised learning means:
70. A 16-bit address bus can address a maximum of _____ KB memory.
71. A* search algorithm is:
72. To solve a problem using recursion we should use a:
73. _____ sort uses a divide and conquer approach?
74. Which of the following is a combinational circuit?
75. The number of binary strings of length 5 is:
76. A half-adder circuit has:
77. _____ reduces redundancy and improves integrity.
78. Which one is correct to declare & initialize array in C?
79. A complete graph of n vertices has _____ edges.
80. _____ algorithm is used to find shortest path in a positive weighted graph.
81. The register SP in a microprocessor:
82. Consider 3 processes and 2 resources... minimum additional resource units to avoid deadlock:
83. UDP is a _____ protocol.
84. Which of the following is not a characteristic of Dynamic Programming?
85. _____ is used in C to write a single character to a file.
86. What is the hexadecimal value of (1111101)₂?
87. The minimum number of NAND gates required to implement an OR gate is:
88. Which data structure allows insertion at one end and deletion at the other end?
89. Which protocol is used together with HTTP in HTTPS?
90. _____ refers to information about data.
91. Principle of Locality helps to:
92. Adaptive maintenance is required when:
93. Alpha-Beta pruning can:
94. Which one is true for a B+ tree?
95. Which will delete all records but keep table structure?
96. Which is a numerical method for eigenvalue problems?
97. _____ replaces the page not used for the longest time.
98. Greedy methods guarantee optimal solution when:
99. For a connected acyclic graph with v vertices and e edges:
100. Find the output of the following code snippet:
#include #define MULTIPLY(a,b) a/b int main() { int x = 5, y = 2, result;
result = MULTIPLY(y+x, y+x); printf("%d", result); return 0; }
