Page last updated on 2017 May 25

*Note:* ECE 1B used to be ECE 1 (see history at the end of this page)
*Enrollment code:* 11452

*Prerequisite:* Open to computer engineering students only

*Class meetings:* W 3:30-4:50, Buchanan 1930

*Instructor:* Professor Behrooz Parhami

*Open office hours:* M 3:00-5:00, W 5:00-6:00, HFH 5155

**Course announcements:** Listed in reverse chronological order

**Grading scheme:** Pass/Fail grade is assigned based on attendance

**Course calendar:** Schedule of lectures and links to lecture slides

**The ten lectures:** Lecture summaries and references

**Additional topics:** Possible replacements for current lectures

**Attendance record:** Please check regularly for possible errors

**Miscellaneous information:** Motivation, catalog entry, history

**Note:** The design and goals of this innovative freshman seminar are described in a brief article, a short paper, and a full paper, as follows:

- *IEEE Computer*, Vol. 42, No. 3, Mar. 2009 (PDF file)

- *IEEE Trans. Education*, Vol. 52, No. 3, Aug. 2009 (PDF file)

- *Computer Science Education*, Vol. 18, No. 4, Dec. 2008 (PDF file)

**2017/04/19:** During today's class, I was unable to connect to the Web site containing an interactive "Satisfiablility Game." Apparently, the problem resulted from network connectivity, rather than a broken link. Here is where you can play this puzzle-like game: On-line Game
**2017/02/09:** Welcome to the ECE 1B Web page for spring 2017. Please read the grading scheme below very carefully to ensure that you can earn a "pass" grade at the end of the quarter. ECE 1B requires no textbook and has no homework assignments or exams. A worksheet handout is given out at the beginning of each lecture and complete lecture slides are made available on-line. Please report any broken hyperlink to the instructor.

Pass/Not-Pass grading is based on attendance and class participation. There will be no homework or exam.

0 absence: Automatic "Pass."

1 absence: "Pass" if you submit a written statement to explain the absence. Any explanation is acceptable.

2 absences: Can earn a "Pass" grade by taking an oral final exam covering the two missed lectures.

3 or more absences: Automatic "Not-Pass."

Attendance will be taken as follows. Attendance slips are distributed at the beginning of each class session, with additional slips supplied to those arriving up to 10 minutes late. Students write their names and perm numbers on the slips and turn them in before leaving the classroom at the end of the lecture. You have to turn in your attendance slip in person, not through another student.

There will be no systematic updating of the presentation slides for 2017, so the files posted in 2016 should be deemed up to date for the current quarter.

**Day & Date (Lecture slides, ppt + pdf, and ppt handout) Lecture topic [Lead puzzle]**

W 4/05 (ppt, pdf, handout, last updated 2016/03/27) Easy, Hard, Impossible! [Collatz's conjecture]

W 4/12 (ppt, pdf, handout, last updated 2016/04/01) Placement and routing [Houses and utilities]

W 4/19 (ppt, pdf, handout, last updated 2016/04/14) Satisfiability [Making change]

W 4/26 (ppt, pdf, handout, last updated 2016/04/14) Cryptography [Secret messages]

W 5/03 (ppt, pdf, handout, last updated 2016/04/27) Byzantine generals [Liars and truth-tellers]

W 5/10 (ppt, pdf, handout, last updated 2016/04/27) Binary search [Counterfeit coin]

W 5/17 (ppt, pdf, handout, last updated 2016/05/05) Task scheduling [Sudoku]

W 5/24 (ppt, pdf, handout, last updated 2016/05/05) String matching [Word search]

W 5/31 (ppt, pdf, handout, last updated 2016/05/15) Sorting networks [Rearranging trains]

W 6/07 (ppt, pdf, handout, last updated 2016/05/26) Malfunction diagnosis [Logical reasoning]

R-F 6/08-09 (Oral final exams, to be scheduled for those with 2 absences)

W 6/21 (Grades due by midnight)

A one-page summary for each of the ten lectures is included in the following paper; additional print and on-line references are given below.

Parhami, B., "A Puzzle-Based Seminar for Computer Engineering Freshmen," *Computer Science Education*, Vol. 18, No. 4, pp. 1-17, Dec. 2008. (PDF file)

Lecture 1: Easy, Hard, Impossible

Fun with Fibonacci numbers, by Gareth E. Roberts [Seminar slides]

Fibonacci numbers: family trees for bees (BP's Math+Fun page) [Word file]

More on Collatz's conjecture [Wikipedia article]

On the unprovability of Collatz's conjecture, by C. A. Feinstein [Article]

Lecture 2: Placement and Routing

Houses and utilities puzzle [The Math Forum @ Drexel]

Euler's Formula: *V* – *E* + *F* = 2 [Twenty Proofs]

Lecture 3: Satisfiability

Making $5 Using 50 Coins [Ask Dr. Math]

Interactive game, by O. Roussel [The SAT Game]

Lecture 4: Cryptography

Web-based tutorial by P. Gutman [Cryptography and Security]

Web page maintained by T. Sale [The Enigma Cipher Machine]

The Enigma explained [12-minute video]

The fatal flaw in Enigma [11-minute video]

NSA Mathematician David Pery's 65-minute talk on Enigma (cryptography)

Khan Academy 10-minute video on the Enigma: Part of the module "Journey into Cryptography"

Lecture 5: Byzantine Generals

Saka, P., *How to Think About Meaning*, Springer, 2007

Resource Web page by A. Montalban and Y. Interian [Liars and Truth-Teller Puzzles] (Link broken?)

Lecture 6: Binary Search

Du, D.-Z., and F.K. Hwang, *Combinatorial Group Testing and Its Applications*, 2nd ed., World Scientific, 2000 (See Chapter 16, pp. 295-318)

Programs for solving counterfeit-coin problems [Coding resources and hints]

Lecture 7: Task Scheduling

Aaronson, L., "Sudoku Science: A Popular Puzzle Helps Researchers Dig into Deep Math," *IEEE Spectrum*, Vol. 43, No. 2, pp. 16-17, February 2006

Online Sudoku and other interesting logic puzzles [Logic Games Online]

Lecture 8: String Matching

Website with free online tools for creating word-search and other puzzles [Puzzlemaker]

Lecture 9: Sorting Networks

Hayes, B., "Trains of Thought: Computing with Locomotives and Box Cars Takes a One-Track Mind," *American Scientist*, Vol. 95, No. 2, pp. 108-113, March-April 2007 [Read on-line]

Parhami, B., *Introduction to Parallel Processing: Algorithms and Architectures*, Plenum Press, 1999 (See Chapter 7, pp. 129-147, for an introduction to sorting networks)

Lecture 10: Malfunction Diagnosis

Logic problems [Expand Your Mind] (Link broken?)

Somani, A. K., V. K. Agarwal, and D. Avis, "A Generalized Theory for System Level Diagnosis," *IEEE Trans. Computers*, Vol. 36, No. 5, pp. 538-546, May 1987

The following additional topics are being considered for inclusion as future lecture topics:

Topic A: Computational Geometry

Puzzles based on visual tricks and optical illusions

Web site devoted to discrete and computational geometry [The Geometry Junkyard]

See lectures 7 and 8 in the fall 2016 offering of the freshman seminar INT 94TN

Topic B: Loss of Precision

Puzzles based on logical paradoxes and absurdities

Parhami, B., *Computer Arithmetic: Algorithms and Hardware Designs*, Oxford University Press, 2000 (See Problems 1.1-1.3)

Topic C: Secret Sharing

Puzzles based on anonymous complainers and whistle blowers

Shamir, A., "How to Share a Secret," *Communications of the ACM*, Vol. 22, No. 11, pp. 612-613, 1979

Secret sharing [Wikipedia article]

Topic D: Amdahl's Law

Puzzles on river and bridge crossings

Parhami, B., *Computer Architecture: From Microprocessors to Supercomputers*, Oxford University Press, 2005 (See Section 4.3)

Amdahl's law [Wikipedia article]

Topic E: Predicting the Future

Puzzles based on determining the next term in a series

Sloane, N.J.A., "Find the Next Term," *J. Recreational Mathematics*, Vol. 7, No. 2, p. 146, Spring 1974 [GIF]

Sloane, N.J.A., *Online Encyclopedia of Integer Sequences* [Access on-line]

See lectures 1 and 2 in the fall 2016 offering of the freshman seminar INT 94TN

Topic F: Circuit Value Problem

Puzzles based on parallelization of hopelessly sequential problems

Greenlaw, R., H.J. Hoover, and W.L. Ruzzo, *Limits to Parallel Computation: P-Completeness Theory*, Oxford University Press, 1995 (See Section 4.2, pp. 75-76)

Topic G: Maps and Graphs

Puzzles based on map/graph coloring and graph properties

Feeman, T.G., *Portraits of the Earth: A Mathematician Looks at Maps*, American Mathematical Society, 2002

See lectures 9 and 10 in the fall 2016 offering of the freshman seminar INT 94TN

Topic H: Device Variability

Puzzles based on detecting differences in two nearly identical images

Tutorial sources about nanoelectronics device variability and design under variability to be located

Topic I: Cellular Automata

Conway's Game of Life

Wikipedia article on Conway's Game of Life

Martin Gardner's *Scientific American* article on Conway's Game of Life

Eric Weisstein's Treasure Trove of the Life Cellular Automaton

Topic J: Recommender Systems

Puzzles based on finding similarities or differences among a series of images

Fingerprint matching; Google's page-rank algorithm

Mining massive datasets (YouTube videos) [See in particular video 5.1]

See lectures 3 and 4 in the fall 2016 offering of the freshman seminar INT 94TN

Topic K: 3D Models from 2D Images

Puzzles based on deducing the shapes of 3D objects from 2D projections

3D illudion in 2D drawings (sidewalk art)

Architecrtural visualization; preserving models of historical sites in danger or collapse/destruction;

Modeling industrial parts and assemblies; layered models (3D printing)

See lectures 5 and 6 in the fall 2016 offering of the freshman seminar INT 94TN

In the following table, absence is marked with a "1" and presense with a "0". The first ten columns correspond to Lectures 1-10, the next column, **Σ**, is the total number of absences, and "Mrep" is the first few digits of the reversed Perm Number. For example, a student with the Perm Number 9876543 will have a Mrep code of 3, 34, 345, 3456, ... , depending on whether other students have Perm Numbers with the same ending.

__1 2 3 4 5 6 7 8 9 0 Σ Mrep__

0 0 0 0 0 0 0 0 ? ?

0 0 0 0 0 0 0 0 ? ?

0 0 0 0 0 0 0 0 ? ?

0 0 0 0 0 0 0 0 ? ?

0 0 0 0 0 0 0 0 ? ?

0 0 0 0 0 0 0 1 ? ?

0 0 0 0 0 0 0 0 ? ?

0 0 0 0 0 0 0 0 ? ?

0 0 0 0 1 0 0 0 ? ?

0 0 1 0 0 0 0 0 ? ?

0 0 0 0 0 0 0 0 ? ?

0 0 0 0 0 0 0 0 ? ?

0 0 0 0 0 0 0 0 ? ?

0 0 0 0 0 0 0 1 ? ?

0 0 0 0 0 0 0 0 ? ?

0 0 0 0 0 0 0 0 ? ?

0 0 0 0 0 0 0 1 ? ?

0 0 0 0 0 0 0 1 ? ?

0 0 0 0 0 0 0 0 ? ?

0 0 0 0 0 0 0 0 ? ?

0 0 0 0 0 0 0 0 ? ?

0 0 0 0 0 0 0 0 ? ?

0 0 0 0 0 0 0 0 ? ?

0 0 0 0 0 0 0 0 ? ?

0 0 0 0 0 0 0 0 ? ?

0 0 0 0 0 0 0 0 ? ?

0 0 0 0 0 0 0 0 ? ?

0 0 0 0 0 0 0 0 ? ?

0 0 0 0 0 0 0 0 ? ?

0 0 0 0 0 0 0 1 ? ?

0 0 0 0 0 1 0 0 ? ?

0 0 0 0 0 1 0 0 ? ?

0 0 0 0 0 1 0 0 ? ?

0 0 0 0 0 0 0 1 ? ?

0 1 0 1 0 0 1 0 ? ?

0 0 0 0 0 0 0 0 ? ?

0 0 0 0 0 0 0 0 ? ?

0 0 0 0 0 0 0 0 ? ?

0 0 0 0 0 0 0 0 ? ?

0 0 0 0 0 0 0 0 ? ?

0 0 0 0 0 0 0 1 ? ?

0 0 0 0 0 0 0 0 ? ?

0 0 0 0 0 0 0 1 ? ?

0 0 0 0 0 0 0 1 ? ?

0 0 0 0 0 0 1 0 ? ?

0 0 0 0 0 0 0 0 ? ?

0 0 0 0 0 0 0 0 ? ?

0 0 0 0 0 0 0 0 ? ?

0 0 0 0 0 0 0 0 ? ?

0 0 0 0 0 0 0 0 ? ?

0 0 0 0 0 0 0 1 ? ?

0 0 0 0 0 0 0 0 ? ?

0 0 0 0 0 0 0 0 ? ?

0 0 0 0 0 0 0 0 ? ?

0 0 0 1 0 0 0 0 ? ?

0 0 0 0 0 0 0 0 ? ?

0 0 0 0 0 0 0 0 ? ?

0 0 0 0 0 1 0 0 ? ?

0 0 0 0 0 0 0 0 ? ?

0 0 0 0 0 0 0 0 ? ?

0 0 0 0 0 0 0 0 ? ?

0 0 0 0 0 0 0 0 ? ?

0 1 0 0 0 0 1 0 ? ?

0 0 0 0 0 1 0 0 ? ?

0 0 0 0 0 0 0 0 ? ?

0 0 0 0 0 0 0 0 ? ?

0 0 0 0 0 0 0 0 ? ?

0 0 0 0 0 0 0 0 ? ?

0 0 0 0 0 0 0 0 ? ?

0 0 0 0 0 0 0 0 ? ?

0 0 0 0 0 0 0 0 ? ?

0 0 0 0 0 0 0 0 ? ?

0 2 1 2 1 5 3 10 ? ?

** Motivation:** Whether they work in the industry or in academic research settings, computer engineers face many challenges in their quest to design or effectively employ faster, smaller, lower-energy, more reliable, and cost-effective systems. Most computer engineering students do not begin tackling such problems, and more generally are not exposed to specific challenges of their field of study, until they enroll in upper-division major courses. Meanwhile, during their freshman- and sophomore-year experiences with foundational courses in mathematics, physics, electrical circuits, and programming, they wonder about where they are headed and what types of problems they will encounter as working professionals. This course is intended to provide an introduction to day-to-day problems and research endeavors in computer engineering via their connections to familiar mathematical and logical puzzles.

** Catalog entry: 1B. Ten Puzzling Problems in Computer Engineering. (1) PARHAMI.** Seminar, 1 hour.

Gaining familiarity with, and motivation to study, the field of computer engineering, through puzzle-like problems that represent a range of challenges facing computer engineers in their daily problem-solving efforts and at the frontiers of research.

** History:** This 1-unit freshman seminar (offered for the first time in spring 2007) was proposed and developed by Professor Parhami. The main goal of the seminar is to expose students to challenging computer engineering problems, faced by practicing engineers and research scientists, in a motivating and entertaining way. The course is useful because CE students have very limited exposure to key concepts in their chosen major during their initial studies that involve mostly foundational, basic science, and general-education courses. Beginning with the academic year 2013-2014, the seminar was renamed from ECE 1 to ECE 1B to accommodate another freshman seminar, ECE 1A, that exposes students to a roadmap for their studies at UCSB, their career choices, and leading-edge research topics. During fall 2016, a similar freshman seminar, INT 94TN, was offered at the UCSB campus level to introduce science and technology topics to students from different (non-engineering) disciplines.

Offering of ECE 1B in spring 2016 (PDF file)

Offering of ECE 1B in spring 2015 (PDF file)

Offering of ECE 1B in spring 2014 (PDF file)

Offering of ECE 1 in spring 2013 (PDF file)

Offering of ECE 1 in spring 2012 (PDF file)

Offering of ECE 1 in spring 2011 (PDF file)

Offering of ECE 1 in spring 2010 (PDF file)

Offering of ECE 1 in spring 2009 (PDF file)

Offerings of ECE 1 in 2007 and 2008 (PDF file)