PRU221m ThuyBT26

1. Home
2. My courses
3.  PRU221m ThuyBT26
4.  26 June - 2 July
5.  Quiz 3_PRU221m

Started on Monday, 26 June 2023, 4:02 PM

State Finished
Completed on Monday, 26 June 2023, 5:00 PM
Time taken 58 mins 13 secs
Marks 31.00/50.00
Grade 6.20 out of 10.00 (62%)
Question 1
Complete
Mark 1.00 out of 1.00

Flag question
Question text

In linked list each node contains a minimum of two fields. One field is data field to store the
data second field is?

Select one:
a. Pointer to character
b. Pointer to node

c. Pointer to integer
d. Node
Feedback

The correct answer is: Pointer to node

Question 2
Complete
Mark 1.00 out of 1.00

Flag question
Question text

What is output?
public void MovePosition(Vector3 position);
Select one:
a. Provides the new position of Vector3 for the Rigidbody object.
b. Provides the new position for the Rigidbody object.
c. Provides the new Vector3 for the Rigidbody object.
d. All of the above
Feedback

The correct answer is: Provides the new position for the Rigidbody object.

Question 3
Complete
Mark 0.00 out of 1.00

Flag question
Question text

Linked lists are not suitable for the implementation of ___________

Select one:
a. Radix sort
b. Polynomial manipulation
c. Binary search
d. Insertion sort
Feedback

The correct answer is: Binary search

Question 4
Complete
Mark 1.00 out of 1.00
 Remove flag
Question text

If a simple graph G, contains n vertices and m edges, the number of edges in the Graph
G'(Complement of G) is ___________

Select one:
a. (n*n+n+2*m)/4
b. (n*n-n+2*m)/2
c. (n*n-n-2*m)/2
d. (n*n+n+2*m)/2
Feedback

The correct answer is: (n*n-n-2*m)/2

Question 5
Complete
Mark 0.00 out of 1.00

Flag question
Question text

What would be the asymptotic time complexity to add a node at the end of singly linked
list, if the pointer is initially pointing to the head of the list?

Select one:
a. θ(1)

b. θ
c. O(1)

d. O
Feedback
The correct answer is: θ

Question 6
Complete
Mark 1.00 out of 1.00

Flag question
Question text

What is the worst case time complexity of inserting a node in a doubly linked list?

Select one:
a. O(nlogn)

b. O
c. O(logn)
d. O(1)
Feedback

The correct answer is: O

Question 7
Complete
Mark 0.00 out of 1.00

Flag question
Question text

What would be the asymptotic time complexity to insert an element at the second position
in the linked list?

Select one:
a. O(1)
b. O
c. O(n2)
d. O(n3)
Feedback

The correct answer is: O(1)

Question 8
Complete
Mark 0.00 out of 1.00

Flag question
Question text

Which of the following points is/are not true about Linked List data structure when it is
compared with an array?

Select one:
a. Arrays have better cache locality that can make them better in terms of performance
b. It is easy to insert and delete elements in Linked List
c. Access of elements in linked list takes less time than compared to arrays

d. Random access is not allowed in a typical implementation of Linked Lists

Feedback

The correct answer is: Access of elements in linked list takes less time than compared to arrays

Question 9
Complete
Mark 1.00 out of 1.00

Flag question
Question text
To display an element of array, using....
Select one:
a. variableName[index] = float.Parse(Console.ReadLine());

b. None of the above

c. All of the above
d. Console.WriteLine(variableName[index]);

Feedback

The correct answer is: Console.WriteLine(variableName[index]);

Question 10
Complete
Mark 0.00 out of 1.00

Flag question
Question text

The .............  is part of the core Unity platform and available by default that support user
input data?
Select one:
a. None of the above
b. Input Manager
c. Input System
d. Monitor
Feedback

The correct answer is: Input Manager

Question 11
Complete
Mark 1.00 out of 1.00

Flag question
Question text
The controls to push the axis in the negative and positive direction respectively. These can
be keys on a keyboard, or buttons on a joystick or mouse.
What are properties of input axis?
Select one:
a. None of the above
b. Descriptive Name, Descriptive Negative Name
c. Negative Button, Positive Button
d. Alt Negative Button, Alt Positive Button
Feedback

The correct answer is: Negative Button, Positive Button

Question 12
Complete
Mark 1.00 out of 1.00

Flag question
Question text

Which of the following sorting algorithms can be used to sort a random linked list with
minimum time complexity?
Select one:
a. Merge Sort
b. Insertion Sort
c. Quick Sort
d. Heap Sort
Feedback

The correct answer is: Merge Sort

Question 13
Complete
Mark 1.00 out of 1.00

Flag question
Question text
With this property, it is the type of input that controls the axis. What are these value for
Type?
Select one:
a. Key or Mouse button
b. Joystick Axis
c. All of the above
d. Mouse Movement
Feedback

The correct answer is: All of the above

Question 14
Complete
Mark 0.00 out of 1.00

Flag question
Question text

Consider an implementation of unsorted singly linked list. Suppose it has its representation
with a head pointer only. Given the representation, which of the following operation can be
implemented in O(1) time?
i) Insertion at the front of the linked list
ii) Insertion at the end of the linked list
iii) Deletion of the front node of the linked list
iv) Deletion of the last node of the linked list

Select one:
a. I and III
b. I and II
c. I, II and IV
d. I, II and 
Feedback

The correct answer is: I and III

Question 15
Complete
Mark 0.00 out of 1.00
 Flag question
Question text

How many separate systems which Unity supports input through?

Select one:
a. Four
b. Two
c. One
d. None of the above
e. Three
Feedback

The correct answer is: Two

Question 16
Complete
Mark 0.00 out of 1.00

Flag question
Question text

.............gets the number of elements contained in the list

Select one:
a. Length property
b. Length method
c. Count method
d. Count property
Feedback

The correct answer is: Count property

Question 17
Complete
Mark 1.00 out of 1.00
 Flag question
Question text

The given Graph is regular.

Select one:
a. False
b. True
Feedback

The correct answer is: True

Question 18
Complete
Mark 1.00 out of 1.00

Flag question
Question text

To check whether a particular value is in the list, we can use....

Select one:
a.  Includes property
b. Contains property
c. Includes method
d. Contains method
Feedback
The correct answer is: Contains method

Question 19
Complete
Mark 1.00 out of 1.00

Flag question
Question text

The Input Manager uses the following types of controls:

Select one:
a. A virtual axis (plural: axes) is mapped to a control, such as a button or a key. When the user
activates the control, the axis receives a value in the range of [–1..1]. You can use this value in
your scripts
b. All of the above
c. Key refers to any key on a physical keyboard, such as W, Shift, or the space bar.

d. Button refers to any button on a physical controller (for example, gamepads), such as the X
button on a remote control.

e. None of the above

Feedback

The correct answer is: All of the above

Question 20
Complete
Mark 1.00 out of 1.00

Flag question
Question text

How far the user needs to move an analog stick before your application registers the
movement. At runtime, input from all analog devices that falls within this range will be
considered null.
it is ............property of input axis
Select one:
a. None of the above
b. Snap
c. Dead
d. Gravity
Feedback

The correct answer is: Dead

Question 21
Complete
Mark 1.00 out of 1.00

Flag question
Question text

Linked list data structure offers considerable saving in _____________

Select one:
a. Space Utilization and Computational Time
b. Space Utilization
c. Computational Time
d. Speed Utilization
Feedback

The correct answer is: Space Utilization and Computational Time

Question 22
Complete
Mark 0.00 out of 1.00

Flag question
Question text

What would be the asymptotic time complexity to insert an element at the front of the
linked list (head is known)?

Select one:
a. O(1)

b. O
c. O(n2)
d. O(n3)
Feedback

The correct answer is: O(1)

Question 23
Complete
Mark 1.00 out of 1.00

Flag question
Question text

Which of the following is true?

Select one:
a. A graph may contain no edges and many vertices
b. A graph may contain no vertices and many edges
c. A graph may contain no edges and no vertices
d. A graph may contain many edges and no vertices
Feedback

The correct answer is: A graph may contain no edges and many vertices

Question 24
Complete
Mark 1.00 out of 1.00

Flag question
Question text

The Input Manager window allows you to define ..............and their associated actions for
your Project
Select one:
a.  input axes 
b. input method
c. None of the above
d. input data
Feedback

The correct answer is:  input axes 

Question 25
Complete
Mark 1.00 out of 1.00

Flag question
Question text

 To access Input Manager, from Unity’s main menu, you can ........
Select one:
a. go to Edit > Project Settings, then select Input System from the navigation on the right.
b. go to Edit > Project Settings, then select Input Manager from the navigation on the right.
c. None of the above
d. go to Edit > Project Settings, then select Input Data  from the navigation on the right.
e. go to Edit > Project pane, then select Input Manager from the navigation on the right.
Feedback

The correct answer is: go to Edit > Project Settings, then select Input Manager from the
navigation on the right.

Question 26
Complete
Mark 1.00 out of 1.00

Flag question
Question text

In a simple graph, the number of edges is equal to twice the sum of the degrees of the
vertices.
Select one:
a. False
b. True
Feedback

The correct answer is: False

Question 27
Complete
Mark 0.00 out of 1.00

Flag question
Question text

The weight of the object in kilograms. Bear in mind that setting mass on a variety of
different Rigidbodies will make them behave realistically. For example, a heavy object
hitting a lighter object will cause the light object to be repelled further?
Select one:
a. Use Gravity
b. Mass
c. Drag
d. Angular Drag
Feedback

The correct answer is: Mass

Question 28
Complete
Mark 0.00 out of 1.00

Flag question
Question text
. For the given graph(G), which of the following statements is true?

Select one:
a. The edge connectivity of the graph is 1

b. G is a complete graph

c. G is not a connected graph
d. The vertex connectivity of the graph is 2
Feedback

The correct answer is: The vertex connectivity of the graph is 2

Question 29
Complete
Mark 1.00 out of 1.00

Flag question
Question text

What is the maximum number of edges in a bipartite graph having 10 vertices?

Select one:
a. 24
b. 16
c. 21
d. 25
Feedback

The correct answer is: 25

Question 30
Complete
Mark 0.00 out of 1.00

Flag question
Question text

The .............property of input axis can be used to display speed in units per second that the
axis falls toward neutral when no input is present.
Select one:
a. Gravity
b. Type
c. Sensitivity
d. Snap
Feedback

The correct answer is: Gravity

Question 31
Complete
Mark 0.00 out of 1.00

Flag question
Question text

Speed in units per second that the axis will move toward the target value. This is for digital
devices only.
What the property is it?
Select one:
a. Sensitivity
b.
None of the above

c. Gravity
d. Dead
e. Snap
Feedback

The correct answer is: Sensitivity

Question 32
Complete
Mark 1.00 out of 1.00

Flag question
Question text

In general, C# programmers tend to use ................... whenever possible,

though there isn't a set C# standard to do so.

Select one:
a. Nested loop
b. for loops 
c. foreach loops 
d. while loop
Feedback

The correct answer is: foreach loops 

Question 33
Complete
Mark 1.00 out of 1.00

Flag question
Question text

What is the number of edges present in a complete graph having n vertices?

Select one:
a. n
b. (n*(n+1))/2

c. (n*(n-1))/2

d. None of the aboves

Feedback

The correct answer is: (n*(n-1))/2

Question 34
Complete
Mark 1.00 out of 1.00

Flag question
Question text

Unity supports input from many types of input devices, including:

Select one:
a. None of the above
b.

 Joysticks

c.

 Touch screens

d. All of the above

e.

 VR and AR
 controllers

f.

 Movement-sensing capabilities of mobile devices, such as accelerometers or gyroscopes

g.

 Keyboards and mice

h.

 Controllers

Feedback

The correct answer is: All of the above

Question 35
Complete
Mark 1.00 out of 1.00

Flag question
Question text

Linked list is considered as an example of ___________ type of memory allocation.

Select one:
a. Heap
b. Dynamic
c. Compile time
d. Static
Feedback

The correct answer is: Dynamic

Question 36
Complete
Mark 1.00 out of 1.00

Flag question
Question text
Which of these is not an application of a linked list?

Select one:
a. To implement non-binary trees
b. To implement file systems
c. Random Access of elements
d. For separate chaining in hash-tables
Feedback

The correct answer is: Random Access of elements

Question 37
Complete
Mark 0.00 out of 1.00

Flag question
Question text

What is the space complexity for deleting a linked list?

Select one:

a. Either O(1) or O
b. O(1)
c. O(logn)

d. O
Feedback

The correct answer is: O(1)

Question 38
Complete
Mark 1.00 out of 1.00

Remove flag
Question text
A linear collection of data elements where the linear node is given by means of pointer is
called?
Select one:
a. Unordered list
b. Node list
c. Primitive list
d. Linked list
Feedback

The correct answer is: Linked list

Question 39
Complete
Mark 1.00 out of 1.00

Flag question
Question text

A connected planar graph having 6 vertices, 7 edges contains _____________ regions.

Select one:
a. 15
b. 1
c. 3
d. 11
Feedback

The correct answer is: 3

Question 40
Complete
Mark 0.00 out of 1.00

Flag question
Question text

What is a memory efficient double linked list?

Select one:
a. A doubly linked list that uses bitwise AND operator for storing addresses
b. An auxiliary singly linked list acts as a helper list to traverse through the doubly linked list
c. The list has breakpoints for faster traversal
d. Each node has only one pointer to traverse the list back and forth
Feedback

The correct answer is: Each node has only one pointer to traverse the list back and forth

Question 41
Complete
Mark 1.00 out of 1.00

Flag question
Question text

What is output if gpa=1.5?

Select one:
a. You made Dean's List !!
b. "Not on Dean's List this time. Keep trying."
c. You're on Academic Probation.
d. "You made Dean's List !!"
e. "You're on Academic Probation."
Feedback

The correct answer is: You're on Academic Probation.

Question 42
Complete
Mark 1.00 out of 1.00

Flag question
Question text

In the given graph identify the cut vertices.

Select one:
a. C and B
b. A and E
c. C and D
d. B and E
Feedback

The correct answer is: C and B

Question 43
Complete
Mark 1.00 out of 1.00
 Flag question
Question text

In Unity, How you can change setting up the outpost model?

Select one:
a. All of the above
b. Under Animations—Split Animations is selected
c. Under Materials—Generation is set to Per Texture
Feedback

The correct answer is: All of the above

Question 44
Complete
Mark 1.00 out of 1.00

Flag question
Question text

In Linked List implementation, a node carries information regarding ___________

Select one:
a. Link
b. Node
c. Data
d. Data and Link
Feedback

The correct answer is: Data and Link

Question 45
Complete
Mark 1.00 out of 1.00
 Flag question
Question text

Which of the following statements for a simple graph is correct?

Select one:
a. Every trail is a path
b. Every trail is a path as well as every path is a trail
c. Path and trail have no relation
d. Every path is a trail
Feedback

The correct answer is: Every path is a trail

Question 46
Complete
Mark 0.00 out of 1.00

Flag question
Question text

Which of the following properties does a simple graph not hold?

Select one:
a. Must be unweighted
b. Must have no multiple edges
c. Must have no loops or multiple edges
d. Must be connected
Feedback

The correct answer is: Must be connected

Question 47
Complete
Mark 0.00 out of 1.00
 Flag question
Question text

A prefab in the assets folder of the project can hold references to:

Select one:
a. Other game objects in the scene in which it is loaded

b. Other prefabs in the project folder

c. Components in itself or in its own children
d. None of the above
Feedback

The correct answer is: Components in itself or in its own children

Question 48
Complete
Mark 0.00 out of 1.00

Flag question
Question text

You are given pointers to first and last nodes of a singly linked list, which of the following
operations are dependent on the length of the linked list?

Select one:
a. Insert a new element as a first element

b. Delete the last element of the list

c. Delete the first element
d. Add a new element at the end of the list
Feedback

The correct answer is: Delete the last element of the list

Question 49
Complete
Mark 0.00 out of 1.00

Flag question
Question text

What is the time complexity of inserting at the end in dynamic arrays?

Select one:

a. O
b. O(1)
c. O(logn)

d. Either O(1) or O
Feedback

The correct answer is: Either O(1) or O

Question 50
Complete
Mark 1.00 out of 1.00

Flag question
Question text

How do you calculate the pointer difference in a memory efficient double linked list?

Select one:
a. pointer to previous node xor pointer to next node
b. pointer to previous node – pointer to next node
c. pointer to next node – pointer to previous node
d. head xor tail
Feedback

The correct answer is: pointer to previous node xor pointer to next node
Finish review
◄ QUIZ 2_PRU221M
Jump to...                                                                                                                  
Jump to...

QUIZ 4_PRU221M ►
Skip <span id="mod_quiz_navblock_title">Quiz navigation</span>
Quiz navigation

QUESTION1THIS PAGEQUESTION2THIS PAGEQUESTION3THIS PAGEQUESTION4THIS

PAGE FLAGGEDQUESTION5THIS PAGEQUESTION6THIS PAGEQUESTION7THIS
PAGEQUESTION8THIS PAGEQUESTION9THIS PAGEQUESTION10THIS PAGEQUESTION11THIS
PAGEQUESTION12THIS PAGEQUESTION13THIS PAGEQUESTION14THIS PAGEQUESTION15THIS
PAGEQUESTION16THIS PAGEQUESTION17THIS PAGEQUESTION18THIS PAGEQUESTION19THIS
PAGEQUESTION20THIS PAGEQUESTION21THIS PAGEQUESTION22THIS PAGEQUESTION23THIS
PAGEQUESTION24THIS PAGEQUESTION25THIS PAGEQUESTION26THIS PAGEQUESTION27THIS
PAGEQUESTION28THIS PAGEQUESTION29THIS PAGEQUESTION30THIS PAGEQUESTION31THIS
PAGEQUESTION32THIS PAGEQUESTION33THIS PAGEQUESTION34THIS PAGEQUESTION35THIS
PAGEQUESTION36THIS PAGEQUESTION37THIS PAGEQUESTION38THIS
PAGE FLAGGEDQUESTION39THIS PAGEQUESTION40THIS PAGEQUESTION41THIS
PAGEQUESTION42THIS PAGEQUESTION43THIS PAGEQUESTION44THIS PAGEQUESTION45THIS
PAGEQUESTION46THIS PAGEQUESTION47THIS PAGEQUESTION48THIS PAGEQUESTION49THIS
PAGEQUESTION50THIS PAGE
Show one page at a timeFinish review

 Contacts

PRU221m ThuyBT26

Participants

Badges

Competencies

Grades

General

8 May - 14 May

15 May - 21 May
22 May - 28 May

29 May - 4 June

5 June - 11 June

12 June - 18 June

19 June - 25 June

26 June - 2 July

3 July - 9 July

10 July - 16 July

Home

Dashboard

Calendar

Private files

My courses

MAS291

MAE101

OSG202 - TuNT57

PRU221m ThuyBT26

PRN221 HuongNTT135

DatTT67 PRN231

PRN211 ChiLP

PRN211, PRN231 Summer 2023 – TienTD17

PRJ301/PRJ302 Summer 2023 - TienTD17

SWD392 - General information for all classes

More...