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,813
Computer Gk English MCQ UPPSC LT Grade Computer Science 2018

Q.Which of the following is useful in traversing a given graph by breadth-first search (BFS)?

Continue practising
View category →
Q01 Which one of the following is prefix representation of the infix expression A*(B+C)/D? English · UPPSC LT Grade Computer Science 2018 Q02 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 Q03 Which of the following algorithms solves the all-pairs shortest path problem? English · UPPSC LT Grade Computer Science 2018 Q04 Which of the following sorting algorithms has the worst time complexity of nlog(n)? English · UPPSC LT Grade Computer Science 2018 Q05 Which of the following is correct recurrence relation for worst caset of binary search? English · UPPSC LT Grade Computer Science 2018 Q06 Which of the following traversal techniques lists the nodes of a binary search tree in ascending order? English · UPPSC LT Grade Computer Science 2018