Skip to content

Study Materials for Data Structures Course offered for Semester 3, AI & DS Students

Notifications You must be signed in to change notification settings

LifnaJos/Data_Structures-Theory-Lab-NADPC32

Folders and files

NameName
Last commit message
Last commit date

Latest commit

 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 

Repository files navigation

Course : Data Structures Theory & Lab (NADPC32)

Evaluation Scheme

No Rubrics Marks Document / Schedule
1 End Semester Exam 60 Marks
2 Internal Assessment 20 Marks DS-MT-QP-2024, DS-MT-QP-Sol-2024
3 Continuous Assessment 20 Marks
a. MCQ 10 Marks 10th Oct 2024 MCQ with Solution
b. Mini-Project 10 Marks Mini Project Report Format
c. Programming Test on HackerRank 10 Marks 19th Sept 2024
Total Marks 100 Marks

Note :

Continuous Assessment best out 2 of 3 will be considered

Module - 1 : Introduction

Introduction to Data Structures, Concept of ADT, Types of Data Structures- Linear and Nonlinear, Operations on Data Structures.

Module - 2: Stacks & Queues

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. 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.

Module - 3 : Linked List

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.

Module - 4 : Trees

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.

Module - 5 : Types of Tree

Module - 6 : Sorting & Searching

Online Resources

  1. https://cse01-iiith.vlabs.ac.in/List%20of%20experiments.html
  2. https://ds1-iiith.vlabs.ac.in/List%20of%20experiments.html
  3. https://nptel.ac.in/courses/106/102/106102064/
  4. https://www.coursera.org/specializations/data- structures-algorithms
  5. https://www.edx.org/course/data-structures-fundamentals
  6. https://cse01-iiith.vlabs.ac.in/List%20of%20experiments.html
  7. https://www.gyata.ai/data-structure/articles/
  8. https://www.geeksforgeeks.org/real-time-application-of-data-structures/

Text Books :

  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”, 2 Edition, 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, 2 Edition, Tata McGraw-Hill.

Refernces :

  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

Acknowledgemnts

  • This material was prepared as a part of Course - Data Structures offered by the University of Mumbai to the Second Year Students of Artifical Intelligence & Data Science Engineering Branch during the Academic Year 2024-25

About

Study Materials for Data Structures Course offered for Semester 3, AI & DS Students

Resources

Stars

Watchers

Forks

Releases

No releases published

Packages

No packages published

Languages