# COMPUTER SCIENCE. Paper 1 (THEORY)

Save this PDF as:

Size: px
Start display at page:

## Transcription

1 COMPUTER SCIENCE Paper 1 (THEORY) (Three hours) Maximum Marks: 70 (Candidates are allowed additional 15 minutes for only reading the paper. They must NOT start writing during this time) Answer all questions in Part I (compulsory) and six questions from Part-II, choosing two questions from Section-A, two from Section-B and two from Section-C. All working, including rough work, should be done on the same sheet as the rest of the answer. The intended marks for questions or parts of questions are given in brackets [ ] PART I Answer all questions Question 1 While answering questions in this Part, indicate briefly your working and reasoning, wherever required. (a) State Associative law and prove it with the help of a truth table. [1] (b) Draw the truth table to prove the proportional logic expression. (x => y) ʌ (y => x) = x <=> y (c) Find the dual for the Boolean equation: AB + BC + 1 = 1. [1] (d) Convert the Boolean expression F(X,Y,Z) = X Y Z + X YZ + XYZ into its cardinal form. (e) Minimize F = XY + (XZ) +XY Z using Boolean laws. [1] [1] [1] Question 2 (a) Differentiate between Stack data structure and Queue data structure. [2] (b) Convert the following infix notation to postfix: [2] A * ( B / C ) / E + F (c) Define Interface. How is it different from a Class? [2] 1

2 (d) (e) Each element of an array arr[15][20] requires W bytes of storage. If the address of arr[6][8] is 4440 and the Base Address at arr[1][1] is 4000, find the width W of each cell in the array arr[ ][ ] when the array is stored as Column Major Wise. Define Big O notation. State the two factors which determine the complexity of an algorithm. [2] [2] Question 3 The following is a function of some class. What will be the output of the function test ( ) when the value of count is equal to 4? Show the dry run / working. void test (int count ) { if ( count = = 0) System.out.println( ); else { System.out.println( Bye + count); test( --count ); System.out.println( + count); } } [5] 2

3 PART II Answer six questions in this part, choosing two questions from Section A, two from Section B and two from Section C. SECTION - A Answer any two questions. Question 4 (a) Given F(A,B,C,D) = ( 0, 2, 3, 6, 8, 10, 11, 14, 15 ) (i) (ii) Reduce the above expression by using 4-variable Karnaugh map, showing the various groups (i.e. octal, quads and pairs). [4] Draw the logic gate diagram for the reduced expression. Assume that the variables and their complements are available as inputs. [1] (b) Given F(P,Q,R,S) = π ( 5, 7, 8, 10, 12, 14, 15 ) (i) (ii) Reduce the above expression by using 4-variable Karnaugh map, showing the various groups (i.e. octal, quads and pairs). [4] Draw the logic gate diagram for the reduced expression. Assume that the variables and their complements are available as inputs. [1] Question 5 (a) Draw the logic diagram and truth table to encode the decimal numbers ( 2, 3, 5, 7, 8 ) and briefly explain its working. [5] (b) Simplify the following Boolean expression and draw the gate for the reduced expression. F= A B + AB C + A [2] (c) Define Universal gates. Give one example and show how it works as an OR gate. [3] Question 6 (a) Draw a truth table with a 3 input combination which outputs 1 if there are odd number [5] of 0 s. Also derive an SOP expression for the output. Reduce the expression using Karnaugh Map. (b) Define Proposition. How does tautology differ from contradiction? [2] (c) Briefly explain the working of a 4:1 multiplexer. Also draw the logic diagram of 4:1 multiplexer. [3] 3

4 SECTION B Answer any two questions Each program should be written in such a way that it clearly depicts the logic of the problem. This can be achieved by using mnemonic names and comments in the program. ( Flowcharts and Algorithms are not required ) The programs must be written in Java. Question 7 [10] A class Composite contains a two dimensional array of order [m x n]. The maximum values possible for both m and n is 20. Design a class Composite to fill the array with the first (m x n) composite numbers in column wise. The details of the members of the class are given below: Class name : Composite Data members /instance variables : arr[ ][ ] : stores the composite numbers column wise m n : integer to store the number of rows : integer to store the number of columns Member functions : Composite(int mm, int nn ) : to initialize the size of the matrix m=mm and n=nn int iscomposite( int p ) : returns 1 if number is composite otherwise returns 0. void fill ( ) : to fill the elements of the array with the first (m n) composite numbers in column wise void display( ) : displays the array in a matrix form. Specify the class Composite giving details of the constructor(int,int), int iscomposite(int), void fill( ) and void display( ). Define a main( ) function to create an object and call the functions accordingly to enable the task. 4

5 Question 8 [10] Design a class Sort which enables a word to be arranged in alphabetical order. The details of the members of the class are given below : Class name : Sort Data members /instance variables: Str : stores a word len Member functions : Sort( ) void readword( ) void arrange ( ) void display( ) : to store the length of the word : default constructor : to accept the word : to arrange the word in alphabetical order using any standard sorting technique. : displays the original word along with the sorted word Specify the class Sort giving details of the constructor, void readword( ), void arrange( ), and void display( ). Define the main( ) function to create an object and call the functions accordingly to enable the task. Question 9 [10] A Special number is a number in which the sum of the factorial of its digits is equal to the number. Example: 145 ( 1! + 4! + 5! = 145 ). Thus, 145 is a special number. Design a class Special to check if the given number is a Special number or not. Some of the members of the class are given below: Class name : Special Data members /instance variables : n : integer to store the number Member functions : Special( ) void read( ) int factorial(int x) boolean isspecial( ) void display( ) : default constructor : to accept the number : return the factorial of a number using recursion technique. : checks for the special number by invoking the function factorial( ) and returns true if Special, otherwise returns false : to show the result with an appropriate message. Specify the class Special, giving details of the Constructor, void read( ), int factorial(int), boolean isspecial( ) and void display( ). Define the main() function to create an object and call the member function according to enable the task. 5

6 SECTION C Answer any two questions Each Program should be written in such a way that it clearly depicts the logic of the problem step wise. This can also be achieved by using comments in the program and mnemonic names or pseudo codes for algorithms. The program must be written in Java and the algorithms must be written in general / standard form, wherever required / specified. (Flowcharts are not required.) Question 10 [5] A super class Account contains employee details and a sub class Simple calculates the employee s simple interest. The details of the two classes are given below: Class name : Account Data Members: Name : stores the employee name Pan : stores the employee PAN number Principal : stores the Principal amount (in decimals) acc_no : stores the employee bank account number Member functions: Account(. ) : parameterized constructor to assign value to data members void display( ) : to display the employee details Class name : Simple Data Members: time : stores the time duration rate : stores the rate of interest interest : stores the simple interest Member functions: Simple(. ) : parameterized constructor to assign value to data members of both the classes. void calculate( ) : calculates the simple interest as (Principal time rate) / 100 void display( ) : displays the employee details along with the rate, time and interest. Assume that the super class Account has been defined. Using the concept of inheritance, specify the class Simple giving details of constructor, void calculate( ) and void display( ). The super class and the main function need not be written. 6

7 Question 11 [5] A dequeue enables the user to add and remove integers from both the ends i.e. front and rear. Define a class DeQueue with the following details: Class name : DeQueue Data Members: ele[ ] : array to hold the integer elements. cap : stores the maximum capacity of the array. front : to point the index of the front. rear : to point the index of the rear. Member functions: DeQueue(int max) : constructor to initialize the data member cap = max, front = rear = 0 and create the integer array void pushfront(int v) : to add integers from the front index if possible else display the message( full from front ). int popfront( ) : to remove the return elements from front. If array is empty then return-999. void pushrear(int v) : to add integers from the front index if possible else display the message( full from rear ). int poprear( ) : to remove and return elements from rear. If the array is empty then return-999. Specify the class DeQueue giving the details of ONLY the constructor(int), pushfront(int) and int poprear ( ). Assume that the other functions have been defined. void The main( ) function need not be written. Question 12 (a) A linked list is formed from the objects of the class: [2] [4] class Node { int num; Node next; } Write an Algorithm OR a Method to insert a node at the beginning of an existing linked list. The method declaration is as follows: void InsertNode( Nodes starptr, int n ) 7

8 (b) Answer the following questions from the diagram of a Binary Tree given below: (i) Name the Root and the leaves of the tree. [1] (ii) Write the post order traversal of the tree. [1] (iii) Separate the Internal nodes and the External nodes of the tree. [1] PLEASE NOTE: The total weightage of questions in the Question Paper will be as indicated in the Specimen Paper. However, breakup of subparts in questions may vary from one year to another. 8

### COMPUTER SCIENCE 1999 (Delhi Board)

COMPUTER SCIENCE 1999 (Delhi Board) Time allowed: 3 hours Max. Marks: 70 Instructions: (i) All the questions are compulsory. (ii) Programming Language: C++ QUESTION l. (a) Why main function is special?

### DATA STRUCTURES USING C

DATA STRUCTURES USING C QUESTION BANK UNIT I 1. Define data. 2. Define Entity. 3. Define information. 4. Define Array. 5. Define data structure. 6. Give any two applications of data structures. 7. Give

### PES Institute of Technology-BSC QUESTION BANK

PES Institute of Technology-BSC Faculty: Mrs. R.Bharathi CS35: Data Structures Using C QUESTION BANK UNIT I -BASIC CONCEPTS 1. What is an ADT? Briefly explain the categories that classify the functions

### Chapter 3: Restricted Structures Page 1

Chapter 3: Restricted Structures Page 1 1 2 3 4 5 6 7 8 9 10 Restricted Structures Chapter 3 Overview Of Restricted Structures The two most commonly used restricted structures are Stack and Queue Both

### 1) The postfix expression for the infix expression A+B*(C+D)/F+D*E is ABCD+*F/DE*++

Answer the following 1) The postfix expression for the infix expression A+B*(C+D)/F+D*E is ABCD+*F/DE*++ 2) Which data structure is needed to convert infix notations to postfix notations? Stack 3) The

### Karnaugh Map. Alternative way to Boolean Function Simplification. Karnaugh Map. Description of Kmap & Terminology

Alternative way to Boolean Function Simplification Karnaugh Map CIT 595 Spring 2010 Simplification of Boolean functions leads to simpler (and usually faster) digital circuits Simplifying Boolean functions

### Combinational Logic Tutorial sheet

Combinational Logic Tutorial sheet 1) Redraw the following circuits into the respective ANSI symbols a. b. c. d. 2) Write the Boolean equation for each of the circuit diagrams in question 1. 3) Convert

### Unit 1. 5. Write iterative and recursive C functions to find the greatest common divisor of two integers. [6]

Unit 1 1. Write the following statements in C : [4] Print the address of a float variable P. Declare and initialize an array to four characters a,b,c,d. 2. Declare a pointer to a function f which accepts

### Boolean Algebra Part 1

Boolean Algebra Part 1 Page 1 Boolean Algebra Objectives Understand Basic Boolean Algebra Relate Boolean Algebra to Logic Networks Prove Laws using Truth Tables Understand and Use First Basic Theorems

### 28. Minimize the following using Tabular method. f(a, b, c, d, e)= m(0,1,9,15,24,29,30) + d(8,11,31) 29. Minimize the following using K-map method.

Unit-1 1. Show Karnaugh map for equation Y = F(A,B,C) = S m(1, 2, 3, 6, 7) 2. Show Karnaugh map for equation Y = F(A,B,C,D) = S m(1, 2, 3, 6, 8, 9, 10, 12, 13, 14) 3. Give SOP form of Y = F(A,B,C,D) =

### Data Structure [Question Bank]

Unit I (Analysis of Algorithms) 1. What are algorithms and how they are useful? 2. Describe the factor on best algorithms depends on? 3. Differentiate: Correct & Incorrect Algorithms? 4. Write short note:

### A binary search tree or BST is a binary tree that is either empty or in which the data element of each node has a key, and:

Binary Search Trees 1 The general binary tree shown in the previous chapter is not terribly useful in practice. The chief use of binary trees is for providing rapid access to data (indexing, if you will)

### CMPS 10 Winter Homework Assignment 5

CMPS 10 Winter 2011- Homework Assignment 5 Problems: Chapter 4 (p.184): 1abc, 3abcd, 4ab, 5abc, 6, 7, 9abcd, 15abcd, 17, 18, 19, 20 1. Given our discussion of positional numbering systems in Section 4.2.1,

### 12 Abstract Data Types

12 Abstract Data Types 12.1 Source: Foundations of Computer Science Cengage Learning Objectives After studying this chapter, the student should be able to: Define the concept of an abstract data type (ADT).

### 10CS35: Data Structures Using C

CS35: Data Structures Using C QUESTION BANK REVIEW OF STRUCTURES AND POINTERS, INTRODUCTION TO SPECIAL FEATURES OF C OBJECTIVE: Learn : Usage of structures, unions - a conventional tool for handling a

### Tutorial 5 Special Combinational Logic Circuit

Tutorial 5 Special Combinational Logic Circuit Question 1 a) What is the function of an adder circuit? b) A half-adder adds two binary bits, true or false? c) A half-adder has a sum output only, true or

### VALLIAMMAI ENGINEERING COLLEGE SRM NAGAR, KATTANKULATHUR 603 203 DEPARTMENT OF COMPUTER APPLICATIONS QUESTION BANK IN REVISED BLOOM S TAXONOMY

ACADEMIC YEAR: 0 7 VALLIAMMAI ENGINEERING COLLEGE SRM NAGAR, KATTANKULATHUR 0 0 SEMESTER: ODD BRANCH: MCA YEAR: I SEMESTER: I SUBJECT CODE AND NAME: MC70 Problem Solving and Programming NAME OF THE FACULTY

### UNIVERSITI MALAYSIA SARAWAK KOTA SAMARAHAN SARAWAK PSD2023 ALGORITHM & DATA STRUCTURE

STUDENT IDENTIFICATION NO UNIVERSITI MALAYSIA SARAWAK 94300 KOTA SAMARAHAN SARAWAK FAKULTI SAINS KOMPUTER & TEKNOLOGI MAKLUMAT (Faculty of Computer Science & Information Technology) Diploma in Multimedia

### Part 1: Logic Design. Tutorial

CPIT2 : Computer Organization and Architecture Course Lectures by Prof. Mohamed Khamis Part : Logic Design Tutorial by Teaching Assistant. Khalid Alharbi Department of Information Technology Faculty of

### UIL Computer Science for Dummies by Jake Warren and works from Mr. Fleming

UIL Computer Science for Dummies by Jake Warren and works from Mr. Fleming 1 2 Foreword First of all, this book isn t really for dummies. I wrote it for myself and other kids who are on the team. Everything

### The equation for the 3-input XOR gate is derived as follows

The equation for the 3-input XOR gate is derived as follows The last four product terms in the above derivation are the four 1-minterms in the 3-input XOR truth table. For 3 or more inputs, the XOR gate

### Combinational Circuits (Part II) Notes

Combinational Circuits (Part II) Notes This part of combinational circuits consists of the class of circuits based on data transmission and code converters. These circuits are multiplexers, de multiplexers,

### CSE140: Midterm 1 Solution and Rubric

CSE140: Midterm 1 Solution and Rubric April 23, 2014 1 Short Answers 1.1 True or (6pts) 1. A maxterm must include all input variables (1pt) True 2. A canonical product of sums is a product of minterms

### Krishna Institute of Engineering & Technology, Ghaziabad Department of Computer Application MCA-213 : DATA STRUCTURES USING C

Tutorial#1 Q 1:- Explain the terms data, elementary item, entity, primary key, domain, attribute and information? Also give examples in support of your answer? Q 2:- What is a Data Type? Differentiate

### Sudoku as an Expression in Propositional Logic

Sudoku as an Expression in Propositional Logic Peter Cappello Department of Computer Science University of California, Santa Barbara INTRODUCTION Sudoku is a kind of puzzle that involves a 9 9 array of

### Digital Logic Design. Basics Combinational Circuits Sequential Circuits. Pu-Jen Cheng

Digital Logic Design Basics Combinational Circuits Sequential Circuits Pu-Jen Cheng Adapted from the slides prepared by S. Dandamudi for the book, Fundamentals of Computer Organization and Design. Introduction

### Masters programmes in Computer Science and Information Systems. Object-Oriented Design and Programming. Sample module entry test xxth December 2013

Masters programmes in Computer Science and Information Systems Object-Oriented Design and Programming Sample module entry test xxth December 2013 This sample paper has more questions than the real paper

### 5. A full binary tree with n leaves contains [A] n nodes. [B] log n 2 nodes. [C] 2n 1 nodes. [D] n 2 nodes.

1. The advantage of.. is that they solve the problem if sequential storage representation. But disadvantage in that is they are sequential lists. [A] Lists [B] Linked Lists [A] Trees [A] Queues 2. The

### Points Addressed in this Lecture. Standard form of Boolean Expressions. Lecture 5: Logic Simplication & Karnaugh Map

Points Addressed in this Lecture Lecture 5: Logic Simplication & Karnaugh Map Professor Peter Cheung Department of EEE, Imperial College London (Floyd 4.5-4.) (Tocci 4.-4.5) Standard form of Boolean Expressions

### Digital Logic Circuits

Digital Logic Circuits Digital describes any system based on discontinuous data or events. Typically digital is computer data or electronic sampling of an analog signal. Computers are digital machines

### DEPARTMENT OF ELECTRONICS AND COMMUNICATION ENGINEERING

DEPARTMENT OF ELECTRONICS AND COMMUNICATION ENGINEERING Lab Manual Digital Electronics Laboratory (EC-39) BACHELOR OF TECHNOLOGY Subject Code: EC 39 Subject Name: Digital Electronics Laboratory Teaching

### Chapter 3. Cartesian Products and Relations. 3.1 Cartesian Products

Chapter 3 Cartesian Products and Relations The material in this chapter is the first real encounter with abstraction. Relations are very general thing they are a special type of subset. After introducing

### Sample Questions Csci 1112 A. Bellaachia

Sample Questions Csci 1112 A. Bellaachia Important Series : o S( N) 1 2 N N i N(1 N) / 2 i 1 o Sum of squares: N 2 N( N 1)(2N 1) N i for large N i 1 6 o Sum of exponents: N k 1 k N i for large N and k

### Lecture 8 Binary Numbers & Logic Operations The focus of the last lecture was on the microprocessor

Lecture 8 Binary Numbers & Logic Operations The focus of the last lecture was on the microprocessor During that lecture we learnt about the function of the central component of a computer, the microprocessor

### Quine-McClusky Minimization Procedure

Quine-McClusky Minimization Procedure This is basically a tabular method of minimization and as much it is suitable for computer applications. The procedure for optimization as follows: Step : Describe

### United States Naval Academy Electrical and Computer Engineering Department. EC262 Exam 1

United States Naval Academy Electrical and Computer Engineering Department EC262 Exam 29 September 2. Do a page check now. You should have pages (cover & questions). 2. Read all problems in their entirety.

### Sum of Products (SOP) Expressions

Sum of Products (SOP) Expressions The Sum of Products (SOP) form of Boolean expressions and equations contains a list of terms (called minterms) in which all variables are ANDed (products). These minterms

### NATIONAL UNIVERSITY OF SINGAPORE

NATIONAL UNIVERSITY OF SINGAPORE SCHOOL OF COMPUTING EXAMINATION FOR Semester 2 AY212/213 CS21 COMPUTER ORGANISATION April 213 Time allowed: 2 hours INSTRUCTIONS TO CANDIDATES 1. This examination paper

### CSE140: Components and Design Techniques for Digital Systems

CSE4: Components and Design Techniques for Digital Systems Tajana Simunic Rosing What we covered thus far: Number representations Logic gates Boolean algebra Introduction to CMOS HW#2 due, HW#3 assigned

### Data Structures and Algorithms Written Examination

Data Structures and Algorithms Written Examination 22 February 2013 FIRST NAME STUDENT NUMBER LAST NAME SIGNATURE Instructions for students: Write First Name, Last Name, Student Number and Signature where

### 1. What are Data Structures? Introduction to Data Structures. 2. What will we Study? CITS2200 Data Structures and Algorithms

1 What are ata Structures? ata Structures and lgorithms ata structures are software artifacts that allow data to be stored, organized and accessed Topic 1 They are more high-level than computer memory

### Algorithms and Data Structures Written Exam Proposed SOLUTION

Algorithms and Data Structures Written Exam Proposed SOLUTION 2005-01-07 from 09:00 to 13:00 Allowed tools: A standard calculator. Grading criteria: You can get at most 30 points. For an E, 15 points are

### Analog & Digital Electronics Course No: PH-218

Analog & Digital Electronics Course No: PH-218 Lec-29: Combinational Logic Modules Course Instructor: Dr. A. P. VAJPEYI Department of Physics, Indian Institute of Technology Guwahati, India 1 Combinational

### Dept. of CSE, IIT KGP

Basic Programming Concepts CS10001: Programming & Data Structures Pallab Dasgupta Professor, Dept. of Computer Sc. & Engg., Indian Institute of Technology Kharagpur Some Terminologies Algorithm / Flowchart

### CS61c: Representations of Combinational Logic Circuits

CS61c: Representations of Combinational Logic Circuits J. Wawrzynek October 12, 2007 1 Introduction In the previous lecture we looked at the internal details of registers. We found that every register,

### Chapter 4. Combinational Logic. Outline. ! Combinational Circuits. ! Analysis and Design Procedures. ! Binary Adders. ! Other Arithmetic Circuits

Chapter 4 Combinational Logic 4- Outline! Combinational Circuits! Analysis and Design Procedures! Binary Adders! Other Arithmetic Circuits! Decoders and Encoders! Multiplexers 4-2 Combinational v.s Sequential

### FBCA-02 April-2007 Programming in C Language BCA-102 (New Course)

Seat No. : FBCA-02 April-2007 Programming in C Language BCA-102 (New Course) Time : 3 Hours] [Max. Marks : 70 Instructions : (1) Figures to the right indicate full marks of the question. (2) Make and state

### BHARATHIAR UNIVERSITY: COIMBATORE CENTRE FOR COLLABORATION OF INDUSTRY AND INSTITUTIONS(CCII) CERTIFICATE IN ADVANCED PROGRAMMING C++ LANGUAGE

Certificate in Advanced Programming - C++ Language Page 1 of 7 BHARATHIAR UNIVERSITY: COIMBATORE 641046 CENTRE FOR COLLABORATION OF INDUSTRY AND INSTITUTIONS(CCII) CERTIFICATE IN ADVANCED PROGRAMMING C++

### KITES TECHNOLOGY COURSE MODULE (C, C++, DS)

KITES TECHNOLOGY 360 Degree Solution www.kitestechnology.com/academy.php info@kitestechnology.com technologykites@gmail.com Contact: - 8961334776 9433759247 9830639522.NET JAVA WEB DESIGN PHP SQL, PL/SQL

### Data Structures Using Java

Data Structures Using Java D. S. Malik P. S. Nair THOMSON COURSE TECHNOLOGY Australia Canada Mexico Singapore Spain United Kingdom United States TABLE OF Contents PREFACE XXV 1.Software Engineering Principles

### WUCT121. Discrete Mathematics. Logic

WUCT121 Discrete Mathematics Logic 1. Logic 2. Predicate Logic 3. Proofs 4. Set Theory 5. Relations and Functions WUCT121 Logic 1 Section 1. Logic 1.1. Introduction. In developing a mathematical theory,

### I PUC - Computer Science. Practical s Syllabus. Contents

I PUC - Computer Science Practical s Syllabus Contents Topics 1 Overview Of a Computer 1.1 Introduction 1.2 Functional Components of a computer (Working of each unit) 1.3 Evolution Of Computers 1.4 Generations

### Ordered Lists and Binary Trees

Data Structures and Algorithms Ordered Lists and Binary Trees Chris Brooks Department of Computer Science University of San Francisco Department of Computer Science University of San Francisco p.1/62 6-0:

### Module 1: Propositional Logic. CPSC 121: Models of Computation. Module 1: Coming up... Module 1: Coming up...

CPSC 121: Models of Computation By the start of the class, you should be able to: Translate back and forth between simple natural language statements and propositional logic. Evaluate the truth of propositional

### Mathematical Induction. Rosen Chapter 4.1 (6 th edition) Rosen Ch. 5.1 (7 th edition)

Mathematical Induction Rosen Chapter 4.1 (6 th edition) Rosen Ch. 5.1 (7 th edition) Mathmatical Induction Mathmatical induction can be used to prove statements that assert that P(n) is true for all positive

### Assembly Language for Intel-Based Computers, 4 th Edition. Chapter 1: Basic Concepts. Chapter Overview. Welcome to Assembly Language

Assembly Language for Intel-Based Computers, 4 th Edition Kip R. Irvine Chapter 1: Basic Concepts Slides prepared by Kip R. Irvine Revision date: 10/27/2002 Chapter corrections (Web) Printing a slide show

### COMBINATIONAL LOGIC CIRCUITS

COMBINATIONAL LOGIC CIRCUITS 4.1 INTRODUCTION The digital system consists of two types of circuits, namely: (i) Combinational circuits and (ii) Sequential circuits A combinational circuit consists of logic

### Karnaugh Maps. Circuit-wise, this leads to a minimal two-level implementation

Karnaugh Maps Applications of Boolean logic to circuit design The basic Boolean operations are AND, OR and NOT These operations can be combined to form complex expressions, which can also be directly translated

C++ How to Program, 8/e 1992-2012 by Pearson Education, Inc. 1992-2012 by Pearson Education, Inc. 1992-2012 by Pearson Education, Inc. We ve studied fixed-size data structures such as one-dimensional arrays

### BOOLEAN ALGEBRA & LOGIC GATES

BOOLEAN ALGEBRA & LOGIC GATES Logic gates are electronic circuits that can be used to implement the most elementary logic expressions, also known as Boolean expressions. The logic gate is the most basic

### Thomas Jefferson High School for Science and Technology Program of Studies Foundations of Computer Science. Unit of Study / Textbook Correlation

Thomas Jefferson High School for Science and Technology Program of Studies Foundations of Computer Science updated 03/08/2012 Unit 1: JKarel 8 weeks http://www.fcps.edu/is/pos/documents/hs/compsci.htm

### Chapter There are non-isomorphic rooted trees with four vertices. Ans: 4.

Use the following to answer questions 1-26: In the questions below fill in the blanks. Chapter 10 1. If T is a tree with 999 vertices, then T has edges. 998. 2. There are non-isomorphic trees with four

### CHAPTER 3 Boolean Algebra and Digital Logic

CHAPTER 3 Boolean Algebra and Digital Logic 3.1 Introduction 121 3.2 Boolean Algebra 122 3.2.1 Boolean Expressions 123 3.2.2 Boolean Identities 124 3.2.3 Simplification of Boolean Expressions 126 3.2.4

### Lab Manual. Digital System Design (Pr): COT-215 Digital Electronics (P): IT-211

Lab Manual Digital System Design (Pr): COT-215 Digital Electronics (P): IT-211 Lab Instructions Several practicals / programs? Whether an experiment contains one or several practicals /programs One practical

### Exclusive OR/Exclusive NOR (XOR/XNOR)

Exclusive OR/Exclusive NOR (XOR/XNOR) XOR and XNOR are useful logic functions. Both have two or more inputs. The truth table for two inputs is shown at right. a XOR b = 1 if and only if (iff) a b. a XNOR

### Theory of Computation Prof. Kamala Krithivasan Department of Computer Science and Engineering Indian Institute of Technology, Madras

Theory of Computation Prof. Kamala Krithivasan Department of Computer Science and Engineering Indian Institute of Technology, Madras Lecture No. # 31 Recursive Sets, Recursively Innumerable Sets, Encoding

### Data Structures and Algorithms

Data Structures and Algorithms CS245-2016S-06 Binary Search Trees David Galles Department of Computer Science University of San Francisco 06-0: Ordered List ADT Operations: Insert an element in the list

### Two-level logic using NAND gates

CSE140: Components and Design Techniques for Digital Systems Two and Multilevel logic implementation Tajana Simunic Rosing 1 Two-level logic using NND gates Replace minterm ND gates with NND gates Place

### Bangalore University B.Sc Computer Science Syllabus ( Semester System)

Bangalore University B.Sc Computer Science Syllabus ( Semester System) First Semester CSIT1: Computer Fundamentals and C Programming CSIP1: C Programming Lab Second Semester CSIIT1: Data Structures and

### BSc (Hons) Business Information Systems, BSc (Hons) Computer Science with Network Security. & BSc. (Hons.) Software Engineering

BSc (Hons) Business Information Systems, BSc (Hons) Computer Science with Network Security & BSc. (Hons.) Software Engineering Cohort: BIS/05/FT BCNS/05/FT BSE/05/FT Examinations for 2005-2006 / Semester

### Class XII (Theory) C++

Class XII (Theory) C++ Duration: 3 hours Total Marks: 70 Unit No. Unit Name Marks 1. OBJECT ORIENTED PROGRAMMING IN C++ 30 2. DATA STRUCTURE 14 3. DATABASE MANAGEMENT SYSTEM AND SQL 8 4. BOOLEAN ALGEBRA

### Specimen 2015 am/pm Time allowed: 1hr 30mins

SPECIMEN MATERIAL GCSE COMPUTER SCIENCE 8520/1 Paper 1 Specimen 2015 am/pm Time allowed: 1hr 30mins Materials There are no additional materials required for this paper. Instructions Use black ink or black

### Software Testing. Definition: Testing is a process of executing a program with data, with the sole intention of finding errors in the program.

Software Testing Definition: Testing is a process of executing a program with data, with the sole intention of finding errors in the program. Testing can only reveal the presence of errors and not the

### Induction and Recursion

Induction and Recursion Jan van Eijck June 3, 2003 Abstract A very important proof method that is not covered by the recipes from Chapter 3 is the method of proof by Mathematical Induction. Roughly speaking,

### 2013 Five years Integrated M.Sc.(IT) Semester 1 060010101 - Fundamentals of Programming

03 Five years Integrated M.Sc.(IT) Semester 00000 - Fundamentals Programming File should contain. Problem Statement. Algorithm 3. Flowchart. Program in C language(code) 5. Output and sample calculation

### Data Structure and Algorithm I Midterm Examination 120 points Time: 9:10am-12:10pm (180 minutes), Friday, November 12, 2010

Data Structure and Algorithm I Midterm Examination 120 points Time: 9:10am-12:10pm (180 minutes), Friday, November 12, 2010 Problem 1. In each of the following question, please specify if the statement

### CS 16: Assembly Language Programming for the IBM PC and Compatibles

CS 16: Assembly Language Programming for the IBM PC and Compatibles First, a little about you Your name Have you ever worked with/used/played with assembly language? If so, talk about it Why are you taking

### VALLIAMMAI ENGINEERING COLLEGE SRM Nagar, Kattankulathur

VALLIAMMAI ENGINEERING COLLEGE SRM Nagar, Kattankulathur 603 203. DEPARTMENT OF ELECTRONICS & COMMUNICATION ENGINEERING QUESTION BANK SUBJECT CODE/NAME YEAR/ SEMESTER : EC6302/ DIGITAL ELECTRONICS : II

### Pseudo code Tutorial and Exercises Teacher s Version

Pseudo code Tutorial and Exercises Teacher s Version Pseudo-code is an informal way to express the design of a computer program or an algorithm in 1.45. The aim is to get the idea quickly and also easy

### Introduction. The Quine-McCluskey Method Handout 5 January 21, 2016. CSEE E6861y Prof. Steven Nowick

CSEE E6861y Prof. Steven Nowick The Quine-McCluskey Method Handout 5 January 21, 2016 Introduction The Quine-McCluskey method is an exact algorithm which finds a minimum-cost sum-of-products implementation

### Chapter 4 BOOLEAN ALGEBRA AND THEOREMS, MIN TERMS AND MAX TERMS

Chapter 4 BOOLEAN ALGEBRA AND THEOREMS, MIN TERMS AND MAX TERMS Lesson 5 BOOLEAN EXPRESSION, TRUTH TABLE and product of the sums (POSs) [MAXTERMS] 2 Outline POS two variables cases POS for three variable

### Combinational Logic Circuits

Chapter 2 Combinational Logic Circuits J.J. Shann Chapter Overview 2-1 Binary Logic and Gates 2-2 Boolean Algebra 2-3 Standard Forms 2-4 Two-Level Circuit Optimization 2-5 Map Manipulation 補 充 資 料 :Quine-McCluskey

### Common Data Structures

Data Structures 1 Common Data Structures Arrays (single and multiple dimensional) Linked Lists Stacks Queues Trees Graphs You should already be familiar with arrays, so they will not be discussed. Trees

### PART-A Questions. 2. How does an enumerated statement differ from a typedef statement?

1. Distinguish & and && operators. PART-A Questions 2. How does an enumerated statement differ from a typedef statement? 3. What are the various members of a class? 4. Who can access the protected members

### 1.10 (a) Effects of logic gates AND, OR, NOT on binary signals in a processor

Chapter 1.10 Logic Gates 1.10 (a) Effects of logic gates AND, OR, NOT on binary signals in a processor Microprocessors are the central hardware that runs computers. There are several components that make

### Combinational circuit. Fig. 4-1 Block Diagram of Combinational Circuit Prentice Hall, Inc. M. Morris Mano DIGITAL DESIGN, 3e.

n inputs ombinational circuit m outputs Fig. 4- Block Diagram of ombinational ircuit 22 Prentice Hall, Inc. A B T 2 F A B T T 3 F 2 A B A F 2 B Fig. 4-2 Logic Diagram for Analysis Example 22 Prentice Hall,

### Combinational circuits

Combinational circuits Combinational circuits are stateless The outputs are functions only of the inputs Inputs Combinational circuit Outputs 3 Thursday, September 2, 3 Enabler Circuit (High-level view)

### CH3 Boolean Algebra (cont d)

CH3 Boolean Algebra (cont d) Lecturer: 吳 安 宇 Date:2005/10/7 ACCESS IC LAB v Today, you ll know: Introduction 1. Guidelines for multiplying out/factoring expressions 2. Exclusive-OR and Equivalence operations

### CSEE 3827: Fundamentals of Computer Systems. Standard Forms and Simplification with Karnaugh Maps

CSEE 3827: Fundamentals of Computer Systems Standard Forms and Simplification with Karnaugh Maps Agenda (M&K 2.3-2.5) Standard Forms Product-of-Sums (PoS) Sum-of-Products (SoP) converting between Min-terms

### MLR Institute of Technology

MLR Institute of Technology DUNDIGAL 500 043, HYDERABAD COMPUTER SCIENCE AND ENGINEERING Computer Programming Lab List of Experiments S.No. Program Category List of Programs 1 Operators a) Write a C program

### Mathematical induction & Recursion

CS 441 Discrete Mathematics for CS Lecture 15 Mathematical induction & Recursion Milos Hauskrecht milos@cs.pitt.edu 5329 Sennott Square Proofs Basic proof methods: Direct, Indirect, Contradiction, By Cases,

### AP Computer Science Java Mr. Clausen Program 9A, 9B

AP Computer Science Java Mr. Clausen Program 9A, 9B PROGRAM 9A I m_sort_of_searching (20 points now, 60 points when all parts are finished) The purpose of this project is to set up a program that will

### CS 141: Introduction to (Java) Programming: Exam 1 Jenny Orr Willamette University Fall 2013

Oct 4, 2013, p 1 Name: CS 141: Introduction to (Java) Programming: Exam 1 Jenny Orr Willamette University Fall 2013 1. (max 18) 4. (max 16) 2. (max 12) 5. (max 12) 3. (max 24) 6. (max 18) Total: (max 100)

### Computer Organization I. Lecture 8: Boolean Algebra and Circuit Optimization

Computer Organization I Lecture 8: Boolean Algebra and Circuit Optimization Overview The simplification from SOM to SOP and their circuit implementation Basics of Logic Circuit Optimization: Cost Criteria

### Logic Revision. AQA AS-Level Computing COMP2. 98 minutes. 95 marks. Page 1 of 40

Logic Revision AQA AS-Level Computing COMP2 2014 98 minutes 95 marks Page 1 of 40 Q1. The figure below shows a logic circuit. (a) Complete the truth table below for the logic circuit shown in the above

### Section IV.1: Recursive Algorithms and Recursion Trees

Section IV.1: Recursive Algorithms and Recursion Trees Definition IV.1.1: A recursive algorithm is an algorithm that solves a problem by (1) reducing it to an instance of the same problem with smaller