Python Institute PCEP-30-02 PCEP – Certified Entry-Level Python Programmer Online Training
Python Institute PCEP-30-02 Online Training
The questions for PCEP-30-02 were last updated at Apr 29,2025.
- Exam Code: PCEP-30-02
- Exam Name: PCEP – Certified Entry-Level Python Programmer
- Certification Provider: Python Institute
- Latest update: Apr 29,2025
A data structure described as LIFO is actually a:
- A . stack
- B . tree
- C . list
- D . heap
How would you remove all the items from the d dictionary?
Expected output:
Code:
- A . d.del()
- B . d.remove()
- C . del d
- D . d.clear()
What is the expected output of the following code?
- A . three
- B . (‘one’, ‘two’, ‘three’)
- C . two
- D . one
Which one of the lines should you put in the snippet below to match the expected output?
Expected output:
Code:
- A . reverse(list)
- B . list.reversed()
- C . list.reverse()
- D . reversed(list)
What is the expected output of the following code?
- A . [‘1’, ‘2’, ‘3’, ‘4’]
- B . (1, 2, 3, 4)
- C . (‘1’, ‘2’, ‘3’, ‘4’)
- D . The code is erroneous.
What is the expected output of the following code?
- A . (2)
- B . (2,)
- C . 2
- D . The code is erroneous.
An alternative name for a data structure called a stack is:
- A . LIFO
- B . FIFO
- C . FOLO