Scribd
Upload
87 views3 pages

Adsa Ka Syllabus

This document outlines the teaching scheme, examination scheme, course objectives, course outcomes, detailed syllabus, textbooks, and assessment for the Advanced Data Structure and Analysis course. The course is for 3 credits over theory only, with internal assessment tests accounting for 20% and an end semester exam for 80% of the total marks. The course aims to teach advanced data structures, algorithm design approaches, dynamic programming, pattern matching, and advanced algorithms. On completing the course, students will be able to analyze algorithms, choose appropriate data structures, apply algorithm design approaches, use dynamic programming, and understand optimization and approximation algorithms.

Uploaded by

Hacker Ranjan
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
87 views3 pages

Adsa Ka Syllabus

This document outlines the teaching scheme, examination scheme, course objectives, course outcomes, detailed syllabus, textbooks, and assessment for the Advanced Data Structure and Analysis course. The course is for 3 credits over theory only, with internal assessment tests accounting for 20% and an end semester exam for 80% of the total marks. The course aims to teach advanced data structures, algorithm design approaches, dynamic programming, pattern matching, and advanced algorithms. On completing the course, students will be able to analyze algorithms, choose appropriate data structures, apply algorithm design approaches, use dynamic programming, and understand optimization and approximation algorithms.

Uploaded by

Hacker Ranjan
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/ 3

Teaching

Scheme
Course Credits Assigned
Course Name (Contact Hours)
Code
Theory Practical Theory Practical Total
Advanced Data
ITDO5014 structure and 03 -- 03 -- 03
Analysis

Examination Scheme
Theory

Course Term Pract /


Course Name End Exam Total
Code Work Oral
Internal Assessment Sem Duration
Exam (in Hrs)

Test1 Test 2 Avg.


Advanced Data
ITDO5014 structure and 20 20 20 80 3 -- -- 100
Analysis

Course Objectives:

Sr. Course Objectives


No.
The course aims:
1 To learn mathematical background for analysis of algorithm
2 To learn various advanced data structures.
3 To understand the different design approaches of algorithm.
4 To learn dynamic programming methods.
5 To understand the concept of pattern matching
6 To learn advanced algorithms.

Course Outcomes:

Sr. Course Outcomes Cognitive levels of


No. attainment as per
Bloom’s Taxonomy
On successful completion, of course, learner/student will be able to:
1 Understand the different methods for analysis of algorithms. L1,L2
2 Choose an appropriate advanced data structure to solve a specific problem. L1,L2
3 Apply an appropriate algorithmic design approach for a given problem. L1,L2,L3
4 Apply the dynamic programming technique to solve a given problem. L1,L2,L3
5 Select an appropriate pattern matching algorithm for a given application. L1,L2,L3
6 Understand the concepts of Optimization, Approximation and Parallel L1,L2
computing algorithms.

Prerequisite: Data structures and Analysis, Knowledge of Any Programming Language


DETAILED SYLLABUS:

Sr. CO
Module Detailed Content Hours
No Mapping
Basic of Data structures and analysis and programming
0 Prerequisite 02 -
language.
Fundamentals of the analysis of algorithms: Time and
Space complexity, Asymptotic analysis and notation,
average and worst-case analysis, Recurrences: The
substitution method, Recursive tree method, Masters
I Introduction method. 04 CO1

Self-learning Topics: Analysis of Time and space


complexity of iterative and recursive algorithms

B/B+ tree, Red-Black Trees, Heap operations,


Implementation of priority queue using heap,
Topological Sort.
Advanced Data
II 05 CO2
Structures
Self-learning Topics: Implementation of Red-Black
Tree and Heaps.

Introduction to Divide and conquer, Analysis of Binary


Search, Merge sort and Quick sort, Finding minimum
and maximum algorithm.

Introduction to Greedy Algorithms: Knapsack Problem,


Divide and
Job sequencing using deadlines, Optimal storage on
Conquer AND
III tape, Optimal Merge Pattern, Analysis of all these 08 CO3
Greedy
algorithms and problem solving.
algorithms
Self-learning Topics: Implementation of minimum and
maximum algorithm, Knapsack problem, Job
sequencing using deadlines.

Introduction to Dynamic Algorithms, all pair shortest


path, 0/1 knapsack, travelling salesman problem, Matrix
Chain Multiplication, Optimal binary search tree,
Dynamic Analysis of All algorithms and problem solving.
IV 06 CO4
algorithms
Self-learning Topics: Implementation of All pair
shortest path, 0/1 Knapsack and OBST.

Introduction, the naïve string matching algorithm,


Rabin Karp algorithm, Boyer Moore algorithm, Knuth-
Morris-Pratt algorithm, Longest Common Subsequence
(LCS), Analysis of All algorithms and problem
String solving.
V 07 CO5
Matching
Self-learning Topics: Implementation of Robin Karp
algorithm, KMP algorithm and LCS.
Optimization Algorithms: Genetic algorithm(GA),

Approximation Algorithms: Vertex-cover problem,

Advanced Parallel Computing Algorithms: Fast Fourier


Algorithms Transform,
VI 07 CO6
and NP
problems Introduction to NP-Hard and NP-Complete
Problems

Self-learning Topics: Implementation of Genetic


algorithm and Vertex-cover problem

Textbooks:

1 Introduction to Algorithms, Cormen, Leiserson, Rivest, Stein, PHI.


2 Algorithms: Design and Analysis, Harsh Bhasin, OXFORD.
3 Fundamentals of Computer Algorithms, Horowitz, Sahani, Rajsekaran, Universities Press.
4 C and Data structures, Deshpande, Kakde, Dreamtech Press.

References:

1 Data Structures and Algorithms in C++, Goodritch, Tamassia, Mount, WILEY.


2 Data Structures using C, Reema Thareja , OXFORD.
3 Data Structures and Algorithm Analysis in C, Mark A. Weiss, Pearson.
4 Optimization Algorithms and Applications, By Rajesh Kumar Arora by Chapman and Hall

Online Resources

Sr.No Website Links


1 https://nptel.ac.in/courses/106/106/106106131/
2 https://swayam.gov.in/nd1_noc19_cs47/preview
3 https://www.coursera.org/specializations/algorithms
4 https://www.mooc-list.com/tags/algorithms

Assessment:
Internal Assessment (IA) for 20 marks:
 IA will consist of Two Compulsory Internal Assessment Tests. Approximately 40% to
50% of syllabus content must be covered in First IA Test and remaining 40% to 50% of
syllabus content must be covered in Second IA Test

 Question paper format

 Question Paper will comprise of a total of six questions each carrying 20 marks Q.1
will be compulsory and should cover maximum contents of the syllabus

 Remaining questions will be mixed in nature (part (a) and part (b) of each question
must be from different modules. For example, if Q.2 has part (a) from Module 3 then
part (b) must be from any other Module randomly selected from all the modules)

 A total of four questions need to be answered.

You might also like