Navigation Menu
Home
Full Length Papers
News Blog
NTS GAT CS Subject Computer Science Algorithms MCQs Test 2
General

NTS GAT CS Subject Computer Science Algorithms MCQs Test 2

Practice NTS GAT CS 2026 Subject Test Computer Science MCQs from Algorithms. Get instant results with Explanation.
Practice Quiz 2 for "Algorithms" (Computer Science). Total 26 MCQs available, split into 3 quizzes. Test your understanding of core concepts. Mastering these concepts is essential for securing a high percentile in NTS GAT CS.
General10 MCQs
1. What is recursion?
2. What does the base case in recursion do?
3. What is the time complexity of insertion sort?
4. What is a hash function?
5. What does Dijkstra's algorithm find?
General10 MCQs
6. What type of problem is the traveling salesman problem?
7. What is the knapsack problem?
8. What is a brute force algorithm?
9. What is backtracking?
10. What does Floyd-Warshall algorithm find?

📋 NTS GAT CS - Test Online Practice Quizzes

NTS GAT Computer Science Subject Test

Conducting Body: National Testing Service (NTS)
Frequency: Quarterly | Time: 120 Minutes
Negative Marking: No

⚡ Test Pattern (Total: 100 MCQs):

Merit Formula: There is no single NTS merit calculation formula for NTS GAT Subject Test. Universities determine their own merit criteria. Common weightages include: 30% Academic + 50% GAT + 20% Interview (only where specified by the university)