Search results
Amit Kumar. Jaswinder and Tarwinder Chadha Chair Professor Department of Computer Science and Engineering Indian Institute of Technology Hauz Khas, New Delhi - 110016
General Information. Semester: Sem II, 2021-22. Instructors: Amit Kumar (email: amitk AT cse.iitd.ac.in) and Parag Singla (email: parags AT cse.iitd.ac.in) Class Timings (Slot F): Tue, 11:00 am - 12:00 noon. Thu, 11:00 am - 12:00 noon. Fri, 11:00 am - 12:00 noon.
Dec 29, 2011 · Vireshwar Kumar Assistant Professor, and Amit and Deepali Sinha Chair in Cyber Security Ph.D. (Virginia Tech, Blacksburg) Security and Privacy in Cyber-Physical Systems, Applied Cryptography, Adversarial Machine Learning. viresh AT cse.iitd.ac.in SIT 214 +91 (11) 2659 1228
Lecture Topics. Lecture 1: Introduction, Overview of the course. Lecture 2: Greedy Algorithms. Interval Selection Problem, Exchange Argument. [KT Chapter 4] Lectrue 3: Exchange argument contd., Minimum Average Completion time. [KT Chapter 4] Lecture 4: Minimum Spanning Tree and Kruskal's algorithm. [KT Chapter 4]
All homeworks must be submitted through moodle. Late submission Policy: Total of 5 late buffer days allowed for the assignments (for example, you can submit one assignment 2 days late, another 3 days late, and the rest on time).
Amit Kumar Office : Room # 417, Bharti Building Email : amitk@cse.iitd.ac.in Phone : (ext) 1286.
Course Contents. Asymptotic analysis (best case, worst case, average case, expected case, amortized), Linked lists, arrays, linear data structures (stacks, queues), tree data structures (priority queues, binary heaps, disjoint set union find), hashing, binary search trees, multiway search trees, sorting, graphs, shortest paths, minimum spanning ...
Lecture 1: Introduction to the course, Time and space complexity. Lecture 2: Graphs, data-structures for graphs, basic terminologies. Lecture 3: Trees, depth first search. Lecture 4: Properties of DFS, strong connectivity, topological sort.
Ragesh Jaiswal. I am an associate professor in the Department of Computer Science and Engineering at IIT Delhi. I am interested in Algorithms, Complexity, Theoretical Cryptography, and Machine Learning. Office Address: Room 403, SIT Building, IIT Delhi, Hauz Khas, New Delhi India - 110 016.
Evaluation components. Assignments : 25+2% (~4 + 1 Java lab) Quizzes (announced): 8%. Minor Exam: 25%. Major exam : 40%. Audit criteria: (At least 40% overall AND 30% in Exams/Quizzes AND 30% in Assignments) OR (Equivalent of C grade or more) Any min/max Audit Criteria as per Senate rules will supersede.
