gs gs121 Types of Lists - Unrolled Linked List - Quiz No.1
gs gs121 Data Structures and Algorithms Quiz
This quiz belongs to book/course code gs gs121 Data Structures and Algorithms of gs organization. We have 169 quizzes available related to the book/course Data Structures and Algorithms. This quiz has a total of 9 multiple choice questions (MCQs) to prepare and belongs to topic Types of Lists. NVAEducation wants its users to help them learn in an easy way. For that purpose, you are free to prepare online MCQs and quizzes.
NVAEducation also facilitates users to contribute in online competitions with other students to make a challenging situation to learn in a creative way. You can create one to one, and group competition on an topic of a book/course code. Also on NVAEducation you can get certifications by passing the online quiz test.
Find an element in node a a.data.delete(element) a.elementNum-- while a.elementNum < a.data.size / 2 put element from a.next.data in a.data a.next.elementNum-- a.elementNum++ if a.next.elementNum < a.next.data.size / 2 _______________________ _______________________
merge nodes a and a.next delete node a.next
delete node a merge nodes a.prev and a.next
a.elementNum-- a.elementNum++
a.next.elementNum-- a.next.elementNum++
#define SIZE N struct node { int node_count; int arr[SIZE]; struct node *next; };
#define SIZE N struct node { int arr[SIZE]; struct node *prev; struct node *top; };
#define SIZE N struct node { int node_count; struct node *next; };
#define SIZE N struct node { int node_count; int arr[SIZE]; };