Scribd
Upload
53 views5 pages

TY DSA Syallbus

This document describes a course on Data Structures and Algorithms. The course consists of 2 hours of lectures per week over one term and covers topics like arrays, stacks, queues, linked lists, trees, graphs, sorting, and searching algorithms. Students will be assessed through term tests, teacher assessments, and an end-of-term exam. The accompanying lab course involves implementing experiments on data structures and algorithms over 2 hours per week for hands-on learning.

Uploaded by

jay
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
53 views5 pages

TY DSA Syallbus

This document describes a course on Data Structures and Algorithms. The course consists of 2 hours of lectures per week over one term and covers topics like arrays, stacks, queues, linked lists, trees, graphs, sorting, and searching algorithms. Students will be assessed through term tests, teacher assessments, and an end-of-term exam. The accompanying lab course involves implementing experiments on data structures and algorithms over 2 hours per week for hands-on learning.

Uploaded by

jay
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/ 5

Data Structures & Algorithms (PCET5060T)

Teaching Scheme Examination Scheme


Lectures: 02 Hrs./Week Term Test: 15 Marks
Credit: 02 Teacher Assessment: 20 Marks
Credit: 02 End Sem Exam: 65 Marks
Credit : 0 Total: 100 Marks

Course Objectives
1. Understand and remember algorithms and its analysis procedure.

2. Introduce the concept of data structures through ADT including List, Stack, Queues.

3. To design and implement various data structure algorithms.

4. To introduce various techniques for representation of the data in the real world.

5. To develop application using data structure algorithms.

6. Compute the complexity of various algorithms.

COs Course Outcomes Blooms Blooms De-


Level scription
CO1 Understand basic data structures such as arrays, linked lists, L2 Comprehension
stacks and queues.
CO2 Solve problem involving graphs, trees and heaps. L4 Analyze
CO3 Apply Algorithm for solving problems like sorting, searching, in- L4, L5 Analyze, Syn-
sertion and deletion of data. thesize
CO4 Determine and analyze the complexity of given Algorithms. L6 Evaluate

52
Course Contents

Unit-I Introduction to Data structures and Algorithms 06 Hrs.


Introduction to Data structures, Need of Data structures, Types of Data structures : Linear and non-
linear data structures Arrays, Stacks, Queue, Linked list and Tree, Graph, Recursion, ADT (Abstract
Data type). Introduction to Analysis, Algorithms, characteristics of an algorithms, Time and Space
complexities, Order of growth functions, Asymptotic notations.

Unit-II Stack 06 Hrs.


Introduction to Stack, Stack as ADT, Operations on stack, Application of stack: reversing string,
Polish notations.

Unit-III Queue 04 Hrs.


Introduction to Queue, Queue as ADT, Operations on Queue, Linear representation of queue, Circu-
lar Queue, Priority Queue, De-queue, Application of Queues.

Unit-IV Linked List 08 Hrs.


Introduction to Linked List, Basic concept of Linked List, Memory allocation & de allocation of Linked
list, Singly Linked list, Doubly Linked list, Circular linked list, Operations on linked list, Linked rep-
resentation of stack, Linked representation of Queue, Application of linked list.

Unit-V Sorting and Searching 08 Hrs.


Introduction to Sorting: Bubble Sort, Selection Sort, Insertion Sort, Quick Sort, Merge Sort, Heap
Sort, Shell Sort, Radix sort. Analysis of Sorting Techniques. Comparison of sorting Techniques In-
troduction to Searching: Linear search, Binary search, Hashing Techniques, Different Hash functions,
Collision & Collision resolution techniques, Analysis of searching Techniques.

Unit-VI Trees & Graph 10 Hrs.


Introduction to Trees, Definitions & Tree terminologies, Binary tree representation, Operations on
binary tree, Traversal of binary trees, Binary search tree, Threaded Binary tree, Expression tree, Ap-
plication of Trees Introduction to Graph, Introduction Graph Terminologies, Graph Representation,
Type of graphs, Graph traversal:Depth first search(DFS)& Breadth First search(BFS), Minimum
Spanning Tree : Prims & Kruskals Shortest Path Algorithm Dijkstras Algorithm. Applications of
graph.

Text Books

1. Data structures using C by Tenenbaum, Langsam, Augenstein , Pearson.

53
2. Data Structures using C, ReemaThareja, Oxford.

3. C and Data structures, Prof. P.S.Deshpande, Prof. O.G.Kakde, Dreamtech Press.

4. Introduction to Data Structure and its Applications Jean-Paul Tremblay, P. G. Sorenson

Reference Books

1. Data Structures Using C & C++, Rajesh K. Shukla, Wiley- India.

2. Data Structures and Algorithm Analysis in C ,Mark A.Weiss ,Pearson

3. ALGORITHMS Design and Analysis, Bhasin, OXFORD.

4. Computer Algorithms by Ellis Horowitz and Sartaj Sahni, Universities Press.

Evaluation Scheme:
Continuous Assessment (A):
Subject teacher will declare Teacher Assessment criteria at the start of semester.
Continuous Assessment (B):

1. Two term tests of 15 marks each will be conducted during the semester.

2. Total duration allotted for writing each of the paper is 1 hr.

3. Average of the marks scored in both the tests will be considered for final grading.

End Semester Examination (C):

1. Question paper will be based on the entire syllabus summing up to 65 marks.

2. Total duration allotted for writing the paper is 3 hrs.

54
Data Structures & Algorithms Laboratory
(PCET5060L)

Teaching Scheme Examination Scheme


Practical: 02 Hrs/Week Teacher Assessment: 25 Marks
Credit: 01 End Sem Exam : 25 Marks
Credit: 01 Total: 50 Marks

Course Objectives
1. Understand basic data structures such as arrays, linked lists, stacks and queues.

2. Solve problem involving graphs, trees and heaps.

3. Apply Algorithm for solving problems like sorting, searching, insertion and deletion of data.

4. Determine and analyze the complexity of given Algorithms.

COs Course Outcomes Blooms Blooms


Level Description
CO1 communicate the result of their work and describe an algorithm. L4, L6 Analyze,
Evaluate
CO2 Calculate the Big O of diverse non-recursive algorithms and use it L5 Synthesize
to compare efficiency.
CO3 Implement Binary Search Trees, Max/Min-Heaps, Priority L2 Understand
Queues.
CO4 Program basic sorting algorithms (such as Insertion, Selection, L2 Understand
Merge and Quick).

55
Course Contents

List of Laboratory Experiments: (Any Seven)

1. WAP to implement stack menu driven program.

2. WAP to implement Infix to Postfix Transformation and its evaluation program.

3. WAP to implement double ended queue menu driven program.

4. WAP to implement different operations on linked list copy, concatenate, split, reverse, count
no. of nodes.

5. WAP to implement construction of expression tree using postfix expression.

6. WAP to implement Quick Sort, Merge sort and Heap Sort menu driven program.

7. WAP to implement hashing functions with different collision resolution techniques.

Evaluation Scheme:
Continuous Assessment (A):
Laboratory work shall consist of minimum 8 experiments and subject specific lab assignment/case
study/mini project.
The distribution of marks shall be as follows:

1. Laboratory work (Performance in Experiments): 15 Marks

2. Subject Specific Lab Assignment/Case Study/mini project: 10 Marks

The final certification and acceptance of laboratory journal/manual/report will be subject to satis-
factory performance of laboratory work and upon fulfilling minimum passing criteria in the teacher
assessment.
End Semester Examination (C):
Oral / Practical examination will be based on the entire syllabus including, the practicals performed
during laboratory sessions.

56

You might also like

pFad - Phonifier reborn

Pfad - The Proxy pFad of © 2024 Garber Painting. All rights reserved.

Note: This service is not intended for secure transactions such as banking, social media, email, or purchasing. Use at your own risk. We assume no liability whatsoever for broken pages.


Alternative Proxies:

Alternative Proxy

pFad Proxy

pFad v3 Proxy

pFad v4 Proxy