Question

18.what is an advantage of a sequational allocation

• Memory may be allocated as the need arises
• Garbage collection is not required
• Data structure size need not be known at compile time
• Insertion and deletions are supported

19. How many iterations using a binary search are done until the element is found in an array

arr = {5,6,77,85,99} and key = 85

• 4
• 2
• 1
• 3

20.what does this function do if the pseudocode takes a queue as an argument and uses a stack S to do the processing

• Removed the last from Q
• Makes Q empty
• Reverses Q
• Keep Q the same

21. given the c/c++ code: Which identifier is used to access the newly allocated memory when allocation is successful ?

Char, null, buffer, Buffer_size

22. What is a feature of dictionary data type ?

• Ordered Values
• Immutable Keys
• Ordered Keys
• Immutable values

23. which operation removed a key-value pair from a dictionary?

Rem, len, Cmp, del

Answer 1

18.
Memory may be allocated as the need arises

19.
2

20.
Function not provided

21.
buffer

22.
Immutable Keys

23.
del