- 1Aptitude · 1 mark · MCQ · EasyDidn't you buy _____ when you went shopping?
- 2Aptitude · 1 mark · MCQ · EasyWhich of the following options is the closest in meaning to the sentence below?
- 4Aptitude · 1 mark · MCQ · EasyBased on the given statements, select the most appropriate option to solve the given question.
- 5Aptitude · 1 mark · MCQ · EasyGiven Set A={2,3,4,5} and Set B={11,12,13,14,15}, two numbers are randomly selected, one from each set. What is the probability that the sum of the two numbers equals 16?
- 6Aptitude · 2 marks · MCQ · EasySelect the alternative meaning of the underlined part of the sentence.
- 7Aptitude · 2 marks · MCQ · ModerateThe given statement is followed by some courses of action. Assuming the statement to be true, decide the correct option.
- 8Aptitude · 2 marks · NAT · ModerateThe pie chart below has the breakup of the number of students from different departments in an engineering college for the year 2012. The proportion of male to female students in each department is 5:4. There are 40 males in Electrical Engineering. What is the difference between the numbers of female students in the Civil department and the female students in the Mechanical department?
- 9Aptitude · 2 marks · MCQ · HardThe probabilities that a student passes in Mathematics, Physics and Chemistry are m, p, and c respectively. Of these subjects, the student has 75% chance of passing in at least one, a 50% chance of passing in at least two and a 40% chance of passing in exactly two. Following relations are drawn in m,p,c:
- 10Aptitude · 2 marks · MCQ · EasyThe number of students in a class who have answered correctly, wrongly, or not attempted each question in an exam, are listed in the table below. The marks for each question are also listed. There is no negative or partial marking.
- 111 mark · MCQ · EasyIf g(x)=1−x and h(x)=x−1x, then h(g(x))g(h(x)) is:
- 121 mark · MCQ · Easylimx→∞x1/x is
- 131 mark · MCQ · EasyMatch the following:
- 141 mark · MCQ · EasyWhich one of the following is the recurrence equation for the worst case time complexity of the Quicksort algorithm for sorting n (≥2) numbers? In the recurrence equations given in the options below, c is a constant.
- 151 mark · MCQ · EasyThe height of a tree is the length of the longest root-to-leaf path in it. The maximum and minimum number of nodes in a binary tree of height 5 are
- 161 mark · MCQ · EasyMatch the following:
- 171 mark · MCQ · ModerateWhich of the following is/are correct inorder traversal sequence(s) of binary search tree(s)?
I. 3,5,7,8,15,19,25
II. 5,8,9,12,10,15,25
III. 2,7,10,8,14,16,20
IV. 4,6,7,9,18,20,25
- 181 mark · MCQ · EasyWhich one of the following is TRUE at any valid state in shift-reduce parsing?
- 191 mark · MCQ · EasyWhich one of the following is NOT equivalent to p↔q?
- 201 mark · MCQ · ModerateFor a set A, the power set of A is denoted by 2A. If A={5,{6},{7}}, which of the following options are TRUE?
- 211 mark · MCQ · ModerateConsider a 4-bit Johnson counter with an initial value of 0000. The counting sequence of this counter is
- 221 mark · MCQ · ModerateFor computers based on three-address instruction formats, each address field can be used to specify which of the following:
- 231 mark · MCQ · HardSuppose two hosts use a TCP connection to transfer a large file. Which of the following statements is/are FALSE with respect to the TCP connection?
- 241 mark · MCQ · EasySuppose that everyone in a group of N people wants to communicate secretly with the N−1 others using symmetric key cryptographic system. The communication between any two persons should not be decodable by the others in the group. The number of keys required in the system as a whole to satisfy the confidentiality requirement is
- 251 mark · MCQ · ModerateWhich of the following statements is/are FALSE?
I. XML overcomes the limitations in HTML to support a structured way of organizing content.
II. XML specification is not case sensitive while HTML specification is case sensitive.
III. XML supports user defined tags while HTML uses pre-defined tags.
IV. XML tags need not be closed while HTML tags must be closed.
- 261 mark · MCQ · EasyWhich one of the following fields of an IP header is NOT modified by a typical IP router?
- 271 mark · MCQ · ModerateIn one of the pairs of protocols given below, both the protocols can use multiple TCP connections between the same client and the server. Which one is that?
- 281 mark · MCQ · ModerateFor any two languages L1 and L2 such that L1 is context-free and L2 is recursively enumerable but not recursive, which of the following is/are necessarily true?
- 291 mark · NAT · EasyConsider a system with byte-addressable memory, 32-bit logical addresses, 4 kilobyte page size and page table entries of 4 bytes each. The size of the page table in the system in megabytes is
- 301 mark · NAT · ModerateThe following two functions P1 and P2 that share a variable B with an initial value of 2 execute concurrently.
- 311 mark · MCQ · EasySELECT operation in SQL is equivalent to
- 321 mark · MCQ · EasyA file is organized so that the ordering of data records is the same as or close to the ordering of data entries in some index. Then that index is called
- 331 mark · NAT · Easylower diagonal entry l22 of L is ____.
- 341 mark · NAT · ModerateThe output of the following C program is ______.
- 351 mark · MCQ · EasyWhat are the worst-case complexities of insertion and deletion of a key in a binary search tree?
- 362 marks · NAT · ModerateSuppose that the stop-and-wait protocol is used on a link with a bit rate of 64kilobits per second and 20milliseconds propagation delay. Assume that the transmission time for the acknowledgement and the processing time at nodes are negligible. Then the minimum frame size in bytes to achieve a link utilization of at least 50% is _______.
- 372 marks · MCQ · EasyConsider a max heap, represented by the array: 40,30,20,10,15,16,17,8,4.
- 382 marks · NAT · ModerateConsider the following C program segment.
- 392 marks · NAT · ModerateConsider a LAN with four nodes S1,S2,S3 and S4. Time is divided into fixed-size slots, and a node can begin its transmission only at the beginning of a slot. A collision is said to have occurred if more than one node transmit in the same slot. The probabilities of generation of a frame in a time slot by S1,S2,S3 and S4 are 0.1,0.2,0.3 and 0.4, respectively. The probability of sending a frame in the first slot without any collision by any of these four stations is ____.
- 402 marks · MCQ · EasyThe binary operator = is defined by the following truth table.
- 412 marks · NAT · Easy\sum_{x=1}^{99} \frac{1}{x(x+1)} = \_\_\_\_\
- 422 marks · MCQ · HardSuppose L={p,q,r,s,t} is a lattice represented by the following Hasse diagram:
- 432 marks · MCQ · ModerateConsider the operations
- 442 marks · NAT · ModerateLet G be a connected planar graph with 10 vertices. If the number of edges on each face is three, then the number of edges in G is _______.
- 452 marks · MCQ · ModerateLet an represent the number of bit strings of length n containing two consecutive 1s. What is the recurrence relation for an?
- 462 marks · MCQ · ModerateA variable x is said to be live at a statement Si in a program if the following three conditions hold simultaneously:
- 472 marks · NAT · ModerateThe least number of temporary variables required to create a three-address code in static single assignment form for the expression q+r/3+s−t∗5+u∗v/w is ____.
- 482 marks · NAT · ModerateConsider an Entity-Relationship (ER) model in which entity sets E1 and E2 are connected by an m:n relationship R12. E1 and E3 are connected by a 1:n (1 on the side of E1 and n on the side of E3) relationship R13.
- 492 marks · NAT · EasyConsider the DFAs M and N given above. The number of states in a minimal DFA that accepts the language L(M)∩L(N) is ____
- 502 marks · MCQ · ModerateConsider the NPDA (Q={q0,q1,q2},Σ={0,1},Γ={0,1,⊥},δ,q0,⊥,F={q2}), where (as per usual convention) Q is the set of states, Σ is the input alphabet, Γ is the stack alphabet, δ is the state transition function, q0 is the initial state, ⊥ is the initial stack symbol, and F is the set of accepting states. The state transition is as follows:
- 512 marks · MCQ · ModerateLet G=(V,E) be a simple undirected graph, and s be a particular vertex in it called the source. For x∈V, let d(x) denote the shortest distance in G from s to x. A breadth first search (BFS) is performed starting at s. Let T be the resultant BFS tree. If (u,v) is an edge of G that is not in T, then which one of the following CANNOT be the value of d(u)−d(v)?
- 522 marks · NAT · HardConsider a uniprocessor system executing three tasks T1, T2 and T3, each of which is composed of an infinite sequence of jobs (or instances) which arrive periodically at intervals of 3, 7 and 20 milliseconds, respectively. The priority of each task is the inverse of its period, and the available tasks are scheduled in order of priority, with the highest priority task scheduled first. Each instance of T1, T2 and T3 requires an execution time of 1, 2 and 4 milliseconds, respectively. Given that all tasks initially arrive at the beginning of the 1st millisecond and task preemptions are allowed, the first instance of T3 completes its execution at the end of ____________ milliseconds.
- 532 marks · MCQ · HardA positive edge-triggered D flip-flop is connected to a positive edge-triggered JK flip-flop as follows. The Q output of the D flip-flop is connected to both the J and K inputs of the JK flip-flop, while the Q output of the JK flip-flop is connected to the input of the D flip-flop. Initially, the output of the D flip-flop is set to logic one and the output of the JK flip-flop is cleared. Which one of the following is the bit sequence (including the initial state) generated at the Q output of the JK flip-flop when the flip-flops are connected to a free-running common clock? Assume that J=K=1 is the toggle mode and J=K=0 is the state-holding mode of the JK flip-flop. Both the flip-flops have non-zero propagation delays.
- 542 marks · NAT · ModerateConsider a disk pack with a seek time of 4milliseconds and rotational speed of 10000 rotations per minute (\mathrm{RPM}). It has 600 sectors per track and each sector can store 512bytes of data. Consider a file stored in the disk. The file contains 2000 sectors. Assume that every sector access necessitates a seek, and the average rotational latency for accessing each sector is half of the time for one complete rotation. The total time (in milliseconds) needed to read the entire file is _____.
- 552 marks · NAT · EasyConsider a non-pipelined processor with a clock rate of 2.5gigahertz and average cycles per instruction of four. The same processor is upgraded to a pipelined processor with five stages; but due to the internal pipeline delay, the clock speed is reduced to 2gigahertz. Assume that there are no stalls in the pipeline. The speed up achieved in this pipelined processor is ____.
- 562 marks · NAT · ModerateSuppose the following disk request sequence (track numbers) for a disk with 100 tracks is given: 45,20,90,10,50,60,80,25,70. Assume that the initial position of the R/W head is on track 50. The additional distance that will be traversed by the R/W head when the Shortest Seek Time First (SSTF) algorithm is used compared to the SCAN (Elevator) algorithm (assuming that SCAN algorithm moves towards 100 when it starts execution) is ____ tracks.
- 572 marks · MCQ · ModerateConsider a main memory with five page frames and the following sequence of page references: 3,8,2,3,9,1,6,3,8,9,3,6,2,1,3. Which one of the following is true with respect to page replacement policies First In First Out (FIFO) and Least Recently Used (LRU)?
- 582 marks · NAT · Easy∫1/π2/πx2cos(1/x)dx=____.
- 592 marks · MCQ · ModerateConsider the following 2×2 matrix A where two elements are unknown and are marked by a and b. The eigenvalues of this matrix are −1 and 7. What are the values of a and b?
- 602 marks · MCQ · HardAn algorithm performs (logN)1/2 find operations, N insert operations, (logN)1/2 delete operations, and (logN)1/2 decrease-key operations on a set of data items with keys drawn from a linearly ordered set. For a delete operation, a pointer is provided to the record that must be deleted. For the decrease-key operation, a pointer is provided to the record that has its key decreased. Which one of the following data structures is the most suited for the algorithm to use, if the goal is to achieve the best total asymptotic complexity considering all the operations?
- 612 marks · NAT · ModerateConsider the following relations:
- 622 marks · MCQ · ModerateWhat is the output of the following C code? Assume that the address of x is 2000 (in decimal) and an integer requires four bytes of memory.
- 632 marks · NAT · HardThe graph shown below has 8 edges with distinct integer edge weights. The minimum spanning tree (MST) is of weight 36 and contains the edges: {(A,C),(B,C),(B,E),(E,F),(D,F)}. The edge weights of only those edges which are in the MST are given in the figure shown below. The minimum possible sum of weights of all 8 edges of this graph is ________.
- 642 marks · MCQ · ModerateConsider the following C function.
- 652 marks · MCQ · ModerateConsider the following pseudo code, where x and y are positive integers.