Cs301: MCQS FOR QUIZ,GRAND QUIZ PART 1

                  Topic:Cs301: MCQS FOR QUIZ,GRAND QUIZ PART 1

1)Each node in singly linked list has pointer
a)one b)two c)three d)four
2)Parameters in function call are passing using
a)Stack b)Queue c)Binary Search Tree d)AVL Tree
3)Insertion in a linked list can be done
a)front only b)back only c)middle only d)anywhere
4)The                 method of list data structure removes the element residing at current position
a)Add b)Remove c)Next d)Find
5)A Array is a group of               memory location
a)consecutive b)isolated c)random d)scattered
6)Every AVL Tree is            
a)Binary Search Tree b)Complete Tree c)Heap d)Ternary Tree
7)Non recursive calls are faster than                 
a)Parameterized b)Recursive c)Function d)Non function
8)Searching an element in Binary tree takes                maximum
a)log2(n+1) b)log2(n+1) -1 c)1.44 log2n d)1.66log2n
9)A complete Binary Tree having node N consist of               levels
a)log2(N+1) -1 b)log2(N-1) -1 c)log2(N+1) +1 d))log2(N-1) +1
10)In post order transversal of Binary Search  Tree,nodes process at
a)Left-sub-tree,Right-sub-tree,Root b)Right-sub- tree,Root,Left-sub-tree c)Root,Left-sub-tree,Right-sub-tree

                                  Prepared by: Usama Arshad

                                            ***Don't be Copy Paste***