Data Structures

Data Structures course is offered by RTS Computer Education. RTS Computer Education is the ISO 9001:2015 certified and approved center for Computer Training Courses in Guwahati with two centers at Chandmari and Adabari.

Course Syllabus:

• Concept of Data Types, elementary structure, words and their interpretations, packed words  Arrays:  Types, memory representation, address translation functions for one & two dimensional arrays, different examples. 
• Linked Structure:  Singly and doubly linked list, circular and non circular, list manipulation with pointers, example involving insertion and deletion of elements and their comparative studies with implementations using array structure  Stacks and Queues  Definitions, representation using array and linked list structure, application of stack and queues in simulation, postfix conversion and evolution of arithmetic expressions 
• Binary Trees:  Definition, quantitative properties, memory representation, Trees traversal algorithms (recursive and non-recursive), threaded trees, BFS, DFS 
• Searching  Linear and binary search algorithms, performance and complexity, binary search trees (construction, insertion, deletion and search), Concept of optimal binary search trees. 
• Sorting:  Terminology, performance evaluation, sorting algorithms (non recursive, recursive description, Complexity, advantages and disadvantage, implementation)  Bubble sort, insertion sort, selection sort, Tree sort, heap sort, quick sort, merge sort & radix sort. External Sorting. 
• Analysis of Algorithm  Time and Space complexity of algorithms, average case and worst case analysis, asymptotic notation as a measure of algorithm complexity, O and notations. Analysis of sorting algorithms- Selection sort, Bubble sort, Insertion sort, Heap sort, Quick sort and analysis of searching algorithms  linear search and binary search