KAIST 산업및시스템공학과 문일철_ 데이터 구조 및 분석 수업을 참고하여 작성하였습니다

ch_3_6 Quiz 3

Quiz 3

1. ___________ nodes are specialized nodes, and it is corner stone showing the start of a list.
-> Head

2. In queue, __________ operation removes and returns an instance at the front in the queue.
-> Dequeue

3. Like operation in linked list, we can access to data middle of the stack structure.
-> F

4. In queue structure, an item is inserted or removed by First-In-First-Out (FIFO) mechanism.
-> T

5. In a single linked list, a node consists of:
- A variable to hold a reference to its next node
- A variable to hold a reference to its value object
-> T

6. An item is inserted or removed from the stack from one end called the “bottom” of the stack.
-> F

7. A result
['a', 'b', 'f', 'c', 'd', 'e']
To do this, please fill in the blank.


x = ['a', 'b', 'c', 'd', 'e']
idxInsert = 2
valInsert = 'f'

y = list(range(6))
for itr in range(0, idxInsert):
y[itr] = x[itr]

y[idxInsert] = valInsert
for itr in range(idxInsert, len(x)):
y[___] = x[itr]

print(y)
-> itr + 1

8. The function we can use in a Stack is _____ and _____.

With these functions, we can manage the item in the stack.
Please write down the answer as follows: answer1, answer2
-> Push, Pop
</pre>
</body>
</html>