|
CO1: Recall various logic gates and the rules of Boolean algebra CO2: Discuss different simplification methods for Boolean functions CO3:Realize the combinational and sequential logic circuits by using various logical blocks CO4: The ability to understand, analyze and design various combinational and sequential circuits CO5: The ability to identify and prevent various hazards and timing problems in a digital design. CO6: To develop skill to build, and troubleshoot digital circuits. . |
- Teacher: SOWJANYA D
Course Objective
1. Identify and apply various properties of and relating to the integers division algorithm, and greatest common divisors
2. Understand the concept of a congruence and Euler generalization of Fermet’s theorem
CO 1: Understand the concepts of prime and twin primes.
CO 2: Apply Congruence to integers and representation of integers in binary and decimals.
CO 3: Understand the properties of positive integers.
CO 4: Apply Euler’s Phi function to the congruence’s with prime moduli to arbitrary moduli.
CO 5: Apply Euler’s theorem to the congruence’s with prime to arbitrary prime integer.
CO 6: Understand the properties of Phi function with ranges over positive divisors.
- Teacher: NAGENDRA KUMAR GOLLAPUDI