Skip to content
CampusPrep

CS-303 RGPV B.Tech

Data Structure (DS)

Previous year papers and the official syllabus are free to read, no account needed.

Previous Year Papers

6 papers, latest Dec 2025

Free
See all 6 papers

Syllabus, notes and important questions for CS-303

Syllabus units

Topics as the official RGPV syllabus lists them.

Unit 1 Review of C and Introduction to Data Structures 10 topics
  • Review of C programming language
  • Concepts of data and information
  • Classification of data structures
  • Abstract Data Types (ADTs)
  • Memory representation of data structures
  • Operations on data structures and cost estimation
  • Linear data structures: arrays
  • Linear data structures: linked lists – singly, circular, doubly linked
  • Representation of linked list in memory
  • Applications of linked lists (e.g., polynomial manipulation)
Unit 1 notes
Unit 2 Stacks and Queues 7 topics
  • Stacks as Abstract Data Types
  • Implementations of stacks (array, linked list, multiple stacks)
  • Applications of stacks: infix‑to‑postfix conversion, postfix evaluation, recursion
  • Queues as Abstract Data Types
  • Implementations of queues (array, linked list, circular queue)
  • Dequeue and priority queue concepts
  • Queue simulation and practical applications
Unit 2 notes
Unit 3 Tree Data Structures 8 topics
  • Tree definitions – height, depth, order, degree
  • Binary Search Tree: operations, traversal, search
  • AVL trees
  • Heaps
  • Forests and multi‑way trees
  • B‑tree, B⁺‑tree, B*‑tree
  • Red‑black trees
  • Comparative analysis of various tree types
Unit 3 notes
Unit 4 Graphs 7 topics
  • Graph fundamentals and classification (directed, undirected)
  • Graph representation techniques (adjacency matrix, adjacency list)
  • Graph traversal algorithms: Depth‑First Search (DFS), Breadth‑First Search (BFS)
  • Minimum Spanning Tree algorithms: Kruskal’s and Prim’s
  • Dijkstra’s shortest‑path algorithm
  • Comparison of graph algorithms
  • Practical applications of graphs
Unit 4 notes
Unit 5 Sorting, Searching and Hashing 6 topics
  • Sorting algorithms: bubble sort, quick sort, selection sort, heap sort, insertion sort, shell sort, merge sort, radix sort
  • Comparative analysis of sorting techniques
  • Searching techniques: sequential search, binary search
  • Comparison of searching methods
  • Hashing and indexing techniques
  • Case studies: application of data structures in operating systems and DBMS
Unit 5 notes
Unit 6 == END OF UNITS==

The syllabus lists no separate topics for this unit.

Read the full syllabus

Exam insights

Counted from 6 past CS-303 papers.

Marks asked per paper, by unit

  • Unit 1 Review of C programming language.Introduction to Data Structure 22 marks
  • Unit 2 Stacks 24 marks
  • Unit 3 Tree 23 marks
  • Unit 4 Graphs 16 marks
  • Unit 5 Sorting 23 marks

Average marks of the questions from each unit in one paper. You answer only some of them, so the total is more than the paper’s maximum.

Asked again and again

  1. Explain / discuss Kruskal's algorithm with the help of an example / following graph.

    Asked 4 times: 2024, 2023, 2022, 2019

  2. Define data structure and explain the classification / various types of data structures in detail with examples.

    Asked 4 times: 2025, 2024, 2020

  3. Explain in-order, pre-order and post-order traversal of a binary (search) tree with an example.

    Asked 3 times: 2025, 2024, 2023

Other 3rd semester CSE subjects