Testbook Logo
Exams SuperCoaching Test Series Skill Academy
More

Question

Download Solution PDF

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?

This question was previously asked in
ESE Electronics Prelims 2021 Official Paper
Download PDF Attempt Online
View all UPSC IES Papers >
  1. Don't use global data (use members)
  2. Don't use global functions. 
  3. Don't use public data members
  4. Don't use inline functions, except as a significant optimization. 

Answer (Detailed Solution Below)

Option 3 : Don't use public data members
Free Tests
View all Free tests >
Free
ST 1: UPSC ESE (IES) Civil - Building Materials
6.1 K Users
20 Questions 40 Marks 24 Mins
Start Now

Detailed Solution

Download Solution PDF

A linked list consists of a number of nodes in which each node has a next pointer to the following element. The link of the last node in the list is NULL, which indicates the end of the list.

Array occupies continues memory locations. In linked lists, it's not necessary that the nodes created are in a continues memory location so that the possibility of the cache miss is higher.
Download Solution PDF
Latest UPSC IES Updates

Last updated on May 28, 2025

->  UPSC ESE admit card 2025 for the prelims exam has been released. 

-> The UPSC IES Prelims 2025 will be held on 8th June 2025.

-> The selection process includes a Prelims and a Mains Examination, followed by a Personality Test/Interview.

-> Candidates should attempt the UPSC IES mock tests to increase their efficiency. The UPSC IES previous year papers can be downloaded here.

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.
Suggested Test Series
View All >
UPSC ESE (IES) Civil Mock Test Series
116 Total Tests with 1 Free Tests
Start Free Test
UPSC ESE (IES) Prelims Paper 1 Mock Test Series
54 Total Tests with   1 Free Tests
Start Free Test

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?
Important Exams
Super Coaching
Exams
Test Series
Previous Year Papers
Objective Questions
Testbook USA SAT Exam
Testbook USA ACT Exam
US College Admissions Guide
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 master teen patti classic teen patti - 3patti cards game teen patti lucky