Associate Professional

A train crosses a pole in 12 seconds and a 120 m platform in 20 seconds. What is its speed?

A) 36 km/h
B) 45 km/h
C) 54 km/h
D) 60 km/h

Find the missing number: 3, 9, 27, 81, ?

A) 162
B) 243
C) 324
D) 218

If A:B = 2:3 and B:C = 4:5, find A:C.

A) 2:5
B) 8:15
C) 4:15
D) 3:5

A can finish the work in 10 days, and B can finish it in 15 days. How many days will they take together?

A) 5
B) 6
C) 7
D) 8

Find the next number: 1, 4, 9, 16, 25, ?

A) 30
B) 35
C) 36
D) 49

What is the angle between the clock hands at 3:15?

A) 0°
B) 7.5°
C) 15°
D) 30°

int x = 5;
printf("%d", x++ + ++x);

A) 11
B) 12
C) 13
D) Undefined

printf("%d", 10/3);

A) 3.33
B) 3
C) 4
D) Error

Which operator has the highest precedence?

A) +
B) *
C) ()
D) %

What is the time complexity of nested loops (n × n)?

A) O(n)
B) O(log n)
C) O(n²)
D) O(n³)

What must recursion have?

A) Loop
B) Base condition
C) Array
D) Pointer

Which of the following causes a memory leak?

A) malloc without free
B) free without malloc
C) static variable
D) recursion

What is the height of a balanced BST with n nodes?

A) O(n)
B) O(log n)
C) O(n log n)
D) O(1)

What is the worst-case time complexity of binary search?

A) O(1)
B) O(log n)
C) O(n)
D) O(n log n)

A queue can be implemented using:

A) Array
B) Linked List
C) Both
D) None

Inorder traversal gives a sorted order in:

A) Heap
B) BST
C) Graph
D) Stack

Collision occurs in:

A) Stack
B) Queue
C) Hashing
D) Tree

A heap is:

A) Sorted
B) Complete binary tree
C) Linked list
D) Graph

Round Robin scheduling uses:

A) Priority
B) Time slice
C) FIFO
D) LIFO

Thrashing occurs when:

A) Low CPU
B) Excess paging
C) High disk
D) No process

A semaphore is used for:

A) Memory
B) Synchronization
C) Storage
D) I/O

Which scheduling algorithm is non-preemptive?

A) SJF
B) Round Robin
C) Priority
D) FCFS

Which join returns only matching rows?

A) LEFT
B) RIGHT
C) INNER
D) FULL

Which normal form avoids partial dependency?

A) 1NF
B) 2NF
C) 3NF
D) BCNF

What does an index improve?

A) Insert
B) Delete
C) Read
D) All

In ACID properties, what does “C” stand for?

A) Consistency
B) Control
C) Check
D) Commit

Which command removes the table structure?

A) DELETE
B) DROP
C) TRUNCATE
D) REMOVE

TCP is:

A) Connectionless
B) Connection-oriented
C) Stateless
D) None

UDP is:

A) Reliable
B) Fast but unreliable
C) Secure
D) Slow

What is the port number for HTTP?

A) 21
B) 25
C) 80
D) 110

Choose the correct sentence:

A) He don’t like coffee
B) He doesn’t likes coffee
C) He doesn’t like coffee
D) He not like coffee

Synonym of “Abundant”:

A) Scarce
B) Plenty
C) Rare
D) Empty

Antonym of “Fragile”:

A) Weak
B) Strong
C) Soft
D) Breakable

She ____ to the market yesterday.

A) go
B) goes
C) went
D) going

Choose the correct preposition:

He is good ___ mathematics.

A) in
B) on
C) at
D) with

Identify the error:

“She did not knew the answer.”

A) did not
B) knew
C) the answer
D) No error

Choose the correct word:

I have ____ my work.

A) did
B) done
C) doing
D) do

They have been working ____ morning.

A) since
B) for
C) from
D) by

Choose the correct sentence:

A) Each of the boys have a book
B) Each of the boys has a book
C) Each of the boys have books
D) Each boys has a book

#include <stdio.h>
int main() {
    int a = 10;
    printf("%d %d %d", a, a++, ++a);
    return 0;
}

A) 10 10 12
B) 10 11 12
C) Undefined
D) 10 11 11

int x = 3;
if (x = 5)
    printf("Yes");
else
    printf("No");

A) Yes
B) No
C) Error
D) Depends

int a = 5;
printf("%d", a << 1);

A) 5
B) 10
C) 20
D) 2

int a = 10;
int b = 20;
printf("%d", a > b ? a : b);

A) 10
B) 20
C) Error
D) 0

for(int i=0;i<5;i++);
printf("Hello");

A) Prints 5 times
B) Prints once
C) Infinite loop
D) No output

int arr[3] = {1, 2};
printf("%d", arr[2]);

A) 0
B) 2
C) Garbage
D) Error

int x = 5;
printf("%d", ++x + x++);

A) 11
B) 12
C) Undefined
D) 13

printf("%d", sizeof('A'));

A) 1
B) 2
C) 4
D) Depends

You are given a square matrix ‘Mat’ of size ‘N’. You need to rotate ‘Mat’ by 90 degrees in the clockwise direction.

Note:

You must rotate the matrix in place, i.e., you must modify the given matrix itself. You must not allocate another square matrix for rotation.

For example

When,
‘N’ = 2 and ‘Mat’ = {{1, 2}, {3, 4}}, we must modify ‘Mat’ to {{3, 1}, {4, 2}}.

You have been given two arrays, 'AT' and 'DT', representing the arrival and departure times of all trains that reach a railway station.

Your task is to find the minimum number of platforms required for the railway station so that no train needs to wait.

Note :

1. Every train will depart on the same day and the departure time will always be greater than the arrival time. For example, A train with arrival time 2240 and departure time 1930 is not possible.

2. Time will be given in 24H format and colons will be omitted for convenience. For example, 9:05AM will be given as "905", or 9:10PM will be given as "2110".

3. Also, there will be no leading zeroes in the given times. For example, 12:10AM will be given as “10” and not as “0010”.

Given an array ARR of N integers and an integer S. The task is to find whether there exists a subarray(positive length) of the given array such that the sum of elements of the subarray equals to S or not. If any subarray is found, return the start and end index (0 based index) of the subarray. Otherwise, consider both the START and END indexes as -1.

Note:

If two or more such subarrays exist, return any subarray.

For Example: If the given array is [1,2,3,4] and the value of S is equal to 7. Then there are two possible subarrays having sums equal to S are [1,2,3] and [3,4].