CC 12 Finals Flashcards by Lorenz Roel Abonitalla

Q

The solution to the problem of sparsity of data of arrays.

A. Queue
B. Stack
C. Linked List

A

C. Linked List

How well did you know this?

1

Not at all

2

3

4

5

Perfectly

Q

The node that points to the next Node in the Linked List.

A. Node
B. Next
C. Data

A

B. Next

How well did you know this?

1

Not at all

2

3

4

5

Perfectly

Q

The instance variable that contains the value.

A. Data
B. Next
C. Node

A

A. Data

How well did you know this?

1

Not at all

2

3

4

5

Perfectly

Q

The Node that serves as a temporary storage for the Linked List.

A. Data
B. Temp
C. Node

A

B. Temp

How well did you know this?

1

Not at all

2

3

4

5

Perfectly

Q

The argument that tells the position of the Node adjacent to the Node that will be deleted.

A. Data
B. Position
C. Node

A

B. Position

How well did you know this?

1

Not at all

2

3

4

5

Perfectly

Q

The method that deletes a Node in the tail of the Linked List.

A. Push
B. deleteNode
C. insertAfter

A

B. deleteNode

How well did you know this?

1

Not at all

2

3

4

5

Perfectly

Q

The Linked List that only has one pointer to its adjacent Node.

A. Doubly Linked List
B. Circular Linked List
C. Singular Linked List

A

C. Singular Linked List

How well did you know this?

1

Not at all

2

3

4

5

Perfectly

Q

The object that contains the value and pointer.

A. Linked List
B. Node
C. Data

A

C. Data

How well did you know this?

1

Not at all

2

3

4

5

Perfectly

Q

The method that inserts a Node after another Node.

A. Push
B. deleteNode
C. insertAfter

A

C. insertAfter

How well did you know this?

1

Not at all

2

3

4

5

Perfectly

Q

The method that adds a Node in the beginning of the Linked List.

A. Node
B. Data
C. Push

A

C. Push

How well did you know this?

1

Not at all

2

3

4

5

Perfectly

Q

A first-in-first-out (FIFO) structure.

A. Queue
B. Doubly Linked List
C. Tail
D. Head

A

A. Queue

How well did you know this?

1

Not at all

2

3

4

5

Perfectly

Q

Contains an extra pointer, typically called previous pointer, together with next pointer and data which are there in singly linked list.

A. Queue
B. Doubly Linked List
C. Tail
D. Head

A

B. Doubly Linked List

How well did you know this?

1

Not at all

2

3

4

5

Perfectly

Q

A part of the Queue where entries are added.

A. Queue
B. Doubly Linked List
C. Tail
D. Head

A

C. Tail

How well did you know this?

1

Not at all

2

3

4

5

Perfectly

Q

The first Node in a Linked List.

A. Queue
B. Doubly Linked List
C. Tail
D. Head

A

D. Head

How well did you know this?

1

Not at all

2

3

4

5

Perfectly

Q

A part of the Queue where entries are deleted.

A. Queue
B. Doubly Linked List
C. Tail
D. Head

A

D. Head

How well did you know this?

1

Not at all

2

3

4

5

Perfectly

Q

A Linked List method that connects a new Node after the last Node in the Linked List.

A. append()
B. d
C. Node
D. InsertAfter()
E. new_Node

A

A. append()

How well did you know this?

1

Not at all

2

3

4

5

Perfectly

Q

The parameter for the initial value of the variable data in a Linked List.

A. append()
B. d
C. Node
D. InsertAfter()
E. new_Node

Study These Flashcards

A

B. d

Q

The constructor method that makes an instance of a Node.

A. append()
B. d
C. Node
D. InsertAfter()
E. new_Node

Study These Flashcards

A

C. Node()

Q

A linked list method that places a Node after the previous Node.

A. append()
B. d
C. Node
D. InsertAfter()
E. new_Node

Study These Flashcards

A

D. InsertAfter()

Q

The instance of a newly made Node.

A. append()
B. d
C. Node
D. InsertAfter()
E. new_Node

Study These Flashcards

A

E. new_Node

Q

A Linked List Method that discards a Node at a given location.

A. deleteNodeAtGivenPos()
B. del
C. return
D. deleteNode()
E. last

Study These Flashcards

A

A. deleteNodeAtGivenPos()

Q

The Linked List Node to be deleted.

A. deleteNodeAtGivenPos()
B. del
C. return
D. deleteNode()
E. last

Study These Flashcards

A

B. del

Q

The program statement that gives back the flow of the control to the calling method.

A. deleteNodeAtGivenPos()
B. del
C. return
D. deleteNode()
E. last

Study These Flashcards

A

C. return

Q

The Linked List Method that discards a Node.

A. deleteNodeAtGivenPos()
B. del
C. return
D. deleteNode()
E. last

Study These Flashcards

A

D. deleteNode()

The Linked List Method that discards a Node. A. deleteNodeAtGivenPos() B. del C. return D. deleteNode() E. last

D. deleteNode()

The instance of a Node at the last part of the Linked List. A. deleteNodeAtGivenPos() B. del C. return D. deleteNode() E. last

E. last

A last-in-first-out (LIFO) data structure. A. Stack B. head C. Pop Operation D. top E. Push Operation

A. Stack

The name of the top object reference in the case of a Linked List. A. Stack B. head C. Pop Operation D. top E. Push Operation

B. head

One removes the item pointed by the top and adjusts the variable to the point to the new top item. A. Stack B. head C. Pop Operation D. top E. Push Operation

C. Pop Operation

A pointer. A. Stack B. head C. Pop Operation D. top E. Push Operation

D. top

Adds another item before the location pointed to by top, just like putting a tray at the top of the dispenser, and the adjusts the value of top so it now points to the new top item. A. Stack B. head C. Pop Operation D. top E. Push Operation

E. Push Operation

The Node that contains the memory address of another Node. A. pointer B. Node C. prev D. next E. head

A. pointer

The object that contains the data and the pointer in the Linked List. A. pointer B. Node C. prev D. next E. head

B. head

The Node that contains the memory address of the preceding Node. A. pointer B. Node C. prev D. next E. head

C. prev

The Node that contains the memory address of the succeding Node. A. pointer B. Node C. prev D. next E. head

D. next

The instance variable that contains the value of the Node. A. pointer B. Node C. prev D. next E. head

E. head

Specifically deleted from a predefined location (namely, the head) in a Linked List. A. deleteAtHead B. empty C. pop D. peek E. addAtHead

A. deleteAtHead

A method that will tell us if the stack is empty. A. deleteAtHead B. empty C. pop D. peek E. addAtHead

B. empty

Stack operation that deletes from the top. A. deleteAtHead B. empty C. pop D. peek E. addAtHead

C. pop

The method would return the data item at the top of the stack but would not actually delete it. A. deleteAtHead B. empty C. pop D. peek E. addAtHead

D. peek

This Linked List operation is similar to a push Stack Operation. A. deleteAtHead B. empty C. pop D. peek E. addAtHead

E. addAtHead