Sathyabama Institute of Science and Technology B.E. - Electronics and Instrumentation Engineering SCSA1206 C and Data Structures Syllabus
 

Sathyabama Institute of Science and Technology B.E. - Electronics and Instrumentation Engineering SCSA1206 C and Data Structures Syllabus


SATHYABAMA INSTITUTE OF SCIENCE AND TECHNOLOGY

SCSA1206 C AND DATA STRUCTURES

UNIT 1 INTRODUCTION C PROGRAMMING 9 Hrs.
Fundamentals in C –Data types-Operators and Expressions-Input Output Library Functions-Conditional Control Statements-
Loop Control Statements-Unconditional Control Statements-Storage Classes-Arrays-Strings.

UNIT 2 FUNCTIONS, POINTERS AND STRUCTURES 9 Hrs.
Functions-Prototype-Definition-Call-Recursive function-Tail Recursion-Pointers-Pointer types-Structures-Pointers to
Structures-Array of structures-Arrays within structure-Structure and functions-Unions-Structure vs Union.

UNIT 3 SEARCHING AND SORTING TECHNIQUES 9 Hrs.
Searching - Linear Search - Binary Search.
Sorting - Bubble Sort – Insertion Sort - Selection Sort – Heap Sort – Shell sort – Quick Sort - Merge Sort.

UNIT 4 LINEAR DATA STRUCTURES 9 Hrs.
Abstract Data Types (ADTs) – List ADT – Array-based implementation – linked list implementation ––
Singly linked lists. Stack – Operations and Applications. Queue – Operations and Applications.

UNIT 5 NON LINEAR DATA STRUCTURES 9 Hrs.
Tree ADT – tree traversals - Binary Tree ADT – expression trees – applications of trees – binary search tree ADT Graph -
Definition – Representation of Graph – Types of graph - Breadth-first traversal - Depth-first traversal – Topological Sort.
Max. 45 Hrs.

TEXT / REFERENCE BOOKS
1. B.W.Kernighan and D.M.Ritchie, "The C Programming Language", (2nd edition.) Prentice Hall, New Jersy.
2. E.Balagurusamy, "Programming in ANSI C", Seventh Edit ion, McGraw Hill Education India Private Limited, 2017.
3. Yashavant Kanetkar, "Let us C", BPB Publications; 16th edition (January 2017).
4. Thomas H. Cormen, Charles E. Leiserson, Ronald L.Rivest, Clifford Stein, ―Introduction to Algorithms", Second
Edition, Mcgraw Hill, 2002.
5. Aho, Hopcroft and Ullman, ―Data Structures and Algorithms, Pearson Education.
6. Stephen G. Kochan, ―Programming in C , 3rd edition, Pearson Education.
7. Ellis Horowitz, Sartaj Sahni, Susan Anderson-Freed, ―Fundamentals of Data Structures in C , Second Edition,
University Press, 2008.

COURSE OUTCOMES
On completion of the course, student will be able to
CO1 - Approachthe programming tasks using techniques learned and write pseudo-code.
CO2 - Choosethe right data representation formats based on the requirements of the problem.
CO3 - Identify tasks in which the numerical techniques learned are applicable and apply them to write programs, and
hence use computers effectively to solve any given task.
CO4 - Implement abstract data types for linear data structures.
CO5 - Apply the different linear and non-linear data structures to problem solutions.
CO6 - Critically analyze the various searching and sorting algorithms.


END SEMESTER EXAMINATION QUESTION PAPER PATTERN
Max. Marks: 100 Exam Duration: 3 Hrs.
PART A: 10 Questions of 2 marks each-No choice 20 Marks
PART B: 2 Questions from each unit of internal choice, each carrying 16 marks 80 Marks