Rapid Fire Quiz (Doubly Linked List)

Data Structures: Rapid Fire Quiz on Doubly Linked List
Topics discussed:
1) 10 rapid-fire questions based on the Doubly Linked List.

Music:
Axol x Alex Skrindo - You [NCS Release]

#DataStructuresByNeso #DataStructures #DoublyLinkedList #LinkedList

[khondakarmorshedafridi]

I wont lie, this was kinda fun. Completed Data Structure around 4-5 semesters back, it was fun going back! XDD

[anupamabidargaddi]

10/10 and it’s all because of your lecture.. coz I m attending after 15 years gap from my BE.. great lectures..

[shrinivasgadade]

I got 9/10, your teaching style is very comprehensive and fun and your content is also unique, thank you so much 🙏❤️

[tanishajain]

Please upload new videos ASAP! Really don't want to switch to another YT channel after learning from here! :'))

[aditi]

Pls cover trees and graph soon. Exams are coming...🙃😁

[sudiptamaity]

8/10
But i've a confusion on question no 3 and 4

[rohitthakre]

Q.3
temp = head; (it means temp = 1000)
temp = temp->next; (it means temp = 2000)
temp->data = temp->prev->data; (currently temp->data = 45 and temp->prev->data = 34)

it simpy means 45 ->(changed to) 34
so ans should be (b) and yours is (c)




Q.4
temp = head; (temp = 1000)
temp = temp->next; (temp = 2000)
temp->prev->data = temp->data (at 34 = 45)
so it means 34 is changed into 45
if so then ans should be 34 ->45 which is (a) and yours is (d)





if i'm wrong please explain me how, and then i will correct myself.

[kunalsoni]

Really very helpful quiz to understanding better of our self ❤️🔥😊.
Thank you I got 8 marks 😊

[Adityasharma-oezp]

You teach everything so fast....yet so comprehensive....

[manishsemwal]

9/10 ! because the last question took more than 30 seconds. 😅

[akashpatil]

I scored 10 and I guarantee you that I will Score out of marks in DS questions of GATE because of you. pls add remaining topics ASAP. You are great teacher.

[cochungama]

sir i got 10/10 ..just only because of your outstanding lectures and your excellent way to teaching us you sir by heart✌✌😁😁

[harshalkumar]

in second question you didn't mentioned if the pointer to the intermediate node will be given or not hence both option a and b is correct depending on the condition

[kaus]

How is 8th O(n)? If we already have a tail pointer then all we need to do is
tail->prev->next=NULL;
free(tail);

[GAURAVKUMAR-drmq]

The way this channel made data structures easy is incredible good.

[AurghaDas]

I got 8/10. Thank you so much for making this playlist. This was really so helpful :)

[harshalkumar]

the answer of the question n.o is 8 is option a, i am 101% sure

[erwinlambujon]

THANKS BRO!!! I ALREADY YOUR LINKED LIST PLAYLIST SUCH A BIG HELP :)

[kajalmondal]

Sir please make video on memory efficient linked list?

[DSDV]

Can anyone Explain 8th one how it is o(n) if we had a pointer we directly using free (pointer pointing to it);
Pointer pointing to it = NULL;