Data Structures and Algorithms Syllabus PDF

DATA STRUCTURES AND ALGORITHMS 1.1 Course Description An algorithm is an outline of the steps that a program or any computational procedure has to take. A program on the other hand is an implementation of an algorithm and it could be in any programming language. Data structure is the way we need to...

DATA STRUCTURES AND ALGORITHMS 1.1 Course Description An algorithm is an outline of the steps that a program or any computational procedure has to take. A program on the other hand is an implementation of an algorithm and it could be in any programming language. Data structure is the way we need to organize the data, so that it can be used effectively by the program.In short it is a way of collecting and organizing data in such a way that we can perform operations on these data in an effective way. It is also about rendering data elements in terms of some relationship, for better organization and storage. 1.2 Learning Targets/Outcomes 1. To impart the basic concepts of data structures and algorithms. 2. To understand concepts about searching and sorting techniques 3. To understand basic concepts about stacks, queues, lists, trees and graphs. 4. To enable them to write algorithms for solving problems with the help of fundamental data structures 1.3 Course Organization There will be 3-hours lecture and 2 hours Laboratory session each week. Students are expected to attend all lectures,practicals and to participate in class actively. 2. Books: 1. Algorithms, Data Structures, and Problem Solving with C++”, Illustrated Edition by Mark Allen Weiss, Addison-Wesley Publishing Company 2. “How to Solve it by Computer”, 2nd Impression by R.G. Dromey, Pearson Education. 3. “Fundamentals of Data Structures”, Illustrated Edition by Ellis Horowitz, SartajSahni, Computer Science Press. 3. Teaching Schedule 3.1 INTRODUCTION TO DATA STRUCTURE Basic Terminology, Internal representation of Primitive Data structure: Integers, Floating point numbers,Decimal, Characters, Unions,Structures and Pointers. 3.2 DATA TYPES Arrays Definition, Memory organization, Various Operations on Arrays: Insertion, Deletion, Traversing ,Updating, Resizing 99 3.3 Stacks Basic operations, Stack, Dstack and its applications 3.4 Queues Operations of queues, Circular Queue, Priority Queue, Dequeue, Applications of queues data structure. 3.5Linked list Singly linked lists and its memory representation, Operations of Link list (Searching, Insertion, Deletion, Traversing, inversion, concatenation, copying and comparison, allocation and deallocation), Doubly linked list and its operations, Circular Link list and Multilevel link list 3.6 TREES Introduction, Binary Trees and their representation, Operations on Binary trees: Creation, transformation of trees into binary trees, traversal, Searching, Insertion and Deletion. Type of trees: Complete Binary trees, Extended binary trees, General trees, AVL trees, Threaded trees, B trees Application: Arithmetic expression evaluation, infix-prefix-postfix notation conversion. 3.7 GRAPH Formal Introduction, types of graph, Representation of graphs: Sequential, List structure, Adjacency list, multilinked representation, Search in directed and undirected graphs, BFS, DFS, Transversal Connected Component and Spanning trees, Shortest path and Transitive Closure, Activity Networks, Topological Sort and Critical Paths. 3.8 ALGORITHMS Sorting (Bubble, Selection, Quick, Radix, Bucket sort, Heap sort), Dictionaries, hashing, analysis of collision resolution techniques, Searching-Linear & Binary, Character String and different string operations. 4.Plagiarism This course has a one mid semester internal examination and one semester end examination. The continuous evaluation process will be conducted for practical, assignments. The examination and evaluation component has been described below. 100 CS703:SIMULATION Credits:0+2 This course will include introduction and application of some simulation tools like NS-2/NS-3 etc 101