Scribd
Upload
45 views

1-Flowchart For An Algorithm Is Given As Follows:: CE 242 Data Structures and Algorithms - Midterm Exam II Solutions

The document contains solutions to exam questions about algorithms and data structures. It analyzes an algorithm to find the binary representation of a number by repeatedly dividing the number by 2. It determines the time complexity of the algorithm is O(log k). It also provides a flowchart and analysis of an algorithm to find repeating numbers in an array and their counts. Finally, it describes how to delete and insert elements in a linked list represented by arrays.

Uploaded by

Biang Rusuh
Copyright
© Attribution Non-Commercial (BY-NC)
Available Formats
Download as PDF, TXT or read online on Scribd
45 views

1-Flowchart For An Algorithm Is Given As Follows:: CE 242 Data Structures and Algorithms - Midterm Exam II Solutions

The document contains solutions to exam questions about algorithms and data structures. It analyzes an algorithm to find the binary representation of a number by repeatedly dividing the number by 2. It determines the time complexity of the algorithm is O(log k). It also provides a flowchart and analysis of an algorithm to find repeating numbers in an array and their counts. Finally, it describes how to delete and insert elements in a linked list represented by arrays.

Uploaded by

Biang Rusuh
Copyright
© Attribution Non-Commercial (BY-NC)
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 4

CE 242 Data Structures and Algorithms - Midterm Exam II Solutions

1- Flowchart for an algorithm is given as follows:

a(25p)- Analyze the algorithm for k=25. You should show the value of all variables in
each step of the algorithm.

k=25, I=0
Step1: k<>0 so B[0]=25 mod 2= 1
k=25/2=12, I=0+1=1
Step2: k<>0 so B[1]=12 mod 2= 0
k=12/2=6, I=2
Step3: k<>0 so B[2]=6 mod 2= 0
k=6/2=3, I=3
Step4: k<>0 so B[3]=3 mod 2=1
k=3/2=1, I=4
Step5: k<>0 so B[4]=1 mod 2=1
k=1/2=0, I=5, then the program exits from the while loop since k becomes zero.
I=I-1=4
N=I-1=4
Enter the for loop:
J=0, A[0]=B[4]=1, I=3
J=1, A[1]=B[3]=1, I=2
J=2, A[2]=B[2]=0, I=1
J=3, A[3]=B[1]=0, I=0
J=4, A[4]=B[0]=1, I=-1

Print A=1, 1, 0, 0, 1

b(10p)- What the program does ?

The program finds the binary representation of the number ‘k’

k=25 can be written as k = 25 = 1 * 24 + 1 * 23 + 0 * 22 + 0 * 21 + 1 * 20 , hence the binary


representation of k=25 is 11001
c(10p)- Determine the time formula for the algorithm and convert this time formula to
the best possible big-O notation. (Explain properly or you will not get any points !)

Within the while loop, each time the number k divided by 2 until k becomes 0. So the
number of the operations ( I ) depend on the number k,

If k=2 the program will enter the loop only twice:


k=2/2=1, I=1
k=1/2=0, I=2, then the program exits from the while loop since k becomes zero.
We can calculate the number of operations as I = (log 2 k ) + 1 = (log 2 2) + 1 = 2

If k=16 the program will enter the loop 5 times:


k=16/2=8, I=1
k=8/2=4, I=2
k=4/2=2, I=3
k=2/2=1, I=4
k=1/2=0, I=5, then the program exits from the while loop since k becomes zero.
We can calculate the number of operations as I = (log 2 k ) + 1 = (log 2 16) + 1 = 5

for k=25 the program will enter the loop 5 times. k=25 is not a power of 2 but
24 < k = 25 > 25 so the number of operations is equal to 5.

So in general we can conclude that the program enters the while loop I = (log 2 k ) + 1
times, which is the number of comparisons (k< >0). The number of comparisons also
represents the complexity of the algorithm.

I = (log 2 k ) + 1 is the time formula.

To convert this formula we need to eliminate any constants:


log10 k
According to the rule of changing bases: (log 2 k ) =
log10 2
1
log10 2 = 0.301 and = 3.321 which is an constant number.
log10 2

Then I = (log 2 k ) + 1 = 3.321(log10 k ) + 1

Ignoring the constants, 3.321 and 1, the big-O notation will be: log k

The program also enters the “for” loop I − 1 = log 2 k times. This will not change big-
O notation.

2(25p)- For a given integer array, you are required to determine the items that repeats
itself in the next address, determine the number of repeats and for the repeating
number. Draw a flowchart diagram for the algorithm and analyze for A=1,2,3,3,2,2,5

Example: If the input is the following array A,

1 3 7 4 4 4 7 1 1 1 1 3

The output of the program should be two separate arrays called Numbers and Repeats:
Numbers=4,1 (repeating numbers are 4 and 1)
Repeats=3,4 (they repeat 3 and 4 times respectively)
If we analyze the algorithm for A=1,2,3,3,2,2,5 :

First we create an array called Repeats and fill the array with 1.

T = 0, K = 0

I=0 A[0] = A[1] Æ False


T=K=0

I=1 A[1] = A[2] Æ False


T=K=0

I=2 A[2] = A[3] Æ True


Numbers[T ] = A[I] Æ Numbers[0] = A[2] = 3
K=T+1=1
Re peats[0] = Re peats[0] + 1 = 2

I=3 A[3] = A[4] Æ False


T=K=1

I=4 A[4] = A[5] Æ True


Numbers[T ] = A[I] Æ Numbers[1] = A[4] = 2
K=T+1=2
Re peats[0] = Re peats[0] + 1 = 2

I=5 A[5] = A[6] Æ False


T=K=2

The resulting arrays are: Numbers=3,2 and Repeats=2,2


3- For a linked list based on an array, the array A containing the elements of the list
and the array P containing the links are given as follows:

A= {null, 23, 42, 32, 49, 44, 18, null}


P= {4, 6, 3, 1, 5, 2, -1, null}

a(15p)- Write the array A and array P after deleting ‘23’ from the linked list.

b(15p)- Write the array A and array P after inserting an element valued ‘35’ into the
proper place in the original linked list (before deleting 23).

X 4 49 5 44 2 42 3 32 1 23 6 18 -1

The original arrays are as follows:

0 1 2 3 4 5 6 7
A null 23 42 32 49 44 18 null
P 4 6 3 1 5 2 -1 null

a- Deleting ‘23’ only requires ‘32’ to point to ‘18’ instead of ‘23’;

0 1 2 3 4 5 6 7
A null 23 42 32 49 44 18 null
P 4 -1 3 6 5 2 -1 null

Also you can arrange ‘23’ to point to nothing (actually you do not have to worry
about what 23 points to – since none of the other items points to ‘23’ you will not
reach ‘23’ anymore). Trying to remove ‘23’ from array A would be a mistake, after all
why do we use linked lists?

b- Inserting ‘35’ requires ‘42’ to point to ‘35’ instead of ‘32’, also now ‘35’ should
point to ‘32’;

0 1 2 3 4 5 6 7
A null 23 42 32 49 44 18 35
P 4 6 7 1 5 2 -1 3

You also do not need to worry where to place the new number ‘35’ in array A, you
should place it at the end to avoid any unnecessary operations. You should only
organize the links in array P.

You might also like