REC-Data-Structures-Digital-Cafe

NOTE: All questions will be uploaded soon!!

New Menu Alert!!: Now access the questions directly from the menu below!

It contains the questions of REC Data Structures Digital Cafe. Students are requested to try the questions on their own first and look up for solutions only when they're stuck or after they're to compare the methods of solving. Happy Coding!!

Applications of Stack ADT

• Evaluation of Postfix Expression
• Infix to Postfix Conversion Using Stack
• Checking for Operator precedence using Stack ADT
• Reverse a string using stack
• Balancing Parenthesis using stack

Queue ADT

• Picking up last job in multitasking environment
• Print the list of names in Print Queue

Array Implementation of List ADT

• List using Array example 1
• List using Array example 2

Circular Linked List

• Circular Linked List

Stack ADT

• push and display
• pop and display

Singly Linked List

• Singly Linked List- Program 1
• Singly Linked List- Program 2
• Singly Linked List- Program 3
• Singly Linked List- Program 4
• Merging two Singly Linked List
• Copying elements from one list to another list
• Polynomial Addition Singly Linked List
• Polynomial Differentiation Singly Linked List

Tree

• [Tree Traversal]
• Binary Search Tree
• [Binary Heap]
• [Heap Operation]

Graphs

• DFS
• BFS
• [Applications of Graph]

Searching

• Linear Search
• Binary Search