Scribd
Upload
36 views2 pages

Cse207 Full Chat Summary

The document outlines the course CSE 207 - Design and Analysis of Algorithms, detailing its objectives, strengths, and suggestions for improvement. It includes a weekly plan with integrated activities, project deliverables, and an evaluation rubric, as well as a question paper structure and CLO-PO mapping. Additionally, it discusses the use of case studies in computer science education, emphasizing real-world applications and collaborative learning.

Uploaded by

Bidhan Barai
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
36 views2 pages

Cse207 Full Chat Summary

The document outlines the course CSE 207 - Design and Analysis of Algorithms, detailing its objectives, strengths, and suggestions for improvement. It includes a weekly plan with integrated activities, project deliverables, and an evaluation rubric, as well as a question paper structure and CLO-PO mapping. Additionally, it discusses the use of case studies in computer science education, emphasizing real-world applications and collaborative learning.

Uploaded by

Bidhan Barai
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

Full Summary Document: Design and Analysis of Algorithms (CSE 207) - June 6, 2025

Course Evaluation: CSE 207 – Design and Analysis of Algorithms

General Overview - Course Code: CSE 207 - Credits: 4 (3 Lecture + 1 Practical) - Pre-requisite: CSE 107 - Co-
requisite: CSE 202 - Total Contact Hours: 65 - Department: CSE

Course Objectives: 1. Analyze performance of algorithms 2. Apply design techniques (Divide & Conquer,
Greedy, etc.) 3. Understand impact of data structures on performance 4. Explore NP problems and
approximations 5. Grasp algorithmic complexity 6. Implement Backtracking and Branch & Bound

Strengths: - Balanced theory-practice structure - CLOs aligned with Bloom's taxonomy - Integration of
advanced topics and real-world algorithms

Suggestions: - Add modern algorithm topics (online, streaming) - Encourage open-ended and competitive
programming

Weekly Plan with Activity Integration

Week 1: Introduction to Algorithms - Activities: Think-Pair-Share on everyday algorithms, discussion on


algorithm efficiency

Week 2: Complexity & Data Structures - Activities: Matching pseudocode to complexity, create-your-own
hash function lab

Week 3: Sorting Algorithms - Group Project: "Benchmarking Sorting Algorithms in the Real World" -
Implement 3 algorithms, test on varied datasets, analyze results

Project Deliverables: 1. Source code 2. Performance charts 3. 4-page analytical report 4. Group
presentation

Evaluation Rubric: 20 Marks total (Code – 5, Data – 5, Analysis – 5, Report – 3, Presentation – 2)

Question Paper: CO-PO Mapped (Above Average Difficulty)

Total Marks: 100 | 6 CLOs Covered | Bloom Levels: Understand, Apply, Analyze

Example Questions: - Define best/average/worst-case complexity [5M, CLO2, PO1] - Compare Merge vs
Quick Sort [5M, CLO3, PO1, PO2] - Solve recurrence using Master’s Theorem [7M, CLO3, PO2] - Dijkstra’s
algorithm and trace [8M, CLO4, PO1, PO2, PO5] - 8-Queen with backtracking [10M, CLO6, PO1–PO3]

1
CLO-Wise Distribution: - CLO1: 20 - CLO2: 10 - CLO3: 17 - CLO4: 30 - CLO5: 10 - CLO6: 23

PO Mapping Summary: | CLO \ PO | PO1 | PO2 | PO3 | PO5 | |----------|------|------|------|------| | CLO1 | ✓ |


✓ | ✓ | | | CLO2 | ✓ | ✓ | | | | CLO3 | ✓ | ✓ | ✓ | | | CLO4 | ✓ | ✓ | ✓ | ✓ | | CLO5 | ✓ | ✓ | | | | CLO6 | ✓
|✓|✓||

Case Study in CSE: Explained

What is a Case Study? - A real-world scenario to apply knowledge and make decisions - Encourages
analysis, synthesis, and teamwork

Key Traits: - Contextual, open-ended, reflective, and collaborative

Use in CSE: - Bridges theory and practice - Fosters critical thinking

Example: Route Optimization for Emergency Medical Services (EMS) - Use Dijkstra's algorithm on a
weighted graph representing city roads - Handle multiple EMS requests and evaluate real-time performance
- Extend to approximation and backtracking scenarios

Learning Outcomes Targeted: CLO1, CLO3, CLO4, CLO5, CLO6

Benefits: - Application-focused - Collaboration-oriented - Enhances motivation and engagement

You might also like