Register

UGC NET CSE | June 2025 | Part 2 | Question: 38

• edited by
214 views

Please log in or register to answer this question.

Voting & Accepting an answer helps improve the community
Answer:
← Previous · UGC NET CSE | June 2...Next → · UGC NET CSE | June 2...
← Previous in category · UGC NET CSE | June 2...Next in category → · UGC NET CSE | June 2...
Position:
Show:

Related questions

0 0 votes
1 1 answer
604
604 views
Shubham Sharma 2 asked Sep 10, 2025
604 views
UGC NET CSE | June 2025 | Part 2 | Question: 55
Consider the following steps involved in the application of Genetic algorithm for a problemSelect a pair of parents from the populationApply mutation at each locus with p...
1 1 vote
1 1 answer
469
469 views
Shubham Sharma 2 asked Sep 10, 2025
469 views
UGC NET CSE | June 2025 | Part 2 | Question: 27
The tight asymptotic bound for the recurrence $T(n)=2 T(n / 4)+\sqrt{n}$ is$\Theta(\sqrt{n})$$\Theta(n \log n)$$\Theta(\sqrt{n} \log n)$$\Theta(n \log \sqrt{n})$
1 1 vote
2 2 answers
491
491 views
Shubham Sharma 2 asked Sep 10, 2025
491 views
UGC NET CSE | June 2025 | Part 2 | Question: 28
The longest common subsequence of $\{1,2,3,2,4,1,2\}$ and $\{2,4,3,1,2,1\}$ is$2,1,2,3$$1,3,2,1$$2,3,2,1$$2,3,1,2,1$
0 0 votes
1 1 answer
424
424 views
Shubham Sharma 2 asked Sep 10, 2025
424 views
UGC NET CSE | June 2025 | Part 2 | Question: 49
The correct sequence of constructing Huffman tree isRepeat until root formedCreate leaf nodesBuild priority queueCombine lowest frequency nodesChoose the correct answer f...