Recursion and Linear Search
Preliminaries of algorithm,
Algorithm analysis and complexity.
Recursion
Definition,
Design Methodology and Implementation of recursive
algorithms,
Linear and binary recursion
Recursive algorithms for factorial function
GCD computation
Fibonacci
sequence
Towers of Hanoi
Tail recursion
Searches
Linear Search,
Binary Search,
Fibonacci Search,
Analyzing search algorithms.
Sorting Techniques
Basic concepts,
Insertion (Insertion sort),
Selection (heap sort),
Exchange
Bubble sort
Quick sort
Distribution (radix sort )
Merging (merge sort ) Algorithms.
Stacks and Queues:
Basic Stack Operations
Representation
of a Stack using Arrays,
Stack Applications
Reversing list
Factorial Calculation
In-fix- to postfix Transformation
Evaluating Arithmetic Expressions.
Queues
Basic Queues Operations
Representation of a Queue using array
Implementation of Queue
Operations using Stack
Applications of Queues-Round robin Algorithm
Enqueue
Dequeue
Circular
Queues
Priority Queues.
Linked Lists
Introduction
Single linked list
Representation of a linked list in memory
Operations on a single linked
list
merging two single linked lists into one list
Reversing a single linked list
Applications of single
Linked list to represent polynomial expressions
Sparse matrix manipulation,
Advantages and
disadvantages of
single linked list,
Circular linked list
Double linked list
Trees
Basic tree concepts
Binary Trees
Properties
Representation of Binary Trees using arrays and linked
lists,
Operations on a Binary tree ,
Binary Tree Traversals,
Creation of binary tree from in-order and
pre(post)order traversals,
Tree Travels using stack,
Threaded Binary Trees.
Advanced concepts of Trees
Binary search tree
Basic concepts
BST
operations
Insertion
Deletion
Balanced binary trees
AVL Search Trees
Basic concepts
Operations:
Insertion
Deletion
m-way search trees operations:
Insertion
Deletion
B Trees
Operations:
Insertion
Deletion
Graphs:
Basic concepts,
Representations of Graphs: using Linked list and
adjacency matrix,
Graph algorithms
Graph Traversals (BFS & DFS)
applications:
Dijkstra’s shortest path
Transitive closure
Minimum Spanning
Tree using Prim’s Algorithm
warshall’s Algorithm.
Sets:
Definition,
Representation
of Sets using Linked list,
Operations of sets using linked lists,
Application of sets- Information storage using bit
strings
Abstract Data Type Introduction to abstraction
Model for an Abstract Data Type
ADT Operations
ADT Data Structure
ADT Implementation of array
Linked list and stack.
No comments:
Post a Comment