PHY-101 Quiz OnlineTest

  • Medium Not Specified
  • Available questions123
  • Chapter NameAll Chapter
image
image
image

PHY-101 Quiz OnlineTest

  • Total Questions20

  • Time Allowed20

Start Test

PHY-101 Quiz OnlineTest

00:00
Question # 1

If you know the size of the data structure in advance, i.e., at compile time, which one of the following is a good data structure to use.

Question # 2

Binary Search is an algorithm of searching, used with the ______ data

Question # 3

Which of the following statements is correct property of binary trees?

Question # 4

Consider a min heap, represented by the following array: 3,4,6,7,5 After calling the function deleteMin().Which of the following is the updated min heap?

Question # 5

Suppose A is an array containing numbers in increasing order, but some numbers occur more than once when using a binary search for a value, the binary search always finds ____________

Question # 6

If both pointers of the node in a binary tree are NULL then it will be a/an _______ .

Question # 7

Compiler uses which one of the following to evaluate a mathematical equation

Question # 8

Suppose you implement a heap (with the largest element on top) in an array. Consider the different arrays below, determine the one that cannot possibly be a heap:

Question # 9

A complete binary tree of height 3 has between ________ nodes.

Question # 10

Consider the following infix expression: x – y * a + b / c Which of the following is a correct equivalent expression(s) for the above?

Question # 11

I have implemented the queue with a circular array. If data is a circular array of CAPACITY elements, and last is an index into that array, what is the formula for the index after last?

Question # 12

A kind of expression where the operator is present between two operands called ________ expressions .

Question # 13

Which of the following statement is true about find(x) operation :

Question # 14

The _______ method of list will position the currentNode and lastCurrentNode at the start of the list.

Question # 15

Which of the following heap method increase the value of key at position „p‟ by the amount „delta‟?

Question # 16

Which of the following method is helpful in creating the heap at once?

Question # 17

_________ is a data structure that can grow easily dynamically at run time without having to copy existing elements.

Question # 18

"+” is a _________operator.

Question # 19

A binary tree with N internal nodes has ____ links ,links to internal node and ____links to external

Question # 20

If there are 56 internal nodes in a binary tree then how many external nodes this binary tree will have?

Submit

Matric Part 2/10th Class English Chapter 1 MCQ Test With Answer for Chapter 1 Hazrat Muhammad (S.A.W) an Embodiment of Justice

Here on this page you can attempt class 10 English chapter 1 mcqs online test and assess your progress. You can start the online test for class 10 English chapter 1 mcqs by clicking the “Start Chapter 1 Test” button and after that just select the answers one by one of all the question. If you want to prepare better for the 10th class English mcqs test, we have given 10th class English chapter 1 mcqs pdf file on this page. This 10th class English chapter 1 mcqs solved file contains all the chapter 1 English 10th class important mcqs. We encourage all the 10th class students to try this English online test, it will help you regardless in the 10th class English board exam. The English chapter 1 test also includes grammar mcqs to help students with objective part of their board exam.

Biology Chapter 1 - Answers Mode

  • Not ready for the test yet? No problem.

  • You can use the answers mode to study and prepare

  • yourself for the online MCQ test.

Start Test

Biology Chapter 1 MCQ - PDF

  • Download PDF with answers to study online or offline. The PDF cotnains all MCQ questions with answers for Class 10 Biology Chapter 1 - Acids and Liquids. Total questions are 12.

Download PDF