Computer Logic CS 210
Popular in Course
Popular in ComputerScienence
This 4 page Class Notes was uploaded by Jean Dach on Saturday October 3, 2015. The Class Notes belongs to CS 210 at California State Polytechnic University taught by Salam Salloum in Fall. Since its upload, it has received 23 views. For similar materials see /class/218306/cs-210-california-state-polytechnic-university in ComputerScienence at California State Polytechnic University.
Reviews for Computer Logic
Report this Material
What is Karma?
Karma is the currency of StudySoup.
You can buy or earn more Karma at anytime and redeem it for class notes, study guides, flashcards, and more!
Date Created: 10/03/15
Department of Computer Science Course Description Fall 2011 Course Number and Title CS210 Computer Logic Instructor Dr Salam Salloum Of ce Bldg 8 Room 13 Of ce Hours M 100200PM F 100400PM and by appointment Phone 909 8695317 Email ssalloumcsupomonaedu Lecture Meeting Time MW 200350PM Place Bldg 8 Room 345 Textbook Fundamentals of Logic Design Sixth Edition and LogicAid software Both by Charles H Roth Jr and Larry L Kinney CENGAGE Learning 2010 Course Description Boolean algebra with applications to computers and logic design The arithmetic logical unit logical properties of ip ops and sequential machines Applied projects 4 1ecturesproblemsolving Prerequisite CS 130 with a grade of C or better or consent of instructor Course Requirements and Grading Test1 20 Test2 20 Final 30 Lab assignments 20 Quizzes 10 Journal up to 4 additional points Course Objectives Upon the completion of this course the student shall acquire the following knowledge and skills Number systems and symbol representations in computer Binary arithmetic Boolean algebra and its application in software and hardware Techniques of designing and simplifying logic circuits combinational and sequential Most important SSI MSI LSI and VLSI components Using CAD software tool LogicAid Handson experience of designing some basic logic circuits using integrated circuit chips Attendance Attendance is expected at all class sessions but not required Students are responsible for all material presented in the course whether or not they attend the class including announcements about course procedures Lab Assignments There will be four lab assignments using the LogicAid and each will be due at the beginning of class on the due date There will be no substitution work for any lab assignments And the following are the basic polices for dealing with late assignments Late assignments will be penalized 5 per day late Saturday and Sunday count as regular days when it comes to calculating late penalties Assignments will not be accepted after solutions are handed out or illustrated in the class Quizzes There will be several scheduled quizzes The quizzes will usually be given at the beginning of class Please note that there will be no make up for any missed quizzes Homework Every week a set of exercises will be assigned The students will not have to turn inthe homework solutions However it is expected that every student solves or makes an attempt to solve the assigned exercises before the instructor discusses the solutions in the class Class participation in problem solving is expected but not required Journal Participating in the journal activities is expected but not required You may earn up to four additional points from this participation I encourage every student to email me weekly to express her or his expectations and thoughts about the course You may use the journal to ask a question about a speci c topic or a concept inform the instructor about your learning style or comment on the pace and teaching style Please be assured that your opinion will in no way affect your course grade Letter Grades Scale A gt90 86 lt B lt 90 80 lt B lt85 70 lt C lt75 66 lt D lt 70 60 lt D lt 65 F lt60 C our se Outline tentative Topics Number system and binary arithmetic Boolean algebra and combinational circuits Applications of Boolean algebra Kamaugh Maps Important combinational circuits multiplexers decoders ROM PLA adders comparator Sequential circuit and ip 7 ops Counters and shift registers Analysis of sequential circuits State graph and sequential circuit design Review and Tests of lectures Reading assignments 2 Chapter land handout 1 Chapters 23 and handout 1 Chapter 4 and handout 4 Chapter 5 and handout 2 Chapter 9 and handout 2 Chapter 11 and handout 1 Chapter 12 and handout 1 Chapter 13 and handout 4 Chapters 14 and 16 and handout
Are you sure you want to buy this material for
You're already Subscribed!
Looks like you've already subscribed to StudySoup, you won't need to purchase another subscription to get this material. To access this material simply click 'View Full Document'