Brainscape's Knowledge GenomeTM

Browse over 1 million classes created by top students, professors, publishers, and experts.


See full index

AS-Level Computer Science - Component 1 + 2 > 1.4.2 Data Structures > Flashcards

1.4.2 Data Structures Flashcards

1
Q

Which of the following data structures are ordered?

  • List
  • Record
  • Tuple
  • Array
A

List
Array
Tuple

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
2
Q

Which of the following data structures can store multiple data types?

  • List
  • Record
  • Tuple
  • Array
A

List
Record
Tuple

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
3
Q

Which of the following data structures are immutable (read-only)?

  • List
  • Record
  • Tuple
  • Array
A

Tuple

Contents cannot be modified at run-time

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
4
Q

Which of the following data structures have no predefined scope?

  • List
  • Record
  • Tuple
  • Array
A

List

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
5
Q

Which of the following data structures can store multiple values under one identifier?

  • List
  • Record
  • Tuple
  • Array
A

All of them

List
Record
Tuple
Array

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
6
Q

Which of the following data structures are accessed using an index?

  • List
  • Record
  • Tuple
  • Array
A

List
Tuple
Array

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
7
Q

Which of the following data structures can have multiple dimensions?

  • List
  • Record
  • Tuple
  • Array
A

Array

2D | 3D

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
8
Q

How many pointers are used in a queue?

A

2 - Front and Rear

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
9
Q

How many pointers are used in a stack?

A

1 - Top

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
10
Q

What pointer is impacted when you enqueue an item

A

Rear/Tail - Incremented by one

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
11
Q

What pointer is impacted when you dequeue an item

A

Front/Head - incremented by one

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
12
Q

Which data structure operates on a FIFO basis?

A

Queue

First in first out

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
13
Q

Which data structure operates on a LIFO basis?

A

Stack

Last in first out

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
14
Q

Where might a queue be used?

A

Printer Queue

Keyboard Buffer

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
15
Q

Where might a stack be used?

A

Web Browser History

Undo button in a word processor

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
16
Q

What is the process for pushing an item to a stack?

A
  • If stack is full then report error and stop.
  • Else increment pointer
  • Add data item at position ‘pointer’
17
Q

What type of error could occur if an item is added to a full stack or queue?

A

Overflow Error

18
Q

What type of error could occur if an item is removed from to an empty stack or queue?

A

Underflow Error

19
Q

What is the process for enqueuing an item to a queue?

A
  • If queue is full then report error and stop.
  • If not full then increment tail by 1
  • Add item to tail index
20
Q

What is the process for dequeuing an item from a queue?

A
  • Check if the queue is empty, If it is then output message reporting an error.
  • If it is not empty, then output the element located at the head
  • Increment head by 1
21
Q

What is the process for popping an item from a stack?

A
  • If stack is empty then report error & stop.
  • Else output the data at the top
  • decrement the top pointer.

AS-Level Computer Science - Component 1 + 2 (20 decks)

Brainscape helps you reach your goals faster, through stronger study habits.
© 2024 Bold Learning Solutions. Terms and Conditions