## UPPCL AE 2022

Question 1 |

Which of the following sequences of operations is followed in the instruction cycle?

00: Fetch Cycle 00: Execute Cycle 10: Interrupt Cycle 11: Indirect Cycle | |

00: Fetch Cycle 01: Interrupt Cycle 10: Indirect Cycle 11: Execute Cycle | |

00: Fetch Cycle 01: Execute Cycle 10: Indirect Cycle 11: Interrupt Cycle | |

00: Fetch Cycle 01: Indirect Cycle 10: Execute Cycle 11: Interrupt Cycle |

Question 2 |

Consider the Grammar G (V-(S, A,B,C), T-(a,b),S,P) where V is a non-empty set of variables or non-terminals, T is a set of terminals, S is a start symbol and P is a set of production des given as follows.
Which of the following strings is in L(G)

aaa | |

ababbab | |

null string | |

bbb |

Question 3 |

Let F(x,y) denote the predicate ‘ y is a friend of x’. Which of the following correctly describes' It is impossible that someone does not have any friends’?

For all y there exists x (F(x, y)) | |

There exists y for all x (F(x, y)) | |

There exists x for all y (F(x, y)) | |

For all x there exists y (F(x, y)) |

Question 4 |

2 doctors and 10 nurses attend a small conference. All 12 names are put in a hat and 4 names are randomly picked without replacement. The probability that 1 doctor and 3 nurses are picked is:

Question 5 |

In a __________ graph, vertices can be partitioned into two subsets V1 and V2 suchthat no edge has both endpoints in the same subset, and every possible edge that could connect vertices in different subsets is part of the graph.

complete bipartite | |

clique | |

complete | |

bipartite |

Question 6 |

Let Grammar G(V=(5).T (ab)SP)stere V is a no-empty set of variables or non-terminals. T is a set of terminals. S is a start symbol. λ is a null string and is a set of production rules. If n

_{a}(w), (w) n_{b}represents the number of a's and b'a in string w, then the language derived from set of production rules{W ∈ {a,b} ^{*} : n_{a} (w) = n_{b}(w)} | |

{W ∈ {a, b} ^{*} : n_{a} (w) # n_{b} (w)} | |

{W ∈ {a, b} ^{*} : n_{a} (w) < n_{b}(w)} | |

{W ∈ {a, b} ^{*} : n_{a} (w) > n_{b}(w)} |

Question 7 |

Literals can also be called

constants | |

keywords | |

identifiers | |

special characters |

Question 8 |

Simplify the logic expression F = a 'bc + a 'bc' + ac.

b + ca' = 1 | |

ab + b 'c=1 | |

a + b' c | |

a 'b + ac |

Question 9 |

Consider the following schema
(staff, name, street, city)
serves(name, c_ name, salary)
company (c_ name, city)
manages (name, manager-name)
Find the names and cities of the residence of all the staffs who work for Shankar.

Question 10 |

Which of the following is the application of stack data structure?

data transfer | |

resource scheduling | |

disk scheduling | |

evaluation of expressions |

Question 11 |

Which of the following principles is used by divide and conquer technique?

Recursively define the values of optimal solutions | |

Divide the problem into a number of subproblems | |

An equation or inequality describes a function in terms of its values on smaller inputs | |

Construct an optimal solution from computed information |

Question 12 |

The number of elements in the adjacency matrix of a graph having 6 vertices is_______

36 | |

12 | |

216 | |

24 |

Question 13 |

Find the combination of the inputs (X and Y) for which the Q output is set to 1 for the latch as shown.

1 ,0 | |

1, 1 | |

0, 1 | |

0,0 |

Question 14 |

Which of the following is a partition of the set S = {2,4,6,8,10}?