Scribd
Upload
10 views2 pages

Topics

The document outlines the topics and labs covered in 10 computer science classes. Class 1 covers theory and algorithms. Classes 2 and 3 cover searching algorithms like linear, binary, and ternary searches. Class 4 covers divide and conquer algorithms like merge, quick, and heap sorts. Class 5 covers graph traversal algorithms. Class 6 covers graph algorithms for shortest paths and connectivity. Class 7 covers greedy algorithms. Class 8 covers dynamic programming. Class 9 covers additional algorithms like branch and bound, hashing, and backtracking. Class 10 has no specified content.

Uploaded by

Tazin Ahmed
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
10 views2 pages

Topics

The document outlines the topics and labs covered in 10 computer science classes. Class 1 covers theory and algorithms. Classes 2 and 3 cover searching algorithms like linear, binary, and ternary searches. Class 4 covers divide and conquer algorithms like merge, quick, and heap sorts. Class 5 covers graph traversal algorithms. Class 6 covers graph algorithms for shortest paths and connectivity. Class 7 covers greedy algorithms. Class 8 covers dynamic programming. Class 9 covers additional algorithms like branch and bound, hashing, and backtracking. Class 10 has no specified content.

Uploaded by

Tazin Ahmed
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 2

Class 1 Theory Covered Topics Lab Covered Lab Assignment

Class 2 Linear Search Analysis Of Lab 1


Binary Search Algorithm Bubble Sort
Ternary Search Recurrence Radix Sort
Analysis of algorithm Relation Linear Search
Recurrence Relation Binary Search

Class 3 Searching
Algorithm
Linear
Binary
ternary

Class 4 Divide and Lab 2


conquer Merge
Merge Quick
Quick Heap

Tree
BST
In order
post order
Pre order
Heap
Heap sort

Class 5 Graph
Traverse
basic
BFS
DFS
Topological

Class 6 Graph Lab 3


Algorithms Basic
Shortest path BFS
Strongly DFS
Connected Topological Sort
Component
Class 7 Greedy
Algorithm
Kruskal
Prim
Knapsack
fractional
Huffman
Interval/job
scheduling
Dijkstra
Bellman

Class 8 Dynamic Lab4


Programming
LCS
0/1
Coin Change
Floyd warshall
Matrix chain

Class 9 Extra
Branch and
bound
Hashing
Np hard
Backtracking
N queen
Graph coloring
Pram
Heuristic
Algebraic
simplification
And
transformation

Class 10

You might also like