GATE 2014 A Brief Analysis (Based on student test experiences in the stream of CS on 1 st March, Second Session)
|
|
- Edwina Berry
- 5 years ago
- Views:
Transcription
1 GATE 4 A Brief Analysis (Based on student test experiences in the stream of CS on st March, 4 - Second Session) Section wise analysis of the paper Mark Marks Total No of Questions Engineering Mathematics Data Structures and Algorithms 5 5 DBMS 3 5 Theory of Computation 4 Compiler Design Computer Organization 3 4 Computer Networks 3 5 Digital Logic 3 Operating systems 3 5 Software Engineering and Web Technologies Verbal Ability 4 Numerical Ability written permission. Discuss this question paper at
2 Types of questions asked from each section Engineering Mathematics Data Structures and Algorithms DBMS Theory of Computation Compiler Design Computer Organization Computer Networks Digital Logic Operating Systems SEWT There were questions from Graph, Calculus, Functions, Probability, Matrices and Predicate Logic Questions from C-programs, Time Complexity, NP Complete, Quick sort, Analyzing Algorithms Questions from finding candidate keys, Normal Forms, Minimal Cover, SQL, Conflict Serializability Questions from Regular Expression, Finite Automata, Closure Properties Questions from SR and RR Conflicts, Code Optimization Questions from addressing mode, Cache Organization Questions from Network Security, Routing Protocols, Efficiency of SR Protocol Questions from Multiplexer, SOP, Radix Questions from SRTF, Optimal Page Replacement, Mutli threading Matching question on software models written permission. Discuss this question paper at
3 Question s & Solutions for nd March ( nd Session Paper ) Consider minterm expansion of the function F F(P,Q,R,S) =,,5,7,8,,3,5 Where minterms, 7, 8, 3 are do not care terms. The minimal Sum of Product form of F is (A) QS Solution: (B) QS (B) QS QS (C) QRS QRS QRS QRS (D) PQS PQS PQS PQS RS PQ X X Minimal SOP form QS Q S X X. Let X, Y be finite sets and F: XY be a function. Which of the following statement is TRUE? (A) For any subsets A and B of X, f A B f A f B (B) For any subsets A and B of X, f A B f A f B (C) For any subsets A and B of X, f A B min f A, f B (D) For any subsets S and T of Y, f S T f S f T Solution: (D) 3. Consider the following four pipeline systems P: Four pipeline stages with delay,,, P: Four pipeline stages with delay,.5,.5,.5 P3: Five pipeline stages with delay.5,,,.6, P4: Five pipeline stages with delay.5,.5,,,. Which of the following has peak clock cycle rate? Solution: (A) (A) P (B) P (C) P3 (D) P4 4. Which of the following statement is true about every nxn matrix with only real eigen values? (A) If trace of matrix is positive and the determinant of the matrix is negative, at least one of its eigen values is negative (B) If the trace of the matrix is positive, all its eigen values are positive (C) If the determinant of the matrix is positive, all its eigen values are positive (D) If the product of the trace and determinant of the matrix is positive, all its eigen values are positive written permission. Discuss this question paper at 3
4 Solution: (A) If either the trace or determinant is positive, there is at least one positive eigen value. Trace of matrix is positive and the determinant of the matrix is negative, this is possible only when there is odd number of negative eigen values. Hence at least one eigen value is negative. 5. If x sin x dx K, then the value of K is Solution: x sin x dx K x sin x dx x sin x dx K x sin x dx x sin x dx K x cos x sin x x cos x sin x K 4 K K 4 6. Consider the following combinational function block involving four Boolean variable x, y, a, b where x, a, b are inputs and y is the output. F(x, y, a, b) { } If (x is ) y = a; else y = b; Which of the following digital block is most suitable for implementing the function? (A) Full Adder (C) Multiplexer (B) Priority Encoder (D) Flip flop b a I I MUX y x written permission. Discuss this question paper at 4
5 7. Let G be a group with 5 elements. Let L be a subgroup of G. It is known that LG and that the size of L is at least 4. The size of L is Solution: Order of subgroup divides order of group (Lagrange s theorem). 3, 5 and 5 can be the order of subgroup. As subgroup has at least 4 elements and it is not equal to the given group, also order of subgroup can t be 3 and 5. Hence it is The smallest length of the string not generated by the given regular expression is a * b * (ba) * a * Solution: Smallest length is 3 and string is bab. 9. Consider the following statements: P: Good mobile phones are not cheap Q: Cheap mobile phones are not good L: P implies Q M: Q implies P N: P is equivalent to Q Solution: (D) (A) Only L is true (C) Only N is true (B) Only M is true (D) L, M, N are true g : mobile is good c : mobile is cheap P : Good mobile phones are not cheap g c g c Q a b a b Q : Cheap mobile phones are not good c g c g Both P and Q are equivalent which means P and Q imply each other. If V and V are four dimensional subspace of a six dimensional vector space V then the smallest possible dimension of V V is. Consider = {a,b} and * denotes all possible string that can be generated by {a,b}, and (A) (B) (C) (D) * is the power set of *. Which of the following is true? * is countable * is uncountable * is countable * is countable * is uncountable * is countable * is uncountable * is uncountable With diagonalization we can prove that * is uncountable and * is countable as one to one mapping is possible with natural numbers. written permission. Discuss this question paper at 5
6 . Consider the set of all functions, f: {,,., 4}{,,., 4} such that f(f(i))= i i4. Solution: (B) Consider the following statements: P: For each such function it must be the case that for every i, f(i) = i Q: For each such function it must be the case that for some i, f(i) = i R: Each such function must be onto. Which of the following is CORRECT? (A) P, Q and R are true (C) Only P and Q are true P : For example, let f and f f f f and f f f f f i i but f i i P is not true. (B) Only Q and R are true (D) Only R is true For some i, f(i) = i since there are odd number of elements in the set on which function is defined. 3. The value of the integral given below is x cos xdx Solution: (A) (A) - (B) (C) - (D) x cos x dx x sin x x cos x sin x O sin cos sin. o 4. Consider a basic block a = b+c c = a+d d = b+c e = d-b a = e+b Maximum number of nodes and edges in DAG generated for the above block (A) 6, 6 (B) 9, (C) 8, (D) 4, 4 written permission. Discuss this question paper at 6
7 c d e a a d c b 5. Consider a decision problem CNFSAT = { is satisfiable propositional formula in CNF with at most literals per clauses} For example Solution: (B) = (x x ) (x x 3 The decision problem CNFSAT is (A) NP- complete ) (x x 4 ) a Boolean formula CNFSAT (B) Solvable in P time by reduction to directed graph reachability problem (C) Solves in constant time if every input sequence is satisfiable (D) NP hard but not NP complete 6. With respect to the numerical evaluation of the definite integral, K b x dx a, where a and b are given, which of the following is/are TRUE? I. The value of K obtained using Trapezoidal rule is always greater than or equal to the exact value of the definite integral. II. The value of K obtained using Simpson s rule is always equal to the exact value of the definite integral. (A) I only (B) II only (C) Both I and II (D) Neither I nor II Let us consider 3 x x dx up to 5decimals 3 3 o Let n = 4 written permission. Discuss this question paper at 7
8 x y x y y y y y 3 4 h x dx y y 4 y y y3 (By trapezoidal rule) Clearly the value is greater than.33333, also for greater values of n there will be slight difference, hence given integral is always greater than Using Simpson s rd 3 rule h x dx y y 4 y 4 y y3 o up to 5 decimals, which is equal to exact value. 7. J Q J Q J Q C C C K Q K Q K Q The above synchronous sequential circuit built using JK flip flops is initialized with Q Q Q =. The state sequence for this circuit for the next three clock cycles is (A),, (B),, (C),, (D),, P.S. FF inputs Q Q Q J K J K J K Q Q Q Q Q Q N.S. Q Q Q written permission. Discuss this question paper at 8
9 8. Which of the following decision problem is undecidable? Solution: (A) (A) Ambiguity problem of context free grammar (B)If the string generated by the context free grammar (C) If context free grammar generates empty language (D) If context free grammar generates finite language There is no algorithm for determining the ambiguity of a given CFG, hence it is undecidable. 9. A cache memory has memory access time for read operation as ns if cache hit occurs and 5ns for read operation if cache miss occurs. Memory access time for write operation is ns if cache hit occurs and ns for write operation if cache miss occurs. Suppose instruction fetch operations, 6 memory operand read operations and 4 memory operand write operations are being performed. The cache hit rate is.9, what is the average execution time for the instruction? Solution: For fetch operation 9 ns + 5ns = 4ns Memory operand read operation 54ns + 3ns = 84 ns Memory operand write operation 7ns+4ns = ns Total time for instruction is = 336ns Average time is 3.36ns.. Consider the five stage pipeline system with Instruction Fetch (IF), Instruction Decode and Register Fetch (ID/RF), Execute (EX), Memory access( MEM) and Write Back (WB) operations. The respective stages are taking time ns,.ns, ns, ns,.75ns. A modification is proposed on this pipeline system and ID/RF stage is further divided in ID, RF and RF taking./3ns each, further EX stage is also divided in EX and EX each taking equal time. If the instruction is a branch instruction, next instruction pointer will be available at the end of EX stage of first pipeline and after EX for the second pipeline. All instruction other than branch instruction have average CPI as. % instructions are branch instruction. If time average access time for first pipeline is P and for second is Q, the ratio of P & Q is Solution: T avg = (+ stall frequency Stall cycle) T clock TP avg = (+. ).ns = 3.8ns TQ avg = (+. 5) ns = ns IF ID/RF stall EX stall IF For first pipeline stall cycles P.54 Q IF ID stall RF stall RF EX EX stall stall stall IF For second pipeline 5 stall cycles. If G is a forest with n vertices and k connected components, how may edges does G have? (A) n k (B) n k (C) n k (D) n k written permission. Discuss this question paper at 9
10 Forest is collection of trees and in a forest each tree will form one connected component. Assume that there are k connected components where each is having n, n, n3.. nk vertices respectively. Total number of edges in a forest with n vertices and k connected components will be as follows n n n... n n n n... n...k times 3 k 3 k n k. Let denotes the minimum degree of vertex in a graph. For all planar graphs on n vertices with 3, which of the following is TRUE? (A) In any planar embedding, the number of faces is at least n (B) In any planar embedding, the number of faces is less than n (C) There is a planar embedding in which the number of faces is less than n (D) There is a planar embedding in which the number of faces is at most n 3. The correct formula for the sentence not all rainy days are cold is (A) d Rainy d ~ Cold d (B) d ~ Rainy d Cold d (C) d ~ Rainy d Cold d (D) d Rainy d ~ Cold d Solution: (D) not all rainy days are cold:~ d Rainy d Cold d ~ d ~ Rainy d Cold d d Rainy d ~ Cold d 4. Consider the following language defined over = {,,c} L = { n n n } L = {wcw r w {,}*} L 3 = {ww r w {,}*} Which of the above language can be recognized by deterministic pushdown automata? (A) None of the language (B) Only L (C) L & L (D) All the languages L and L are deterministic CFLs and so those can be recognized by deterministic PDA where as L 3 is not deterministic. written permission. Discuss this question paper at
11 5. Let S be a sample space and two mutually exclusive events A and B be such that AB = S. If P(.) denotes the probability of the event, the maximum value of P(A)P(B) is Solution: A B S Q P A B P S P A P B P A B P A P B [ A & B are M.E.] Let P A x P B x y P A P B x x dy d y d y x x ; ; dx dx dx y has maximum at x ymax.5 4 x 6. Let denotes the exclusive XOR operator. Let, denote binary constants. Consider following Boolean expression for F over two variables P and Q: F P, Q P P Q P Q Q The equivalent expression for F is (A) P Solution: (D) Q (B) P Q (C) P Q (D) P Q F P, Q P P Q P Q Q P PQ PQ PQ PQ Q PQ PQ PQ PQ P PQ P Q P PQ PQ PQ PQ Q PQ PQ Q Q P PQ PQ P Q 7. There are two elements x, y in a group (G,*) such that every element in the group can be written as a product of some number of x s and y s in some order. It is known that x*x = y*y=x*y*x*y=y*x*y*x=e where e is the identity element. The maximum number of elements in such a group is written permission. Discuss this question paper at
12 8. The table below has question wise data on the performance of students in an examination. The marks for each question are also listed. There is no negative or partial marking in the examination. Question Number Marks Answered Correctly Answered Wrongly Not attempted What is the average of the marks obtained by the class in the examination? (A).34 (B).74 (C) 3. (D) Average marks : While trying to collect an envelop I was losing consciousness. IV from under the table II, Mr. X fell down III Which of the above underlined parts of the sentences is NOT appropriate? (A) I (B) II (C) III (D) IV and Solution: (D) 3. If she how to calibrate the instrument, she done the experiment. (A) knows, will have (C) had known, could have (B) knew, had (D) should have known, would have 3. Choose the word that is opposite in meaning to the word coherent. (A) sticky (B) well-connected (C) rambling (D) friendly 3. Which number does not belong to the series below?, 5,, 7, 6, 37, 5, 64 (A) 7 (B) 37 (C) 64 (D) 6 written permission. Discuss this question paper at
13 33. Consider the equation: (756) 8 - (Y) 8 =(4364) 8, where (X) N stands for X to the base N. Find Y. (A) 634 (B) 737 (C) 34 (D) By the beginning of th century, several hypothesis were being proposed, suggesting a paradigm shift in our understanding of the universe. However the clinching evidence was provided by experimental measurements of the positions of a star which was directly behind our sun. Which of the following inference(s) may be drawn from the above paragraph? i. Our understanding of the universe changes based on the position of stars ii. Paradigm shift usually occur at the beginning of centuries iii. Stars are important objects in the universe iv. Experimental evidence was important in confirming this paradigm shift (A) i, ii & iv (B) iii only (C) i & iv (D) iv only 35. The Gross Domestic Product (GDP) in Rupees grew at 7% during -3. For international comparison, the GDP is compared in US dollars (USD) after conversion based on the market exchange rate. During the period -3 the exchange rate for the USD increased from Rs. 5/USD to Rs. 6/USD. India s GDP in USD during the period -3 (A) increased by 5% (B) decreased by 3% (C) decreased by % (D) decreased by % Solution: (B) 36. The ratio of Male to Female students in a college for 5 years is plotted in the following line graph. If the number of female students in and is equal, what is the ratio of male students in to male students in? Ratio of Male to Female students (A) : (B) : (C).5: (D).5: written permission. Discuss this question paper at 3
14 37. A dance program is scheduled for. am. Some students are participating in the program and they need to come hour earlier than the start of the event. These students should be accompanied by a parent. Other students and parents should come in time for the program. The instruction you think that is appropriate for this is Solution: (B) (A) Students should come at 9. am and parents should come at. am (B) Participating students should come at 9. am accompanied by a parent and other parents and students should come by. am (C) Students who are not participation should come by. am and they should not bring their parents. Participating students should come at 9. am. (D) Participating students should come before 9. am. Parents who accompany them should come at 9. am. All other should come at. am written permission. Discuss this question paper at 4
Fundamentals of Digital Design
Fundamentals of Digital Design Digital Radiation Measurement and Spectroscopy NE/RHP 537 1 Binary Number System The binary numeral system, or base-2 number system, is a numeral system that represents numeric
More informationNODIA AND COMPANY. GATE SOLVED PAPER Computer Science Engineering Theory of Computation. Copyright By NODIA & COMPANY
No part of this publication may be reproduced or distributed in any form or any means, electronic, mechanical, photocopying, or otherwise without the prior permission of the author. GATE SOLVED PAPER Computer
More informationPhiladelphia University Student Name: Student Number:
Philadelphia University Student Name: Student Number: Faculty of Engineering Serial Number: Final Exam, Second Semester: 2015/2016 Dept. of Computer Engineering Course Title: Logic Circuits Date: 08/06/2016
More informationPhiladelphia University Student Name: Student Number:
Philadelphia University Student Name: Student Number: Faculty of Engineering Serial Number: Final Exam, First Semester: 2017/2018 Dept. of Computer Engineering Course Title: Logic Circuits Date: 29/01/2018
More informationvidyarthiplus.com vidyarthiplus.com vidyarthiplus.com ANNA UNIVERSITY- COMBATORE B.E./ B.TECH. DEGREE EXAMINATION - JUNE 2009. ELECTRICAL & ELECTONICS ENGG. - FOURTH SEMESTER DIGITAL LOGIC CIRCUITS PART-A
More informationSolutions. 9. Ans. C. Memory size. 11. Ans. D. a b c d e f a d e b c f a b d c e f a d b c e f a b d e c f a d b e c f. 13. Ans. D. Merge sort n log n
Solutions. Ans. B. ~ p q ~ r ~ s ~ p q r s ~ ~ p q r s p ~ q r s ~ p q ~ r v ~ s For x only the above compound preposition is true.. Ans. B. Case I First bit is 0 Case II First bit is 6. Ans. A. # has
More informationFORMAL LANGUAGES, AUTOMATA AND COMPUTATION
FORMAL LANGUAGES, AUTOMATA AND COMPUTATION DECIDABILITY ( LECTURE 15) SLIDES FOR 15-453 SPRING 2011 1 / 34 TURING MACHINES-SYNOPSIS The most general model of computation Computations of a TM are described
More informationShared on QualifyGate.com
CS-GATE-05 GATE 05 A Brief Analysis (Based on student test experiences in the stream of CS on 8th February, 05 (Morning Session) Section wise analysis of the paper Section Classification Mark Marks Total
More informationCombinational Logic. Mantıksal Tasarım BBM231. section instructor: Ufuk Çelikcan
Combinational Logic Mantıksal Tasarım BBM23 section instructor: Ufuk Çelikcan Classification. Combinational no memory outputs depends on only the present inputs expressed by Boolean functions 2. Sequential
More informationNumber System. Decimal to binary Binary to Decimal Binary to octal Binary to hexadecimal Hexadecimal to binary Octal to binary
Number System Decimal to binary Binary to Decimal Binary to octal Binary to hexadecimal Hexadecimal to binary Octal to binary BOOLEAN ALGEBRA BOOLEAN LOGIC OPERATIONS Logical AND Logical OR Logical COMPLEMENTATION
More informationComputer Science Final Examination Friday December 14 th 2001
Computer Science 03 60 265 Final Examination Friday December 14 th 2001 Dr. Robert D. Kent and Dr. Alioune Ngom Last Name: First Name: Student Number: INSTRUCTIONS EXAM DURATION IS 3 HOURs. CALCULATORS,
More informationSample Test Paper - I
Scheme G Sample Test Paper - I Course Name : Computer Engineering Group Marks : 25 Hours: 1 Hrs. Q.1) Attempt any THREE: 09 Marks a) Define i) Propagation delay ii) Fan-in iii) Fan-out b) Convert the following:
More informationWORKBOOK. Try Yourself Questions. Electrical Engineering Digital Electronics. Detailed Explanations of
27 WORKBOOK Detailed Eplanations of Try Yourself Questions Electrical Engineering Digital Electronics Number Systems and Codes T : Solution Converting into decimal number system 2 + 3 + 5 + 8 2 + 4 8 +
More informationComputational Boolean Algebra. Pingqiang Zhou ShanghaiTech University
Computational Boolean Algebra Pingqiang Zhou ShanghaiTech University Announcements Written assignment #1 is out. Due: March 24 th, in class. Programming assignment #1 is out. Due: March 24 th, 11:59PM.
More informationDepartment of Electrical & Electronics EE-333 DIGITAL SYSTEMS
Department of Electrical & Electronics EE-333 DIGITAL SYSTEMS 1) Given the two binary numbers X = 1010100 and Y = 1000011, perform the subtraction (a) X -Y and (b) Y - X using 2's complements. a) X = 1010100
More informationELECTRONICS & COMMUNICATION ENGINEERING PROFESSIONAL ETHICS AND HUMAN VALUES
EC 216(R-15) Total No. of Questions :09] [Total No. of Pages : 02 II/IV B.Tech. DEGREE EXAMINATIONS, DECEMBER- 2016 First Semester ELECTRONICS & COMMUNICATION ENGINEERING PROFESSIONAL ETHICS AND HUMAN
More informationECE 2300 Digital Logic & Computer Organization
ECE 23 Digital Logic & Computer Organization Spring 28 Combinational Building Blocks Lecture 5: Announcements Lab 2 prelab due tomorrow HW due Friday HW 2 to be posted on Thursday Lecture 4 to be replayed
More informationAdders, subtractors comparators, multipliers and other ALU elements
CSE4: Components and Design Techniques for Digital Systems Adders, subtractors comparators, multipliers and other ALU elements Adders 2 Circuit Delay Transistors have instrinsic resistance and capacitance
More informationPropositional Logic. Logical Expressions. Logic Minimization. CNF and DNF. Algebraic Laws for Logical Expressions CSC 173
Propositional Logic CSC 17 Propositional logic mathematical model (or algebra) for reasoning about the truth of logical expressions (propositions) Logical expressions propositional variables or logical
More informationCSCI 1010 Models of Computa3on. Lecture 02 Func3ons and Circuits
CSCI 1010 Models of Computa3on Lecture 02 Func3ons and Circuits Overview Func3ons and languages Designing circuits from func3ons Minterms and the DNF Maxterms and CNF Circuit complexity Algebra of Boolean
More informationAnnouncements. Friday Four Square! Problem Set 8 due right now. Problem Set 9 out, due next Friday at 2:15PM. Did you lose a phone in my office?
N P NP Completeness Announcements Friday Four Square! Today at 4:15PM, outside Gates. Problem Set 8 due right now. Problem Set 9 out, due next Friday at 2:15PM. Explore P, NP, and their connection. Did
More informationLecture 10: Synchronous Sequential Circuits Design
Lecture 0: Synchronous Sequential Circuits Design. General Form Input Combinational Flip-flops Combinational Output Circuit Circuit Clock.. Moore type has outputs dependent only on the state, e.g. ripple
More informationKing Fahd University of Petroleum and Minerals College of Computer Science and Engineering Computer Engineering Department
King Fahd University of Petroleum and Minerals College of Computer Science and Engineering Computer Engineering Department Page 1 of 13 COE 202: Digital Logic Design (3-0-3) Term 112 (Spring 2012) Final
More informationCS6901: review of Theory of Computation and Algorithms
CS6901: review of Theory of Computation and Algorithms Any mechanically (automatically) discretely computation of problem solving contains at least three components: - problem description - computational
More informationCMP N 301 Computer Architecture. Appendix C
CMP N 301 Computer Architecture Appendix C Outline Introduction Pipelining Hazards Pipelining Implementation Exception Handling Advanced Issues (Dynamic Scheduling, Out of order Issue, Superscalar, etc)
More informationUndecidable Problems. Z. Sawa (TU Ostrava) Introd. to Theoretical Computer Science May 12, / 65
Undecidable Problems Z. Sawa (TU Ostrava) Introd. to Theoretical Computer Science May 12, 2018 1/ 65 Algorithmically Solvable Problems Let us assume we have a problem P. If there is an algorithm solving
More informationFor smaller NRE cost For faster time to market For smaller high-volume manufacturing cost For higher performance
University of California at Berkeley College of Engineering Department of Electrical Engineering and Computer Sciences EECS5 J. Wawrzynek Spring 22 2/22/2. [2 pts] Short Answers. Midterm Exam I a) [2 pts]
More informationShow that the dual of the exclusive-or is equal to its compliment. 7
Darshan Institute of ngineering and Technology, Rajkot, Subject: Digital lectronics (2300) GTU Question ank Unit Group Questions Do as directed : I. Given that (6)0 = (00)x, find the value of x. II. dd
More informationDigital Logic Design. Midterm #2
EECS: igital Logic esign r. nthony. Johnson s7m2s_dild7.fm - igital Logic esign Midterm #2 Problems Points. 5 2. 4 3. 6 Total 5 Was the exam fair? yes no EECS: igital Logic esign r. nthony. Johnson s7m2s_dild7.fm
More informationUNIVERSITY OF WISCONSIN MADISON
CS/ECE 252: INTRODUCTION TO COMPUTER ENGINEERING UNIVERSITY OF WISCONSIN MADISON Prof. Gurindar Sohi TAs: Minsub Shin, Lisa Ossian, Sujith Surendran Midterm Examination 2 In Class (50 minutes) Friday,
More informationMODULAR CIRCUITS CHAPTER 7
CHAPTER 7 MODULAR CIRCUITS A modular circuit is a digital circuit that performs a specific function or has certain usage. The modular circuits to be introduced in this chapter are decoders, encoders, multiplexers,
More informationIT T35 Digital system desigm y - ii /s - iii
UNIT - II Combinational Logic Adders subtractors code converters binary parallel adder decimal adder magnitude comparator encoders decoders multiplexers demultiplexers-binarymultiplier Parity generator
More informationELCT201: DIGITAL LOGIC DESIGN
ELCT201: DIGITAL LOGIC DESIGN Dr. Eng. Haitham Omran, haitham.omran@guc.edu.eg Dr. Eng. Wassim Alexan, wassim.joseph@guc.edu.eg Lecture 5 Following the slides of Dr. Ahmed H. Madian ذو الحجة 1438 ه Winter
More informationDigital Logic: Boolean Algebra and Gates. Textbook Chapter 3
Digital Logic: Boolean Algebra and Gates Textbook Chapter 3 Basic Logic Gates XOR CMPE12 Summer 2009 02-2 Truth Table The most basic representation of a logic function Lists the output for all possible
More informationBoolean Algebra and Digital Logic 2009, University of Colombo School of Computing
IT 204 Section 3.0 Boolean Algebra and Digital Logic Boolean Algebra 2 Logic Equations to Truth Tables X = A. B + A. B + AB A B X 0 0 0 0 3 Sum of Products The OR operation performed on the products of
More informationComputer Science. Questions for discussion Part II. Computer Science COMPUTER SCIENCE. Section 4.2.
COMPUTER SCIENCE S E D G E W I C K / W A Y N E PA R T I I : A L G O R I T H M S, T H E O R Y, A N D M A C H I N E S Computer Science Computer Science An Interdisciplinary Approach Section 4.2 ROBERT SEDGEWICK
More informationCS3719 Theory of Computation and Algorithms
CS3719 Theory of Computation and Algorithms Any mechanically (automatically) discretely computation of problem solving contains at least three components: - problem description - computational tool - analysis
More informationCSE 311: Foundations of Computing I Autumn 2014 Practice Final: Section X. Closed book, closed notes, no cell phones, no calculators.
CSE 311: Foundations of Computing I Autumn 014 Practice Final: Section X YY ZZ Name: UW ID: Instructions: Closed book, closed notes, no cell phones, no calculators. You have 110 minutes to complete the
More informationTotal Time = 90 Minutes, Total Marks = 100. Total /10 /25 /20 /10 /15 /20
University of Waterloo Department of Electrical & Computer Engineering E&CE 223 Digital Circuits and Systems Midterm Examination Instructor: M. Sachdev October 30th, 2006 Total Time = 90 Minutes, Total
More informationCS470: Computer Architecture. AMD Quad Core
CS470: Computer Architecture Yashwant K. Malaiya, Professor malaiya@cs.colostate.edu AMD Quad Core 1 Architecture Layers Building blocks Gates, flip-flops Functional bocks: Combinational, Sequential Instruction
More informationMAHARASHTRA STATE BOARD OF TECHNICAL EDUCATION (Autonomous) (ISO/IEC Certified)
WINTER 17 EXAMINATION Subject Name: Digital Techniques Model Answer Subject Code: 17333 Important Instructions to examiners: 1) The answers should be examined by key words and not as word-to-word as given
More informationon candidate s understanding. 7) For programming language papers, credit may be given to any other program based on equivalent concept.
WINTER 17 EXAMINATION Subject Name: Digital Techniques Model Answer Subject Code: 17333 Important Instructions to examiners: 1) The answers should be examined by key words and not as word-to-word as given
More information60-354, Theory of Computation Fall Asish Mukhopadhyay School of Computer Science University of Windsor
60-354, Theory of Computation Fall 2013 Asish Mukhopadhyay School of Computer Science University of Windsor Pushdown Automata (PDA) PDA = ε-nfa + stack Acceptance ε-nfa enters a final state or Stack is
More informationDelhi Noida Bhopal Hyderabad Jaipur Lucknow Indore Pune Bhubaneswar Kolkata Patna Web: Ph:
Serial : S_CS_C_Digital Logic_588 Delhi Noida hopal Hyderabad Jaipur Lucknow Indore Pune hubaneswar Kolkata Patna Web: E-mail: info@madeeasy.in Ph: -56 CLASS TEST 8-9 COMPUTER SCIENCE & IT Subject : Digital
More informationSpiking Neural P Systems with Anti-Spikes as Transducers
ROMANIAN JOURNAL OF INFORMATION SCIENCE AND TECHNOLOGY Volume 14, Number 1, 2011, 20 30 Spiking Neural P Systems with Anti-Spikes as Transducers Venkata Padmavati METTA 1, Kamala KRITHIVASAN 2, Deepak
More informationChapter 2. Reductions and NP. 2.1 Reductions Continued The Satisfiability Problem (SAT) SAT 3SAT. CS 573: Algorithms, Fall 2013 August 29, 2013
Chapter 2 Reductions and NP CS 573: Algorithms, Fall 2013 August 29, 2013 2.1 Reductions Continued 2.1.1 The Satisfiability Problem SAT 2.1.1.1 Propositional Formulas Definition 2.1.1. Consider a set of
More informationCPE100: Digital Logic Design I
Professor Brendan Morris, SEB 3216, brendan.morris@unlv.edu CPE100: Digital Logic Design I Final Review http://www.ee.unlv.edu/~b1morris/cpe100/ 2 Logistics Tuesday Dec 12 th 13:00-15:00 (1-3pm) 2 hour
More information3130CIT Theory of Computation
GRIFFITH UNIVERSITY School of Computing and Information Technology 3130CIT Theory of Computation Final Examination, Semester 2, 2006 Details Total marks: 120 (40% of the total marks for this subject) Perusal:
More informationCombinational Logic Design Combinational Functions and Circuits
Combinational Logic Design Combinational Functions and Circuits Overview Combinational Circuits Design Procedure Generic Example Example with don t cares: BCD-to-SevenSegment converter Binary Decoders
More informationCHAPTER1: Digital Logic Circuits Combination Circuits
CS224: Computer Organization S.KHABET CHAPTER1: Digital Logic Circuits Combination Circuits 1 PRIMITIVE LOGIC GATES Each of our basic operations can be implemented in hardware using a primitive logic gate.
More informationCOMBINATIONAL LOGIC FUNCTIONS
COMBINATIONAL LOGIC FUNCTIONS Digital logic circuits can be classified as either combinational or sequential circuits. A combinational circuit is one where the output at any time depends only on the present
More informationIntroduction to Kleene Algebras
Introduction to Kleene Algebras Riccardo Pucella Basic Notions Seminar December 1, 2005 Introduction to Kleene Algebras p.1 Idempotent Semirings An idempotent semiring is a structure S = (S, +,, 1, 0)
More informationBASIC MATHEMATICAL TECHNIQUES
CHAPTER 1 ASIC MATHEMATICAL TECHNIQUES 1.1 Introduction To understand automata theory, one must have a strong foundation about discrete mathematics. Discrete mathematics is a branch of mathematics dealing
More informationLogic. Combinational. inputs. outputs. the result. system can
Digital Electronics Combinational Logic Functions Digital logic circuits can be classified as either combinational or sequential circuits. A combinational circuit is one where the output at any time depends
More informationMC9211 Computer Organization
MC92 Computer Organization Unit : Digital Fundamentals Lesson2 : Boolean Algebra and Simplification (KSB) (MCA) (29-2/ODD) (29 - / A&B) Coverage Lesson2 Introduces the basic postulates of Boolean Algebra
More informationLOGIC CIRCUITS. Basic Experiment and Design of Electronics
Basic Experiment and Design of Electronics LOGIC CIRCUITS Ho Kyung Kim, Ph.D. hokyung@pusan.ac.kr School of Mechanical Engineering Pusan National University Outline Combinational logic circuits Output
More informationDigital Logic. CS211 Computer Architecture. l Topics. l Transistors (Design & Types) l Logic Gates. l Combinational Circuits.
CS211 Computer Architecture Digital Logic l Topics l Transistors (Design & Types) l Logic Gates l Combinational Circuits l K-Maps Figures & Tables borrowed from:! http://www.allaboutcircuits.com/vol_4/index.html!
More informationDO NOT OPEN THIS TEST BOOKLET UNTIL YOU ARE ASKED TO DO SO
DO NOT OPEN THIS TEST BOOKLET UNTIL YOU ARE ASKED TO DO SO T.B.C. : P-AQNA-L-ZNGU Serial No.- TEST BOOKLET MATHEMATICS Test Booklet Series Time Allowed : Two Hours and Thirty Minutes Maximum Marks : 00
More informationCP405 Theory of Computation
CP405 Theory of Computation BB(3) q 0 q 1 q 2 0 q 1 1R q 2 0R q 2 1L 1 H1R q 1 1R q 0 1L Growing Fast BB(3) = 6 BB(4) = 13 BB(5) = 4098 BB(6) = 3.515 x 10 18267 (known) (known) (possible) (possible) Language:
More informationTribhuvan University Institute of Science and Technology 2067
11CSc. MTH. -2067 Tribhuvan University Institute of Science and Technology 2067 Bachelor Level/First Year/ Second Semester/ Science Full Marks: 80 Computer Science and Information Technology Pass Marks:
More informationAdders, subtractors comparators, multipliers and other ALU elements
CSE4: Components and Design Techniques for Digital Systems Adders, subtractors comparators, multipliers and other ALU elements Instructor: Mohsen Imani UC San Diego Slides from: Prof.Tajana Simunic Rosing
More informationKUMARAGURU COLLEGE OF TECHNOLOGY COIMBATORE
Estd-1984 KUMARAGURU COLLEGE OF TECHNOLOGY COIMBATORE 641 006 QUESTION BANK UNIT I PART A ISO 9001:2000 Certified 1. Convert (100001110.010) 2 to a decimal number. 2. Find the canonical SOP for the function
More informationFinal Exam Comments. UVa - cs302: Theory of Computation Spring < Total
UVa - cs302: Theory of Computation Spring 2008 Final Exam Comments < 50 50 59 60 69 70 79 80 89 90 94 95-102 Total 2 6 8 22 16 16 12 Problem 1: Short Answers. (20) For each question, provide a correct,
More information} Some languages are Turing-decidable A Turing Machine will halt on all inputs (either accepting or rejecting). No infinite loops.
and their languages } Some languages are Turing-decidable A Turing Machine will halt on all inputs (either accepting or rejecting). No infinite loops. } Some languages are Turing-recognizable, but not
More informationChapter 7 Logic Circuits
Chapter 7 Logic Circuits Goal. Advantages of digital technology compared to analog technology. 2. Terminology of Digital Circuits. 3. Convert Numbers between Decimal, Binary and Other forms. 5. Binary
More informationCSE 105 THEORY OF COMPUTATION
CSE 105 THEORY OF COMPUTATION Spring 2017 http://cseweb.ucsd.edu/classes/sp17/cse105-ab/ Review of CFG, CFL, ambiguity What is the language generated by the CFG below: G 1 = ({S,T 1,T 2 }, {0,1,2}, { S
More informationMAHARASHTRA STATE BOARD OF TECHNICAL EDUCATION (Autonomous) (ISO/IEC Certified) State any two Boolean laws. (Any 2 laws 1 mark each)
Subject Code: 17333 Model Answer Page 1/ 27 Important Instructions to examiners: 1) The answers should be examined by key words and not as word-to-word as given in the model answer scheme. 2) The model
More informationUNIVERSITI TENAGA NASIONAL. College of Information Technology
UNIVERSITI TENAGA NASIONAL College of Information Technology BACHELOR OF COMPUTER SCIENCE (HONS.) FINAL EXAMINATION SEMESTER 2 2012/2013 DIGITAL SYSTEMS DESIGN (CSNB163) January 2013 Time allowed: 3 hours
More informationCSC9R6 Computer Design. Practical Digital Logic
CSC9R6 Computer Design Practical Digital Logic 1 References (for this part of CSC9R6) Hamacher et al: Computer Organization App A. In library Floyd: Digital Fundamentals Ch 1, 3-6, 8-10 web page: www.prenhall.com/floyd/
More informationINF2270 Spring Philipp Häfliger. Lecture 8: Superscalar CPUs, Course Summary/Repetition (1/2)
INF2270 Spring 2010 Philipp Häfliger Summary/Repetition (1/2) content From Scalar to Superscalar Lecture Summary and Brief Repetition Binary numbers Boolean Algebra Combinational Logic Circuits Encoder/Decoder
More informationClass Website:
ECE 20B, Winter 2003 Introduction to Electrical Engineering, II LECTURE NOTES #5 Instructor: Andrew B. Kahng (lecture) Email: abk@ece.ucsd.edu Telephone: 858-822-4884 office, 858-353-0550 cell Office:
More informationBoolean Algebra. Digital Logic Appendix A. Postulates, Identities in Boolean Algebra How can I manipulate expressions?
Digital Logic Appendix A Gates Combinatorial Circuits Sequential Circuits Other operations NAND A NAND B = NOT ( A ANDB) = AB NOR A NOR B = NOT ( A ORB) = A + B Truth tables What is the result of the operation
More informationPG - TRB UNIT-X- DIGITAL ELECTRONICS. POLYTECHNIC-TRB MATERIALS
SRIMAAN COACHING CENTRE-PG-TRB-PHYSICS- DIGITAL ELECTRONICS-STUDY MATERIAL-CONTACT: 8072230063 SRIMAAN PG - TRB PHYSICS UNIT-X- DIGITAL ELECTRONICS POLYTECHNIC-TRB MATERIALS MATHS/COMPUTER SCIENCE/IT/ECE/EEE
More informationFinal exam study sheet for CS3719 Turing machines and decidability.
Final exam study sheet for CS3719 Turing machines and decidability. A Turing machine is a finite automaton with an infinite memory (tape). Formally, a Turing machine is a 6-tuple M = (Q, Σ, Γ, δ, q 0,
More informationLecture 14: State Tables, Diagrams, Latches, and Flip Flop
EE210: Switching Systems Lecture 14: State Tables, Diagrams, Latches, and Flip Flop Prof. YingLi Tian Nov. 6, 2017 Department of Electrical Engineering The City College of New York The City University
More informationSection-I: General Ability. (A) 2880 (B) 1440 (C) 720 (D) 0 Key: (B)
Disclaimer - This data may not be accurate as it is based on memory of test takers. This will be a precise tool for students to understand the type of questions to expect in Numerical Ability, Verbal Ability
More informationDE58/DC58 LOGIC DESIGN DEC 2014
Q.2 a. In a base-5 number system, 3 digit representations is used. Find out (i) Number of distinct quantities that can be represented.(ii) Representation of highest decimal number in base-5. Since, r=5
More informationSystems I: Computer Organization and Architecture
Systems I: Computer Organization and Architecture Lecture 6 - Combinational Logic Introduction A combinational circuit consists of input variables, logic gates, and output variables. The logic gates accept
More informationDiscrete Mathematics. CS204: Spring, Jong C. Park Computer Science Department KAIST
Discrete Mathematics CS204: Spring, 2008 Jong C. Park Computer Science Department KAIST Today s Topics Sequential Circuits and Finite-State Machines Finite-State Automata Languages and Grammars Nondeterministic
More information211: Computer Architecture Summer 2016
211: Computer Architecture Summer 2016 Liu Liu Topic: Storage Project3 Digital Logic - Storage: Recap - Review: cache hit rate - Project3 - Digital Logic: - truth table => SOP - simplification: Boolean
More informationCOMPUTER SCIENCE TRIPOS
CST0.2017.2.1 COMPUTER SCIENCE TRIPOS Part IA Thursday 8 June 2017 1.30 to 4.30 COMPUTER SCIENCE Paper 2 Answer one question from each of Sections A, B and C, and two questions from Section D. Submit the
More informationDecidability (What, stuff is unsolvable?)
University of Georgia Fall 2014 Outline Decidability Decidable Problems for Regular Languages Decidable Problems for Context Free Languages The Halting Problem Countable and Uncountable Sets Diagonalization
More informationContext Free Languages: Decidability of a CFL
Theorem 14.1 Context Free Languages: Decidability of a CFL Statement: Given a CFL L and string w, there is a decision procedure that determines whether w L. Proof: By construction. 1. Proof using a grammar
More informationICS 233 Computer Architecture & Assembly Language
ICS 233 Computer Architecture & Assembly Language Assignment 6 Solution 1. Identify all of the RAW data dependencies in the following code. Which dependencies are data hazards that will be resolved by
More information( c) Give logic symbol, Truth table and circuit diagram for a clocked SR flip-flop. A combinational circuit is defined by the function
Question Paper Digital Electronics (EE-204-F) MDU Examination May 2015 1. (a) represent (32)10 in (i) BCD 8421 code (ii) Excess-3 code (iii) ASCII code (b) Design half adder using only NAND gates. ( c)
More informationCS 70 Discrete Mathematics and Probability Theory Fall 2016 Seshia and Walrand Midterm 1 Solutions
CS 70 Discrete Mathematics and Probability Theory Fall 2016 Seshia and Walrand Midterm 1 Solutions PRINT Your Name: Answer: Oski Bear SIGN Your Name: PRINT Your Student ID: CIRCLE your exam room: Dwinelle
More informationAppendix A: Digital Logic. Principles of Computer Architecture. Principles of Computer Architecture by M. Murdocca and V. Heuring
- Principles of Computer rchitecture Miles Murdocca and Vincent Heuring 999 M. Murdocca and V. Heuring -2 Chapter Contents. Introduction.2 Combinational Logic.3 Truth Tables.4 Logic Gates.5 Properties
More informationIntroduction to Theory of Computing
CSCI 2670, Fall 2012 Introduction to Theory of Computing Department of Computer Science University of Georgia Athens, GA 30602 Instructor: Liming Cai www.cs.uga.edu/ cai 0 Lecture Note 3 Context-Free Languages
More informationThe Design Procedure. Output Equation Determination - Derive output equations from the state table
The Design Procedure Specification Formulation - Obtain a state diagram or state table State Assignment - Assign binary codes to the states Flip-Flop Input Equation Determination - Select flipflop types
More informationGATE 2015 A Brief Analysis (Based on student test experiences in the stream of CS on 8th February, 2015 (Morning Session)
CS-GATE-05 GATE 05 A Brief Analysis (Based on student test experiences in the stream of CS on 8th February, 05 (Morning Session) Section wise analysis of the paper Section Classification Mark Marks Total
More informationBoolean Algebra. Digital Logic Appendix A. Boolean Algebra Other operations. Boolean Algebra. Postulates, Identities in Boolean Algebra
Digital Logic Appendix A Gates Combinatorial Circuits Sequential Circuits George Boole ideas 1854 Claude Shannon, apply to circuit design, 1938 (piirisuunnittelu) Describe digital circuitry function programming
More informationECEN 248: INTRODUCTION TO DIGITAL SYSTEMS DESIGN. Week 9 Dr. Srinivas Shakkottai Dept. of Electrical and Computer Engineering
ECEN 248: INTRODUCTION TO DIGITAL SYSTEMS DESIGN Week 9 Dr. Srinivas Shakkottai Dept. of Electrical and Computer Engineering TIMING ANALYSIS Overview Circuits do not respond instantaneously to input changes
More informationEE40 Lec 15. Logic Synthesis and Sequential Logic Circuits
EE40 Lec 15 Logic Synthesis and Sequential Logic Circuits Prof. Nathan Cheung 10/20/2009 Reading: Hambley Chapters 7.4-7.6 Karnaugh Maps: Read following before reading textbook http://www.facstaff.bucknell.edu/mastascu/elessonshtml/logic/logic3.html
More informationDesign of Distributed Systems Melinda Tóth, Zoltán Horváth
Design of Distributed Systems Melinda Tóth, Zoltán Horváth Design of Distributed Systems Melinda Tóth, Zoltán Horváth Publication date 2014 Copyright 2014 Melinda Tóth, Zoltán Horváth Supported by TÁMOP-412A/1-11/1-2011-0052
More informationDHANALAKSHMI COLLEGE OF ENGINEERING, CHENNAI DEPARTMENT OF COMPUTER SCIENCE AND ENGINEERING CS6201 DIGITAL PRINCIPLES AND SYSTEM DESIGN
DHANALAKSHMI COLLEGE OF ENGINEERING, CHENNAI DEPARTMENT OF COMPUTER SCIENCE AND ENGINEERING CS6201 DIGITAL PRINCIPLES AND SYSTEM DESIGN UNIT I : BOOLEAN ALGEBRA AND LOGIC GATES PART - A (2 MARKS) Number
More informationCSE140: Components and Design Techniques for Digital Systems. Midterm Information. Instructor: Mohsen Imani. Sources: TSR, Katz, Boriello & Vahid
CSE140: Components and Design Techniques for Digital Systems Midterm Information Instructor: Mohsen Imani Midterm Topics In general: everything that was covered in homework 1 and 2 and related lectures,
More informationComputational Models - Lecture 4
Computational Models - Lecture 4 Regular languages: The Myhill-Nerode Theorem Context-free Grammars Chomsky Normal Form Pumping Lemma for context free languages Non context-free languages: Examples Push
More informationReg. No. Question Paper Code : B.E./B.Tech. DEGREE EXAMINATION, NOVEMBER/DECEMBER Second Semester. Computer Science and Engineering
Sp 6 Reg. No. Question Paper Code : 27156 B.E./B.Tech. DEGREE EXAMINATION, NOVEMBER/DECEMBER 2015. Second Semester Computer Science and Engineering CS 6201 DIGITAL PRINCIPLES AND SYSTEM DESIGN (Common
More informationFinite-State Machines (Automata) lecture 12
Finite-State Machines (Automata) lecture 12 cl a simple form of computation used widely one way to find patterns 1 A current D B A B C D B C D A C next 2 Application Fields Industry real-time control,
More informationECE 407 Computer Aided Design for Electronic Systems. Simulation. Instructor: Maria K. Michael. Overview
407 Computer Aided Design for Electronic Systems Simulation Instructor: Maria K. Michael Overview What is simulation? Design verification Modeling Levels Modeling circuits for simulation True-value simulation
More information