Delta X Technical Question Paper

Total points 33/50

Delta X Technical Question Paper

Student Name *

Abhishek

Roll Number

217Y1A3302

Branch *

CSIT

1. Which of the following is/are the levels of implementation of data * 1/1

structure

A) Abstract level

B) Application level

C) Implementation level

D) All of the above

 2. A binary search tree whose left subtree and right subtree differ in * 0/1
height by at most 1 unit is called ......

A) AVL tree

B) Red-black tree

C) Lemma tree

D) None of the above

Correct answer

A) AVL tree

3. _____ level is where the model becomes compatible executable code * 1/1

A) Abstract level

B) Application level

C) Implementation level

D) All of the above

4. Stack is also called as ? * 1/1

A) Last in first out

B) First in last out

C) Last in last out

D) First in first out

5. Which of the following is true about the characteristics of abstract data *1/1
types ?

i) It exports a type
ii) It exports a set of operations

A) True, False

B) False, True

C) True, True

D) False, False

6. ____ is not the component of data structure * 1/1

A) Operations

B) Storage Structures

C) Algorithms

D) None of the above

7. Which of the following is not the part of ADT description ? * 1/1

A) Data

B) Operations

C) Both of the above

D) None of the above

8. Inserting an item into the stack when stack is not full is called ____ *1/1
operation and deletion of item form the stack, when stack is not empty is
called ____ operation ?

A) push, pop

B) pop, push

C) insert, delete

D) delete, insert

9. ____ is a pile in which items are added at one end and removed from *1/1
the other

A) Stack

B) Queue

C) List

D) None of the above

10. ____ is very useful in situation when data have to stored and then *1/1
retrieved in reverse order

A) Stack

B) Queue

C) List

D) Link List
11. Which data structure allows deleting data elements from and *1/1
inserting at rear ?

A) Stacks

B) Queues

C) dequeues

D) Binary search tree

12. Which of the following data structure can't store the non- *1/1
homogeneous data elements ?

A) Arrays

B) Records

C) Pointers

D) Stacks

13. A ____ is a data structure that organizes data similar to a line in the *1/1
supermarket, where the first one in line is the first one out

A) Queue linked list

B) Stacks linked list

C) Both of them

D) Neither of them
 14. Which of the following is non liner data structure ? * 1/1

A) Stacks

B) List

C) Strings

D) Trees

15. Herder node is used as sentinel in ____ * 0/1

A) Graphs

B) Stacks

C) Binary tree

D) Queues

Correct answer

C) Binary tree

16. Which data structure is used in breadth first search of a graph to hold *1/1
nodes ?

A) Stack

B) Queue

C) Tree

D) Array
17. Identify the data structure which allows deletions at both ends of the *1/1
list but insertion at only one end ?

A) Input restricted dequeue

B) Output restricted dequeue

C) Priority queues

D) Stack

18. Which of the following data structure is non linear type ? * 1/1

A) Strings

B) Lists

C) Stacks

D) Graph

19. Which of the following data structure is linear type ? * 1/1

A) Graph

B) Trees

C) Binary tree

D) Stack
 20. To represent hierarchical relationship between elements, which data *1/1
structure is suitable?

A) Dequeue

B) Priority

C) Tree

D) Graph

21. A directed graph is _____ if there is a path from each vertex to every *1/1
other vertex in the digraph

A) Weakly Connected

B) Strongly Connected

C) Tightly Connected

D) Linearly Connected

22. In the ____ traversal we process all of a vertex's descendants before *···/1
we move to an adjacent vertex

A) Depth First

B) Breadth First

C) Width First

D) Depth Limited

No correct answers
23. State True or False *1/1
i) Network is a graph that has weights or costs associated with it
ii) An undirected graph which contains no cycles is called a forest.
iii) A graph is said to be complete if there is no edge between every pair
of vertices.

A) True, False, True

B) True, True, False

C) True, True, True

D) False, True, True

24. The number of comparisons done by sequential search is ___ * 1/1

A) (N/2)+1

B) (N+1)/2

C) (N-1)/2

D) (N+2)/2

25. In _____, search start at the beginning of the list and check every *1/1
element in the list.

A) Linear Search

B) Binary Search

C) Hash Search

D) Binary Tree Search

 26. State Tre or False * 0/1
i) Binary search is used for searching in a sorted array
ii) The time complexity of binary search is O(logn)

A) True, False

B) False, True

C) False, False

D) True, True

Correct answer

D) True, True

27. Which of the following is not the internal sort? * 1/1

A) Insertion Sort

B) Bubble Sort

C) Merge Sort

D) Heap Sort
 28. State True or False *0/1
i) An undirected graph which contains no cycles is called forest
ii) A graph is said to be complete if there is no edge between every pair of
vertices.

A) True, True

B) False, True

C) False, False

D) True, False

Correct answer

A) True, True

29. A graph is said to be _____ if the vertices can be split into two sets V1 *1/1
and V2 such there are no edges between two vertices of V1 or two
vertices of V2

A) Partite

B) Bipartite

C) Rooted

D) Bisects
 30. In a queue, the initial values of front pointer f rare pointer r should be *0/1
____ and ____ respectively.

A) 0 and 1

B) 0 and -1

C) -1 and 0

D) 1 and 0

Correct answer

B) 0 and -1

31. Which of the following statement is true *0/1

i) Using singly linked lists and circular list, it is not possible to traverse the
list backwards
ii) To find the predecessor, it is required to traverse the list from the first
node in case of singly linked list

A) i-only

B) ii-only

C) Both i and ii

D) None of both

Correct answer

C) Both i and ii
 32. The advantage of ____ is that they solve the problem if sequential *1/1
storage representation. But disadvantage in that is they are sequential
lists.

A) Lists

B) Linked Lists

C) Trees

D) Queues

33. What will be the value of top, if there is a size of stack STACK_SIZE is *0/1
5

A) 5

B) 6

C) 4

D) None

Correct answer

C) 4

34. _____ is not the operation that can be performed on queue * 1/1

A) Insertion

B) Deletion

C) Retrieval

D) Traversal
 35. There is an extra element at the head of the list called a ___ * 0/1

A) Antinel

B) Sentinel

C) List header

D) List head

Correct answer

B) Sentinel

36. A graph is collection of nodes, called ____ and line segments called *1/1
arcs or ___ that connect pair of nodes

A) Vertices, edges

B) edges, vertices

C) vertices, paths

D) graph node, edges

37. A ___ is a graph that has weights of costs associated with its edges * 1/1

A) Network

B) Weighted graph

C) Both A and B

D) None A and B
 38. In general, the binary search method needs no more than *0/1
comparisons.

A) [log2n]-1

B) [logn]+1

C) [log2n]

D) [log2n]+1

Correct answer

D) [log2n]+1

39. Which of the following is not the type of queue? * 0/1

A) Ordinary queue

B) Single ended queue

C) Circular queue

D) Priority queue

Correct answer

B) Single ended queue

 40. The property of binary tree is * 0/1

A) The first subset is called left subtree

B) The second subtree is called right subtree

C) The root cannot contain NULL

D) The right subtree can be empty

Correct answer

D) The right subtree can be empty

41. State True or False * 0/1

i) The degree of root node is always zero.
ii) Nodes that are not root and not leaf are called as internal nodes

A) True, True

B) True, False

C) False, True

D) False, False

Correct answer

C) False, True
 42. Any node is the path from the root to the node is called * 1/1

A) Successor node

B) Ancestor node

C) Internal node

D) None of the above

43. State true or flase. * 0/1

i) A node is a parent if it has successor nodes.
ii) A node is child node if out degree is one.

A) True, True

B) True, False

C) False, True

D) False, False

Correct answer

B) True, False
 44. ____ is not an operation performed on linear list * 0/1
a) Insertion b) Deletion c) Retrieval d) Traversal

A) Only a,b and c

B) Only a and b

C) All of the above

D) None of the above

Correct answer

D) None of the above

45. Which is/are the application(s) of stack? * 1/1

A) Function calls

B) Large number Arithmetic

C) Evaluation of arithmetic expressions

D) All of the above

46. A ___ is an acyclic digraph, which has only one node with indegree 0, *1/1
and other nodeshave in-degree 1.

A) Directed tree

B) Undirected tree

C) Dis-joint tree

D) Direction oriented tree

 47. _____ is a directed tree in which outdegree of each node is less than *1/1
or equal to two.

A) Unary tree

B) Binary tree

C) Trinary tree

D) Both B and C

48. State true or false * 0/1

i) An empty tree is also a binary tree
ii) In stricly binary tree, the out-degree of every node is either 0 or 2.

A) True, False

B) False, True

C) True, True

D) False, False

Correct answer

C) True, True

49. Which of the following data structures are indexed structures? * 1/1

A) Linear arrays

B) Linked lists

C) Queue

D) Stack
 50. Which of the following data structure store the homogeneous data *0/1
elements?

A) Arrays

B) Records

C) Pointers

D) Lists

Correct answer

B) Records

This content is neither created nor endorsed by Google. - Terms of Service - Privacy Policy

Does this form look suspicious? Report

Forms