-
Notifications
You must be signed in to change notification settings - Fork 0
/
3.html
55 lines (53 loc) · 1.44 KB
/
3.html
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
<!DOCTYPE html>
<html>
<head>
<title>3rd question</title>
</head>
<body>
<h1>Quiz</h1>
<ol>
<li>Which of the following data structures would be most appropriate for implementing a LIFO (Last In, First Out) data structure?
<ol type="a">
<li>Queue</li>
<li>Stack</li>
<li>Linked List</li>
<li>Tree</li>
</ol>
</li>
<li>Which data structure is typically used to implement a <b>priority queue</b>?
<ol type="a">
<li>Queue</li>
<li>Stack</li>
<li>Heap</li>
<li>Tree</li>
</ol>
</li>
<li>What will be printed when the above C program is executed?
<pre>
#include <stdio.h>
int main() {
int x = 5;
int *ptr = &x;
printf("%d\n", *ptr);
return 0;
}
</pre>
<ol type="a">
<li>5</li>
<li>Error: Invalid syntax</li>
<li>Address of variable x</li>
<li>Garbage value</li>
</ol>
</li>
<li>
what is the formula of carbon dioxide>?
<ol type="a">
<li>co<sub>2</sub></li>
<li>co<sub>3</sub></li>
<li>co<sub>1</sub></li>
<li>none</li>
</ol>
</li>
</ol>
</body>
</html>