13) The array index starts from ………………….

(A): 0
(B): 1
(C): 100
(D): A

14) In a matrix declared by int A[2][3], how many rows and columns are there ?

(A): 2 rows and 2 columns
(B): single row and single column
(C): 2 rows and 3 columns
(D): 6 rows and 3 columns

15) Pointer points to the ………….

(A): Address of a variable
(B): Value of a variable
(C): Value and address of a variable
(D): None of them

16) We access structure member through pointer using ……..

(A): & operator
(B): (.) operator
(C): (> operator)
(D): * operator

17) Insertion and deletion in Stack is called …………. operations.

(A): Enque and dequeue
(B): Insert and cut
(C): Push and Pop
(D): give and take

18) If the items 10, 20, 30 and 40 are inserted in the stack in the given ascending order, and then afterwards POP operation is performed, which item is deleted first ?

(A): 10
(B): 20
(C): 30
(D): 40

19) In the given function to display the stack elements what does int top gives ?

(A): stack size
(B): position of top item
(C): value of stack items
(D): None of them

20) The given expression is in the form of ……………… +AB

(A): infix
(B): postfix
(C): prefix
(D): none

21)A linkedlist is a collection of records, called ………………..

(A): vertices
(B): leafs
(C): branches
(D): nodes

22) In a tree the indegree of the root is ……………

(A): 0
(B): 1
(C): 2
(D): 3

23) Which function of C is used for memory allocation ?

(A): malloc
(B): alloc
(C): strcmp
(D): getch

24) In a deque (double ended queue) we can insert items from

(A): front end
(B): rear end
(C): front and rear end
(D): from the middle

25) A node in a doubly linked list has …………. parts

(A): 0
(B): 1
(C): 2
(D): 3

26) If a complete binary tree has height = 3, what is the degree of the root node ?

(A): 0
(B): 1
(C): 2
(D): 3

27) The unique predecessor of a node is called the …………………….

(A): mother
(B): parent
(C): teacher
(D): daughter

28) Links between the pair vertices in the graph is called as :

(A): line
(B): edge
(C): corner
(D): nodes

29) If a graph has only four vertices, how many edges is formed by a spanning tree ?

(A): 1
(B): 2
(C): 3
(D): 4

30) Which one means the fastest ?

(A): O(1)
(B): O(log n)
(C): O(n)
(D): O(n log n)

31) Which of the following data structure may give overflow error, even though the current number of elements in it is less than its size ?

(A): Stack
(B): circular queue
(C): double ended queue
(D): simple queue

32) Queue can be represented by :

(A): array
(B): linked list
(C): tree
(D): Only (1) and (2)

33) In Circular Link list

(A): Head node contains the address of tail node.
(B): Tail node contains the address of the head.
(C): Internal node contains the address of the head node.
(D): Tail node contains the address of the middle node.

34) An adjacency matrix representation of a graph cannot contain information of

(A): nodes
(B): edges
(C): Direction of edges
(D): parallel edges

35) Which of the following sorting method follow the strategy “ Divide and Conquer” ?

(A): Bubble sort
(B): Selection sort
(C): Insertion sort
(D): Merge Sort

36) Which of the following sorting method needs more memory space ?

(A): Bubble sort
(B): Selection sort
(C): Insertion sort
(D): None

37) Which of the following sorting method uses the partition technique ?

(A): Bubble sort
(B): Selection sort
(C): Insertion sort
(D): Quick sort

38) In a undirected graph G, V={A, B, C, D} and E = ,B),(A,C),(A,D),(B,C), (B,D), (CD)}. How many edges are there ?

(A): 4
(B): 5
(C): 6
(D): 7

39) Which of the following data structure may give overflow error, even though the current number of elements in it is less than its size ?

(A): Stack
(B): circular queue
(C): double ended queue
(D): simple queue

40) Maintain the hierarchy from top to bottom concerning the tree.

(A): leaf nodes, internal nodes, root
(B): internal nodes, root, leaf nodes
(C): root, internal nodes, leaf nodes
(D): root, leaf nodes, internal nodes
