- 1Aptitude · 1 mark · MCQ · EasyThe expenditure on the project ____ as follows: equipment Rs.20 lakhs, salaries Rs.12 lakhs, and contingency Rs.3 lakhs.
- 2Aptitude · 1 mark · MCQ · EasyThe search engine's business model ____ around the fulcrum of trust.
- 3Aptitude · 1 mark · MCQ · EasyTwo cars start at the same time from the same location and go in the same direction. The speed of the first car is 50km/h and the speed of the second car is 60km/h. The number of hours it takes for the distance between the two cars to be 20km is ____.
- 4Aptitude · 1 mark · MCQ · EasyTen friends planned to share equally the cost of buying a gift for their teacher. When two of them decided not to contribute, each of the other friends had to pay Rs 150 more. The cost of the gift was Rs. ____.
- 5Aptitude · 1 mark · MCQ · EasyA court is to a judge as ____ is to a teacher.
- 6Aptitude · 2 marks · MCQ · ModerateThe police arrested four criminals – P, Q, R and S. The criminals knew each other. They made the following statements:
P says “Q committed the crime.”
Q says “S committed the crime.”
R says “I did not do it.”
S says “What Q said about me is false.”
Assume only one of the arrested four committed the crime and only one of the statements made above is true. Who committed the crime?
- 7Aptitude · 2 marks · MCQ · ModerateIn the given diagram, teachers are represented in the triangle, researchers in the circle and administrators in the rectangle. Out of the total number of the people, the percentage of administrators shall be in the range of ____.
- 8Aptitude · 2 marks · MCQ · Easy“A recent High Court judgement has sought to dispel the idea of begging as a disease — which leads to its stigmatization and criminalization — and to regard it as a symptom. The underlying disease is the failure of the state to protect citizens who fall through the social security net.”
- 9Aptitude · 2 marks · MCQ · ModerateIn a college, there are three student clubs. Sixty students are only in the Drama club, 80 students are only in the Dance club, 30 students are only in the Maths club, 40 students are in both Drama and Dance clubs, 12 students are in both Dance and Maths clubs, 7 students are in both Drama and Maths clubs, and 2 students are in all the clubs. If 75% of the students in the college are not in any of these clubs, then the total number of students in the college is ____.
- 10Aptitude · 2 marks · MCQ · ModerateThree of the five students allocated to a hostel put in special requests to the warden. Given the floor plan of the vacant rooms, select the allocation plan that will accommodate all their requests.
Request by X: Due to pollen allergy, I want to avoid a wing next to the garden.
Request by Y: I want to live as far from the washrooms as possible. since I am very sensitive to smell.
Request by Z: I believe in Vaastu and so want to stay in the South-west wing.
The shaded rooms are already occupied. WR is washroom.
- 111 mark · MCQ · EasyA certain processor uses a fully associative cache of size 16kB. The cache block size is 16 bytes. Assume that the main memory is byte addressable and uses a 32-bit address. How many bits are required for the Tag and the Index fields respectively in the addresses generated by the processor?
- 121 mark · MCQ · ModerateThe chip select logic for a certain DRAM chip in a memory system design is shown below. Assume that the memory system has 16 address lines denoted by A15 to A0. What is the range of addresses (in hexadecimal) of the memory system that can get enabled by the chip select (CS) signal?
- 131 mark · MCQ · EasyWhich one of the following kinds of derivation is used by LR parsers?
- 141 mark · MCQ · EasyIn 16-bit 2's complement representation, the decimal number −28 is:
- 151 mark · MCQ · ModerateLet U={1,2,…,n}. Let A={(x,X)∣x∈X,X⊆U}. Consider the following two statements on ∣A∣.
I. ∣A∣=n2n−1
II. ∣A∣=∑k=1nk(kn) - 161 mark · MCQ · ModerateWhich one of the following is NOT a valid identity?
- 171 mark · MCQ · ModerateIf L is a regular language over Σ={a,b}, which one of the following languages is NOT regular ?
- 181 mark · MCQ · ModerateConsider Z=X−Y, where X, Y and Z are all in sign-magnitude form. X and Y are each represented in n bits. To avoid overflow, the representation of Z would require a minimum of:
- 191 mark · MCQ · EasyLet X be a square matrix. Consider the following two statements on X.
- 201 mark · MCQ · ModerateLet G be an arbitrary group. Consider the following relations on G:
- 211 mark · MCQ · ModerateConsider the following two statements about database transaction schedules:
- 221 mark · MCQ · ModerateLet G be an undirected complete graph on n vertices, where n>2. Then, the number of different Hamiltonian cycles in G is equal to
- 231 mark · MCQ · EasyCompute limx→32x2−5x−3x4−81
- 241 mark · MCQ · EasyWhich one of the following statements is NOT correct about the B+ tree data structure used for creating an index of a relational database table?
- 251 mark · MCQ · HardFor Σ={a,b}, let us consider the regular language L={x∣x=a2+3k or x=b10+12k,k≥0}. Which one of the following can be a pumping length (the constant guaranteed by the pumping lemma) for L ?
- 261 mark · MCQ · EasyWhich of the following protocol pairs can be used to send and retrieve e-mails (in that order)?
- 271 mark · NAT · ModerateThe following C program is executed on a Unix/Linux system:
- 281 mark · NAT · ModerateConsider the following C program:
- 291 mark · NAT · ModerateConsider the grammar given below:
- 301 mark · NAT · EasyAn array of 25 distinct elements is to be sorted using quicksort. Assume that the pivot element is chosen uniformly at random. The probability that the pivot element gets placed in the worst possible location in the first round of partitioning (rounded off to 2 decimal places) is ____.
- 311 mark · NAT · EasyThe value of 351mod5 is ____.
- 321 mark · NAT · ModerateTwo numbers are chosen independently and uniformly at random from the set {1,2,…,13}. The probability (rounded off to 3 decimal places) that their 4-bit (unsigned) binary representations have the same most significant bit is ____.
- 331 mark · NAT · ModerateConsider three concurrent processes P1, P2 and P3 as shown below, which access a shared variable D that has been initialized to 100.
- 341 mark · NAT · EasyConsider the following C program:
- 351 mark · NAT · ModerateConsider a sequence of 14 elements: A=[−5,−10,6,3,−1,−2,13,4,−9,−1,4,12,−3,0]. The subsequence sum S(i,j)=∑k=ijA[k] . Determine the maximum of S(i,j), where 0≤i≤j<14. (Divide and conquer approach may be used.)
- 362 marks · MCQ · ModerateConsider the following C function.
- 372 marks · MCQ · ModerateConsider the following C program:
- 382 marks · MCQ · ModerateConsider three machines M, N, and P with IP addresses 100.10.5.2, 100.10.5.5, and 100.10.5.6 respectively. The subnet mask is set to 255.255.255.252 for all the three machines. Which one of the following is true?
- 392 marks · MCQ · EasySuppose that in an IP-over-Ethernet network, a machine X wishes to find the MAC address of another machine Y in its subnet. Which one of the following techniques can be used for this?
- 402 marks · MCQ · ModerateConsider three 4-variable functions f1, f2, and f3, which are expressed in sum-of-minterms as
- 412 marks · MCQ · HardWhich one of the following languages over Σ={a,b} is NOT context-free?
- 422 marks · MCQ · ModerateLet the set of functional dependencies F={QR→S,R→P,S→Q} hold on a relation schema X=(PQRS). X is not in BCNF. Suppose X is decomposed into two schemas Y and Z, where Y=(PR) and Z=(QRS).\n\nConsider the two statements given below.\n\nI. Both Y and Z are in BCNF\nII. Decomposition of X into Y and Z is dependency preserving and lossless\n\nWhich of the above statements is/are correct?
- 432 marks · MCQ · ModerateAssume that in a certain computer, the virtual addresses are 64 bits long and the physical addresses are 48 bits long. The memory is word addressable. The page size is 8kB and the word size is 4 bytes. The Translation Look-aside Buffer (TLB) in the address translation path has 128 valid entries. At most how many distinct virtual addresses can be translated without any TLB miss?
- 442 marks · MCQ · ModerateConsider the following sets:\n\nS1. Set of all recursively enumerable languages over the alphabet {0,1}\nS2. Set of all syntactically valid C programs\nS3. Set of all languages over the alphabet {0,1}\nS4. Set of all non-regular languages over the alphabet {0,1}\n\nWhich of the above sets are uncountable?
- 452 marks · MCQ · HardConsider the first order predicate formula φ:
∀x[(∀z z∣x⇒((z=x)∨(z=1)))⇒∃w (w>x)∧(∀z z∣w⇒((w=z)∨(z=1)))]
Here ‘a∣b’ denotes that ‘a divides b’, where a and b are integers. Consider the following sets:
- 462 marks · MCQ · ModerateConsider the following grammar and the semantic actions to support the inherited type declaration attributes. Let X1, X2, X3, X4, X5, and X6 be the placeholders for the non-terminals D, T, L or L1 in the following table:
- 472 marks · MCQ · ModerateThere are n unsorted arrays: A1,A2,…,An. Assume that n is odd. Each of A1,A2,…,An contains n distinct elements. There are no common elements between any two arrays. The worst-case time complexity of computing the median of the medians of A1,A2,…,An is
- 482 marks · MCQ · ModerateLet G be any connected, weighted, undirected graph.
- 492 marks · MCQ · ModerateConsider the following snapshot of a system running n concurrent processes. Process i is holding Xi instances of a resource R, 1≤i≤n. Assume that all instances of R are currently in use. Further, for all i, process i can place a request for at most Yi additional instances of R while holding the Xi instances it already has. Of the n processes, there are exactly two processes p and q such that Yp=Yq=0. Which one of the following conditions guarantees that no other process apart from p and q can complete execution?
- 502 marks · MCQ · HardConsider the following statements:
I. The smallest element in a max-heap is always at a leaf node
II. The second largest element in a max-heap is always a child of the root node
III. A max-heap can be constructed from a binary search tree in Θ(n) time
IV. A binary search tree can be constructed from a max-heap in Θ(n) time
- 512 marks · NAT · ModerateConsider the following four processes with arrival times (in milliseconds) and their length of CPU bursts (in milliseconds) as shown below:
- 522 marks · NAT · ModerateThe index node (inode) of a Unix-like file system has 12 direct, one single-indirect and one double-indirect pointers. The disk block size is 4kB, and the disk block address is 32-bits long. The maximum possible file size is (rounded off to 1 decimal place) ____ GB.
- 532 marks · NAT · ModerateConsider the augmented grammar given below:
- 542 marks · NAT · ModerateConsider the following matrix:
- 552 marks · NAT · ModerateA certain processor deploys a single-level cache. The cache block size is 8 words and the word size is 4 bytes. The memory system uses a 60-MHz clock. To service a cache miss, the memory controller first takes 1 cycle to accept the starting address of the block, it then takes 3 cycles to fetch all the eight words of the block, and finally transmits the words of the requested block at the rate of 1 word per cycle. The maximum bandwidth for the memory system when the program running on the processor issues a series of read operations is
____ ×106bytes/sec.
- 562 marks · NAT · HardLet T be a full binary tree with 8 leaves. (A full binary tree has every level full.) Suppose two leaves a and b of T are chosen uniformly and independently at random. The expected value of the distance between a and b in T (i.e., the number of edges in the unique path between a and b) is (rounded off to 2 decimal places) ____.
- 572 marks · NAT · ModerateSuppose Y is distributed uniformly in the open interval (1,6). The probability that the polynomial 3x2+6xY+3Y+6 has only real roots is (rounded off to 1 decimal place) ____.
- 582 marks · NAT · ModerateLet Σ be the set of all bijections from {1,…,5} to {1,…,5}, where id denotes the identity function, i.e. id(j)=j,∀j. Let ∘ denote composition on functions. For a string x=x1x2⋯xn∈Σn,n≥0, let π(x)=x1∘x2∘⋯∘xn.
- 592 marks · NAT · ModerateConsider that 15 machines need to be connected in a LAN using 8-port Ethernet switches. Assume that these switches do not have any separate uplink ports. The minimum number of switches needed is ____.
- 602 marks · NAT · ModerateWhat is the minimum number of 2-input NOR gates required to implement a 4-variable function expressed in sum-of-minterms form as f=Σ(0,2,5,7,8,10,13,15)? Assume that all the inputs and their complements are available. Answer: ____.
- 612 marks · NAT · ModerateA relational database contains two tables Student and Performance as shown below:
- 622 marks · NAT · EasyConsider the following C program:
- 632 marks · NAT · ModerateConsider the following C program:
- 642 marks · NAT · ModerateIn an RSA cryptosystem, the value of the public modulus parameter n is 3007. If it is also known that ϕ(n)=2880, where ϕ() denotes Euler's Totient Function, then the prime factor of n which is greater than 50 is ____.
- 652 marks · NAT · ModerateConsider the following relations P(X,Y,Z), Q(X,Y,T) and R(Y,V).