Practice Non-primitive Data Structures (2.2) - Chapter 13: Data Structures

Practise this section

9 questions

Flashcard drill
4 cards from this section. Quick, good the night before a test.
Exercise
6 questions · about 4 min · pass mark 70%. Hints available.
Sign up to start the exercise
Quiz
3 questions · about 2 min · pass mark 70%. Hints available.
Sign up to start the quiz

6 sample questions

Question 1.
What is an array?
Show hintHide hint
Think about how data is organized in memory.
Question 2.
Explain the LIFO principle.
Show hintHide hint
Consider how you would stack plates.
3Question 3.
What principle do stacks operate on?
- LIFO
- FIFO
- LIFO and FIFO
Show hintHide hint
Think of how you remove items from a stack.
4Question 4.
True or False: Arrays can grow in size after initialization.
- True
- False
Show hintHide hint
Consider how data is stored in memory.
Question 5.
Design a data structure that can store names and demonstrate the operations of insertion and deletion.
Show hintHide hint
Think about how arrays work.
Question 6.
Illustrate a real-world scenario where both stack and queue would be useful simultaneously.
Show hintHide hint
How does the order of service and preparation affect outcomes?

5 more questions in this section. Enroll free to practise them all.