1 The order of an internal node in a B+
tree index is the maximum number of children it can have. Suppose that a child
pointer takes 6 bytes, the search
field value takes 14 bytes, and the block size is 512 bytes. What is the order of the internal node?A) 24B) 25C) 26D) 27Answer : (C)
2 The Boolean function x, y, + xy + x, yA) x, + y,B) x + yC) x + y,D) x, + yAnswer : (D)3 In an MxN matrix such that all non-zero entries are covered in a rows and b columns. Then the maximum number of non-zero entries, such that no two are on the same row or column, isA) £ a + b B) £ max {a, b}C) £ min {M-a, N-b}D) £ min {a, b} Answer : (A)4 The relation scheme Student Performance (name, courseNo, rollNo, grade) has the following functional dependencies: A) name, courseNo -> gradeB) rollNo, courseNo -> gradeC) name -> rollNoD) rollNo -> name The highest normal form of this relation scheme isAnswer : (A)5 The minimum number of page
frames that must be allocated to a running process in a virtual memory environment is determined byA) the instruction set
architectureB) page sizeC) physical memory size D) number of processes in memoryAnswer : (D)6 Let G be a simple graph with 20 vertices and 100 edges. The size of the minimum vertex cover of G is 8. Then, the size of the maximum independent set of G isA) 12 B) 8 C) Less than 8 D)
More than 12Answer : (A)7 What does the following algorithm approximate? (Assume m > 1, Î > 0).x = m;y-i;while (x - y > Î){ x = (x + y) / 2 ;y = m/x ;}print (x) ;A) log m B) m2C) m1/2 D) m1/3Answer : (C)8 Consider the following C programmain (){ int x, y, m, n ;scanf ("%d %d", &x, &y);/ * Assume x > 0 and y > 0 * /m = x; n = y ;while ( m ! = n){ if (m > n)m = m — n;elsen = n - m ; }printf("%d",n); }The program computesA) x + y, using repeated subtractionB) x mod y using repeated subtractionC) the greatest common divisor of x and yD) the least common multiple of x and yAnswer : (C)9 The best data structure to check whether an arithmetic expression has balanced parentheses is aA) queueB) stackC) treeD) listAnswer : (B)10 A Priority-Queue is implemented as a Max-Heap. Initially, it has 5 elements. The level-order traversal of the heap is given below: 10, 8,5,3,2 Two new elements 1 and 7 are inserted in the heap in that order. The level-order traversal of the heap after the insertion of the elements isA) 10,8,7,5,3,2,1B) 10,8,7,2,3,1,5C) 10,8,7,1,2,3,5D) 10,8,7,3,2,1,5Answer : (D)11 An organization has a class B network and wishes to form subnets for 64 departments. The subnet mask would beA) 255.255.0.0B) 255.255.64.0 C) 255.255.128.0D) 255.255.252.0Answer : (D)12 Suppose the round
trip propagation delay for a 10 Mbps Ethernet having 48-bit jamming signal is 46.4 ms. The minimum frame size is:A) 94B) 416C) 464D) 512Answer : (C)13 The following numbers are inserted into an empty binary search tree in the given order: 10, 1, 3, 5, 15, 12, 16. What is the height of the binary search tree (the height is the maximum distance of a leaf node from the root)?A) 2B) 3C) 4D) 6Answer : (B)14 Consider the following C function:int f (int n){ static int i = 1;if (n >= 5) return n;n = n + i;i ++;return f (n);}The value returned by f(1) isA) 5B) 6C) 7D) 8Answer : (C)15 The minimum number of page frames that must be allocated to a running process in a virtual memory environment is determined byA) the instruction set architectureB) page size C) physical memory size D) number of processes in memoryAnswer : (D)1 The address resolution protocol (ARP) is used forA) Finding the IP address from the DNSB) Finding the IP address of the default gatewayC) Finding the IP address that corresponds to a MAC addressD) Finding the MAC address that corresponds to an IP addressAnswer : (D)
2 Consider the following relation schema pertaining to a students database:Student (rollno, name, address)Enroll (rollno, courseno, coursename)where the primary keys are shown underlined. The number of tuples in the Student and Enroll tables are 120 and 8 respectively. What are the maximum and minimum number of tuples that can be present in (Student * Enroll), where ‘*’denotes natural join?A) 8, 8B) 120, 8C) 960, 8D) 960, 120Answer : (C)3 Consider a direct mapped cache of size 32 KB with block size 32 bytes. The CPU generates 32 bit addresses. The number of bits needed for cache indexing and the number of tag bits are respectivelyA) 10, 17 B) 10, 22C) 15, 17 D) 5, 17 Answer : (A)4 The goal of structured programming is to A) have well indented programsB) be able to infer the flow of control from the compiled codeC) be able to infer the flow of control from the program textD) avoid the use of GOTO statements Answer : (C)5 The tightest lower bound on the number of comparisons, in the worst ease, for comparison-based sorting is of the order ofA) nB) n 2C) n log n D) n log2 nAnswer : (B)6 Let G be a simple graph with 20 vertices and 100 edges. The size of the minimum vertex cover of G is 8. Then, the size of the maximum independent set of G isA) 12 B) 8 C) Less than 8 D) More than 12Answer : (A)7 WA and B are the only two stations on an Ethernet. Each has a steady queue of frames to send. Both A and B attempt to transmit a frame, collide, and A wins the first backoff race. At the end of this successful transmission by A, both A and B attempt to transmit and collide. The probability that A wins the second backoff race isA) 0.5 B) 0.625C) 0.75 D) 1.0Answer : (A)8 Let A be a sequence of 8 distinct integers sorted in ascending order. How many distinct pairs of sequences, B and C are there such that (i) each is sorted in ascending order, (ii) B has 5 and C has 3 elements, and (iii) the result of merging B and C gives A? A) 2B) 30C) 56D) 256Answer : (D)9 In a network of LANs connected by bridges, packets are sent from one LAN to another through intermediate bridges. Since more than one path may exist between two LANs, packets may have to be routed through multiple bridges.Why is the spanning tree algorithm used for bridge-routing? A) For shortest path routing between LANsB) For avoiding loops in the routing pathsC) For fault toleranceD) For minimizing collisionsAnswer : (B)10 A Priority-Queue is implemented as a Max-Heap. Initially, it has 5 elements. The level-order traversal of the heap is given below: 10, 8,5,3,2 Two new elements 1 and 7 are inserted in the heap in that order. The level-order traversal of the heap after the insertion of the elements isA) 10,8,7,5,3,2,1B) 10,8,7,2,3,1,5C) 10,8,7,1,2,3,5D) 10,8,7,3,2,1,5Answer : (D)11 An organization has a class B network and wishes to form subnets for 64 departments. The subnet mask would beA) 255.255.0.0B) 255.255.64.0 C) 255.255.128.0D) 255.255.252.0Answer : (D)12 Suppose the round trip propagation delay for a 10 Mbps Ethernet having 48-bit jamming signal is 46.4 ms. The minimum frame size is:A) 94B) 416C) 464D) 512Answer : (C)1 The problems 3-SAT and 2-SAT areA) both in PB) both NP-completeC) NP-complete and in P respectivelyD) undecidable and NP-complete respectivelyAnswer : (C)
2 Consider the following relation schema pertaining to a students database:Student (rollno, name, address)Enroll (rollno, courseno, coursename)where the primary keys are shown underlined. The number of tuples in the Student and Enroll tables are 120 and 8 respectively. What are the maximum and minimum number of tuples that can be present in (Student * Enroll), where ‘*’denotes natural join?A) 8, 8B) 120, 8C) 960, 8D) 960, 120Answer : (C)3 Consider a relation scheme R = (A, B, C, D, E, H) on which the following functional dependencies hold : (A -> B, BC -> D, E -> C, D -> A). What are the candidate keys of R?A) AE, BE B) AE, BE, DEC) AEH, BEH, BCHD) AEH, BEH, DEH Answer : (D)4 The goal of structured programming is to A) have well indented programsB) be
able to infer the flow of control from the compiled codeC) be able to infer the flow of control from the program textD) avoid the use of GOTO statements Answer : (C)5 The tightest lower bound on the number of comparisons, in the worst ease, for comparison-based sorting is of the order ofA) nB) n 2C) n log n D) n log2 nAnswer : (B)6 A circuit outputs a digit in the form of 4 bits. 0 is represented by 0000,1 by 0001,..., 9 by 1001. A combinational circuit is to be designed which takes these 4 bits as input and outputs 1 if the digit ³ 5, and 0 otherwise. If only AND, OR and NOT gates may be used, what is the minimum number of gates requiredA) 2B) 3 C) 4 D) 5Answer : (C)7 WA and B are the only two stations on an Ethernet. Each has a steady queue of
frames to send. Both A and B attempt to transmit a frame, collide, and A wins the first backoff race. At the end of this successful transmission by A, both A and B attempt to transmit and collide. The probability that A wins the second backoff race isA) 0.5 B) 0.625C) 0.75 D) 1.0Answer : (A)8 If 73x (in base-x number system) is equal to 54y (in base-y number system), the possible values of x and y are A) 8, 16B) 10, 12C) 9, 13D) 8, 11Answer : (D)9 In a packet switching network, packets are routed from source to destination along a single path having two intermediate nodes. If the message size is 24 bytes and each packet contains a header of 3 bytes, then the optimum packet size is A) 4B) 6C) 7D) 9Answer : (D)10 A Priority-Queue is implemented as a Max-Heap. Initially, it has 5 elements. The level-order traversal of the heap is given below: 10, 8,5,3,2 Two new elements 1 and 7 are inserted in the heap in that order. The level-order traversal of the heap after the insertion of the elements isA) 10,8,7,5,3,2,1B) 10,8,7,2,3,1,5C) 10,8,7,1,2,3,5D) 10,8,7,3,2,1,5Answer : (D)11 Consider an operating system capable of loading and executing a single sequential user process at a time. The disk head scheduling algorithm used is First Come First Served (FCFS). If FCFS is replaced by Shortest Seek Time First (SSTF), claimed by the vendor to give 50% better benchmark results, what is the expected improvement in the I/O performance of user programs ?A) 50%B) 40% C) 25%br> D) 0%Answer : (D)12 How many distinct binary
search trees can be created out of 4 distinct keys?A) 5B) 14C) 24D) 42Answer : (B)
Q-1 Select the one true statement. A) Every
binary tree is either complete or full.B) Every complete binary tree is also a full binary tree.C) Every full binary tree is also a complete binary treeD) No binary tree is both complete and full.
Q-2 Which data structure has the fastest insertion procedure? A) Binary search treeB) Ordered arrayC) HeapD) Unordered linked listE) Ordered linked list
Q-3 What are the complexities of the insert, remove and search methods of a binary search tree in the worst case? A) insert is O(n), remove is O(n), search is O(n)B) insert is O(log n), remove is O(log n), search is O(n)C) insert is O(log n), remove is O(log n), search is O(log n)D) insert is O(log n), remove is O(log n), search is O(1)E) These methods can't be defined on a binary search tree
Q-4 This
Ethernet frame type is characterized by its use of the code AA in the SAP fields. A) Ethernet IIB) Ethernet RAWC) Ethernet 802.2D) Ethernet SNAP
Q-5 Which of the following are examples of routed protocols? (Choose all that apply) A) IPB) IPXC) RIPD) OSPFE) AppleTalk
Q-6 If switches are used to replace
hubs on a network, which of the following statements is true? A) The number of
broadcast domains will decreaseB) The number of collision domains will increaseC) The number of collision domains will decreaseD) The number of broadcast domains will be zero
Q-7 Full duplex Ethernet communication is only possible when:
A. Systems are connected to same
LAN segmentsB. Systems are connected to a bridged portsC. Systems are connected to their own
switch portD. Systems are running over a fiber optic connection
Q-8
SQL is the combination ofA ) DDL and DQLB ) DDL , DML and DQLC ) DDL,DML,DQL and DCLD ) None of theseQ-9 Which of the following applications may use a stack?A) A parentheses balancing program. B) Keeping track of local variables at run time. C) Syntax analyzer for a
compiler. D) All of the aboveQ -10 Consider the implementation of the Stack using a partially-filled array. What goes wrong if we try to store the top of the Stack at location [0] and the bottom of the Stack at the last used position of the array?A) Both peek and pop would require linear time. B) Both push and pop would require linear time. C) The Stack could not be used to check balanced parentheses. D) The Stack could not be used to evaluate postfix expressions.
