The purpose of this course is to introduce fundamental concepts of heuristics in solving various optimization problems with emphasis on metaheuristics. The topics include basic heuristic constructs (greedy, improvement, construction); metaheuristics such as simulated annealing, tabu search, genetic algorithms, ant algorithms and their hybrids.
By the end of this course students should be able to design and implement efficient algorithms to solve complex optimization problems across a diverse range of applications, such as networking, bioinformatics, routing and scheduling, etc.

This course continues the coverage of the fundamental concepts of Object Oriented Programming started in Programming I (CSC 111). It covers more advanced concepts and topics such as relationships between classes, inheritance, polymorphism, abstract classes, error handling, interfaces, generics and data structures such as linked lists, stacks and queues, in addition to graphical user interface.

- See more at: http://fac.ksu.edu.sa/mifawzi/course/69119#sthash.moNjmDcd.dpuf

This course aims at preparing students to comfortably indulge in research for their graduation projects and theses. It sets the groundwork of the logic of inquiry.  It adopts a systematic research methodology starting by a selection of a topic in the computer science disciplines and collecting a comprehensive list of references for it through the search of available information resources.