ExamSIDE (Powered by ExamGOAL)
Questions
PREVIOUS
1
GATE CSE 2003
MCQ (Single Correct Answer)
+2
-0.6
The literal count of a Boolean expression is the sum of the number of times each literal appears in the expression. For example, the literal count of $$(xy + xz)$$ is $$4.$$ What are the minimum possible literal counts of the product -of -sum and sum -of-product representations respectively of the function given by the following Karnaugh map? Here, $$X$$ denotes “don’t care” GATE CSE 2003 Digital Logic - K Maps Question 6 English
A
$$(11, 9)$$
B
$$(9,13)$$
C
$$(9,10)$$
D
$$(11, 11)$$
2
GATE CSE 2000
MCQ (Single Correct Answer)
+2
-0.6
Which function does NOT implement the Karnaugh map given below? GATE CSE 2000 Digital Logic - K Maps Question 7 English
A
$$(w+x)y$$
B
$$x\,y + y\,w$$
C
$$\left( {w + x} \right)\,\,\left( {\overline w + y} \right)\left( {\overline x + y} \right)$$
D
None of the above
3
GATE CSE 1996
MCQ (Single Correct Answer)
+2
-0.6
What is the equivalent Boolean expression in product-of-sums form for the Karnaugh map given in fig? GATE CSE 1996 Digital Logic - K Maps Question 8 English
A
$$B\,\overline D + \overline B \,D$$
B
$$\left( {B + \overline C + D} \right)\left( {\overline B + C + \overline D } \right)$$
C
$$\left( {B + D} \right)\left( {\overline B + \overline D } \right)$$
D
$$\left( {B + \overline D } \right)\left( {\overline B + D} \right)$$
PREVIOUS
GATE CSE Subjects
Theory of Computation
Undecidability Finite Automata and Regular Language Push Down Automata and Context Free Language Recursively Enumerable Language and Turing Machine
Operating Systems
Process Concepts and Cpu Scheduling Synchronization and Concurrency File System IO and Protection Deadlocks Memory Management
Algorithms
Complexity Analysis and Asymptotic Notations Searching and Sorting Divide and Conquer Method Greedy Method Dynamic Programming P and NP Concepts
Digital Logic
Number Systems Boolean Algebra K Maps Combinational Circuits Sequential Circuits
Database Management System
Er Diagrams Functional Dependencies and Normalization Structured Query Language Relational Algebra Transactions and Concurrency File Structures and Indexing
Data Structures
Trees Hashing Arrays Linked List Graphs Stacks and Queues
Computer Networks
Network Security Data Link Layer and Switching Application Layer Protocol Network Layer Routing Algorithm Concepts of Layering Lan Technologies and Wi-Fi TCP UDP Sockets and Congestion Control
Software Engineering
Software Engineering
Compiler Design
Lexical Analysis Parsing Syntax Directed Translation Code Generation and Optimization
Web Technologies
Web Technologies
General Aptitude
Verbal Ability Numerical Ability
Discrete Mathematics
Mathematical Logic Probability Set Theory & Algebra Combinatorics Linear Algebra Graph Theory Calculus
Programming Languages
Basic of Programming Language Function and Recursion Pointer and Structure in C
Computer Organization
Computer Arithmetic Memory Interfacing Pipelining Machine Instructions and Addressing Modes Alu Data Path and Control Unit IO Interface Secondary Memory
EXAM MAP
Joint Entrance Examination
JEE MainJEE AdvancedWB JEEBITSATMHT CETKCETCOMEDKVITEEE
Medical
NEET
Graduate Aptitude Test in Engineering
GATE CSEGATE ECEGATE EEGATE MEGATE CEGATE PIGATE IN
CBSE
Class 12