Syllabus B Tech Computer Science Third Semester Data Structure CS303

Computer-Science-Engineering-3

Syllabus B Tech Computer Science Third Semester Data Structure CS303

The concepts developed in this course will aid in quantification of several concepts in Computer Science Engineering that have been introduced at the Engineering courses. Technology is being increasingly based on the latest Syllabus B Tech Computer Science Third Semester Data Structure CS303 is given here.

The objective of this course “Syllabus B Tech Computer Science Third Semester Data Structure CS303 is to develop ability and gain insight into the process of problem-solving, with emphasis on thermodynamics. Specially in following manner: Apply conservation principles (mass and energy) to evaluate the performance of simple engineering systems and cycles. Evaluate thermodynamic properties of simple homogeneous substances. Analyze processes and cycles using the second law of thermodynamics to determine maximum efficiency and performance. Discuss the physical relevance of the numerical values for the solutions to specific engineering problems and the physical relevance of the problems in general and Critically evaluate the validity of the numerical solutions for specific engineering problems. More precisely, the objectives are:

  • To enable young technocrats to acquire mathematical knowledge to understand Laplace transformation, Inverse Laplace transformation and Fourier Transform which are used in various branches of engineering.
  • To introduce effective mathematical tools for the Numerical Solutions algebraic and transcendental equations.
  • To acquaint the student with mathematical tools available in Statistics needed in various field of science and engineering.

CS 303 – Data Structure

Unit 1
Review of C programming language. Introduction to Data Structure: Concepts of Data and Information, Classification of Data structures, Abstract Data Types, Implementation aspects: Memory representation. Data structures operations and its cost estimation. Introduction to linear data structures- Arrays, Linked List: Representation of linked list in memory, different implementation of linked list. Circular linked list, doubly linked list, etc. Application of linked list: polynomial manipulation using linked list, etc.
Unit 2
Stacks: Stacks as ADT, Different implementation of stack, multiple stacks. Application of Stack: Conversion of infix to postfix notation using stack, evaluation of postfix expression, Recursion. Queues: Queues as ADT, Different implementation of queue, Circular queue, Concept of Dqueue and Priority Queue, Queue simulation, Application of queues.
Unit 3
Tree: Definitions – Height, depth, order, degree etc. Binary Search Tree – Operations, Traversal, Search. AVL Tree, Heap, Applications and comparison of various types of tree; Introduction to forest, multi-way Tree, B tree, B+ tree, B* tree and red-black tree..
Unit 4
Graphs: Introduction, Classification of graph: Directed and Undirected graphs, etc, Representation, Graph Traversal: Depth First Search (DFS), Breadth First Search (BFS), Graph algorithm: Minimum Spanning Tree (MST)- Kruskal, Prim’s algorithms. Dijkstra’s shortest path algorithm; Comparison between different graph algorithms. Application of graphs..
Unit 5
Sorting: Introduction, Sort methods like: Bubble Sort, Quick sort. Selection sort, Heap sort, Insertion sort, Shell sort, Merge sort and Radix sort; comparison of various sorting techniques. Searching: Basic Search Techniques: Sequential search, Binary search, Comparison of search methods. Hashing & Indexing. Case Study: Application of various data structures in operating system, DBMS etc..

Books Recommended

1. Aho, Hopcroft, Ullman, “Data Structures and Algorithms”, Pearson Education.
2. N. Wirth, “Algorithms + Data Structure = Programs”, Prentice Hall.
3. Jean – Paul Trembly , Paul Sorenson, “An Introduction to Structure with application”, TMH.
4. Richard, GilbergBehrouz, Forouzan ,“Data structure – A Pseudocode Approach with C”, Thomson press..