Tags: DS Syllabus, RGPV, BE, EI syllabus, Data structure and algorithms syllabus, B.E. Electronics and Instrumentation, EI VI Semester Data structure and algorithms syllabus, EI 4th Semester syllabus, RGPV EI 402 Data structure and algorithms syllabus
Rajiv Gandhi Technological University, Bhopal (MP)
B.E. (EI) Electronics and Instrumentation Engineering FOURTH IV SEMESTER
EI 402 Data structure and algorithms
Revised Syllabus and Scheme of Examination Effective from July 2007
B.E. (EI) Electronics and Instrumentation Engineering FOURTH IV SEMESTER
EI 402 Data structure and algorithms
Revised Syllabus and Scheme of Examination Effective from July 2007
Unit I Structural programming, top-down design., abstract data type, implementation of arrays, triangular arrays, structures, character strings, Pointers dynamic memory management.
Unit II Singly linked list, implementation linked list using arrays, implementation of linked list using dynamic memory allocation circular link list, Josphus problem, doubly linked list, polynomial manipulation using linked list, representation of sparse matrices. Stacks - their concepts and implementation, multiple stacks. Conversion of infix to postfix notation using stack, evaluation of postfix expression, recursion, how recursion- works, queues their concepts and implementation, Queue, primary queues, simulation.
Unit III Trees, Binary tree - their representation and operations, tree traversals, threaded binary trees, conversion of general trees to binary trees, binary expression tree, applications of trees. sequential searching, binary search, height balanced tree and weight balanced trees, multiway search trees, digital search, trees, hashing and collision - resolution techniques.
Unit IV Various sorting algorithms viz. bubble sort, selection sort, inserted sort, Quicksort, merge sort, address calculation sort and heap sort, complexity of the algorithm.
Unit V Graphs, terminology, representation of graphs, reachability, minimum path problem, critical events, Graph traversals, spanning trees, application of graph.
References:
1. Data structures using C: By Tannenbaum
2. Data structures: By Trembley Sorenson
3. Data structures using C: By Rajiv Jindal
Unit II Singly linked list, implementation linked list using arrays, implementation of linked list using dynamic memory allocation circular link list, Josphus problem, doubly linked list, polynomial manipulation using linked list, representation of sparse matrices. Stacks - their concepts and implementation, multiple stacks. Conversion of infix to postfix notation using stack, evaluation of postfix expression, recursion, how recursion- works, queues their concepts and implementation, Queue, primary queues, simulation.
Unit III Trees, Binary tree - their representation and operations, tree traversals, threaded binary trees, conversion of general trees to binary trees, binary expression tree, applications of trees. sequential searching, binary search, height balanced tree and weight balanced trees, multiway search trees, digital search, trees, hashing and collision - resolution techniques.
Unit IV Various sorting algorithms viz. bubble sort, selection sort, inserted sort, Quicksort, merge sort, address calculation sort and heap sort, complexity of the algorithm.
Unit V Graphs, terminology, representation of graphs, reachability, minimum path problem, critical events, Graph traversals, spanning trees, application of graph.
References:
1. Data structures using C: By Tannenbaum
2. Data structures: By Trembley Sorenson
3. Data structures using C: By Rajiv Jindal
ConversionConversion EmoticonEmoticon