- 1Aptitude · 1 mark · MCQ · EasyRaman is confident of speaking English ____ six months as he has been practising regularly ____ the last three weeks.
- 2Aptitude · 1 mark · MCQ · EasyHis knowledge of the subject was excellent but his classroom performance was ____.
- 3Aptitude · 1 mark · MCQ · EasySelect the word that fits the analogy:
- 4Aptitude · 1 mark · MCQ · EasyThe dawn of the 21st century witnessed the melting glaciers oscillating between giving too much and too little to billions of people who depend on them for fresh water. The UN climate report estimates that without deep cuts to man-made emissions, at least 30% of the northern hemisphere's surface permafrost could melt by the end of the century. Given this situation of imminent global exodus of billions of people displaced by rising seas, nation-states need to rethink their carbon footprint for political concerns, if not for environmental ones.
- 5Aptitude · 1 mark · MCQ · ModerateThere are multiple routes to reach from node 1 to node 2, as shown in the network.
- 6Aptitude · 2 marks · MCQ · EasyGoods and Services Tax (GST) is an indirect tax introduced in India in 2017 that is imposed on the supply of goods and services, and it subsumes all indirect taxes except few. It is a destination-based tax imposed on goods and services used, and it is not imposed at the point of origin from where goods come. GST also has a few components specific to state governments, central government and Union Territories (UTs).
- 7Aptitude · 2 marks · MCQ · EasyIf P=3,R=27,T=243, then Q+S=____.
- 8Aptitude · 2 marks · MCQ · ModerateThe figure below shows an annular ring with outer and inner radii as b and a, respectively. The annular space has been painted in the form of blue colour circles touching the outer and inner periphery of annular space. If maximum n number of circles can be painted, then the unpainted area available in annular space is ____.
- 9Aptitude · 2 marks · MCQ · EasyTwo straight lines are drawn perpendicular to each other in X-Y plane. If α and β are the acute angles the straight lines make with the X-axis, then α+β is ____.
- 10Aptitude · 2 marks · MCQ · ModerateThe total revenue of a company during 2014-2018 is shown in the bar graph. If the total expenditure of the company in each year is 500 million rupees, then the aggregate profit or loss (in percentage) on the total expenditure of the company during 2014-2018 is ____.
- 111 mark · MCQ · ModerateConsider the functions
- 121 mark · MCQ · HardFor parameters a and b, both of which are ω(1), T(n)=T(n1/a)+1, and T(b)=1. Then T(n) is
- 131 mark · MCQ · ModerateConsider the following statements.
- 141 mark · MCQ · ModerateConsider the following data path diagram.
- 151 mark · MCQ · ModerateThe preorder traversal of a binary search tree is 15, 10, 12, 11, 20, 18, 16, 19.
- 161 mark · MCQ · ModerateWhat is the worst case time complexity of inserting n2 elements into an AVL-tree with n elements initially?
- 171 mark · MCQ · HardWhich one of the following regular expressions represents the set of all binary strings with an odd number of 1's?
- 181 mark · MCQ · ModerateConsider the following statements.
- 191 mark · MCQ · ModerateConsider the following statements.
- 201 mark · MCQ · HardConsider the language L={an∣n≥0}∪{anbn∣n≥0} and the following statements.
- 211 mark · MCQ · EasyConsider allocation of memory to a new process. Assume that none of the existing holes in the memory will exactly fit the process's memory requirement. Hence, a new hole of smaller size will be created if allocation is made in any of the existing holes. Which one of the following statements is TRUE?
- 221 mark · MCQ · EasyConsider the following statements about process state transitions for a system using preemptive scheduling.
- 231 mark · MCQ · ModerateConsider a relational database containing the following schemas.
- 241 mark · MCQ · EasyWhich one of the following is used to represent the supporting many-one relationships of a weak entity set in an entity-relationship diagram?
- 251 mark · MCQ · ModerateConsider the following statements about the functionality of an IP based router.
- 261 mark · MCQ · EasyWhat is the worst case time complexity of inserting n elements into an empty linked list, if the linked list needs to be maintained in sorted order?
- 271 mark · NAT · ModerateLet R be the set of all binary relations on the set {1,2,3}. Suppose a relation is chosen from R at random. The probability that the chosen relation is reflexive (round off to 3 decimal places) is ____ .
- 281 mark · NAT · EasyLet G be a group of 35 elements. Then the largest possible size of a subgroup of G other than G itself is ____ .
- 291 mark · NAT · EasyA multiplexer is placed between a group of 32 registers and an accumulator to regulate data movement such that at any given point in time the content of only one register will move to the accumulator. The minimum number of select lines needed for the multiplexer is ____.
- 301 mark · NAT · ModerateIf there are m input lines and n output lines for a decoder that is used to uniquely address a byte addressable 1KB RAM, then the minimum value of m+n is ____.
- 311 mark · NAT · ModerateA direct mapped cache memory of 1MB has a block size of 256bytes. The cache has an access time of 3ns and a hit rate of 94%. During a cache miss. it takes 20ns to bring the first word of a block from the main memory, while each subsequent word takes 5ns. The word size is 64bits. The average memory access time in ns (round off to 1 decimal place) is _______.
- 321 mark · NAT · ModerateConsider the following C program.
- 331 mark · NAT · EasyConsider a double hashing scheme in which the primary hash function is h1(k)=kmod23, and the secondary hash function is h2(k)=1+(kmod19). Assume that the table size is 23. Then the address returned by probe 1 in the probe sequence (assume that the probe sequence begins at probe 0) for key value k=90 is ____.
- 341 mark · NAT · ModerateConsider the following grammar.
- 351 mark · NAT · EasyAssume that you have made a request for a web page through your web browser to a web server. Initially the browser cache is empty. Further, the browser is configured to send HTTP requests in non-persistent mode. The web page contains text and five very small images. The minimum number of TCP connections required to display the web page completely in your browser is ____.
- 362 marks · MCQ · ModerateWhich of the following languages are undecidable? Note that ⟨M⟩ indicates encoding of the Turing machine M.
- 372 marks · MCQ · ModerateLet A and B be two n×n matrices over real numbers. Let rank(M) and det(M) denote the rank and determinant of a matrix M, respectively. Consider the following statements.
- 382 marks · MCQ · HardConsider the Boolean function z(a,b,c).
- 392 marks · MCQ · ModerateConsider three registers R1, R2, and R3 that store numbers in IEEE-754 single precision floating point format. Assume that R1 and R2 contain the values (in hexadecimal notation) 0x42200000 and 0xC1200000, respectively.
- 402 marks · MCQ · ModerateA computer system with a word length of 32bits has a 16MB byte-addressable main memory and a 64KB, 4-way set associative cache memory with a block size of 256bytes. Consider the following four physical addresses represented in hexadecimal notation.
- 412 marks · MCQ · ModerateLet G=(V,E) be a weighted undirected graph and let T be a Minimum Spanning Tree (MST) of G maintained using adjacency lists. Suppose a new weighted edge (u,v)∈V×V is added to G. The worst case time complexity of determining if T is still an MST of the resultant graph is
- 422 marks · MCQ · HardConsider the following languages.
- 432 marks · MCQ · EasyConsider the productions A→PQ and A→XY. Each of the five non-terminals A, P, Q, X, and Y has two attributes: s is a synthesized attribute, and i is an inherited attribute. Consider the following rules.
- 442 marks · MCQ · ModerateEach of a set of n processes executes the following code using two semaphores a and b initialized to 1 and 0, respectively. Assume that count is a shared variable initialized to 0 and not used in CODE SECTION P.
- 452 marks · MCQ · ModerateConsider the following five disk access requests of the form (request id, cylinder number) that are present in the disk scheduler queue at a given time.
- 462 marks · MCQ · EasyConsider a relational table R that is in 3NF, but not in BCNF. Which one of the following statements is TRUE?
- 472 marks · MCQ · ModerateConsider a schedule of transactions T1 and T2:
- 482 marks · MCQ · ModerateAn organization requires a range of IP addresses to assign one to each of its 1500 computers. The organization has approached an Internet Service Provider (ISP) for this task. The ISP uses CIDR and serves the requests from the available IP address space 202.61.0.0/17. The ISP wants to assign an address space to the organization which will minimize the number of routing entries in the ISP's router using route aggregation. Which of the following address spaces are potential candidates from which the ISP can allot any one to the organization?
- 492 marks · MCQ · ModerateWhich one of the following predicate formulae is NOT logically valid?
- 502 marks · MCQ · HardLet G=(V,E) be a directed, weighted graph with weight function w:E→R. For some function f:V→R, for each edge (u,v)∈E, define w′(u,v) as w(u,v)+f(u)−f(v).
- 512 marks · MCQ · ModerateIn a balanced binary search tree with n elements, what is the worst case time complexity of reporting all elements in range [a,b]? Assume that the number of reported elements is k.
- 522 marks · NAT · HardThe number of permutations of the characters in LILAC so that no character appears in its original position, if the two L's are indistinguishable, is ____.
- 532 marks · NAT · ModerateConsider a non-pipelined processor operating at 2.5GHz. It takes 5 clock cycles to complete an instruction. You are going to make a 5-stage pipeline out of this processor. Overheads associated with pipelining force you to operate the pipelined processor at 2GHz. In a given program, assume that 30% are memory instructions, 60% are ALU instructions and the rest are branch instructions. 5% of the memory instructions cause stalls of 50 clock cycles each due to cache misses and 50% of the branch instructions cause stalls of 2 cycles each. Assume that there are no stalls associated with the execution of ALU instructions. For this program, the speedup achieved by the pipelined processor over the non-pipelined processor (round off to 2 decimal places) is ____.
- 542 marks · NAT · ModerateA processor has 64 registers and uses 16-bit instruction format. It has two types of instructions: I-type and R-type. Each I-type instruction contains an opcode, a register name, and a 4-bit immediate value. Each R-type instruction contains an opcode and two register names. If there are 8 distinct I-type opcodes, then the maximum number of distinct R-type opcodes is ____.
- 552 marks · NAT · ModerateFor n>2, let a∈{0,1}n be a non-zero vector. Suppose that x is chosen uniformly at random from {0,1}n. Then, the probability that ∑i=1naixi is an odd number is ____.
- 562 marks · NAT · ModerateConsider the following C functions.
- 572 marks · NAT · ModerateConsider the array representation of a binary min-heap containing 1023 elements. The minimum number of comparisons required to find the maximum in the heap is ____.
- 582 marks · NAT · ModerateConsider the following C functions.
- 592 marks · NAT · ModerateConsider a graph G=(V,E), where V={v1,v2,…,v100}, E={(vi,vj)∣1≤i<j≤100}, and weight of the edge (vi,vj) is ∣i−j∣. The weight of minimum spanning tree of G is ____.
- 602 marks · NAT · ModerateConsider the following set of processes, assumed to have arrived at time 0. Consider the CPU scheduling algorithms Shortest Job First (SJF) and Round Robin (RR). For RR, assume that the processes are scheduled in the order P1,P2,P3,P4.
- 612 marks · NAT · ModerateConsider the following language.
- 622 marks · NAT · ModerateGraph G is obtained by adding vertex s to K3,4 and making s adjacent to every vertex of K3,4. The minimum number of colours required to edge-colour G is ____.
- 632 marks · NAT · HardConsider a paging system that uses 1-level page table residing in main memory and a TLB for address translation. Each main memory access takes 100ns and TLB lookup takes 20ns. Each page transfer to/from the disk takes 5000ns. Assume that the TLB hit ratio is 95%, page fault rate is 10%. Assume that for 20% of the total page faults, a dirty page has to be written back to disk before the required page is read in from disk. TLB update time is negligible. The average memory access time in ns (round off to 1 decimal places) is _____.
- 642 marks · NAT · ModerateConsider a database implemented using B+ tree for file indexing and installed on a disk drive with block size of 4KB. The size of search key is 12bytes and the size of tree/disk pointer is 8bytes. Assume that the database has one million records. Also assume that no node of the B+ tree and no records are present initially in main memory. Consider that each record fits into one disk block. The minimum number of disk accesses required to retrieve any record in the database is ____.
- 652 marks · NAT · ModerateConsider a TCP connection between a client and a server with the following specifications: the round trip time is 6ms, the size of the receiver advertised window is 50KB, slow-start threshold at the client is 32KB, and the maximum segment size is 2KB. The connection is established at time t=0. Assume that there are no timeouts and errors during transmission. Then the size of the congestion window (in KB) at time t+60ms after all acknowledgements are processed is ____.