Scribd
Upload
5 views2 pages

Homework Answers

The document outlines a homework assignment with questions related to data structures, time complexity, and efficiency. It includes specific programming tasks that require analyzing the time complexity of various code snippets. The answers provided explain key concepts and calculate the time complexities of the given programs.

Uploaded by

yağmur.
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
5 views2 pages

Homework Answers

The document outlines a homework assignment with questions related to data structures, time complexity, and efficiency. It includes specific programming tasks that require analyzing the time complexity of various code snippets. The answers provided explain key concepts and calculate the time complexities of the given programs.

Uploaded by

yağmur.
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 2

Home Work 1

Begin Time 2025.04.02 End time 2025.04.11

Answer the following questions. You can write your answers in English or Azerbaijani.

1- What is a Data Structure? (0.5 mark)


2- What is the difference between Static and Dynamic data structures? (1 mark)
3- What is time complexity? (0.5 mark)
4- What is efficiency in terms of data structures? (1 mark)
5- What is the Asymptotic Complexity? Please explain it. (0.5 mark)
6- What is the time complexity of the following program? (1.5 mark)

6.A:

void homework_A(int n)
{
int i=0, j=0, k=0, home=1, n = 10000;
for (i= n/2; i<=n; i++)
for (j= 1; j <= n; 2*j)
for (k= 1; k <=n; k++)
home++;
}

6.B:

void homework_B()
{
int a = 0, b = 0, n = 20000, m=20000;
for (i = 0; i < n; i++)
a = a + rand();
for (j = 0; j < m; j++)
b = b + rand();
}

6.C:

void homework_C()
{
int i, j, a = 0, n = 10000;
for (i = 0; i < n; i++)
for (j = n; j > i; j--)
a = a + i + j;
}
1)data structure is a data organization and storage format that is usually chosen for efficient access to data.

2) Static = fixed size, fast access.


Dynamic = flexible size, efficient memory use.

3) Time complexity is a type of computational complexity that describes the time required to execute an algorithm

4) Efficiency – Proper choice of data structure makes the program efficient in terms of space and time.

5) The approximate measure of an algorithm’s time complexity is called Asymptotic Complexity.


6 a) The code has three nested loops:
1. Outer loop: Runs from i = n/2 to n, so it runs about n/2 times → O(n)
2. Middle loop: j starts from 1 and doubles each time (j = 2 * j) until it reaches n → O(log n)
3. Inner loop: Runs from k = 1 to n → O(n)

Since the loops are nested, their complexities are multiplied:

O(n) × O(log n) × O(n) = O(n² log n)

So, the overall time complexity of the program is O(n² log n).

6 b) The program has two separate loops:


1. The first loop: for (i = 0; i < n; i++)
This loop runs n times, so its time complexity is O(n).
2. The second loop: for (j = 0; j < m; j++)
This loop runs m times, so its time complexity is O(m).

Since these loops are independent and run one after the other, we just add the time complexities:

O(n) + O(m) = O(n + m)

So, the total time complexity of the program is O(n + m).

6 c) 1. Outer Loop:
The outer loop runs n times (from i = 0 to i < n).So, the time complexity of the outer loop is O(n).
2. Inner Loop:
For each iteration of the outer loop, the inner loop runs from j = n to j > i. So, when i = 0, the inner loop runs n times.When i = 1, the inner loop runs
n - 1 times.When i = 2, it runs n - 2 times, and so on.The number of times the inner loop runs decreases as i increases.
3. Total Iterations:
The total number of iterations is the sum:
n + (n - 1) + (n - 2) + … + 1
This is the sum of the first n numbers, which equals:
n(n+1)/2
So,This simplifies to O(n²).

So, the time complexity of this code is O(n²).

HOMEWORK PROBLEM
1. Outer Loop (i loop):
The outer loop runs from i = n / 2 to i = n, so it iterates n / 2 times.This is approximately n iterations.Thus, the time complexity of the outer loop is
O(n).
2. Middle Loop (j loop):
The middle loop runs from j = 1 to j <= n, with j being multiplied by 2 each time (j = j * 2).This means j doubles every time (1, 2, 4, 8,
…).Therefore, the loop will run approximately log n times, because the value of j doubles each time until it reaches n.The time complexity of the
middle loop is O(log n).
3. Inner Loop (k loop):
The inner loop runs from k = 1 to k <= n, so it iterates n times.Therefore, the time complexity of the inner loop is O(n).

Total Time Complexity:

O(n) * O(log n) *O(n) = O(n^2 log n)

You might also like