Data Structures detail syllabus for Computer & Communication Engineering (C&C), 2017 regulation is taken from Anna University official website and presented for students of Anna University. The details of the course are: course code (CS8391), Category (PC), Contact Periods/week (3), Teaching hours/week (3), Practical Hours/week (0). The total course credits are given in combined syllabus.
For all other c&c 3rd sem syllabus for be 2017 regulation anna univ you can visit C&C 3rd Sem syllabus for BE 2017 regulation Anna Univ Subjects. The detail syllabus for data structures is as follows.”
Course Objective:
- To understand the concepts of ADTs
- To Learn linear data structures – lists, stacks, and queues
- To understand sorting, searching and hashing algorithms
- To apply Tree and Graph structures
Unit I
For complete syllabus and results, class timetable and more pls download iStudy. Its a light weight, easy to use, no images, no pdfs platform to make students life easier.
Unit II
Linear Data Structures – Stacks, Queues
Stack ADT – Operations – Applications – Evaluating arithmetic expressions- Conversion of Infix to postfix expression – Queue ADT – Operations – Circular Queue – Priority Queue – deQueue -applications of queues.
Unit III
Non Linear Data Structures – Trees
Tree ADT – tree traversals – Binary Tree ADT – expression trees – applications of trees – binary search tree ADT -Threaded Binary Trees- AVL Trees – B-Tree – B+ Tree – Heap – Applications of heap.
Unit IV
For complete syllabus and results, class timetable and more pls download iStudy. Its a light weight, easy to use, no images, no pdfs platform to make students life easier.
Unit V
Searching, Sorting and Hashing Techniques
Searching- Linear Search – Binary Search. Sorting – Bubble sort – Selection sort – Insertion sort – Shell sort – Radix sort. Hashing- Hash Functions – Separate Chaining – Open Addressing – Rehashing -Extendible Hashing.
Course Outcome:
At the end of the course, the student should be able to:
- Implement abstract data types for linear data structures.
- Apply the different linear and non-linear data structures to problem solutions.
- Critically analyze the various sorting algorithms.
Text Books:
- Mark Allen Weiss, Data Structures and Algorithm Analysis in C, 2nd Edition, Pearson Education,1997.
- Reema Thareja, Data Structures Using C, Second Edition , Oxford University Press, 2011
References:
- Thomas H. Cormen, Charles E. Leiserson, Ronald L.Rivest, Clifford Stein, Introduction to Algorithms”, Second Edition, Mcgraw Hill, 2002.
- Aho, Hopcroft and Ullman, Data Structures and Algorithms, Pearson Education,1983.
- Stephen G. Kochan, Programming in C, 3rd edition, Pearson Education.
- Ellis Horowitz, Sartaj Sahni, Susan Anderson-Freed, Fundamentals of Data Structures in C, Second Edition, University Press, 2008
For detail syllabus of all other subjects of BE C&C, 2017 regulation do visit C&C 3rd Sem syllabus for 2017 Regulation.
Dont forget to download iStudy for latest syllabus and results, class timetable and more.