GeekForGeek ROUND 1

Which of the Data Structures provide constant time access to the minimum element in the collection?

• STACK

• QUEUE

• PRIORITY QUEUE

• LINKED LIST

Which of the following sorting algorithm is not an in-place sorting algorithm?

• Selection Sort

• Bubble Sort

• Merge Sort

• Insertion Sort

Given an array of integers , what is the time complexity of finding the second largest element in the array?

• O(n)

• O(n logn)

• O(n^2)

• O(1)

In a binary search tree, which traversal method would give a sorted order of elements?

• Pre-Order

• In-Order

• Post-Order

• Breadth-First Search

Which of the following is a dynamic programming algorithm used to find the longest common subsequence between two strings?

• Bellman-Ford algorithm

• Floyd-Warshall algorithm

• Dijkstra's algorithm

• Longest Common Subsequence Algorithm

What is the output of the following code snippet?

int x=5;

if (x=10){

cout<<"x is equal to 10"<<endl;

}else{

cout<<"x is not equal to 10"

<<endl;

}

• x is not equal to 10

• x is equal to 10

• Compile Error

• Runtime Error

int a={1,2,3,4,5};

cout<<*(a+2)<<endl;

• 1

• 2

• 3

• 4

What is the output of the following code snippet?

string s ="hello";

reverse(s.begin(),s.end());

cout<< s <<endl;

• hello

• olleh

• Compile Error

• Runtime Error

Which of the following is NOT a common addressing mode in computer architecture?

• Direct addressing mode

• Indirect addressing mode

• Indexed addressing mode

• Absolute addressing mode

• All of the above are common adressing mode

Which of the following best describes pipelining in computer architecture?

• A technique for processing multiple instructions simultaneously

• A technique for increasing the clock speed of a processor

• A technique for reducing memory access latency

• A technique for reducing instruction cache misses

• A technique for reducing the number of functional units in a processor