I recently appeared for the Eternal Limited Online Assessment. It consisted of 12 MCQs and 2 coding questions.

MCQ Section

The MCQs covered aptitude, programming fundamentals and core computer science subjects.

Topics included:

DBMS and SQL: These formed the majority of the technical MCQs.
Operating Systems
LRU Page Replacement: Around two questions were based on LRU paging.
Aptitude questions
Bubble Sort: One question asked for the number of swaps required to sort a given array.
Output-based programming questions
A few other questions were present, but I do not remember their exact topics.

Overall, the MCQ section was of easy-to-medium difficulty.

Coding Question 1: Rearranging Songs Using Heap/Priority Queue

We were given a 2D array containing information about authors and their songs.

The songs had to be rearranged such that:

No two consecutive songs belonged to the same author.
The rearrangement was based on the number of songs belonging to each author.

This problem could be solved using a max heap or priority queue.

The idea was to store each author along with their remaining number of songs in a max heap. After selecting an author, that author could be temporarily kept outside the heap so that the same author was not selected consecutively.

The problem was similar to Reorganize String or Task Scheduler.

Coding Question 2: Maximum Production Within maxPower

We were given n machines. For the i-th machine, its power requirement and the quantity produced by it were provided.

We were also given a value maxPower.

The task was to:

Sort the machines according to their power requirements.
Select the machines in increasing order of power.
Keep adding their power requirements while the total power did not exceed maxPower.
Add the corresponding quantities to calculate the maximum total quantity produced.

This was a basic sorting and greedy problem.

Hope this helps