Given a graph with n vertices, deciding if there exists a clique of size ≥ 195 is : 

This question was previously asked in
NIELIT Scientific Assistant CS 5 Dec 2021 Official Paper
View all NIELIT Scientific Assistant Papers >
  1. Solvable in polynomial time
  2. NP 
  3. NP-Complete
  4. None of the above

Answer (Detailed Solution Below)

Option 3 : NP-Complete
Free
NIELIT Scientific Assistant Quantitative Aptitude Mock Test
20 Qs. 20 Marks 30 Mins
Latest NIELIT Scientific Assistant Updates

Last updated on Jun 12, 2025

-> NIELIT Scientific Assistant city intimation slip 2025 has been released at the official website.

-> NIELIT Scientific Assistant exam 2025 is scheduled to be conducted on June 28. 

-> A total number of 113 revised vacancies have been announced for the post of Scientific Assistant in Computer Science (CS), Information Technology (IT), and Electronics & Communication (EC) streams.

-> Online application form, last date has been extended up to from 17th April 2025.

->The NIELT has revised the Essential Qualifications for the post of Scientific Assistant. Candidates must possess (M.Sc.)/ (MS)/ (MCA) / (B.E.)/ (B.Tech) in relevant disciplines.

 

-> The NIELIT Scientific Assistant 2025 Notification has been released by the National Institute of Electronics and Information Technology (NIELIT).

Hot Links: teen patti 50 bonus teen patti real cash game teen patti real teen patti joy official teen patti earning app