Understanding Data Structures

What is a data structure?

• A way to store and organize data

• A type of programming language

• A method for data analysis

• A hardware component

What are the two main classifications of data structures?

• Primitive and Non-Primitive

• Static and Dynamic

• Linear and Non-Linear

• Array and Linked List

What are examples of primitive data structures?

• Integer, Float, Character, Boolean

• Array, Stack, Queue

• Tree, Graph

• Linked List, Hash Table

What is a linear data structure?

• Data elements are arranged sequentially

• Data elements are arranged randomly

• Data elements are stored in a tree format

• Data elements are stored in a graph format

What is the main characteristic of a stack?

• Follows LIFO order

• Follows FIFO order

• Allows random access

• Is a type of tree

What does the push operation do in a stack?

• Inserts an element into the stack

• Removes an element from the stack

• Returns the top element of the stack

• Checks if the stack is empty

What is the time complexity of the push operation in a stack implemented using an array?

• O(1)

• O(n)

• O(log n)

• O(n^2)

What is the main advantage of using a linked list for stack implementation?

• Dynamic memory allocation

• Faster access times

• Easier to implement

• Less memory usage

What is the infix notation in arithmetic expressions?

• Operators are placed between operands

• Operators are placed before operands

• Operators are placed after operands

• Operators are not used

What is the prefix notation?

• The operator is placed before the operands.

• The operator is placed between the operands.

• The operator is placed after the operands.

• None of the above.