Difference between revisions of "Fall 2025: Design and Analysis of Algorithms"
Jump to navigation
Jump to search
| Line 17: | Line 17: | ||
|- | |- | ||
| style="width: 12%; " | Unit-1 | | style="width: 12%; " | Unit-1 | ||
| − | | style="width: 60%" | ''''' | + | | style="width: 60%" | '''''Searching, Sorting, Selection''''': |
| style="width: 15%" | [unit1.pdf] | | style="width: 15%" | [unit1.pdf] | ||
| Chapter 1 (CB1) | | Chapter 1 (CB1) | ||
|- | |- | ||
| Unit 2 | | Unit 2 | ||
| − | | ''''' | + | | '''''Graphs''''': |
| [unit2.pdf] | | [unit2.pdf] | ||
| Chapter 2 (CB1) | | Chapter 2 (CB1) | ||
|- | |- | ||
| Unit 3 | | Unit 3 | ||
| − | | ''''' | + | | '''''Divide and Conquer''''': |
| [unit3.pdf] | | [unit3.pdf] | ||
| Chapter 6 (CB1) | | Chapter 6 (CB1) | ||
|- | |- | ||
| Unit 4 | | Unit 4 | ||
| − | | ''''' | + | | '''''Greedy algorithms'''': |
| [unit4.pdf] | | [unit4.pdf] | ||
| Chapter 4 (CB1) | | Chapter 4 (CB1) | ||
|- | |- | ||
| Unit 5 | | Unit 5 | ||
| − | | ''''' | + | | '''''Dynamic Programming''''': |
| [unit5.pdf] | | [unit5.pdf] | ||
| Chapter 5 (CB1) | | Chapter 5 (CB1) | ||
| + | |- | ||
| + | | Unit 6 | ||
| + | | '''''Intractability''''': | ||
| + | | [unit6.pdf] | ||
| + | | Chapter 6 (CB1) | ||
| + | |- | ||
| + | | Unit 7 | ||
| + | | '''''Advanced Analysis of Algorithms''''': | ||
| + | | [unit7.pdf] | ||
| + | | Chapter 7 (CB1) | ||
|} | |} | ||
Revision as of 20:09, 11 September 2025
Contents
Logistics
- Class Timings: Tuesdays 1:30 pm - 2:30 pm, Thursdays 1:30 pm - 2:30 pm & 4:30 pm - 5:50 pm
- Classroom: R-27
- Lab Timings: Fridays 8:30 am- 10:30 am
- Labs: CS Lab-3
Course Overview
- As per the Delhi University Course Syllabus/Guidelines
Lectures
| Lecture | Topic | Lecture Slides | Readings |
|---|---|---|---|
| Unit-1 | Searching, Sorting, Selection: | [unit1.pdf] | Chapter 1 (CB1) |
| Unit 2 | Graphs: | [unit2.pdf] | Chapter 2 (CB1) |
| Unit 3 | Divide and Conquer: | [unit3.pdf] | Chapter 6 (CB1) |
| Unit 4 | Greedy algorithms': | [unit4.pdf] | Chapter 4 (CB1) |
| Unit 5 | Dynamic Programming: | [unit5.pdf] | Chapter 5 (CB1) |
| Unit 6 | Intractability: | [unit6.pdf] | Chapter 6 (CB1) |
| Unit 7 | Advanced Analysis of Algorithms: | [unit7.pdf] | Chapter 7 (CB1) |
Assignments and Tests
Class Assignments
- Assignment No. 1,
- Assignment No. 2,
Tests and Quizzes
- Test 1 :
- Test 2 :
Labs
Instructions
- Please be on time to avoid the Attendance Penalty.
- Please put your mobile phone on Silent Mode.
- Each lab assignment needs to be submitted in the Google Classroom for evaluation(will be notified in the GC lab-wise, submit before the deadline).
- Turn off(shut down) your assigned computer and arrange the chair before you leave the lab.
Lab 1: ( week of 18th August 2025 )
| Task. No. | Task | Assessment Period | Submission Deadline |
|---|---|---|---|
| 1 | Study of Network related Commands (Linux)
|
18/08/2025 - 25/08/2025 | 26/08/2025 |
Resources
References:
- R1: Marjee T. Britz, Computer Forensics and Cyber Crime: An Introduction, Pearson Education, 2013.
- R2: C. Altheide & H. Carvey Digital Forensics with Open Source Tools, Syngress, 2011.
Additional References:
- Computer Forensics: Investigating Network Intrusions and Cybercrime" by Cameron H. Malin, Eoghan Casey, and James M. Aquilina
- Online Course management System: https://esu.desire2learn.com/
- Computer Forensics, Computer Crime Investigation by John R,Vacca, Firewall Media, New Delhi.
- Computer Forensics and Investigations by Nelson, Phillips Enfinger, Steuart,CENGAGE Learning
- Real Digital Forensics by Keith j.Jones, Richard Bejitlich,Curtis W.Rose, AddisonWesley Pearson Education
