Govt. Exams
Entrance Exams
Peek() returns the top element without modifying the stack. Pop() removes and returns it. Peek() throws InvalidOperationException if the stack is empty.
HashSet<T> requires O(n) space to store n unique elements in the underlying hash table structure.
HashSet<T>.Add() returns false if the element already exists, true if added successfully. No exception is thrown.
HashSet<T> uses a hash table internally, providing O(1) average case lookup, insert, and delete operations.
Peek() returns the element at the front of the queue without removing it. Dequeue() would remove it.
Select() is the LINQ method that projects each element to a new form, similar to map in functional programming languages.
HashSet<T>.Add() returns false if the element already exists and does not add duplicates, maintaining set semantics.
Where<T> is a LINQ method that filters elements based on a predicate condition while maintaining type safety in the collection.
Peek() returns the top element without removal. Pop() removes it. Top() and Get() are not Stack<T> methods.
List<T> is backed by an array, allowing O(1) random access by index.
About C# Programming Practice on iGET
iGET offers 76+ free C# Programming MCQ questions covering all important topics. Each question is prepared by subject experts and comes with detailed explanations to help you understand concepts deeply, not just memorize answers.
Why prepare with iGET?
100% free access, timed mock tests, instant results with detailed analysis, topic-wise progress tracking, and bookmark feature for revision. Trusted by thousands of aspirants preparing for UPSC, SSC, Bank, Railway, NEET, JEE and other competitive exams across India.
How to use this page effectively
Start by selecting a difficulty level (Easy / Medium / Hard) or pick a specific topic from the topics strip. Attempt questions, check your answer instantly, read the explanation carefully, and bookmark tricky ones for later revision. For full exam-style practice, take a Mock Test from the right sidebar.