Syllabus
Course purpose, learning expectations, and the provisional Fall 2026 plan.
Course information
Introduction to Computer Engineering and Career Planning
CSE 101 · 8 ECTS
Prof. Dr. Mehmet Göktürk · Fall 2026
Tuesday: 13:30–16:30 · Z23. Two approximately 80-minute blocks, principles followed by application/programming. Wednesday recitation: one hour, tentatively 16:30; room to be announced.
Course purpose
Understand how computers represent information, execute instructions, and interact with the physical world. Learn fundamental C programming while exploring computer engineering and career directions. The emphasis is on understanding, practice, and retaining the basics.
Learning outcomes
- Explain simple gates, number representation, memory and machine-program execution.
- Write and trace small C programs using numeric types, conditions, loops, functions and one-dimensional arrays.
- Explain and modify worked examples involving multidimensional arrays, pointers, structs, files, linked lists and hardware I/O.
- Recognize and compare unions, linked structures, trees and graphs; explain the advantage and prerequisites of binary search.
- Describe the roles of operating systems, networks, databases and security, and compare historical and contemporary approaches to AI.
- Test a program, explain design choices, and connect demonstrated skills with engineering career directions.
How deeply will we study each topic?
Understanding grows through repeated use. Not every topic requires an implementation from scratch.
- Do independently: small number/logic exercises, machine traces, core C expressions, conditions, loops, functions, one-dimensional arrays and simple debugging.
- Explain and modify: supplied examples of multidimensional arrays, pointers/strings, structs, files, Arduino behavior and a small singly linked list.
- Recognize, trace and compare: unions, doubly linked lists, trees, graphs, binary-search advantages and broader computer-engineering concepts.
Each activity will state its expected depth. Rows, columns and nested loops are introduced without assuming prior matrix knowledge.
Weekly PowerPoint decks and practice
CSE101 lecture decks are the primary teaching resource, published as PDF slides with companion HTML readings. They will include explanations, diagrams, worked examples, short exercises, recaps, and reading/video links. Published PDF slides and companion HTML readings support independent restudy.
Essential explanations and completed worked examples will be included in the deck so students can download and study it independently. The lecture page links to each available slide PDF and reading.
Recitation and lab handouts remain separate. Brief revisits to earlier topics are built into existing practice sessions rather than added as large extra assignments.
Course content
Foundations and number representation lead into assembly and then C/Arduino. Data types and structures are taught alongside C: integers and floating point, arrays and multidimensional arrays, structs and unions, pointers, linked lists, trees and graphs.
A dedicated theory block introduces AI’s past and present: symbolic approaches, expert systems, machine learning, neural networks and contemporary generative systems. Operating systems, databases, networks and security provide broader context. Career planning is an out-of-class activity, with materials and arrangements on the Career Planning page. Graphics and data compression are not scheduled units in this offering.
Provisional topic sequence. Week 1 begins with foundations, without VizMachine; lecture assembly is covered in Weeks 2–3 with lab consolidation in Week 4, and C/Arduino begins in Week 5. Weekly placement may change as the teaching pace and exam timetable are confirmed.
Assessment
| Component | Weight |
|---|---|
| Midterm | 30% |
| Quiz | 10% |
| Attendance | 5% |
| Term project | 10% |
| Assignments | 10% |
| Final examination | 35% |
| Total | 100% |
Assignment details, project milestones and exam dates will be announced separately.
Short quizzes use random student selection. The latest quiz grade is valid, and students not yet assessed are included in the final teaching week. Preparation topics will be communicated in advance. Brief revisits during practice complement this procedure.
Project festival
The project festival takes place after teaching ends, usually on Friday of the second week of final examinations. In some years it is held on a later Monday to allow a free weekend for collaboration. The exact date, time and venue for this offering will be announced separately.
Study resources and course policies
The weekly PPTX decks will be the core study material. An online textbook is being evaluated; no replacement textbook has been selected. Links will point to the exact readings when adopted.
AI is a theory topic in CSE101. For responsible use of AI tools in coursework, read the published CSE101 AI-use guidelines. Each assignment or lab brief will state its permitted assistance and collaboration rules.
Attendance requirements, late-work rules, exam dates and final submission details will be published once confirmed. Check the calendar for known holiday exceptions and the resources page for course-platform links.