Home Library Explore SAT

Home Library Explore SAT

Programming concepts - A2 Computing Flashcards | StudBud

Explore/Programming concepts - A2 Computing

Programming concepts - A2 Computing

8 terms·StudBud Administration·173 plays

Programming concepts #computing #programming

Flashcards8 cardsFPractice quizPHost liveL

Questions 8

Answers

1
A variable that contains an address is known as ..
dynamic
heap
pointer
global
2
Which of the following is not a true statement about a queue?
A queue needs two pointers - at the front and at the rear.
A queue is also known as a first-in first-out data structure
Queues can reuse empty locations at the beginning of a array
Can be used to store the return address when a sub is called
3
Which of the following is NOT a type of queue?
Linear Queue
Modified Queue
Circular Queue
Priority Queue
4
Traverse the binary tree below using post-order traversal.
17, 20 , 25, 40, 37, 41, 56
30, 20, 17, 25, 41, 37, 56
17, 25, 37, 56, 20, 41, 30
17, 25, 20, 37, 56, 41, 30
5
What causes a stack overflow error?
When popping an item from a full stack
When pushing an item from an empty stack
When popping an item from an empty stack
When pushing an item onto a full stack
6
What would the output be if procedure W is called and passed the literal string ROME?
EMOR
TRUE
MORE
ROME
7
In terms of graphs and trees, what is the definition of a "circuit"?
The number of neighbours a vertex has
A succession of edges that start and end at the same vertex
An object in a graph
A sequence of edges from one vertex to another
8
What is specific to all abstract data types?
A data type formed by combining other data types
Memory used by structure varies at run time
Independent of any programming language
Elements in the structures are always ordered.