GATE CSE 1989 | Push Down Automata and Context Free Language Question 59 | Theory of Computation

GATE CSE 1989

MCQ (More than One Correct Answer)

-0

Context free languages and regular languages are both closed under the operation(s) of :

Union

Intersection

Concatenation

Complementation

GATE CSE 1987

MCQ (Single Correct Answer)

-0.6

A context-free grammar is ambiguous if:

The grammar contains useless non-terminals.

It produces more than one parse tree for some sentence.

Some production has two non-terminals side by side on the right-hand side.

None of the above.

GATE CSE 1987

MCQ (Single Correct Answer)

-0.6

FORTRAN is:

Regular language.

Context free language.

Context sensitive language.

None-of the above.

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

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

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

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

Compiler Design

Lexical Analysis Parsing Syntax Directed Translation Code Generation and Optimization

Web Technologies

General Aptitude

Numerical Ability Logical Reasoning 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 Pipelining Machine Instructions and Addressing Modes Alu Data Path and Control Unit IO Interface Secondary Memory