1.\u00a0\u00a0\u00a0 Which data structure allows deleting data elements from front and inserting at rear?
a. Stacks
b. Queues
c.\u00a0\u00a0 Deques
d. Binary search tree
2.\u00a0\u00a0\u00a0 Identify the data structure which allows deletions at both ends of the list but insertion at only one end.
a. Input-restricted deque
b. Output-restricted deque
c.\u00a0\u00a0 Priority queues
d. None of above
3.\u00a0\u00a0\u00a0 Which of the following data structure is non-linear type?
a. Strings
b. Lists
c.\u00a0\u00a0 Stacks
d. None of above
4.\u00a0\u00a0\u00a0 Which of the following data structure is linear type?
a. Strings
b. Lists
c.\u00a0\u00a0 Queues
d. All of above
5.\u00a0\u00a0\u00a0 To represent hierarchical relationship between elements, which data structure is suitable?
a. Deque
b. Priority
c.\u00a0\u00a0 Tree
d. All of above
6.\u00a0\u00a0\u00a0 A binary tree whose every node has either zero or two children is called
a. Complete binary tree
b. Binary search tree
c.\u00a0\u00a0 Extended binary tree
d. None of above
7.\u00a0\u00a0\u00a0 The depth of a complete binary tree is given by
a. Dn = n log2n
b. Dn = n log2n+1
c.\u00a0\u00a0 Dn = log2n
d. Dn = log2n+1
8.\u00a0\u00a0\u00a0 When representing any algebraic expression E which uses only binary operations in a 2-tree,
a. the variable in E will appear as external nodes and operations in internal nodes
b. the operations in E will appear as external nodes and variables in internal nodes
c.\u00a0\u00a0 the variables and operations in E will appear only in internal nodes
d. the variables and operations in E will appear only in external nodes
9.\u00a0\u00a0\u00a0 A binary tree can easily be converted into q 2-tree
a. by replacing each empty sub tree by a new internal node
b. by inserting an internal nodes for non-empty node
c.\u00a0\u00a0 by inserting an external nodes for non-empty node
d. by replacing each empty sub tree by a new external node
10.\u00a0 When converting binary tree into extended binary tree, all the original nodes in binary tree are
a. internal nodes on extended tree
b. external nodes on extended tree
c.\u00a0\u00a0 vanished on extended tree
d. None of above
11. The post order traversal of a binary tree is DEBFCA. Find out the pre order traversal
a. ABFCDE
b. ADBFEC
c.\u00a0\u00a0 ABDECF
d. ABDCEF
12.\u00a0 Which of the following sorting algorithm is of divide-and-conquer type?
a. Bubble sort
b. Insertion sort
c.\u00a0\u00a0 Quick sort
d. All of above
13.\u00a0 An algorithm that calls itself directly or indirectly is known as
a. Sub algorithm
b. Recursion
c.\u00a0\u00a0 Polish notation
d. Traversal algorithm
14.\u00a0 In a binary tree, certain null entries are replaced by special pointers which point to nodes higher in the tree for efficiency. These special pointers are called
a. Leaf
b. branch
c.\u00a0\u00a0 path
d. thread
15.\u00a0 The in order traversal of tree will yield a sorted listing of elements of tree in
a. Binary trees
b. Binary search trees
c.\u00a0\u00a0 Heaps
d. None of above
16.\u00a0 In a Heap tree
a. Values in a node is greater than every value in left sub tree and smaller than right sub tree
b. Values in a node is greater than every value in children of it
c.\u00a0\u00a0 Both of above conditions applies
d. None of above conditions applies
17.\u00a0 In a graph if e=[u, v], Then u and v are called
a. endpoints of e
b. adjacent nodes
c.\u00a0\u00a0 neighbors
d. all of above
18.\u00a0 A connected graph T without any cycles is called
a. a tree graph
b. free tree
c.\u00a0\u00a0 a tree
d. All of above
19.\u00a0 In a graph if e=(u, v) means
a. u is adjacent to v but v is not adjacent to u
b. e begins at u and ends at v
c.\u00a0\u00a0 u is processor and v is successor
d. both b and c
20. If every node u in G is adjacent to every other node v in G, A graph is said to be
a. isolated
b. complete
c.\u00a0\u00a0 finite
d. strongly connected<\/p>\n
\u00a0
Answers:<\/p>\n
\u00a0
1.\u00a0\u00a0\u00a0 Which data structure allows deleting data elements from front and inserting at rear?
b. Queues
2.\u00a0\u00a0\u00a0 Identify the data structure which allows deletions at both ends of the list but insertion at only one end.
a. Input-restricted deque
3.\u00a0\u00a0\u00a0 Which of the following data structure is non-linear type?
d. None of above
4.\u00a0\u00a0\u00a0 Which of the following data structure is linear type?
d. All of above
5.\u00a0\u00a0\u00a0 To represent hierarchical relationship between elements, which data structure is suitable?
c.\u00a0\u00a0 Tree
6.\u00a0\u00a0\u00a0 A binary tree whose every node has either zero or two children is called
c. Extended binary tree
7.\u00a0\u00a0\u00a0 The depth of a complete binary tree is given by
d. Dn =\u00a0 log2n + 1
8.\u00a0\u00a0\u00a0 When representing any algebraic expression E which uses only binary operations in a 2-tree,
a. the variable in E will appear as external nodes and operations in internal nodes
9.\u00a0\u00a0\u00a0 A binary tree can easily be converted into q 2-tree
d. by replacing each empty sub tree by a new external node
10.\u00a0 When converting binary tree into extended binary tree, all the original nodes in binary tree are
a. internal nodes on extended tree
11. The post order traversal of a binary tree is DEBFCA. Find out the pre order traversal
c.\u00a0\u00a0 ABDECF
12.\u00a0 Which of the following sorting algorithm is of divide-and-conquer type?
c.\u00a0\u00a0 Quick sort
13.\u00a0 An algorithm that calls itself directly or indirectly is known as
b. Recursion
14.\u00a0 In a binary tree, certain null entries are replaced by special pointers which point to nodes higher in the tree for efficiency. These special pointers are called
d. thread
15.\u00a0 The in order traversal of tree will yield a sorted listing of elements of tree in
b. Binary search trees
16.\u00a0 In a Heap tree
b. Values in a node is greater than every value in children of it
17.\u00a0 In a graph if e=[u, v], Then u and v are called
d. all of above
18.\u00a0 A connected graph T without any cycles is called
d. All of above
19.\u00a0 In a graph if e=(u, v) means
d. both b and c
20. If every node u in G is adjacent to every other node v in G, A graph is said to be
b. complete<\/p>\n","protected":false},"excerpt":{"rendered":"
1.\u00a0\u00a0\u00a0 Which data structure allows deleting data elements from front and inserting at rear? a. Stacks b. Queues c.\u00a0\u00a0 Deques d. Binary search tree 2.\u00a0\u00a0\u00a0 Identify the data structure which allows deletions at both ends of the list but insertion at only one end. a. Input-restricted deque b. Output-restricted deque c.\u00a0\u00a0 Priority queues d. None…<\/p>\n","protected":false},"author":1,"featured_media":0,"comment_status":"open","ping_status":"open","sticky":false,"template":"","format":"standard","meta":{"_kad_post_transparent":"","_kad_post_title":"","_kad_post_layout":"","_kad_post_sidebar_id":"","_kad_post_content_style":"","_kad_post_vertical_padding":"","_kad_post_feature":"","_kad_post_feature_position":"","_kad_post_header":false,"_kad_post_footer":false,"footnotes":""},"categories":[16],"tags":[],"class_list":["post-176","post","type-post","status-publish","format-standard","hentry","category-data-structures-and-algorithms"],"_links":{"self":[{"href":"https:\/\/temp.ashkerala.com\/index.php?rest_route=\/wp\/v2\/posts\/176","targetHints":{"allow":["GET"]}}],"collection":[{"href":"https:\/\/temp.ashkerala.com\/index.php?rest_route=\/wp\/v2\/posts"}],"about":[{"href":"https:\/\/temp.ashkerala.com\/index.php?rest_route=\/wp\/v2\/types\/post"}],"author":[{"embeddable":true,"href":"https:\/\/temp.ashkerala.com\/index.php?rest_route=\/wp\/v2\/users\/1"}],"replies":[{"embeddable":true,"href":"https:\/\/temp.ashkerala.com\/index.php?rest_route=%2Fwp%2Fv2%2Fcomments&post=176"}],"version-history":[{"count":0,"href":"https:\/\/temp.ashkerala.com\/index.php?rest_route=\/wp\/v2\/posts\/176\/revisions"}],"wp:attachment":[{"href":"https:\/\/temp.ashkerala.com\/index.php?rest_route=%2Fwp%2Fv2%2Fmedia&parent=176"}],"wp:term":[{"taxonomy":"category","embeddable":true,"href":"https:\/\/temp.ashkerala.com\/index.php?rest_route=%2Fwp%2Fv2%2Fcategories&post=176"},{"taxonomy":"post_tag","embeddable":true,"href":"https:\/\/temp.ashkerala.com\/index.php?rest_route=%2Fwp%2Fv2%2Ftags&post=176"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}