Home

 History

Messages

 Courses Fees Structure Faculty College Activities Alumini Infrastructure

 
courses.jpg (14239 bytes)Computer Science

Syllabus 2004 - 2005
B.Sc. II , Semester-III (July) Computer Science
Data Structure

Unit 1 :
Definition of Data Structure : Types, dynamic variable, representation and Address calculation of single and multidimensional arrays in memory, Pointers, Pointers to Structure, function Parameter Passing and secondary keys. Complexity analysis, Computation and Asymptotic Complexity, Big O Notation. The Best case, Average and Worst case of Complexity.

Unit 2 :
Stack : Representation of stack, Operation on stacks, infix and postfix notation, multiple stacks, exchange the value of two stacks, recursion techniques, expression evaluation, application of stacks.
Queues : Representation of queues, operation on queues, circular queue, D-queue, application of Queue.

Unit 3 :
Linked List : Singly Linked List operation on it . Doubly Linked List , list traversal, insertion, deletion algorithms. Self Organizing Lists. Sparse Tables.
Implementation of stack and Queue using dynamic memory allocation ( linked list).
Recursions: Function calls and recursive implementation, Tail Recursion, Non tail Recursion.

Unit 4 :
Trees : Basic concept and definitions, basic operations on Binary trees, tree search, indexed sequential search, interpolation search
Internal Sorting : Bubble sort, selection sort, insertion sort, quick sort, merge sort on linked and contiguous list.
Hashing : basics, methods, collision, resolution of collision, chaining.
Graphs : Related definitions, graph representation.

 

Suggested Readings :
1. Data Structure By Sartaj Sahani.
2. Data Structure By Schaum Series.
3. Data Structure By Tanenbaum.
4. Data Structure through C by R.Krues.



Syllabus 2004 - 2005
B.Sc. II Semester III (July) - Computer Science
 Computer lab


1. Store records of 100 students using array of structure.
2. Representation of upper triangular and lower triangular spare matrix in linear array.
3. Program for exchange values of two variables using pointers.
4. Push and pop operation on stack using array.
5. Insertion and Deletion operation on queue using array.
6. Insertion and Deletion operation on circular queue using array.
7. Linked List Creation, deletion, insertion.
8. Count number of elements in linked list.
9. Doubly linked list creation, deletion and insertion.
10. Representation of polynomial in linked list
11. Creation of binary search tree.
12. Deletion and insertion in binary search tree.
13. Traversal of binary search tree (in-order, pre-order, post-order).
14. Complete program for binary search tree.
15. Basic Operation on linked stack and linked queue.
16. Program for quick sort.
17. Program for selection sort.
18. Program for selection sort.
19. Sort the Linked list.
20. Program for linear search.
21. Program for binary search.
 


Site Design by :
Creative Web Designer