Data Structures and Algorithms
Technical Publications, Jan 1, 2008 - 695 pages
Abstract data types - Sequences as value definitions - Data types in C - Pointers in C - Data structures and C - Arrays in C - Array as ADT - One dimensional array - Implementing one dimensional array - Array as parameters - Two dimensional array - Structures in C - Implementing structures - Unions in C - Implementation of unions - Structure parameters - Allocation of storage and scope of variables. Recursive definition and processes: Factorial function - Fibonacci sequence - Recursion in C - Efficiency of recursion.
Stack, Queue and Linked List
Stack definition and examples - Primitive operations - Example - Representing stacks in C - Push and pop operation implementation.
Queue as ADT - C implementation of queues - Insert operation - Priority queue - Array implementation of priority queue.
Inserting and removing nodes from a list-linked implementation of stack, queue and priority queue - Other list structures - Circular lists: Stack and queue as circular list -Primitive operations on circular lists. Header nodes - Doubly linked lists - Addition of long positive integers on circular and doubly linked list.
Binary trees: Operations on binary trees - Applications of binary trees - Binary tree representation - Node representation of binary trees - Implicit array representation of binary tree - Binary tree traversal in C - Threaded binary tree - Representing list as binary tree - Finding the Kth element - Deleting an element.
Trees and their applications: C representation of trees - Tree traversals - Evaluating an expression tree - Constructing a tree.
Sorting and Searching
General background of sorting: Efficiency considerations, Notations, Efficiency of sorting. Exchange sorts: Bubble sort; Quick sort; Selection sort; Binary tree sort; Heap sort. Heap as a priority queue - Sorting using a heap - heap sort procedure - Insertion sorts: Simple insertion - Shell sort - Address calculation sort - Merge sort - Radix sort.
Sequential search: Indexed sequential search - Binary search - Interpolation search. Graphs Application of graph - C representation of graphs - Transitive closure - Warshall‚€™s algorithm - Shortest path algorithm - Linked representation of graphs - Dijkstra‚€™s algorithm - Graph traversal - Traversal methods for graphs - Spanning forests - Undirected graph and their traversals - Depth first traversal - Application of depth first traversal - Efficiency of depth first traversal - Breadth first traversal - Minimum spanning tree - Kruskal‚€™s algorithm - Round robin algorithm.
What people are saying - Write a review
We haven't found any reviews in the usual places.
Chapter 3 Strings 3 1 to 3
Chapter4 Derived Types 41 to 420
Chapter 5 Introduction to Data Structures 5 1 to 5
Chapter6 Recursion 61 to 6
Linked List V 9 1 to 9 120
Chapter 10 Trees 10 1 to 10
Chapter v11 Sorting and Searching 1t 1ib 11
Chapter12 Graphs 121 to 12 52
Short Answered Questions S1toS16
Other editions - View all
50 NULL adjacency matrix algorithm allocated array binary search tree btree bubble sort Called By:main Calls:none char circular linked list clrscr conio.h create data structure data type Deletion of element Display Enter Doubly Linked List empty enter More Elements Enter The Element Enter Your Choice example Exit Enter expression tree function Input getch graph head node head temp Hence implementation include<conio.h include<stdio.h Insert a node Insertion of element insertion sort int data integer Interpolation Search last node left child Main Menu malloc Marks memory node temp operand Output Enter Parameter Passing Method pointer variable postfix expression postorder preorder prev printf printf("\n Enter printf("\nEnter priority queue Program push recursive right child root node scanf sequential stack Step string struct node temp=head temp=temp->next temp2 temp3 threaded binary tree total number typedef struct Various operations vertices void main Want To enter want to insert