Agnel Charities
Fr. C. Rodrigues Institute of Technology, Vashi, Navi-
Mumbai
Department of Computer Engineering
Data Structures
Syllabus
Module Detailed Content Hours
1 Introduction to Data Structures 2
1.1 Introduction to Data Structures, Concept of ADT, Types of Data Structures-
Linear and Nonlinear, Operations on Data Structures.
2 Stack and Queues 8
2.1 Introduction, ADT of Stack, Operations on Stack, Array Implementation of
Stack, Applications of Stack-Well form-ness of Parenthesis, Infix to Postfix
Conversion and Postfix Evaluation, Recursion.
2.2 Introduction, ADT of Queue, Operations on Queue, Array Implementation of
Queue, Types of Queue-Circular Queue, Priority Queue, Introduction of Double
Ended Queue, Applications of Queue.
3 Linked List 9
3.1 Introduction, Representation of Linked List, Linked List v/s Array, Types of
Linked List - Singly Linked List, Circular Linked List, Doubly Linked List,
Operations on Singly Linked List and Doubly Linked List, Stack and Queue
using Singly Linked List, Singly Linked List Application-Polynomial
Representation and Addition.
4 Trees 10
4.1 Introduction, Tree Terminologies, Binary Tree, Binary Tree Representation,
Types of Binary Tree, Binary Tree Traversals, Binary Search Tree, Operations
on Binary Search Tree, Applications of Binary Tree-Expression Tree, Huffman
Encoding, Search Trees-AVL, rotations in AVL Tree, operations on AVL Tree,
Introduction of B Tree, B+ Tree.
5 Graphs 4
5.1 Introduction, Graph Terminologies, Representation of Graph, Graph Traversals- Depth
First Search (DFS) and Breadth First Search (BFS), Graph Application- Topological
Sorting.
6 Searching Techniques 3
6.1 Linear Search, Binary Search, Hashing-Concept, Hash Functions, Collision resolution
Techniques
Textbooks:
1 Aaron M Tenenbaum, YedidyahLangsam, Moshe J Augenstein, “Data Structures Using C”,
Pearson Publication.
2 Reema Thareja, “Data Structures using C”, Oxford Press.
Agnel Charities
Fr. C. Rodrigues Institute of Technology, Vashi, Navi-
Mumbai
Department of Computer Engineering
Data Structures
3 Richard F. Gilberg and Behrouz A. Forouzan, “Data Structures: A Pseudocode Approach
with C”, 2ndEdition, CENGAGE Learning.
4 Jean Paul Tremblay, P. G. Sorenson, “Introduction to Data Structure and Its Applications”,
McGraw-Hill Higher Education
5 Data Structures Using C, ISRD Group, 2ndEdition, Tata McGraw-Hill.
References:
1 Prof. P. S. Deshpande, Prof. O. G. Kakde, “C and Data Structures”, DreamTech press.
2 E. Balagurusamy, “Data Structure Using C”, Tata McGraw-Hill Education India.
3 Rajesh K Shukla, “Data Structures using C and C++”, Wiley-India
4 GAV PAI, “Data Structures”, Schaum’s Outlines.
5 Robert Kruse, C. L. Tondo, Bruce Leung, “Data Structures and Program Design in C”,
Pearson Edition
Assessment: Internal Assessment:
Assessment consists of two class tests of 20 marks each. The first-class test is to be conducted
when approx. 40% syllabus is completed and second-class test when additional40% syllabus is
completed. Duration of each test shall be one hour.
End Semester Theory Examination:
1 Question paper will consist of 6 questions, each carrying 20 marks.
2 The students need to solve a total of 4 questions.
3 Question No.1 will be compulsory and based on the entire syllabus.
4 Remaining question (Q.2 to Q.6) will be selected from all the modules.
Course Objectives: The course aims:
1 To understand the need and significance of Data structures as a computer Professional.
2 To teach concept and implementation of linear and Nonlinear data structures.
3 To analyze various data structures and select the appropriate one to solve a specific real-
world problem.
4 To introduce various techniques for representation of the data in the real world.
5 To teach various searching techniques.
Course Outcomes:
CSC303.1 Students will be able to illustrate the concepts of various data structures.
Students will be able to apply the concepts of Linear data structures to perform
CSC303.2
various operations like create, search, insert, delete and traversals.
Students will be able to apply the concepts of Non-linear data structures to perform
CSC303.3
various operations like create, search, insert, delete and traversals.
CSC303.4 Students will be able to analyse and apply an appropriate Linear data structure to
Agnel Charities
Fr. C. Rodrigues Institute of Technology, Vashi, Navi-
Mumbai
Department of Computer Engineering
Data Structures
solve various problems.
Students will be able to analyse and apply an appropriate Non-linear data structure to
CSC303.5
solve diverse problems.
Students will be able to analyse and apply an appropriate searching technique for a
CSC303.6
given problem.
List of Assessment Tools
1 Assignment Test
2 Internal Assessment
3 Class Test
4 Assignment
Mapping Assessment tools to Course Outcome
COURSE
CO1 CO2 CO3 CO4 CO5 CO6
OUTCOME
TOOLS
Assignment Test-
√ √ √
1
Internal
√ √ √
Assessment-1
Assignment Test-
√ √ √
2
Internal
√ √
Assessment-2
Class Test-1 √
Assignment √ √ √ √ √ √
