Aspire Faculty ID #19286 · Topic: UGC NET Computer Science June 2019 (Paper II) · Just now
UGC NET Computer Science June 2019 (Paper II)

Consider the following steps:

$S_1$: Characterize the structure of an optimal solution

$S_2$: Compute the value of an optimal solution in bottom-up fashion

Which of the step(s) is/are common to both dynamic programming and greedy algorithms?

Solution

Both dynamic programming and greedy algorithms use the idea of optimal substructure.

So, characterizing the structure of an optimal solution is common to both.

Therefore, $S_1$ is common.

But computing the value of an optimal solution in bottom-up fashion is mainly a dynamic programming approach.

It is not a necessary step in greedy algorithms.

So, $S_2$ is not common.

Previous 10 Questions — UGC NET Computer Science June 2019 (Paper II)

Nearest first
1
Consider the complexity class $CO-NP$ as the set of languages $L$ such that $\overline{L}\in NP$, and the following two…
Topic: UGC NET Computer Science June 2019 (Paper II)
2
Consider double hashing of the form $h(k,i)=(h_1(k)+ih_2(k))\ \text{mod}\ m$ where $h_1(k)=k\ \text{mod}\ m$ $h_2(k)=1+…
Topic: UGC NET Computer Science June 2019 (Paper II)
3
Which of the following is application of depth-first search?
Topic: UGC NET Computer Science June 2019 (Paper II)
4
Which of the following is best running time to sort $n$ integers in the range $0$ to $n^2-1$?
Topic: UGC NET Computer Science June 2019 (Paper II)
5
Consider the Euler's phi function given by $\phi(n)=n\prod\left(1-\dfrac{1}{p}\right)$ where $p$ runs over all the prim…
Topic: UGC NET Computer Science June 2019 (Paper II)
6
There are many sorting algorithms based on comparison. The running time of heapsort algorithm is $O(n\lg n)$. Like $P$,…
Topic: UGC NET Computer Science June 2019 (Paper II)
7
Match List-I with List-II: List-I List-II (a) Prim's al…
Topic: UGC NET Computer Science June 2019 (Paper II)
8
Software validation mainly checks for inconsistencies between:
Topic: UGC NET Computer Science June 2019 (Paper II)
9
Which of the following are the primary objectives of risk monitoring in software project tracking? $P$: To assess wheth…
Topic: UGC NET Computer Science June 2019 (Paper II)
10
Software products need adaptive maintenance for which of the following reasons?
Topic: UGC NET Computer Science June 2019 (Paper II)

Next 10 Questions — UGC NET Computer Science June 2019 (Paper II)

Ascending by ID
1
Consider the following properties with respect to a flow network $G=(V,E)$ in which a flow is a real-valued function $f…
Topic: UGC NET Computer Science June 2019 (Paper II)
2
Consider the following statements: $S_1$: For any integer $n>1$, $a^{\phi(n)}\equiv 1\ (\text{mod }n)$ for all $a\in…
Topic: UGC NET Computer Science June 2019 (Paper II)
3
Which data structure is used by the compiler for managing variables and their attributes?
Topic: UGC NET Computer Science June 2019 (Paper II)
4
On translating the expression given below into quadruple representation, how many operations are required?$(ij)+(e+f)(a…
Topic: UGC NET Computer Science June 2019 (Paper II)
5
Replacing the expression $4*2.14$ by $8.56$ is known as:
Topic: UGC NET Computer Science June 2019 (Paper II)
6
Shift-reduce parser consists of:$(a)$ Input buffer $(b)$ Stack $(c)$ Parse table Choose the correct option from those …
Topic: UGC NET Computer Science June 2019 (Paper II)
7
How many states are there in a minimum state automata equivalent to regular expression given below? Regular expression …
Topic: UGC NET Computer Science June 2019 (Paper II)
8
Match List-I with List-II: List-I List-II (a) $\overlin…
Topic: UGC NET Computer Science June 2019 (Paper II)
9
How can the decision algorithm be constructed for deciding whether context-free language $L$ is finite? $(a)$ By constr…
Topic: UGC NET Computer Science June 2019 (Paper II)
10
Consider the following grammar: $S\to XY$ $X\to YaY\mid a$ $Y\to bbX$ Which of the following statements is/are true abo…
Topic: UGC NET Computer Science June 2019 (Paper II)
Ask Your Question or Put Your Review.

loading...