Course module NWI-IBC028 Credits (ECTS) 3 Category BA (Bachelor) Language of instruction English Offered by Radboud University; Faculty of Science; Informatica en Informatiekunde; Lecturer(s) Previous 1-5 of 76-7 of 7 Next 2 Lecturer D. Rodrigues do Vale, MSc Other course modules lecturer Lecturer R.T.C. Turkenburg Other course modules lecturer Lecturer N.M. van der Weide Other course modules lecturer Examiner dr. A.A. Westerbaan Other course modules lecturer Lecturer dr. A.A. Westerbaan Other course modules lecturer Academic year 2021 Period KW4   (11/04/2022 to 31/08/2022) Starting block KW4 Course mode full-time Remarks - Registration using OSIRIS Yes Course open to students from other faculties Yes Pre-registration No Waiting list No Placement procedure -

	Aims Be able to analyze efficiency of various algorithms and be able to prove NP-completeness of several decision problems. Content Complexity is about efficiency of algorithms. On the one hand methods are presented to establish this efficiency  for concrete algorithms, in particular by analyzing and solving underlying recurrence relations.  On the other hand for various problems existence of efficient algorithms is argued to be unlikely by proving NP-completeness. Instructional Modes Lecture Tutorial Self-study   Level Presumed foreknowledge NWI-IBC027 Algorithms and Datastructures Test information This course is completed by means of a written exam. It is a ' closed book' exam, which means that no books, notes or other materials may be used during the exam. Specifics
	Required materials Book Introduction to Algorithms, Thomas H. Cormen, Charles E. Leiserson, Ronald L. Rivest and Clifford Stein, MIT Press, Third Edition, 2009 Material not covered by this book has been collected in own lecture notes. Instructional modes Course Tests Exam Test weight 1 Test type Exam Opportunities Block KW4, Block KW4