Home / Semester 5 / CSE330
Back to Subjects

CSE330 — Competitive Coding Approaches-Techniques

Course Overview

CSE330 3 Credits L:2 T:0 P:1 Pathway Elective
Download Syllabus

This subject develops competitive coding skills through algorithm complexity analysis, primality testing, recursion, backtracking, dynamic programming, and efficient sorting algorithms. Students apply these techniques to solve computational and optimization problems.

Unit 1

Behaviour Analysis

Unit 2

Primality Testing

Unit 3

Recursion and Advanced Techniques

Unit 4

Basic Dynamic Programming

Unit 5

Dynamic Programming Problems

Unit 6

Efficient Sorting Algorithms & Analysis

Continuous Assessment

3 components

Best 2 of 3 CAs will be considered for evaluation.
Test - Code based 1 50%

To evaluate the understanding of students related to Algorithm Analysis and Primality Testing.

Week 5 / 6

Rubric
Unit1, Unit 2 syllabus will be considered for evaluation.

Test - Code based 2 50%

Unit 3 and unit 4 syllabus will be considered for evaluation.

Week 9 / 10

Rubric
To evaluate the understanding of students related to Recursion and Dynamic Programming.

Test - Code based 3 50%

Unit 5 and Unit 6 will be considered for the evaluation.

Week 13 / 14

Rubric
To evaluate the understanding of students related to Advanced Dynamic Programming and Efficient Sorting Algorithms.

Exams & Practice

End Term Examination

Final semester comprehensive evaluation

50%

Type: Practical

CSE330 - FAQs

How many units are in CSE330?

CSE330 has 6 units. Each unit includes detailed notes and MCQ practice questions.

What exam resources are available for CSE330?

Unit-wise notes and MCQ practice are available. Exam resources coming soon.

How to prepare for CSE330 exams?

Study each unit's notes thoroughly, practice MCQs to test understanding, and attempt mock tests before exams. Focus on important topics and previous year questions.