[go: up one dir, main page]

0% found this document useful (0 votes)
40 views10 pages

Computer Multiple Choice Questions

This document contains 20 multiple choice questions on basic computer concepts. It covers topics such as computer components, IP addresses, programming languages, loops, and sorting algorithms. The document also includes general knowledge questions about key personalities and technologies in computing.
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
0% found this document useful (0 votes)
40 views10 pages

Computer Multiple Choice Questions

This document contains 20 multiple choice questions on basic computer concepts. It covers topics such as computer components, IP addresses, programming languages, loops, and sorting algorithms. The document also includes general knowledge questions about key personalities and technologies in computing.
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 10

Computer science

Part 1: Generalities

1. Question: Which one or which of these components are not absolutely


necessary for the proper functioning of a computer?
Please choose the correct answer(s). Respond on a separate answer sheet.
A. The processor.
B. The screen.
C. Memory (alive or dead).
D. The keyboard.

2. Question: Which of these IPv4 addresses are valid?


Please choose the correct answer(s). Respond on a separate answer sheet.
A. 55.103.256.178
B. 8.8.8.8
C. 32.140.238.200
D. 124.52.9.251.1

3. Question: Which (or which ones) of these languages generally require


the use of a compiler to be able to run on a computer?
Please choose the correct answer(s). Respond on a separate answer sheet.
A. C++
B. HTML
C. PHP
D. SQL

4. Question: Which (or which ones) of these protocols do not use measurements?
cryptographic (encryption or signature) for security purposes?
Please choose the correct answer(s). Respond on a separate answer sheet.
A. HTTP
B. HTTPS
C. Telnet
D. DNSSec

5. Question: Which (or which ones) of these loops produce a loop?


infinite?
Please choose the correct answer(s). Respond on a separate answer sheet.
A. For i going from 1 to 1015by step of 1
B. As long as NOT(NOT(FALSE))
C. As long as NOT( TRUE OR FALSE ) AND FALSE
D. Do […] as long as NOT(TRUEFALSE)

1
6. Question: How is the number 137 written in hexadecimal notation (base 16)?
Please choose the correct answer(s). Answer on a separate answer sheet.
A. 0xAB
B. 0x89
C. 0x7F
D. 0x8A

7. Question: Which (or which) of these languages use the paradigm of the
object-oriented programming (OOP)?
Please choose the correct answer(s). Respond on a separate answer sheet.
A. Java
B. C++
C. C
D. PHP

8. Question: In C language, what syntax corresponds to the algorithmic code `While


Is var1 less than var2?
Please choose the correct answer(s). Respond on a separate answer sheet.
A. while(var1 << var2)
B. while(var2 < var1)
C. while(var2 > var1)
D. while(var1 << var2)

9. Question: Let this logical expression where a, b, c are variables


boolean (which can take the values TRUE or FALSE): "NOT(NOT(a OR b
OR c) AND b) OR (c AND b).
Which one or which ones of the proposals below are equivalent to this?
expression ?
Please choose the correct answer(s). Respond on a separate answer sheet.
A. (a AND b AND c) OR (c AND b)
B. NOT(NOT(a) AND NOT(b) AND NOT(c) AND a) OR (c AND b)
C. TRUE
D. FALSE

10. Question: Which (or which) of these quantities of data


corresponds to 1 MiB (also noted as 1 Mio in French)?
Please choose the correct answer(s). Respond on a separate answer sheet.
A. 210KiB (210What in French)
B. 106octets
C. 1,000 kB (1,000 KB in French)
D. 8,000,388,608 bits

1
Part 2: Case Study

In this section, we propose to analyze two algorithms - given below - that


manipulating arrays of integers.

An array is a finite sequence of values (which are ordered) that can be


manipulated by an algorithm. In order to access the elements contained in the
tables, we will use an index between 0 and the size of the table minus 1. Thus, for
to access the 5th element of the array T, we will note T[4] (the index here is 4).

You can also access the size of the array using a size(...) function which
returns the number of elements in the given array.

Example:
Let the array of integers be t = [1; 4; 6; 42; 666].
The function size(t) returns the value 5 (the array contains 5 elements).
One can access the different elements held using indices.
Here: t[0] = 1, t[1] = 4, t[2] = 6, t[3] = 42, t[4] = 666.

Let's finally introduce one last notation: the 'swap' (or 'exchange' in French). This
involves swapping two elements of the array. The first element takes the place of the
second and vice versa. We note this operation:
T[a] T[b] (where T is an array, and where a and b are the indices of the elements to be exchanged).

Example:
Consider the array of integers t = [1; 4; 6; 42; 666].
We execute this instruction: t[2] ← 20 (that is, t[2] takes the value 20).
We execute this instruction: t[4]t[2].
We now have t = [1 ; 4 ; 666 ; 42 ; 20].

1
11. Question: Which of these statements is true?
Please choose the correct answer(s). Respond on a separate answer sheet.
A. Only algorithm 1 is likely to never stop (it can enter a
infinite loop) for certain values of the array t.
B. Only algorithm 2 may never stop (it can get into a
infinite loop) for certain values of the array t.
C. The two algorithms are likely to never stop (they can enter
in an infinite loop) for certain values of the array t.
D. Both algorithms always terminate (they always end up returning
a result), regardless of the value of the array t.

1
12. Question: Is the algorithm algo1 idempotent?

In other words: is it true for all the values in the array t,


algo1(algo1(t)) = algo1(t) ? Or said differently: does applying
several times the algorithm algo1 on an array will always give the same result
result that if we had only applied it once?
Please choose the correct answer(s). Respond on a separate answer sheet.
A. Yes.
B. No.

13. Question: Is it true for all the values in the array t:


algo1(t) = algo2(t) ?

In other words: is it for the same table t, given as input


the algorithm algo1 and the algorithm algo2, the arrays returned by these two
Will the algorithms always be the same?
Please choose the correct answer(s). Respond on a separate answer sheet.
A. Yes.
B. No.

14. Question: We execute the algorithm algo2 with the input:


t = [12 ; 42 ; 1 ; 5 ; 8 ; 6 ; 7 ; 21 ; 36 ; 85 ; 96].
What is the result?
Please choose the correct answer(s). Respond on a separate answer sheet.
A. [21 ; 42 ; 5 ; 1 ; 96 ; 6 ; 7 ; 36 ; 8 ; 12 ; 85]
B. [1 ; 5 ; 6 ; 7 ; 8 ; 12 ; 21 ; 36 ; 42 ; 85 ; 96]
C. [96 ; 85 ; 42 ; 36 ; 21 ; 12 ; 8 ; 7 ; 6 ; 5 ; 1]
D. [12 ; 5 ; 6 ; 7 ; 8 ; 1 ; 21 ; 36 ; 42 ; 96 ; 85]

15. Question: Which of the two algorithms is more time-efficient on the


table
t = [1 ; 2 ; 3 ; 4 ; 5 ; 6 ; 7 ; 8 ; 9 ; 10] ?
In other words, by executing algo1 and algo2 on the table above, which one
will perform the fewest operations ("will be the fastest")?
Please choose the correct answer(s). Respond on a separate answer sheet.
A. The algorithm algo1.
B. The algorithm algo2.

1
Part 3: General Computer Knowledge

16. Question: Which computer scientist invented an abstract machine capable


to execute algorithms (using an infinite tape) which is still used from
our days in theoretical computer science?
Please choose the correct answer(s). Respond on a separate answer sheet.
A. Dennis Ritchie
B. Linus Torvalds
C. Alan Turing
D. Claude Shannon

17. Question: Among these network protocols, which one operates at the lowest level?
of abstraction?
Please choose the correct answer(s). Respond on a separate answer sheet.
A. HTTP
B. SSH
C. DHCP
D. TCP

18. Question: What does AES stand for?


Please choose the correct answer(s). Respond on a separate answer sheet.
A pathfinding algorithm.
B. A high-level network protocol
C. An algorithm for the fast evaluation of univariate polynomials
D. A cryptographic algorithm

19. Question: Among these operating systems, which one or ones are
GNU/Linux distributions?
Please choose the correct answer(s). Respond on a separate answer sheet.
A. Ubuntu
B. Debian
C. FreeBSD
D. SteamOS

20. Question: In March 2016, the artificial intelligence AlphaGo (developed by


Google DeepMind managed the feat of winning without handicap for the first time.
once a human professional champion in the game of Go. Among these technologies,
which was used to achieve this feat?
Please choose the correct answer(s). Respond on a separate answer sheet.
A. About genetic algorithms
B. Artificial neural networks
C. Bubble sort function

1
CORRECTION
Part 1: Generalities

1. Question: Which of these components is or are not absolutely


necessary for the proper functioning of a computer?
response
(B) The screen.
The keyboard.

2. Question: Which of these IPv4 addresses are valid?


ANSWERS :
8.8.8.8
(C) 32.140.238.200

3. Question: Which of these languages generally require


the use of a compiler to be able to be executed on a computer?
(A) C++

4. Question: Which (or which) of these protocols do(es) not use measurements?
cryptographic (encryption or signature) for security purposes?
response
HTTP
(C) Telnet

5. Question: Which (or which ones) of these loops produce a loop?


infinite?
(D) Do […] as long as NOT(TRUEFALSE)

6. Question: How is the number 137 written in hexadecimal notation?


(B) 0x89

7. Question: Which of these languages use the paradigm of the


object-oriented programming (OOP)?
responses
Java
(B) C++
(D) PHP

8. Question: In C language, what syntax corresponds to the algorithmic code 'While'


is var1 less than var2?
(C) while(var2 > var1)
9. Question: Let this logical expression where a, b, c are variables
boolean (can take the values TRUE or FALSE): "NOT(NOT(a OR b
OR c) AND b) OR (c AND b).
Which one or which ones of the propositions below are equivalent to this?
expression ?
ANSWERS :
(B) NOT(NOT(a) AND NOT(b) AND NOT(c) AND a) OR (c AND b)
(C)TRUE

10. Question: Which of these data quantities corresponds to 1


MiB (also noted as 1 Mio in French)?
ANSWERS:
210KiB (210What in French
(D) 8,000,388,608 bits

11. Question: Which of these statements is true?


(D) Both algorithms always finish (they always end up)
return a result), regardless of the value of the array t.

12. Question: Is the algorithm algo1 idempotent?


Yes

13. Question: Is it true that for all values of the array t: algo1(t) = algo2(t) ?
A) Yes

14. Question: We execute the algorithm algo2 with the input: t = [12 ; 42 ; 1 ; 5 ; 8 ; 6 ;
7; 21; 36; 85; 96]. What is the result?
RÉPONSE : (B) [1 ; 5; 6; 7 ; 8 ; 12 ; 21; 36; 42 ; 85; 96]

15. Question: Which of the two algorithms is more time-efficient on the


array: t = [1; 2; 3; 4; 5; 6; 7; 8; 9; 10] ?
(A) The algorithm algo1.

16. Question: Which computer scientist invented an abstract machine capable


to execute algorithms (using an infinite tape) that is still used from
our days in theoretical computer science?
C) Alan Turing

17. Question: Among these network protocols, which one operates at the lowest level?
of abstraction?
(D) TCP

18. Question: What does AES correspond to?

1
(D) An encryption algorithm.

19. Question: Among these operating systems, which one or ones are
distributions GNU/Linux ?
ANSWERS :
Ubuntu
(B) Debian
SteamOS

20. Question: In March 2016, the artificial intelligence AlphaGo (developed by


Google DeepMind has achieved the feat of winning without handicap and for the first time
a champion human professional in the game of Go. Among these technologies,
which was used to achieve this feat?
(B) Artificial neural networks

You might also like