Scribd
Upload
38 views2 pages

DS Theory Syllabus

Mumbai University Data Structures Theory Syllabus

Uploaded by

Manas Parab
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
38 views2 pages

DS Theory Syllabus

Mumbai University Data Structures Theory Syllabus

Uploaded by

Manas Parab
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 2

Course Code Course Name Credit

CSC303 Data Structure 03

Pre-requisite: C Programming

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:
1 Students will be able to implement Linear and Non-Linear data structures.
2 Students will be able to handle various operations like searching, insertion, deletion and
traversals on various data structures.
3 Students will be able to explain various data structures, related terminologies and its types.
4 Students will be able to choose appropriate data structure and apply it to solve problems in
various domains.
5 Students will be able to analyze and Implement appropriate searching techniques for a given
problem.
6 Students will be able to demonstrate the ability to analyze, design, apply and use data
structures to solve engineering problems and evaluate their solutions.

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 10
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 11
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 4
6.1 Linear Search, Binary Search, Hashing-Concept, Hash Functions, Collision
resolution Techniques

Textbooks:
1 Aaron M Tenenbaum, Yedidyah Langsam, Moshe J Augenstein, “Data Structures Using C”,
Pearson Publication.
2 Reema Thareja, “Data Structures using C”, Oxford Press.
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.

Useful Links
1 https://nptel.ac.in/courses/106/102/106102064/
2 https://www.coursera.org/specializations/data-structures-algorithms
3 https://www.edx.org/course/data-structures-fundamentals
4 https://swayam.gov.in/nd1_noc19_cs67/preview

You might also like