1) palindrome...... recognized by finite automata A may be B can be C can't be D may not be
Ans can't be
2) error detection is done bya hamming codes B cycle redundancy codes C routers d othersAns
3) how many canonical expressions can be formed when edge =2
4) if i/ps in a stack are in order 1,2,3,4,5 the order of o/ps is
5) a logic gates does response to i/p in a ) a sec b) hundredths of sec c)a few millions of sec d) a few billions of sec
6) shortest distance can be determined by which algorithm a) dynamic programming b) greedy method 3) backtracking 4) divide & conquer Ans
7) 7489 IC is a)32 bit rom B) 32 bit ram C)64rom D)64 ram
8) value of max clock is given to which a) shift register b) counter c) logic gate d)flip flop
9)in semantic analysis what we do A) arguments analysis B) syntactic constructs checking
10) which of following a queue can perform A printer spooling B cpu scheduling
11) which of following is a continuous data structure in which insertion can take place from any direction but deletion takes place from opposite direction
A) stack B) queueC)array D) tree
12) how much channels an ISDN has in which different operations are done simultaneously a)2 b) 3c) 4 d) 5
13)which n/w comprises a server in centre & rest nodes surround it ?
Ans star n/w
14) a tree in which every node(value) which exceeds parent node is placed on right while node lacking than parent is placed on left Is called?
15) when thrashing is done
16) what are number of nodes in tree ?
17 which one of these always reside in memory? A) assembler B) linker C) loader D) compiler C)none of these.
18) hashing table signifies for what ?
19) how many address bits should there be in segmentation with paging to show 512 segments each having 64 pages .
20) Round robin scheduling four jobs A,B,C,D were given to queue having completion time 4,1,2,1. the quantum period was unit sec. then find throughput time
of job A.
21) how many paths would be formed to make a complete n/w between four nodes
22) segment statements are stored in ?
23) alias statement are invoked by ?
24) if any Automatic variable is not initialised then it will have? A garbage B 0 C -1D 1
25) recursive language is recognized by A turing m/c B non finite automataC finite automata D#####( note: refer to theory of computation & automata)
26) which protocol is used for identifying IP address A arp B rarp C x.25
c-> x then corresponding string is
a) x*w+ y*w
28) how many words can be stored in a memory of 64K?
Ans channel allocation algo
30)frequency bandwidths are allotted to message by A) modem B) frequency division mux
31) message passing is for what ?
32) Addressing mode in which contents of operand are direct fetched from memory without change A) indirect B) index register mode C) implied D) base