Sathyabama Institute of Science and Technology BE CSE SCSA1203 Data Structures Syllabus
 

Sathyabama Institute of Science and Technology BE CSE SCSA1203 Data Structures Syllabus

SATHYABAMA INSTITUTE OF SCIENCE AND TECHNOLOGY SCHOOL OF COMPUTING

SCSA1203 DATA STRUCTURES
L T P Credits Total Marks
3 * 0 3 100

UNIT 1 INTRODUCTION TO ALGORITHMS 9 Hrs.
Introduction Data Structures - Need - classification - operations –Abstract data types (ADT) - Array - characteristics - types -
storage representations. Array Order Reversal-Array Counting or Histogram-Finding the maximum Number in a Set,
Recursion- Towers of Hanoi-Fibonacci series-Factorial.

UNIT 2 LINKED LISTS 9 Hrs.
Introduction - Singly linked list - Representation of a linked list in memory - Operations on a singly linked list - Merging two
singly linked lists into one list - Reversing a singly linked list - Applications of singly linked list to represent polynomial -
Advantages and disadvantages of singly linked list - Circular linked list - Doubly linked list - Circular Doubly Linked List.

UNIT 3 STACKS 9 Hrs.
Basic Stack Operations - Representation of a Stack using Arrays - Algorithm for Stack Operations - Stack Applications:
Reversing list - Factorial Calculation - Infix to postfix Transformation - Evaluating Arithmetic Expressions.

UNIT 4 QUEUES 9 Hrs.
Basic Queue Operations - Representation of a Queue using array - Applications of Queues - Round robin Algorithm -
Enqueue - Dequeue - Circular Queues - Priority Queues.

UNIT 5 SEARCHING AND SORTING TECHNIQUES 9 Hrs.
Basic concepts - List Searches using Linear Search - Binary Search - Fibonacci Search - Sorting Techniques - Insertion sort
- Heap sort - Bubble sort - Quick sort - Merge sort - Analysis of sorting techniques.
Max. 45 Hrs.

COURSE OUTCOMES
On completion of the course, student will be able to
CO1 - Understand the concept of recursive algorithms.
CO2 - Demonstrate the different types of data structures.
CO3 - Able to understand the operations on linear data structures.
CO4 - Summarize searching and sorting techniques.
CO5 - Choose appropriate data structure as applied to specified problem definition.
CO6 - Understand and implement the applications of linear data structures.

TEXT / REFERENCE BOOKS
1. Jean-Paul Tremblay, Paul G. Sorenson,’An Introduction to Data Structures with Application’,TMH, 2017.
2. Richard F, Gilberg, Forouzan, “Data Structures”, Cengage, 2004, 2nd Edition.
3. Larry R. Nyhoff, ADTs, Data Structures, and Problem Solving with C++, Prentice Hall Editin, 2004.
4. Thomas H. Cormen, Charles E. Leiserson, “Introduction to Algorithms”, 3rd Edition, 2010.

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 with internal choice, each carrying 16 marks 80 Marks