Introduction to Computer Science and Computing Systems
CSC 101 (Introduction to Computer Science and Computing Systems) is the foundational introductory computer science course for undergraduate students in the Department of Computer Science and related STEM departments at Delta State University (DELSU). It establishes the intellectual and technical bedrock of computing—spanning the historical evolution of computers, computational thinking, binary number systems, digital logic gates, hardware architecture, operating system fundamentals, and basic algorithmic problem-solving.
Credit Units
3 Units (NUC Standard)
Academic Level
100 Level (First Sem)
Assessment
30% CA + 70% Exam
Syllabus Scope
5 Detailed Modules
What This Course Is All About
Academic importance, curriculum placement & degree purpose
Understanding how computers process bits, execute machine cycles, organize memory hierarchies, and parse algorithms is essential before writing advanced software in C++, Python, or Java. CSC 101 transforms you from a computer user into a computer scientist.
The course begins with computing history (Babbage, Lovelace, Turing, Von Neumann) and computer generations (vacuum tubes to VLSI/microprocessors). It then covers number systems and arithmetic conversions, Boolean algebra and combinational logic circuits, central processing unit (CPU) architecture, system vs application software, networking fundamentals, and an introduction to pseudocode and flowcharts.
Prerequisites & Entry Expectations
O'Level SSC credit passes in required departmental subjects (English, Mathematics and relevant sciences/arts).
Official Syllabus & Modular Breakdown
Comprehensive unit-by-unit curriculum topics taught at Delta State University
Computing History, Generations & Classifications
The historical lineage of computational devices and architectural milestones in hardware engineering.
Key Topics Covered:
- Mechanical and electromechanical precursors: Abacus, Pascaline, Babbage's Analytical Engine
- The 1st to 5th generations of digital electronic computers
- Classification of computers: By size/power (Supercomputers, Mainframes, Minis, Microcomputers) and by data handling (Analog, Digital, Hybrid)
- Von Neumann architecture: ALU, Control Unit, Registers, Memory, and System Buses
Number Systems, Binary Arithmetic & Data Representation
Mathematical representation of numeric, alphanumeric, and multimedia data in digital computing circuits.
Key Topics Covered:
- Positional number systems: Decimal (Base 10), Binary (Base 2), Octal (Base 8), and Hexadecimal (Base 16)
- Inter-base conversions and fractional binary representations
- Binary arithmetic: Addition, subtraction, multiplication, and division
- Signed numbers representation: Sign-magnitude, 1's Complement, and 2's Complement
- Character encoding schemes: ASCII, EBCDIC, and Unicode (UTF-8, UTF-16)
Digital Logic, Boolean Algebra & Gate Circuits
Foundational digital circuitry principles that form the basis of microprocessors and memory chips.
Key Topics Covered:
- Fundamental logic gates: AND, OR, NOT (Inverter)
- Universal and derived gates: NAND, NOR, XOR, XNOR
- Boolean algebra postulates, identities, and De Morgan's Laws
- Truth tables, Boolean function simplification, and Karnaugh Maps (K-Maps basics)
- Basic combinational circuits: Half Adders and Full Adders
Hardware Anatomy & The Machine Instruction Cycle
In-depth analysis of physical computer subsystems and execution mechanics.
Key Topics Covered:
- The CPU: Arithmetic Logic Unit (ALU), Control Unit (CU), Program Counter (PC), Instruction Register (IR)
- The Fetch-Decode-Execute machine cycle and clock speed
- Memory hierarchy: Registers, Cache (L1/L2/L3), RAM (SRAM/DRAM), ROM (PROM, EPROM), and Secondary Storage (SSD/HDD)
- Input/Output (I/O) interfaces, device controllers, and Direct Memory Access (DMA)
System Software, Networking & Algorithmic Foundations
Software operating layers, basic internet protocols, and structured algorithm design.
Key Topics Covered:
- Operating Systems: Process management, memory allocation, file systems, and user interfaces (CLI vs GUI)
- Translators: Compilers, Interpreters, and Assemblers
- Computer Networks: Topologies (Star, Bus, Ring, Mesh), LAN/WAN, OSI 7-Layer model basics, and IP addressing
- Algorithmic design: Properties of algorithms, structured pseudocode, and standard flowchart symbols
Core Theoretical Concepts & Mechanisms
Key academic principles, equations, and methodologies students must master in CSC 101
Von Neumann Architecture
A computer design architecture featuring a single shared memory store for both program instructions and data, connected to the CPU via a common bus system.
Exam Significance: The universal theoretical template underlying virtually all modern personal computers, servers, and mobile microprocessors.
Two's Complement Arithmetic
A binary encoding technique where negative integers are represented by inverting all bits (1's complement) and adding 1 to the least significant bit (LSB).
Exam Significance: Allows computer ALUs to perform subtraction using standard addition circuitry, avoiding redundant hardware.
The Fetch-Decode-Execute Cycle
The continuous hardware operational sequence wherein the CPU fetches an instruction opcode from RAM, decodes it into control signals, and executes the operation.
Exam Significance: The core heartbeat of all program execution in microprocessor systems.
Universal Logic Gates (NAND / NOR)
Logic gates that can be configured to reproduce the behavior of any other basic logic gate (AND, OR, NOT) without requiring other components.
Exam Significance: Fundamental to semiconductor manufacturing and integrated circuit fabrication.
Expected Learning Outcomes
Skills, competencies, and practical capabilities you will acquire upon completion
Convert accurately between Decimal, Binary, Octal, and Hexadecimal number systems and perform two's complement binary arithmetic.
Construct truth tables and simplify Boolean algebraic expressions using algebraic laws and basic Karnaugh mapping.
Explain the physical and logical interaction between CPU registers, cache, RAM, and storage during instruction execution.
Distinguish between compilers, interpreters, and operating system kernels in terms of execution speed and memory management.
Design verified pseudocode algorithms and standard flowcharts to solve structured mathematical and logical problems.
Grading Structure & Exam Success Guide
DELSU official grading breakdown and tested strategies to score an 'A' grade
Continuous Assessment (CA — 30%)
- •15 Marks: Mid-semester written test / CBT on number systems and digital logic.
- •10 Marks: Practical laboratory assignment on logic gates and algorithm flowcharts.
- •5 Marks: Class attendance and lab participation.
Semester Examination (70%)
Theory and calculation examination comprising two sections: Section A (Compulsory calculation questions on base conversions and truth tables) and Section B (Choice of 3 descriptive questions on architecture and systems).
Top Strategies for Scoring an 'A' in CSC 101
- Show all intermediate working steps clearly when solving two's complement and base conversion questions—step marks account for 70% of calculation scores.
- Memorize all Boolean algebraic identities and De Morgan's laws to simplify Boolean circuits quickly.
- Practice drawing clean, correctly labeled flowchart symbols (diamonds for decisions, rectangles for processes, parallelograms for I/O).
Recommended Textbooks & Literature
Computer Science: An Overview
By J. Glenn Brookshear & Dennis Brylow
Pearson
Digital Logic and Computer Design
By M. Morris Mano
Prentice Hall
Understanding Computers: Today and Tomorrow
By Deborah Morley & Charles S. Parker
Cengage Learning
Career Relevance & Professional Pathways
How this course applies to professional careers and accreditations
Software Engineer / Developer
Tech & Software DevelopmentBuilds scalable applications, backend APIs, and systems with deep awareness of memory usage and algorithm efficiency.
Systems Architect & Embedded Systems Engineer
Semiconductors & IoTDesigns firmware, microcontrollers, and hardware-software interfaces leveraging digital logic principles.
Cybersecurity Analyst
Information SecurityAnalyzes system architecture vulnerabilities, binary memory overflows, and network packet structures.
Semester Study Roadmap
Recommended weekly pacing for lectures, CA assignments, and final exam revision
Weeks 1-3: Hardware & Number Systems
Mastering base conversions and binary arithmetic.
- Practice 30 base conversion problems (Decimal to Binary, Octal, Hex).
- Solve 10 two's complement subtraction problems.
Weeks 4-7: Logic Gates & Boolean Algebra
Constructing truth tables and simplifying logic circuits.
- Draw truth tables for all 7 standard logic gates.
- Simplify Boolean expressions using De Morgan's laws.
Weeks 8-12: Architecture, Flowcharts & Revision
Von Neumann cycle, memory hierarchy, and algorithm design.
- Draw flowcharts for quadratic equation solver and sorting algorithms.
- Review past 5 years of DELSU CSC 101 semester exam questions.
Lecture Notes & Handouts
Official study materials and departmental slides for CSC 101
CSC 101 Lecture Notes: Binary Arithmetic & Logic Gates
Past Examination Papers
Verified DELSU past semester question papers for CSC 101
2023/2024
First Semester2022/2023
First SemesterFrequently Asked Questions about CSC 101
Answers to common student questions on course registration, difficulty, and exams
Does CSC 101 require prior programming experience before admission?
No, CSC 101 assumes zero prior coding experience. It starts from fundamental principles of computing, logic, and hardware before moving to algorithmic logic. Actual coding in Python/C++ begins in CSC 102 and CSC 201.
What is the most challenging part of CSC 101 for DELSU students?
Most students find Number Systems conversions (especially fractional binary to octal/hexadecimal) and Two's Complement arithmetic the most challenging. Regular calculation practice is key.
What courses require CSC 101 as a prerequisite?
CSC 101 is the direct prerequisite for CSC 102 (Problem Solving & Python), CSC 201 (Computer Programming I), and CSC 205 (Operating Systems I).