Which of the following pairs have different expressive power? (1) Single-tape-turing machine and multi-dimensional turing machine. (2) Multi-tape turing machine and multi-dimensional turing machine. (3) Deterministic push down automata and non-deterministic pushdown automata. (4) Deterministic finite automata and Non-deterministic finite automata.

Which of the following pairs have different expressive power? (1) Single-tape-turing machine and multi-dimensional turing machine. (2) Multi-tape turing machine and multi-dimensional turing machine. (3) Deterministic push down automata and non-deterministic pushdown automata. (4) Deterministic finite automata and Non-deterministic finite automata.
by

1 Answer

Answer :

Deterministic push down automata and non-deterministic pushdown automata.
by

Related questions

Consider the following statements related to compiler construction: I. Lexical Analysis is specified by context-free grammars and implemented by pushdown automata. II. Syntax Analysis is specified by regular expressions and implemented by finite-state machine. Which of the above statement(s) is/are correct? (1) Only l (2) Only ll (3) Both I and II (4) Neither I nor Il

Description : Consider the following statements related to compiler construction: I. Lexical Analysis is specified by context-free grammars and implemented by pushdown automata. II. Syntax Analysis is specified by regular expressions and implemented by ... Only l (2) Only ll (3) Both I and II (4) Neither I nor Il

Last Answer : Answer: 4

Let L be the language generated by regular expression 0*10* and accepted by the deterministic finite automata M. Consider the relation RM defined by M. As all states are reachable from the start state, RM has ................ equivalence classes. (A) 2 (B) 4 (C) 5 (D) 6

Description : Let L be the language generated by regular expression 0*10* and accepted by the deterministic finite automata M. Consider the relation RM defined by M. As all states are reachable from the start state, RM has ................ equivalence classes. (A) 2 (B) 4 (C) 5 (D) 6

Last Answer : (D) 6

A pushdown automation M = (Q, Σ, Γ, δ, q0, z, F) is set to be deterministic subject to which of the following condition(s), for every q ∈ Q, a ∈ Σ ∪ {λ} and b ∈ Γ (s1) δ(q, a, b) contains at most one element (s2) if δ(q, λ, b) is not empty then δ(q, c, b) must be empty for every c ∈ Σ (A) only s1 (B) only s2 (C) both s1 and s2 (D) neither s1 nor s2

Description : A pushdown automation M = (Q, Σ, Γ, δ, q0, z, F) is set to be deterministic subject to which of the following condition(s), for every q ∈ Q, a ∈ Σ ∪ {λ} and b ∈ Γ (s1) δ(q, a, b) contains at most one ... ) must be empty for every c ∈ Σ (A) only s1 (B) only s2 (C) both s1 and s2 (D) neither s1 nor s2

Last Answer : (C) both s1 and s2

There are exactly ................ different finite automata with three states x, y and z over the alphabet {a, b} where x is always the start state. (A) 64 (B) 256 (C) 1024 (D) 5832

Description : There are exactly ................ different finite automata with three states x, y and z over the alphabet {a, b} where x is always the start state. (A) 64 (B) 256 (C) 1024 (D) 5832

Last Answer : Answer: D

Given a Non-deterministic Finite Automation (NFA) with states p and r as initial and final states respectively transition table as given below Image The minimum number of states required in Deterministic Finite Automation (DFA) equivalent to NFA is (A) 5 (B) 4 (C) 3 (D) 2

Description : Given a Non-deterministic Finite Automation (NFA) with states p and r as initial and final states respectively transition table as given below  The minimum number of states required in Deterministic Finite Automation (DFA) equivalent to NFA is (A) 5 (B) 4 (C) 3 (D) 2

Last Answer : (C) 3 

Minimal deterministic finite automaton for the language L={ 0n | n≥0, n≠4 } will have: (A) 1 final state among 5 states (B) 4 final states among 5 states (C) 1 final state among 6 states (D) 5 final states among 6 states

Description : Minimal deterministic finite automaton for the language L={ 0n | n≥0, n≠4 } will have: (A) 1 final state among 5 states (B) 4 final states among 5 states (C) 1 final state among 6 states (D) 5 final states among 6 states

Last Answer : (D) 5 final states among 6 states

Vector A. It do not need the control of the human operator during their execution B. An arrow in a multi-dimensional space. It is a quantity usually characterized by an ordered set of scalars C. The validation of a theory on the basis of a finite number of examples D. None of these

Description : Vector A. It do not need the control of the human operator during their execution B. An arrow in a multi-dimensional space. It is a quantity usually characterized by an ordered set of scalars C. The validation of a theory on the basis of a finite number of examples D. None of these

Last Answer : B. An arrow in a multi-dimensional space. It is a quantity usually characterized by an ordered set of scalars

In ……………… system the interaction between various subsystems cannot be defined with certainty A) Open System B) Closed System C) Deterministic System D) Probabilistic System

Description : In ……………… system the interaction between various subsystems cannot be defined with certainty A) Open System B) Closed System C) Deterministic System D) Probabilistic System

Last Answer : D) Probabilistic System

………… is a good example of deterministic system. A) Life cycle B) Computer Program C) Software Program D) None of the above

Description : ………… is a good example of deterministic system. A) Life cycle B) Computer Program C) Software Program D) None of the above

Last Answer : B) Computer Program

Given the following two statements: A. L = {w|na(w) = nb(w)} is deterministic context free language, but not linear B. L = {an bn} U {an b2n} is linear, but not deterministic context free language. Which of the following options is correct? (1) Both (A) and (B) are false. (2) Both (A) and (B) are true. (3) (A) is true, (B) is false. (4) (A) is false, (B) is true.

Description : Given the following two statements: A. L = {w|na(w) = nb(w)} is deterministic context free language, but not linear B. L = {an bn} U {an b2n} is linear, but not deterministic context free language. Which of the following ... are true. (3) (A) is true, (B) is false. (4) (A) is false, (B) is true.

Last Answer : Both (A) and (B) are true. 

The applications of the Finite Element Method in two-dimensional analyses are . a.stretching of plates b.gravity of dams c.axisymmetric shells d.all of the above

Description : The applications of the Finite Element Method in two-dimensional analyses are . a.stretching of plates b.gravity of dams c.axisymmetric shells d.all of the above

Last Answer : c.axisymmetric shells

If f(x, y) is a digital image, then x, y and amplitude values of f are (A) Finite (B) Infinite (C) Neither finite nor infinite (D) None of the above

Description : If f(x, y) is a digital image, then x, y and amplitude values of f are (A) Finite (B) Infinite (C) Neither finite nor infinite (D) None of the above

Last Answer : (A) Finite

Let A and B be sets in a finite universal set U. Given the following: |A – B|, |AÅB|, |A|+|B| and |AÈB| Which of the following is in order of increasing size ? (A) |A – B| ≤ |AÅB| ≤ |A| + |B| ≤ |AÈB| (B) |AÅB| ≤ |A – B| ≤ |AÈB| ≤ |A| + |B| (C) |AÅB| ≤ |A| + |B| ≤ |A – B| ≤ |AÈB| (D) |A – B| ≤ |AÅB| ≤ |AÈB| ≤ |A| + |B|

Description : Let A and B be sets in a finite universal set U. Given the following: |A - B|, |AÅB|, |A|+|B| and |AÈB| Which of the following is in order of increasing size ? (A) |A - B| ≤ |AÅB| ≤ |A| + |B| ≤ |AÈB| (B) |AÅB| ≤ |A ... |AÅB| ≤ |A| + |B| ≤ |A - B| ≤ |AÈB| (D) |A - B| ≤ |AÅB| ≤ |AÈB| ≤ |A| + |B|

Last Answer : (D) |A – B| ≤ |AÅB| ≤ |AÈB| ≤ |A| + |B|

Which of the following statements is not true for Multi Level Feedback Queue processor scheduling algorithm? (A) Queues have different priorities. (B) Each queue may have different scheduling algorithm (C) Processes are permanently assigned to a queue (D) This algorithm can be configured to match a specific system under design

Description : Which of the following statements is not true for Multi Level Feedback Queue processor scheduling algorithm? (A) Queues have different priorities. (B) Each queue may have different scheduling algorithm (C) ... to a queue (D) This algorithm can be configured to match a specific system under design

Last Answer : (C) Processes are permanently assigned to a queue

The relational model is based on the concept that data is organized and stored in two-dimensional tables called ………………………A) Fields B) Records C) Relations D) Keys

Description : The relational model is based on the concept that data is organized and stored in two-dimensional tables called ………………………A) Fields B) Records C) Relations D) Keys

Last Answer : C) Relations

Which of the following is not true with respect to a trackball and/or spaceball ? I. A trackball is a two dimensional positioning device while as a spaceball provides six degrees of freedom II. Unlike the trackball a spaceball does not actually move. III. A trackball is a three dimensional positioning device while as a spaceball provides six degrees of freedom. (A) I & II (B) II & III (C) II only (D) III only

Description : Which of the following is not true with respect to a trackball and/or spaceball ? I. A trackball is a two dimensional positioning device while as a spaceball provides six degrees of freedom II. Unlike the trackball a spaceball does ... of freedom. (A) I & II (B) II & III (C) II only (D) III only

Last Answer : (D) III only

A three dimensional array in ‘C’ is declared as int A[x][y][z]. Here, the address of an item at the location A[p][q][r] can be computed as follows (where w is the word length of an integer): (A) &A[0][0][0]+w(y*z*q+z*p+r) (B) &A[0][0][0]+w(y*z*p+z*q+r) (C) &A[0][0][0]+w(x*y*p+z*q+r) (D) &A[0][0][0]+w(x*y*q+z*p+r)

Description : A three dimensional array in C' is declared as int A[x][y][z]. Here, the address of an item at the location A[p][q][r] can be computed as follows (where w is the word length of an integer): (A) &A[0][0][0]+w(y*z*q+z*p+r) (B) &A ... *q+r) (C) &A[0][0][0]+w(x*y*p+z*q+r) (D) &A[0][0][0]+w(x*y*q+z*p+r)

Last Answer : Answer: B

With regard to the expressive power of the formal relational Query languages, which of the following statements is TRUE?

Description : With regard to the expressive power of the formal relational Query languages, which of the following statements is TRUE?  A) relational algebra is more powerful than relational calculus B) relational ... calculus C) relational algebra has the same power as safe relational calculus D) None of these

Last Answer : relational algebra has the same power as safe relational calculus

When did Alan Turing prove that a machine capable of processing a stream 1s and 0s of would be capable of solving any problem.?

Description : When did Alan Turing prove that a machine capable of processing a stream 1s and 0s of would be capable of solving any problem.?

Last Answer : 1942

Who invented the Turing machine and how heavy was it?

Description : Who invented the Turing machine and how heavy was it?

Last Answer : The Turing machine was "invented" by Alan Turing - around 1936. He later described his machine as:"...an unlimited memory capacity obtained in the form of an infinite tape marked out into squares, on ... - that is - there is no possible process that fits the description of Hilbert's 10th question.

Who invented the Turing machine and how heavy was it?

Description : Who invented the Turing machine and how heavy was it?

Last Answer : The Turing machine was "invented" by Alan Turing - around 1936. He later described his machine as:"...an unlimited memory capacity obtained in the form of an infinite tape marked out into squares, on ... - that is - there is no possible process that fits the description of Hilbert's 10th question.

The “Turing Machine” showed that you could use a/an _____ system to program any algorithmic task. a) binary b) electro-chemical c) recursive d) semantic

Description : The “Turing Machine” showed that you could use a/an _____ system to program any algorithmic task. a) binary b) electro-chemical c) recursive d) semantic

Last Answer : a) binary

Which of the following is a proposed means of testing the intelligence of the machine? Turing TestTurning TestTuning Test a.Turing Test b.Turning Test c.Tuning Test d.None

Description : Which of the following is a proposed means of testing the intelligence of the machine? Turing TestTurning TestTuning Test a.Turing Test b.Turning Test c.Tuning Test d.None

Last Answer : a.Turing Test

Inserting an item into the stack when stack is not full is called …………. Operation and deletion of item form the stack, when stack is not empty is called ………..operation. A) push, pop B) pop, push

Description : Inserting an item into the stack when stack is not full is called …………. Operation and deletion of item form the stack, when stack is not empty is called ………..operation. A) push, pop B) pop, push

Last Answer : A) push, pop

Consider the following operations performed on a stack of size 5: Push(a); Pop(); Push(b); Push(c); Pop(); Push(d); Pop(); Pop(); Push(e); Which of the following statements is correct? (A) Underflow occurs (B) Stack operations are performed smoothly (C) Overflow occurs (D) None of the above

Description : Consider the following operations performed on a stack of size 5: Push(a); Pop(); Push(b); Push(c); Pop(); Push(d); Pop(); Pop(); Push(e); Which of the following statements is correct? (A) Underflow occurs (B) Stack operations are performed smoothly (C) Overflow occurs (D) None of the above

Last Answer : (B) Stack operations are performed smoothly

What is the Meaning of multi dimensional?

Description : What is the Meaning of multi dimensional?

Last Answer : What is the answer ?

Define: (i) Two dimensional array (ii) Multi-dimensional array

Description : Define: (i) Two dimensional array (ii) Multi-dimensional array

Last Answer : (i) Two dimensional array Two dimensional array is a collection of similar type of data elements arranged in the form of rows & columns. E.g. Array can be declared as int arr[3][3]; In this there can be 9 ... (3d) array. For example, float y[2][4][3]; Here, The array y can hold 24 elements.

MIRV stands for (1) Multi-directional Independently Reoriented Vehicle (2) Multipurpose Integrally-targeted Revolutionary Vehicle (3) Multiple Independently-targetable Re-entry Vehicle (4) Multi-dimensional Independent Reentry Vehicle

Description : MIRV stands for (1) Multi-directional Independently Reoriented Vehicle (2) Multipurpose Integrally-targeted Revolutionary Vehicle (3) Multiple Independently-targetable Re-entry Vehicle (4) Multi-dimensional Independent Reentry Vehicle

Last Answer : Multiple Independently-targetable Re-entry Vehicle

In a Database Managemnt System (DBMS), the content and the location of the data is defined by the ____. (1) Multi Dimensional data (2) Sequence data (3) Meta data (4) Sub data

Description : In a Database Managemnt System (DBMS), the content and the location of the data is defined by the ____. (1) Multi Dimensional data (2) Sequence data (3) Meta data (4) Sub data

Last Answer : Meta data

Standard planning algorithms assumes environment to be ___________ a) Deterministic b) Fully observable c) Single agent d) Stochastic

Description : Standard planning algorithms assumes environment to be ___________ a) Deterministic b) Fully observable c) Single agent d) Stochastic

Last Answer : a) Deterministic

In RDBMS, the constraint that no key attribute (column) may be NULL is referred to as: (A) Referential integrity (B) Multi-valued dependency (C) Entity Integrity (D) Functional dependency

Description : In RDBMS, the constraint that no key attribute (column) may be NULL is referred to as: (A) Referential integrity (B) Multi-valued dependency (C) Entity Integrity (D) Functional dependency

Last Answer : (C) Entity Integrity

Do you feel that white people generally have dry reaction/less expressive compared to black people?

Description : Do you feel that white people generally have dry reaction/less expressive compared to black people?

Last Answer : In my experience, culture is the determining factor in such comparisons.

Is winking a part of your expressive repertoire?

Description : Is winking a part of your expressive repertoire?

Last Answer : *no

Mixed receptive-expressive language disorder?

Description : Mixed receptive-expressive language disorder?

Last Answer : DefinitionMixed receptive-expressive language disorder is a language disability that causes impairment of both the understanding and the expression of language.Causes, ... as developmental disorders.SymptomsProblems with language comprehensionProblems with language expressionSpeech contains many

Expressive language disorder - developmental?

Description : Expressive language disorder - developmental?

Last Answer : DefinitionDevelopmental expressive language disorder is a condition in which a child has lower than normal ability in vocabulary, producing complex sentences, and remembering words. However, ... vocabulary skillsImproper use of tenses (past, present, future)Problems making complex sentencesPro

Which of the following statements reflect nursing management of the patient with expressive aphasia? a) Encourage the patient to repeat sounds of the alphabet. Nursing management of the patient with expressive aphasia includes encouraging the patient to repeat sounds of the alphabet.

Description : Which of the following statements reflect nursing management of the patient with expressive aphasia? a) Encourage the patient to repeat sounds of the alphabet. Nursing management of the patient with ... such as memory loss, includes frequently reorienting the patient to time, place, and situation.

Last Answer : a) Encourage the patient to repeat sounds of the alphabet. Nursing management of the patient with expressive aphasia includes encouraging the patient to repeat sounds of the alphabet.

Miles Davis, the jazz player, ________ supremely expressive, didn't have the range or technique to play convincingly in the bebop style. (1) moreover (2) though (3) nevertheless (4) on the one hand

Description : Miles Davis, the jazz player, ________ supremely expressive, didn't have the range or technique to play convincingly in the bebop style. (1) moreover (2) though (3) nevertheless (4) on the one hand

Last Answer : (2) though

Expressive communication is driven by (A) Passive aggression (B) Encoder’s personality characteristics (C) External clues (D) Encoder-decoder contract

Description : Expressive communication is driven by (A) Passive aggression (B) Encoder’s personality characteristics (C) External clues (D) Encoder-decoder contract

Last Answer : (B) Encoder’s personality characteristics

Consider a system with twelve magnetic tape drives and three processes P1, P2 and P3. Process P1 requires maximum ten tape drives, process P2 may need as many as four tape drives and P3 may need upto nine tape drives. Suppose that at time t1, process P1 is holding five tape drives, process P2 is holding two tape drives and process P3 is holding three tape drives. At time t1, system is in: (A) safe state (B) unsafe state (C) deadlocked state (D) starvation state

Description : Consider a system with twelve magnetic tape drives and three processes P1, P2 and P3. Process P1 requires maximum ten tape drives, process P2 may need as many as four tape drives and P3 may need upto nine ... , system is in: (A) safe state (B) unsafe state (C) deadlocked state (D) starvation state

Last Answer : Answer: B

The compiled java program can run on any ..................... plateform having Java Virtual Machine (JVM) installed on it. A) program B) java C) hardware D) non java

Description : The compiled java program can run on any ..................... plateform having Java Virtual Machine (JVM) installed on it. A) program B) java C) hardware D) non java

Last Answer : C) hardware

Which of the following statements is incorrect for Parallel Virtual Machine (PVM)? (A) The PVM Communication model provides asynchronous blocking send, asynchronous blocking receive and non-blocking receive function. (B) Message buffers are allocated dynamically. (C) The PVM communication model assumes that any task can send a message to any other PVM task and that there is no limit to the size or number of such messages. (D) In PVM Model, the message order is not preserved.

Description : Which of the following statements is incorrect for Parallel Virtual Machine (PVM)? (A) The PVM Communication model provides asynchronous blocking send, asynchronous blocking receive and non-blocking receive function. ... of such messages. (D) In PVM Model, the message order is not preserved. 

Last Answer : (D) In PVM Model, the message order is not preserved.

………..defines the structure of a relation which consists of a fixed set of attribute-domain pairs. A) Instance B) Schema c) Program D) Super Key

Description : ………..defines the structure of a relation which consists of a fixed set of attribute-domain pairs. A) Instance B) Schema c) Program D) Super Key

Last Answer : B) Schema

.......... is the predominant form of Fast Ethernet, and runs over two pairs of category 5 or above cable. A) 100 BASE-T B) 100 BASE-TX C) 100 BASE-T4

Description : .......... is the predominant form of Fast Ethernet, and runs over two pairs of category 5 or above cable. A) 100 BASE-T B) 100 BASE-TX C) 100 BASE-T4

Last Answer : B) 100 BASE-TX

If 40 black lines interleaved with 40 white lines can be distinguished across one inch, the resolution is (A) 40 line-pairs per inch (B) 80 line-pairs per inch (C) 1600 lines per inch (D) 40 lines per inch

Description : If 40 black lines interleaved with 40 white lines can be distinguished across one inch, the resolution is (A) 40 line-pairs per inch (B) 80 line-pairs per inch (C) 1600 lines per inch (D) 40 lines per inch

Last Answer : (A) 40 line-pairs per inch

A vertex cover of an undirected graph G(V, E) is a subset V1 ⊆ V vertices such that (A) Each pair of vertices in V1 is connected by an edge (B) If (u, v) ∈ E then u ∈ V1 and v ∈ V1 (C) If (u, v) ∈ E then u ∈ V1 or v ∈ V1 (D) All pairs of vertices in V1 are not connected by an edge

Description : A vertex cover of an undirected graph G(V, E) is a subset V1 ⊆ V vertices such that (A) Each pair of vertices in V1 is connected by an edge (B) If (u, v) ∈ E then u ∈ V1 and v ∈ V1 (C) If (u, v) ∈ E then u ∈ V1 or v ∈ V1 (D) All pairs of vertices in V1 are not connected by an edge

Last Answer : (C) If (u, v) ∈ E then u ∈ V1 or v ∈ V1

An all-pairs shortest-paths problem is efficiently solved using: (A) Dijkstra' algorithm (B) Bellman-Ford algorithm (C) Kruskal Algorithm (D) Floyd-Warshall algorithm

Description : An all-pairs shortest-paths problem is efficiently solved using: (A) Dijkstra' algorithm (B) Bellman-Ford algorithm (C) Kruskal Algorithm (D) Floyd-Warshall algorithm

Last Answer : (D) Floyd-Warshall algorithm

………………… approach reduces time and effort required for design and lesser risk in database management. A) Single global database B) Top-down approach C) Multiple databases D) None of the above

Description : ………………… approach reduces time and effort required for design and lesser risk in database management. A) Single global database B) Top-down approach C) Multiple databases D) None of the above

Last Answer : C) Multiple databases

Full form of FSM is: a. Finite state machine b. Fix state machine c. Fun source metal d. Allof these

Description : Full form of FSM is: a. Finite state machine b. Fix state machine c. Fun source metal d. Allof these

Last Answer : a. Finite state machine

Show how finite state machine model helps in designing a switching system and give a typical example.

Description : Show how finite state machine model helps in designing a switching system and give a typical example.

Last Answer : Switching system basically belongs to the class of finite state machines (FSM) which are asynchronous in nature and follows a sequential logic for their operation. They can be modeled by ... circuits and memory elements. Clocked synchronous operation shown in Fig. overcome such problems.