Ques #: 27 Assume a singly linked list with head a...
Guiding State PSC aspirants since 2016 50,000+ students · 1,000+ final selections Exam Calendar Results Call 9116926003
pscnotes
Pick your state
RPSC Prelims previous year questions

Ques #: 27 Assume a singly linked list with head and tail pointer (i.e., pointers to the first last nodes in the list). Given that representation, which of the following operations could be implemented in O(1) time? I. Insert item at the front of the list II. Insert item at the rear of the list III. Delete front item from list IV. Delete item from rear of list 1) I and II 2) I and III 3) I, II, and III 4) I, II, and IV

Asked in RPSC 23Feb 2016Question Paper for VicePrincipal/Superintendent ITI Screening Test 2012(Information Technology)VICE PRINCIPAL/SUPDT. ITI - 2012

  1. I and II
  2. I and III
  3. I, II, and III
  4. I, II, and IV
Show answer

Answer: C. I, II, and III

More RPSC Prelims previous year questions questions

All 8,445 RPSC Prelims previous year questions questions →