Академический Документы
Профессиональный Документы
Культура Документы
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) 24
B) 25
C) 26
D) 27
Answer : (C)
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, is
A) £ 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 -> grade
B) rollNo, courseNo -> grade
C) name -> rollNo
D) rollNo -> name
The highest normal form of this relation scheme is
Answer : (A)
5 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
Answer : (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 is
A) 12
B) 8
C) Less than 8
D) More than 12
Answer : (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) m2
C) m1/2
D) m1/3
Answer : (C)
9 The best data structure to check whether an arithmetic expression has balanced
parentheses is a
A) queue
B) stack
C) tree
D) list
Answer : (B)
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) 94
B) 416
C) 464
D) 512
Answer : (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) 2
B) 3
C) 4
D) 6
Answer : (B)
A) 5
B) 6
C) 7
D) 8
Answer : (C)
15 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
Answer : (D)
c
1 The address resolution protocol (ARP) is used for
A) Finding the IP address from the DNS
B) Finding the IP address of the default gateway
C) Finding the IP address that corresponds to a MAC address
D) Finding the MAC address that corresponds to an IP address
Answer : (D)
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 respectively
A) 10, 17
B) 10, 22
C) 15, 17
D) 5, 17
Answer : (A)
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 is
A) 12
B) 8
C) Less than 8
D) More than 12
Answer : (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 is
A) 0.5
B) 0.625
C) 0.75
D) 1.0
Answer : (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) 2
B) 30
C) 56
D) 256
Answer : (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 LANs
B) For avoiding loops in the routing paths
C) For fault tolerance
D) For minimizing collisions
Answer : (B)
11 An organization has a class B network and wishes to form subnets for 64 departments.
The subnet mask would be
A) 255.255.0.0
B) 255.255.64.0
C) 255.255.128.0
D) 255.255.252.0
Answer : (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) 94
B) 416
C) 464
D) 512
Answer : (C)
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 is
A) 0.5
B) 0.625
C) 0.75
D) 1.0
Answer : (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, 16
B) 10, 12
C) 9, 13
D) 8, 11
Answer : (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) 4
B) 6
C) 7
D) 9
Answer : (D)
12 How many distinct binary search trees can be created out of 4 distinct keys?
A) 5
B) 14
C) 24
D) 42
Answer : (B)
c
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 tree
D) No binary tree is both complete and full.
Q-2 Which data structure has the fastest insertion procedure? A) Binary search tree
B) Ordered array
C) Heap
D) Unordered linked list
E) 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 II
B) Ethernet RAW
C) Ethernet 802.2
D) Ethernet SNAP
Q-5 Which of the following are examples of routed protocols? (Choose all that apply) A)
IP
B) IPX
C) RIP
D) OSPF
E) 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 decrease
B) The number of collision domains will increase
C) The number of collision domains will decrease
D) The number of broadcast domains will be zero
Q -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?
(
Information Technology
B) Address Space
C) File Descriptor Table
D) Message
Queue
Answer : (A)
3 Let G be a weighted undirected graph
and e be an edge with maximum weight in G. Suppose there is a minimum weight
spanning tree in G containing the edge e. Which of the following statements is
always TRUE?
A) There exists a cutset in G having all edges of maximum
weight.
B) There exists a cycle in G having all edges of maximum
weight.
C) Edge e cannot be contained in a cycle.
D) All edges in G have
the same weight.
Answer : (C)
A) 3
B) 4
C) 5
D) 6
Answer : (C)
6
Consider the following message M = 1010001101. The cyclic redundancy check (CRC)
for this message using the divisor polynomial x5 + x4 + x2 + 1 is :
A)
01110
B) 01011
C) 10101
D) 10110
Answer : (C)
7
Which of the following statements is FALSE regarding a bridge
A) Bridge
is a layer 2 device
B) Bridge reduces collision domain
C) Bridge is used
to connect two or more LAN segments
D) Bridge reduces broadcast
domain
Answer : (D)
D) 99.009%
Answer : (B)
A) k
B) k+1
C) n-k-l
D) n-k
Answer : (C)
11
Which of the following statements is TRUE about CSMA/CD
A) IEEE 802.11
wireless LAN runs CSMA/CD protocol
B) Ethernet is not based on CSMA/CD
protocol
C) CSMA/CD is not suitable for a high propagation delay network
like satellite network
D) There is no contention in a CSMA/CD network
Answer : (C)
c
c
SECTION - A
1. Write in your answer book the correct or the most appropriate answer
to the following multiple choice questions by writing the corresponding
letter a, b, c or d against the sub-question number.
c c 1.1 Let A and B be sets and let and A B denote the complements of the
sets A and B. the set (a œ b) (b-a) (a n b) is equal to.
X Y and 1.3 Suppose X and Y are sets and are their respective
cardinalities. It is given that there are exactly 97 functions from X to Y.
from this one can conclude that
X Y = = 1, 97 (b) 97, 1 X Y = = (a)
(c) 97, 97 X Y = = (d) None of the above
1.5 Two dice are thrown simultaneously. The probability that at least one
of them will have 6 facing up is
1 1 25 11
(a) (b) (c) (d)
36 3 36 36
1.8 Which two of the following four regular expressions are equivalent? ( e
is the
empty string).
(i) (00) * ( e + 0)
(ii) (00)*
(iii) 0*
(iv) 0(00)*
(a) (i) and (ii) (b) (ii) and (iii) (c) (i) and (iii) (d) (iii) and (iv)
1.13 An advantage of chained hash table (external hashing) over the open
addressing scheme is
(a) Worst case complexity of search operations is less?
(b) Space used is less (c) Deletion is easier
(d) None of the above
1.14 In the balanced binary tree in Fig.1.14 given below, how many nodes
will become unbalanced when a node is inserted as a child of the node ²
g"?
(a) 1 (b) 3 (c) 7 (d) 8
1.15 Which of the following sequences denotes the post order traversal
sequence of the tree of question 1.14?
(a) f e g c d b a (b) g c b d a f e (c) g c d b f e a (d) f e d g c b a
TERMINATED
NEW
RUNNING READY
BLOCKED
(a) a batch operating system
(b) an operating system with a preemptive scheduler
(c) an operating system with a non-preemptive scheduler
(d) a uni-programmed operating system.
1.21. A ROM is sued to store the table for multiplication of two 8-bit
unsigned integers.
The size of ROM required is
(a) 256 × 16 (b) 64 K × 8 (c) 4 K × 16 (d) 64 K × 16
1.24. For the daisy chain scheme of connecting I/O devices, which of the
following statements is true?
(a) It gives non-uniform priority to various devices.
(b) It gives uniform priority to all devices.
(c) It is only useful for connecting slow devices to a processor device.
(d) It requires a separate interrupt pin on the processor for each device.
31 24 23 0
Exponent Mantissa
2. Write in your answer book the correct or the most appropriate answer
to the following multiple choice questions by writing the corresponding
letter a, b, c or d against the sub-question number.
2.3. Which of the following is false? Read as AND, as OR, ~ as NOT, as one
way Åimplication and as two way implication.
()()()()()
(a) x y x y (b) - - - x y x y x
()()()()()
(c) x x (d) x y x y - -
-a»ÿ»ÿ
2.6. The matrices cos sin 0 and commute under multiplication Ÿ Ÿ
sin cos 0 b / /
2.7. The probability that top and bottom cards of a randomly shuffled deck
are both aces in
2.8. If L and L are context free languages and R a regular set, one of the
languages below is not necessarily a context free language. Which one?
(a) L , L (b) L L (c) L R (d) L L n n
1212112
2.9. Define a context free languages L {0,1} init (L) = {u/uv L for some in
=
{{0,1}} (in other words, init(L) is the set of prefixes of L)
Let L {w/w is nonempty and has on equal number of 0's and 1's
Then init (L) is
(a) the set of all binary strings with unequal number of 0's and 1's
(b) the set of all binary strings including the null string
(c) the set of all binary strings with exactly one more 0's than the number
of 1's
or one more 1 than the number of 0's.
(d) None of the above
(a) A œ 3 B œ 4 C œ 1 D - 2 (b) A œ 4 B œ 3 C œ 1 D - 2
(c) A œ 4 B œ 3 C œ 2 D - 1 (d) A œ 3 B œ 4 C œ 2 D - 1
2.21. Consider the circuit in Fig.2.21 which has a four fit binary number b
b b b as
3210
input and a five bit binary number, ddddd as output. b b b b
320432101
"f'
(a) Binary of Hex conversion
(b) Binary to BCD conversion
(c) Binary to grey code conversion
C in " f ' C out
(d) Binary to radix-12 conversion.
Binary adder
d
4
dddd
0321
2 x x for 1 =
()
f x ax bx c x = + + = for 1 2 2
x d x + > for 2
Find the values for the constants a; b; c and d so that f is continuous and
differentiable everywhere on the real line.
4. A binary search tree is used to locate the number 43. Which of the
following probe sequences are possible and which are not? Explain.
(a) 61 52 14 17 40 43
(b) 2 3 50 40 60 43
(c) 10 65 31 48 37 43
(d) 81 61 52 14 41 43
(e) 17 77 27 66 18 43
5. A logic network has two data inputs A and B, and two control inputs C
and C . It implements the function F according to the following table.
CCF
12
00AB+
01A+B
10AB
Implement the circuit using one 4 to AB Multiplexor, one 2-input Exclusive
OR gate, one 2-input AND gate, one 2-input OR gate and one Inverter.
6. An 8085 based system has an output port with address 00H. Consider
the
following assembly language program.
ORG 0100H
MVI A, 00H
LXI H, 0105H
PCHL
HLT
(a) What does the program do with respect to the output port ff H?
(b) Show the waveforms at the three least significant bits of the port ff H.
17 1 63
LRU page
For each hexadecimal address in the address sequence given below,
00FF, 010D, 10FF 11B0
indicate,
(i) the new status of the list
(ii) page faults, if any, and
(iii) page replacements, if any.
SECTION B
Answer any TEN questions from this section. All questions carry equal
marks.
{}
> 9. The Fibonacci sequence f f f f , , is defined by the following
recurrence:
123n
f f f n f f = + = = = , 1; 1 : 1 :
nnn2121++
Prove by induction that every third element of the sequence is even.
»ÿ»ÿaabb
11 12 11 12 10. Let A B = = and be two matrices such that Ÿ Ÿ
a a b b / / 21 22 21 22
12. Given below are the transition diagrams (Fig.12) for two finite state
machines M
1
and M recognizing languages L and L respectively.
212
(a) Display the transition diagram for a machine that recognizes L L ,
obtained
12
from transition diagrams for M and M by adding only and transitions and
no
12
new states.
(b) Modify the transition diagram obtained in part (a) obtain a transition
diagram
for a machine that recognizes (L L ) by adding only e transitions and no
new
1 2 states.
(Final states are enclosed in double circles).
» ÿ A i j A i j » ÿ» ÿ » ÿ» ÿ < + 1 / / / / /
Fill in the blanks:
(a) The smallest item in the array is at A[i] [j] where i =
and j =
(b) The smallest item is deleted. Complete the following O(n) procedure to
insert
item x (which is guaranteed to be smaller than any item in the last row or
column) still keeping A partially sorted.
procedure insert (x integer)
' var j j:integer;
begin
(1) i: =1; j:=A[i] [j]:=x;
(2) while (x > or x >) do
(3) if A[ i + 1] [j] n [i] ]j] then begin
(4) A [i] [j]:= A[i +1] [j]; i: =i + 1
(5) end
(6) else begin
(7)
(8) end
(9) A [i] [j]:=
end
21. The concurrent programming constructs fork and join are as below:
fork which creates a new process executing from the specified label
join which decrements the specified synchronization variable (by 1)
and terminates the process if the new value is not 0.
Show the precedence graph for S1, S2, S3, S4 and S5 of the concurrent
program
below.
N=2
M=2
fork L3
fork L4
S1
L1 : join N
S3
L2: join M
S5
L3:S2
goto L1
L4:S4
goto L2
next:
Fig.5
(a) Draw a state diagram, which is implemented by the circuit. Use the
following names for the states corresponding to the values of flip-flops as
given below.
Q1 Q2 Q3 State
000S
0
001S
1
----
----
----
111S
7
(b) Given that the initial of the circuit is S , identify the set of states, which
are 4 not reachable.
26. A computer system has a three level memory hierarchy, with access
time and hit ratios as shown below:
c
c
Gate 1993 CS Computer Science Engineering M.tech Admission Question
Paper
SECTION - A
1. In questions 1.1 to 1.7 below, one or more of the alternatives are
correct. Write the code letter(s) a, b, c, d corresponding to the correct
alternative(s) in the
answer book. Ma rks will be given only if all the correct alternatives have
been selected and no incorrect alternative is picked up.
()
1.3 Simpson's rule for integration gives exact result when f x is a
polynomial of degree
(a) 1 (b) 2 (c) 3 (d) 4
( ) ( ) x e x - + - 1 2 cos 1
x
2.1 lim is _______
( ) x x 1 cos -
x0
gd
2.3 If the linear velocity is given by V
gd
ä V x yi xyz j yz k = + - , 2 2
gd
The angular velocity at the point (1, 1, -1) is ________
( ) ' = - 2.4 Given the differential equation, y x y with the initial condition
y 0 0 = . The ( ) value of y calculated numerically upto the third place of
decimal by the 0.1
second order Runga-Kutta method with step size h = 0.1 is ________
SECTION II œ A
INSTRUCTIONS: There are THREE questions in this Section. Question 6
has 8 parts, 7 has 10 pa rts, and 8 has 7 parts. Each part of a question
carries 2 marks. There may be more than one correct alternative the
multiple-choice questions. Credit will be given if only all the correct
alternatives have been indicated.
6.1. Identify the logic function performed by the circuit shown in figure.
6.2. If the state machine described in figure, should have a stable state,
the
restriction on the inputs is given by
(a) . 1 a b = (b) 1 a b + = (c) 0 a b + = (d) . 1 a b =
(e) 1 a b + =
6.3. For the initial state of 000, the function performed by the
arrangement of the J-K flip-flops in figure is:
Clock
6.4. Assume that each character code consists of 8 bits. The number of
characters that can be transmitted per second through an asynchronous
serial line at 2400 baud rate, and with two stop bits, is
(a) 109 (b) 216 (c) 218 (d) 219
(e) 240
6.5. Convert the following numbers in the given bases into their
equivalents in the desired bases.
))
(a) 110.101 x =
210
))
(b) 1118 y H =
10
6.6. A ROM is used to store the Truth table for a binary multiple unit that
will multiply two 4-bit numbers. The size of the ROM (number of words ×
number of bits) that is required to accommodate the Truth table is M
words × N bits. Write the values of M and N.
6.7. A certain moving arm disk storage, with one head, has the following
specifications.
Number of tracks/recording surface = 200
Disk rotation speed = 2400 rpm
Track storage capacity = 62,500 bits
The average latency of this device is P msec and the data transfer rate is Q
bits/sec.
Write the value of P and Q.
Given that an interrupt input arrives every 1 msec, what is the percentage
of the total time that the CPU devotes for the main program execution.
7. Note: For sub-questions 7.1 to 7.3, refer to the PASCAL program shown
below.
Program PARAM (input, output);
var m, n : integer;
procedure P (var, x, y : integer);
var m : integer;
begin
m : = 1;
x:=y+1
end;
procedure Q (x:integer; vary : integer);
begin
x:=y+1;
end;
begin
m:=0; P(m,m); write (m);
n:=0; Q(n*1,n); write (n)
end
7.5. For the program segment given below, which of the following are
true?
program main (output);
type link = ^data;
data = record
d : real;
n : link
end;
var ptr : link;
begin
new (ptr);
ptr:=nil;
.ptr^.d:=5.2;
write ln(ptr)
end.
(a) The program leads to compile time error
(b) The program leads to run time error
(c) The program outputs 5.2
(d) The program produces error relating to nil pointer dereferencing
(e) None of the above
7.6. A simple two-pass assembler does the following in the first pass:
(a) It allocates space for the literals.
(b) It computes the total length of the program
(c) It builds the symbol table for the symbols and their values.
(d) It generates code for all the load and store register instructions.
(e) None of the above.
7.7. A part of the system software, which under all circumstances must
reside in the main memory, is:
(a) text editor (b) assembler (c) linker (d) loader
(e) none of the above
p4
q1
r8
s1
t2
The jobs are a ssumed to have a rrived at time 0 and in the order p, q, r,
s, t. + calculate the departure time (completion time) for job p if
scheduling is round robin with time slice 1.
(a) 4 (b) 10 (c) 11 (d) 12
(e) None of the above
8.
8.1. Consider a simple connected graph G with n vertices and n-edges
(n>2). Then,
which of the following statements are true?
(a) G has no cycles.
(b) The graph obtained by removing any edge from G is not connected.
(c) G has at least one cycle.
(d) The graph obtained by removing any two edges from G is not
connected.
(e) None of the above.
()
8.2. The proposition P p q ~ is:
(a) a tautology (b) logically equivalent to p q
(c) logically equivalent to p q (d) a contradiction
(e) none of the above
8.3. Let S be an infinite set and S S > be sets such that , S S S S = >
Then, .
1n 12n
(a) at least one of the set S is a finite set
i
(b) not more than one of the set S can be finite
i
(c) at least one of the sets S is an infinite set
i
(d) not more than oen of the sets S can be infinite
i
(e) None of the above
8.4. Let A be a finite set of size n. The number of elements in the power
set of
(e) None of the above
SECTION II - B
9. Assume that only half adders are available in your laboratory. Show
that any binary Boolean function can be implemented using half adders
only.
Mode and RegR together specify the operand. RegR specifies a CPU
register and Mode specifies an addressing mode. In particular, Mode = 2
specifies that "the register RegR contains the address of the operand, after
fetching the operand, the contents of RegR are incremented by 1'.
An instruction at memory location 2000 specifies Mode = 2 and the RegR
refers to program counter (PC).
(a) What is the address of the operand?
(b) Assuming that this is a non-jump instruction, what are the contents of
PC
after the execution of this instruction?
12. The following Pascal program segments finds the largest number in a
two- > > » ÿ dimensional integer array 0 1, 0 1 A n n - - using a single
loop. Fill up the / boxes to complete the program and write against , , and
A B C D in your answer book. Assume that max is a variable to store the
largest value and i,j are the indices to the array.
begin
max:= A , i:=0,j:=0;
while B do
begin
if A[i,j]>max then max:=A[i,j]
if C then j:=j+1
else begin
j:=0;
i:= D
end
end
end.
> 13. Consider a singly linked list having n nodes. The data items d d d , ,
are stored
12n
in these n nodes. Let X be a pointer to the j-th node (1 = j = n) in which
dj is stored.
A new data item d stored in node with address Y is t be inserted. Give an
algorithm to insert d into the list to obtain a list having items
d d d d d , , , , , , > > in the order without using the header.
121jjn-
A[i+1]:=temp
end;
bubblesort (n -1 )
end
Let a be the number of times the "if then .' Statement gets executed
when the n algorithm is run with value n. Set up the recurrence relation
by defining a in n terms of a . Solve for a .
n-1n
16. Prove by the principal of mathematical induction that for any binary
tree, in which every non-leaf node has 2 descendants, the number of
leaves in the tree is one more than the number of non-leaf nodes.
SECTION: II - C
INSTRUCTIONS: There are TEN questions in this section. Each question
carries 5 marks. Attempt any FIVE questions. In case more than five
questions are attempted, the first five answers alone will be evaluated.
21. The following page addresses, in the given sequence, were generated
by a
program:
12341352154323
This program is run on a demand paged virtual memory system, with main
memory size equal to 4 pages. Indicate the page references for which
page faults occurs for the following page replacement algorithms.
(a) LRU
(b) FIFO
Assume that the main memory is empty initially.
24. For the relational database given above, the following functional
dependencies