Logical and Programming Questions

int main() { int x; x=printf("RCCIIT"); printf("%d",x); return 0; }

• RCCIIT

• 6

• RCCIIT6

• Error

{ int x=6,y=1; if (x&y) { printf("Yes"); } else { printf("No"); } return 0; }

• Yes

• No

• 0

• Error

console.log(1 + "2" + 3); console.log(1 + 2 + "3");

• 123 and 33

• 6 and 6

• 123 and 123

• 6 and 123

console.log(0.1 + 0.2 === 0.3);

• True

• False

• syntax error

• undefined

a = 1 def g(): print('Ans1: ', a) a = 2 print('Ans2: ', a) g()

• Error

• Ans1: 1 & Ans2: 2

• Ans1: 2 & Ans2: 2

• Ans1: 1 & Ans2: 1

What is the time complexity of finding the maximum element in an unsorted array of size n?

• O(1)

• O(n)

• O(log n)

• O(n log n)

What is the advantage of a doubly linked list over a singly linked list?

• Easier to delete a node

• Requires less memory

• Uses less number of pointers

• No advantage

What data structure is used for implementing recursion?

• Queue

• Stack

• Linked List

• Array

What is the base case in recursion?

• A case that stops the recursion

• A case that increases recursion depth

• A case that reduces function calls

• A case that skips function execution

Which sorting algorithm has the worst-case time complexity of O(n²)?

• Merge Sort

• Quick Sort

• Bubble Sort

• Heap Sort