algo and complexity

1. Algorithms and
Complexity
AL101

2. DIGITAL LOGIC DESIGN

3. CLASS AGENDA
Course introduction
Discuss grading components
Groupings

4. Generic skills
On completion of this subject students should have the following skills:
• Application of knowledge of basic science and engineering fundamentals
• Effective communication about computational efficiency
• Capacity to reason and solve problems
• Ability to undertake problem identification, formulation and solution
• Capacity for creativity and innovation
• Profound respect for truth and intellectual integrity, and for the ethics of scholarship.

5. COURSE DESCRIPTION
The course addresses the concepts, principles and techniques of
designing digital systems. The course teaches the fundamentals of
digital systems applying the logic design and development
techniques. This course forms the basis for the study of advanced
subjects like Computer Architecture and Organization,
Microprocessor through Interfacing, VLSI Designing. Students will
learn principles of digital systems logic design.

6. Very large-scale
integration (VLSI)
Refers to an IC or
technology with many
devices on one chip.

7. Purpose
To analyze iterative and recursive algorithms for use of resources (time, memory,
parallelism, bandwidth, randomness, etc.). Develop fluency with Digital Logic and
learn to choose and implement efficient algorithms for numeric, combinatorial, and
geometric problems. Learn basic concepts and terminology in computability and
computational complexity.

8. COURSE OBJECTIVES:
1. To teach various number systems, binary codes and their applications
2. To familiarize the students the importance of error detection and error correction
codes.
3. To inculcate concepts of prototype board to simplify a Boolean expression.
4. To facilitate students in designing a logic circuit

9. COURSE OUTCOMES
At the end of the course students will be able to:
1. Use number systems and complements
2. Identify the importance of canonical forms in the minimization or other optimization of Boolean formulas in
general and digital circuits.
3. Minimize functions using any type of minimizing algorithms (Boolean algebra, Breadboard, prototyping and
Tabulation method).
4. Analyze the design procedures of Combinational and Sequential circuits.
5. Design the finite state machine using algorithmic truth table and perform simple projects.

10. SYLLABUS
UNIT - I
DIGITAL SYSTEMS AND BINARY NUMBERS
BOOLEAN ALGEBRA AND LOGIC GATES
UNIT – II
GATE LEVEL MINIMIZATION
UNIT – III
COMBINATIONAL CIRCUITS
UNIT - IV
SYNCHRONOUS SEQUENTIAL LOGIC
REGISTERS AND COUNTERS
UNIT - V
MEMORY AND PROGRAMMABLE LOGIC

11. GRADING COMPONENTS
 CLASS STANDING 40%
• Assignment 10%
• Quizzes 20%
• Recitation 10%
 PERIODIC EXAM 25%
 MAJOR EXAM 35%

12. CLASS MATERIALS
1. YELLOW PAD
2. (Optional) Ruler
3. Pen and Pencil
STARTING MIDTERMS and FINALS:
1. Bread board
2. 12v Battery
3. Resistor
4. (IC) Integrated Circuit 7402, 7408, 7432, 7400
5. Wires
6. LED Light