Programming and Data Structures I Detailed Syllabus for B.Tech second sem is covered here. This gives the details about credits, number of hours and other details along with reference books for the course.
The detailed syllabus for Programming and Data Structures I B.Tech 2016-2017 (R13) secondsem is as follows
OBJECTIVES: The student should be made to:
- Be familiar with the basics of C programming language.
- Be exposed to the concepts of ADTs
- Learn linear data structures – list, stack, and queue.
- Be exposed to sorting, searching, hashing algorithms
UNIT I C PROGRAMMING FUNDAMENTALS- A REVIEW (9 hours)
Conditional statements – Control statements – Functions – Arrays – Preprocessor – Pointers – Variation in pointer declarations – Function Pointers – Function with Variable number of arguments
UNIT II C PROGRAMMING ADVANCED FEATURES (9 hours)
Structures and Unions – File handling concepts – File read – write – binary and Stdio – File Manipulations
UNIT III LINEAR DATA STRUCTURES – LIST (9 hours)
Abstract Data Types (ADTs) – List ADT – array-based implementation – linked list implementation –– singly linked lists- circularly linked lists- doubly-linked lists – applications of lists –Polynomial Manipulation – All operation (Insertion, Deletion, Merge, Traversal)
Download iStudy Android App for complete Anna University syllabus, results, timetables and all other updates. There are no ads and no pdfs and will make your life way easier.
TOTAL: 45 PERIODS
OUTCOMES: At the end of the course, the student should be able to:
- Use the control structures of C appropriately for problems.
- Implement abstract data types for linear data structures.
- Apply the different linear data structures to problem solutions.
- Critically analyse the various algorithms.
TEXT BOOKS:
- Brian W. Kernighan and Dennis M. Ritchie, “The C Programming Language”, 2nd Edition, Pearson Education, 1988.
- Mark Allen Weiss, “Data Structures and Algorithm Analysis in C”, 2nd Edition, Pearson Education, 1997.
REFERENCES:
- Thomas H. Cormen, Charles E. Leiserson, Ronald L.Rivest, Clifford Stein, “Introduction to Algorithms”, Second Edition, Mcgraw Hill, 2002.
- Reema Thareja, “Data Structures Using C”, Oxford University Press, 2011
- Aho, Hopcroft and Ullman, “Data Structures and Algorithms”, Pearson Education,1983.
- Stephen G. Kochan, “Programming in C”, 3rd edition, Pearson Ed.,
For all other B.Tech IT 2nd sem syllabus go to Anna University B.Tech Information Technology (IT) 2nd Sem Course Structure for (R13) Batch. All details and yearly new syllabus will be updated here time to time. Subscribe, like us on facebook and follow us on google plus for all updates.
Do share with friends and in case of questions please feel free drop a comment.