Use curly braces to define the array, e.g., arr = {1, 2, 3}.

Use square brackets to define the array, e.g., arr = [1, 2, 3].

Use angle brackets to define the array, e.g., arr = <1, 2, 3>.

Declare an array using parentheses, e.g., arr = (1, 2, 3).

A one-dimensional array is always larger than a multi-dimensional array in size.

A one-dimensional array has a single index for access, while a multi-dimensional array uses multiple indices.

A one-dimensional array can only be accessed sequentially, while a multi-dimensional array can be accessed randomly.

A one-dimensional array can only store numbers, while a multi-dimensional array can store any data type.

The purpose of functions in programming is to encapsulate reusable code, improve organization, and enhance readability.

To manage hardware resources

To create user interfaces

To store data permanently in memory

A return value is a variable that stores the function's name.

A return value is an error message generated by a function.

A return value is the output produced by a function after execution.

A return value is the input given to a function before execution.

Reversing the array

Sorting elements

Adding, removing, slicing, concatenating, and searching elements.

Filtering duplicates

Use the push method to add an element to the end of the array.

Use the splice method to remove an element at a specific index.

Use the concat method to merge two arrays together.

Use the slice method to create a copy of the array without the element.

A sorting algorithm is a method for deleting elements from a collection.

A sorting algorithm is a technique for finding the maximum value in a list.

A sorting algorithm is a way to combine elements into a single group.

A sorting algorithm is a method for arranging elements in a specific order.

Quick Sort

Bubble Sort

Merge Sort

Insertion Sort

A searching algorithm is a way to sort data in a structure.

A searching algorithm is a technique for compressing data.

A searching algorithm is a method for finding a specific item in a data structure.

A searching algorithm is a method for deleting items from a data structure.

Function overloading is the process of combining multiple functions into one.

Function overloading refers to changing the name of a function to avoid conflicts.

Function overloading is the ability to define multiple functions with the same name but different parameters.

Function overloading is the ability to define functions with different names for the same operation.

Function overloading improves code readability by allowing the same function name for similar operations, making the code cleaner and easier to understand.

Function overloading makes code less readable by introducing ambiguity.

Function overloading reduces the number of functions needed in a program.

Function overloading complicates code by requiring multiple function names.

It simplifies the process of variable declaration.

It restricts the size of data that can be processed.

It eliminates the need for loops in programming.

It enables efficient data handling and promotes code reusability.

Arrays cannot be passed to functions in any programming language.

You can pass an array to a function by defining the function to accept an array parameter and then passing the array when calling the function.

You must convert the array to a string before passing it to a function.

You can only pass a single value to a function.

Advantages of using arrays include efficient data storage, easy access and manipulation of elements, support for iteration, and improved performance.

Arrays are slower than linked lists for all operations.

Arrays require more memory than other data structures.

Arrays can only store integers.