mmmu - Computer_Science evaluations

<image 1> What does the above NFA recognize. Write your answer in regular expression.

(A) aa*|bb*

(B) a*|bb*

(C) aa*|b*

(D) a*|b*

Answer with the option's letter from the given choices directly. No punctuation.

What kind of matrix traversal is <image 1>?

(A) Normal traversal of the matrix.

(B) Row-wise traversal of the matrix.

(C) Column-wise traversal of the matrix.

(D) spiral traversal of the matrix.

Answer with the option's letter from the given choices directly. No punctuation.

Consider the following graph:Which one of the following cannot be the sequence of edges added, in that order, to a minimum spanning tree using Kruskal's algorithm?<image 1>

(A) (a-b),(d-f),(b-f),(d-c),(d-e)

(B) (a-b),(d-f),(d-c),(b-f),(d-e)

(C) (d-f),(a-b),(d-c),(b-f),(d-e)

(D) (d-f),(a-b),(b-f),(d-e),(d-c)

Answer with the option's letter from the given choices directly. No punctuation.

<image 1> What does this structure mean?

(A) s

(B) s+

(C) s*

(D) ss

Answer with the option's letter from the given choices directly. No punctuation.

What type of relationship is WORKS_ON in <image 1>?

(A) 1:1

(B) 1:N

(C) N:1

(D) N:M

(E) None of the other answers.

Answer with the option's letter from the given choices directly. No punctuation.

Which schedule is an equivalent serial schedule for the precendence graph in <image 1>?

(A) T3 -> T1 -> T2

(B) T2 -> T1 -> T3

(C) T1 -> T2 -> T3

(D) There are no serial schedules for the graph.

Answer with the option's letter from the given choices directly. No punctuation.

Suppose we have a training set with m=3 examples,plotted below.Our hypothes is representation is $h_{\theta}(x) = \theta_1x$, with parameter $\theta_1$. The cost function $J(\theta_1)$ is $J(\theta_1)$=${1\over2m}\sum\nolimits_{i=1}^m(h_\theta(x^i) - y^i)^2$. What is $J(0)$?<image 1>

(A) 0

(B) 1/6

(C) 1

(D) 14/6

Answer with the option's letter from the given choices directly. No punctuation.

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 1> shows which of the following depth first forests?

(A) {a, b, e} {c, d, h} {f, g}

(B) {a, b, e} {f, g} {c, d} {h}

(C) {a, b, e} {f, g} {c, d} {h}

(D) {a, b, e} {c, d, f, g, h}

Answer with the option's letter from the given choices directly. No punctuation.

Previous slide

Next slide

Among the following binary trees, which one may become a binary search decision tree (excluding external nodes)

(A) <image 1>

(B) <image 2>

(C) <image 3>

(D) <image 4>

Answer with the option's letter from the given choices directly. No punctuation.

Given the adjacency matrix of a weighted undirected graph as follows, the total weight of its minimum spanning tree is:<image 1>

(A) 22

(B) 20

(C) 15

(D) 8

Answer with the option's letter from the given choices directly. No punctuation.

Consider the scenario shown below, with four different servers connected to four different clients over four three-hop paths. The four pairs share a common middle hop with a transmission capacity of R = 300 Mbps. The four links from the servers to the shared link have a transmission capacity of RS = 80 Mbps. Each of the four links from the shared middle link to a client has a transmission capacity of RC = 60 Mbps. <image 1> What is the maximum achievable end-end throughput (in Mbps) for each of four client-to-server pairs, assuming that the middle link is fairly shared (divides its transmission rate equally)? Omit the unit of Mbps.

<image 1> What is the DAG shown above for?

(A) ((x + y) - ((x + y) * (x - y))) - ((x + y) * (x - y))

(B) ((x - y) - ((x + y) * (x - y))) + ((x + y) * (x - y))

(C) (x - ((x + y) * (x - y))) + ((x + y) * (x - y))

(D) ((x + y) - ((x + y) * (x - y))) + ((x + y) * (x - y))

Answer with the option's letter from the given choices directly. No punctuation.

The maximum flow from v1 to v6 is ____: <image 1>

(A) 11

(B) 0

(C) 12

(D) 13

Answer with the option's letter from the given choices directly. No punctuation.

A hash table of length 10 uses open addressing with hash function h(k)=k mod 10, and linear probing. After inserting 6 values into an empty hash table, the table is as shown below. Which one of the following choices gives a possible order in which the key values could have been inserted in the table?<image 1>

(A) 46, 42, 34, 52, 23, 33

(B) 34, 42, 23, 52, 33, 46

(C) 46, 34, 42, 23, 52, 33

(D) 42, 46, 33, 23, 34, 52

Answer with the option's letter from the given choices directly. No punctuation.

You train a learning algorithm,and find that it has unacceptably high error on the test set.You plot the learning curve,and obtain the figure below.Is the algorithm suffering from high bias,high variance,or neither?<image 1>

(A) High bias

(B) High variance

(C) Neither

Answer with the option's letter from the given choices directly. No punctuation.

What data structure is pictured in <image 1>?

(A) Singly linked list

(B) Doubly linked list

(C) Circularly linked list

(D) Array

(E) None of the other answers

Answer with the option's letter from the given choices directly. No punctuation.

<image 1> shows a DFA. Is it minimal?

(A) yes

(B) no

(C) not sure

Answer with the option's letter from the given choices directly. No punctuation.

In the scenario below, imagine that you're sending an http request to another machine somewhere on the network. <image 1> What layer in the IP stack best corresponds to the phrase: 'moves datagrams from the source host to the destination host'

(A) Application Layer

(B) Transport Layer

(C) Network Layer

(D) Link Layer

(E) Physical Layer

Answer with the option's letter from the given choices directly. No punctuation.

Delete the minimum number from the given leftist heap. Which one of the following statements is TRUE? <image 1>

(A) 8 is NOT the root

(B) 12 is the right child of 8

(C) 24 is the left child of 13

(D) 35 is the right child of 24

Answer with the option's letter from the given choices directly. No punctuation.

Which process will finish last in the resource-allocation graph in <image 1>?

(A) P1

(B) P2

(C) P3

(D) There is a deadlock

(E) Not enough information to tell.

Answer with the option's letter from the given choices directly. No punctuation.