Karnaugh maps It is a matrix of squares. each square represent a minterm or maxterm from a Boolean equaTion N-variable karnaugh map have 2 squares The binary numeral on the sides of k-map is the variable coordinates

Digital system: entity can process, transfer and store any kind of digital signals is Composed of individual digital logic circuits which are designed to perform specified function

Binary Code Natural Binary Coded Decimal (BCD) Decimal BCD group of four binary digits represent 0000 a single decimal digit

Chapter 16 Objectives After you have read and studied this chapter, you should be able to Write recursive algorithms for mathematic functions and nonnumerical operations. Decide when to use recursion and when not to. Describe the recursive quicksort algorithm and explain how its performance is better than selection and bubble sort algorithms

Chapter 14 Objectives After you have read and studied this chapter, you should be able to Write programs that are easily extensible and modifiable by applying polymorphism in program design. Define reusable classes based on inheritance and abstract classes and abstract methods. Define methods using the protected modifier. Parse strings using a StringTokenizer object. 2000 McGraw-Hill

Chapter 12 Objectives After you have read and studied this chapter, you should be able to Describe four different object categories and use them effectively in designing classes. Define a package and place reusable classes in it. Write a method that calls the superclass's method explicitly by using the reserved word super

Chapter 10 Objectives After you have read and studied this chapter, you should be able to Perform linear and binary search algorithms on small arrays. Determine whether a linear or binary search is more effective for a given situation. Perform selection and bubble sort algorithms. Describe the heapsort algorithm and show how its performance is superior to the other two algorithms. Apply basic sorting algorithms to sort an array of objects

Chapter 8 Objectives After you have read and studied this chapter, you should be able to Declare and manipulate data of the char data type. Write string processing programs using String and StringBuffer objects. Differentiate the String and StringBuffer classes and use the correct class in solving given task. Distinguish the primitive and reference data types and show how the memory allocation between the two is different

Chapter 6 Objectives After you have read and studied this chapter, you should be able to Implement selection control in a program using if statements. Implement selection control in a program using switch statements. Write boolean expressions using relational and boolean operators. Evaluate given boolean expressions correctly

Chapter 4 Objectives After you have read and studied this chapter, you should be able to Define an instantiable class with multiple methods and a constructor. Differentiate the local and instance variables. Define and use value-returning methods. Distinguish private and public methods. Distinguish private and public data members. Describe how the arguments are passed to the parameters in method definitions