Module 1: Introduciton to DAA Flashcards

1
Q

_____ is a sequence of n items of the same data type that are stored contiguously in computer memory and made accessible by specifying a value of the array’s index.

A

Arrays

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

_____ is a sequence of zero or more nodes each containing two kinds of information: some data and one or more links called pointers to other nodes of the linked list.

A

Linked List

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

Array or Linked List?
- fixed length
- contiguous memory locations
- direct access
- insert/delete

A

Array

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

Array or Linked List?
- dynamic length
- arbitrary memory locations
- access by following links
- insert/delete

A

Linked List

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

Stacks or Queues?
Insertion/deletion can be done only at the top.

A

Stacks

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

Stacks or Queues?
LIFO/ FILO

A

Stacks

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

Stacks or Queues?
Two operations (push and pop).

A

Stacks

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

Stacks or Queues?
Stack of plates.

A

Stack

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

Stacks or Queues?
A queue of costumers waiting for services.

A

Queues

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

Stacks or Queues?
Insertion/ enqueue from the rear and deletion/ dequeue from the front.

A

Queue

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

Stacks or Queues?
FIFO/ LILO

A

Queue

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

Stacks or Queues?
FIFO/ LILO

A

Queue

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

_____ is a data structure for maintaining a set of elements, each associated with a key/priority, with the following operations: FInd elements with highest priority. deleting element with highest priority, inserting a new element.

A

Priority Queues(implemented using Heap Sort)

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

_____ it is a connected acyclic graph.

A

Trees

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