Data Structures and Algorithms

what is the difference between data structures and abstract data types

• Data structures provide concrete implementation; abstract data types specify abstract behavior.

• Data structures specify abstract behavior; abstract data types provide concrete implementation.

• Both data structures and abstract data types provide concrete implementations.

• There is no difference between data structures and abstract data types.

Fill in the blank: A basic array is a type of ________.

• array

• list

• matrix

• record

Which of the following is an abstract data type?

• Graph

• Queue

• Hash Table

• Linked List

The role of an iterator in data structures is to allow sequential access to the elements of a collection.

• It allows sequential access to elements of a collection.

• It sorts the data in a specific order.

• It provides random access to any element.

• It modifies the structure directly.

Fill in the blank: The big O of accessing an element in a singly linked list is ________.

• O(n)

• O(1)

• O(log n)

• O(n²)

Which operation is more efficient in linked lists compared to arrays?

• Insertion

• Accessing

• Searching

• Traversal

State the difference between singly linked lists and doubly linked lists.

• Singly linked lists have one pointer per node while doubly linked lists have two pointers per node.

• Singly linked lists are circular while doubly linked lists are linear.

• Singly linked lists store data in nodes while doubly linked lists do not store data.

• Singly linked lists use extra memory compared to doubly linked lists.

Fill in the blank: In a stack, the order of operations is ________.

• LIFO (Last In, First Out)

• FIFO (First In, First Out)

• BIFO (Both In, First Out)

• LILO (Last In, Last Out)

What does FIFO stand for in the context of data structures?

• First In, First Out

• Last In, Last Out

• First In, Last Out

• Last In, First Out

Which of the following operations is O(1) in a singly linked list?

• Insertion/Deletion at the beginning

• Searching

• Traversal

• Accessing an element