Fresh Grad MCQ Assessment
EJADA interview question (Egypt) · stage: Online Assessment · domain: CS Fundamentals · role: Software Engineer and Intern · difficulty: Easy · asked twice, last in June 2026
What they ask
Fresh graduates applying for the developer track get an online multiple choice assessment on a well-known coding platform before the interview. It covers data structures, OOP, design patterns, algorithms, .NET, C#, SQL and a problem-solving section. The interview that follows is described as friendly and mostly about fit with the team. Questions in this area, for example:
- Which collection gives O(1) average lookup by key? (array, linked list, hash table, binary search tree)
- What is the time complexity of binary search on a sorted array of n items?
- Which pattern guarantees a single instance of a class with a global access point?
- In C#, which of these is a value type:
string,int,class Foo,object? - Which SQL clause filters groups after aggregation:
WHERE,HAVING,GROUP BY,ORDER BY? - Given a short C# method with a loop, what does it print?
- Which of the following makes a class open for extension but closed for modification?
The problem-solving items are small: read a snippet, predict the output, or spot the bug.
What they look for
Solid fundamentals across the .NET stack rather than depth in any one area. The bar is passing, not perfection; the score mainly decides whether you get the friendly interview.