Testbook Logo
Exams SuperCoaching Test Series Skill Academy
More
English
Hindi

Question

Download Solution PDF

Consider the singly linked list. What is the worst-case time complexity of the best-known algorithm to delete the node a, pointer to this node is q, from the list?

This question was previously asked in
UGC NET Computer Science (Paper 2) Dec 2018 Paper
Attempt Online
View all UGC NET Papers >
  1. O(1)
  2. O(lg n)
  3. O(n)
  4. O(n lg n)

Answer (Detailed Solution Below)

Option 3 : O(n)
Free Tests
View all Free tests >
Free
UGC NET Paper 1: Held on 21st August 2024 Shift 1
8.7 K Users
50 Questions 100 Marks 60 Mins
Start Now

Detailed Solution

Download Solution PDF

Consider a singly linked list:

F1 R.S 3.4.20 Pallavi D1

In this case, node a is at the end of the list. Pointer q is given to this node. In this case, we need to traverse the complete list to delete that node and then rearrange the remaining nodes.

So, in worst case , when there are n elements in the list and element a is at the end. Then it takes O(n) time to delete that node in the worst case.

Download Solution PDF
Latest UGC NET Updates

Last updated on Jun 6, 2025

-> The UGC NET Exam Schedule 2025 for June has been released on its official website.

-> The UGC NET Application Correction Window 2025 is available from 14th May to 15th May 2025.

-> The UGC NET 2025 online application form submission closed on 12th May 2025.

-> The June 2025 Exam will be conducted from 21st June to 30th June 2025

-> The UGC-NET exam takes place for 85 subjects, to determine the eligibility for 'Junior Research Fellowship’ and ‘Assistant Professor’ posts, as well as for PhD. admissions.

-> The exam is conducted bi-annually - in June and December cycles.

-> The exam comprises two papers - Paper I and Paper II. Paper I consists of 50 questions and Paper II consists of 100 questions. 

-> The candidates who are preparing for the exam can check the UGC NET Previous Year Papers and UGC NET Test Series to boost their preparations.

More Singly Linked List Questions

Q1.The time complexity of searching an element in linked list of length n will be:
Q2.Polynomial addition is implemented using _______ data structure.
Q3.Following declaration of an array of struct, assumes size of byte, short, int and long are 1, 2, 3 and 4 respectively. Alignment rule stipulates that n-type field must be located at an address divisible by n. the fields in a struct are not rearranged, padding is used to ensure alignment. All elements of array should be of same size. Struct complx                 Short s                 Byte b                 Long l                 Int i End complx Complx C[10] Assuming C is located at an address divisible by 8, what is the total size of C, in bytes?
Q4.What is the worst case time complexity of inserting n elements into an empty linked list, if the linked list needs to be maintained in sorted order?
Q5.Consider the singly linked list. What is the worst-case time complexity of the best-known algorithm to delete the node a, pointer to this node is q, from the list?
Q6.Consider the C code fragment given below. typedef struct node {int data; node* next;} node; void join (node* m, node* n) {node* p = n; while (p- >next! = NULL) { p = p - > next; } p - > next = m; } Assuming that m and n point to valid NULL-terminated linked lists, invocation of join will
Q7.Which among the following is a unconditional control structure 
Q8.Given two statements (i) Insertion of an element should be done at the last node in a circular list (ii) Deletion of an element should be done at the last node of the circular list

More Linked List Questions

Q1.Which type of linked list stores the address of the header node in the next field of the last node ? 
Q2.Suppose a binary search tree has been constructed from the following sequence of numbers in the order in which they arrive : 6, 2, 10, 1, 5, 7, 11, 3, 9, 4, 8. Consider the following piece of code : Show(root) { if (root !=NULL) { printf(“% d”, root → key); show (root → right); show (root → left); } else return ;  } The sequence printed will be : 
Q3.Which data structure is typically used to implement hash table ? 
Q4.Given below are two statements: one is labelled as Assertion A and the other is labelled as Reason R. Assertion A: It is possible to create doubly linked list using only one pointer with every node. Reason R: By storing the XOR of the addresses of the previous and next nodes. In the light of the above statements, choose the most appropriate answer from the options given below. 
Q5.Consider the problem of reversing a singly linked list. To take an example, given the linked list below, the reversed linked list should look like Which one of the following statements is TRUE about the time complexity of algorithms that solve the above problem in O(1) space?
Q6.Which one of the following is not correct when we define either a class that does not implement either a mathematical entity like a matrix or a complex number or a low level type such as linked list?
Q7.The following functional attempts to merge two sorted linked lists. ListNode is the custom structure representing a node in the linked list. ListNode* Merg(ListNode* pHead1, ListNode* pHead2) { ListNode* pMergedHead = NULL; if (pHead1 ->m_nValue < pHead2 ->m_nValue) { pMergedHead = pHead1; pMergedHead ->m_pNext = Merge (pHead1->m_pNext, pHead2) ; } else if (pHead1 ->m_nValue > pHead2 ->m_nValue) { pMergedHead = pHead2; pMergedHead ->m_pNext = Merge (pHead1, pHead2 ->m_pNext) ; } return pMergedHead; } Assume that the inputs lists are correctly sorted. Which of the following are some of the possible behaviors when the code is executed with well-formed and valid inputs? I. The code snippet can produce a correctly merged linked list. II. The code snippet can lead to a segmentation fault. III. The code snippet can result in an incorrectly merged linked list.
Q8.Consider the following C function executed in an OS with paging where the page size is 4 kilobytes. Further, assume that the system employs a 32-entry direct mapped TLB. int *alloc_and_init() { int counter, value=0, size=2048; int * new_ptr = malloc (size * sizeof (int));   /* Assume sizeof (int) = 4 and new_ptr is 4KB aligned */ for (counter=0; counter < size ; new_ptr++,counter++)   *new_ptr = value; return new_ptr; } Assuming no page faults and no context switches during the execution of the program, what is the number of TLB misses during the execution of the for loop?
Q9.The following C function takes a simply-linked list as input argument. It modifies the list by moving the last element to the front of the list and returns the modified list. Some part of the code is left blank typedef struct node {         int value;         struct node *next; } Node; Node *move_to_front(Node *head) {           Node *p, *q;           if ((head = = NULL: || (head->next = = NULL)) return head;           q = NULL; p = head;           while (p-> next !=NULL) {           q = P;           p = p->next; } /BLANK LINE return head; } Choose the correct alternative to replace the blank line.

More Programming and Data Structure Questions

Q1.What is the output of the following code? int i = 1 ; while ( i <= 10 ) printf ( "%d\n", i );
Q2.Which of the following is the syntax of the conditional operator in C?
Q3.Which of the following is a unary operator in C?
Q4.If a C program contains only one function, it must be __________.
Q5.Which operator is used for bitwise OR in C?
Q6.What is the purpose of the sizeof operator in C?
Q7.Which of the following functions is used to find the length of a string in C?
Q8.The ternary operator can be used as a replacement for which loop/statement?
Q9.What is the limitation of the conditional operator (? :) in C?
Q10.What is a recursive function?
Super Coaching
UGC NET Test Series
UGC NET Previous Year Papers
UGC NET Syllabus
UGC NET Books
Testbook Edu Solutions Pvt. Ltd.
1st & 2nd Floor, Zion Building,
Plot No. 273, Sector 10, Kharghar,
Navi Mumbai - 410210
[email protected]
Toll Free:1800 833 0800
Office Hours: 10 AM to 7 PM (all 7 days)
Company
About usCareers We are hiringTeach Online on TestbookPartnersMediaSitemap
Products
Test SeriesTestbook PassOnline CoursesOnline VideosPracticeBlogRefer & EarnBooks
Our Apps
Follow us on
Copyright © 2014-2022 Testbook Edu Solutions Pvt. Ltd.: All rights reserved
User PolicyTermsPrivacy
Get Free Access Now
Hot Links： teen patti real cash withdrawal teen patti master 2025 teen patti gold apk download teen patti casino download