Prepard By : UdayShah (HOD-IT)
E-mail : rupareleducation@gmail.com
Contact No : 7600044051
Data Structure One Mark Question with Answer
1. A Graph is Data structure
consist of?
Finite
2. The Connection Between
Various nodes of Graph is called _______.
Edges
3. ______________ is Best Algorithm for Shortest path problem.
Dijkstra
4. _______ is an algorithm
for traversing finite graph.
DFS
5. ________ node is the Last
/ Bottom node of the Tree.
Leaf
6. How Many Types Of User
Difine Function?
4
7. What Is Full Name Of Udf?
User Define Function
8. What Is A Stack?
Linear Data
Structure
9. What Is A Base Of Stack?
Last In First
Out
10. Pointer Move In Linklist Is Called
Traversal
11. Array Is What Kind Of Data
Type.
Derived
12. Which Of The Following Is The Valid
Declaration Of A Character Array.
Char C[10][10]
13. A Table Is Always A Two Dimensional Array
Of Same Data Type.
True
14. Node without children called as
__________.
Leaf Node
15. A Parent node can hold ______________
child nodes.
Any
16. A Linked List Data structure consisting
of a group of ____________.
Node
17. Each Node in simply linked list contains
_________ fields.
2
18. The Function Which Removes The Memory
Allocation From The Memory Is.
Free()
19. What Is The Name Of The & Operator.
Dereference Operator
20. Which Is The Proper Declaration Of a
Pointer.
int *X;
21) What Type Of Function Is Main().
User Defined
22) A Function That Calls Itself For Its
Processing Is Known As --------
Recursive Function
23) Arguments Of A Function Are Separated
With ----------------
Comma (,)
24) We Declare A Function With --------- If It
Does Not Have Any Return Type.
Void
25) The Total Number Of
Comparisons In A Bubble Sort Is ---------
O(N2)
26) To Open a File Or Create a New File Which
Function Is Used --------
Fopen()
27) To Close a File Which Function Is Used
--------
Fclose()
28) In
Which Memory Area Our Dynamically Allocated Variable Will Be Used.
Hard Disk
29) Each Entry In A Linked List Is A Called A
___
Node
30) The Situation When In A Link List
Start=Null Is _______
Underflow
31) A data structure where elements can be added or removed at either end
but not in the middle
Stacks
32) The term "push" and
"pop" is related to the.
Stacks , queue , dequeue
33) Binary search algorithm can not be
applied to.
sorted linear array
34) Finding the location of the element with a
given value is.
Traversal
35) Two main measures for the efficiency of
an algorithm are.
Time and space
36) Which data structure is not linear data
structure?
Tree and Graph
37) A variable P is called pointer if.
P contain the DATA and the address of DATA
38) The Depth First Search begin with _____ node.
Root
40) The complexity of Binary search algorithm
is.
O(n log n)
41. Writing values to the stack is knows as
________ operation.
Push
42. Removing value from the stack is knows as
________ operation.
Pop
43. In stack elements are entered from _________
side.
Tos
44. Queue uses _____________ Approach.
FCFS (First Come Fist Server) or FIFO (First In First Out)
45. In queue addition is done from the __________
end.
Back
46. Information is
___________ type of representation.
Symbolic
47. _______ are Method of representing Logical
relationship between individual data Elements related to the solution of given
problem .
Data structure
48. __________ Should be declared with char data
type.
Electrification
49. Which sorting uses divide
and conquer technique?
Quick
50. _______ sorting technique is also knows as
Bin Sort .
Bucket
51. Which technique uses
in-place comparison method ?
Shell sort
52. __________
function allocates memory space for specified size.
Malloc () and Calloc ()
53. Which of the following function belongs to
stdlib.h header file?
Free ()
54. _________ is a collection of more then one
variable/ data field of _________ data Type.
Integer
55. Big Omega notation is define by____________.
f(n)=O(g(n))
56. Big Oh and _______ notations come in very
handy in analyzing algorithm
because We can ignore implementation issue.
Little Oh
57. Data structure should satisfactorily
represent the relationship between ________.
Data Element
58. Which data structure is not a linear data structure
?
Tree
59. Which data structure is a liner data
structure?
All of Given
60. Quick sort and Merge sort are example of
_________ algorithm .
Divide and Conquer Algorithm
61. Which of the following is not the category for classification of
algorithm?
Programming Language
62. Two main measure for the efficiency of an
algorithm are ___________.
Time and Space
63. For accessing a structure element using
pointer the operator used is
- >
64. To Persist value of a variable between
different function calls storage class used
is _____.
extern
65. Which of the following algorithm design
technique is used in the quick sort?
Divide and conquer
66. Finding the location of the element with a
given value is ________.
Traversal
67. The Default inital value of Static storage class is
0 (Zero)
68. Identify
the data structure which allows deletions at both ends of the list but
insertion at only one end.
input
– restricted deque
69. The term
“push” and “pop” is related to the ________
Array
link Lists Stack Queue
70. In a
singly linked list if link part of first node is null then the list contains
________.
1 (ONE)
71. A linked
list in which the last node points to the first is called a ___________
Circular
linked list
72. A doubly
linked list facilitates list traversals in _________.
Single
direction , Circular direction
73. To
represent hierarchical relationship between elements which data structure is
suitable?
Tree
74. The nodes
with no successor are called __________.
Leaf
Nodes
75. An edge
of a graph which joins a node to itself is called__________.
Loop , Path , Cycle
76. How many
techniques are there of graph traversal ?
2
77. How many
maximum numbers of nodes are there in complete binary tree?
3
78. Which
data structure is used to convert infix notation into postfix notation.
Stack
79. Pointer
is used to point to _______.
Static array , Dynamic array
80. At which
positions new nodes are added to simple queue?
Rear
Bubble and Selection
85. A Graph is data structure consist of ______ set of nodes.
Finite
86. In Circular queue ____________ shows empty queue.
Front = Rear
87. Proority queue elements are inserted and deleted on ______ bases.
Priority
88. To inprove performance priority queue uses a ________ as backbone.
Heap
89. if TOS == -1 Then Stack is _______.
Empty
90. A single linked list can traverse in ______ direction.
One
91. Which is the best technique for understanding program login in simple texture format?
Algorithm
92. ________ is platform independent.
Algorithm
93. Time complexity depends on _________ of program's output.
Size
94. The Default initial value of External Storage Class is _______
Garbage
95. B-Tree is balanced if all the leaf noad are at __________ depth.
Same
96. There are basic _____ types of linear data structure.
4 Array, Stack , Queue , Linked List
97. ________ node is any node which contains child node.
Inner
98. ________ is not type of Queue.
Double Queue
99. A double linklist can traversal in _______ direction.
2 (TWO)
100. In stack elements are entered from ________ side.
TOP
Best Of Luck
Plaease share and comment it... Thank you
