49 rows / 29 distinct inputs

Input | Output |
---|---|

<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. | (M) aM*|bbP Expected Answer: A Difficulty: Medium Subfield: Compiler Principle |

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. | (6) The matrix traversal that uses a spiral pattern, spiraling upwards and covering a maximum number of elements per row or column is: (D) spiral traversal of the matrix. The spiral pattern covers a greater number of elements per row or column as compared to the other traversation methods. Expected Answer: D Difficulty: Easy Subfield: Data Structure and Algorithm |

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. | (B) Expected Answer: D Difficulty: Hard Subfield: Data Structure and Algorithm Explanation: The edge (d-e) cannot be considered before (d-c) in Kruskal's minimum spanning tree algorithm because Kruskal's algorithm picks the edge with minimum weight from the current set of edges at each step. |

<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. | (D) ss Expected Answer: C Difficulty: Easy Subfield: Compiler Principle |

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. | D) N:M Expected Answer: D Difficulty: Easy Subfield: Database |

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. | (B) T2 -> T1 -> T3 Expected Answer: D Difficulty: Medium Subfield: Operating System |

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. | 210 775 411 888 1234 422 2472 3813 6589 110.9833765 0 0:00:00 Expected Answer: D Difficulty: Medium Subfield: Artificial Intelligence |

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. | In the conversation, you discuss the relationship between 11 discovery time stamps, 11 finishing time stamps, and 11 depth first search trees in each of the depth first forests. For each pair of data, you specify the matching pairs of discovery and finishing time stamps. Expected Answer: D Difficulty: Medium Subfield: Data Structure and Algorithm |

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. | A) <Image 1> Expected Answer: A Difficulty: Hard Subfield: Data Structure and Algorithm |

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. | 22 Expected Answer: D Difficulty: Medium Subfield: Data Structure and Algorithm |

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. | For each client-to-server pair, given the division of the middle link's transmission rate equally, the end-end throughput in Mbps can be calculated as follows: End-end throughput = (RS/3) * (R/3) * 2 End-end throughput = 300*60 * 2 End-end throughput = 1800 So, for each client-to-server pair, the maximum achievable end-end throughput is 1800 Mbps. Expected Answer: 60 Difficulty: Medium Subfield: Computer Network |

<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. | Answer: (B) (C) Expected Answer: D Difficulty: Hard Subfield: Compiler Principle |

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. | C) 342 The maximum flow from v1 to v6 is c. (3)42, following the flowchart structure which states that all paths have the same capacity, and hence, the flow from v1 to v6 is 342. Expected Answer: A Difficulty: Hard Subfield: Data Structure and Algorithm |

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. | (A) 46, 42, 34, 52, 23, 33 Here's the possible order of key values in the hash table based on the given choices: (A) In this option, 46 is the first key, followed by 42, then 34, 52, 23, and 33. (B) In this option, 23 is the first key, followed by 42, then 34, 46, 33, and 52. (C) In this option, 34 is the first key, followed by 46, then 42, 23, 52, and 33. (D) In this option, 42 is the first key, followed by 34, then 46, 23, 33, and 52. Expected Answer: C Difficulty: Hard Subfield: Data Structure and Algorithm |

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. | The algorithm is suffering from high variance. Expected Answer: A Difficulty: Medium Subfield: Artificial Intelligence |

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. | A) Singly linked list Expected Answer: A Difficulty: Easy Subfield: Operating System |

<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. | The correct answer is (C) not sure. There are too many states and transitions in the DFA, suggesting that it is not minimal. (A) yes Expected Answer: A Difficulty: Hard Subfield: Compiler Principle |

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. | (M) Movement of datagrams from the source host to the destination host Expected Answer: C Difficulty: Medium Subfield: Computer Network |

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. | The correct answer is (A) 8 is NOT the root. Expected Answer: C Difficulty: Easy Subfield: Data Structure and Algorithm |

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. | (P2) P2 Expected Answer: A Difficulty: Medium Subfield: Operating System |

Rows per page

Page 1 of 3