Which of the following is NOT a valid C++ identifier?

Which data structure uses FIFO principle?

Predict the output

a = [1, 2, 3]

b = a

b.append(4)

print(a)

Predict the output

int a = 5, b = 2;

cout << a / b * b;

Predict the output

int x = 5;

cout << x++ + ++x;

Predict the output

int arr[] = {1,2,3,4};

cout << sizeof(arr)/sizeof(arr[0]);

Predict the output

print(2**3**2)

Predict the ouput

System.out.println(10 + 20 + "30" + 40);

Predict the output

String str1 = "Hello";

String str2 = "Hello";

System.out.println(str1 == str2);

Predict the output

int arr[] = {1,2,3,4};

int *p = arr;

cout << *(p+3);

Predict the output

print(bool("False"))

Which of the following problems can be solved using Dynamic Programming?

Which of the following is a valid way to declare a constant in C++?

Predict the output

cout << (10 & 7);

 Which sorting algorithm has best average-case time complexity?

Predict the output

String s = "abc";

s.concat("def");

System.out.println(s);

What is C++ vector insertion amortized time complexity?

Which is NOT true about C++ unordered_map?

 Which sorting algorithm is NOT stable?

Guess the output:

def func(x, l=[]):

l.append(x)

return l

print(func(1))

print(func(2))

Which algorithm gives the shortest path with negative edges?

What is the auxiliary space of merge sort?

For a graph with V vertices and E edges, the time complexity of Dijkstra’s algorithm using a min-heap is?

Which traversal method of a binary tree can be used to obtain nodes in

NON-DECREASING ORDER if the tree is a BST?