UNIT-I


    Linear Structure: 
	
	Arrays, 
	records, 
	stack, 
	operation on stack, 
	implementation of stack as an array, 
	queue, 
	operations on queue, 
	implementation of queue.


  UNIT-II

    Linked Structure : 
	
	List representation, 
	operations on linked list - get node and free node operation, 
	implementing the list operation, 
	inserting into an ordered linked list, 
	deleting, 
	circular linked list, 
	doubly linked list.


  UNIT-III
 
    Tree Structure : 
	
	Binary search tree, 
	inserting, 
	deleting and searching into binary search tree, 
	implementing the insert, 
	search and delete algorithms, 
	tree traversals


  UNIT-IV


     Graph Structure : 
	
	Graph representation - Adjacency matrix, 
	adjacency list, 
	adjacency multilist representation. 
	Orthogonal representation of graph . 
	Graph traversals - bfs and dfs. 
	Shortest path, 
	all pairs of shortest paths, 
	transitive closure, 
	reflexive transitive closure.


  UNIT-V


     Searching and sorting : 

	Searching - sequential searching, 
	binary searching, 
	hashing. 
	Sorting - selection sort, 
	bubble sort, 
	quick sort, 
	heap sort, 
	merge sort and insertion sort, 
	efficiency considerations.


   Recommended Books:-


	1. Horowitz E Sartaj Sahni, Fundamentals of Data Structure, Galgotia Publication Private Limited., New Delhi.

Leave a Reply

Subscribe to Posts | Subscribe to Comments

Follow by Email

All Notes on BCA

All Notes  on BCA
BCA all subjects notes

Total Pageviews

Google+ Followers

Translate

Powered by Blogger.

- Copyright © All Notes on BCA - Metrominimalist - Powered by Blogger - Designed by Johanes Djogan -