Fundamentals of Data Structures in C detail syllabus for Electronics & Communication Engineering (E&Tc), 2017 regulation is taken from Anna University official website and presented for students of Anna University. The details of the course are: course code (EC8393), Category (ES), Contact Periods/week (3), Teaching hours/week (3), Practical Hours/week (0). The total course credits are given in combined syllabus.
For all other e&tc 3rd sem syllabus for be 2017 regulation anna univ you can visit E&TC 3rd Sem syllabus for BE 2017 regulation Anna Univ Subjects. The detail syllabus for fundamentals of data structures in c is as follows.”
Course Objective:
- To learn the features of C
- To learn the linear and non-linear data structures
- To explore the applications of linear and non-linear data structures
- To learn to represent data using graph data structure
- To learn the basic sorting and searching algorithms
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
Functions, Pointers, Structures and Unions
Functions – Pass by value – Pass by reference – Recursion – Pointers – Definition – Initialization -Pointers arithmetic . Structures and unions – definition – Structure within a structure – Union -Programs using structures and Unions – Storage classes, Pre-processor directives.
Unit III
Linear Data Structures
Arrays and its representations – Stacks and Queues – Linked lists – Linked list based implementation of Stacks and Queues – Evaluation of Expressions – Linked list based polynomial addition.
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 and Sorting Algorithms
Linear Search – Binary Search. Bubble Sort, Insertion sort – Merge sort – Quick sort – Hash tables
– Overflow handling.
Course Outcome:
Upon completion of the course, students will be able to:
- Implement linear and non-linear data structure operations using C
- Suggest appropriate linear / non-linear data structure for any given data set.
- Apply hashing concepts for a given problem
- Modify or suggest new data structure for an application
- Appropriately choose the sorting algorithm for an application
Text Books:
- Pradip Dey and Manas Ghosh, Programming in C, Second Edition, Oxford University Press, 2011.
- Ellis Horowitz, Sartaj Sahni, Susan Anderson-Freed, Fundamentals of Data Structures in C, Second Edition, University Press, 2008.
References:
- Mark Allen Weiss, Data Structures and Algorithm Analysis in C, Second Edition, Pearson Education, 1996
- Alfred V. Aho, John E. Hopcroft and Jeffrey D. Ullman, Data Structures and Algorithms, Pearson Education, 1983.
- Robert Kruse, C.L.Tondo, Bruce Leung, Shashi Mogalla , Data Structures and Program Design in C, Second Edition, Pearson Education, 2007
- Jean-Paul Tremblay and Paul G. Sorenson, An Introduction to Data Structures with Applications, Second Edition, Tata McGraw-Hill, 1991.
For detail syllabus of all other subjects of BE E&Tc, 2017 regulation do visit E&Tc 3rd Sem syllabus for 2017 Regulation.
Dont forget to download iStudy for latest syllabus and results, class timetable and more.