Scribd
Upload
140 views

ACM Syllabus

The document outlines a 6 semester curriculum for a computer science course. The first semester focuses on basic input/output and control flow concepts. The second semester covers arrays, sorting, searching and recursion. The third semester includes graphs, trees, and algorithms like depth-first search. The fourth semester delves into dynamic programming, greedy algorithms, and graph algorithms. The fifth semester covers divide and conquer, heaps, and dynamic programming. The sixth semester concludes with shortest path algorithms, backtracking, and other advanced topics.

Uploaded by

Hassan Mahfuj
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
140 views

ACM Syllabus

The document outlines a 6 semester curriculum for a computer science course. The first semester focuses on basic input/output and control flow concepts. The second semester covers arrays, sorting, searching and recursion. The third semester includes graphs, trees, and algorithms like depth-first search. The fourth semester delves into dynamic programming, greedy algorithms, and graph algorithms. The fifth semester covers divide and conquer, heaps, and dynamic programming. The sixth semester concludes with shortest path algorithms, backtracking, and other advanced topics.

Uploaded by

Hassan Mahfuj
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 7

3rd Semester

Day 1
Input and Output management (int, long, double, char, long long , __int64)
Day 2
If and if else statements (Branching)
Day 3
Looping
10071-Back to High School Physics
11172 - Relational Operator
10783-odd sum
10055-Hashmat the brave warrior
1124-Celebrity jeopardy
12372- Packing for Holiday
12403-Save Setu
12342-Tax Calculator
12289-one-two-three
12157-Tariff Plan
12136 - Schedule of a Married Man
11727-cost cutting
11715-car
11677-Alarm Clock
11666-logarithms
11650-Mirror Clock
11608-No Problem
10929-You Can say 11
10347-Medians
10469-To Carry or not to a Carry
10346-Peter smokes
488-Triangle wave
100-3n+1

Day 4
Arrays and Strings
11530-SMS typing
10222-Decode the mad man
11713-Abstract Names
11059-Maximum Product
11716-Digital Fortress
11577-Letter Frequency
11541-Decoding
10945-Mother Bear
10921-find the telephone
10302-Summation of Polynomials
10260-Soundex

10424-Love Calculator
10070-Leap year or not leap year
10018-Reverse and add
483-word scramble
490-Rotating sentence
623-500!
401-Palindroms
344-Roman digits

Day 5
1. Functions, Structures, Pointers,
2. Number Theory
(GCD,LCM, Modular Arithmetic, Number generation)
408-uniform Generator
10924-Prime Words
10790-How many points of intersection?
10323-Factorial! You Must be Kidding!!!
10235-Simply Emirp
10591-Happy Number
10473-Simple Base conversion
389-basically speaking
343-what base is this?
10104-Euclid Problem
10079-Pizza cutting
477-Points in Figures: Rectangles and Circles
575-skew binary
369-combination

4th Semester
Day 1
a. Array
11716-Digital Fortress
11577-Letter Frequency
541-Error Correction[c]
10050-Hartals (easy simulation)[c]
151-Power Crisis[H]
440-Eney Menny Moo [H]
133-The Dole Queue[H]
305-Joseph[H]
402-M*A*S*H [H]

b. Stack
673-Parenthese Balance [c]
551-Nesting a Bunch of Brackets[c]
442-Matrix Chain Multiplication[H]
514-Rails[H]
120-Stacks of Flapjacks[H]

Day 2
a. Sorting
i.
Bubble Sort
299-Train swapping[H]
10327-Flip Sort[H]
612-DNA sorting[H]

ii.

Insertion Sort
10107-What is the Median [H]

iii.

For big size input, this approach will get TLE


Quick Sort
11462-Age Sort
195-Anagram

Qsort standard library function for different data types e.g. int, double,
char, string, structure, multiple criteria based sorting.
10194-Football (aka Soccer) [H]

b. Binary Search
Bsearch standard library function
10282-Babelfish [C]
10611- The Palyboy Chimp[C]

c. Bisection Method in solving non-linear equation


10341-Solve it [C]
10263-Railway [H]

Day 3
a. Traversing and Searching in a Grid
11494-Queen
10189-Minesweeper [C]
422-word-Search wonder[C]
10010-Whrers Waldorf [C]
736-Lost in Space[H]
10116-Robot Motion[H]
10279-Mine Sweeper [H]
10284- Chessboard in FEN[H]
10161-Ant on a chessboard

b. Handling Input for the Following problems


10174-Couple-Bachelor-Spinster Numbers [C]
498-Polly the polynomial[C]

Day 4
a. Graph, how to represent
12376AsLongasILearn,ILive

b. Graph traversing Algorithms DFS, Finding connect Component (Flood Fill)


352-The Seasonal ear[C]
572-Oil Deposits[C]
469-Wetlands of Florida [H]
784-Maze Exploration [C]
785-Grid Colouring [H]
782-Contour Painting [H]
459- Graph Connectivity [H]

c. Topological Sorting
10305-Orfering Tasks[C]
872 - Ordering
11060 - Beverages

Day 5
a. Queue
b. BFS
336-A Node Too Far [C]
439- Knight Moves[C]
10004-Bicoloring[H]
532-Dungeon Master[H]
10009-All Roads Lead Where?(Better by all pair)[H]
10067-Playing with Wheels[H]
615-Is It a Tree?[H]
423- MPI Maelstrom [H]

Day 6
a. Counting
10359-Tiling[C]
10198-Counting[C]

b. Number Theory
10162-Last Digit[C]
10515-Power et al.[C]
10219-Find the ways[C]
10061-How many Zeros and How many digits[C]
10706-Number Sequence[C]
10689-Yet Another Number Sequence[H]
10193-All you Need is Love[H]
10629-Infinite Race[H]

5th Semester
Day 1
Divide and Conquer approach & Heaps
a. Merge Sort
855 - Lunch in Grid City
11462 - Age Sort
11858 - Frosh Week
b. Heap sort
c.

Priority Queue
1203 - Argus
10954 - Add All
11995 - I Can Guess the Data Structure!

Day 2
Dynamic Programming
a.LCS
10192Vacation
10405LongestCommonSubsequence
b.MCM
348-Optimal Array Multiplication Sequence

Day 3
Greedy Algorithm

a. Activity Selection Problem


b. Knapsack problem
10616 - Divisible Group Sums
10819 - Trouble of 13-Dots
11832 - Account Book

c. Traveling Salesperson Problem


216GettinginLine
10496CollectingBeepers
11284ShoppingTrip

Day 4
Graphs basic & traversal techniques
a. BFS
336-A Node Too Far [C]
439- Knight Moves[C]
10004-Bicoloring[H]
532-Dungeon Master[H]
10009-All Roads Lead Where?(Better by all pair)[H]
10067-Playing with Wheels[H]
615-Is It a Tree?[H]
423- MPI Maelstrom [H]
321 - The New Villa
10047 - The Monocycle
11101 - Mall Mania

b. DFS
352-The Seasonal ear[C]
572-Oil Deposits[C]
469-Wetlands of Florida [H]
784-Maze Exploration [C]
785-Grid Colouring [H]
782-Contour Painting [H]
459- Graph Connectivity [H]

c.

Minimum Spanning tree


11597-Spanning subtrees
11228 - Transportation system.
11631 - Dark roads
11747 - Heavy Cycle Edges

Day 5
Shortest Path
a. Dijkstras Algorithm
10801LiftHopping
11367FullTank
11492Babel
b. Bellman-Ford Algorithm
558Wormholes
10557XYZZY
11280FlyingtoFredericton
c.

All pair Shortest Path, Floyd Warshall Algorithm

Day 6
Backtracking (N-queen problem)

You might also like