Ethiopian Higher Education Exit Exam Preparation
Program Syllabus Overview
Duration: 2 Months and 15 Days
Department: Computer Science
Total Courses: 16
Schedule Breakdown:
Weeks 1-2: Core Programming Concepts, Advanced Topics in AI
Weeks 3-4: Software Engineering and Web Development
Weeks 5-6: Database Systems and Data Structures, Compilers
Weeks 7-8: Algorithms and Networking Fundamentals, Automata
Weeks 9-10: Operating Systems, Security, and Administration
Detailed Course Outline
Weeks 1-2: Core Programming Concepts
1. Computer Programming
o Introduction to basic concepts of c++
o Control structure
o Function
o Arrays and strings
o Pointers and References
o Object-Oriented Programming.
2. Operating Systems
o Introduction to operating system.
o Process management
o Memory management
o I/O management
o File management
o Security and Protection
3. Introduction to Artificial Intelligence
o AI concepts: Machine learning, neural networks, natural language processing
o Decision trees, clustering, reinforcement learning
Weeks 3-4: Software Engineering and Web Development
4. Software Engineering
o Overview of the Software Development Life Cycle (SDLC)
o Software process
o Requirements gathering and documentation
o Software Project management
5. Web Programming
o HTML5 and CSS3: Structure and styling of web pages
o JavaScript fundamentals: DOM manipulation, events
o Introduction to PHP
6. Computer Organization and Architecture
o Basics of computer architecture: CPU, memory hierarchy, I/O systems
o Instruction sets and assembly language programming
o Performance metrics: Throughput, latency, bottlenecks
Weeks 5-6: Database Systems and Data Structures
7. Introduction to Database Systems
o Introduction to database
o Database system architecture
o Database modeling
o Functional dependency and normalization
o Relational algebra
o Query processing and optimization
o Transition processing concepts and concurrency control techniques
o Database security and Authorization
o Distributed database system
8. Data Structures and Algorithms
o Overview of data structures: Arrays, Linked Lists, Stacks, Queues, Trees
o Algorithm complexity: Time and space complexity analysis (Big O notation)
o Common algorithms: Searching (binary search) and sorting (quick sort, merge
sort)
o Tree and Graph
9. Compiler Design
o Phases of compilation: Lexical analysis, syntax analysis, semantic analysis
o Parsing techniques: LL, LR parsing
o Code generation and optimization techniques
Weeks 7-8: Algorithms and Networking Fundamentals
10. Design and Analysis of Algorithms
o Problem-solving strategies: Greedy algorithms, Dynamic programming
o Complexity analysis: Best, worst, and average case
o NP-completeness and common NP problems
o Case studies: Analyze algorithms in real-world applications
11. Data Communication and Computer Networking
o OSI and TCP/IP models: Layers and functions
o Network protocols: Understanding HTTP, FTP, DNS, SMTP
o Basics of network security
12. Automata and Complexity Theory
o Finite automata: Definitions and applications
o Context-free grammars and pushdown automata
o Complexity classes: P, NP, NP-complete, and their implications
Weeks 9-10: Security and Network Administration
13. Computer Security
o Introduction to Security
o Computer threat
o Cryptography and Encryption Techniques
o Network Security
14. Network and System Administration
o System administration basics: User and group management, permissions
o Network configuration and monitoring tools
Final Review and Mock Exams
Comprehensive review sessions covering all topics.
Mock exams to simulate the examination experience.
Focused problem-solving workshops to address weak areas.
Instructors
M.r Gedion Yegebawal (BSC)
M.r Tofik Nesru (BSC)
M.r Berihun Tsegaye (BSC)
M.r Haileliul Mulu (BSC)
M.r Berhanu Negash (BSC)
Additional Resources
Recommended textbooks and online resources for each subject.
