User Rating: 3 / 5

Instructions to the Candidate

1. Click on the Question to View the options.
2. Select the option by clicking on the radio button on left side of the option.
3. If after Selection the option turns Green, then you selected the right answer.
4. If after Selection the option turns Red, then you selected the wrong answer, try again.
5. To know the answer with explanation and shortcut (if any) click on Show/Hide Ans & explanation below the options.
6. If you find any answer/explanation wrong, please report it immediately at publisher@completegate.com.
8. Best Wishes from Team Complete GATE for your GATE 2014 preparations.

Q1.The goal of structured programming is to
(A)have well indented programs
(B) be able to infer the flow of control from the compiled code
(C)be able to infer the flow of control form the program text
(D) avoid the use of GOTO statements

Show/Hide Ans & Explaination
Answer: (C)be able to infer the flow of control form the program text

Explaination:

Q2. Consider the following C function
vaid swap (int a, int b)
{
int temp;
temp = a;
a =b;
b =temp;
}
In order to exchange the values of two variables x and y.
(A) call swap (x, y)
(B) call swap (&x, &y)
(C) swap (x,y) cannot be used as it does not return any value
(D) swap (x,y) cannot be used as the parameters are passed by value

Show/Hide Ans & Explaination
Answer: (D) swap (x,y) cannot be used as the parameters are passed by value

Explaination:

Q3. A single array A[1..MAXSIZE] is used to implement two stacks. The two stacks grow from
opposite ends of the array. Variables top1 and top 2 (topl< top 2) point to the location of the
topmost element in each of the stacks. If the space is to be used efficiently, the condition for
“stack full” is
(A)(top1 = MAXSIZE/2) and (top2 = MAXSIZE/2+1)
(B)top1 + top2 = MAXSIZE
(C) (top1 = MAXSIZE/2) or (top2 = MAXSIZE)
(D) top1 = top2 -1

Show/Hide Ans & Explaination
Answer: (D) top1 = top2 -1

Explaination:

Q4. 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) 2
(B) 3
(C) 4
(D) 6

Show/Hide Ans & Explaination

Explaination:

Q5. The best data structure to check whether an arithmetic expression has balanced parentheses is a
(A) Queue
(B) stack
(C) Tree
(D) List

Show/Hide Ans & Explaination

Explaination:

Q6. Level order traversal of a rooted tree can be done by starting from the root and performing
(A) preorder traversal
(B) in-order traversal
(C) depth first search

Show/Hide Ans & Explaination

Explaination:

Q7. Given the following input (4322, 1334, 1471, 9679, 1989, 6171, 6173, 4199) and the hash
function x mod 10,which of the following statements are true?
(i)9679, 1989, 4199 hash to the same value
(ii)1471, 6171 has to the same value
(iii)All elements hash to the same value
(iv)Each element hashes to a different value
(A) i only
(B)ii only
(C) i and ii only
(D) iii or iv

Show/Hide Ans & Explaination
Answer: (C) i and ii only

Explaination:

Q8. Which of the following grammar rules violate the requirements of an operator grammar?
P. Q, R are nonterminals,
and r,s,t are terminals.
(i) P→QR
(ii) P→QsR
(iii) P→ε
(iv) P→QtRr
(A) (i) only
(B) (i) and (iii) only
(C) (ii) and (iii) only
(D) (iii) and (iv) only

Show/Hide Ans & Explaination

Explaination:

Q9. Consider a program P that consists of two source modules M1 and M2 contained in two different files.
If M1 contains a reference to a function defined in M2 the reference will be resolved at
(A) Edit time
(B) Compile time

Show/Hide Ans & Explaination

Explaination:

Q10. Consider the grammar rule E --> E1 - E2 for arithmetic expressions. The code generated is targeted to
a CPU having a single user register.The subtraction operation requires the first operand to be in the register.
If E1 and E2 do not have nay-common sub-expression, in order to get the shortest possible code
(A) E1 should be evaluated first
(B) E2 should be evaluated first
(C) Evaluation of E1 and E2 should necessarily be interleaved
(D) Order to evaluation of E1 and E2 is of no consequence

Show/Hide Ans & Explaination
Answer: (D) Order to evaluation of E1 and E2 is of no consequence

Explaination:

Q11. Consider the following statements with respect to user-level threads and
(i) context switch is faster with kernel-supported threads
(ii) for user-level threads, a system call can block the entire process
(iii) Kernel supported threads can be scheduled independently
(iv) User level threads are transparent to the kernel Which of the above statements are true?
(A) (ii), (iii) and (iv) only
(B) (ii) and (iii) only
(C) (i) and (iii) only
(D) (i) and (ii) only

Show/Hide Ans & Explaination
Answer: (A) (ii), (iii) and (iv) only

Explaination:

Q12. 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 5O%
better benchmark results, what is the expected improvement in the I/O performance of user programs?
(A) 50%
(B) 40%
(C) 25%
(D) 0%

Show/Hide Ans & Explaination

Explaination:

Q13. Let R1 (A,B,((D) and R2 (D,E) be two relation schema, where the primary keys are shown
underlined, and let C be a foreign key in R1 referring to R2. Suppose there is no violation of the
above referential integrity constraint in the corresponding relation instances r1 and r2. Which one of
the following relational algebra expressions would necessarily produce an empty relation?
(A) ∏o(r2)-∏c(r1)
(B) ∏c(r1)-∏d(r2)
(C) ∏D(r1∞(c< D) r2)
(D) ∏c(r1∞(c= D) r2

Show/Hide Ans & Explaination

Explaination:

Q14. Consider the following relation schema pertaining to a students database:
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,8
(B) 120,8
(C) 960,8
(D) 960,120

Show/Hide Ans & Explaination

Explaination:

Q15. Choose the best matching between Group 1 and Group 2

GROUP I                                                   GROUP II

(P) Data link layer                                (1) Ensures reliable transport of data over a physical point-to-point
(Q) Network layer systems                   (2) Encodes/decodes data for physical transimission
(R) Transport layer                                (3) Allows end-to-end communication between two processes
(4) Routes data from one network node to the next

(A) P—1,Q—4,R-3
(B) P—2,Q—4,R-1
(C) P—2,Q—3,R-1
(D) P—1,Q—3,R-2

Show/Hide Ans & Explaination

Explaination:

Q16. Which of the following is NOT true with respect to a transparent bridge and a router?
(A) Both bridge and router selectively forward data packets
(B) A bridge uses IP addresses while a router uses MAC addresses
(C) A bridge builds up its routing table by inspecting incoming packets
(D) A router can connect between a LAN and a WAN

Show/Hide Ans & Explaination

Explaination:

Q17. A Boolean function x’y’+xy+x’y is equivalent to
(A) x’+y’
(B) x+y
(C) x+y’
(D) x’+y

Show/Hide Ans & Explaination

Explaination:

Q18. In an SR latch made by cross-coupling two NAND gates, if both S and R inputs are set to 0,
then it will result in
(A) Q=0,Q’=l
(B) Q=1,Q’=O
(C) Q=1,Q’=1
(D) Indeterminate states

Show/Hide Ans & Explaination

Explaination:

Q19. 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, 16
(B) 10, 12
(C) 9, 13
(D) 8, 11

Show/Hide Ans & Explaination

Explaination:

Q20. Which of the following addressing modes are suitable for program relocation at run time?
(A) (i) and (iv)
(B) (i) and (ii)
(C) (ii) and (iii)
(D) (i), (ii) and (iv)

Show/Hide Ans & Explaination

Explaination:

Q21. The minimum number of page frames that must be allocated to a running process in a
virtual memory environment is determined by
(A) the instruction set architecture
(B) page size
(C) physical memory size
(D) number of processes in memory

Show/Hide Ans & Explaination
Answer: (A) the instruction set architecture

Explaination:

Q22. How many 8-bit characters can be transmitted per second over a 9600 baud serial
communication link using asynchronous mode of transmission with one start bit, eight databits,
two stop bits, and one parity bit?
(A) 600
(B) 800
(C) 876
(D) 1200

Show/Hide Ans & Explaination

Explaination:

Q23. Identify the correct translation into logical notation of the following assertion. Some boys
in the class are taller than all the girls
Note: taller (x,y) is true if x is taller than y.
(A) (∃x) (boy(x) → (∀y) (girl(y) ∧ taller(x,y)))
(B) (∃x) (boy(x) ∧ (∀y) (girl(y) ∧ taller(x,y)))
(C) (∃x) (boy(x) → (∀y) (girl(y) → taller(x,y)))
(D) (∃x) (boy(x) ∧ (∀y) (girl(y) ∧ taller(x,y)))

Show/Hide Ans & Explaination
Answer: (D) (∃x) (boy(x) ∧ (∀y) (girl(y) ∧ taller(x,y)))

Explaination:

Q24. Consider the binary relation:
S = {(x,y)y =x+1 and x,y∈ {0,1,2})
The reflexive transitive closure of S is
(A) {(x,y)y > x and x,y∈ {O,1,2})
(B) {(x,y)y < x and x,y∈ {O,1,2})
(C) {(x,y)y < x and x,y∈ {0,1,2})
(D) {(x,y)y > x and x,y∈ {0,1,2})

Show/Hide Ans & Explaination
Answer: (B) {(x,y)y < x and x,y∈ {O,1,2})

Explaination:

Q25. The number of different n x n symmetric matrices with each element being either 0 or 1 is : (Note: power (2,x) is same as 2X)
(A) (ax) power (2,n)
(B) (ax) power(2,n2)
(C) (ax) power (2, (n2+n/2)
(D) power (2, (n2 — n)/2)

Show/Hide Ans & Explaination
Answer: (D) power (2, (n2 — n)/2)

Explaination:

Q26. Let A,B,C,D be n x n matrices, each with non-zero determinant. If ABCD=I, then B-1 is
(A) D-1 C-1 A- 1
(B) CDA
(D) none

Show/Hide Ans & Explaination

Explaination:

Q27. What is the result of evaluating the following two expressions using three-digit
floating point arithmetic with rounding?
(113.+—111.)+ 7.51
113.+(—111.+ 7.51)
(A) 9.51 and 10.0 respectively
(B) 10.0 and 9.51 respectively
(C) 9.51 and 9.51 respectively
(D) 10.0 and 10.0 respectively

Show/Hide Ans & Explaination
Answer: (A) 9.51 and 10.0 respectively

Explaination:

Q28. The tightest lower bound on the number of comparisons, in the worst case, for
comparison-based sorting is of the order of
(A) n
(B) n2
(C) nlogn
(D) nlog2n

Show/Hide Ans & Explaination

Explaination:

Q29. The problem 3-SAT and 2-SAT are
(A) both in P
(B) both Np complete
(C) NP-complete and in P respectively
(D) undecidable and NP-complete respectively

Show/Hide Ans & Explaination
Answer: (C) NP-complete and in P respectively

Explaination:

Q: 31-90 Carry TWO marks each

Q30. Consider the following C function:
int f(int n)
{ static int i = 1
if (n >=5) return n;
n = n+1;
i++;
return f(n);
}
The value returned by f(1) is
(A) 5
(B) 6
(C) 7
(D) 8

Show/Hide Ans & Explaination

Explaination:

Q31. Consider the following program fragment for reversing the digits in a given integer to
obtain a new integer. Let n = d1,d2...dn,.
int n, rev;
rev = 0;
while (n > 0) {
rev = rev *10+n %10;
n = n/10
}
The loop invariant condition at the end of the ith iteration is:
(A) n = d1,d2....dm, and rev=dm,dm-1•••dm- 1+i
(B) n = dm+1....dm or rev=dm-1...d2d1
(C) n=rev
(D) fl=d1d2.....dm or rev=dm...d2d1

Show/Hide Ans & Explaination
Answer: (A) n = d1,d2....dm, and rev=dm,dm-1•••dm-1+i

Explaination:

Q32. Consider the following C program segment:
char p [20];
char * s = “string”;
int length = strlen (s);
for (i = 0 ; i < length; i++)
p[i] = s[length — I];
print f(”°%”,p);
The output of the program is
(A) gnirts
(B) gnirt
(C) string
(D) no output is printed

Show/Hide Ans & Explaination

Explaination:

Q33. It is desired to design an object-oriented employee record system for a company.
Each employee has a name, unique id and salary. Employees belong to different
categories and their salary is determined by their category. The functions get
Name, getld and compute salary are required. Given the class hierarchy below,
possible locations for these functions are:
(i) getld is implemented in the superclass
(ii) getld is implemented in the subclass
(iii) getName is an abstract function in the superclass
(iv) getName is implemented in the superclass
(v) getName is implemented in the subclass
(vi) getSalary is an abstract function in the superclass
(vii)getSalary is implemented in the superclass
(viii) getSalary is implemented in the subclass
Choose the best design

(A) (i), (iv), (vi), (viii)
(B) (i), (iv), (vii)
(C) (i), (iii), (v), (vi), (viii)
(D) (ii), (v), (viii)

Show/Hide Ans & Explaination
Answer: (C) (i), (iii), (v), (vi), (viii)

Explaination:

Q34. Consider the label sequences obtained by the following pairs of traversals on a labeled binary tree. Which of these pairs identify a tree uniquely?
i) preorder and postorder
(ii) inorder and postorder
(iii) preorder and inorder
(iv) level order and postorder
(A) (i) only
(B) (ii), (iii)
(C) (iii) only
(D) (iv) only

Show/Hide Ans & Explaination

Explaination:

Q35. A circularly linked list is used to represent a Queue. A single variable p is used to access the Queue. To which node should p point such that both the operations enQueue and deQueue can be performed in constant time?

(A) rear node
(B) front node
(C) not possible with a single pointer
(D) node next to front

Show/Hide Ans & Explaination
Answer: (C) not possible with a single pointer

Explaination:

Q36. Assume that the operators +, -, x, are left associative and A is right associative. The order of precedence (from highest to lowest) is ^, x, +, -. The postfix expression corresponding to the infix expression a + bxc-d^e^f is
(A) abcx+def^^-
(B) abcx+de^f^-
(C) ab+cxd-e^f^
(D) - + axbc^^def

Show/Hide Ans & Explaination

Explaination:

Q37. Two matrices M1 and M2 are to be stored in arrays A and B respectively. Each array can be stored either in row-major or column-major order in contiguous memory locations. The time complexity of an algorithm to compute M1 x M2 will be
(A) best if A is in row-major, and B is in column major order
(B) best if both are in row-major order
(C) best if both are in column-major order
(D) independent of the storage scheme

Show/Hide Ans & Explaination
Answer: (A) best if A is in row-major, and B is in column major order

Explaination:

Q38. Suppose each set is represented as a linked list with elements in arbitray order. Which of the operations among union, intersection, membership, cardinality will be the slowest?
(A) union only
(B) intersection, membership
(C) membership, cardinality
(D) union, intersection

Show/Hide Ans & Explaination

Explaination:

Q39. Consider the following C program
main ( )
{ 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;
else
n = n - m;
} printf("%d",n); }
The program computes
(A) x + y using repeated subtraction
(B) x mod y using repeated subtraction
(C) the greatest common divisor of x and y
(D) the least common multiple of x and y

Show/Hide Ans & Explaination
Answer: (C) the greatest common divisor of x and y

Explaination:

Q40. What does the following algorithm approximate? (Assume m > 1, ∈ > 0).
X = m;
Y = 1;
While (x — y > ∈)
{ x=(x+y)/2;
y = m/x;
}
print (x);
(A) logm
(B) m2
(C) m1/2
(D) m1/3
Show/Hide Ans & Explaination

Explaination:

Q41. Consider the following C program segment
struct CellNode
{ struct CelINode *leftchild;
int element;
struct CelINode *rightChild;
int Dosomething (struct CelINode *ptr)
{
int value = 0;
if (ptr ! = NULL)
{ if (ptr - > leftChild ! = NULL)
value = 1 + DoSomething (ptr - > leftChild);
if (ptr - > rig htChild ! = NULL)
value = max(value,1 + DoSomething (ptr - > rightChild));
}
return (value);
}
The value returned by the function DoSomething when a pointer to the root of a non-empty tree is passed as argument is
(A) The number of leaf nodes in the tree
(B) The number of nodes in the tree
(C) The number of internal nodes in the tree
(D) The height of the tree

Show/Hide Ans & Explaination
Answer: (D) The height of the tree

Explaination:

Q42. Suppose we run Dijkstra’s single source shortest-path algorithm on the following edge-weighted directed graph with vertex P as the source. In what order do the nodes get included into the set of vertices for which the shortest path distances are finalized?
(A) P,Q,R,S,T,U
(B) P,Q,R,U,S,T
(C) P,Q,R,U,T,S
(D) P,Q,T,R,U,S

Show/Hide Ans & Explaination

Explaination:

Q43. Consider the grammar with the following translation rules and E as the start symbol.
E-> E1 # T {E.value = E1.value * T.value}
E-> T {E.value = T.value}
T-> T1 & F {T.value = T1.value * F.value}
T->F {T.value = F.value}
F-> num {F.value = num.value}
Compute E.value for the root of the parse tree for the expression:2 # 3 & 5 # 6 &4.
(A) 200
(B) 180
(C) 160
(D) 40

Show/Hide Ans & Explaination

Explaination:

Q44. Consider the following set of processes, with the arrival times and the CPU-burst times given in milliseconds Process Arrival (p1,p2,p3,p4), time (0,1,2,4) Burst time (5,3,3,1)
What is the average turnaround time for these processes with the preemptive shortest remaining processing time first (SRPT) algorithm?
(A) 5.5
(B) 5.75
(C) 6.0
(D) 6.25

Show/Hide Ans & Explaination

Explaination:

Q45. Consider a system with a two-level paging scheme in which a regular memory access takes 150 nanoseconds, and servicing a page fault takes 8 milliseconds. An average instruction takes 100 nanoseconds of CPU time, and two memory accesses. The TLB hit ratio is 90%, and the page fault rate is one in every 10,000 instructions. What is the effective average instruction execution time?
(A) 645 nanoseconds
(B) 1050 nanoseconds
(C) 1215 nanoseconds
(D) 1230 nanoseconds

Show/Hide Ans & Explaination

Explaination:

Q46. A unix-style I-node has 10 direct pointers and one single, one double and one triple indirect pointers. Disk block size is 1 Kbyte, disk block address is 32 bits, and 48-bit integers are used. What is the maximum possible file size?
(A) 224 bytes
(B) 232 bytes
(C) 220bytes
(D) 248 bytes

Show/Hide Ans & Explaination

Explaination:

Q47. The relation scheme Student Performance (name, courseNo, rolINo, grade) has the following functional dependencies:
name --> rolINo
rolINo --> name
The highest normal form of this relation scheme is
(A) 2 NF
(B) 3 NF
(C) BCNF
(D) 4 Nf

Show/Hide Ans & Explaination

Explaination:

Q48. Consider the relation Student (name, sex, marks), where the primary key is shown underlined, pertaining to students in a class that has at least one boy and one girl. What does the following relational algebra expression produce) (Note: p is the rename operator).
name (rsex=female (Student)) — ∏name (Student (sex=female^x=male^mark≤m), Ρn,x,m (Student))
(A) names of girl students with the highest marks
(B) names of girl students with more marks than some boy student
(C) names of girl students with marks not less than some boy student
(D) names of girl students with more marks than all the boy students

Show/Hide Ans & Explaination

Explaination:

Q49. 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) 24
(B) 25
(C) 26
(D) 27

Show/Hide Ans & Explaination

Explaination:

Q50. The employee information in a company is stored in the relation
Employee (name, sex, salary, deptName)
Consider the following SQL query
Select deptName From Employee
Where sex = "M"
Group by deptName
Having avg(salary) >
(select avg (salary) from Employee)
It returns the names of the department in which
(A) the average salary is more than the average salary in the company
(B) the average salary of male employees is more than the average salary of all male employees in the company
(C) the average salary of male employees is more than the average salary of employees in the same department.
(D) the average salary of male employees is more than the average salary in the company

Show/Hide Ans & Explaination
Answer: (D) the average salary of male employees is more than the average salary in the company

Explaination:

Q51. A 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 is
(A) o.5
(B) 0.625
(C) 0.75
(D) 1.0

Show/Hide Ans & Explaination

Explaination:

Q52. The routing table of a router is shown below:

On which interface will the router forward packets addressed to destinations 128.75.43.16 and 192.12.17.10 respectively?
(A) Ethi and Eth2
(B) EthO and Eth2
(C) EthO and Eth3
(D) Ethi and Eth3

Show/Hide Ans & Explaination

Explaination:

Q53. A point of randomly selected with uniform probablity in the x-y plan within the rectangle with corner at (0,0), (1,0), (1,2) and (2,0).If P is the length of the position vector of the point, then the value of p2is?
(A) 2/3
(B) 1
(C) 4/3
(D) 5/3

Show/Hide Ans & Explaination

Explaination:

The Question is common for Q.54 and Q.55
Consider three IP network A, B and c host HA in network A send message each containing 180 bytes of application data to a host H in network C. The TCP layer prefixes a 20 byte header to the message. This passes through an intermediate network B. the maximum packet size, including 20 byte IP header, in each network is:
A : 1000 bytes
B : 100 bytes
C : 1000 bytes
The network A and B are connected through a 1 Mbps link, while B and C are connected by a 512 Kbps link (bps = bits per second).

Q54. Assuming that the packets are correctly delivered, how many bytes, including headers, are delivered to the IP layer at the destination for one application message, in the best case? Consider only data packets.
(A) 200
(B) 220
(C) 240
(D) 260

Show/Hide Ans & Explaination

Explaination:

Q55. What is the rate at which application data is transferred to host H? Ignore errors, acknowledgements, and other overheads.
(A) 325.5 kbps
(B) 354.5 kbps
(C) 409.6 kbps
(D) 512 kbps

Show/Hide Ans & Explaination

Explaination:

Q56. 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 required?
(A) 2
(B) 3
(C) 4
(D) 5

Show/Hide Ans & Explaination

Explaination:

Q57. Which are the essential prime implicants of the following Boolean function? f(a,b,c)== a’c+ac’+b’c
(A) a’c and ac’
(B) a’c and b’c
(C) a’conly
(D) ac’ and bc’

Show/Hide Ans & Explaination

Explaination:

Q58. Consider a multiplexer with X and Y as data inputs and Z as control input. Z = 0 selects input X, and Z = 1 selects input Y. What are the connections required to realize the 2-variable Boolean function f = T + R, without using any additional hardware?
(A) R to X, 1 to Y, T to Z
(B) T to X, R to Y, 0 to Z
(C) T to X, R to Y ,T to Z
(D) R to X, O to Y, T to Z

Show/Hide Ans & Explaination
Answer: (A) R to X, 1 to Y, T to Z

Explaination:

Q59. Consider the partial implementation of a 2-bit counter using T flip-flop following the sequence 0-2-3-1-0, as shown below. To complete the circuit, the inpute should be

(A) Q2’
(B) Q2+Q1
(C) (Q1 Q2)’
(D) Q1 Q2

Show/Hide Ans & Explaination

Explaination:

Q60. A 4-bit carry look ahead adder, which adds two 4-bit numbers, is designed using AND, OR, NOT, NAND, NOR gates only. Assuming that all the inputs are available in both complemented and uncomplemented forms and the delay of each gate is one time unit, what is the overall propagation delay of the adder? Assume that the carry network has been implemented using two-level AND-OR logic.
(A) 4 time units
(B) 6 time units
(C) 10 time units
(D) 12 time units

Show/Hide Ans & Explaination

Explaination:

Q61. The element 32,15,20,3012,25,16 are inserted one by one in the even order in the max heap the resultent max heap is?
(A)

(B)

(C)

(D)

Show/Hide Ans & Explaination

Explaination:

Q62. Consider the 2 process P1 and P2 accesing the shared variable X and Y protect by two binary semaphore Sx and Sy respectivly, both intilize by 1 denote the usual smaphore operator where P decreament the semaphore value and V increament the semaphoe value. the pseudo coad is given below.

(A)
(B)
(C)
(D)

Show/Hide Ans & Explaination

Explaination:

The following information pertains to Q.63 and 64: Consider the following program segment for a hypothetical CPU having three user registers Ri, R2 and R3.
Instruction Operation Instruction Size (in words)
MOV R1,5000 ;R1 - Memory[5000] 2
MOV R2(R1) ;R2 - Memory[(R1)] 1
ADD R2, R3 ;R2 - R2 + R3 1
MOV 6000, R2 ; Memory[6000] - R2 2
HALT ;Machine halts 1
Q63. Consider that the memory is byte addressable with size 32 bits, and the program has been loaded starting form memory location 1000 (decimal). If an interrupt occurs while the CPU has been halted after executing the HALT instruction, the return address (in decimal) saved in the stack will be (
(A) 1007
(B) 1020
(C) 1024
(D) 1028

Show/Hide Ans & Explaination

Explaination:

Q64. Let the clock cycles required fro various operations be as follows: Register to/from memory transfer : 3 clock cyles
ADD with both operands in register : 1 clock cyle
Instruction fetch and decode : 2 clock cycles per word
The total number of clock cycles required to execute the program is
(A) 29
(B) 24
(C) 23
(D) 20

Show/Hide Ans & Explaination

Explaination:

Q65. Consider a small two-way set-associative cache memory, consisting of four blocks. For choosing the block to be replaced, use the least recently used (LRU) scheme. The number of cache misses for the following sequence of block addresses is 8, 12, 0, 12,8
(A) 2
(B) 3
(C) 4
(D) 5

Show/Hide Ans & Explaination

Explaination:

Q66. Let A = 1111 1010 and B = 0000 1010 be two 8-bit 2’s complement numbers. Their product in 2’s complement is
(A) 1100 0100
(B) 1001 1100
(C) 1010 0101
(D) 1101 0101

Show/Hide Ans & Explaination

Explaination:

Q67. The microinstructions stored in the control memory of a processor have a width of 26 bits. Each microinstruction is divided into three fields: a micro-operation field of 13 bits, a next address field (X), and a MUX select field (Y). there are 8 status bits in the inputs of the MUX. How many bits are there in the X and Y fields, memory in number of words, and what is the size of the control?

(A) 10, 3, 1024
(B) 8, 5, 256
(C) 5, 8, 2048
(D) 10, 3, 512

Show/Hide Ans & Explaination

Explaination:

Q68. A hard disk with a transfer rate of 10 Mbytes/second is constantly transferring data to memory using DMA. The processor runs at 600 MHz, and takes 300 and 900 clock cycles to initiate and complete DMA transfer respectively. If the size of the transfer is 20 Kbytes, what is the percentage of processor time consumed for the transfer operation?
(A) 5%
(B) 1%
(C) .05%
(D) .01%

Show/Hide Ans & Explaination

Explaination:

Q69. A 4-stage pipeline has the stage delays as 150, 120, 160 and 140 nanoseconds respectively. Registers that are used between the stages have a delay of 5 nanoseconds each. Assuming constant clocking rate, the total time taken to process 1000 data items on this pipeline will be
(A) 120.4 microseconds
(B) 160.5 microseconds
(C) 165.5 microseconds
(D) 590.0 microseconds

Show/Hide Ans & Explaination

Explaination:

Q70. The following prepositional statement is ( p—> (Qv R)) —> ((P ^ Q) —> R)
(A) satisfiable but not valid
(B) valid Micro Operations
(D) None of the above

Show/Hide Ans & Explaination
Answer: (A) satisfiable but not valid

Explaination:

Q71. How many solutions does the following system of linear equations have?
—x + 5y —1
x—y =2
x + 3y — 3
(A) infinitely many
(B) two distinct solutions
(C) unique
(D) none

Show/Hide Ans & Explaination

Explaination:

Q72. The following is the incomplete operation table of a 4-element group. The last row of the table is
 * e a b c e e a b c a a b c e b c
(A) caeb
(B) cbae
(C) cbeaceab
(D) abc

Show/Hide Ans & Explaination

Explaination:

Q73. The inclusion of which of the following sets into S {{i, 2} , {1, 2, 3}, {1, 3, 5} , {1, 2, 4} , {1, 2,3,4, 5}} is necessary and sufficient to make S a complete lattice under the partial order defined by set containment?
(A) {1}
(B) {1},{2,3}
(C) {1},{1,3}
(D) {1},{1,3},{1,2,3,4},{1,2,3,5}

Show/Hide Ans & Explaination

Explaination:

Q74. An examination paper has 150 multiple choice questions of one mark each, with each question having four choices. Each incorrect answer fetches —0.25 marks. Suppose 1000 students choose all their answers randomly with uniform probability. The sum total of the expected marks obtained by all these students is
(A) 0
(B) 2550
(C) 7525
(D) 9375

Show/Hide Ans & Explaination

Explaination:

Q75. Mala has a colouring book in which each English letter is drawn two times. She wants to paint each of these 52 prints with one of k colours, such that he colour pairs used to colour any two lwtters are different. Both prints of a letter can also be coloured with the same colour. What is the minimum value of k that satisfies this requirement?
(A) 9
(B) 8
(C) 7
(D) 6

Show/Hide Ans & Explaination

Explaination:

Q76. If an M*N matrix such that all non zero entries are covered in A row and B coumn yhen the maximum number of non zero entries, such that no two are on the same row and column is?
(A) <=a+b
(B) <=max(a+b)
(C) <=min(M-a,N-b)
(D) <=(a,b)

Show/Hide Ans & Explaination

Explaination:

Q77. The minimum number of colours required to colour the following graph, such that no two adjacent vertices are assigned the same colour, is

(A) 2
(B) 3
(C) 4
(D) 5

Show/Hide Ans & Explaination

Explaination:

Q78. Two n bit binary strings, S1 and S2 are chosen randomly with uniform probability. The probability that the Hamming distance between these strings (the number of bit positions where the two strings differ) is equal to d is
(A) nCd/2n
(B) nCd/2d
(C) d/2n
(D) 1/2d

Show/Hide Ans & Explaination

Explaination:

Q79. How many graph on n labeled vertices exist which have at least 2 edges.
(A) n2
(B) 2n
(C) n
(D) none

Show/Hide Ans & Explaination

Explaination:

Q80. Let G1 (V, E1) and G2 (V,E2) be connected graphs on the same vertex set V with more than two vertices. If G1 nG2 (V, E1nE2) is not a connected graph, then the graph G1 uG2 (V, E1UE2)
(A) can't have cut vertex
(B) must have cycle
(C) must have a cut vertex
(D) has chromatic no. stricly greater than G1 and G2

Show/Hide Ans & Explaination
Answer: (C) must have a cut vertex

Explaination:

Q81. Let A[i,...,n] be an array storing a bit (1 or 0) at each location, and f (m) is a function whose time complexity is 0(m). Consider the following program fragment written in a C like language:
counter = 0;
for (i =1; i = n; i++)
{if (a[i] == 1) counter++;
else {f (counter); counter = 0;) }
The complexity of this program fragment is
(A) Ω(n2
(B) Ω(nlogn) and Ω (n2
(C) θ(n)
(D) o(n)

Show/Hide Ans & Explaination

Explaination:

Q82. The time complexity of the following C function is (assume n > 0)
int recursive (mt n)
{
if (n == 1)
return (1);
else
return (recursive (n-1)+ recursive (n-1); }
(A) O(n)
(B) O(nlogn)
(C) O(N2)
(D) O(2)

Show/Hide Ans & Explaination

Explaination:

Q83. The recurrence equation
T(1) = 1
T(n) — 2T(n—1)+n, n= >2
evaluates to
(A) 2n+1-n-2
(B) 2n-2
(C) 2n+1-2n-2
(D) 2n+n

Show/Hide Ans & Explaination

Explaination:

Q84. A program takes as input a balanced binary search tree with n leaf nodes and computes the value of a function g(x) for each node x. If the cost of computing g(x) is min(number of leaf-nodes in left-subtree of x, number of leaf-nodes in rig ht-subtree of x) then the worstcase time complexity of the program is
(A) θ(n)
(B) θ(logn)
(C) θ(n2)
(D) θ(n2logn)

Show/Hide Ans & Explaination

Explaination:

Q85. The following finite state machine accepts all those binary strings in which the number of l’s and 0’s are respectively

(A) divisible by 3 and 2
(B) odd and even
(C) even and odd
(D) none

Show/Hide Ans & Explaination
Answer: (A) divisible by 3 and 2

Explaination:

Q86. The language ambncm+n {m,n >2} is
(A) RL
(B) CFL but not RL
(C) CSL but not CFL
(D) type 1 but not CSL

Show/Hide Ans & Explaination
Answer: (B) CFL but not RL

Explaination:

Q87. L1 is a recursively enumerable language over . An algorithm A effectively enumerates its words as w1,w2,w3... define another language L2 over Σ∪{#} as {wi #wj : wj ∈L1, iS1: L1 is recursive implies L2 is recursive
S2: L2 is recursive implies L1 is recursive
Which of the following statements is true?
(A) Both S1 and S2 are true
(B) S is true but S2 is not necessarily true
(C) S2 is true but S1 is not necessarily true
(D) Neither is necessarily true

Show/Hide Ans & Explaination
Answer: (B) S is true but S2 is not necessarily true

Explaination:

Q88. Choose the best matching between the programming styles in Group 1 and their characteristics in Group 2.
Group1
P. Functional
Q. Logic
R. Object-Oriented
S. Imperative
Group2-
1. Command-based, procedural
2. Imperative, abstract data types
3. Side-effect free, declarative, expression evaluation
4. Declarative, clausal representation, theorem proving
(A) P—2 Q—3 R—4 s-1
(B) P—4 Q—3 R—2 s-1
(C) P—3 Q—4 R—1 S—2
(D) P—3 Q—4 R—2 s-1

Show/Hide Ans & Explaination
Answer: (D) P—3 Q—4 R—2 s-1

Explaination:

Q89. If a fair coin tossed 4 time, What is the probability that 2 head and 2 tail results?
(A) 3/8
(B) 1/2
(C) 5/8
(D) 3/4

Show/Hide Ans & Explaination

Explaination:

### Shopping Cart

View Shopping Cart/Checkout Merchant account,
Credit Card Processing
Payment Gateway