preap computer science quiz 11.01- 02 take out a piece of paper and pen. the quiz starts one minute...

17
PreAP Computer Science Quiz 11.01- 02 Take out a piece of paper and PEN . The quiz starts ONE minute after the tardy bell rings. You will have 30 or 45 seconds per

Upload: bonnie-houston

Post on 21-Jan-2016

222 views

Category:

Documents


0 download

TRANSCRIPT

Page 1: PreAP Computer Science Quiz 11.01- 02 Take out a piece of paper and PEN. The quiz starts ONE minute after the tardy bell rings. You will have 30 or 45

PreAP Computer ScienceQuiz 11.01- 02

Take out a piece of paper and PEN.

The quiz starts ONE minute after the tardy bell rings.

You will have 30 or 45 seconds per question.

Page 2: PreAP Computer Science Quiz 11.01- 02 Take out a piece of paper and PEN. The quiz starts ONE minute after the tardy bell rings. You will have 30 or 45

Title the quiz as shown belowThe quiz starts in ONE minute.

Name Period Date

Quiz 11.01-02

1. 8.2. 9.3. 10.4. 11.5. 12.6. 13.7. 14.

EC.

Page 3: PreAP Computer Science Quiz 11.01- 02 Take out a piece of paper and PEN. The quiz starts ONE minute after the tardy bell rings. You will have 30 or 45

Question 01

Which of the following is a primitive data type?

(a) int(b) double(c) char(d) boolean(e) All of the above

Page 4: PreAP Computer Science Quiz 11.01- 02 Take out a piece of paper and PEN. The quiz starts ONE minute after the tardy bell rings. You will have 30 or 45

Question 02

A primitive data type is any data type that can store

(a) one value only.(b) more than one value.(c) numbers only.(d) letters only.

Page 5: PreAP Computer Science Quiz 11.01- 02 Take out a piece of paper and PEN. The quiz starts ONE minute after the tardy bell rings. You will have 30 or 45

Question 03

A data structure is any data type that can store

(a) one value only.(b) more than one value.(c) numbers only.(d) letters only.

Page 6: PreAP Computer Science Quiz 11.01- 02 Take out a piece of paper and PEN. The quiz starts ONE minute after the tardy bell rings. You will have 30 or 45

Question 04

Which is the first historical data structure?

(a) array(b) record(c) stack(d) file

Page 7: PreAP Computer Science Quiz 11.01- 02 Take out a piece of paper and PEN. The quiz starts ONE minute after the tardy bell rings. You will have 30 or 45

Question 05

The language FORTRAN introduced the

(a) array.(b) record.(c) stack.(d) file.

Page 8: PreAP Computer Science Quiz 11.01- 02 Take out a piece of paper and PEN. The quiz starts ONE minute after the tardy bell rings. You will have 30 or 45

Question 06

The language COBOL introduced the

(a) array.(b) record.(c) stack.(d) file.

Page 9: PreAP Computer Science Quiz 11.01- 02 Take out a piece of paper and PEN. The quiz starts ONE minute after the tardy bell rings. You will have 30 or 45

Question 07

An array is a data structure that

(a) stores elements of the same data type. Every element can be accessed directly.

(b) stores elements of the same data type. Elements can only be accessed at one end in a LIFO manner.

(c) stores elements of the same or different data types.

(d) allows transfer between internal and external storage.

Page 10: PreAP Computer Science Quiz 11.01- 02 Take out a piece of paper and PEN. The quiz starts ONE minute after the tardy bell rings. You will have 30 or 45

Question 08

A record is a data structure that

(a) stores elements of the same data type. Every element can be accessed directly.

(b) stores elements of the same data type. Elements can only be accessed at one end in a LIFO manner.

(c) stores elements of the same or different data types.

(d) allows transfer between internal and external storage.

Page 11: PreAP Computer Science Quiz 11.01- 02 Take out a piece of paper and PEN. The quiz starts ONE minute after the tardy bell rings. You will have 30 or 45

Question 09

A file is a data structure that

(a) stores elements of the same data type. Every element can be accessed directly.

(b) stores elements of the same data type. Elements can only be accessed at one end in a LIFO manner.

(c) stores elements of the same or different data types.

(d) allows transfer between internal and external storage.

Page 12: PreAP Computer Science Quiz 11.01- 02 Take out a piece of paper and PEN. The quiz starts ONE minute after the tardy bell rings. You will have 30 or 45

Question 10

A stack is a data structure that

(a) stores elements of the same data type. Every element can be accessed directly.

(b) stores elements of the same data type. Elements can only be accessed at one end in a LIFO manner.

(c) stores elements of the same or different data types.

(d) allows transfer between internal and external storage.

Page 13: PreAP Computer Science Quiz 11.01- 02 Take out a piece of paper and PEN. The quiz starts ONE minute after the tardy bell rings. You will have 30 or 45

Question 11

A one-dimensional array is frequently called a

(a) file.(b) matrix.(c) record.(d) stack.(e) vector.

Page 14: PreAP Computer Science Quiz 11.01- 02 Take out a piece of paper and PEN. The quiz starts ONE minute after the tardy bell rings. You will have 30 or 45

Question 12

A two-dimensional array is frequently called a

(a) file.(b) matrix.(c) record.(d) stack.(e) vector.

Page 15: PreAP Computer Science Quiz 11.01- 02 Take out a piece of paper and PEN. The quiz starts ONE minute after the tardy bell rings. You will have 30 or 45

Question 13

A class is a ______ that can also store methods.

(a) file(b) matrix(c) record(d) stack(e) vector

Page 16: PreAP Computer Science Quiz 11.01- 02 Take out a piece of paper and PEN. The quiz starts ONE minute after the tardy bell rings. You will have 30 or 45

Question 14

Without the _______ data structure, it would be impossible to save anything for later use.

(a) file(b) matrix(c) record(d) stack(e) vector

Page 17: PreAP Computer Science Quiz 11.01- 02 Take out a piece of paper and PEN. The quiz starts ONE minute after the tardy bell rings. You will have 30 or 45

Extra Credit

In the improved data structure definition whatcharacterizes a data structure?

(a) The amount of data stored(b) The type of data stored(c) The order of the data stored(d) The manner in which data is stored and

retrieved