Quiz-summary
0 of 116 questions completed
Questions:
- 1
- 2
- 3
- 4
- 5
- 6
- 7
- 8
- 9
- 10
- 11
- 12
- 13
- 14
- 15
- 16
- 17
- 18
- 19
- 20
- 21
- 22
- 23
- 24
- 25
- 26
- 27
- 28
- 29
- 30
- 31
- 32
- 33
- 34
- 35
- 36
- 37
- 38
- 39
- 40
- 41
- 42
- 43
- 44
- 45
- 46
- 47
- 48
- 49
- 50
- 51
- 52
- 53
- 54
- 55
- 56
- 57
- 58
- 59
- 60
- 61
- 62
- 63
- 64
- 65
- 66
- 67
- 68
- 69
- 70
- 71
- 72
- 73
- 74
- 75
- 76
- 77
- 78
- 79
- 80
- 81
- 82
- 83
- 84
- 85
- 86
- 87
- 88
- 89
- 90
- 91
- 92
- 93
- 94
- 95
- 96
- 97
- 98
- 99
- 100
- 101
- 102
- 103
- 104
- 105
- 106
- 107
- 108
- 109
- 110
- 111
- 112
- 113
- 114
- 115
- 116
Information
The quiz will load in 5 seconds, if not click on “Start Quiz” button below
You have already completed the quiz before. Hence you can not start it again.
Quiz is loading...
You must sign in or sign up to start the quiz.
You have to finish following quiz, to start this quiz:
Results
0 of 116 questions answered correctly
Your time:
Time has elapsed
You have reached 0 of 0 points, (0)
Categories
- Not categorized 0%
- 1
- 2
- 3
- 4
- 5
- 6
- 7
- 8
- 9
- 10
- 11
- 12
- 13
- 14
- 15
- 16
- 17
- 18
- 19
- 20
- 21
- 22
- 23
- 24
- 25
- 26
- 27
- 28
- 29
- 30
- 31
- 32
- 33
- 34
- 35
- 36
- 37
- 38
- 39
- 40
- 41
- 42
- 43
- 44
- 45
- 46
- 47
- 48
- 49
- 50
- 51
- 52
- 53
- 54
- 55
- 56
- 57
- 58
- 59
- 60
- 61
- 62
- 63
- 64
- 65
- 66
- 67
- 68
- 69
- 70
- 71
- 72
- 73
- 74
- 75
- 76
- 77
- 78
- 79
- 80
- 81
- 82
- 83
- 84
- 85
- 86
- 87
- 88
- 89
- 90
- 91
- 92
- 93
- 94
- 95
- 96
- 97
- 98
- 99
- 100
- 101
- 102
- 103
- 104
- 105
- 106
- 107
- 108
- 109
- 110
- 111
- 112
- 113
- 114
- 115
- 116
- Answered
- Review
-
Question 1 of 116
1. Question
The system of equations x + 5y +3z = 0, 5x + y – z = 0, x + 2y + z = 0 has
-
Question 2 of 116
2. Question
The function f (x, y) = x3 + y3 – 3axy, (a> 0) is maximum at
-
Question 3 of 116
3. Question
If u= ax + by and v = cx + dy then ∂(u, v)/ ∂(x, y) =
-
Question 4 of 116
4. Question
Let f: Z → Z be a function defined by f (x) = 2x + 3. Let g: Z → Z be a function defined by g (x) = 3x + 2, then fog is
-
Question 5 of 116
5. Question
The dual of the Boolean statement a + (á .b) = a + b is
-
Question 6 of 116
6. Question
Two persons A and B independently solve a problem with probability 0.6 and 0.8 respectively, then the probability that at least one of them solves the problem is
-
Question 7 of 116
7. Question
The variance of a uniform distribution f(x) = 1/ (b – a), a ≤ x ≤ b and 0 otherwise is
-
Question 8 of 116
8. Question
Which of these numerical methods is of second order convergence?
-
Question 9 of 116
9. Question
For which of these numerical integration methods the interval should be divided into even number of subintervals?
-
Question 10 of 116
10. Question
While computing the nth Fibonacci number F(n) through recursion, the number of leaf nodes in the tree of recursive calls is equal to
-
Question 11 of 116
11. Question
Which of the following statements best relates the corresponding growth rates of execution time to its efficiency class?
-
Question 12 of 116
12. Question
Which of the following is applied to resolve collisions without cluster formation in a hash table?
-
Question 13 of 116
13. Question
The best case time complexity of simple insertion sort algorithm is
-
Question 14 of 116
14. Question
The number of multiplications required to multiply two ‘n ×n’ matrices using Strassen’s method with Divide and conquer strategy belongs to
-
Question 15 of 116
15. Question
The recurrence equation for finding number of comparisons required for identifying the kth order statistic in a list of n numbers by partitioning it using decrease and conquer approach is
-
Question 16 of 116
16. Question
The number of distinct binary search trees possible to accommodate a given collection of 6 keys is equal to
-
Question 17 of 116
17. Question
Which algorithm design strategy is used in Warshall’s algorithm for finding transitive closure of a graph?
-
Question 18 of 116
18. Question
In graph theory which of the following algorithms uses the ADT ‘collection of disjoint subsets of a set’ for dynamic partitioning of vertices?
-
Question 19 of 116
19. Question
Finding the most valuable subset of n items of a given integer weights and values that fit into a knapsack of a given capacity is known as Knapsack problem. It is clarified into the set of
-
Question 20 of 116
20. Question
With regard to computational complexity classes of problems (P and NP) which of the following statements is correct?
-
Question 21 of 116
21. Question
The recurrence equation for the number of disc movements required for Towers of Hanoi problem using recursion is
-
Question 22 of 116
22. Question
Which of the following data structure is most suitable to represent a priority queue?
-
Question 23 of 116
23. Question
Which of the following data structure is most suitable for representing arithmetic expressions involving repeated sub-expressions?
-
Question 24 of 116
24. Question
Which of the following data structure supports traversal of a dynamic list in both the directions?
-
Question 25 of 116
25. Question
If the postorder sequence of nodes of a binary search tree is 30, 23, 36, 68, 48 which of the following sequence of nodes corresponds to its preorder sequence?
-
Question 26 of 116
26. Question
The type of binary tree structure suitable for Huffman coding is
-
Question 27 of 116
27. Question
The number of swaps (exchanges) required to sort the list containing 42, 63, 54, 38, 84 using Bubble sort algorithm is
-
Question 28 of 116
28. Question
In C programming the elements of a multi-dimensional array are stored in contiguous memory locations in
-
Question 29 of 116
29. Question
In C programming self referencing structures are essential to implement
-
Question 30 of 116
30. Question
In C programming, if ‘x’ is declared as ‘astatic int x = 1’ in a function ‘foo’
-
Question 31 of 116
31. Question
In C programming, a variable ‘arr’ is declared as ‘float arr[5][5][5]’. Which of the following expressions refers to the base address of the 4th row in 0th matrix?
-
Question 32 of 116
32. Question
In C programming, which of the following mode strings is used in ‘fopen’ statement to open a text file for update?
-
Question 33 of 116
33. Question
In C programming, which of the following ‘format specifier’ is used to read a hexadecimal integer using a ‘scanf’ statement?
-
Question 34 of 116
34. Question
The problem of finding whether a given graph has a path that starts and ends at the same vertex while passing through all other vertices of the graph exactly once is called
-
Question 35 of 116
35. Question
With reference to Inter-process Communication which of the following is the name of the indivisible operation to read the contents of a memory location into a register followed by storing a non-zero value into the memory location read
-
Question 36 of 116
36. Question
The situation in which each process in a set of processes is waiting for an event to be caused by another process in the same set is referred to as
-
Question 37 of 116
37. Question
Which of the following is used in Unix operating system to maintain the index of the disc blocks used for storing a file?
-
Question 38 of 116
38. Question
When Round robin algorithm is used for CPU scheduling, if the time quantum for context switching is large, the performance becomes similar to that of
-
Question 39 of 116
39. Question
With reference to acyclic graph (file) directories implementation of which of the following file operators requires ‘reference count’ to maintain the number of file shares?
-
Question 40 of 116
40. Question
Which of the following problems is associated with multiple contiguous variable partition (MVT) allocation?
-
Question 41 of 116
41. Question
Name the memory management scheme that handles very large address spaces containing pages by keeping only relevant portions of page table in RAM
-
Question 42 of 116
42. Question
Which of the following memory management schemes provides the most appropriate level of protection and sharing for the users data and code?
-
Question 43 of 116
43. Question
If the probability of page fault is 0.0001 and average page fault service time is 500 times more than the memory access time, the percentage degradation of effective memory access time due to demand paging is
-
Question 44 of 116
44. Question
Which of the following algorithms is a drum/fixed head device scheduling algorithm?
-
Question 45 of 116
45. Question
A cycle in the resource allocation graph that includes claim edges to indicate possible need of a resource suggests that the system is in
-
Question 46 of 116
46. Question
As a consequence of improper sequencing of the semaphore operators, P and V, in one or more processes in a set of concurrent processes, the system may experience
-
Question 47 of 116
47. Question
The cryptographic system that process the input to produce output one element at a time as long as the input continues is a categorized as
-
Question 48 of 116
48. Question
Digital signatures are not used to impose the
-
Question 49 of 116
49. Question
In a packet switching network (PSN) the drawback of applying end-to-end encryption of packets is that
-
Question 50 of 116
50. Question
A firewall is capable of protecting the network against the
-
Question 51 of 116
51. Question
Attack on high profiles servers with spurious requests and massages to overload the network is known as
-
Question 52 of 116
52. Question
The sum of the first 7 terms of the series of cubes of natural numbers is
-
Question 53 of 116
53. Question
The number of 7 letter permutations that can be formed from the letters of the word ‘COMMUTE’ is
-
Question 54 of 116
54. Question
How many ways can a committee of 5 members be formed from 8 workers and 5 managers such that at least 2 managers should be there in the committee?
-
Question 55 of 116
55. Question
The number 4860 is divisible (without remainder) by how many integers?
-
Question 56 of 116
56. Question
Which of the following determines the number of independent paths in the flow graph of a module used for testing a module of software being developed?
-
Question 57 of 116
57. Question
Which of the following is most suitable for estimating the total effort required for software development in terms of person-months?
-
Question 58 of 116
58. Question
During system design phase of software development, the criteria for module design is that the overall system should have
-
Question 59 of 116
59. Question
Which of the following is the limitation of waterfall model for large software development?
-
Question 60 of 116
60. Question
Canonical representation of graphs is preferred for the purpose of finding whether two graphs are
-
Question 61 of 116
61. Question
The value of the maximum flow in a network represented as a weighted di-graph with specially designated source and sink vertices is equal to
-
Question 62 of 116
62. Question
Which of the following scenarios may lead to an irrecoverable error in a database system?
-
Question 63 of 116
63. Question
Relational Algebra is a
-
Question 64 of 116
64. Question
Given the set of functional dependencies B->C, C->A, B->D for the relational schema R (A, B, C, D). Which of the following decompositions has dependency preserving property?
-
Question 65 of 116
65. Question
A check pointing system is needed
-
Question 66 of 116
66. Question
In entity relationship modeling representing the concept – ‘teacher teaches course’, attributes of the relationship “teaches” should be
-
Question 67 of 116
67. Question
Which of the following is not a transaction management SQL command?
-
Question 68 of 116
68. Question
A relation Remp is defined with attributes Remp (empcode, name, street, city, state, pincode). Empcode is the primary key. For any pincode, there is only one city and state. Also, for given street, city and state, there is just one pincode. In normalization terms, Remp is a relation in
-
Question 69 of 116
69. Question
Which of the following recovery technique does not need logs?
-
Question 70 of 116
70. Question
The file organization that provides very fast access to any arbitrary record of a file is
-
Question 71 of 116
71. Question
A data dictionary is a special file that contains
-
Question 72 of 116
72. Question
Which of the operations constitute a basic set of operations for manipulating relational data?
-
Question 73 of 116
73. Question
Which of the following device interface is used to connect high speed HDDs, scanners, printers, etc. to the host computer in hot pluggable manner?
-
Question 74 of 116
74. Question
Which of the following suffices to convert an arbitrary CFG to an LL (1) grammar?
-
Question 75 of 116
75. Question
The grammar S→SS, S→(S), S→( ), S→t is
-
Question 76 of 116
76. Question
Which of the following statements is False?
-
Question 77 of 116
77. Question
In a bottom-up evaluation of a syntax directed definition, inherited attributes can
-
Question 78 of 116
78. Question
In a programming language, an identifier is permitted to be a letter followed by any number of letters or digits. If L and D denote the set of letters and digits respectively, which of the following expressions defines an identifier?
-
Question 79 of 116
79. Question
Which of the following techniques is used to replace run-time computations by compile time computations?
-
Question 80 of 116
80. Question
In operator Precedence parsing precedence relations are defined
-
Question 81 of 116
81. Question
Which of the following algorithms corresponds to the pre\order traversal of nodes of an undirected graph?
-
Question 82 of 116
82. Question
A shift reduce parser carries out the actions specified within braces immediately after reducing with the corresponding rule of a grammar
S-> xxW{print “1”}
S-> Y {print “2”}
S-> Sz {print “3”}What is the translation of XXXXYZZ using the syntax directed translation scheme described by the above rules?
-
Question 83 of 116
83. Question
If G is a CFG w is a string of length “I” in L(G), how long is a derivation of w in G, if G is a Chomsky normal form?
-
Question 84 of 116
84. Question
Which of the following is true for the language {ap | p is a prime}?
-
Question 85 of 116
85. Question
A minimum state deterministic finite automaton accepting the language
L = {w|w € {0,1}*, number of 0s and 1s in w are divisible by 3 and 5 respectively} has
-
Question 86 of 116
86. Question
Consider the following grammar
G: S → bS | aA | b
A → bA | aB
B → bB | aS | aLet Na (w) and Nb (w) denote the number of a’s and b’s in string w respectively. The language L(G) {a, b} + generated by G is
-
Question 87 of 116
87. Question
The language accepted by this automaton is given by the regular expression
-
Question 88 of 116
88. Question
The main function of a browser is to
-
Question 89 of 116
89. Question
Which of the following calls a JavaScript function when the cursor passes over an image?
-
Question 90 of 116
90. Question
Which language is called client-side scripting language?
-
Question 91 of 116
91. Question
Which of the following is stored on a client and contains state information?
-
Question 92 of 116
92. Question
The minimum number of timing signals required to fetch an instruction for executing it is
-
Question 93 of 116
93. Question
How many memory references are needed to bring a storage operand into the accumulator while processing a direct address instruction?
-
Question 94 of 116
94. Question
The hardware priority interrupt scheme implemented using serially connected I/O devices is called
-
Question 95 of 116
95. Question
A hypothetical system is designed with a 64K × 16RAM and two-way set associative cache memory of size 1024 cache memory words. The length of each cache word is
-
Question 96 of 116
96. Question
Which of the following components are most essential for designing Binary Counters?
-
Question 97 of 116
97. Question
In two-wired hand shaking method of asynchronous data transfer the following control lines are used
-
Question 98 of 116
98. Question
In floating point arithmetic which of the following operations does not require mantissa alignment?
-
Question 99 of 116
99. Question
The hexadecimal equivalent to octal number ‘35425’ is
-
Question 100 of 116
100. Question
The binary equivalent representation for the decimal number ’12.875’ is
-
Question 101 of 116
101. Question
Which of the following is the 8 bit signed-2’s complement representation of the negative decimal number ‘–99’?
-
Question 102 of 116
102. Question
Which of the following code provides 9’s complement of a number by simple bit inversion (logical complementation)?
-
Question 103 of 116
103. Question
Which of the following component is used to generate timer signals at pre-specified time intervals?
-
Question 104 of 116
104. Question
Which of the following component is used as ‘parallel-to- serial converter’?
-
Question 105 of 116
105. Question
Which Logic circuit would you use for addressing memory?
-
Question 106 of 116
106. Question
A Single bit full adder can be designed using
-
Question 107 of 116
107. Question
In the IPv4 addressing format, the number of networks allowed under Class C addresses is
-
Question 108 of 116
108. Question
11001001 is the message to be sent to destination using the CRC polynomial 3x + 1 to protect it from errors. The message that should be transmitted is:
-
Question 109 of 116
109. Question
Station A needs to send a message consisting of 9 packets to Station B using a sliding window (window size 3) and go-back-n error control strategy. All packets are ready and immediately available for transmission. If every 5th packet that A transmits gets lost, but no ‘ack’ from B is lost, then what is the number of packets that A will transmit for sending the message to B?
-
Question 110 of 116
110. Question
An organization has a class B network and wishes to form subnets for 64 departments. The subnet mask would be:
-
Question 111 of 116
111. Question
In a network of LANs connected by bridges, packets are sent from one LAN to another through intermediate bridges. Since more than one path may exist between two LANs, packets may have to be routed through multiple bridges. Why is the spanning tree algorithm used for bridge-routing?
-
Question 112 of 116
112. Question
Station A uses 32 byte packets to transmit messages to Station B using a sliding window protocol. The round trip delay between A and B is 80 milliseconds and the bottleneck bandwidth on the path between A and B is 128 kbps. What is the optimal window size that A should use?
-
Question 113 of 116
113. Question
In Ethernet when Manchester encoding is used, the bit rate is:
-
Question 114 of 116
114. Question
What is the maximum size of data that the application layer can pass on to the TCP layer below?
-
Question 115 of 116
115. Question
If link transmits 4000 frames per second, and each slot has 8 bits, the transmission rate of circuit this TDM is
-
Question 116 of 116
116. Question
An ATM cell has the payload field of