Data Structures & Algorithms are fundamental concepts in computer science that deal with organizing, storing, and manipulating data efficiently. Data structures (e.g., arrays, linked lists, trees, graphs) provide ways to manage and access data, while algorithms are step-by-step procedures for solving problems or performing computations (e.g., sorting, searching, optimization). Together, they form the backbone of software development, enabling efficient problem-solving, performance optimization, and scalable solutions in programming and real-world applications.
40 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 are the difference between linear and non-linear data structure?
Main difference between linear and non-linear data structures lie in the way they organize data elements.
Discuss the differences between command file and executable file.
Both files are commonly found in a program’s root installation directory and both run programs when opened. Often, they even have the same Windows icon. To the average user, .BAT and .EXE files appear nearly identical.
In which cases, QuickSort becomes a ‘SlowSort’ ? What Is the remedy In those cases?
There are few cases for which QuickSort becomes "Slowsort", with complexity of O(n2). Consider, for example, what happens if the value picked each time as the partitioning value happens to be the largest,
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)