Home / Semester 3 / Improvement/ReAppear (2024 Batch · 2025-26 Term 1) / CSE205
Back to Subjects

CSE205 — Data Structures And Algorithms

Course Overview

CSE205 4 Credits L:3 T:0 P:2

This course focuses on employability and skill development, designed to enable students to understand time and space complexity of programs and data structures. It covers the implementation and importance of Linked Lists, Stacks, Queues, Trees, Heap operations, and Hashing techniques for efficient data storage and retrieval.

Study Units

Unit 1

Introduction, Arrays, Sorting and Searching

Notes MCQ
Unit 2

Linked Lists

Notes MCQ
Unit 3

Stacks and Queues

Notes MCQ
Unit 4

Trees and Recursion

Notes MCQ
Unit 5

Heaps and Hashing

Notes MCQ
Unit 6

Graphs

Notes MCQ

CSE205 - FAQs

How many units are in CSE205?

CSE205 has 6 units. Each unit includes detailed notes and MCQ practice questions.

What exam resources are available for CSE205?

Unit-wise notes and MCQ practice are available. Exam resources coming soon.

How to prepare for CSE205 exams?

Study each unit's notes thoroughly, practice MCQs to test understanding, and attempt mock tests before exams. Focus on important topics and previous year questions.