1.
The inorder and postorder traversal of a binary tree
are:
d b e a
f c g and a b d
e c f g respectively The postorder
traversal of the binary tree is:
A)
d e b f g c a B) e d b g f c a C) e d b f g c a D) d e f g b c a
2.
The solution to the recurrence equation T(2k)=3T(2k-1)
+ 1, T(1)=1 is:
A)
2k
B)
(3k+1 -1)/2 C) 3 log2k D) 2 log3k
3.
If f(
) = 2
7+ 3
- 5, which of the following is a factor of f(x)?
) = 27+ 3 - 5, which of the following is a factor of f(x)?
A)
(x3+8)
B) (x-1) C) (2x-5) D) (x+1)
4.
Consider an arbitrary set of CPU-bound processes with
unequal CPU burst lengths submitted at the same time to a computer system.
Which one of the following process scheduling algorithms would minimize the
average waiting time in the ready queue?
A)
Shortest remaining time first
B)
Round-robin with time quantum less than the shortest
CPU burst
C)
Uniform random
D)
Highest priority first with priority proportional to
CPU burst length
5.
Assume that any vertex v in a graph is connected to
itself. Then the relation R defined by u R v if and only u is connected to v on
a graph G is
A)
Symmetric and transitive only
B)
Not reflexive
C)
An equivalence relation
D)
A partial ordering relation
6.
Let T be a binary search tree with 15 nodes. The
maximum and minimum possible heights of tree T are: (ASSUMING tree with single
node has height 0)
A)
15, 4 B)
14, 3 C)
14, 4 D)
15, 3
7.
Threads of a process share with each other:
A)
Global variables only B)
Heap only
C) Both global variables and heap D) Neither global variables nor heap
8.
In a quadratic function, the value of the product of
the roots (
, 
) is 4. Find the value of
, ) is 4. Find the value of
(
n + 
n) / (
-n+
-n)
n + n) / (-n+-n)
A)
n4 B) 4n C) 22n-1 D) 4n-1
9.
Which of the following statements is false:
A)
If λ is an eigen value of a non-singular matrix A, then
1/ λ is an eigen value of A-1
B)
The sum of eigen values of a matrix A equals the trace
of A
C)
If A is invertible then trace of ACA-1 equals
the trace of C
D)
For any constant k, trace of kA=trace of A
10. A
database of research articles in a journal uses the following schema:
(VOLUME, NUMBER, STARTPAGE, ENDPAGE, TITLE, YEAR, PRICE)
The primary key is
(VOLUME, NUMBER, STARTPAGE, ENDPAGE) and the
following functional dependencies exist in the schema:
(VOLUME, NUMBER, STARTPAGE, ENDPAGE) TITLE
(VOLUME, NUMBER) YEAR
(VOLUME, NUMBER, STARTPAGE, ENDPAGE) PRICE
The database is redesigned to use the following schemas.
(VOLUME, NUMBER, STARTPAGE, ENDPAGE, TITLE, PRICE)
(VOLUME, NUMBER, YEAR)
Which is the weakest normal form that the new database
satisfies, but the old one does not?
A) 1NF B)
2NF C)
3NF D)
BCNF
11. Given
that p the probability of a page fault in a system is close to zero, that is
there are only few page faults. If the average page fault service time is 25
milliseconds and memory access time is 100 nanoseconds, then which of the
following denotes the effective access time in nanoseconds?
A) 100 + 24,999,900 x p B)
24,999,990 x p C) 100 + 25,999,990 x p D)
100 + 25,000,000 x p
12. Consider
the following C program:
void f(char *a)
{
a=(char *) malloc (10*sizeof
(char)); strcpy (a, “HELLO”);
}
int main ()
{
char *str = “HI”; f(str);
printf(“%s”, str);
}
What will be printed for the
above C program:
A) HI B) HELLO C) HELLOHI D) Segmentation fault
13. What
is the function of the preamble in an Ethernet network?
A)
Clock Synchronization B)
Error Checking
C) Collision Avoidance D)
Broadcast
14. The
following postfix expression with single digit operands is evaluated using a
stack 8 2 3 ^ / 2 3 * + 5 1 * -
The top two elements of the
stack after the first * is evaluated are:
A)
6,1 B) 5,7 C)
3,2 D)
1,5
(2)
15. Consider
a hash table of size seven, with starting index zero, and a hash function
(3x+4)mod 7. Assuming the hash table is initially empty, which of the following
are the contents of the table when the sequence 1, 3, 8, 10 is inserted into
the table using closed hashing? Note that – denotes an empty location in the
table
A)
8, -, -, -, -, -, 10 B)
1, 8, 10, -, -, -, 3
C) 1, -, -, -, -, -, 3 D)
1, 10, 8, -, -, -, 3
16. The
Address Resolution Protocol translates:
A)
A physical address into a hardware address
B)
An IP address into a logical address
C)
A hardware address into a physical address
D)
An IP address into a hardware address
17. What
is the time complexity of the following recursive function:
int func (int n) { if (n<=2) else return | :
return (func (floor (sqrt (n)) + n);
A)
ϴ(n2)
B) ϴ(n log2n) C)
ϴ(log2n) D) ϴ(log2 log2n)
18. Which
one of the following statements is false:
A)
Any relation with two attributes is in BCNF
B)
A relation in which every key has only one attribute is
in 2NF
C)
A prime attribute can be transitively dependent on a
key in a 3NF relation
D)
A prime attribute can be transitively dependent on a
key in a BCNF relation
19. Consider
the following schedule involving two transactions. Which one of the following
statements is true?
S1: r1(X); r1(Y); r2(X);
r2(Y);w2(Y);w1(X) S2: r1(X);
r2(X); r2(Y);w2(Y); r1(Y); w1(X)
A)
Both S1 and S2 are conflict
serializable
B)
S1 is conflict serializable but not S2
C)
S1 is not conflict serializable but S2 is
conflict serializable
D)
Both S1 and S2 are not conflict
serializable
20. For
which of the following reasons does IP use the TTL field in the IP datagram
header?
A)
Ensure packet reaches destination within that time
B)
Discard packets that reach later than that time
C)
Prevent packets from looping indefinetely
D)
Limit the time for which a packet gets queued in
routers
21. A
minimum state deterministic finite automaton accepting the language
L={w|w
ϵ [0,1]*, number of 0s and 1s in w
are divisible by 3 and 5, respectively} has
A)
15 states B)
11 states C)
10 states D)
9 states
22. How
many different non isomorphic Abelian groups of order 4 are there?
A)
2 B)
3 C)
4 D)
5
23. Let
L1 be a regular language, L2 be a deterministic context
free language and L3 a recursively enumerable, but not recursive
language. Which one of the following statements is false?
A)
L1 ∩L2 is a deterministic CFL B)
L3∩ L1 is recursive
C) L1U L2 is context free D)
L1 ∩L2∩ L3 is recursively
enumerable
24. Consider
the following propositional statements:
P1: (( A ˄ B) → C)) ≡ ((A→ C) ˄ (B→ C)) P2: (( A˅ B) →C)) ≡
((A→ C) ˅ (B→ C)) Which one of the following is true:
A)
P1 is a tautology, but not P2 B) P2 is a tautology, but not P1
C) P1 and P2 are both tautologies D) Both P1 and P2 are not tautologies
25. Let
S be an NP complete problem and Q and R be two other problems not known to be
in NP. Q is polynomial time reducible to S and S is polynomial time reducible
to R. Which of the following statements is true?
A)
R is NP complete
B)
R is NP hard
C) Q is NP complete D)
Q is NP hard
26. Karnaugh
map is used to
A)
Minimize the number of flip flops in a digital circuit
B)
Minimize the number of gates only in a digital circuit
C)
Minimize the number of gates and fan-in of a digital
circuit
D)
Design gates
27. (FE35)16
XOR (CB15)16 is equal to
A)
(3320)16 B)
(FF35)16 C)
(FF50)16 D)
(3520)16
28. Let
G1=(V, E1) and G2=(V, E2) be
connected graphs on the same vertex set V with more than two vertices. If G1
∩ G2=(V, E1 ∩ E2) is not a
connected graph, then the graph
G1 U G2=(V,
E1 U E2)
A)
Cannot have a cut vertex
B)
Must have a cycle
C)
Must have a cut-edge
D)
Has chromatic number strictly greater than those of G1
and G2
29. The
language {ambncm+n| m, n>=1} is
A)
Regular B)
Context free but not regular
C) Context sensitive but not context free D) Type 0 but not context sensitive
30. In
a negative edge triggered J-K flip-flop, in order to have the output Q state
0,0 and 1 in the next three successive clock pulses, the J-K input states
required would be respectively
A)
00, 01 and 10 B)
00, 01 and 11
C) 00, 10 and 01 D)
01, 10 and 11
31. The
number of comparators needed in a 4 bit flash type A/D converter is
A)
32 B) 15
C)
8 D)
4
32. What does
the following C statement declare? int (* f) (int *);
A)
A function that takes an integer pointer as argument
and returns an integer
B)
A function that takes an integer as argument and
returns an integer pointer
C)
A pointer to a function that takes an integer pointer
as argument and returns an
integer
D)
A function that takes an integer pointer as argument
and returns a function pointer
33. The
time complexity of computing the transitive closure of a binary relation on a
set of nelements is known to be:
A)
О (n) B)
О(n log n) C) О(n3/2) D)
О(n3)
34. Packets
in the same session may be routed through different paths in:
A)
TCP, but not UDP
B)
TCP and UDP
C) UDP, but not TCP D)
Neither TCP nor UDP
35. 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
36. Consider
the grammar S-> (S) | a
Let the number of states in SLR(1), LR(1) and LALR(1)
parsers for the grammar be n1, n2 and n3
respectively. The following relationship holds good:
A)
n1< n2< n3 B)
n1= n3< n2
C) n1= n2=
n3 D)
n1>= n3>= n2
37. 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
38. 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
39. Suppose
the round trip propagation delay for a 10 Mbps Ethernet having 48-bit jamming
signal is 46.4 microseconds. The minimum frame size is:
A)
94 B) 416 C)
464 D)
512
40. A
4-bit synchronous counter uses flip-flops with propagation delay time of 15 ns
each. The maximum possible time required for change of state will be
A)
15ns B)
30ns C)
45ns D)
60ns
41. Which
of the following sorting algorithms has the lowest worst case complexity?
A)
Merge sort B) Bubble sort C)
Quick sort D) Selection sort
42. A
critical section is a program segment
A)
Which should run in a certain specified amount of time
B)
Which avoids deadlocks
C)
Where shared resources are accessed
D)
Which must be enclosed by a pair of semaphore
operations, p and v
43. Booth’s
algorithm for larger multiplication gives worst performance when the multiplier
pattern is
A)
101010....1010 B)
1000....0001 C) 1111....1111 D) 0111...1110
44. Consider
a system having M resources of the same type. These resources are shared by 3
processes A, B and C which have peak demands of 3,4 and 6 respectively. For
what value of M deadlock will not occur?
A)
7 B)
9 C)
10 D)
13
45. For
a random listing of the letters A, B, C and D, find the mean and the variance
of the number of pairs of letters out of order.
A)
Mean= 3, Variance=13/6
B)
Mean= 13, Variance=3/6
C) Mean= 2, Variance=12/6
D)
Mean= 2, Variance=13/6
46. Which
of the following best describes a use case?
A)
It is text describing in detail one flow of events
through a real situation
B)
It is the system specification problem statement
C)
It is text which describes the dialogue between actors
and the system
D)
It is a diagram drawn to illustrate how cases and
actors interact by sending stimuli
to one another
47. In
distance vector routing, each router receives vectors from
A)
Every router in the network B) Every router less than two units away
C) A table stored by the
software D)
Its neighbours only
48. Which
of the following is not a data mining functionality?
A)
Characterization B) Outlier Analysis C) Selection D) Classification 49. The purpose of data
integration is to:
A) Data cleaning B)
Analysing Data
C) Unify data into a common schema D) Data reduction
50. The
correct term used to describe a type of malicious software designed to block
access to a computer system until a sum of money is paid is:
A) Trojan B)
Ransomware C) Phishingware D) Botnet
Posts
1 comment:
Merit Casino Review | xn--o80b910a26eepc81il5g.online
Merit Casino is an online casino. There are 5 online casinos 인카지노 with 메리트 카지노 쿠폰 games like blackjack, roulette, and video หาเงินออนไลน์ poker in it's official
Post a Comment