DESIGN & ANALYSIS OF ALGORITHMS (MCA-204)
Program: Master of Computer Applications
Category: Professional Core Course
Semester: 2
Credits: 4
L-T-P: 4- 0- 0
Description
The "Design and Analysis of Algorithms" syllabus covers fundamental techniques for developing efficient algorithms. Topics include algorithm design paradigms like divide-and-conquer, dynamic programming, and greedy methods. It also explores algorithmic complexity, Big O notation, and analysis of time and space complexities. Students learn about sorting, searching, and graph algorithms. The course typically emphasizes problem-solving strategies, optimization, and the design of scalable solutions.
Instructor

Dr. Archana Sharma

Assistant Professor
Department Of Computer Applications
Course Outcomes
  • Understand written algorithms in terms of their composite steps and transformations
  • Understand the design and analysis of various algorithms.
  • Apply important algorithmic design paradigms.
  • Analyze and compare the algorithms on the basis of asymptotic complexity.
  • Gain understanding of applicability of algorithms in devising optimal solutions to given problems in diverse domains.
Resources
Course Handout Lesson Plan Syllabus
Evaluation Scheme
Assignment 10
Attendance 10
Sessional 20
Total Internal 40
Total External 60
Overall Total 100