ROUND 1 QUIZ FOR 2nd 3rd years (SET 2)

The maximum number of binary trees that can be formed with three unlabelled nodes is:

• 1

• 5

• 4

• 3

Recursion is a method in which the solution of a problem depends on

• Larger instances of different problems

• Larger instances of the same problem

• Smaller instances of the same problem

• Smaller instances of different problems

Richa wants to book flight tickets in Danger-Airways’ online portal for his family of five. Passenger details like name, age, gender etc. should be entered for each member. The same process of getting details continues for all the five members. The above scenario is a good example for which looping statements?

• While loop

• For loop

• Do-while loop

Which of the following symbols is inappropriate in building the flowchart pertaining to sequential flow of program?

• Oval

• Rectangle

• Diamond

• Parallelogram

Consider the following scenario and identify all the possible objects.

"Ram and Sam are the employees of Allen software company. SPTS,LMS are the projects that are to be moved to the production environment. Every employee has empid, designation, allocation status and project has projectid, startDate, endDate, projcost".

• Ram, Sam, Allen software company, SPTS,LMS

• Ram, Sam, Allen software company, SPTS, LMS, Employee, Project

• Ram, Sam, empid, designation,allocation status, SPTS, LMS, projid, startdate, enddate, projcost

• Employee, Project

Which of the following is not the type of queue?

• Priority queue

• Single ended queue

• Circular queue

• Ordinary queue

What is #include <stdio.h>?

• Preprocessor directive

• Inclusion directive

• File inclusion directive

• None of the mentioned

Which of the following is not a storage class specifier in C?

• volatile

• extern

• typedef

• static

How many of possible ordered trees with 3 nodes A, B, C will be formed ?

• 16

• 12

• 6

• 10

Which of the following traversal approach lists the nodes of a binary search tree in ascending order?

• Post-order

• In-order

• Pre-order

• None of these