ECE 120 - Introduction to Computing
|Introduction to Computing||ECE120||AB1||61612||OD||0||0900 - 0950||R|
|Introduction to Computing||ECE120||AB2||61615||OD||0||1000 - 1050||R|
|Introduction to Computing||ECE120||AB3||61616||OD||0||1100 - 1150||R|
|Introduction to Computing||ECE120||AB4||61617||OD||0||1200 - 1250||R|
|Introduction to Computing||ECE120||AB5||61618||OD||0||1300 - 1350||R|
|Introduction to Computing||ECE120||AB6||61619||OD||0||1400 - 1450||R|
|Introduction to Computing||ECE120||AB8||61622||OD||0||1600 - 1650||R|
|Introduction to Computing||ECE120||ABA||61624||OD||0||1400 - 1450||R|
|Introduction to Computing||ECE120||ABB||61626||OD||0||1500 - 1550||R|
|Introduction to Computing||ECE120||ABC||61627||OD||0||1600 - 1650||R|
|Introduction to Computing||ECE120||ABD||64142||OD||0||1700 - 1750||R|
|Introduction to Computing||ECE120||AL1||70763||OLC||4||0900 - 0950||M W F|| Kirill Levchenko|
|Introduction to Computing||ECE120||AL2||63651||OLC||4||1300 - 1350||M W F||Ujjal Kumar Bhowmik|
|Introduction to Computing||ECE120||AL3||63652||OLC||4||1500 - 1550||M W F||Nikita Borisov|
|Introduction to Computing||ECE120||ZJ1||71191||ONL||4||0800 - 0850||M W F||Volodymyr Kindratenko|
|Introduction to Computing||ECE120||ZJ2||69956||PKG||4||0800 - 0850||M W F||ARR||Volodymyr Kindratenko|
|Introduction to Computing||ECE120||ZJ2||69956||PKG||4||1300 - 1350||W||ARR||Volodymyr Kindratenko|
|Introduction to Computing||ECE120||ZJA||73347||ONL||4||0800 - 0850||M W F||Volodymyr Kindratenko|
ECE 120 is a freshman engineering course. Its goal is to teach the fundamentals of computing so that students can understand the connections between hardware and software when developing computing systems.
- Representation of information
- Boolean algebra
- Combinational network analysis and design
- Sequential network analysis and design
- Computer organization and machine-level programming
- Programming in C
Detailed Description and Outline
Description: ECE 120 gives an introduction to the design and programming of computing systems. We start the course by motivating our objectives and connecting them with students’ future ECE studies and career paths. The philosophy of our approach is quite different than the typical introduction to programming course: after a brief illustration of our goals and objectives with a quick introduction to C, we approach programming from the bottom upwards. In particular, we begin by describing the architecture of a computer, including logic gates, datapaths, registers, and memory. Throughout the course, we will make connections between hardware and software and explore the engineering tradeoffs in using each to develop computing systems.
- Abstraction, bits, unsigned representation, signed integers, 2’s complement representation, fixed- and floating-point representation, hexadecimal notation, ASCII representation, unsigned binary addition, modular arithmetic, carry out, overflow
- Introduction to digital logic, CMOS, logic gates, truth tables, Boolean logic operations, Karnaugh maps, sum-of-product, product-of-sums, logical completeness, Boolean properties, two-level design, Pareto optimization, don’t care simplification
- Introduction to UNIX, introduction to C programming (operators, functions, statements), flow chart, sequential construct, conditional construct, iterative construct, program execution, program analysis, program testing
- Bit-sliced design, ripple-carry adder, bit-sliced comparator, 2’s complement comparator, building with abstraction, multiplexers, decoders
- Clock abstraction, latches, flip-flops, shift registers, registers with parallel load, serialization
- Finite state machines (FSM), binary counters, FSM models, clock synchronous design, modular FSM design (keyless car entry, vending machine)
- Concept of memory, address space, addressability, building larger memory using smaller memory, coincident selection, tri-state buffer
- The von Neumann model, LC-3 as von Neumann, instruction processing, instruction set architecture, control unit design, assemblers and assembly code
- Error detection and correction, odd/even parity bit, Hamming distance, Hamming code
There are assignments for most of the weeks on UNIX workstations. Some assignments introduce students to UNIX environment, Linux and programming tools. Some assignments utilize a commercial schematic capture and simulation software to teach combinational and sequential logic design concepts. Some assignments complement previous assignments by using a hands-on approach to implement a hardware-equivalent design. Some assignments are programming assignments requiring students to write programs in C, binary machine language, and assembly.
ECE 120 Lab Kit custom built for the Department of Electrical and Computer Engineering at the University of Illinois at Urbana-Champaign
The kits are self-contained so that labs can be completed by students anywhere with a 120VAC power source.
Altera Quartus for circuit design and simulation. This software is also used in a future core course, ECE 385.
Yale N. Patt and Sanjay J. Patel, Introduction to Computing Systems: from bits and gates to C and beyond, 2nd Edition, McGraw-Hill, 2003.
Class Notes by Prof. Lumetta.
As an introductory course to digital logic, ECE 120 demonstrates the relation between Boolean algebra as a formal framework for describing real-world problems, circuits implementing Boolean expressions that can be simulated using digital design software, and digital circuits physically built with TTL chips. By using the three modalities (Boolean expressions, circuit drawings and simulations, and actual hardware implementation), students are exposed to the digital systems design cycle, from the problem formulation stage to the actual hardware implementation and verification stage.
As an introductory course to computer systems, ECE 120 shows the relation between the hardware, software, and the interface between them. The students are exposed to computer microarchitecture, they have hands-on experience in programming using binary machine instructions and in the assembly language. This sets the stage for ECE 220 course in which the students learn programming using high-level languages.
After completing this course, students should:
- understand the role and importance of abstraction in computing systems (1)
- recognize and be able to make use of standard digital components in designing simple combinational logic (1, 2)
- be able to design and implement a simple finite state machine (FSM) as a clock-synchronous sequential circuit using digital logic (1, 2)
- be able to design and implement a simple FSM using assembly language (1, 2)
- understand the principles of computer organization and understand how computers execute instructions (1, 2, 6),
- be able to write simple programs in both C and assembly language (1, 2, 6)
- develop the skills required to solve engineering problems (1)
Since this is a freshman course, we also have explicit objectives for providing students with an understanding of the profession. In particular, students who have completed this course should:
- understand the expectations of the engineering discipline in terms of effort, quality, and objectivity (1, 3, 4)
- recognize that self-motivation and lifelong learning are necessary to success in engineering (4, 7)
- be able to articulate the importance of understanding tradeoffs and be able to recognize and identify basic design tradeoffs (1)