Skip to content
Home › Courses › CS301

CS301: Data Structures

CS301 Data Structures shows how data is stored and organised so programs run fast. It covers lists, stacks, queues, trees, heaps and hashing, with the algorithms used to search and sort them, all in C++.

  • 47 lectures
  • Past papers style solved MCQs
  • Answers in English and Roman Urdu
Start practising
Add to My courses Sign up free to track your progress for this course.

How to prepare for CS301

  1. Practise lecture by lectureStudy a lecture, then take its quiz. Best during the semester.
  2. Take a mock before the examPick the lectures in your syllabus and test yourself.
  3. See where you standCheck your rank this week and this semester.

CS301 Lecture Quizzes

Each quiz covers a few lectures. New here? Start with Lecture 0-2 Quiz.

Mock from selected lectures
Lecture 0-2 Quiz3 quizzes (I-III) Lecture 3-5 Quiz3 quizzes (I-III) Lecture 6-8 Quiz3 quizzes (I-III) Lecture 9-11 Quiz3 quizzes (I-III) Lecture 12-14 Quiz3 quizzes (I-III) Lecture 15-17 Quiz3 quizzes (I-III) Lecture 18-20 Quiz3 quizzes (I-III) Lecture 21-23 Quiz2 quizzes (I-II) Lecture 24-26 Quiz3 quizzes (I-III) Lecture 27-29 Quiz3 quizzes (I-III) Lecture 30-32 Quiz3 quizzes (I-III) Lecture 33-35 Quiz3 quizzes (I-III) Lecture 36-38 Quiz3 quizzes (I-III) Lecture 39-41 Quiz4 quizzes (I-IV) Lecture 42-44 Quiz3 quizzes (I-III) Lecture 45-46 Quiz2 quizzes (I-II)

CS301 Exam Mocks

A practice paper made only from the lectures in your syllabus. Pick the one that fits your next exam.

Before your midterm Midterm Mock Tap the lectures in your midterm syllabus. Start Before your final term Final Term Mock Tap the lectures in your final term syllabus. Start Any time Custom Mock Choose any lectures, for example the ones you find hard. Start

CS301 Leaderboard

Points are your correct answers in lecture quizzes.

Loading leaderboard…

CS301 Community

Stuck on a lecture? Ask other CS301 students.

Post your question, discuss a tricky MCQ or help someone else. Be the first to start a discussion.

Ask a question Browse discussions
About the course

CS301 Data Structures

Gradup covers all 47 lectures of CS301 Data Structures with Past Papers Style Solved MCQs. Use the lecture quizzes while you study the CS301 handouts, then switch to the CS301 midterm and final term mocks. Every answer comes with an explanation and the handout reference, so you know exactly where to revise.

Main topics
  1. 01Linked lists
  2. 02Stacks and queues
  3. 03Binary and AVL trees
  4. 04Heaps and Huffman coding
  5. 05Hashing and tables
  6. 06Sorting and searching
See all 47 CS301 lectures

Frequently asked questions

Quick answers about practising CS301 on Gradup.

Gradup has lecture-wise CS301 quizzes with Past Papers Style Solved MCQs covering all 47 lectures, with explanations in English and Roman Urdu.

Yes. Choose the lectures that are in your midterm and Gradup builds a CS301 midterm mock from Past Papers Style Solved MCQs of only those lectures. Try again for other questions from the same lectures.

Yes. The CS301 final term mock mixes easy, medium and hard MCQs from the lectures you select, just like the real paper.

You can take any quiz without an account. Sign up free to get one month of full access with progress tracking, mocks, streaks and the leaderboard.