Information and its meaning: Abstract Data Types, Sequences as Value Definitions, ADTfor Varying length character Strings, Data Types,Pointers and review of Pointers, DataStructures. Arrays : Array as an ADT, Using One-dimensional Arrays, Implementing One-Dimensional Arrays, Arrays as Parameters, Handling of Character Strings and CharacterStrings
Definition and examples , Primitive operations, Example, The stack as an ADT,Representing stacks ,Implementing the pop operation, Testing for exceptional conditions ,Implementing the push operations , Examples for infix , postfix, and prefix expressions,Basic definition and Examples ,Program to evaluate a postfix expression ,Converting anexpression from infix to postfix, Program to convert an expression from infix to postfix,Applications of Stacks: Expression Evaluations, Recursion etc.
Recursive definition and processes, Factorial function, Multiplication of naturalnumbers, Fibonacci sequence, Binary search, Properties of recursive definition oralgorithm. Binary search, Towers of Hanoi problem.
The queue and its sequential representation, the queue as ADT, Insert operation, Priorityqueue, Array implementation of a priority queue. Linked lists, Inserting and removing nodesfrom a list, Linked implementations of stacks, getnode and Freenode operations, Linkedimplementation of queues, Linked list as a data Structure, Example of list operations,Header nodes, Array implementation of lists, Limitations of array implementation,allocating and freeing dynamic variables, Linked lists using dynamic variables, Non integerand non-homogenous lists, Other list structures: Circular lists, Stack as a circular lists,doubly linked lists, Application of Linked Lists: Stacks, Queues, Double-ended Queues,Priority Queues.
Bubble sort, Quick sort, Selection sort, Tree Sorting: Binary Tree Sort, Heap Sort,Insertion Sorts: Simple Insertion, Shell Sort, Address Calculation Sort, Merge and Radix Sort.
Basic Search Techniques: Algorithmic Notations, Sequential searching, Searching anordered table, Indexed sequential search, Binary search, Interpolation search, Treesearching: Inserting into a Binary Search Tree ,Deleting form a binary search tree, Hashing :Resolving hash clashes by open addressing, Choosing a hash Function.
Tree traversals, Binary Search Tree and Operations, AVL Tree and Operations, Red-BlackTree, Threaded binary trees and operations.