Data Structures and Algorithms

1.    Which data structure allows deleting data elements from front and inserting at rear? a. Stacks b. Queues c.   Deques d. Binary search tree 2.    Identify the data structure which allows deletions at both ends of the list but insertion at only one end. a. Input-restricted deque b. Output-restricted deque c.   Priority queues d. None…

1. Two main measures for the efficiency of an algorithm are a. Processor and memory b. Complexity and capacity c. Time and space d. Data and space   2. The time factor when determining the efficiency of algorithm is measured by a. Counting microseconds b. Counting the number of key operations c. Counting the number…

1. The memory address of the first element of an array is called a. floor address b. foundation address c. first address d. base address   2. The memory address of fifth element of an array can be calculated by the formula a. LOC(Array[5]=Base(Array)+w(5-lower bound), where w is the number of words per memory cell…