Multilingual learning is ready for competitive exam preparation.
K Kiran InsightLearn. Practice. Rise.
Start practicing
Permanent question page

Computer Gk question with answer

Read, practise, and share this question using its permanent link.

Question #74,705
Computer Gk English MCQ UPPSC LT Grade Computer Science 2018

Q.Match List-I with List-II and select the correct answer using the codes given below the Lists: List-I List-II Greedy A. All-pairs shortest path Quicksort B. Depth-first search C. Minimum weight Dynamic spanning tree programming D. Connected Divide and conquer components

Continue practising
View category →
Q01 For merging two sorted lists of sizes m and n into a sorted list of size m+n, how many comparisons are required? English · UPPSC LT Grade Computer Science 2018 Q02 A sort which compares adjacent elements in a list and switches where necessary is a English · UPPSC LT Grade Computer Practice Set-1 Q03 The concatenation of two lists is to be performed in O(1) time. Which of the following implementations of lists cou... English · UPPSC LT Grade Computer Science 2018 Q04 Which of the following traversal techniques lists the nodes of a binary search tree in ascending order? English · UPPSC LT Grade Computer Science 2018 Q05 Each item in a linked list is called : English · UPPSC LT Grade Computer Practice Set-3 Q06 Which of the following do you think is used to separate the base classes in a base class list ? English · UPPSC LT Grade Computer Practice Set-3