Crowdly
Додати до Chrome
Questions Bank (1394767 total)
Suppose you inserted the keys 12, 13, 7, 10, 22, 11, 20, 1, 5, 7, 25 into an open addressing hash table of size 13 using the hash function h(x) = (3 x + 7) mod 13 with linear probing. What is the load factor?
What is the lps[ ] array for the pattern “AAACAAAAAC” used by the Knuth-Mosrris-Pratt algorithm
Точність проведеного експерименту характеризує
What is the minimum total weight of unscheduled tasks when there is one processor, no preemption is allowed, and there are 8 tasks with equal lengths (li) of 2, with given weights and deadlines as follows: t1: (w1 = 2, d1 = 10), t2: (w2 = 3, d2 = 12), t3: (w3 = 8, d3 = 6), t4: (w4 = 6, d4 = 4), t5: (w5 = 5, d5 = 2), t6: (w6 = 4, d6 = 4), t7: (w7 = 10, d7 = 8), t8: (w7 = 12, d7 = 6)?
Які знаки матимуть прирости координат, якщо α
Які два види поліморфізму реалізовано в C++?
Under what condition does a directed acyclic graph (DAG) have a unique topological ordering?
Consider two recursive algorithms A and B to solve a problem. The recurrences corresponding to their running times are
A. T(m) = 2T(m/2)+m2
B. T(m) = 8T(m/4)+10m2
Which of these algorithms is faster (i.e., more efficient)?
What is the time complexity of the Floyd-Warshall all shortest path algorithm for a graph with V vertices? Select the tightest bound.