MCA 301: Design and Analysis of Algorithms Instructor Neelima Gupta

Slides:



Advertisements
Similar presentations
COMP171 Data Structures and Algorithms Spring 2009.
Advertisements

CS 46101–600/CS Design and Analysis of Algorithms Dr. Angela Guercio Spring 2010.
UMass Lowell Computer Science Analysis of Algorithms Prof. Karen Daniels Fall, 2001 Lecture 1 (Part 1) Introduction/Overview Tuesday, 9/4/01.
COMP171 Data Structures and Algorithms Spring 2009.
UMass Lowell Computer Science Analysis of Algorithms Prof. Karen Daniels Fall, 2001 Lecture 1 Introduction/Overview Wed. 9/5/01.
CS3381 Des & Anal of Alg ( SemA) City Univ of HK / Dept of CS / Helena Wong 0. Course Introduction - 1 CS3381 Design and Analysis of Algorithms.
COMP171 Data Structures and Algorithm Qiang Yang Lecture 1 ( Fall 2006)
COMP152 Object-Oriented Programming and Data Structures Spring 2011.
UMass Lowell Computer Science Analysis of Algorithms Prof. Karen Daniels Spring, 2001 Lecture 1 Introduction/Overview Wed. 1/31/01.
UMass Lowell Computer Science Analysis of Algorithms Prof. Karen Daniels Fall, 2000 Lecture 1 Introduction/Overview Wed. 9/6/00.
PROBABILITY AND STATISTICS FOR ENGINEERS Session 1 Dr Abdelaziz Berrado MTH3301 —Fall 09.
Data Structures & Agorithms Lecture-1: Introduction.
Instructor Neelima Gupta
Piyush Kumar (Lecture 1: Introduction)
CSCI 1301 Principles of Computer Science I
CS223 Algorithms D-Term 2013 Instructor: Mohamed Eltabakh WPI, CS Introduction Slide 1.
David Luebke 1 9/11/2015 CS 332: Algorithms Introduction Proof By Induction.
COP 3530: Data Structures, Algorithms, & Applications Instructor: Kristian Linn Damkjer.
LeongHW, SoC, NUS (CS Combinatorial and Graph Algorithms) Page 1 About CS5234: Course Overview CS5234: Combinatorial and Graph Algorithms  Level.
Syllabus and Class Policies MATH 130: Summer 2014.
Introduction to Algorithms Jiafen Liu Sept
8/19/2003CS 303 – Administrivia Lecture 0 1 Administrivia Labs Homework Grades Exams Quiz.
MCA 202: Discrete Structures Instructor Neelima Gupta
Course Introduction Andy Wang COP 4530 / CGS 5425 Fall 2003, Section 4.
MS 101: Algorithms Instructor Neelima Gupta
MS 101: Algorithms Instructor Neelima Gupta
Data Structures Engr. Umbreen sabir What The Course Is About s Data structures is concerned with the representation and manipulation of data. s All programs.
1 1.Log in to the computer in front of you –Temp account: 231class / 2.Update your in Cascadia's system –If I need to you I'll use.
David Luebke 1 11/29/2015 CS 332: Algorithms Introduction Proof By Induction Asymptotic notation.
ICS202 Data Structures King Fahd University of Petroleum & Minerals College of Computer Science & Engineering Information & Computer Science Department.
CSCI 6212 Design and Analysis of Algorithms Dr. Juman Byun The George Washington University Please drop this course if you have not taken the following.
Course overview Course title: Design and Analysis of Algorithms Instructors: Dr. Abdelouahid Derhab Credit hours:
CMSC 2021 CMSC 202 Computer Science II for Majors Spring 2001 Sections Ms. Susan Mitchell.
HFT 4464 Hospitality Financial Management Summer B :00 – 9:50 p.m. Course Overview.
Algorithms Design and Analysis CS Course description / Algorithms Design and Analysis Course name and Number: Algorithms designs and analysis –
Introduction to Algorithms Book by Thomas H. Cormen Charles E. Leiserson Ronald L. Rivest and Clifford Stein Powerpoint by Michael Block.
Welcome to PHY2170/2175 G. Bonvicini, Wayne State University –The purpose of the course –Web sites connected to course –Labs, old text books, etc. –How.
Design and Analysis of Algorithms CS st Term Course Syllabus Cairo University Faculty of Computers and Information.
IMS 4212: Course Introduction 1 Dr. Lawrence West, Management Dept., University of Central Florida ISM 4212 Dr. Larry West
Syllabus and Class Policies MATH 130: Summer 2016.
Data Structures, Algorithms, & Applications
CIS 313: Analysis and Design of Algorithms Assoc. Prof Hassan Aly Department of Computer Science and Information College of Science at AzZulfi Al-Majmaah.
Mathematical Foundations (Growth Functions) Neelima Gupta Department of Computer Science University of Delhi people.du.ac.in/~ngupta.
Data Structures, Algorithms, & Applications
Introduction to Algorithms Second Edition by
Introduction to Algorithms Second Edition by
About CS5234 (Wk 0) Course Overview About CS5234 Homeworks
ICE 245: Algorithms Instructor: Dr. Mohammad Arifuzzaman
11/20/2018 Math is awesome!.
Foundations II: Data Structures and Algorithms
Introduction to Algorithms Second Edition by
Introduction to Programming Using C++
Introduction to Algorithms Second Edition by
CMPT 438 Algorithms Instructor: Tina Tian.
Introduction to Algorithms Second Edition by
Introduction to Algorithms Second Edition by
Introduction to Algorithms Second Edition by
Introduction to Algorithms Second Edition by
26 July 2011 SC 611 Class 1.
Introduction to Algorithms Second Edition by
Introduction to Algorithms Second Edition by
Analysis of Algorithms
Lecture 2 Introduction/Overview Fri. 9/8/00
Introduction to Algorithms Second Edition by
Syllabus and Class Policies
Introduction to Algorithms Second Edition by
Design and Analysis of Algorithms
COMP 122 – Design and Analysis of Algorithms
Introduction to Algorithms Second Edition by
Presentation transcript:

MCA 301: Design and Analysis of Algorithms Instructor Neelima Gupta

Table of Contents About the course Mathematical Induction Asymptotic Notation

Assumption/ Pre-requisite Some exposure to –Algorithm development - at least sorting and searching –Growth Functions: The Big O, Omega and Theta Notations –Mathematical Induction –Solving recurrence relations We will review these topics but will go a little fast … Those who do not have this background are requested to work harder in the initial weeks and come at par with the rest

The Course Purpose: a rigorous introduction to the design and analysis of algorithms –Not a lab or programming course –Not a math course, either Textbook: –Introduction to Algorithms, Cormen, Leiserson, Rivest, Stein, second edition, a good book you must have in your library –Introduction to Algorithms : Saara Base The course involves a lot of self-study. Off n On topics will be given for self-study which will be part of syllabus for exams.

The Course Format –Three lectures/week –Two groups of Tutorials (details will follow) –Homework most weeks Problem sets Maybe occasional programming assignments –Two Minors + one final exam(Major)

Grading policy –Homework Assignment : 15% –Minor 1: 15% –Minor 2: 15% –Major : 50% –Attendance : 5%

Tutorial Group 1 : Roll No 1-15, Group leader – Roll No 1 Group 2 : Roll No 16-30, Group leader – Roll No 16 Group Leaders can be changed/rotated, if the need be Tute 1– students doubts will be taken Tute 2– a problem will be given to be solved. This will be graded, to be counted under homework assignment. Sometimes the problem/s may be given for home, but that ’ s only my decision.. No request will be granted in this regard. To be able to stick to timings.. I would request you to collect your doubts and mail to your group leader who will collect similar problems into one and mail the final list to me a day before at FAILING which your doubts will not be taken up in the tutorial

ALL THE BEST