CREDIT AND TEACHING-HOUR FRAMEWORK

For this proposed curriculum:

• Theory Course: Normally 3–4 credits
• Laboratory Course: Normally 2 credits
• Teaching Semester: Approximately 13–15 instructional weeks
• Theory Session: 3–4 hours per week depending on credits
• Laboratory: 4 practical hours per week for a 2-credit laboratory
• Internship: Supervised industry placement
• Capstone Project: Independent/project-based supervised learning

Note: Final credits, contact hours, examinations, and degree requirements must be approved by the awarding university.

YEAR 1

SEMESTER 1

CS101 – Fundamentals of Computer Science

4 Credits | 4 Hours/Week | Approx. 52 Contact Hours

Unit 1 – Introduction to Computers – 10 Hours

• History and generations of computers
• Types of computers
• Computer applications
• Hardware and software concepts

Unit 2 – Computer Hardware – 10 Hours

• CPU
• Memory
• Storage devices
• Input/output devices

Unit 3 – Number Systems & Data Representation – 10 Hours

• Binary
• Decimal
• Octal
• Hexadecimal
• Data representation

Unit 4 – Software & Operating Systems – 10 Hours

• System software
• Application software
• Operating systems
• File management

Unit 5 – Internet & Emerging Technologies – 12 Hours

• Internet fundamentals
• Cloud computing
• Artificial Intelligence
• Cybersecurity
• IoT
• Digital ethics

CS102 – Programming Fundamentals with C

4 Credits | 4 Hours/Week | 52 Contact Hours

Unit 1 – Programming Fundamentals – 10 Hours

• Problem solving
• Algorithms
• Flowcharts
• C program structure

Unit 2 – Data Types & Control Structures – 10 Hours

• Variables
• Operators
• If/else
• Switch
• Loops

Unit 3 – Arrays & Strings – 10 Hours

• One-dimensional arrays
• Multidimensional arrays
• String manipulation

Unit 4 – Functions & Pointers – 12 Hours

• Functions
• Parameter passing
• Recursion
• Pointers

Unit 5 – Structures & Files – 10 Hours

• Structures
• Unions
• File handling
• Practical applications

SEMESTER 2

CS201 – Data Structures & Algorithms

Unit 1 – Introduction to Data Structures – 10 Hours

• Data structures
• Abstract data types
• Complexity
• Arrays

Unit 2 – Linked Lists – 10 Hours

• Singly linked lists
• Doubly linked lists
• Circular lists

Unit 3 – Stacks & Queues – 10 Hours

• Stack operations
• Queue operations
• Applications

Unit 4 – Trees & Graphs – 12 Hours

• Binary trees
• Binary search trees
• Graph representation
• Graph traversal

Unit 5 – Searching & Sorting – 10 Hours

• Linear search
• Binary search
• Bubble sort
• Selection sort
• Insertion sort
• Introduction to advanced sorting