CS-303 Data Structures

RGPV · B.Tech · CSE · Semester 3 · Current scheme · 13 papers (2020 to 2025)

Unit 1: Introduction to data structures, arrays and linked listsData Structures notes · PDF · 379 KB View Download
Unit 2: Stacks and queuesData Structures notes · PDF · 447 KB View Download
Unit 3: TreesData Structures notes · PDF · 338 KB View Download
Unit 4: GraphsData Structures notes · PDF · 369 KB View Download
Unit 5: Sorting, searching and hashingData Structures notes · PDF · 310 KB View Download

Data Structures syllabus: unit-wise topics

5 units Official RGPV syllabus

  1. Unit 1: Introduction to Data Structure

    Review of C programming language. 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.

  2. 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.

  3. 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.

  4. 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.

  5. 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.

Source: RGPV scheme and syllabus, B.Tech Computer Science and Engineering, Semester 3 (AICTE flexible curriculum, batches admitted July 2020 (w.e.f. July 2021)). Official syllabus PDF

Frequently asked questions

Are these Data Structures notes free to download?

Yes. Every Data Structures notes PDF on Paperwala is free, with no sign-up and no payment. Files open in Google Drive, so you can read online or save them for offline study.

Unit-wise Data Structures (CS-303) notes for RGPV B.Tech CSE semester 3, free to view online or download as PDF. Data Structures is also searched for as CO-303.

Also known as CO-303