What To Be Learn in Data Structures
Basics of Data Structures and Algorithm
Complexity
Q- What is linear and non linear search in data Structures?
Q- What are the various operations that can be performed on data structures?
Q- What is Stack and where it can be used?
Answer:
Stack is a linear data structure. its work in order LIFO(Last In First Out) for accessing elements.
Basic operations are : Push, Pop , Peek
Q- What is a Queue, how it is different from stack and how is it implemented?
Q- What are Infix, prefix, Postfix notations?
Q- What is a Linked List and What are its types?
Q- Which data structures are used for BFS and DFS of a graph?
Q- Can doubly linked be implemented using a single pointer variable in every node?
Q- How to implement a stack using queue?
Q- How to implement a queue using stack?
Q- Which Data Structure Should be used for implementiong LRU cache?
Q- How to check if a given Binary Tree is BST or not?
Q- How to implement Insertion, Deletion and traversal in Linked List Questions
Q- How to get middle of a given linked list?
Q- How to find Nth node from the end of a Linked list?
Q- How to do Inorder, Preorder and Postoder Traversals, Level order traversal, Height of Binary Tree in Tree Traversal
Q- How to delete a given node in a singly linked list?
Q- Write a program to reverse a linked list?
Q- Write a program to detect loop (circular) in a linked list.
Q- What is the data structure is used for dictionary and spell checker?
Related Tutorial
Basics of Data Structures and Algorithm
Complexity
- Space Complexity of Algorithms
- Time Complexity of Algorithms
- Linear Search
- Binary Search
- Depth-first search (DFS)
- Breadth First Search (BFS) algorithm
- Bubble Sort
- Selection Sort
- Insertion Sort
- Merge Sort
- Quick Sort
- Heap Sort
- Stack Data Structure
- Queue Data Structure
- Circular Queue
- Queue using Stack
- Linked List vs. Array
- Linear Linked List
- Circular Linked List
Q- What is linear and non linear search in data Structures?
Q- What are the various operations that can be performed on data structures?
- Insertion
- Deletion
- Traversal
- Searching
- Sorting
Q- What is Stack and where it can be used?
Answer:
Stack is a linear data structure. its work in order LIFO(Last In First Out) for accessing elements.
Basic operations are : Push, Pop , Peek
Q- What is a Queue, how it is different from stack and how is it implemented?
Q- What are Infix, prefix, Postfix notations?
Q- What is a Linked List and What are its types?
Q- Which data structures are used for BFS and DFS of a graph?
Q- Can doubly linked be implemented using a single pointer variable in every node?
Q- How to implement a stack using queue?
Q- How to implement a queue using stack?
Q- Which Data Structure Should be used for implementiong LRU cache?
Q- How to check if a given Binary Tree is BST or not?
Q- How to implement Insertion, Deletion and traversal in Linked List Questions
Q- How to get middle of a given linked list?
Q- How to find Nth node from the end of a Linked list?
Q- How to do Inorder, Preorder and Postoder Traversals, Level order traversal, Height of Binary Tree in Tree Traversal
Q- How to delete a given node in a singly linked list?
Q- Write a program to reverse a linked list?
Q- Write a program to detect loop (circular) in a linked list.
Q- What is the data structure is used for dictionary and spell checker?
Related Tutorial
Nice collections . Thanks for the share
ReplyDelete