Question list on different topIcs On data structures:
1.
What is array?
2.
What is
algorithm of linear search array?
3.
What is
algorithm of binary search array?
4.
What is the
insert method in array and it’s algorithm
using array?
5.
What is the delete methods and it’s algorithm
using array?
6.
What is stack?
7.
How do data’s store in the stacks? Figure out this.
8.
What is the pop and push methods algorithm in stacks?
9.
Give the pseudo code of pop and push method in stacks.
10.
What is queue? How do data’s store in the queues? Figure out
this.
11.
What are the insertion and deletion methods in queues? Write
the algorithm for those methods.
12.
Write the algorithm of infix to postfix conversion? Give the
pseudo code.
13.
Convert the
following expression in postfix notation: 5 * (6
+ 2) –
12/4 [This
type of example]
14.
Write the algorithm of postfix evaluation? Give the pseudo
code.
15.
Evaluate the
postfix expression: 562
+* 124 / - [This type of example]
16.
What is linked
list?
17.
What is the
difference between arrays and linked list?
18.
Why linked
list is called dynamic?
19.
What type of
linked list have you ever seen? Give them with an example also draw the figure.
20.
Write down the
algorithm and pseudo code for inserting, deleting, searching, display and all
getCount methods in the linked list?
21.
What is tree?
22.
What is binary
tree or binary search tree?
23.
What is the
complexity of a program?
24.
Difference
between the binary search trees complexity and normal arrays complexity?
25.
Is the
following code follow rules of the binary tree or not?
No comments:
Post a Comment