VU PHY-101 Online Test Preparation

PHY-101 Quiz OnlineTest

Try the PHY-101 Quiz OnlineTest.

Total Questions20
Time Allowed20

ClassName Chapter Wise Test

Here is List Of ClassName Chapter Wise Tests

Ch. #	Test Name	MCQs Available	PDF File	Answers Mode	Launch Test
1	CS-301 Final Term Exams Preparation Virtual University	123	Download PDF	MCQ Answers	Launch Test
1	PHY-101 Quiz OnlineTest	123	Download PDF	MCQ Answers	Launch Test

Here you can prepare phy-101 Test. Click the button for phy-101 100% free full practice test.

Top Scorers of Online MCQ Test for Biology Class 10

Muhammad Hasan Ali 04 - Feb - 2024 01 Mins 04 Sec 12/12
Muhammad Hasan Ali 04 - Feb - 2024 01 Mins 04 Sec 12/12
Muhammad Hasan Ali 04 - Feb - 2024 01 Mins 04 Sec 12/12
Muhammad Hasan Ali 04 - Feb - 2024 01 Mins 04 Sec 12/12
Muhammad Hasan Ali 04 - Feb - 2024 01 Mins 04 Sec 12/12
Muhammad Hasan Ali 04 - Feb - 2024 01 Mins 04 Sec 12/12
Muhammad Hasan Ali 04 - Feb - 2024 01 Mins 04 Sec 12/12
Muhammad Hasan Ali 04 - Feb - 2024 01 Mins 04 Sec 12/12
Muhammad Hasan Ali 04 - Feb - 2024 01 Mins 04 Sec 12/12
Muhammad Hasan Ali 04 - Feb - 2024 01 Mins 04 Sec 12/12
Muhammad Hasan Ali 04 - Feb - 2024 01 Mins 04 Sec 12/12
Muhammad Hasan Ali 04 - Feb - 2024 01 Mins 04 Sec 12/12
Muhammad Hasan Ali 04 - Feb - 2024 01 Mins 04 Sec 12/12

PHY-101 Quiz OnlineTest (MCQs With Answers)

Sr. #	Questions	Answers Choice
1	Here is a small function definition:<div>void f(int i, int &k)</div><div>{ i</div><div>= 1; k = 2;</div><div>}</div><div>Suppose that a main program has two integer variables x and y, which are given the value 0. Then the main program calls f(x,y); What are the values of x and y after the function f finishes?</div>	Both x and y are still 0. Both x and y are still 0. x is still 0, but y is now 2. x is now 1, and y is now 2.
2	A queen is a data structure where elements are,	inserted at the front and removed from the back inserted and removed from the top. inserted at the back and removed from the front. inserted and removed from both ends.
3	Which one of the following is TRUE about iteration?	Iteration extensively uses stack memory Threaded Binary Trees use the concept of iteration. Iterative function calls consumes a lot of memory. Recursion is more efficient than iteration.
4	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:	7 6 5 4 3 2 1 7 3 6 2 1 4 5 7 6 4 3 5 2 1 7 3 6 4 2 5 1
5	"+” is a _________operator.	Unary Binary Ternary None of the above
6	A complete binary tree us a tree that is ___ filled with the possible exception of the bottom level.	partially completely incompletely partly
7	Consider the following paragraph with blanks. A …….…….. is a linear list where …………… and ………… take place at the same end . This end is called the …….………. What would be the correct filling the above blank positions?	(i) queue (ii) insertion (iii) removals (iv) top (i) stack (ii) insertion (iii) removals (iv) bottom (i) stack (ii) insertion (iii) removals (iv) top (i) tree (ii) insertion (iii) removals (iv) top
8	I have implemented the queue with a linked list, keeping track of a front pointer and a rear pointer. Which of these pointers will change during an insertion into an EMPTY queue?	Neither changes only front pointer charges Only rear pointer changes. Both change. Since it is an empty queue the front and rear are initialize to -1, so on insertion both the pointers will change and point to 0.
9	In a perfectly balanced tree the insertion of a node needs ________ .	One rotation Two rotations Rotations equal to number of levels No rotation at all
10	Which of the following statement is correct?	A Threaded Binary Tree is a binary tree in which every node that does not have a left child has a THREAD (in actual sense, a link) to its INORDER successor. A Threaded Binary Tree is a binary tree in which every node that does not have a right child has a THREAD (in actual sense, a link) to its PREOREDR successor. A Threaded Binary Tree is a binary tree in which every node that does not have a right child has a THREAD (in actual sense, a link) to its INORDER successor. A Threaded Binary Tree is a binary tree in which every node that does not have a right child has a THREAD (in actual sense, a link) to its POSTORDER successor.