Data Structure and Algorithm Analysis
Questions 61 to 70
61.

List out
the areas in which data structures are applied extensively.


62.

What is
the major data structure used in the Network data model?


63.

The data
structure used in the Hierarchical data model is


64.

Minimum
number of queue(s) needed to implement the priority queue is(are)


65.

What data
structure is used to perform recursion?


66.

For the
expression ((A + B) * C – (D – E) ^ (F + G)), the equivalent Postfix notation
is


67.

The
Prefix notation for the above infix expression is


68.

Sorting
is not possible by using which of the following methods?


69.

The
number of null branches for a binary tree with 20 nodes is


70.

What is
the type of the algorithm used in solving the 8 Queens problem?

Answers
61.

Answer : (e)
Reason : As the data structure can be used in all the application areas
right from the compiler design to operating systems and even in database
management system design.

62.

Answer : (d)
Reason : As the graph is the suitable data structure to represent the
connectivity between the nodes as edges.

63.

Answer : (b)
Reason : As tree data structure is used to represent the Hierarchical
relationship between the nodes as parent and children.

64.

Answer : (a)
Reason : Two : One queue is used for actual storing of data and another for
storing priorities.

65.

Answer : (c)
Reason : Because of its LIFO (Last In First Out) property it remembers its
‘caller’ so knows whom to return when the function has to return. Recursion
makes use of system stack for storing the return addresses of the function
calls.

66.

Answer : (d)
Reason : As per the precedence and associativity of the operators, brackets
are evaluated first and then multiplication operators followed by addition,
subtraction operators.

67.

Answer : (b)
Reason : As per the precedence and associativity of the operators, brackets
are evaluated first and then multiplication operators followed by addition,
subtraction operators.

68.

Answer : (c)
Reason : 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) and using the portioning we can perform
merge sort(and other similar sorting methods) But no sorting method can be
done just using deletion.

69.

Answer : (a)
Reason : A binary tree with n
nodes has exactly n+1 null nodes.

70.

Answer : (e)
Reason : As the other types of algorithms are not suitable to find the
solution for the given problem.

very good and very useful
ReplyDeleteGreat and Useful Article.
ReplyDeleteJava Online Course
Java Online Training
Java EE training
Java Course in Chennai
Java Training in Chennai
Java Training Institutes in Chennai
Java Interview Questions
Java Interview Questions
Programming is very interesting and creative thing if you do it with love. Your blog code helps a lot to beginners to learn programming from basic to advance level. I really love this blog because I learn a lot from here and this process is still continuing.
ReplyDeleteLove from Pro Programmer
Very Useful Post!Thanks!
ReplyDeleteData Structure Programming