ExamSIDE (Powered by ExamGOAL)
Questions
PREVIOUS NEXT
1
GATE CSE 2012
MCQ (Single Correct Answer)
+1
-0.3
What is the correct translation of the following statement into mathematical logic? "Some real numbers are rational"
A
$$\exists x\left( {real\left( x \right) \vee rational\left( x \right)} \right)$$
B
$$\forall x\left( {real\left( x \right) \to rational\left( x \right)} \right)$$
C
$$\exists x\left( {real\left( x \right) \wedge rational\left( x \right)} \right)$$
D
$$\exists x\left( {rational\left( x \right) \to real\left( x \right)} \right)$$
2
GATE CSE 2012
MCQ (Single Correct Answer)
+1
-0.3
The truth table GATE CSE 2012 Discrete Mathematics - Mathematical Logic Question 36 English

Represents the Boolean function

A
$$X$$
B
$$X+Y$$
C
$$X \oplus Y$$
D
$$Y$$
3
GATE CSE 2008
MCQ (Single Correct Answer)
+1
-0.3
A set of Boolean connectives is functionally complete if all Boolean function can be synthesized using those, Which of the following sets of connectives is NOT functionally complete?
A
EX-NOR
B
implication, negation
C
OR, negation
D
NAND
4
GATE CSE 2004
MCQ (Single Correct Answer)
+1
-0.3
Identify the correct translation into logical notation of the following assertion.

$$Some\,boys\,in\,the\,class\,are\,taller\,than\,all\,the\,girls$$
Note: taller$$\left( {x,\,y} \right)$$ is true if $$x$$ is taller than $$y$$.

A
$$\left( {\exists x} \right)\left( {boy\left( x \right) \to \left( {\forall y} \right)\left( {girl\left( y \right) \wedge taller\left( {x,y} \right)} \right)} \right)$$
B
$$\left( {\exists x} \right)\left( {boy\left( x \right) \wedge \left( {\forall y} \right)\left( {girl\left( y \right) \wedge taller\left( {x,y} \right)} \right)} \right)$$
C
$$\left( {\exists x} \right)\left( {boy\left( x \right) \to \left( {\forall y} \right)\left( {girl\left( y \right) \to taller\left( {x,y} \right)} \right)} \right)$$
D
$$\left( {\exists x} \right)\left( {boy\left( x \right) \wedge \left( {\forall y} \right)\left( {girl\left( y \right) \to taller\left( {x,y} \right)} \right)} \right)$$
PREVIOUS NEXT
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 P and NP Concepts Dynamic Programming
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
Numerical Ability Logical Reasoning Verbal 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 CETKCETCOMEDKVITEEEAP EAPCET
Medical
NEET
Graduate Aptitude Test in Engineering
GATE CSEGATE ECEGATE EEGATE MEGATE CEGATE PIGATE IN
Civil Services
UPSC Civil Service
Defence
NDA
CBSE
Class 12