ExamSIDE (Powered by ExamGOAL)
Questions
PREVIOUS NEXT
1
GATE CSE 2008
MCQ (Single Correct Answer)
+2
-0.6
Match the following $$NFAs$$ with the regular expressions they correspond to GATE CSE 2008 Theory of Computation - Finite Automata and Regular Language Question 42 English 1 GATE CSE 2008 Theory of Computation - Finite Automata and Regular Language Question 42 English 2 GATE CSE 2008 Theory of Computation - Finite Automata and Regular Language Question 42 English 3 GATE CSE 2008 Theory of Computation - Finite Automata and Regular Language Question 42 English 4 GATE CSE 2008 Theory of Computation - Finite Automata and Regular Language Question 42 English 5
A
$$P - 2,\,Q - 1,\,R - 3,\,S - 4$$
B
$$P - 1,\,Q - 3,\,R - 2,\,S - 4$$
C
$$P - 1,\,Q - 2,\,R - 3,\,S - 4$$
D
$$P - 3,\,Q - 2,\,R - 1,\,S - 4$$
2
GATE CSE 2007
MCQ (Single Correct Answer)
+2
-0.6
A minimum state deterministic finite automation accepting the language $$L = \left\{ {w\left| {w \in } \right.\,\,{{\left\{ {0,1} \right\}}^ * },\,\,} \right.$$ number of $$0'$$s and $$1'$$s in $$w$$ are divisible by $$3$$ and $$5$$, respectively$$\left. \, \right\}$$ has
A
$$15$$ states
B
$$11$$ states
C
$$10$$ states
D
$$9$$ states
3
GATE CSE 2007
MCQ (Single Correct Answer)
+2
-0.6
Which of the following languages is regular?
A
$$\left\{ {w{w^R}} \right.\left| {w \in \left\{ {0,\,1} \right\}\left. {^ + } \right\}} \right.$$
B
$$\left\{ {w{w^R}} \right.x\left| {x,w \in \left\{ {0,\,1} \right\}\left. {^ + } \right\}} \right.$$
C
$$\left\{ {wx{w^R}} \right.\left| {x,w \in \left\{ {0,\,1} \right\}\left. {^ + } \right\}} \right.$$
D
$$\left\{ {xw{w^R}} \right.\left| {x,w \in \left\{ {0,\,1} \right\}\left. {^ + } \right\}} \right.$$
4
GATE CSE 2007
MCQ (Single Correct Answer)
+2
-0.6
Consider the following finite state automation GATE CSE 2007 Theory of Computation - Finite Automata and Regular Language Question 45 English

The language accepted by this automation is given by the regular expression

A
$${b^ * }a{b^ * }a{b^ * }a{b^ * }$$
B
$${\left( {a + b} \right)^ * }$$
C
$${b^ * }a{\left( {a + b} \right)^ * }$$
D
$${b^ * }a{b^ * }a{b^ * }$$
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 Dynamic Programming P and NP Concepts
Digital Logic
K Maps Boolean Algebra Combinational Circuits Number Systems Sequential Circuits
Database Management System
Structured Query Language Transactions and Concurrency Functional Dependencies and Normalization Relational Algebra File Structures and Indexing Er Diagrams
Data Structures
Arrays Stacks and Queues Linked List Trees Graphs Hashing
Computer Networks
Concepts of Layering Lan Technologies and Wi-Fi Data Link Layer and Switching Network Layer Routing Algorithm TCP UDP Sockets and Congestion Control Application Layer Protocol Network Security
Software Engineering
Software Engineering
Compiler Design
Lexical Analysis Parsing Syntax Directed Translation Code Generation and Optimization
Web Technologies
Web Technologies
General Aptitude
Numerical Ability Verbal Ability
Discrete Mathematics
Graph Theory Set Theory & Algebra Combinatorics Mathematical Logic Probability Linear Algebra Calculus
Programming Languages
Basic of Programming Language Function and Recursion Pointer and Structure in C
Computer Organization
Computer Arithmetic Memory Interfacing Machine Instructions and Addressing Modes IO Interface Pipelining Alu Data Path and Control Unit 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