Scribd
Upload
200 views

Data Structure and Algorithms

This document provides an overview of a course on data structures and algorithms. The course aims to help students utilize biological data from online databases to understand genetic diseases. It covers a range of data structures like arrays, lists, stacks, queues, and trees. It also covers searching, sorting, and graph algorithms like Dijkstra's algorithm. The course is assessed through homework, quizzes, class tests, and an end-term exam. References include textbooks on data structures, algorithms, database design, and the C++ implementation of data structures.

Uploaded by

Piyush Kalra
Copyright
© Attribution Non-Commercial (BY-NC)
Available Formats
Download as PDF, TXT or read online on Scribd
200 views

Data Structure and Algorithms

This document provides an overview of a course on data structures and algorithms. The course aims to help students utilize biological data from online databases to understand genetic diseases. It covers a range of data structures like arrays, lists, stacks, queues, and trees. It also covers searching, sorting, and graph algorithms like Dijkstra's algorithm. The course is assessed through homework, quizzes, class tests, and an end-term exam. References include textbooks on data structures, algorithms, database design, and the C++ implementation of data structures.

Uploaded by

Piyush Kalra
Copyright
© Attribution Non-Commercial (BY-NC)
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 2

DATA STRUCTURE AND ALGORITHMS

Course Code: IMTBT 20405

Course Objective:
It helps the students to utilize the information acquired through electronic media to access biological
information network and data bases in order to understand biological functions and then to evaluate genetic
diseases, their causes and risks related to human kind.

Course Contents:

Module I: Introduction

Module II: Programming strategies


Objects and ADTs with example, Constructors and destructors, Data structure, methods, Pre and post
conditions, C conventions, Error handling, Some programming language notes.

Module III: Data structures


Arrays; lists; stacks and stack frames; Recursion -Recursive functions with example of factorial.

Module IV: Searching


Sequential and binary search, Trees.

Module V: Complexity
Complexity (PS)

Module VI: Queues


Priority queues and heaps

Module VII: Sorting


Bubble, Heap, Quick, Bin, Radix

Module VIII: Searching revisited


Red-Black trees, AVL trees, general n-ary trees, hash tables;

Module IX: Dynamic algorithm


Fibonacci numbers, bionomial coefficients, optimal binary search trees, matrix chain multiplication, longest
common subsequence, optimal triangulation.

Module X: Graphs
Minimum spanning tree and Djkstra’s algorithm

Module XI: Huffman encoding, FFT, Hard or intractable problems


Eulerian or Hamiltonian paths, Travelling salesman problem.

Examination Scheme:

Component Codes H/Q S CT2 EE


Weight age (%) 10 10 20 60

Text & References:

• Data Structures and Algorithms, A.V. Aho, J.E. Hopcroft and J. Ullman, Addison-Wesley Publishing
• Database Design, Development and Deployment with Student CD, P. Rob and E. Semaan, McGraw-
Hill/Irwin
• Database system concepts, A. Silberschatz, P.B. Galvin and G. Gagne, John Wiley and Sons Inc.
• Introduction to Data Structures and Application, J. Tremblay and P.G. Sorensen, McGraw Hill College
Division
• Schaum’s Outline of Data Structures with C++ , J.R. Hubbard, McGraw Hill Trade.

You might also like