What are the final values of Q1 and Q0 after 4 clock cycles, if initial values are 00 in the sequential circuit shown below: Image (A) 11 (B) 10 (C) 01 (D) 00

What are the final values of Q1 and Q0 after 4 clock cycles, if initial values are 00 in the sequential circuit shown below:

image

(A) 11 (B) 10 (C) 01 (D) 00

by

1 Answer

Answer :

(D) 00
by

Related questions

The transition function for the language L = {w|na(w) and nb(w) are both odd} is given by: δ(q0, a)=q1 ; δ(q0, b)=q2 δ(q1, a)=q0 ; δ(q1, b)=q3 δ(q2, a)=q3 ; δ(q2, b)=q0 δ(q3, a)=q2 ; δ(q3, b)=q1

Description : The transition function for the language L = {w|na(w) and nb(w) are both odd} is given by: δ(q0, a)=q1 ; δ(q0, b)=q2 δ(q1, a)=q0 ; δ(q1, b)=q3 δ(q2, a)=q3 ; δ(q2, b ... the automata are: (A) q0 and q0 respectively (B) q0 and q1 respectively (C) q0 and q2 respectively (D) q0 and q3 respectively 

Last Answer : (D) q0 and q3 respectively

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 

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

Consider a 32 - bit microprocessor, with a 16 - bit external data bus, driven by an 8 MHz input clock. Assume that the microprocessor has a bus cycle whose minimum duration equals four input clock cycles. What is the maximum data transfer rate for this microprocessor? (A) 8x106 bytes/sec (B) 4x106 bytes/sec (C) 16x106 bytes/sec (D) 4x109 bytes/sec

Description : Consider a 32 - bit microprocessor, with a 16 - bit external data bus, driven by an 8 MHz input clock. Assume that the microprocessor has a bus cycle whose minimum duration equals four input clock cycles. What ... (A) 8x106 bytes/sec (B) 4x106 bytes/sec (C) 16x106 bytes/sec (D) 4x109 bytes/sec 

Last Answer : (B) 4x106 bytes/sec

The regular expression corresponding to the language L where L={x∈{0,1}* | x ends with 1 and does not contain substring 00 } is: (A) (1 + 01)* (10 + 01) (B) (1 + 01)* 01 (C) (1 + 01)* (1 + 01) (D) (10 + 01)* 01

Description : The regular expression corresponding to the language L where L={x∈{0,1}* | x ends with 1 and does not contain substring 00 } is: (A) (1 + 01)* (10 + 01) (B) (1 + 01)* 01 (C) (1 + 01)* (1 + 01) (D) (10 + 01)* 01

Last Answer : (C) (1 + 01)* (1 + 01) 

What steps shall be required to rotate an object about the point P1 (as shown in fig.1) and its placement such that what was at P1 is now reduced and is at P2 (as shown in fig.2). Image I. Translate P1 to origin II. Scale as required III. Rotate IV. Translate to the final position P2. (A) I,II and III (B) II,III and IV (C) I,III and IV (D) All of the above

Description : What steps shall be required to rotate an object about the point P1 (as shown in fig.1) and its placement such that what was at P1 is now reduced and is at P2 (as shown in fig.2). I. Translate P1 to origin II. ... (A) I,II and III (B) II,III and IV (C) I,III and IV (D) All of the above

Last Answer : Answer: Marks given to all

Consider the following transportation problem: Image The initial basic feasible solution of the above transportation problem using Vogel’s Approximation Method(VAM) is given below: The solution of the above problem: (A) is degenerate solution (B) is optimum solution (C) needs to improve (D) is infeasible solution

Description : Consider the following transportation problem: The initial basic feasible solution of the above transportation problem using Vogel's Approximation Method(VAM) is given below: The solution of the ... degenerate solution (B) is optimum solution (C) needs to improve (D) is infeasible solution

Last Answer : (B) is optimum solution

A boy leaves home in the morning to go to school. At the moment he leaves the house he looks at the clock in the mirror. The clock has no number indication and for this reason the boy makes a mistake in interpreting the time (mirror-image). Just assuming the clock must be out of order, the boy cycles to school, where he arrives after twenty minutes. At that moment the clock at school shows a time that is two and a half hours later than the time that the boy saw on the clock at home. -Riddles

Description : A boy leaves home in the morning to go to school. At the moment he leaves the house he looks at the clock in the mirror. The clock has no number indication and for this reason the boy makes a mistake in ... is two and a half hours later than the time that the boy saw on the clock at home. -Riddles

Last Answer : The difference between the real time and the time of the mirror image is two hours and ten minutes (two and a half hours, minus the twenty minutes of cycling). Therefore, the original time on ... at five minutes past seven plus twenty minutes of cycling, which is twenty-five minutes past seven!...

Consider the Graph shown below : Image This graph is a ............... (A) Complete Graph (B) Bipartite Graph (C) Hamiltonian Graph (D) All of the above

Description : Consider the Graph shown below : This graph is a ............... (A) Complete Graph (B) Bipartite Graph (C) Hamiltonian Graph (D) All of the above

Last Answer : (C) Hamiltonian Graph

A clique in a simple undirected graph is a complete subgraph that is not contained in any larger complete subgraph. How many cliques are there in the graph shown below? Image (A) 2 (B) 4 (C) 5 (D) 6

Description : A clique in a simple undirected graph is a complete subgraph that is not contained in any larger complete subgraph. How many cliques are there in the graph shown below?  (A) 2 (B) 4 (C) 5 (D) 6

Last Answer : (C) 5

The component labeled 'CR1' in the circuit shown in the illustration __________________. EL-0085 A. varies its anode/cathode polarity depending on 'RL' current B. rectifies the varying voltage from the collector of 'Q1' C. acts as a low capacitive reactance to smooth ripple D. establishes a constant reference voltage for the base of 'Q1'

Description : The component labeled 'CR1' in the circuit shown in the illustration __________________. EL-0085 A. varies its anode/cathode polarity depending on 'RL' current B. rectifies the varying voltage from the ... reactance to smooth ripple D. establishes a constant reference voltage for the base of 'Q1'

Last Answer : Answer: D

The output of a sequential circuit depends on (A) present input only (B) past input only (C) both present and past input (D) past output only

Description : The output of a sequential circuit depends on (A) present input only (B) past input only (C) both present and past input (D) past output only

Last Answer : (C) both present and past input

Which of the following is a sequential circuit? (A) Multiplexer (B) Decoder (C) Counter (D) Full adder

Description : Which of the following is a sequential circuit? (A) Multiplexer (B) Decoder (C) Counter (D) Full adder

Last Answer : (C) Counter

In IEEE 802.11, when a frame isgoingfrom one AP to another AP in a wireless distribution system, the address flag is_____ A) 00 B) 01 C) 10 D) 11

Description : In IEEE 802.11, when a frame isgoingfrom one AP to another AP in a wireless distribution system, the address flag is_____ A) 00 B) 01 C) 10 D) 11

Last Answer : 11

In IEEE 802.11, when a frame isgoingfrom a station to an AP, theaddress flag is _____. A) 00 B) 01 C) 10 D) 11

Description : In IEEE 802.11, when a frame isgoingfrom a station to an AP, theaddress flag is _____. A) 00 B) 01 C) 10 D) 11

Last Answer : 10

In IEEE 802.11, when a frame is coming from an AP and going to astation, the address flag is _______. A) 00 B) 01 C) 10 D) 11

Description : In IEEE 802.11, when a frame is coming from an AP and going to astation, the address flag is _______. A) 00 B) 01 C) 10 D) 11

Last Answer : 01

In IEEE 802.11, when a frame isgoingfrom one station in a BSS toanother without passing through thedistribution system, the address flag is _____ A) 00 B) 01 C) 10 D) 11

Description : In IEEE 802.11, when a frame isgoingfrom one station in a BSS toanother without passing through thedistribution system, the address flag is _____ A) 00 B) 01 C) 10 D) 11

Last Answer : 00

The correct encoding of the letter C in this tree is... A. 11 B. 10 C. 01 D. 00

Description : The correct encoding of the letter C in this tree is... A. 11 B. 10 C. 01 D. 00

Last Answer : C. 01

The NOR gate output will be low if the two inputs are (A) 00 (B) 01 (C) 10 (D) 11

Description : The NOR gate output will be low if the two inputs are (A) 00 (B) 01 (C) 10 (D) 11

Last Answer : A

The NAND gate output will be low if the two inputs are (A) 00 (B) 01 (C) 10 (D) 11

Description : The NAND gate output will be low if the two inputs are (A) 00 (B) 01 (C) 10 (D) 11

Last Answer : (D) 11

What will be the values of x, m and n after execution of the following statements? Int x, m, n; m=10; n=15; x= ++m + n++; A) x=25, m=10, n=15 B) x=27, m=10, n=15 C) x=26, m=11, n=16 D) x=27, m=11, n=16

Description : What will be the values of x, m and n after execution of the following statements? Int x, m, n; m=10; n=15; x= ++m + n++; A) x=25, m=10, n=15 B) x=27, m=10, n=15 C) x=26, m=11, n=16 D) x=27, m=11, n=16

Last Answer : C) x=26, m=11, n=16

If a variable is declared final, it must include ...................... value. A) integer B) no C) initial D) float

Description : If a variable is declared final, it must include ...................... value. A) integer B) no C) initial D) float

Last Answer : C) initial

There are three processes P1, P2 and P3 sharing a semaphore for synchronising a variable. Initial value of semaphore is one. Assume that negative value of semaphore tells us how many processes are waiting in queue. Processes access the semaphore in following order: (a) P2 needs to access (b) P1 needs to access (c) P3 needs to access (d) P2 exits critical section (e) Pi exits critical section The final value of semaphore will be: (1) 0 (2) 1 (3) -1 (4) -2

Description : There are three processes P1, P2 and P3 sharing a semaphore for synchronising a variable. Initial value of semaphore is one. Assume that negative value of semaphore tells us how many processes are waiting in queue. Processes access ... The final value of semaphore will be: (1) 0 (2) 1 (3) -1 (4) -2 

Last Answer : Answer: 1

What is the total resistance of the electrical circuit illustrated if the resistance of R1 is 2 ohms, R2 is 4 ohms, and R3 is 4 ohms with a 6 volt battery? EL-0021 A. 0.01 ohms B. 0.10 ohms C. 1.00 ohms D. 10.00 ohms

Description : What is the total resistance of the electrical circuit illustrated if the resistance of R1 is 2 ohms, R2 is 4 ohms, and R3 is 4 ohms with a 6 volt battery? EL-0021 A. 0.01 ohms B. 0.10 ohms C. 1.00 ohms D. 10.00 ohms

Last Answer : Answer: C

In a queue, the initial values of front pointer f rare pointer r should be ….. and …….. respectively. A) 0 and 1 B) 0 and -1 C) -1 and 0 D) 1 and 0

Description : In a queue, the initial values of front pointer f rare pointer r should be ….. and …….. respectively. A) 0 and 1 B) 0 and -1 C) -1 and 0 D) 1 and 0

Last Answer : B) 0 and -1

The initial basic feasible solution of the following transportion problem : Image then the minimum cost is (A) 76 (B) 78 (C) 80 (D) 82

Description : The initial basic feasible solution of the following transportion problem : then the minimum cost is (A) 76 (B) 78 (C) 80 (D) 82

Last Answer : (A) 76

If X is a binary number which is power of 2, then the value of X&(X-1) is: (1) 11....11 (2) 00.....00 (3) 100.....0 (4) 000.....1

Description : If X is a binary number which is power of 2, then the value of X&(X-1) is: (1) 11....11 (2) 00.....00 (3) 100.....0 (4) 000.....1

Last Answer : Answer: 2

Let A and B be two fuzzy integers defined as: A={(1,0.3), (2,0.6), (3,1), (4,0.7), (5,0.2)} B={(10,0.5), (11,1), (12,0.5)} Using fuzzy arithmetic operation given by Image (A) {(11,0.8), (13,1), (15,1)} (B) {(11,0.3), (12,0.5), (13,1), (14,1), (15,1), (16,0.5), (17,0.2)} (C) {(11,0.3), (12,0.5), (13,0.6), (14,1), (15,1), (16,0.5), (17,0.2)} (D) {(11,0.3), (12,0.5), (13,0.6), (14,1), (15,0.7), (16,0.5), (17,0.2)}

Description : Let A and B be two fuzzy integers defined as: A={(1,0.3), (2,0.6), (3,1), (4,0.7), (5,0.2)} B={(10,0.5), (11,1), (12,0.5)} Using fuzzy arithmetic operation given by (A) {(11,0.8), (13,1), (15,1)} ( ... ,0.2)} (D) {(11,0.3), (12,0.5), (13,0.6), (14,1), (15,0.7), (16,0.5), (17,0.2)}

Last Answer : (D) {(11,0.3), (12,0.5), (13,0.6), (14,1), (15,0.7), (16,0.5), (17,0.2)}

for the system shown below K1=20N/m K1=10N/m K1=20N/m K1=50N/mFind W such that the natural frequency of the system will be 1.592 cycles per second a)0.125kg b)0.25kg c)0.5kg 4)4kg

Description : for the system shown below K1=20N/m K1=10N/m K1=20N/m K1=50N/mFind W such that the natural frequency of the system will be 1.592 cycles per second a)0.125kg b)0.25kg c)0.5kg 4)4kg

Last Answer : b)0.25kg

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

Consider the following database table having A, B, C and D as its four attributes and four possible candidate keys (I, II, III and IV) for this table: Image I: {B} II: {B, C} III: {A, D} IV: {C, D} If different symbols stand for different values in the table (e.g., d1 is definitely not equal to d2), then which of the above could not be the candidate key for the database table? (A) I and III only (B) III and IV only (C) II only (D) I only

Description : Consider the following database table having A, B, C and D as its four attributes and four possible candidate keys (I, II, III and IV) for this table: I: {B} II: {B, C} III: {A, D} IV: {C, D} If ... the database table? (A) I and III only (B) III and IV only (C) II only (D) I only

Last Answer : (C) II only

Consider the following Entity-Relationship (E-R) diagram and three possible relationship sets (I, II and III) for this E-R diagram: Image If different symbols stand for different values (e.g., t1 is definitely not equal to t2), then which of the above could not be the relationship set for the E-R diagram ? (A) I only (B) I and II only (C) II only (D) I, II and III

Description : Consider the following Entity-Relationship (E-R) diagram and three possible relationship sets (I, II and III) for this E-R diagram: If different symbols stand for different values (e.g., t1 is definitely not equal to t2 ... diagram ? (A) I only (B) I and II only (C) II only (D) I, II and III

Last Answer : (A) I only

Consider a sequence F00 defined as: Image Then what shall be the set of values of the sequence F00? (1) (1, 110, 1200) (2) (1, 110, 600, 1200) (3) (1, 2, 55, 110, 600, 1200) (4) (1, 55, 110, 600, 1200)

Description : Consider a sequence F00 defined as: Then what shall be the set of values of the sequence F00? (1) (1, 110, 1200) (2) (1, 110, 600, 1200) (3) (1, 2, 55, 110, 600, 1200) (4) (1, 55, 110, 600, 1200)

Last Answer : Answer: 1 Explanation: We have given, F00(0) = 1, F00(1) = 1 F00(2) = (10*F00(1) + 100)/F00(0) = 110 F00(3) = (10*F00(2) + 100)/F00(1) = 1200 F00(4) = (10*F00(3) + ... (2) = 110 Since the values repeats after the first three values, the set of values of F00 will be (1,110,1200).

From the given data below: a b b a a b b a a b which one of the following is not a word in the dictionary created by LZ-coding (the initial words are a, b)? (1) a b (2) b b (3) b a (4) b a a b

Description : From the given data below: a b b a a b b a a b which one of the following is not a word in the dictionary created by LZ-coding (the initial words are a, b)? (1) a b (2) b b (3) b a (4) b a a b 

Last Answer : (4) b a a b 

In the following graph, discovery time stamps and finishing time stamps of Depth First Search (DFS) are shown as x/y where x is discovery time stamp and y is finishing time stamp. Image It shows which of the following depth first forest? (A) {a,b,e} {c,d,f,g,h} (B) {a,b,e} {c,d,h} {f,g} (C) {a,b,e} {f,g} {c,d} {h} (D) {a,b,c,d} {e,f,g} {h}

Description : In the following graph, discovery time stamps and finishing time stamps of Depth First Search (DFS) are shown as x/y where x is discovery time stamp and y is finishing time stamp.  It shows which of the following depth first forest? (A ... {a,b,e} {f,g} {c,d} {h} (D) {a,b,c,d} {e,f,g} {h}

Last Answer : Answer: A

What are the initial and final torque values for A321 main landing gear wheels?

Description : What are the initial and final torque values for A321 main landing gear wheels?

Last Answer : The initial or bearing setting torque value for A321 main landing gear wheel is 310 ft.-lbs. and the final torque value is 160 ft.-lbs.

What is the difference between a sequential file and a random file?

Description : What is the difference between a sequential file and a random file?

Last Answer : Ans: Sequential file access is the method employed in tape drives where the files are access in a sequential manner. So if you have to get a file in the end of the tape you have to start ... Disks and Optical drives, wherever the files is placed it will go to that particular place and retrieve it.

Data store in a DFD represents. A) a sequential file B) a disk store C) a repository of data

Description : Data store in a DFD represents. A) a sequential file B) a disk store C) a repository of data

Last Answer : C) a repository of data

The advantage of …………….. is that they solve the problem if sequential storage representation. But disadvantage in that is they are sequential lists. A) Lists B) Linked Lists C) Trees D) Queues

Description : The advantage of …………….. is that they solve the problem if sequential storage representation. But disadvantage in that is they are sequential lists. A) Lists B) Linked Lists C) Trees D) Queues

Last Answer : B) Linked Lists

The number of comparisons done by sequential search is ……………… A) (N/2)+1 B) (N+1)/2 C) (N-1)/2 D) (N+2)/2

Description : The number of comparisons done by sequential search is ……………… A) (N/2)+1 B) (N+1)/2 C) (N-1)/2 D) (N+2)/2

Last Answer : B) (N+1)/2

In the ………………… mode any record in the file can be accessed at random A) Sequential access B) Random access C) Standard access D) Source access

Description : In the ………………… mode any record in the file can be accessed at random A) Sequential access B) Random access C) Standard access D) Source access

Last Answer : B) Random access

HSAM stands for ………. A) Hierarchic Sequential Access Method B) Hierarchic Standard Access Method C) Hierarchic Sequential and Method D) Hierarchic Standard and Method

Description : HSAM stands for ………. A) Hierarchic Sequential Access Method B) Hierarchic Standard Access Method C) Hierarchic Sequential and Method D) Hierarchic Standard and Method

Last Answer : A) Hierarchic Sequential Access Method

………. contains data assisting day to day activities of the organization. A) Control database B) Operational database C) Strategic database D) Sequential database

Description : ………. contains data assisting day to day activities of the organization. A) Control database B) Operational database C) Strategic database D) Sequential database

Last Answer : B) Operational database

………………… is a full form of SQL. A) Standard query language B) Sequential query language C) Structured query language D) Server side query language

Description : ………………… is a full form of SQL. A) Standard query language B) Sequential query language C) Structured query language D) Server side query language

Last Answer : A) Standard query language

Which of the following is not a type of Database Management System? (A) Hierarchical (B) Network (C) Relational (D) Sequential

Description : Which of the following is not a type of Database Management System? (A) Hierarchical (B) Network (C) Relational (D) Sequential 

Last Answer : (D) Sequential

A software design is highly modular if : (A) cohesion is functional and coupling is data type. (B) cohesion is coincidental and coupling is data type. (C) cohesion is sequential and coupling is content type. (D) cohesion is functional and coupling is stamp type.

Description : A software design is highly modular if : (A) cohesion is functional and coupling is data type. (B) cohesion is coincidental and coupling is data type. (C) cohesion is sequential and coupling is content type. (D) cohesion is functional and coupling is stamp type.

Last Answer : (A) cohesion is functional and coupling is data type.

Consider the following binary search tree: Image If we remove the root node, which of the node from the left subtree will be the new root? (A) 11 (B) 12 (C) 13 (D) 16

Description : Consider the following binary search tree: If we remove the root node, which of the node from the left subtree will be the new root? (A) 11 (B) 12 (C) 13 (D) 16

Last Answer : (D) 16

State True or False. i) An undirected graph which contains no cycles is called forest. ii) A graph is said to be complete if there is an edge between every pair of vertices. A) True, True B) False, True C) False, False D) True, False

Description : State True or False. i) An undirected graph which contains no cycles is called forest. ii) A graph is said to be complete if there is an edge between every pair of vertices. A) True, True B) False, True C) False, False D) True, False

Last Answer : A) True, True

State True of False. i) Network is a graph that has weights or costs associated with it. ii) An undirected graph which contains no cycles is called a forest. iii) A graph is said to be complete if there is no edge between every pair of vertices. A) True, False, True B) True, True, False C) True, True, True D) False, True, True

Description : State True of False. i) Network is a graph that has weights or costs associated with it. ii) An undirected graph which contains no cycles is called a forest. iii) A graph is said to be complete if there is no ... ) True, False, True B) True, True, False C) True, True, True D) False, True, True

Last Answer : B) True, True, False