GATE CSE 1991 | Undecidability Question 13 | Theory of Computation

GATE CSE 1991

MCQ (Single Correct Answer)

-0.6

Which one of the following is the strongest correct statement about a finite language over some finite alphabet $$\sum ? $$

It could be un-decidable

It is Turing-machine recognizable

It is a regular language

It is a context-sensitive language

GATE CSE 1990

MCQ (More than One Correct Answer)

-0

It is decidable whether:

An arbitrary Turing machine halts after 10 steps.

A Turing machine prints a specific letter.

A Turing machine computes the product of two numbers.

None of the above.

GATE CSE 1989

MCQ (More than One Correct Answer)

-0

Which of the following problems are un-decidable?

Membership problem in context - free languages.

Whether a given context - free language is regular.

Whether a finite state automation halts on all inputs.

Membership problem for type $$0$$ languages.

GATE CSE Subjects

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 Deadlocks Memory Management File System IO and Protection

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

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

Compiler Design

Lexical Analysis Parsing Syntax Directed Translation Code Generation and Optimization

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