in ascending or descending order in case of numerical data and in dictionary order in case of alphanumeric data.
Sorting ? Arranging the data items in some order i.e. Searching ? Find out the location of the data item if it exists in the given collection of data items. Traversal ? Access each data item exactly once so that it can be processed. Deletion ? Delete an existing data item from the given collection of data items. Insertion ? Add a new data item in the given collection of data items. Analysis of Algorithms | Set 3 (Asymptotic Notations). Analysis of Algorithms | Set 1 (Asymptotic Analysis). BASIC DATA STRUCTURES AND ALGORITHMS INTERVIEW QUESTIONS FULL
SQL | Join (Inner, Left, Right and Full Joins).Construct Full Binary Tree from given preorder and postorder traversals.Construct a Binary Tree from Postorder and Inorder.Construct Tree from given Inorder and Preorder traversals.Print Postorder traversal from given Inorder and Preorder traversals.Inorder Tree Traversal without recursion and without stack!.
Inorder Tree Traversal without Recursion. Tree Traversals (Inorder, Preorder and Postorder). Breadth First Search or BFS for a Graph. Unique paths covering every non-obstacle block exactly once in a grid. Print all possible paths from top left to bottom right of a mXn matrix. Count all possible paths from top left to bottom right of a mXn matrix. Count number of ways to reach destination in a Maze. The Knight’s tour problem | Backtracking-1. Warnsdorff’s algorithm for Knight’s tour problem. Printing all solutions in N-Queen Problem. Top 10 algorithms in Interview Questions. 
Commonly Asked Data Structure Interview Questions | Set 1. Commonly Asked Algorithm Interview Questions | Set 1. ISRO CS Syllabus for Scientist/Engineer Exam. ISRO CS Original Papers and Official Keys. 
GATE CS Original Papers and Official Keys.
0 kommentar(er)
