DS & AA

Data Structure & Analysis of Algorithm

Introduction:

Welcome to Course. This course teaches students how to think algorithmically & solve problems efficiently.


Expectations from Student:

Students are expected to attend the theory lectures, perform all practicals, take two class tests & make subject notes with practical file for final submission.


Learning Objectives:

  • Think more methodically.

  • Program Methodically.

  • Solve problems efficiently.

  • Decompose problems into parts & compose solutions


The syllabus for M.Sc(CS) and M.Sc(IT) is nearly 80% same.

Their are some points which are different, which we will cover in classroom.


Books: (All Books are available in College Library)

  • Introduction to Algorithms By Thomas Corman, C Leiserson, Rivest, Stein

  • Data Structures By Seymour Lipschutz


Notes & Video Lectures:

Some important Links for Reference:

  1. Data structure notes & ppts from Dr. Anirban Mukhopadhyay.

  2. Notes from CPSC 223: Data Structures & Programming Techniques By James Aspnes.

  3. Course Site: Data structures by James Aspnes

  4. Lecture Series on Data Structures and Algorithms by Dr. Naveen Garg

  5. MIT OCW Design & Analysis of Algorithm Spring 2015


Lab Manual:

Do not copy and paste the programs.

Execute all the programs.

Debug the errors if any.

Attach the output & program to submission files.

Under any circumstance the incomplete files will not be accepted.


Click to Download