Suppose you are given an array s[1...n] and a procedure reverse (s,i,j) which reverse the order of elements in s between positions i and j (both inclusive). What does the following sequence do, where 1 < k

• Reverse all elements of s
• Rotates s left by k positions
• Leave s unchanged
• None of the above
• option2

Let A be a two-dimensional array declared as follows: A: array [1 …. 10] [1 …… 15] of integer; Assuming that each integer takes one memory location, the array is stored in row-major order and the first element of the array is stored at location 10

• 15j + i + 84
• 15i + j + 84
• 10i + j + 89
• 10j + I + 89
• option2

Two matrices M1 and M2 are to be stored in arrays A and B respectively. Each array can be stored either in row-major or column - major order in contiguous memory locations. The time complexity of an algorithm to compute M1 × M2 will be

• best if A is in row-major, and B is in column major order
• independent of the storage scheme
• best if both are in row-major order
• best if both are in column - major order
• option2

Full form of BHIM

• Bharat Interface for Money
• Bihar Interface In Money
• Bharat Interface Money
• Bihar Interface Money
• option1

Full form of UPI

• Unified payment system
• Unique Payment Interface
• United payment Interface
• Unified Payment Interface
• option4

In which class of Flynns Taxonomy, von Neumann architecture belongs to?

• SISD
• SIMD
• MIMD
• MISD
• option1

In Harvard architecture of computer

• Memory and Processor are separate units
• Data memory and Instruction memory are separate
• Both A and B are true
• None of the above
• option3

The memory which looses data when power to the memory circuit is removed is known as ___

• Volatile Memory
• Primary Memory
• Both a & b
• None of the above
• option3

What is the efficiency (time complexity in worst case) if we use binary search on the array implementation (Sorted) and the linked list implementation (Sorted) respectively?

• θ(n), θ(n)
• θ(logn), θ(n logn)
• θ(logn), θ(n)
• θ(n), θ(logn)
• option3

Find the sum of total number of factors of 3600 and 1440.

• 85
• 72
• 94
• 81
• option4