| Q# | Question | Answer | Marks |
|---|---|---|---|
| Q2 | Match List I with List II LIST I LIST II | 3 | +2.0 |
| Q11 | Match List I with List II LIST I LIST II | 2 | +2.0 |
| Q29 | Consider the following statements about heap sort algorithm: A. The MAX-HEAPIFY procedure which | 2 | +2.0 |
| Q56 | Given below are two statements: Let f(n) and g(n) be asymptotically positive functions. The foll | 1 | +2.0 |
| Q74 | A. If some NP-complete problem P is in ℙ that ℙ = ℕℙ B. TSP is in ℕℙ C. SAT is in ℕℙ D. Ha | 1 | +2.0 |
| Q89 | Given below are two statements: Statement I: If f and g are two functions and f = O(g) but g & | 2 | +2.0 |
| Q# | Question | Answer | Marks |
|---|---|---|---|
| Q1 | Which of the following is not a solution representation in a genetic algorithm? 1. Binary valued | 4 | +2.0 |
| Q8 | Given below are two statements: Statement I: Fuzzifier is a part of a fuzzy system Stateme | 1 | +2.0 |
| Q35 | Match List I with List II LIST I LIST II | 3 | +2.0 |
| Q39 | Given below are two statements: one is labelled as Assertion A and the other is labelled as Reason | 3 | +2.0 |
| Q54 | Which is not the component of the natural language understanding process? | 4 | +2.0 |
| Q60 | Which of the following is not a mutation operator in a genetic algorithm? A. Random resetting | 4 | +2.0 |
| Q76 | Consider the following statements A. C-Fuzzy means clustering is a supervised method of learning | 2 | +2.0 |
| Q98 | Which of the following is not a property of a good system for representation of knowledge in a parti | 1 | +2.0 |
| Q# | Question | Answer | Marks |
|---|---|---|---|
| Q5 | The clipping process in computer graphics is used for | 4 | +2.0 |
| Q20 | Which of the following transforms in 2 dimension is used to resize a 2-dimensional object? | 3 | +2.0 |
| Q58 | Match List I with List II LIST I LIST II | 3 | +2.0 |
| Q64 | Southerland Hodgeman method is used on | 3 | +2.0 |
| Q71 | Consider the rectangle with vertices (0, 0), (0, 2), (3, 0), (3, 2). There is scaling of 2 towards x | 3 | +2.0 |
| Q# | Question | Answer | Marks |
|---|---|---|---|
| Q23 | Consider a popular sports news site. At a given moment, 20,000 concurrent users submit a request (a | 2 | +2.0 |
| Q24 | A TCP server application is programmed to listen on port P on host S. A TCP client is connected to | 1 | +2.0 |
| Q68 | In the standard Ethernet with transmission rate of 10 Mbps, asssume that the length of the medium is | 2 | +2.0 |
| Q70 | Match List I with List II LIST I LIST II | 3 | +2.0 |
| Q83 | Match List I with List II LIST I LIST II | 2 | +2.0 |
| Q84 | 📄 What is the efficiency of this datagram? | 1 | +2.0 |
| Q85 | 📄 What is the protocol of the payload being carried by the packet? | 3 | +2.0 |
| Q86 | 📄 What is the size of datagram? | 3 | +2.0 |
| Q87 | 📄 How many more routers can the packet travel to? | 4 | +2.0 |
| Q91 | 📄 What is the header size ? | 2 | +2.0 |
| Q97 | Consider two hosts P and Q that are connected through a router R. The maximum transfer unit (MTU) v | 2 | +2.0 |
| Q# | Question | Answer | Marks |
|---|---|---|---|
| Q6 | Given below are two statements: one is labelled as Assertion A and the other is labelled as Reason | 4 | +2.0 |
| Q19 | A processor chip is used for application in which 30% of execution time is spent on floating point a | 3 | +2.0 |
| Q32 | 256 Mb DRAM is organized as a 32M × 8 memory externally and as a 16K × 16K square array | 2 | +2.0 |
| Q# | Question | Answer | Marks |
|---|---|---|---|
| Q4 | Given below are two statements: Which of the following concurrency control protocol ensures both | 4 | +2.0 |
| Q16 | The total cost of retrieving records in sorted order using an unclustered B+ tree is (P-Average | 2 | +2.0 |
| Q22 | Consider the following statements: A. A database design is in BCNF if each member of the set of | 4 | +2.0 |
| Q28 | Let R (A, B, C, D, E, F) be a relational schema with following functional dependencies: C & | 2 | +2.0 |
| Q34 | Given the basic E R diagram and relational model, which of the the following is incorrect? | 3 | +2.0 |
| Q42 | Which of the following scenario may lead to an irrecoverable error in a database system? | 4 | +2.0 |
| Q66 | let R (A, B, C, D) be a relational schema with following function dependencies: A → B, B&nb | 2 | +2.0 |
| Q75 | Which one of the following is NOT a part of ACID properties of a database transaction? | 4 | +2.0 |
| Q88 | A B-tree used as an index for a large database table has four levels including the root node. If a n | 1 | +2.0 |
| Q# | Question | Answer | Marks |
|---|---|---|---|
| Q7 | Let R = {x : x ∈ N, x is multiple of 3 and x ≤ 100} and S = {x : x ∈ N, x is | 1 | +2.0 |
| Q13 | Find the sum of all four digit numbers formed using the digits 1, 2, 4 and 6. | 1 | +2.0 |
| Q15 | If A = {4n + 2 | n is a natural number} and B = {3n | n is a natural number}. Which of the following | 4 | +2.0 |
| Q38 | How many integral solutions are there to x + y + z + w = 29, where x ≥ 1, y ≥ 2, z ≥ 3 | 2 | +2.0 |
| Q40 | Match List I with List II LIST I LIST II | 1 | +2.0 |
| Q43 | Let \(G=\frac{R}{\{0\}} \) and H = {-1, 1} be groups under the multiplication. Then, the | 3 | +2.0 |
| Q47 | Consider the following statements. A. The identity is unique in any monoid. B. A monoid is a | 1 | +2.0 |
| Q59 | There are M points on one straight line AB and n points on another straight line AC none of them bei | 2 | +2.0 |
| Q62 | Consider universe positive integer X= {1 ≤ n ≤ 8}, proposition P= "n is an even integers& | 1 | +2.0 |
| Q65 | Let N denote the set of all natural numbers and R be the relation on NXN defined by (a, b) R(c, d), | 4 | +2.0 |
| Q82 | Let (Z, +) denote the group of all integers under addition. Then the number of all automorphisms of | 2 | +2.0 |
| Q# | Question | Answer | Marks |
|---|---|---|---|
| Q12 | Consider a disk system with cylinders. The request to access the cylinders occurs in the following | 1 | +2.0 |
| Q17 | Given below are two statements: one is labelled as Assertion A and the other is labelled as Reason | 2 | +2.0 |
| Q18 | At a particular time of computation, the value of a counting semaphore is 7. Then 20 p operations an | 3 | +2.0 |
| Q25 | Consider the following statements: S1: LRU page replacement algorithm suffers from the belady | 2 | +2.0 |
| Q36 | In a multiuser operating system, 20 requests are made to use a particular resource per hour, on an a | 1 | +2.0 |
| Q41 | Consider the following table of arrival time and burst time for three processes P0, P1, P2: | 2 | +2.0 |
| Q46 | Match List I with List II LIST I LIST II | 2 | +2.0 |
| Q67 | Given below are two statements: Which of the following statement/s is/are correct with respect t | 3 | +2.0 |
| Q69 | Match List I with List II LIST I LIST II | 2 | +2.0 |
| Q90 | Given below are two statements: one is labelled as Assertion A and the other is labelled as Reason | 2 | +2.0 |
| Q92 | 📄 What is the main memory hit ratio? | 1 | +2.0 |
| Q93 | 📄 Consider again that T is stored in column-major format, what is the main memory hit ratio? | 4 | +2.0 |
| Q94 | 📄 Consider that T is stored in column major format, how many page faults will be encountered? | 4 | +2.0 |
| Q95 | 📄 How many page faults will be encountered? | 2 | +2.0 |
| Q96 | 📄 What is fault ratio of row major to column major arrangements? | 1 | +2.0 |
| Q# | Question | Answer | Marks |
|---|---|---|---|
| Q9 | What will be the output of the following code? # include < sidio. h > int main ( ) { | 2 | +2.0 |
| Q10 | What is the output of following code? main () struct s1 {char * z; int i; struct s1 | 2 | +2.0 |
| Q14 | How will you free the memory allocated by the following program? # include <stdio.h> #i | 4 | +2.0 |
| Q21 | A three dimensional array in C++ is declared as int A [a] [b] [c]. Consider that array elements are | 2 | +2.0 |
| Q31 | Given below are two statements: one is labelled as Assertion A and the other is labelled as Reason | 3 | +2.0 |
| Q48 | Given below are two statements: one is labelled as Assertion A and the other is labelled as Reason | 1 | +2.0 |
| Q50 | Consider a hash table of size seven with starting index zero and a hash function (6x + 3) mod 4. Ass | 4 | +2.0 |
| Q55 | Suppose a circular queue of capacity (n - 1) elements is implemented with an array of n elements. As | 1 | +2.0 |
| Q73 | What is the output of following code? main ( ) {static float a [ ] = {13.24, 1.5, 4.5, 5.4, 3 | 4 | +2.0 |
| Q99 | What is x in the following program? #include < stdio.h > int main ( ) {typedef (* (* | 3 | +2.0 |
| Q# | Question | Answer | Marks |
|---|---|---|---|
| Q3 | The following table shows the time between failures for a software: Error number | 3 | +2.0 |
| Q26 | Which of the following is used to determine the cost performance index? | 3 | +2.0 |
| Q27 | Which is not a basic approach to the problem of conflict resolution in a production system? | 4 | +2.0 |
| Q30 | Consider the following statements about the software product line system: Statement I: At the | 1 | +2.0 |
| Q33 | Given below are two statements: one is labelled as Assertion A and the other is labelled as Reason | 2 | +2.0 |
| Q37 | Given below are two statements: Statement I: subsystem models show logical grouping of objects | 1 | +2.0 |
| Q49 | Consider the following statements: A. Dynamic metrics are collected by measurements made of a pr | 4 | +2.0 |
| Q53 | ___________ is intended to show that a system both conforms to its specifications and meets the | 4 | +2.0 |
| Q63 | An observational technique that can be used to understand operational process and help to derive req | 3 | +2.0 |
| Q72 | Match List I with List II LIST I LIST II | 4 | +2.0 |
| Q100 | Match List I with List II LIST I LIST II | 3 | +2.0 |
| Q# | Question | Answer | Marks |
|---|---|---|---|
| Q45 | Which of the following statement is correct? | 3 | +2.0 |
| Q51 | Consider the following finite automata F1 that accepts a language L Let F2 be a finite auto | 2 | +2.0 |
| Q52 | The maximum yield length of the following CNF CFG is S → AB A → CD B&n | 3 | +2.0 |
| Q57 | Consider following statements: A. A context free language is generated by LR(o) grammar if and o | 3 | +2.0 |
| Q61 | A. The set of turning machine codes for TM's that accept all inputs that are palindromes (possi | 4 | +2.0 |
| Q78 | Consider the following language: L= {w ∈ { a, b, c }* : n a (ω) + n b (ω) = n c | 1 | +2.0 |