6 votes 6 votes Given two statements Insertion of an element should be done at the last node of the circular list Deletion of an element should be done at the last node of the circular list Both are true Both are false First is false and second is true None of the above DS isro2017 data-structures linked-list bad-question + – sh!va asked May 7, 2017 • reshown Nov 19, 2017 by Arjun sh!va 10.7k views answer comment Share Follow See all 19 Comments See all 19 19 Comments reply yg92 commented May 7, 2017 reply Follow Share I think ans should be both are false as there is no such start or end node in a circular list. 3 votes 3 votes Arjun commented May 7, 2017 reply Follow Share What is the meaning of second statement? 0 votes 0 votes yg92 commented May 7, 2017 reply Follow Share Sir its mistake in writing. Its 'an' not 'n' 1 votes 1 votes yg92 commented May 7, 2017 reply Follow Share @Arjun Sir you agree both are false? My thought is since in a circular list there is no such as start or end node 0 votes 0 votes Arjun commented May 7, 2017 reply Follow Share yes, you are correct but since it is ISRO exam I have no guarantee for the official key :) 6 votes 6 votes Sanket_ commented May 8, 2017 reply Follow Share In circular linked list a tail pointer is maintained that contains the address of the node before the head node.This pointer is maintained for insertion and deletion without traversing the whole list so insertion can be done at the end of list using tail pointer and deletion can be done at beginning using tail pointer so i think first is true and 2nd is false so none . –1 votes –1 votes ManojK commented May 11, 2017 reply Follow Share @Arjun sir,@Bikram Sir Pls Verify this qus answer given by ISRO is D ? 0 votes 0 votes Bikram commented May 11, 2017 reply Follow Share @ManojK and @Kapil yes B is correct option, Insertion of an element should be done at the last node of the circular list = = True , it can be possible at last node . http://scanftree.com/Data_Structure/insertion-in-circular-linked-list Deletion of an element should be done at the last node of the circular list = = True , it can also be possible at last node http://scanftree.com/Data_Structure/Deletion-in-circular-linked-list now coming to the question it says - should be done , it makes both options false . If they don't mention should be , then both statements are correct as you check from those given links hence option B is only correct among options . 1 votes 1 votes Kapil commented May 11, 2017 reply Follow Share @Bikram Sir, Any such rule does not exists. In queue, we have rules to insert from rear and delete from front. But, not in CLL and moreover, in memory it has no predefined head or tail node. Also, what is the start and end of CLL in context of memory . I think if the question would have been maintaining O(1) complexity, then it makes some sense . Also, options say $$should\ be$$ done . Even, though you are also saying yes D is correct option, both statements are false here Both statements are false here :) 7 votes 7 votes Arjun commented May 11, 2017 reply Follow Share @Kapil They messed up while copying the options :) 2 votes 2 votes Kapil commented May 11, 2017 reply Follow Share @Arjun Sir Now, I'm messed up thinking how many questions am i suppose to object. The mail will be so big with explainations and they will not even bother reading it :) :P 0 votes 0 votes Arjun commented May 11, 2017 reply Follow Share Still it is far better than last year :) only 4 questions this time rt? Last year it was > 10 .. 3 votes 3 votes Bikram commented May 11, 2017 reply Follow Share @kapil Yes here both statements are correct only when they don't mention the word " should be " in question. Just they ask those 2 operations should be done at respective positions make both statements false, Insertion of an element should be done at the last node of the circular list = = True , it can be possible at last node . http://scanftree.com/Data_Structure/insertion-in-circular-linked-list Deletion of an element should be done at the last node of the circular list = = True , it can also be possible at last node http://scanftree.com/Data_Structure/Deletion-in-circular-linked-list That makes B is correct option . 2 votes 2 votes Rupendra Choudhary commented May 24, 2017 reply Follow Share I am not getting the intention behind this question. I doubt if it contain some sense or not. 0 votes 0 votes Bikram commented May 24, 2017 reply Follow Share @Rupendra Yes, options are no sense , not have proper meaning. 0 votes 0 votes Chahat Bahl commented May 25, 2017 reply Follow Share Can anyone number me the questions with wrong answer key from isro. 0 votes 0 votes Bikram commented May 25, 2017 reply Follow Share @chahat bahl There are 3 questions should be challenged , one is digital question - synchronous vs asynchronous which one is faster . With wrong options are given in question itself. second is this question - with wrong option is correct in ISRO key. third is ISRO-2017-53 question in GO https://gateoverflow.in/128485/isro2017-53 thse 3 only as i can remember .. @kapil am i missing something ? 1 votes 1 votes Kapil commented May 25, 2017 reply Follow Share @Bikram Sir, Correct and that semaphore question also. Both B and D are correct. 0 votes 0 votes Chahat Bahl commented May 25, 2017 reply Follow Share Thank you sir @bikram 0 votes 0 votes Please log in or register to add a comment.
5 votes 5 votes I think ans should be (b) pawan kumarln answered May 8, 2017 pawan kumarln comment Share Follow See 1 comment See all 1 1 comment reply sourav123 commented Apr 16, 2022 reply Follow Share how? 0 votes 0 votes Please log in or register to add a comment.
0 votes 0 votes Answer is D There is no such rule in Circular Linked list Heisenberg answered May 11, 2017 Heisenberg comment Share Follow See all 0 reply Please log in or register to add a comment.