524 questions and answers
Construct an AVL tree using the below list. Show all the steps 12, 11, 13, 10, 09, 15, 14, 18, 7, 6, 5.
Steps of creating AVL tree using the list
What is a priority queue ?
Priority queue is an abstract data type which is like a regular queue or stack data structure, but where additionally each element has a "priority" associated with it.
Find the postfix notation of
( a + b * x) / ( a ! – d ) s – c * y ( show all steps ).
Infix to Postfix conversion
What is a self referential structure? What is difference between Union & Structure?
A structure may have a member whose is same as that of a structure itself. Such structures are called self-referential.
Describe a string reversal algorithm. Write the difference between a [ ] [ ] and **a.
String Reversal Algorithm: strrevers()
Write short notes on the following :
a) BFS
b) Tail recursion
Breadth-first search is a way to find all the vertices reachable from the a given source vertex, s. Like depth first search, BFS traverse a connected component of a given graph and defines a spanning tree.
What is Weak entity set? Explain with suitable example.
The entity set which does not have sufficient attributes to form a primary key is called as Weak entity set.
What do you mean by ‘Ternary Relationship’? Define the concept of aggregation with suitable example.
This is a relationship between three entity types. In the real world there are relationships other than those involving two things. For example, suppose that we want to capture which employees use which skills on which project.
MindStudy - a preparation hub for all the students. The goal is to make it easier for pupils to get better grades on exams.
Copyright © 2025 MindStudy
A product by Shunya Intelliware Solution
(Registered under MSME Uddyam)