ExamSIDE
Questions
PREVIOUS NEXT
1
GATE CSE 1999
MCQ (Single Correct Answer)
+1
-0.3
Consider the regular expression $$(0+1)(0+1).......n$$ times. The minimum state finite automation that recognizes the language represented by this regular expression contains:
A
$$n$$ states
B
$$n+1$$ states
C
$$n+2$$ states
D
None of the above
2
GATE CSE 1998
MCQ (Single Correct Answer)
+1
-0.3
If the regular set $$A$$ is represented by $$A = {\left( {01 + 1} \right)^ * }$$ and the regular set $$'B'$$ is represented by $$B = \left( {{{\left( {01} \right)}^ * }{1^ * }} \right),$$ which of the following is true?
A
$$A \subset B$$
B
$$B \subset A$$
C
$$A$$ and $$B$$ are incomparable
D
$$A=B$$
3
GATE CSE 1998
MCQ (More than One Correct Answer)
+1
-0.3
The string $$1101$$ does not belong to the set represented by
A
$${110^ * }\,\,\left( {0 + 1} \right)$$
B
$$\,1\,{\left( {0 + 1} \right)^ * }101$$
C
$${\left( {10} \right)^ * }\,{\left( {01} \right)^ * }\,{\left( {00 + 11} \right)^ * }$$
D
$${\left( {00 + {{\left( {11} \right)}^ * }0} \right)^ * }$$
4
GATE CSE 1998
MCQ (Single Correct Answer)
+1
-0.3
Which of the following sets can be recognized by a Deterministic Finite-state Automation?
A
The numbers $$1, 2, 4, 8, $$ ...... $${2^n},$$ ............. written in binary.
B
The numbers $$1, 2, 4, ..... $$ $${2^n},$$ $$.....$$ written in unary.
C
The set of binary strings in which the numbers of zeros is the same as the numbers of ones.
D
The set $$\left\{ {1,101,11011,1110111,...} \right\}.$$
PREVIOUS NEXT
GATE CSE Subjects
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
Theory of Computation
Finite Automata and Regular Language Push Down Automata and Context Free Language Recursively Enumerable Language and Turing Machine Undecidability
Operating Systems
Process Concepts and Cpu Scheduling Synchronization and Concurrency File System IO and Protection Deadlocks Memory Management
Digital Logic
Number Systems Boolean Algebra K Maps Combinational Circuits Sequential Circuits
Computer Organization
Computer Arithmetic Memory Interfacing Machine Instructions and Addressing Modes IO Interface Pipelining Alu Data Path and Control Unit Secondary Memory
Database Management System
Er Diagrams Functional Dependencies and Normalization Structured Query Language Relational Algebra Transactions and Concurrency File Structures and Indexing
Data Structures
Arrays Stacks and Queues Linked List Trees Graphs Hashing
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
Algorithms
Complexity Analysis and Asymptotic Notations Searching and Sorting Divide and Conquer Method Greedy Method Dynamic Programming P and NP Concepts
Compiler Design
Lexical Analysis Parsing Syntax Directed Translation Code Generation and Optimization
Software Engineering
Software Engineering
Web Technologies
Web Technologies
General Aptitude
Verbal Ability Numerical Ability
EXAM MAP
Joint Entrance Examination
JEE MainJEE AdvancedWB JEEBITSATMHT CET
Medical
NEET
Graduate Aptitude Test in Engineering
GATE CSEGATE ECEGATE EEGATE MEGATE CEGATE PIGATE IN