1) Sorting Technique.
— In-place and Not-In-Place sorting.
— Stable and Not Stable Sorting.
— Adaptive and Non-Adaptive sorting.
— Internal and External sorting.
— Explain the following orders.
● Increasing order.
● Decreasing order.
● Non-increasing order.
● Non-decreasing order.
— Bubble Sort algorithm.
— Insertion Sort Algorithm.
— Selection Sort Algorithm.
— Merge Sort Algorithm.
— Shell Sort Algorithm.
— Quick Sort Algorithm.
2) Algorithms BASICS.
— Definition of an Algorithm.
—Categories of an Algorithm.
— Characteristics of an Algorithm.
— Algorithm Analysis.
— Algorithm complexity.
— What's asymptotic analysis?
— Asymptotic notations.
— Explanation of above.
— What's a greedy Algorithm?
— Example/uses of Greedy Algorithm.
— Divide and Conquer Algorithm.
— Example/uses of Divide and Conquer.
— Dynamic Programming.
— Example/uses of Dynamic Programming.
3) OVERVIEW.
— Define Data structures.
— Terms of Data structures.
— Characteristics of Data Structures.
— Need for Data structures.
— Execution time cases.
— Talk about the following terminologies.
● Data.
● Data Item.
● Group Item.
● Elementary Item.
● Attribute & Entity.
● Entity Set.
● Field.
● Record.
● File.
4) LINEAR DATA STRUCTURES.
— Characteristics of Data Definition.
— Explain the above.
— What's Data type?
— Types of Data type.
— Explain and give examples for the 2.
— Basic Operations of DS. (6)
— Array definition.
— List and explain the important terms in an array.
— Array representation.
— Basic operations of an Array.
— What's a linked list?
— Important terms in Linked List.
— List and explain types of linked lists.
— Basic operations of a list.
— Basic operations of DLL.
— Basic operations of CLL.
— What implementation method does a STACK follow?
— Basic operations of a sSTACK.
— What implementation method does QUEUES follow?
— Basic operations of a QUEUE.
— Expression PARSING.
5) NON-LINEAR DATA STRUCTURES.
— GRAPH definition.
— Explain the following.
● Vertex.
● Edge.
● Adjacency.
● Path.
— Basic operations performed on a Graph.
— Talk all you know about Depth First Search.
— Talk all you know about Breadth First Search.
— Definition of TREE
— Explain the following trees terminologies.
● Root Node.
● Edge.
● Parent Node.
● Child Node.
● Siblings.
● Leaf Node.
● Internal Node.
● Degree.
● Level.
● Height.
● Depth.
● Path.
● Sub-tree.
— Tree Representation.
— Binary Tree Definition.
— Types of Binary tree.
— Binary Tree Representation.
— Binary Tree traversal.
6) Searching Technique.
— Talk about Linear Search.
— Talk about Binary search.
— Interpolation Search.
— Hash Table
