Skip to content

Padhai By Astra Cloud

Tribhuvan University
BSc CSIT1 2 3 4 5 6 7 8
BCA1 2 3 4 5 6 7 8
BIT1 2 3 4 5 6 7 8
BIM1 2 3 4 5 6 7 8
BBA1 2 3 4 5 6 7 8
BBS1 2 3 4
Pokhara University
BE Computer (PU)1 2 3 4 5 6 7 8
BBA (PU)1 2 3 4 5 6 7 8
National Examinations Board (+2)
+2 Science1 2
+2 Management1 2
Every subject’s units and teaching hours.
TU
- BSc CSIT
- BCA
- BIT
- BIM
- BBA
- BBS
PU
- BE Computer (PU)
- BBA (PU)
NEB
- +2 Science
- +2 Management
Chapter notes, unit by unit.
TU
- BSc CSIT
- BCA
- BIT
- BIM
- BBA
- BBS
PU
- BE Computer (PU)
- BBA (PU)
NEB
- +2 Science
- +2 Management
Past board questions with worked answers.
TU
- BSc CSIT
- BCA
- BIT
- BIM
- BBA
- BBS
PU
- BE Computer (PU)
- BBA (PU)
NEB
- +2 Science
- +2 Management
Answer, check and learn why.
TU
- BSc CSIT
- BCA
- BIT
- BIM
- BBA
- BBS
PU
- BE Computer (PU)
- BBA (PU)
NEB
- +2 Science
- +2 Management
Notices
- GPA calculatorTU, PU and NEB grade points
- SearchEvery note and question

CACS201 Data Structures And Algorithms

BCA · Semester 33 credit hours

Data Structures And Algorithms CACS201

SyllabusComing soonUnits and teaching hours for this subject.Open NotesBeing writtenUnit-by-unit notes with examples.Open Old Questions70 questionsFrom TU Board 2025, TU Board 2024, TU Board 2023 and moreOpen MCQ PracticeComing soonAnswer, see if you’re right straight away, and read why.Open

Recent old questions

Explain stack as ADT. Describe push and pop operation in stack.TU Board 20255 Define linear and circular queue. Write are the limitation of linear queue? How circular queue can used to overcome the limitation of linear queue.TU Board 20255 What is hashing? Explain different types of collision resolution techniques with suitable example.TU Board 20255 What is recursion? Write an algorithm to solve Tower of Hanoi problem.TU Board 20255

All 70 old questions →