Q1 Differentiate between a One-dimensional array and multi-dimensional array.

Ans. The main difference between a one-dimensional array and a multi-dimensional array is the
structure and usage of the data they store: Structure A one-dimensional array stores elements in a
single line, while a multi-dimensional array stores elements in a table format. Usage Multi-
dimensional arrays require you to specify an index for each dimension, which affects how you access
and manipulate data. Number of dimensions A one-dimensional array has one dimension, while a
multi-dimensional array has multiple dimensions. Here are some other differences between one-
dimensional and multi-dimensional arrays: Data type All elements in a one-dimensional array share
the same data type. Representation A one-dimensional array represents multiple data items as a list,
while a multidimensional array represents multiple data items as a table. Syntax The syntax for a
one-dimensional array is type variable name [size], while the syntax for a multi-dimensional array is
type variable name[size1][size2]. Size The size of a one-dimensional array is calculated as Total
number of Bytes = size of(datatype of array variable)* size of the array. The size of a multi-
dimensional array is calculated as Total number of Bytes = size of(datatype of the variable of the
array)* the size of the first index * the size of the second index.

Que 2 Explain Enumerated datatypes in brief and give an example.

Ans Enumerated Datatypes (Enum)

An enumerated datatype, more commonly referred to as an enum, is a user-defined data type in

Enums are particularly useful while dealing with a set of related constants, such as days of the week,
months of the year, or states of a process.

Key Features of Enums

1. Improved Readability: Using meaningful names instead of numeric constants.

2. Type Safety: Only predefined values can be used.

3. Integral Type: The values are in the integers form inside, with the default beginning at 0.

Explanation:

- In `enum Days`, the days of the week are declared as constants, beginning with `Monday` where
the value is assigned as `0`.

- `Wednesday` has the value `2`.

Output:

```

It's mid-week!

```

Enums help achieve higher clarity, lesser errors, and commonly used in programs that require a fixed
set of values.

Que3 Define Function in C programming. Explain its purpose in a C program.

Ans. Function in C Programming

A function in C is a block of code designed to perform a specific task. Functions are reusable and
modular components that help to organize and structure a program effectively.

In C, a function consists of:

1. Return Type: Specifies the type of value the function returns. If no value is returned, the
return type is void.

2. Function Name: An identifier for the function.

3. Parameter List (optional): Inputs the function requires, enclosed in parentheses.

4. Body: Contains the code that defines the task.

Purpose of Functions in C Programs

1. Modularity: Divides the program into smaller, manageable blocks, improving readability and
maintainability.

2. Reusability: Code can be reused across the program without duplication.

3. Abstraction: Hides the implementation details, making the program easier to understand.

4. Ease of Debugging: Errors can be traced back to specific functions, simplifying debugging.

5. Code Organization: Groups related tasks, enhancing the logical structure of the program.

6. Reduced Code Length: Avoids repetitive code by centralizing common tasks in functions.
 Types of Functions:

1. Library Functions: Predefined in header files (e.g., printf(), scanf()).

2. User-defined Functions: Created by the programmer for specific tasks (e.g., add() in the
example).

Functions are an essential part of structured programming and make programs efficient,
readable, and modular.

Que4. Describe how parameters are passed to functions including difference between Call
by value and Call by Reference.

Ans Passing Parameters to Functions in C

Parameters can be passed to functions in two primary ways:

1. Call by Value

2. Call by Reference

Call by Value

 Definition:
In call by value, a copy of the actual value is passed to the function. Changes made to the
parameter inside the function do not affect the original variable.

 How It Works:
The function works on a local copy of the variable, and the original data remains unaltered.

 Advantages:

o The original value is safe from unintended modifications.

o Simpler to implement.

 Disadvantages:

o Inefficient for large data structures since copying takes extra time and memory.

Call by Reference

 Definition:
In call by reference, the actual memory address of the variable is passed to the function.
Changes made inside the function directly affect the original variable.

 How It Works:
The function uses pointers to modify the original data.

 Advantages:
 o No additional memory is used to copy values.

o Useful for modifying large data structures directly.

 Disadvantages:

o The original data is at risk of being unintentionally modified.

o Slightly more complex to implement.

Que5 Explain the use of pointers in C. Also explain the pointer arithematic

Ans Pointers in C

Definition:
A pointer is a variable that stores the memory address of another variable. It allows direct
access and manipulation of memory, enabling efficient and flexible programming. Pointers
are essential for dynamic memory allocation, arrays, functions, and data structures.

Use of Pointers in C

1. Accessing Memory Directly:

o Pointers enable direct access to the memory location of variables, allowing low-level
programming.

2. Dynamic Memory Allocation:

o Pointers are used with functions like malloc(), calloc(), and free() to allocate and
deallocate memory dynamically.

3. Efficient Array Manipulation:

o Arrays are closely tied to pointers, and pointer arithmetic makes it easy to traverse
arrays.

4. Passing by Reference:

o Functions can modify the original variables by passing their addresses using pointers.

5. Building Complex Data Structures:

o Pointers are used to create linked lists, trees, and other advanced data structures.

6. Pointers to Functions:

o Enable dynamic function calls and callbacks.

Pointer Arithmetic

Pointer arithmetic involves performing arithmetic operations (like addition and subtraction)
on pointers to traverse memory locations. It works based on the size of the data type the
pointer points to.
 Key Operations in Pointer Arithmetic

1. Increment (ptr++):

o Moves the pointer to the next memory location of the data type.

o Example: If ptr points to an integer, ptr++ moves it forward by 4 bytes (size of int).

2. Decrement (ptr--):

o Moves the pointer to the previous memory location of the data type.

3. Addition (ptr + n):

o Moves the pointer forward by n elements.

4. Subtraction (ptr - n):

o Moves the pointer backward by n elements.

5. Difference (ptr1 - ptr2):

o Calculates the number of elements between two pointers.