1.The minimum number of edges in a connected cyclic graph on n vertices is
a) n-1 b) n c) n+1 d)none of these
2.A full binary tree with n non leaf nodes contains
a) n nodes b) log n nodes c)2n-1 nodes d)2n nodes
3.The time complexity of shell sort
a) O(n) b) O(log n) c) O(n ) d)O(n )
4.The time taken to insert an element after an element pointed by some
a) O(1) b) O(log n) c) O(n) d) O(nlogn)
5. what is the name given to the first generation computer?
a) Binary language b)Machine language c)Assembly language
6.The root directory of a disk should be placed
a) at a fixed address in main memory
b) at a fixed location on disk
c) anywhere on disk.
7.A top down parser generates
a) right most derivation
b) left most derivation
c) right most derivation in reverse
d) left most derivation in reverse
8.what is the name of the OS that reads and reacts in terms of actual time?
9.FDDI is a
10.Computer memory consists of
d)all the above