1. Total number of simple graphs
that can be drawn using six vertices are:
A.
215
B.
214
C.
213
D.
212
The
maximum number of edges possible in a single graph with 'n' vertices
is nC2 where nC2 = n(n – 1)/2. The number
of simple graphs possible with 'n' vertices = 2nc2
= 2n(n-1)/2.
2n(n-1)/2.
here 6
vertices There fore =6(6-1)/2
=6(5)/2
=30/2
=15
=215
2. If a planner graph, having 25
vertices divides the plane into 17 different regions. Then how many edges are
used to connect the vertices in this graph
A. 20
B. 30
C. 40
D. 50
v−e+f=2.
25-e+17=2
25+17-2=e
25+15=e
40=e
3. Non contiguous memory allocation
splits program into blocks of memory called --------------- that can be loaded
in non adjacent holes in main memory
A. Pages
B. Partition
C. Frames
D.Segments
4.
The open file table has a/an --------------- associated with each file
A. File content
B. File Permission
C. Open Count
D. Close Count
Exp: In Operating system the no of process in a open file is
open count
5. What is the value of
acknowledgement field in a segment?
A. Number of previous bytes to receive
B. Total number of bytes to receive
C. Number of bytes to receive
D. Sequence of Zero's and one's
6. In a full binary tree number of
nodes is 63 then the height of the tree is
A. 2
B. 4
C. 3
D. 6
EXP: Maximum number of nodes in a binary tree of
height ‘h’ is 2h – 1.
so from options try 2
Then 2h – 1.=63
here h =2
Then 22 – 1.=3
So option A wrong
Then Option B
2h – 1.=63=24
– 1.=16-1=15
4 is greater than 3 so we can skip option C
Then Try for option D
2h – 1.=63
26 – 1.=63
32*2=64-1=63
7.
A subnet mask in class C have --------------- 1's with the remaining bits 0's
A)10
B) 24
C) 12
D) 7
8.
In a particular system it is observed that. the cache performance gets improved
as a result of increasing the block size of the cache. The primary reason
behind this is:
A.
Programs exhibits temporal locality
B.
Programs have small working set
C.
Read operation is frequently
required rather than write operation
D. Programs
exhibits spatial locality
9.
Which layer connects the network support layer and user support layers
A) Transport layer
B) network layer
C) Data link layer
D) Session Layer
Exp: The 7 Layers are
A
P
S
T
N
D
P
10. In IPv4 Addresses, Class full addressing is replaced
with:
A. Classless Addressing
B.
Class full Addressing
C.
Subnet Advertising
D.
None of the options
Explanation:
In classful addressing, a large part of available addresses are
wasted. Thus to solve this classful addressing is replaced with classless
addressing.
11. The number of (25)6 in
base 6 is equivalent to ...................... in binary number system
A.
11001
B.
10001
C.
11000
D.
10000
Explanation convert 25 as 2*61+5*60
=12+5
=17
convert 17 into binary .
then
17
Therefore answer is option B
12. Let P,Q,R be a regular expression over £ . If P does not contain null string, then R= Q+RP has a unique solution _________.
A ) Q*P
B) Qp*
C) Q*P*
D) (P*Q*)*
13. Process in a ready state________
A) when process is scheduled to run after some execution
B) when process is unable to run untill some task has been completed
C) when process is using the CPU
D) none of the options
14. If a random coin tossed 11 times , then what is the probability that for the 7 th toss head appears exactly 4 times?
A) 5/32
B) 15/128
C) 35/128
D) None of the options
15.which of the following statement is true?
A) Melay and Moore machine are language acceptors
B) Finite state automata is language translator
C) NPDA is more powerful than DPDA
D) Melay machine is more powerful than Moore machine
16. The expression 5-2-3*-2 will evaluate to 18 if:
A) '-' is left associative and * has precedence over -
B) - is right associative and * has precedence over '-'
C) - is right associative and - has precedence over *
D) '-' is left associative and '-' has precedence over '*'
Expl: 5-2-3*-2
(5-2)(-3*-2)
-*-= +
There fore
3 *6=18
Given two sorted list of size m and n respectively. The number of comparisons needed in the worst case by merge sort algorith will be A) m*n
B) minimum of m,n
C) maximum of m,n
D) m+n-1
