Course TITLE OF THE COURSE L T P S C C Course Type*

Code H

Competitive Coding – II 0 0 2 0 1 2 EE

20CSP351 Course Code(s)

20CSP-351

PRE Basics of C, C++, Data Structure

REQUISITE

CO -
REQUISITE

ANTI -
REQUISITE

a. Course Description
Competitive programming is the course in which students will learn how to apply algorithms in
order to solve complex problems. The goal of this course is to teach students how to apply
familiar algorithms to non-intuitive problems.

b. Course Objectives
Competitive programming is the course in which students will learn how to apply algorithms in
order to solve complex problems.
The goal of this course is to teach students how to apply familiar algorithms to non-intuitive
problems.

c. Course Outcomes
CO1 Understand the problem and find out better approach to solve particular problem

CO2 To gain critical understanding of problem solving on Leetcode platform

CO3 Apply advance programming concepts for logic building

CO4 To implement the logic and find out the solution of problem and achieve all test cases

CO5 To acquire proficiency in developing and implementing efficient solutions of given

problems by using different approaches and achieve desirable results.

d. Syllabus
 Unit-1 Data Structures Contact Hours:15

Arrays, https://leetcode.com/problems/3sum/
Stacks, https://leetcode.com/problems/jump-game-ii/
Queues https://leetcode.com/problems/simplify-path/
linked list https://leetcode.com/problems/implement-queue-using-stac
ks/ https://leetcode.com/problems/merge-two-sorted-lists/
https://leetcode.com/problems/remove-duplicates-from-sorted-list-ii/

String Matching https://leetcode.com/problems/rotate-string/

https://leetcode.com/problems/find-the-index-of-the-first-occurrence-in
-a string/
https://leetcode.com/problems/camelcase-matching/

https://leetcode.com/problems/repeated-string-match/
https://leetcode.com/problems/longest-happy-prefix/

Heap model https://leetcode.com/problems/kth-largest-element-in-a-strea

m/ https://leetcode.com/problems/last-stone-weight/
https://leetcode.com/problems/cheapest-flights-within-k-sto
ps/ https://leetcode.com/problems/distant-barcodes/
https://leetcode.com/problems/furthest-building-you-can-reach/

Hashing https://leetcode.com/problems/missing-number/
https://leetcode.com/problems/word-pattern/
https://leetcode.com/problems/longest-substring-without-repeati
ng characters/
https://leetcode.com/problems/longest-duplicate-substring/
https://leetcode.com/problems/shortest-palindrome/

Unit-2 Advanced Data Structures Contact Hours:15

Trees https://leetcode.com/problems/same-tree/
https://leetcode.com/problems/symmetric-tree/
https://leetcode.com/problems/balanced-binary-tree/
https://leetcode.com/problems/path-sum/
https://leetcode.com/problems/count-complete-tree-nodes/
https://leetcode.com/problems/delete-node-in-a-bst/
https://leetcode.com/problems/diameter-of-binary-tree/
Graph https://leetcode.com/problems/is-graph-bipartite/
https://leetcode.com/problems/gray-code/
https://leetcode.com/problems/group-the-people-given-the-group-si
ze they-belong-to/
https://leetcode.com/problems/the-skyline-problem/
https://leetcode.com/problems/find-the-difference/
https://leetcode.com/problems/predict-the-winner/

Divide and https://leetcode.com/problems/count-and-say/

conquer https://leetcode.com/problems/1-bit-and-2-bit-characters/
https://leetcode.com/problems/jewels-and-stones/
https://leetcode.com/problems/snakes-and-ladders/
https://leetcode.com/problems/water-and-jug-problem/
https://leetcode.com/problems/find-and-replace-in-string/

UNIT-3 Advanced Data Structures Contact Hours:15

Greedy https://leetcode.com/problems/candy/
https://leetcode.com/problems/best-time-to-buy-and-sell-stock
-ii/ https://leetcode.com/problems/remove-duplicate-letters/
https://leetcode.com/problems/can-place-flowers/
https://leetcode.com/problems/assign-cookies/
https://leetcode.com/problems/three-equal-parts/

Backtracking https://leetcode.com/problems/binary-watch/
https://leetcode.com/problems/stickers-to-spell-word/
https://leetcode.com/problems/all-paths-from-source-to-targ
et/ https://leetcode.com/problems/word-ladder-ii/

https://leetcode.com/problems/subsets/
https://leetcode.com/problems/combinations/

Dynamic https://leetcode.com/problems/best-time-to-buy-and-sell-sto
Programming ck/ https://leetcode.com/problems/decode-ways/
https://leetcode.com/problems/scramble-string/
https://leetcode.com/problems/climbing-stairs/
https://leetcode.com/problems/maximum-subarray/
https://leetcode.com/problems/longest-palindromic-substri
ng/ https://leetcode.com/problems/house-robber-ii/

e. Assessment Pattern - Internal and External

 The performance of students is evaluated as follows:
Theory

Components Continuous Internal Semester End

Assessment (CAE) Examination (SEE)

Marks 60 40

Total Marks 100

f. Internal Evaluation Component

Sr. Type of Weightage of actual Frequen Final Weightage in Remarks
No. Assessment conduct cy of Internal
Task Assessment

1 Conduct 10 Marks per 1 per 60 Marks per course

Practical practical

2 Report 10 Marks per 1 per

Practical practical

3 Viva- Voce 20 Marks per 1 per

Course Course

g. CO-PO Mapping
Cour PO PO PO PO PO PO PO PO PO PO1 PO1 PO1 PSO PSO
se 1 2 3 4 5 6 7 8 9 0 1 2 1 2
Outc
o
me

CO1 3 - 3 2 3 - - 1 1 - - - - -

CO2 3 - - 3 2 3 - - - - - - - -

CO3 3 2 - 3 2 - - - - - - 3 3 -

CO4 3 3 - - 3 2 - - 2 - - 3 3 -
CO5 3 - - - - - - 1 2 3 2 3 - 2