[go: up one dir, main page]
Scribd
Upload
7 views2 pages

dsa

The Data Structures course (CAS-107) for undergraduate students focuses on fundamental data structures like arrays, linked lists, trees, and graphs, along with relevant algorithms for efficient problem-solving. Prerequisites include a solid understanding of programming in languages such as C, C++, Java, or Python. The course includes theoretical units, practical lab sessions, and aims to equip students with skills in implementing and analyzing various data structures and algorithms.

Uploaded by

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

dsa

The Data Structures course (CAS-107) for undergraduate students focuses on fundamental data structures like arrays, linked lists, trees, and graphs, along with relevant algorithms for efficient problem-solving. Prerequisites include a solid understanding of programming in languages such as C, C++, Java, or Python. The course includes theoretical units, practical lab sessions, and aims to equip students with skills in implementing and analyzing various data structures and algorithms.

Uploaded by

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

Course Title: Data Structures (CAS-107)

Course Level: UG (BSc AGD) L T P/S SW/FW TOTAL


CREDIT
Course Objectives: The course aims to provide
UNITS
students with a comprehensive understanding of
3 0 4 0 5
fundamental data structures such as arrays,
linked lists, trees, and graphs, along with algorithms for their manipulation, to enable
efficient problem-solving and algorithmic analysis in various computational scenarios.

Prerequisites: solid understanding of programming fundamentals in a language such as C,


C++, Java, or Python

Course Contents/syllabus:
Teachin
g Hours
Unit I: Linear Data Structures 12 H
Introduction to data structures, Arrays and operations, Stack and its operations-
push, pop. Queue and operations: enqueue, dequeue. Applications.
Implementation of recursive procedures by stack. Infix to postfix conversions,
Evaluation of postfix expression.

Unit II: Searching and sorting 11 H


Searching - sequential searching, binary searching, Sorting techniques: bubble
sort, selection sort, insertion sort, quick sort, merge sort.

Unit III: Linked Lists 11 H


Linked lists, doubly linked list, Circular linked list, operations on linked lists:
create, insert, display, delete, traverse.

Unit IV: Trees and Graphs 11 H


Tree terminologies, Binary tree, Tree Transversals (pre-order, post-order and
in-order), Operations: Search, Insert, Delete. Binary search tree.
Graph terminology, Sequential representation: Adjacency matrix, traversing a
Graphs, Breadth first search, Depth first search

Lab/ Practical details:

List of Experiments -with basic instructions (Total: 60 Hours)

Objective: The aim of this section of Lab is to teach experiments of data structures pertaining to the
units being taught in the theory paper specifically related to arrays, stacks, queues, trees and graphs.

1. To implement insert, delete, create and other operations on arrays.


2. To implement push and pop on stacks.
3. To implement enqueue and dequeue in queues.
4. To implement different operations related to linear and circular queues
5. To implement TOH and Fibonacci Series using Recursion
6. To implement sorting techniques: bubble, insertion, selection, quick, merge sort.
7. To implement operations related to linked list: singly and doubly.
8. WAP to create a binary tree.
9. WAP for in order, preorder and post order traversal in binary tree.
10. Implementation of creation of graphs.
11. Implementation of Graphs: Graph traversals.

Course Learning Outcomes:


1. To understand and apply linear data structures like arrays, stacks, queues along
with their applications.
2. To implement various searching and sorting techniques.
3. To analyze and apply concept of linked structures in the form of linked lists and
its types.
4. To choose and apply nonlinear data structures like trees and graphs.

Text / Reference Books:


AUTHOR TITLE Publisher Year of ISBN
publication
Seymour Data Structures With C Tata 2017 978-0070701984
Lipschutz - by Schaum series McGraw
Hill

Robert Kruse, Data structures and Pearson 2006 8177584235


C.L. Tondo, Program Design in C India
Bruce Leung
Pearson.

Yedidyah Data Structure Using C Pearson 2006 8131703282


Langsam, Moshe & C++, Tannenbaum,
J. Augenstein, PHI
Aaron M.
Tenenbaum

2017 0074624717
Tremblay & An Introduction to McGraw
Sorenson Data Structures with Hill
Application Education

You might also like