Self Studies
Self Studies
Self Studies
Self Studies

Computer Scienc...

TIME LEFT -
  • Question 1
    5 / -1

     In which data structure insertion and deletion takes place from different end?

  • Question 2
    5 / -1

    Which of the following is an application of Deque?

  • Question 3
    5 / -1

    Stacks and Queues are example of

  • Question 4
    5 / -1

    Elements “5”, “9”, “2” and “4” are placed in a queue and are deleted one at a time. In what order will they be removed?

  • Question 5
    5 / -1

    Which operations will not be required if you want to implement Queue using Deque?

  • Question 6
    5 / -1

    Consider the below-given queue

    REAR

    102

    78

    21

    95

    16

    15

    17

    FRONT

    How many dequeue operations needed to delete the smallest element from the queue?

  • Question 7
    5 / -1

    Carefully observe the below given queue

    REAR

    22

    57

    96

    68

    19

    15

    28

    FRONT

     

    How many dequeue operations needed to delete the largest element from the queue?

  • Question 8
    5 / -1

    Which method is used to check whether the queue has any element or not?

  • Question 9
    5 / -1

    A queue contains elements A1, A2, A3, A4, and A5. If the stored elements are deleted one by one, what will be the order of the deletion of elements from the queue.

  • Question 10
    5 / -1

    Typical time requirement for operations on queues is:

Submit Test
Self Studies
User
Question Analysis

  • Answered - 0

  • Unanswered - 10

  • 1
  • 2
  • 3
  • 4
  • 5
  • 6
  • 7
  • 8
  • 9
  • 10
Submit Test
Self Studies Get latest Exam Updates
& Study Material Alerts!
No, Thanks
Self Studies
Click on Allow to receive notifications
Allow Notification
Self Studies
Self Studies Self Studies
To enable notifications follow this 2 steps:
  • First Click on Secure Icon Self Studies
  • Second click on the toggle icon
Allow Notification
Get latest Exam Updates & FREE Study Material Alerts!
Self Studies ×
Open Now