Introduction to Computing Systems
Keep adding new skills with 10,000+ programs for $239 (usually $399). Save now.
Introduction to Computing Systems
Instructors: Nishit Narang
3,743 already enrolled
Included with
Learn more
Ask Coursera
13 reviews
Recommended experience
13 reviews
Recommended experience
What you'll learn
Outline the high-level structure of a computer and identify its basic building blocks.
Use combinational and sequential circuits built using logic gates to design the basic building blocks of a computer.
Examine a processor with a simple instruction set architecture and develop simple assembly language programs.
Details to know
73 assignments
See how employees at top companies are mastering in-demand skills
There are 6 modules in this course
Welcome to the "Introduction to Computing Systems" course! This course aims to teach you what a computer is and how it can be programmed. In this course, you will learn about the basic building blocks required to understand the structure of a computer. You will gain insights into numbers, bits, structures to implement operations on numbers, and structures to control the execution of commands by a computer. This course introduces you to logic gates and combinational and sequential circuits. You will learn about a simple processor design with a small instruction set architecture. You will also perform basic assembly programming with that processor. This course covers a wide variety of topics in computing systems that are designed to give you an overview of whatβs to come in the BITS Pilani BSc Computer Science degree program.
In this module, learners will explore the fundamental components and functions of digital computers, gaining a comprehensive understanding of how computers operate at their core. Students will delve into digital systems and number systems, learning how computers represent and process information using binary digits. The module covers number representation in digital computers and essential operations on bits, providing learners with the foundational knowledge necessary to understand how computers manipulate data at the most basic level.
What's included
10 videos3 readings10 assignments
10 videosβ’Total 77 minutes
- Course Intro videoβ’4 minutes
- Need for a Computerβ’5 minutes
- Components and Functions of a Computerβ’11 minutes
- Need for Digital Systems β’8 minutes
- Introduction to Number Systems β’9 minutes
- Binary Number Systemβ’14 minutes
- Operations on Binaryβ’8 minutes
- Twoβs Complement Representationβ’4 minutes
- Arithmetic Operation: Addition and Subtractionβ’7 minutes
- Logical Operation: AND, OR, NOT, XOR...β’7 minutes
3 readingsβ’Total 30 minutes
- Course Overviewβ’10 minutes
- Course Structure & Critical Informationβ’10 minutes
- Introduction to Digital Systems and Number Systemsβ’10 minutes
10 assignmentsβ’Total 83 minutes
- Test Yourself: Introduction to Digital Computersβ’30 minutes
- Practice Quiz: Need for a Computerβ’4 minutes
- Practice Quiz: Components and Functions of a Computerβ’6 minutes
- Practice Quiz: Need for Digital Systems β’4 minutes
- Practice Quiz: Introduction to Number Systems β’4 minutes
- Practice Quiz: Binary Number Systemβ’6 minutes
- Practice Quiz: Operations on Binary β’4 minutes
- Practice Quiz: Twoβs Complement Representationβ’6 minutes
- Practice Quiz: Logical Operation: AND, OR, NOT, XOR...β’4 minutes
- Let's Practice: Introduction to Digital Computersβ’15 minutes
In this module, learners will be introduced to Boolean algebra, the mathematical foundation underlying all digital logic systems and computer operations. Students will learn the principles and laws of Boolean algebra, understanding how logical operations are performed in digital circuits. The module focuses on gate-level minimization techniques, teaching learners how to optimize digital circuits for efficiency and performance, which is crucial for understanding how computers process logical operations and make decisions.
What's included
17 videos2 readings19 assignments
17 videosβ’Total 90 minutes
- Introduction to Boolean Algebraβ’5 minutes
- Important Boolean Algebra Termsβ’7 minutes
- Postulates of Boolean Algebra: Part 1β’5 minutes
- Postulates of Boolean Algebra: Part 2β’7 minutes
- Postulates of Boolean Algebra: Part 3β’4 minutes
- Boolean Algebra Theorems: Part 1β’4 minutes
- Boolean Algebra Theorems: Part 2β’5 minutes
- Boolean Algebra Theorems: Part 3β’4 minutes
- Boolean Algebra: Exercise 1β’4 minutes
- Boolean Functions: Standard and Canonical Forms β’5 minutes
- Deriving SOP and POS Expression from a Truth Tableβ’6 minutes
- Introduction to K-Map Methodβ’3 minutes
- Representation of SOP and POS on K-Mapβ’7 minutes
- Procedure for Boolean Expression Simplificationβ’7 minutes
- Two-Variable K-Mapβ’5 minutes
- Four-Variable K-Map β’7 minutes
- POS Expression Simplification Using Four-Variable K-Mapβ’4 minutes
2 readingsβ’Total 20 minutes
- Fundamentals of Boolean Algebra β’10 minutes
- Introduction to K-Mapβ’10 minutes
19 assignmentsβ’Total 119 minutes
- Test Yourself: Boolean Algebra and Gate level Minimization β’30 minutes
- Practice Quiz: Introduction to Boolean Algebraβ’4 minutes
- Practice Quiz: Important Boolean Algebra Termsβ’4 minutes
- Practice Quiz: Postulates of Boolean Algebra: Part 1β’4 minutes
- Practice Quiz: Postulates of Boolean Algebra: Part 2β’4 minutes
- Practice Quiz: Postulates of Boolean Algebra: Part 3β’4 minutes
- Practice Quiz: Boolean Algebra Theorems: Part 1 β’4 minutes
- Practice Quiz: Boolean Algebra Theorems: Part 2 β’4 minutes
- Practice Quiz: Boolean Algebra Theorems: Part 3 β’4 minutes
- Practice Quiz: Boolean Algebra: Exercise 1β’4 minutes
- Practice Quiz: Boolean Functions: Standard and Canonical Forms β’4 minutes
- Practice Quiz: Deriving SOP Expression from a Truth Tableβ’4 minutes
- Practice Quiz: Introduction to K-Map Methodβ’4 minutes
- Representation of SOP and POS on K-Mapβ’6 minutes
- Practice Quiz: Procedure for Boolean Expression Simplificationβ’4 minutes
- Practice Quiz: Two-Variable K-Mapβ’6 minutes
- Practice Quiz: Four-Variable K-Map β’6 minutes
- Practice Quiz: POS Expression Simplification Using Four-Variable K-Mapβ’4 minutes
- Let's Practice: Boolean Algebra and Gate level Minimization β’15 minutes
In this module, learners will explore both combinational and sequential logic circuits, which form the complete foundation of digital systems and computer architecture. Students will learn to design and analyze combinational circuits where outputs depend solely on current inputs, as well as sequential circuits that incorporate memory elements and time-dependent behavior. The module covers practical applications of both circuit types in computer systems, enabling learners to understand how computers perform arithmetic operations, store information, maintain state, and execute time-dependent operations essential for program execution.
What's included
16 videos2 readings18 assignments
16 videosβ’Total 87 minutes
- Introduction to Combinational Circuitsβ’4 minutes
- Half Adderβ’5 minutes
- Full Adderβ’5 minutes
- Decoderβ’5 minutes
- Encoderβ’3 minutes
- Applications of Decoder and Encoderβ’6 minutes
- Multiplexerβ’7 minutes
- Demultiplexerβ’6 minutes
- Applications of Multiplexer and Demultiplexerβ’7 minutes
- Introduction to Sequential Circuitsβ’5 minutes
- Storage Elements: RS Flip-Flopsβ’4 minutes
- Storage Elements: D Flip-Flopβ’5 minutes
- Introduction to Registersβ’4 minutes
- Concept of Memory: Address Space and Addressabilityβ’5 minutes
- Types of Memoryβ’11 minutes
- Example of Memory Unit: 4x2 Bit Memoryβ’5 minutes
2 readingsβ’Total 20 minutes
- Introduction to Combinational Circuitsβ’10 minutes
- Memoryβ’10 minutes
18 assignmentsβ’Total 97 minutes
- Test Yourself: Combinational and Sequential circuitsβ’30 minutes
- Practice Quiz: Introduction to Combinational Circuitsβ’2 minutes
- Practice Quiz: Half Adderβ’4 minutes
- Practice Quiz: Full Adderβ’4 minutes
- Practice Quiz: Decoderβ’4 minutes
- Practice Quiz: Encoderβ’4 minutes
- Practice Quiz: Applications of Decoder and Encoderβ’2 minutes
- Practice Quiz: Multiplexerβ’4 minutes
- Practice Quiz: Demultiplexerβ’2 minutes
- Practice Quiz: Applications of Multiplexer and Demultiplexerβ’2 minutes
- Practice Quiz: Introduction to Sequential Circuitsβ’4 minutes
- Practice Quiz: Storage Elements: RS Flip-Flopsβ’4 minutes
- Practice Quiz: Storage Element: D Flip-Flopβ’4 minutes
- Practice Quiz: Introduction to Registersβ’2 minutes
- Practice Quiz: Concept of Memory: Address Space and Addressabilityβ’2 minutes
- Practice Quiz: Types of Memoryβ’4 minutes
- Practice Quiz: Example of Memory Unit: 4x2 bit Memoryβ’4 minutes
- Let's Practice: Combinational and Sequential circuitsβ’15 minutes
In this module, learners will delve into the fundamental principles of computer organization and architecture, understanding how hardware components work together to form a complete computing system. Students will explore the structure and interconnection of major computer components including the CPU, memory hierarchy, input/output systems, and buses. The module provides insights into how architectural decisions impact system performance and functionality, preparing learners to understand the relationship between hardware design and software execution in modern computing systems.
What's included
7 videos2 readings9 assignments
7 videosβ’Total 61 minutes
- Von Neumann Architecture: Basic Componentsβ’10 minutes
- Von Neumann Bottleneckβ’5 minutes
- Harvard Architectureβ’5 minutes
- Introduction to LC-3β’8 minutes
- LC-3 as an Exampleβ’8 minutes
- Instruction Overviewβ’14 minutes
- Instruction Cycleβ’11 minutes
2 readingsβ’Total 20 minutes
- Von Neumann and Harvard Architectureβ’10 minutes
- Instruction Processingβ’10 minutes
9 assignmentsβ’Total 81 minutes
- Test Yourself: Computer Organization and Architectureβ’30 minutes
- Practice Quiz: Von Neumann Architecture: Basic Componentsβ’6 minutes
- Practice Quiz: Von Neumann Bottleneckβ’4 minutes
- Practice Quiz: Harvard Architectureβ’4 minutes
- Practice Quiz: Introduction to LC-3β’4 minutes
- Practice Quiz: LC-3 as an Exampleβ’6 minutes
- Practice Quiz: Instruction Overviewβ’6 minutes
- Practice Quiz: Instruction Cycleβ’6 minutes
- Let's Practice: Computer Organization and Architectureβ’15 minutes
In this module, learners will be introduced to the Instruction Set Architecture (ISA) of the LC-3 (Little Computer 3), a simplified computer model designed for educational purposes. Students will explore the LC-3's instruction set, addressing modes, and machine language format, gaining hands-on experience with how processors decode and execute instructions. The module provides a concrete foundation for understanding processor design and operation, bridging the gap between theoretical computer architecture concepts and practical implementation details essential for assembly programming.
What's included
7 videos2 readings9 assignments
7 videosβ’Total 63 minutes
- Memory Organization and Registersβ’8 minutes
- Instruction Format and Opcodes β’7 minutes
- Data Types and Addressing Modes β’7 minutes
- Condition Codesβ’3 minutes
- LC-3 Operate Instructionsβ’7 minutes
- LC-3 Data Movement Instructionsβ’17 minutes
- LC-3 Control Instructions β’13 minutes
2 readingsβ’Total 60 minutes
- LC-3 ISA Overviewβ’30 minutes
- LC-3 Instruction Setβ’30 minutes
9 assignmentsβ’Total 87 minutes
- Test Yourself: ISA of LC-3β’30 minutes
- Practice Quiz: Memory Organization and Registersβ’6 minutes
- Practice Quiz: Instruction Format and Opcodes β’6 minutes
- Practice Quiz: Data Types and Addressing Modes β’6 minutes
- Practice Quiz: Condition Codesβ’6 minutes
- Practice Quiz: LC-3 Operate Instructionsβ’6 minutes
- Practice Quiz: LC-3 Data Movement Instructionsβ’6 minutes
- Practice Quiz: LC-3 Control Instructions β’6 minutes
- Let's Practice: ISA of LC-3β’15 minutes
In this module, learners will engage in hands-on assembly language programming using the LC-3 instruction set, applying their knowledge of computer architecture in practical coding exercises. Students will learn to write, debug, and optimize assembly programs, understanding the direct relationship between high-level programming concepts and low-level machine operations. The module covers essential programming techniques in assembly language, enabling learners to appreciate how compilers translate high-level code into machine instructions and how efficient program execution depends on understanding underlying hardware capabilities.
What's included
6 videos2 readings8 assignments
6 videosβ’Total 53 minutes
- Structured Programming β’3 minutes
- Sequential, Conditional, and Iterative Constructsβ’8 minutes
- Subroutinesβ’11 minutes
- Problem to Program: Part 1β’7 minutes
- Problem to Program: Part 2β’13 minutes
- Problem to Program: Part 3β’11 minutes
2 readingsβ’Total 20 minutes
- Problem Solvingβ’10 minutes
- Course Summaryβ’10 minutes
8 assignmentsβ’Total 73 minutes
- Test Yourself: LC-3 Programmingβ’30 minutes
- Practice Quiz: Structured Programming β’4 minutes
- Practice Quiz: Sequential, Conditional, and Iterative Constructsβ’6 minutes
- Practice Quiz: Subroutinesβ’6 minutes
- Practice Quiz: Problem to Program: Part 1β’4 minutes
- Practice Quiz: Problem to Program: Part 2β’4 minutes
- Practice Quiz: Problem to Program: Part 3β’4 minutes
- Let's Practice: LC-3 Programmingβ’15 minutes
Build toward a degree
This course is part of the following degree program(s) offered by Birla Institute of Technology & Science, Pilani. If you are admitted and enroll, your completed coursework may count toward your degree learning and your progress can transfer with you.ΒΉ
Instructors
Why people choose Coursera for their career
Frequently asked questions
To access the course materials, assignments and to earn a Certificate, you will need to purchase the Certificate experience when you enroll in a course. You can try a Free Trial instead, or apply for Financial Aid. The course may offer 'Full Course, No Certificate' instead. This option lets you see all course materials, submit required assessments, and get a final grade. This also means that you will not be able to purchase a Certificate experience.
When you enroll in the course, you get access to all of the courses in the Specialization, and you earn a certificate when you complete the work. Your electronic Certificate will be added to your Accomplishments page - from there, you can print your Certificate or add it to your LinkedIn profile.
Yes. In select learning programs, you can apply for financial aid or a scholarship if you canβt afford the enrollment fee. If fin aid or scholarship is available for your learning program selection, youβll find a link to apply on the description page.
More questions
Financial aid available,
