What is a collision in a hash table?
Correct answer D. Two different keys hash to the same index
Subject / 421 questions
Programming MCQs
Programming MCQs are multiple-choice questions on the basic concepts and syntax of programming languages, here covering C, C++, Java, PHP and HTML. Topics include keywords, loops, pointers, classes, constructors, functions and HTML tags. They help computer science students and candidates for IT, programmer and lecturer posts. Each question shows its answer instantly for quick self-assessment.
How does separate chaining resolve collisions in a hash table?
Correct answer B. Each slot holds a linked list of all keys that hash to it
Keys 15, 22 and 8 are inserted in that order into a hash table of size 7 using h(k) = k mod 7 and linear probing. At which index is 8 stored?
Correct answer B. 3
Advertisement
Keys 23, 34 and 45 are inserted in that order into a hash table of size 11 using h(k) = k mod 11 and quadratic probing, h(k, i) = (h(k) + i²) mod 11. At which index is 45 stored?
Correct answer A. 5
A hash table has 40 slots and currently stores 30 keys. What is its load factor?
Correct answer D. 0.75
Which problem is most closely associated with linear probing in open-addressing hash tables?
Correct answer C. Primary clustering
What is the average time complexity of search in a well-designed hash table with a low load factor?
Correct answer D. O(1)
Which condition must hold before binary search can be applied to an array?
Correct answer C. The array must be sorted
What is the maximum number of comparisons binary search needs to find a key in a sorted array of 1000 elements?
Correct answer D. 10
Advertisement
What does the array look like after the first pass of bubble sort in ascending order?
Correct answer D. [3, 7, 1, 5, 9]
What does the array look like after two passes of selection sort in ascending order?
Correct answer A. [10, 13, 14, 37, 29]
What is the best-case time complexity of insertion sort, and when does it occur?
Correct answer C. O(n), when the input is already sorted
Quick sort always chooses the last element as the pivot. Which input causes its worst-case O(n²) running time?
Correct answer A. An array that is already sorted
Using Lomuto partitioning with the last element as pivot, what is the array after one partition step?
Correct answer B. [3, 1, 4, 8, 9, 7]
Which statement about merge sort is correct?
Correct answer A. It is stable and runs in O(n log n) time in every case, but needs O(n) extra space for arrays
Advertisement
Which of these sorting algorithms is not stable in its standard form?
Correct answer B. Heap sort
What is the time complexity of counting sort for n integers whose values lie in the range 0 to k?
Correct answer B. O(n + k)
A binary search tree is built by inserting 40, 25, 60, 10, 30, 55, 70, 5 in that order. What is its postorder traversal?
Correct answer A. 5, 10, 30, 25, 55, 70, 60, 40
A binary search tree is built by inserting 30, 50, 10, 40, 20, 60 in that order. What is its level-order traversal?
Correct answer A. 30, 10, 50, 20, 40, 60
Which traversal of a binary search tree visits the keys in ascending sorted order?
Correct answer D. Inorder
About Programming MCQs
The C Language section tests reserved keywords, pointers, memory allocation functions such as malloc and calloc, and loop types, including the do-while loop that runs at least once. The C++ section covers object-oriented ideas: classes as templates for objects, default access of class members, constructors and default constructors, and the header files needed for file input and output. These details are often tested through short code snippets.
The Java section covers comments, data types and the boolean results returned by relational operators, while the PHP section includes the language's history and string functions that change text case. The HTML section tests the basic structure of a web page, such as the first tag in a document, the tag for the largest heading, the image tag and the idea of block-level elements.
Programming MCQs matter because technical posts in IT departments, teaching jobs in computer science and campus recruitment rounds use them to check fundamentals quickly. Questions often look simple but hinge on one precise rule, such as a default value or a keyword, so practising them sharpens accuracy and helps you write correct code in practical tests. It also prepares you for the written and coding stages that often follow.
Key facts to remember
- In C++, members of a class are private by default, while struct members are public by default.
- A do-while loop executes its body at least once before checking the condition.
- PHP was created by Rasmus Lerdorf and is widely used for server-side web development.
- A default constructor takes no arguments and is called when an object is created.
- The h1 tag produces the largest heading in HTML.
- In C, malloc and calloc allocate memory dynamically at run time.
- A class is a blueprint or template from which objects are created.
- In Java, relational operators return a boolean value of true or false.
Exams that include Programming MCQs
Pakistan
- FPSC
- PPSC
- NTS
- Lecturer tests
- KPPSC
India
- Campus placements
- UGC NET
- GATE
- State PSC exams
Bangladesh
- BCS
- Government job tests
- Bank job exams
How to prepare for Programming MCQs
- Type and run short code snippets for each concept, such as loops or constructors, because seeing output fixes rules in memory.
- Make a list of reserved keywords for C, C++ and Java, noting which words belong to only one language.
- Compare similar features across languages in a table, for example default access, comment syntax and memory allocation.
- For output-based questions, trace the code line by line on paper and track each variable's value.
- Learn the basic skeleton of an HTML page by heart, including doctype, html, head, title and body tags.
Frequently asked questions
Which languages are covered in Programming MCQs?
This category covers C, C++, Java, PHP and HTML. Questions focus on fundamentals such as keywords, loops, pointers, classes, constructors, functions and web page tags, which are the concepts most often tested in recruitment and university exams.
Which exams ask Programming MCQs?
Programming questions appear in tests for IT, programmer and computer science teaching posts. In Pakistan they appear in FPSC, PPSC and lecturer tests. In India they are common in campus placements, UGC NET and GATE, and in Bangladesh in BCS and programmer recruitment.
How many Programming MCQs are on MCQs360?
MCQs360 has 75 Programming MCQs, split into C, C++, Java, PHP and HTML sections. Every question shows its correct answer instantly, and practice is free without sign-up. Each section can be practised on its own.
How should I prepare for Programming MCQs?
Revise core concepts language by language, then practise MCQs and test any doubtful answer by writing a small program. Pay attention to defaults, keywords and syntax details, since many questions hinge on them. Tracing code on paper also builds the speed needed for output-based questions.
What is the difference between a while loop and a do-while loop?
A while loop checks its condition before running the body, so it may not run at all if the condition is false at the start. A do-while loop runs the body first and checks the condition afterwards, so it always executes at least once.
What is a constructor in object-oriented programming?
A constructor is a special member function that runs automatically when an object is created, usually to initialise its data. It has the same name as the class and no return type. A constructor with no parameters is called a default constructor.
Last reviewed October 2026