Major Data Structures and Algorithm

What is an algorithm?

• A way to store and organize data

• A well-defined computational procedure

• A collection of data values

• An operation used to measure time complexity

What is a data structure?

• A way to store and organize data

• A well-defined computational procedure

• A collection of data values

• An operation used to measure time complexity

Which of the following is NOT a common data structure?

• Array

• Linked List

• Stack

• Database

What is the time complexity of an algorithm?

• The number of operations used by the algorithm

• The size of the input and the use of many structures in a program

• The comparison of integers and different algorithms in a program

• The addition of integers

What is the purpose of algorithm analysis?

• To define and familiarize algorithms

• To measure the time complexity of algorithms

• To store and organize data

• To solve a problem

What is the purpose of big-Θ notation?

• To define and familiarize algorithms

• To measure the time complexity of algorithms

• To store and organize data

• To solve a problem

What is a linked list?`

• A linear collection of data elements

• A data structure consisting of a group of nodes

• A sequence of nodes

• A collection of elements with linear order

Nodes in a linked list contain two things

• Direction and a pointer

• 
  Data and a pointer

• A Pointer and a reference

• A pointer and a node

What advantage does a linked list have over an array?

• Size of the list doesn't need to be mentioned at the beginning of the program

• The linked list doesn't have a size limit

• You can add or remove elements from the middle of the list.

• All of these are true.

A linked list contains a list pointer variable _____that stores the address of the first node of the list.

• Head

• NULL

• NEXT

• LAST