SRM UNIVERSITY FACULTY OF ENGINEERING AND TECHNOLOGY SCHOOL OF COMPUTING DEPARTMENT OF CSE COURSE PLAN
|
|
|
- Neil Anthony
- 7 years ago
- Views:
Transcription
1 SRM UNIVERSITY FACULTY OF ENGINEERING AND TECHNOLOGY SCHOOL OF COMPUTING DEPARTMENT OF CSE COURSE PLAN Course Code : CS0203 Course Title : Design and Analysis of Algorithms Semester : III Course Time : JULY DEC 2011 DAY SECTION A B C D E Hour Timing Hour Timing Hour Timing Hour Timing Hour Timing , , , Location : S.R.M.E.C Tech Park Faculty Details SEC NAME OFFICE OFFICE HOUR MAIL ID A Mr. T.Balachander Tech Park Monday - Friday balachandert@ktr.srmuniv.ac.in B Mrs.R.Annieuthra TP Monday Friday annieuthra@ktr.srmuniv.ac.in C Mrs.M.Sumathi TP Monday Friday msumathi@ktr.srmuniv.ac.in Required Text Books: D MrJ.Prassanna Tech Park ( 506 A ) Monday to Friday prassanna@ktr.srmuniv.ac.in E Ms.R.Mangalagowri TP803 Monday to Friday mangala@ktr.srmuniv.ac.in 1. E.Horowitz, Sahni & Sanguthevar Rajasekaran, "Fundamentals of Computer Algorithms", Galgotia Publications, Richard Johnsonbaugh, Marcus Schaefer, " Algorithms ", Pearson Education, rd edition (chapter 1,2,10)
2 Web resources Prerequisite : Basic knowledge in Mathematics Objectives Fundamentals of Problem Solving Techniques 1. Divide and Conquer, Dynamic Programming techniques 2. Backtracking, NP complete problems 3. Various analysis of algorithms Assessment Details Attendance : 5 Marks Cycle Test I : 10 Marks Surprise Test I : 5 Marks Cycle Test II : 10 Marks Model Exam : 20 Marks Test Schedule S.No. DATE TEST TOPICS DURATION 1 Cycle Test - I Unit I & II 2 periods 2 Cycle Test - II Unit III & IV 2 periods 3 Model Exam All 5 units 3 Hrs
3 Outcomes Students who have successfully completed this course will have full understanding of the following concepts Course outcome Program outcome To learn 1. Divide and Conquer, Dynamic Programming techniques 2. Backtracking, NP complete problems 3. Various analysis of algorithm 1. An ability to implement data structures concepts in solving real time applications. 2. To be able to design and implement problem solving models in engineering field. Detailed Session Plan ANALYSIS OF ALGORITHM Introduction - Algorithms - Pseudo code for algorithms - present - future. Mathematics for Algorithms - Definitions - Notation and Basic results - Asymptotic Notation- Mathematical Induction - Analysis of Algorithms - Recurrence relations. Sessio n No. Topics to be covered Time (min) Ref Teaching Method Testing Method 1 Introduction to Algorithms 50 1 BB 2 Pseudo code for algorithms 50 1 BB 3 Mathematics for Algorithms 50 1 BB, PPT 4 Definitions - Notation and Basic results 50 1 BB 5 Asymptotic Notation 50 1 BB 6 Mathematical Induction 50 1 BB, PPT
4 7 Analysis of Algorithms 50 1 BB, 8 Analysis of Algorithms 50 1 BB 9 Recurrence relations BB DIVIDE AND CONQUER METHOD General Method - Binary Search - Finding Maximum and Minimum - Merge Sort - Quick Sort - Greedy Method - General Method - KnapSack Problem - Minimum Spanning Tree Algorithm - Single Source Shortest Path Algorithm. 10 General Method 50 2 BB 11 Binary Search 50 2 BB Brain storming 12 Finding Maximum and Minimum 50 2 BB Surprise Test 13 Merge Sort 50 2 BB, PPT 14 Quick Sort 50 2 BB 15 Greedy Method 50 2 BB, 16 KnapSack Problem 50 2 BB, PPT 17 Minimum Spanning Tree Algorithm 50 2 BB Brain storming 18 Single Source Shortest Path Algorithm 50 2 BB DYNAMIC PROGRAMMING General Method-Multistage Graph - All Pairs Shortest Path Algorithm - 0/1 Knapsack Problem - Traveling Salesman
5 Problem - Basic search techniques and traversal techniques -bi-connected components - Depth First Search - Breadth First Search. 19 Multistage Graph 50 3 BB, PPT 20 All Pairs Shortest Path Algorithm 50 3 BB 21 0/1 Knapsack Problem 50 3 BB, PPT, 22 Traveling Salesman Problem 50 3 BB Surprise Test 23 Basic search techniques and traversal techniques 50 3 BB 24 Basic search techniques and traversal techniques 50 3 BB, PPT 25 Bi-connected components 50 3 BB 26 Depth First Search 50 3 BB, PPT 27 Breadth First Search 50 3 BB Brain storming BACKTRACKING The General Method - 8-Queens Problem- Sum of Subsets - Graph Coloring- Hamiltonian Cycle-Knapsack Problem - Branch and Bound Method - 0/1 Knapsack Problem - Traveling Salesman Problem. 28 Back Tracking Introduction 50 4 BB 29 8-Queens Problem 50 4 BB, PPT 30 Sum of Subsets 50 4 BB 31 Graph Coloring 50 4 BB, PPT
6 32 Hamiltonian Cycle 50 4 BB 33 Knapsack Problem 50 4 BB 34 Branch and Bound Method 50 4 BB 35 0/1 Knapsack Problem 50 4 BB 36 Traveling Salesman Problem 50 4 BB P and NP Polynomial time - Nondeterministic Algorithms and NP - Reducibility and NP completeness - NP complete Problems - More on NP completeness. Case studies. 37 Basic Concepts Polynomial time 50 5 BB, PPT 38 NP Hard Graph Problems 50 5 BB 39 NP Hard Graph Problems 50 5 BB 40 NP complete Problems 50 5 BB, PPT Brain storming 41 NP complete Problems 50 5 BB Brain storming 42 NP Hard Scheduling Problems 50 5 BB Surprise test 43 Flow Shop & Job Scheduling 50 5 BB, PPT 44 NP Hard Code Generation Problems 50 5 BB, PPT 45 Case Studies 50 5 BB Brain storming BB Black Board(Chalk & Board) PPT Powerpoint Presentation
2. (a) Explain the strassen s matrix multiplication. (b) Write deletion algorithm, of Binary search tree. [8+8]
![2. (a) Explain the strassen s matrix multiplication. (b) Write deletion algorithm, of Binary search tree. [8+8]](/thumbs/40/21097758.jpg "2. (a) Explain the strassen s matrix multiplication. (b) Write deletion algorithm, of Binary search tree. [8+8]")
Code No: R05220502 Set No. 1 1. (a) Describe the performance analysis in detail. (b) Show that f 1 (n)+f 2 (n) = 0(max(g 1 (n), g 2 (n)) where f 1 (n) = 0(g 1 (n)) and f 2 (n) = 0(g 2 (n)). [8+8] 2. (a)
FACULTY OF ENGINEERING AND TECHNOLOGY SCHOOL OF COMPUTING DEPARTMENT OF CSE COURSE PLAN
FACULTY OF ENGINEERING AND TECHNOLOGY SCHOOL OF COMPUTING DEPARTMENT OF CSE COURSE PLAN Course Code : CS2115 Course Title : SERVER ORIENTED ARCHITECTURE Semester : III Semester M.Tech.CSE Course Time :
SRM UNIVERSITY FACULTY OF ENGINEERING & TECHNOLOGY SCHOOL OF COMPUTING DEPARTMENT OF SOFTWARE ENGINEERING COURSE PLAN
Course Code : CS0355 SRM UNIVERSITY FACULTY OF ENGINEERING & TECHNOLOGY SCHOOL OF COMPUTING DEPARTMENT OF SOFTWARE ENGINEERING COURSE PLAN Course Title : THEORY OF COMPUTATION Semester : VI Course : June
SRM UNIVERSITY FACULTY OF ENGINEERING AND TECHNOLOGY SCHOOL OF COMPUTING DEPARTMENT OF CSE COURSE PLAN
SRM UNIVERSITY FACULTY OF ENGINEERING AND TECHNOLOGY Course Code : CS0518 Course Title : Internet Programming and Tool Semester : II Semester (M.Tech) Course Time :Dec May 2012 SCHOOL OF COMPUTING DEPARTMENT
Computer Algorithms. NP-Complete Problems. CISC 4080 Yanjun Li
Computer Algorithms NP-Complete Problems NP-completeness The quest for efficient algorithms is about finding clever ways to bypass the process of exhaustive search, using clues from the input in order
SRM UNIVERSITY FACULTY OF ENGINEERING AND TECHNOLOGY SCHOOL OF COMPUTING DEPARTMENT OF COMPUTER SCIENCE AND ENGINEERING COURSE PLAN
SRM UNIVERSITY FACULTY OF ENGINEERING AND TECHNOLOGY SCHOOL OF COMPUTING DEPARTMENT OF COMPUTER SCIENCE AND ENGINEERING COURSE PLAN Course Code : CS0446 Course Title : Firewall Architecture Semester :
Why? A central concept in Computer Science. Algorithms are ubiquitous.
Analysis of Algorithms: A Brief Introduction Why? A central concept in Computer Science. Algorithms are ubiquitous. Using the Internet (sending email, transferring files, use of search engines, online
Computer Science. Discipline-Specific Admission Requirements. Alternate Admission Criteria
University of Missouri - Kansas City 1 Computer Science Discipline Coordinator Yugyung Lee, (816) 235-5932, leeyu@umkc.edu Computer Science faculty who are members of the doctoral faculty. Computer Science
SRM UNIVERSITY FACULTY OF ENGINEERING AND TECHNOLOGY
SRM UNIVERSITY FACULTY OF ENGINEERING AND TECHNOLOGY SCHOOL OF COMPUTING DEPARTMENT OF SWE COURSE PLAN Course Code : CS0351 Course Title : SOFTWARE PROJECT MANAGEMENT Semester : VII Course Time : July
Data Structure [Question Bank]
![Data Structure [Question Bank]](/thumbs/40/21355705.jpg "Data Structure [Question Bank]")
Unit I (Analysis of Algorithms) 1. What are algorithms and how they are useful? 2. Describe the factor on best algorithms depends on? 3. Differentiate: Correct & Incorrect Algorithms? 4. Write short note:
CS5310 Algorithms 3 credit hours 2 hours lecture and 2 hours recitation every week
CS5310 Algorithms 3 credit hours 2 hours lecture and 2 hours recitation every week This course is a continuation of the study of data structures and algorithms, emphasizing methods useful in practice.
Outline. NP-completeness. When is a problem easy? When is a problem hard? Today. Euler Circuits
Outline NP-completeness Examples of Easy vs. Hard problems Euler circuit vs. Hamiltonian circuit Shortest Path vs. Longest Path 2-pairs sum vs. general Subset Sum Reducing one problem to another Clique
Mathematics for Algorithm and System Analysis
Mathematics for Algorithm and System Analysis for students of computer and computational science Edward A. Bender S. Gill Williamson c Edward A. Bender & S. Gill Williamson 2005. All rights reserved. Preface
CS 2302 Data Structures Spring 2015
1. General Information Instructor: CS 2302 Data Structures Spring 2015 Olac Fuentes Email: ofuentes@utep.edu Web: www.cs.utep.edu/ofuentes Office hours: Tuesdays and Thursdays 2:00-3:30, or by appointment,
SRM UNIVERSITY FACULTY OF ENGINEERING AND TECHNOLOGY SCHOOL OF COMPUTING DEPARTMENT OF SOFTWARE ENGINEERING COURSE PLAN.
SRM UNIVERSITY FACULTY OF ENGINEERING AND TECHNOLOGY SCHOOL OF COMPUTING DEPARTMENT OF SOFTWARE ENGINEERING COURSE PLAN Course Code CS0375 Course Title ENTERPRISE RESOURCE PLANNING Semester VII Course
NP-Completeness. CptS 223 Advanced Data Structures. Larry Holder School of Electrical Engineering and Computer Science Washington State University
NP-Completeness CptS 223 Advanced Data Structures Larry Holder School of Electrical Engineering and Computer Science Washington State University 1 Hard Graph Problems Hard means no known solutions with
Complexity Classes P and NP
Complexity Classes P and NP MATH 3220 Supplemental Presentation by John Aleshunas The cure for boredom is curiosity. There is no cure for curiosity Dorothy Parker Computational Complexity Theory In computer
the recursion-tree method
the recursion- method recurrence into a 1 recurrence into a 2 MCS 360 Lecture 39 Introduction to Data Structures Jan Verschelde, 22 November 2010 recurrence into a The for consists of two steps: 1 Guess
Dynamic programming. Doctoral course Optimization on graphs - Lecture 4.1. Giovanni Righini. January 17 th, 2013
Dynamic programming Doctoral course Optimization on graphs - Lecture.1 Giovanni Righini January 1 th, 201 Implicit enumeration Combinatorial optimization problems are in general NP-hard and we usually
Master of Science in Computer Science College of Computer and Information Science. Course Syllabus
Master of Science in Computer Science College of Computer and Information Science Course Syllabus Course Number/Name: CS 5800 Algorithms (Master Level) Term: Fall 2013, 15 week term, Hybrid Dates: September
Page 1. CSCE 310J Data Structures & Algorithms. CSCE 310J Data Structures & Algorithms. P, NP, and NP-Complete. Polynomial-Time Algorithms
CSCE 310J Data Structures & Algorithms P, NP, and NP-Complete Dr. Steve Goddard goddard@cse.unl.edu CSCE 310J Data Structures & Algorithms Giving credit where credit is due:» Most of the lecture notes
SRM UNIVERSITY FACULTY OF ENGINEERING AND TECHNOLOGY DEPARTMENT OF COMPUTER APPLICATIONS COURSE PLAN
SRM UNIVERSITY FACULTY OF ENGINEERING AND TECHNOLOGY DEPARTMENT OF COMPUTER APPLICATIONS COURSE PLAN Course Code : MC0761 Course Title : E-COMMERCE (Elective subject) Semester : V Course Time : July-November
Online Course Syllabus MT201 College Algebra. Important Notes:
Online Course Syllabus MT201 College Algebra Important Notes: This document provides an overview of expectations for this online course and is subject to change prior to the term start. Changes may also
Tutorial 8. NP-Complete Problems
Tutorial 8 NP-Complete Problems Decision Problem Statement of a decision problem Part 1: instance description defining the input Part 2: question stating the actual yesor-no question A decision problem
Information Technology
OSMANIA UNIVERSITY FACULTY OF BUSINESS MANAGEMENT Computer Lab Practical Question Bank Information Technology Time: 60 Minutes Record : 10 Skill Test : 20 MS-WORD Total Marks : 30 1. Create a document
4.1. Title: data analysis (systems analysis). 4.2. Annotation of educational discipline: educational discipline includes in itself the mastery of the
4.1. Title: data analysis (systems analysis). 4.4. Term of study: 7th semester. 4.1. Title: data analysis (applied mathematics). 4.4. Term of study: 6th semester. 4.1. Title: data analysis (computer science).
LeMoyne-Owen College Division of Natural and Mathematical Sciences COMPUTER ALGORITHMS, COSI 335 Fall 2013. Syllabus
LeMoyne-Owen College Division of Natural and Mathematical Sciences COMPUTER ALGORITHMS, COSI 335 Fall 2013 Instructor: Valerie Chu, Ph.D. Office Room: GOH 400D Office Phone: (901) 435-1378 Office Hours:
Programming Using Python
Introduction to Computation and Programming Using Python Revised and Expanded Edition John V. Guttag The MIT Press Cambridge, Massachusetts London, England CONTENTS PREFACE xiii ACKNOWLEDGMENTS xv 1 GETTING
Introduction to Algorithms. Part 3: P, NP Hard Problems
Introduction to Algorithms Part 3: P, NP Hard Problems 1) Polynomial Time: P and NP 2) NP-Completeness 3) Dealing with Hard Problems 4) Lower Bounds 5) Books c Wayne Goddard, Clemson University, 2004 Chapter
Complexity Theory. IE 661: Scheduling Theory Fall 2003 Satyaki Ghosh Dastidar
Complexity Theory IE 661: Scheduling Theory Fall 2003 Satyaki Ghosh Dastidar Outline Goals Computation of Problems Concepts and Definitions Complexity Classes and Problems Polynomial Time Reductions Examples
Exam study sheet for CS2711. List of topics
Exam study sheet for CS2711 Here is the list of topics you need to know for the final exam. For each data structure listed below, make sure you can do the following: 1. Give an example of this data structure
Data Structures and Algorithms Written Examination
Data Structures and Algorithms Written Examination 22 February 2013 FIRST NAME STUDENT NUMBER LAST NAME SIGNATURE Instructions for students: Write First Name, Last Name, Student Number and Signature where
Division of Mathematical Sciences
Division of Mathematical Sciences Chair: Mohammad Ladan, Ph.D. The Division of Mathematical Sciences at Haigazian University includes Computer Science and Mathematics. The Bachelor of Science (B.S.) degree
Warshall s Algorithm: Transitive Closure
CS 0 Theory of Algorithms / CS 68 Algorithms in Bioinformaticsi Dynamic Programming Part II. Warshall s Algorithm: Transitive Closure Computes the transitive closure of a relation (Alternatively: all paths
Lecture 7: NP-Complete Problems
IAS/PCMI Summer Session 2000 Clay Mathematics Undergraduate Program Basic Course on Computational Complexity Lecture 7: NP-Complete Problems David Mix Barrington and Alexis Maciel July 25, 2000 1. Circuit
JUST-IN-TIME SCHEDULING WITH PERIODIC TIME SLOTS. Received December May 12, 2003; revised February 5, 2004
Scientiae Mathematicae Japonicae Online, Vol. 10, (2004), 431 437 431 JUST-IN-TIME SCHEDULING WITH PERIODIC TIME SLOTS Ondřej Čepeka and Shao Chin Sung b Received December May 12, 2003; revised February
Ant Colony Optimization and Constraint Programming
Ant Colony Optimization and Constraint Programming Christine Solnon Series Editor Narendra Jussien WILEY Table of Contents Foreword Acknowledgements xi xiii Chapter 1. Introduction 1 1.1. Overview of the
Math 143 - College Algebra (Online)
Math 143 - College Algebra (Online) 3 Credits Term: Instructor: Spring 2010 Ken Floyd (208) 732-6583 Office Location: Office Hours: Shields 206E 1-2 PM, M - F E-mail: kfloyd@csi.edu 10 AM - Noon Saturday
PES Institute of Technology-BSC QUESTION BANK
PES Institute of Technology-BSC Faculty: Mrs. R.Bharathi CS35: Data Structures Using C QUESTION BANK UNIT I -BASIC CONCEPTS 1. What is an ADT? Briefly explain the categories that classify the functions
CAD Algorithms. P and NP
CAD Algorithms The Classes P and NP Mohammad Tehranipoor ECE Department 6 September 2010 1 P and NP P and NP are two families of problems. P is a class which contains all of the problems we solve using
S. Muthusundari. Research Scholar, Dept of CSE, Sathyabama University Chennai, India e-mail: nellailath@yahoo.co.in. Dr. R. M.
A Sorting based Algorithm for the Construction of Balanced Search Tree Automatically for smaller elements and with minimum of one Rotation for Greater Elements from BST S. Muthusundari Research Scholar,
SIMS 255 Foundations of Software Design. Complexity and NP-completeness
SIMS 255 Foundations of Software Design Complexity and NP-completeness Matt Welsh November 29, 2001 mdw@cs.berkeley.edu 1 Outline Complexity of algorithms Space and time complexity ``Big O'' notation Complexity
Bicolored Shortest Paths in Graphs with Applications to Network Overlay Design
Bicolored Shortest Paths in Graphs with Applications to Network Overlay Design Hongsik Choi and Hyeong-Ah Choi Department of Electrical Engineering and Computer Science George Washington University Washington,
International Journal of Software and Web Sciences (IJSWS) www.iasir.net
International Association of Scientific Innovation and Research (IASIR) (An Association Unifying the Sciences, Engineering, and Applied Research) ISSN (Print): 2279-0063 ISSN (Online): 2279-0071 International
Krishna Institute of Engineering & Technology, Ghaziabad Department of Computer Application MCA-213 : DATA STRUCTURES USING C
Tutorial#1 Q 1:- Explain the terms data, elementary item, entity, primary key, domain, attribute and information? Also give examples in support of your answer? Q 2:- What is a Data Type? Differentiate
Topic: Greedy Approximations: Set Cover and Min Makespan Date: 1/30/06
CS880: Approximations Algorithms Scribe: Matt Elder Lecturer: Shuchi Chawla Topic: Greedy Approximations: Set Cover and Min Makespan Date: 1/30/06 3.1 Set Cover The Set Cover problem is: Given a set of
V. Adamchik 1. Graph Theory. Victor Adamchik. Fall of 2005
V. Adamchik 1 Graph Theory Victor Adamchik Fall of 2005 Plan 1. Basic Vocabulary 2. Regular graph 3. Connectivity 4. Representing Graphs Introduction A.Aho and J.Ulman acknowledge that Fundamentally, computer
Approximation Algorithms
Approximation Algorithms or: How I Learned to Stop Worrying and Deal with NP-Completeness Ong Jit Sheng, Jonathan (A0073924B) March, 2012 Overview Key Results (I) General techniques: Greedy algorithms
Please consult the Department of Engineering about the Computer Engineering Emphasis.
COMPUTER SCIENCE Computer science is a dynamically growing discipline. ABOUT THE PROGRAM The Department of Computer Science is committed to providing students with a program that includes the basic fundamentals
5.1 Bipartite Matching
CS787: Advanced Algorithms Lecture 5: Applications of Network Flow In the last lecture, we looked at the problem of finding the maximum flow in a graph, and how it can be efficiently solved using the Ford-Fulkerson
Discuss the size of the instance for the minimum spanning tree problem.
3.1 Algorithm complexity The algorithms A, B are given. The former has complexity O(n 2 ), the latter O(2 n ), where n is the size of the instance. Let n A 0 be the size of the largest instance that can
5 INTEGER LINEAR PROGRAMMING (ILP) E. Amaldi Fondamenti di R.O. Politecnico di Milano 1
5 INTEGER LINEAR PROGRAMMING (ILP) E. Amaldi Fondamenti di R.O. Politecnico di Milano 1 General Integer Linear Program: (ILP) min c T x Ax b x 0 integer Assumption: A, b integer The integrality condition
Table 1. Summary of CSIS PhD Program Requirements
Table 1. Summary of CSIS PhD Program Requirements Program requirement MS degree credit 30 PhD courses in same unit 9 PhD courses in other unit 3 Research methodology courses 12 or 15 Breadth CSIS courses
Offline sorting buffers on Line
Offline sorting buffers on Line Rohit Khandekar 1 and Vinayaka Pandit 2 1 University of Waterloo, ON, Canada. email: rkhandekar@gmail.com 2 IBM India Research Lab, New Delhi. email: pvinayak@in.ibm.com
Many algorithms, particularly divide and conquer algorithms, have time complexities which are naturally
Recurrence Relations Many algorithms, particularly divide and conquer algorithms, have time complexities which are naturally modeled by recurrence relations. A recurrence relation is an equation which
MATHEMATICS Unit Decision 1
General Certificate of Education January 2008 Advanced Subsidiary Examination MATHEMATICS Unit Decision 1 MD01 Tuesday 15 January 2008 9.00 am to 10.30 am For this paper you must have: an 8-page answer
Near Optimal Solutions
Near Optimal Solutions Many important optimization problems are lacking efficient solutions. NP-Complete problems unlikely to have polynomial time solutions. Good heuristics important for such problems.
MATHEMATICS Unit Decision 1
General Certificate of Education January 2007 Advanced Subsidiary Examination MATHEMATICS Unit Decision 1 MD01 Tuesday 16 January 2007 9.00 am to 10.30 am For this paper you must have: an 8-page answer
8.1 Min Degree Spanning Tree
CS880: Approximations Algorithms Scribe: Siddharth Barman Lecturer: Shuchi Chawla Topic: Min Degree Spanning Tree Date: 02/15/07 In this lecture we give a local search based algorithm for the Min Degree
Fundamentals of algorithms
CHAPTER Fundamentals of algorithms 4 Chung-Yang (Ric) Huang National Taiwan University, Taipei, Taiwan Chao-Yue Lai National Taiwan University, Taipei, Taiwan Kwang-Ting (Tim) Cheng University of California,
WOLLONGONG COLLEGE AUSTRALIA. Diploma in Information Technology
First Name: Family Name: Student Number: Class/Tutorial: WOLLONGONG COLLEGE AUSTRALIA A College of the University of Wollongong Diploma in Information Technology Final Examination Spring Session 2008 WUCT121
Dynamic programming formulation
1.24 Lecture 14 Dynamic programming: Job scheduling Dynamic programming formulation To formulate a problem as a dynamic program: Sort by a criterion that will allow infeasible combinations to be eli minated
Chapter 1. NP Completeness I. 1.1. Introduction. By Sariel Har-Peled, December 30, 2014 1 Version: 1.05
Chapter 1 NP Completeness I By Sariel Har-Peled, December 30, 2014 1 Version: 1.05 "Then you must begin a reading program immediately so that you man understand the crises of our age," Ignatius said solemnly.
University of Pune Revised Structure for the B. Sc. (Computer Science) Course (Second Year to be implemented from Academic Year 2014-2015)
University of Pune Revised Structure for the B. Sc. (Computer Science) Course (Second Year to be implemented from Academic Year 2014-2015) S. Y. B. Sc. (Computer Science) No Paper Title: Semester I Title:
Binary Search Trees CMPSC 122
Binary Search Trees CMPSC 122 Note: This notes packet has significant overlap with the first set of trees notes I do in CMPSC 360, but goes into much greater depth on turning BSTs into pseudocode than
CSC2420 Spring 2015: Lecture 3
CSC2420 Spring 2015: Lecture 3 Allan Borodin January 22, 2015 1 / 1 Announcements and todays agenda Assignment 1 due next Thursday. I may add one or two additional questions today or tomorrow. Todays agenda
Florida Math for College Readiness
Core Florida Math for College Readiness Florida Math for College Readiness provides a fourth-year math curriculum focused on developing the mastery of skills identified as critical to postsecondary readiness
A Fast Algorithm For Finding Hamilton Cycles
A Fast Algorithm For Finding Hamilton Cycles by Andrew Chalaturnyk A thesis presented to the University of Manitoba in partial fulfillment of the requirements for the degree of Masters of Science in Computer
Fast Sequential Summation Algorithms Using Augmented Data Structures
Fast Sequential Summation Algorithms Using Augmented Data Structures Vadim Stadnik vadim.stadnik@gmail.com Abstract This paper provides an introduction to the design of augmented data structures that offer
Classification - Examples
Lecture 2 Scheduling 1 Classification - Examples 1 r j C max given: n jobs with processing times p 1,...,p n and release dates r 1,...,r n jobs have to be scheduled without preemption on one machine taking
MAC2233, Business Calculus Reference # 722957, RM 2216 TR 9:50AM 11:05AM
Instructor: Jakeisha Thompson Email: jthompso@mdc.edu Phone: 305-237-3347 Office: 1543 Office Hours Monday Tuesday Wednesday Thursday Friday 7:30AM 8:15AM 12:30PM 2:00PM 7:30AM 9:30AM 7:30AM 8:15AM 12:30PM
Heuristic Methods. Part #1. João Luiz Kohl Moreira. Observatório Nacional - MCT COAA. Observatório Nacional - MCT 1 / 14
Heuristic Methods Part #1 João Luiz Kohl Moreira COAA Observatório Nacional - MCT Observatório Nacional - MCT 1 / Outline 1 Introduction Aims Course's target Adviced Bibliography 2 Problem Introduction
STAT 1403 College Algebra Dr. Myron Rigsby Fall 2013 Section 0V2 crn 457 MWF 9:00 am
MATH 1403 College Algebra/ Rigsby/ Fall 2013 Page 1 Credit Hours: 3 Lecture Hours: 3 University of Arkansas Fort Smith 5210 GRAND AVENUE P.O. BOX 3649 FORT SMITH, AR 72913-3649 479-788-7000 Syllabus and
Research Tools & Techniques
Research Tools & Techniques for Computer Engineering Ron Sass http://www.rcs.uncc.edu/ rsass University of North Carolina at Charlotte Fall 2009 1/ 106 Overview of Research Tools & Techniques Course What
Key words. multi-objective optimization, approximate Pareto set, bi-objective shortest path
SMALL APPROXIMATE PARETO SETS FOR BI OBJECTIVE SHORTEST PATHS AND OTHER PROBLEMS ILIAS DIAKONIKOLAS AND MIHALIS YANNAKAKIS Abstract. We investigate the problem of computing a minimum set of solutions that
International Journal of Advanced Research in Computer Science and Software Engineering
Volume 3, Issue 7, July 23 ISSN: 2277 28X International Journal of Advanced Research in Computer Science and Software Engineering Research Paper Available online at: www.ijarcsse.com Greedy Algorithm:
Why Study NP- hardness. NP Hardness/Completeness Overview. P and NP. Scaling 9/3/13. Ron Parr CPS 570. NP hardness is not an AI topic
Why Study NP- hardness NP Hardness/Completeness Overview Ron Parr CPS 570 NP hardness is not an AI topic It s important for all computer scienhsts Understanding it will deepen your understanding of AI
CSE 326, Data Structures. Sample Final Exam. Problem Max Points Score 1 14 (2x7) 2 18 (3x6) 3 4 4 7 5 9 6 16 7 8 8 4 9 8 10 4 Total 92.
Name: Email ID: CSE 326, Data Structures Section: Sample Final Exam Instructions: The exam is closed book, closed notes. Unless otherwise stated, N denotes the number of elements in the data structure
CHOOSING THE BEST HEURISTIC FOR A NP-PROBLEM
CHOOSING THE BEST HEURISTIC FOR A NP-PROBLEM Thesis submitted in partial fulfillment of the requirements for the award of Degree of Master of Engineering in Computer Science and Engineering Thapar University,
Answer: (a) Since we cannot repeat men on the committee, and the order we select them in does not matter, ( )
1. (Chapter 1 supplementary, problem 7): There are 12 men at a dance. (a) In how many ways can eight of them be selected to form a cleanup crew? (b) How many ways are there to pair off eight women at the
Cost Model: Work, Span and Parallelism. 1 The RAM model for sequential computation:
CSE341T 08/31/2015 Lecture 3 Cost Model: Work, Span and Parallelism In this lecture, we will look at how one analyze a parallel program written using Cilk Plus. When we analyze the cost of an algorithm
Model 2.4 Faculty member + student
Model 2.4 Faculty member + student Course syllabus for Formal languages and Automata Theory. Faculty member information: Name of faculty member responsible for the course Office Hours Office Number Email
Chapter 1. Computation theory
Chapter 1. Computation theory In this chapter we will describe computation logic for the machines. This topic is a wide interdisciplinary field, so that the students can work in an interdisciplinary context.
Decision Mathematics D1. Advanced/Advanced Subsidiary. Friday 12 January 2007 Morning Time: 1 hour 30 minutes. D1 answer book
Paper Reference(s) 6689/01 Edexcel GCE Decision Mathematics D1 Advanced/Advanced Subsidiary Friday 12 January 2007 Morning Time: 1 hour 30 minutes Materials required for examination Nil Items included
Decision Mathematics D1 Advanced/Advanced Subsidiary. Tuesday 5 June 2007 Afternoon Time: 1 hour 30 minutes
Paper Reference(s) 6689/01 Edexcel GCE Decision Mathematics D1 Advanced/Advanced Subsidiary Tuesday 5 June 2007 Afternoon Time: 1 hour 30 minutes Materials required for examination Nil Items included with
SYLLABUS MAC 1105 COLLEGE ALGEBRA Spring 2011 Tuesday & Thursday 12:30 p.m. 1:45 p.m.
SYLLABUS MAC 1105 COLLEGE ALGEBRA Spring 2011 Tuesday & Thursday 12:30 p.m. 1:45 p.m. Instructor: Val Mohanakumar Office Location: Office Phone #: 253 7351 Email: vmohanakumar@hccfl.edu Webpage: http://www.hccfl.edu/faculty-info/vmohanakumar.aspx.
Eastern Washington University Department of Computer Science. Questionnaire for Prospective Masters in Computer Science Students
Eastern Washington University Department of Computer Science Questionnaire for Prospective Masters in Computer Science Students I. Personal Information Name: Last First M.I. Mailing Address: Permanent
YEAR 10, 11 AND 12 SEMESTER ONE 2016 EXAMINATION TIMETABLE 2½hr (3hr) 3hr 3hr (3hr) 2½hr (3hr) (3hr) Practical 2hr 2½hr 2hr) (2hr) (2hr) 1hr 2½hr) 3hr 2½hr 1½hr 1½hr 2hr 2hr 3hr 3hr 2½hr 3hr 2½hr 3hr 3hr
Computer Science/Software Engineering
292 School of Science and Engineering Computer Science/Software Engineering Everald E. Mills, PhD, Chair Objectives The computer science program seeks to prepare students for careers that require sophisticated
Scheduling Single Machine Scheduling. Tim Nieberg
Scheduling Single Machine Scheduling Tim Nieberg Single machine models Observation: for non-preemptive problems and regular objectives, a sequence in which the jobs are processed is sufficient to describe
CSE373: Data Structures and Algorithms Lecture 3: Math Review; Algorithm Analysis. Linda Shapiro Winter 2015
CSE373: Data Structures and Algorithms Lecture 3: Math Review; Algorithm Analysis Linda Shapiro Today Registration should be done. Homework 1 due 11:59 pm next Wednesday, January 14 Review math essential
Scheduling Shop Scheduling. Tim Nieberg
Scheduling Shop Scheduling Tim Nieberg Shop models: General Introduction Remark: Consider non preemptive problems with regular objectives Notation Shop Problems: m machines, n jobs 1,..., n operations
Computational complexity theory
Computational complexity theory Goal: A general theory of the resources needed to solve computational problems What types of resources? Time What types of computational problems? decision problem Decision
Introduction to Algorithms March 10, 2004 Massachusetts Institute of Technology Professors Erik Demaine and Shafi Goldwasser Quiz 1.
Introduction to Algorithms March 10, 2004 Massachusetts Institute of Technology 6.046J/18.410J Professors Erik Demaine and Shafi Goldwasser Quiz 1 Quiz 1 Do not open this quiz booklet until you are directed
Discrete Mathematics Problems
Discrete Mathematics Problems William F. Klostermeyer School of Computing University of North Florida Jacksonville, FL 32224 E-mail: wkloster@unf.edu Contents 0 Preface 3 1 Logic 5 1.1 Basics...............................
340368 - FOPR-I1O23 - Fundamentals of Programming
Coordinating unit: 340 - EPSEVG - Vilanova i la Geltrú School of Engineering Teaching unit: 723 - CS - Department of Computer Science Academic year: Degree: 2015 BACHELOR'S DEGREE IN INFORMATICS ENGINEERING
Load Balancing. Load Balancing 1 / 24
Load Balancing Backtracking, branch & bound and alpha-beta pruning: how to assign work to idle processes without much communication? Additionally for alpha-beta pruning: implementing the young-brothers-wait
IE 680 Special Topics in Production Systems: Networks, Routing and Logistics*
IE 680 Special Topics in Production Systems: Networks, Routing and Logistics* Rakesh Nagi Department of Industrial Engineering University at Buffalo (SUNY) *Lecture notes from Network Flows by Ahuja, Magnanti
P versus NP, and More
1 P versus NP, and More Great Ideas in Theoretical Computer Science Saarland University, Summer 2014 If you have tried to solve a crossword puzzle, you know that it is much harder to solve it than to verify