CSD203_Linked Lists Quiz

What is a data structure?

• A programming language

• A way of organizing and storing data

• A method for analyzing data

• A type of computer software

What are the different types of data structures?

• Numbers, Letters, Symbols

• Colors, Shapes, Sizes

• Animals, Plants, Minerals

• Arrays, Linked Lists, Stacks, Queues, Trees, Graphs, etc.

Explain the concept of arrays in data structures.

• Arrays can only store a fixed number of elements

• Arrays are only used to store single data type elements

• Arrays are a data structure that stores a collection of elements, each identified by at least one array index or key.

• Arrays are a type of tree structure used to store data

What is the difference between a stack and a queue?

• In a queue, elements are added and removed from the top, following the Last In First Out (LIFO) principle.

• In a stack, elements are added and removed from the top, following the Last In First Out (LIFO) principle. In a queue, elements are added to the rear and removed from the front, following the First In First Out (FIFO) principle.

• In a stack, elements are added and removed from the front, following the First In First Out (FIFO) principle.

• In a stack, elements are added to the rear and removed from the front, following the First In First Out (FIFO) principle.

How is a linked list different from an array?

• A linked list has a fixed size, while an array does not

• A linked list and an array both require contiguous memory locations

• A linked list does not require contiguous memory locations, while an array does.

• A linked list can only store primitive data types, while an array can store objects

What is a linked list and how is it implemented?

• A linked list is a non-linear data structure implemented using stacks and queues

• A linked list is a type of list that can only store integers

• A linked list is a linear data structure implemented using nodes and pointers.

• A linked list is implemented using a two-dimensional array

Explain the concept of singly linked list.

• A data structure that consists of a sequence of nodes where each node contains a data field and a reference to the next node in the sequence.

• A data structure that consists of a sequence of nodes where each node contains multiple data fields.

• A data structure that consists of a sequence of nodes where each node contains only a data field.

• A data structure that consists of a sequence of nodes where each node contains a data field and a reference to the previous node in the sequence.

What is the difference between singly linked list and doubly linked list?

• Singly linked list has each node pointing to the next node, while doubly linked list has each node pointing to both the next and previous nodes.

• Doubly linked list has each node pointing to the next node only

• Singly linked list has each node pointing to the previous node

• Singly linked list has constant time complexity for insertion and deletion operations

How do you insert an element into a linked list?

• Use an array to store the elements instead

• Delete the last node and replace it with the new element

• Create a new node with the element and adjust the pointers to link the new node into the list.

• Ask the user to manually input the new element into the list

What are the advantages of using a linked list over an array?

• Dynamic size, easy insertion and deletion, no contiguous memory allocation

• Limited size, easy insertion and deletion, non-contiguous memory allocation

• Static size, easy insertion and deletion, contiguous memory allocation

• Fixed size, difficult insertion and deletion, contiguous memory allocation