- 1Aptitude · 1 mark · MCQ · EasyDespite his initial hesitation, Rehman's ____ to contribute to the success of the project never wavered.
- 2Aptitude · 1 mark · MCQ · EasyBird : Nest :: Bee : _____
- 3Aptitude · 1 mark · MCQ · ModerateIf Pex=Qe−x for all real values of x, which one of the following statements is true?
- 4Aptitude · 1 mark · MCQ · ModerateThe paper as shown in the figure is folded to make a cube where each square corresponds to a particular face of the cube. Which one of the following options correctly represents the cube?
- 5Aptitude · 1 mark · MCQ · ModerateLet p1 and p2 denote two arbitrary prime numbers. Which one of the following statements is correct for all values of p1 and p2?
- 6Aptitude · 2 marks · MCQ · EasyBased only on the conversation below, identify the logically correct inference:
- 7Aptitude · 2 marks · MCQ · EasyIf IMAGE and FIELD are coded as FHBNJ and EMFJG respectively then, which one among the given options is the most appropriate code for BEACH ?
- 8Aptitude · 2 marks · MCQ · EasyWhich one of the following options is correct for the given data in the table?
- 9Aptitude · 2 marks · MCQ · ModerateIn the given figure, PQRS is a square of side 2cm and PLMN is a rectangle. The corner L of the rectangle is on the side QR. Side MN of the rectangle passes through the corner S of the square.
- 10Aptitude · 2 marks · MCQ · ModerateThe diagram below shows a river system consisting of 7 segments, marked P, Q, R, S, T, U, and V. It splits the land into 5 zones, marked Z1, Z2, Z3, Z4, and Z5. We need to connect these zones using the least number of bridges. Out of the following options, which one is correct?
- 111 mark · MCQ · EasyIf A=(122−1), then which ONE of the following is A8 ?
- 121 mark · MCQ · EasyThe value of x such that x>1, satisfying the equation ∫1xtlntdt=41 is
- 131 mark · MCQ · EasyConsider a binary tree T in which every node has either zero or two children. Let n>0 be the number of nodes in T.
- 141 mark · MCQ · EasyLet L,M, and N be non-singular matrices of order 3 satisfying the equations
L2=L−1,M=L8 and N=L2.
- 151 mark · MCQ · EasyLet P(x) be an arbitrary predicate over the domain of natural numbers.
- 161 mark · MCQ · EasyConsider the following statements:
- 171 mark · MCQ · EasyConsider the routing protocols given in List I and the names given in List II:
- 181 mark · MCQ · ModerateA machine receives an IPv4 datagram. The protocol field of the IPv4 header has the protocol number of a protocol X.
- 191 mark · MCQ · ModerateConsider the following C program:
- 201 mark · MCQ · EasyConsider an unordered list of N distinct integers.
- 211 mark · MCQ · ModerateConsider the following statements about the use of backpatching in a compiler for intermediate code generation:
- 221 mark · MCQ · ModerateGiven the following syntax directed translation rules:
- 231 mark · MCQ · ModerateConsider a network that uses Ethernet and IPv4. Assume that IPv4 headers do not use any options field. Each Ethernet frame can carry a maximum of 1500 bytes in its data field. A UDP segment is transmitted. The payload (data) in the UDP segment is 7488 bytes.
- 241 mark · MCQ · EasyWhich ONE of the following languages is accepted by a deterministic pushdown automaton?
- 251 mark · MCQ · ModerateLet G1,G2 be Context Free Grammars (CFGs) and R be a regular expression. For a grammar G, let L(G) denote the language generated by G.
- 261 mark · MCQ · ModerateProcesses P1, P2, P3, P4 arrive in that order at times 0, 1, 2, and 8 milliseconds respectively, and have execution times of 10, 13, 6, and 9 milliseconds respectively. Shortest Remaining Time First (SRTF) algorithm is used as the CPU scheduling policy. Ignore context switching times.
- 271 mark · MSQ · HardAn audit of a banking transactions system has found that on an earlier occasion, two joint holders of account A attempted simultaneous transfers of Rs. 10000 each from account A to account B. Both transactions read the same value, Rs. 11000, as the initial balance in A and were allowed to go through. B was credited Rs. 10000 twice. A was debited only once and ended up with a balance of Rs. 1000.
- 281 mark · MSQ · EasyWhich of the following is/are part of an Instruction Set Architecture of a processor?
- 291 mark · MSQ · ModerateWhich of the following statements regarding Breadth First Search (BFS) and Depth First Search (DFS) on an undirected simple graph G is/are TRUE?
- 301 mark · MSQ · ModerateConsider the two lists List I and List II given below:
- 311 mark · MSQ · ModerateConsider the following logic circuit diagram.
- 321 mark · NAT · HardThe following two signed 2's complement numbers (multiplicand M and multiplier Q) are being multiplied using Booth's algorithm:
- 331 mark · NAT · Easyint x=126,y=105;
do {
if(x>y) x=x-y;
else y=y-x;
} while(x!=y);
- 341 mark · NAT · EasyIn a 4-bit ripple counter, if the period of the waveform at the last flip-flop is 64μs, then the frequency of the ripple counter in kHz is _______. (Answer in integer)
- 351 mark · NAT · ModerateSuppose the values 10,−4,15,30,20,5,60,19 are inserted in that order into an initially empty binary search tree. Let T be the resulting binary search tree. The number of edges in the path from the node containing 19 to the root node of T is ____________. (Answer in integer)
- 362 marks · MCQ · EasySuppose we are transmitting frames between two nodes using Stop-and-Wait protocol. The frame size is 3000 bits. The transmission rate of the channel is 2000 bps (bits/second) and the propagation delay between the two nodes is 100 milliseconds. Assume that the processing times at the source and destination are negligible. Also, assume that the size of the acknowledgement packet is negligible. Which ONE of the following most accurately gives the channel utilization for the above scenario in percentage?
- 372 marks · MCQ · ModerateLet G be an edge-weighted undirected graph with positive edge weights. Suppose a positive constant α is added to the weight of every edge.
- 382 marks · MCQ · ModerateA meld operation on two instances of a data structure combines them into one single instance of the same data structure. Consider the following data structures:
- 392 marks · MCQ · EasyFor a direct-mapped cache, 4 bits are used for the tag field and 12 bits are used to index into a cache block. The size of each cache block is one byte. Assume that there is no other information stored for each cache block.
- 402 marks · MCQ · HardGiven a Context-Free Grammar G as follows:
- 412 marks · MCQ · ModerateAn array A of length n with distinct elements is said to be bitonic if there is an index 1≤i≤n such that A[1…i] is sorted in the non-decreasing order and A[i+1…n] is sorted in the non-increasing order.
- 422 marks · MSQ · ModerateLet F be the set of all functions from {1,…,n} to {0,1}. Define the binary relation ⩽ on F as follows:
- 432 marks · MSQ · EasyGiven the following Karnaugh Map for a Boolean function F(w,x,y,z):
- 442 marks · MSQ · ModerateConsider a system of linear equations PX=Q where P∈R3×3 and Q∈R3×1. Suppose P has an LU decomposition, P=LU, where
- 452 marks · MSQ · HardConsider a stack data structure into which we can PUSH and POP records. Assume that each record pushed in the stack has a positive integer key and that all keys are distinct.
- 462 marks · MSQ · ModerateConsider the following relational schema along with all the functional dependencies that hold on them.
- 472 marks · MSQ · HardConsider a demand paging system with three frames, and the following page reference string: 1 2 3 4 5 4 1 6 4 5 1 3 2. The contents of the frames are as follows initially and after each reference (from left to right):
- 482 marks · MSQ · ModerateP={P1,P2,P3,P4} consists of all active processes in an operating system.
R={R1,R2,R3,R4} consists of single instances of distinct types of resources in the system.
- 492 marks · MSQ · ModerateThree floating point numbers X, Y, and Z are stored in three registers RX, RY, and RZ, respectively in IEEE 754 single precision format as given below in hexadecimal:
- 502 marks · MSQ · ModerateWhich of the following Boolean algebraic equation(s) is/are CORRECT?
- 512 marks · MSQ · ModerateConsider two grammars G1 and G2 with the production rules given below:
- 522 marks · MSQ · ModerateLet Σ={a,b,c}. For x∈Σ∗, and α∈Σ, let #α(x) denote the number of occurrences of α in x.
- 532 marks · MSQ · ModerateConsider the database transactions T1 and T2, and data items X and Y. Which of the schedule(s) is/are conflict serializable?
- 542 marks · MSQ · ModerateConsider the following relational schema:
- 552 marks · NAT · ModerateGiven a computing system with two levels of cache (L1 and L2) and a main memory. The first level (L1) cache access time is 1ns and the "hit rate" for L1 cache is 90% while the processor is accessing the data from L1 cache. Whereas, for the second level (L2) cache, the "hit rate" is 80% and the "miss penalty" for transferring data from L2 cache to L1 cache is 10ns. The "miss penalty" for the data to be transferred from main memory to L2 cache is 100ns.
- 562 marks · NAT · Moderaterespectively, in nanoseconds. The delay of an inter-stage latch is 10 nanoseconds. Assume that there are no pipeline stalls due to branches and other hazards. The time taken to process 1000 instructions in microseconds is _____ (rounded off to two decimal places)
- 572 marks · NAT · HardIn a B+- tree where each node can hold at most four key values, a root to leaf path consists of the following nodes:
- 582 marks · NAT · ModerateA computer system supports a logical address space of 232 bytes. It uses two-level hierarchical paging with a page size of 4096 bytes. A logical address is divided into a b-bit index to the outer page table, an offset within the page of the inner page table, and an offset within the desired page. Each entry of the inner page table uses eight bytes. All the pages in the system have the same size.
- 592 marks · NAT · ModerateConsider the following algorithm someAlgo that takes an undirected graph G as input.
- 602 marks · NAT · HardLet Σ={1,2,3,4}. For x∈Σ∗, let prod(x) be the product of symbols in x modulo 7. We take prod(ϵ)=1, where ϵ is the null string.
- 612 marks · NAT · ModerateAn application executes 6.4×108 number of instructions in 6.3 seconds. There are four types of instructions, the details of which are given in the table. The duration of a clock cycle in nanoseconds is _____ (rounded off to one decimal place)
- 622 marks · NAT · EasyConsider the following C program:
- 632 marks · NAT · EasyConsider the following C program:
- 642 marks · NAT · HardA quadratic polynomial (x−α)(x−β) over complex numbers is said to be square invariant if (x−α)(x−β)=(x−α2)(x−β2). Suppose from the set of all square invariant quadratic polynomials we choose one at random.
- 652 marks · NAT · ModerateThe unit interval (0,1) is divided at a point chosen uniformly distributed over (0,1) in R into two disjoint subintervals.