Computer Programing II(MAT132)
| Course Code | Course Name | Semester | Theory | Practice | Lab | Credit | ECTS |
|---|---|---|---|---|---|---|---|
| MAT132 | Computer Programing II | 2 | 3 | 0 | 0 | 3 | 3 |
| Prerequisites | |
| Admission Requirements |
| Language of Instruction | French |
| Course Type | Compulsory |
| Course Level | Bachelor Degree |
| Course Instructor(s) | Utku Kabuli AYTAÇ uk.aytac@gmail.com (Email) |
| Assistant | |
| Objective | To teach students Python programming language Abstract Data Types for data structures and their use in algorithms. |
| Content |
1) Basic Python Programming (review)- as a remainder of BP 1 (MAT131) 2) An overview of Collections 3) Searching, Sorting and Complexity Analysis 4) Arrays and Link Structures 5) Interfaces, Implementations, and Polymorphism 6) Inheritance and Abstract Classes 7) Stacks 8) Queues 9) Lists 10) Trees 11) Sets and Dictionaries 12) Graphs |
| Course Learning Outcomes | Using the studied data structures (as a toolbox) students will be able to use ADTs in developing solutions to programming problems. |
| Teaching and Learning Methods | Presentations, home works, programming assignments. |
| References | Kenneth A. Lambert,"Fundamentals of Python Data Structures". |
Theory Topics
| Week | Weekly Contents |
|---|
Practice Topics
| Week | Weekly Contents |
|---|
Contribution to Overall Grade
| Number | Contribution | |
|---|---|---|
| Contribution of in-term studies to overall grade | 1 | 40 |
| Contribution of final exam to overall grade | 1 | 60 |
| Toplam | 2 | 100 |
In-Term Studies
| Number | Contribution | |
|---|---|---|
| Assignments | 0 | 0 |
| Presentation | 0 | 0 |
| Midterm Examinations (including preparation) | 0 | 0 |
| Project | 0 | 0 |
| Laboratory | 0 | 0 |
| Other Applications | 0 | 0 |
| Quiz | 0 | 0 |
| Term Paper/ Project | 0 | 0 |
| Portfolio Study | 0 | 0 |
| Reports | 0 | 0 |
| Learning Diary | 0 | 0 |
| Thesis/ Project | 0 | 0 |
| Seminar | 0 | 0 |
| Other | 0 | 0 |
| Toplam | 0 | 0 |
| No | Program Learning Outcomes | Contribution | ||||
|---|---|---|---|---|---|---|
| 1 | 2 | 3 | 4 | 5 | ||
| 1 | understands principles of deductive reasoning; has experience to verify well-foundedness and exactness of mathematical statements in systematic ways; | X | ||||
| 2 | can properly state and use concepts and results of major mathematical interest; | X | ||||
| 3 | masters current computational techniques and algorithms; has a good ability in their use; can identify relevant tools, among those one has learned, suitable to solve a problem and is able to judge whether or not one is in possession of these tools; | X | ||||
| 4 | is able to express one’s mathematical ideas in an organised way both in written and oral forms; | |||||
| 5 | understands relations connecting substantial concepts and results; can switch from one viewpoint to another on mathematical objects (pictures, formulae, precise statements, heuristic trials, list of examples,...); | X | ||||
| 6 | has followed individually a guided learning strategy; has pursued steps toward the resolution of unfamiliar problems; | |||||
| 7 | has a theoretical and practical knowledge in computer science well adapted for learning a programming language; | X | ||||
| 8 | has investigated the relevance of modeling and using mathematical tools in natural sciences and in the professional life; is conscious about historical development of mathematical notions; | X | ||||
| 9 | has followed introduction to some mathematical or non-mathematical disciplines after one’s proper choice; had experience to learn selected subjects according to one’s proper arrangement; | X | ||||
| 10 | masters French language as well as other foreign languages, to a level sufficient to study or work abroad. | X | ||||
| Activities | Number | Period | Total Workload |
|---|---|---|---|
| Total Workload | 0 | ||
| Total Workload / 25 | 0,00 | ||
| Credits ECTS | 0 | ||