Search for notes by fellow students, in your own course and all over the country.
Browse our notes for titles which look like what you need, you can preview any of the notes via a sample of the contents. After you're happy these are the notes you're after simply pop them into your shopping cart.
Title: DATA STRUCTURE EASY WAY
Description: Data Structure Questions and Answers in Easy way to Understand.....
Description: Data Structure Questions and Answers in Easy way to Understand.....
Document Preview
Extracts from the notes are below, to see the PDF you'll receive please use the links above
DATA STRUCTURE EASY WAY
Data Structure
1
...
Advance knowledge about the
relationship between data items allows designing of efficient algorithms for the
manipulation of data
...
List out the areas in which data structures are applied extensively?
Compiler Design,
Operating System,
Database Management System,
Statistical analysis package,
Numerical Analysis,
Graphics,
Artificial Intelligence,
Simulation
3
...
RDBMS
– Array (i
...
Array of structures)
Network data model – Graph
Hierarchical data model – Trees
4
...
It is not possible to use ordinary pointers for this
...
Void pointer is capable of storing pointer to any type as it
is a generic pointer type
...
Minimum number of queues needed to implement the priority queue?
Two
...
6
...
Because of its LIFO (Last In First Out) property it remembers its
‘caller’ so knows whom to return when the function has to return
...
Every recursive function has its equivalent iterative (non-recursive) function
...
1
DATA STRUCTURE EASY WAY
7
...
8
...
Prefix Notation:
^ - * +ABC - DE + FG
Postfix Notation:
AB + C * DE - - FG + ^
9
...
Using insertion we can perform insertion sort, using selection we can perform
selection sort, using exchange we can perform the bubble sort (and other similar
sorting methods)
...
10
...
In general,
A binary tree with n nodes has exactly n+1 null nodes
...
What are the methods available in storing sequential files ?
Straight merging,
Natural merging,
Polyphase sort,
Distribution of Initial runs
...
How many different trees are possible with 10 nodes ?
1014
For example, consider a tree with 3 nodes(n=3), it will have the maximum
combination of 5 different (ie, 23 - 3 = 5) trees
...
13
...
14
...
15
...
What is the type of the algorithm used in solving the 8 Queens problem?
Backtracking
17
...
18
...
If there is only one entry possible in the bucket, when the collision
occurs, there is no way to accommodate the colliding value
...
3
DATA STRUCTURE EASY WAY
19
...
Given tree:
A
C
B
D
G
F
E
H
I
J
Inorder : D H B E A F C I G J
Preorder: A B D H E C F G I J
Postorder: H D E B F I J G C A
20
...
Which of them could
have formed a full binary tree?
15
...
By the method of elimination:
Full binary trees contain odd number of nodes
...
With 13 nodes you can form a complete
binary tree but not a full binary tree
...
Note:
Full and Complete binary trees are different
...
21
...
Sort the given values using Quick Sort?
65
70
75
80
85
60
55
50
45
Sorting takes place from the pivot value, which is the first value of the given
elements, this is marked bold
...
65
70L
75
80
85
60
55
50
45R
Since pivot is not yet changed the same process is continued after interchanging the
values at L and R positions
65
45
75 L
80
85
60
55
50 R
70
65
45
50
80 L
85
60
55 R
75
70
65
45
50
55
85 L
60 R
80
75
70
65
45
50
55
60 R
85 L
80
75
70
When the L and R pointers cross each other the pivot value is interchanged with the
value at right pointer
...
60 L
45
50
55 R
65
85 L
80
75
70 R
55 L
45
50 R
60
65
70 R
80 L
75
85
50 L
45 R
55
60
65
70
80 L
75 R
85
5
DATA STRUCTURE EASY WAY
In the next pass we get the sorted form of the array
...
For the given graph, draw the DFS and BFS?
The given graph:
BFS:
AXGHPEMYJ
DFS:
AXHPEYMJG
24
...
Direct method,
Subtraction method,
Modulo-Division method,
Digit-Extraction method,
Mid-Square method,
Folding method,
Pseudo-random method
...
What are the types of Collision Resolution Techniques and the methods used in
each of the type?
Open addressing (closed hashing),
The methods used include:
Overflow block,
Closed addressing (open hashing)
The methods used include:
Linked list,
Binary tree…
6
DATA STRUCTURE EASY WAY
26
...
Because in B+ tree, all the data is stored only in leaf nodes, that
makes searching easier
...
27
...
Of the following tree structure, which is, efficient considering space
and time complexities?
(a) Incomplete Binary Tree
(b) Complete Binary Tree
(c) Full Binary Tree
(b) Complete Binary Tree
...
For incomplete binary trees, extra storage is required and
overhead of NULL node checking takes place
...
29
...
All the nodes of the graph
appear on the tree once
...
30
...
Minimal spanning tree assures that the total weight of the tree is kept at its
minimum
...
7
DATA STRUCTURE EASY WAY
31
...
600
1
3
200
612
410
310
2985
2
5
400
4
1421
the equivalent minimal spanning tree is:
1
3
200
310
612
410
2
4
5
32
...
Whether Linked List is linear or Non-linear data structure?
According to Access strategies Linked list is a linear one
...
34
...
For the following COBOL code, draw the Binary tree?
01 STUDENT_REC
...
03 FIRST_NAME PIC X(10)
...
02 YEAR_OF_STUDY
...
03 SECOND_SEM PIC XX
Title: DATA STRUCTURE EASY WAY
Description: Data Structure Questions and Answers in Easy way to Understand.....
Description: Data Structure Questions and Answers in Easy way to Understand.....