Question

Data Structure ( PYTHON)

1 - What is the output to the terminal with this Python code

                                Dick = [“white”; 0x000000, “black” ;0xFFFFFF]

                                                   For item in dict;

                                                   Print(item)

2 - Which condition must a linked list implementation of a queue satisfy when the queue is empty

                                Front is empty

                                Rear is empty

                                Front is null

                                Rear is null

               

3 -  Which method is to be used with a list in Python?

                                Append

               

                An array of a Data size 17 is used where the index is an integer in [0, 16] and the hash-function key %17

4 - Where will the data associated with the key 29 be stored

                                In DATA[17] , inDATA[29], InDATA[12], inDATA[11]

       5 - Given the Queue Q [“Cherry”, “orange”, “grape”]

                                After operation Q.enqueue(“apple”), Q.contains[“cherry”,”orange”,”grape”,”apple”]

6 - Which value will be returned when Q. Dequeue is called ?

                                Orange,   apple,    grape,   cherry

7 - What should be counted when measuring the time factor to determine the efficiency of an algorithm

                                The kilobytes of the algorithm

                                The number of statements

                                The amount of microseconds

                                The number of operations

                 

8 -  Which command will delete and return an object at position index in a list ?

                                Set(int index, Object x)

                                Contains(Object x)

                                Remove(int index)

                                Get(int index)

9 - Which command will return the object at position index in the list when the list is not changed?

                               

                                Set(int index, Object x)

                                Contains(Object x)

                                Remove(int index)

                                Get(int index)

Answer 1

1)
white
black
2)  Front is null
3)  Append
4)  InDATA[12]
5)  True
6)  cherry
7)  The number of operations
8)  Remove(int index)
9)  Get(int index)