head 120 next 168 next. prev 1000 next Curr Figurel: Linked List Figurel shows a list...

 

Transcribed Image Text:

head 120 next 168 next. prev 1000 next Curr Figurel: Linked List Figurel shows a list of data of linked list. 300 next Null (a) Define a structure and declare structure variables for the implementation of linked list node in C programming. [4 Marks] (b) Illustrate the process of inserting a node with data 480 in the current position. [4 Marks] (c) An array is a random-access data structure, where each element can be accessed directly and in constant time. Queue and stack are considered as limited access data types and two closely related data types for manipulating arbitrarily large collections of objects. Explain the basic operations associated with the data structurers stack and queue. head 120 next 168 next. prev 1000 next Curr Figurel: Linked List Figurel shows a list of data of linked list. 300 next Null (a) Define a structure and declare structure variables for the implementation of linked list node in C programming. [4 Marks] (b) Illustrate the process of inserting a node with data 480 in the current position. [4 Marks] (c) An array is a random-access data structure, where each element can be accessed directly and in constant time. Queue and stack are considered as limited access data types and two closely related data types for manipulating arbitrarily large collections of objects. Explain the basic operations associated with the data structurers stack and queue.