Which of the following pairs have DIFFERENT expressive power n A Deterministic finite automata DFA and Non deterministic finite automata

Gate Question Papers:

Gate Select Another Category Select Another Topic

Exam

Gate Question Topics

Category (172)

General Ability (20)

General Knowledge(5)

HR Interview (166)

Interview(7)

Logical Reasoning (36)

Numerical Ability (131)

Programming (13)

Verbal Ability (13)

Advertisements

Previous Question: A company needs to develop digital signal processing software for one of its newest inventions. The software is expected to have 40000 lines of code. The company needs to determine the effort in person-months needed to develop this software using the basic COCOMO model. The multiplicative factor for this model is given as 2.8 for the software development on embedded systems, while the exponentiation factor is given as 1.20. What is the estimated effort in person-months? option (A) 234.25 (B) 932.50 (C) 287.80 (D) 122.40 Next Question: HTML (Hyper Text Markup Language) has language elements which permit certain actions other than describing the structure of the web document. Which one of the following actions is NOT supported by pure HTML (without any server or client side scripting) pages? (A) Embed web objects from different sites into the same page (B) Refresh the page automatically after a specified interval (C) Automatically redirect to another page upon download (D) Display the client time as part of the page

(#M40029682) GATE question GATE-CS Keep an EYE

Which of the following pairs have DIFFERENT expressive power?
(A) Deterministic finite automata (DFA) and Non-deterministic finite automata (NFA)
(B) Deterministic push down automata (DPDA) and Non-deterministic push down automata (NPDA)
(C) Deterministic single-tape Turing machine and Non-deterministic single tape Turing machine
(D) Single-tape Turing machine and multi-tape Turing machine: Asked In Gate Rats (10 years ago); Unsolved; Is this Puzzle helpful? (0) (1) Submit Your Solution

Dimple

India

Punjab

Time: 00:01:33

Points

Maths Quotes

Mathematics is the Queen of the Sciences

Professor Robert Silensky

Mathematical proofs, like diamonds, are hard and clear, and will be touched with nothing but strict reasoning.

John Locke

Placed User Comments

M4Math helped me a lot.

Vipul Chavan 3 years ago

Thanks m4 maths for helping to get placed in several companies.
I must recommend this website for placement preparations.

yash mittal 4 years ago

Latest Gate Aptitude Question SOLUTION: Which of the following pairs have DIFFERENT expressive power? (A) Deterministic finite automata (DFA) and Non-deterministic finite automata (NFA) (B) Deterministic push down automa

Gate Question Papers:

Exam

Gate Question Topics

Category (172)

General Ability (20)

HR Interview (166)

Logical Reasoning (36)

Numerical Ability (131)

Programming (13)

Verbal Ability (13)

(#M40029682) GATE question GATE-CS Keep an EYE

Sponsored Links

Challenger of the Day

Maths Quotes

Placed User Comments

Site Links

Useful Info

Placement papers