...
November 27, 2023

Question 11910 – Algorithms

We can show that the clique problem is NP-hard by proving that Correct Answer: D A CLIQUE ≤ P 3-CNF_SAT B CLIQUE ≤ P VERTEX_COVER C […]
Do you like it?
0 Read more
November 27, 2023

Web-Technologies

Question 3 Consider the XML document fragment given below: Consider the XPath expression: *[not (self)::TOC] What would be the result of the given XPath expression when […]
Do you like it?
0 Read more
November 27, 2023

STQC-NIELIT STA 2021

Question 6 The day before the day yesterday is three days after Saturday. What day is it today? A Tuesday B Wednesday C Thursday D Friday […]
Do you like it?
0 Read more
November 27, 2023

NTA UGC NET DEC-2022 Paper-2

Question 41 Consider the following statements: P: There exists no simple, undirected and connected graph with 80 vertices and 77 edges. Q: All vertices of Euler […]
Do you like it?
0 Read more
123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219