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

BIT201 Data Structure and Algorithms

BIT · Semester 33 credit hours

Data Structure and Algorithms BIT201

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

Recent old questions

Define hash function. Discuss the types of graph. Explain the working mechanism of BFS.TU Board 208310 Make a comparison between quick sort and merge sort.TU Board 208310 What is balanced tree? How do you insert and delete a node in a Binary Search Tree? Explain.TU Board 208310 Describe the merits and demerits of sequential search over binary search.TU Board 20835

All 48 old questions →