Cybernetics College Interview Questions and Answers

Implement an API in Java to fetch top rated movies in a certain genre from an external datasource using pagination.

• Create a REST API endpoint in Java using Spring Boot framework

• Implement pagination by using query parameters for 'page' and 'size'

• Filter the movies by genre and sort them by rating to fetch the top rated ones

• Use a service layer to interact with the external datasource and fetch the data

• Return the filtered and paginated movie data in the response

Find the minimum number of taps needed to water the entire garden using given tap ranges.

• Iterate over each tap and find the maximum range it can cover.

• Sort the taps based on their starting position and ending position.

• Use a greedy approach to select the taps that cover the maximum range possible.

• If any part of the garden remains uncovered, return -1.

DFS traversal problem on an undirected and disconnected graph to find connected components.

• Perform Depth First Search (DFS) on the graph to find connected components.

• Use a visited array to keep track of visited vertices.

• Iterate through all vertices and perform DFS on unvisited vertices to find connected components.

• Print the number of connected components and list vertices in each component in ascending order.

Implement a queue using stacks following FIFO principle.

• Use two stacks to simulate a queue - one for enqueueing and one for dequeueing.

• For enqueuing, simply push elements onto the stack.

• For dequeuing, if the dequeue stack is empty, transfer all elements from enqueue stack to dequeue stack.

• Peek operation can be done by checking the top element of the dequeue stack.

• Check if the queue is empty by verifying if both stacks are empty.

Return all subsets of an array that sum to a given integer K.

• Use recursion to generate all possible subsets of the array.

• Keep track of the current subset and its sum while traversing the array.

• If the sum of the subset equals K, add it to the result.

• Sort the elements in each subset to ensure increasing order of index.

• Handle duplicate elements in the array appropriately.