A .Write ASCII Codes of first 14 characters of your name”UMAMA NAZEER”without name space. Each letter in one box And consider all characters as upper case (ASCII code for A= 65 and Z=90). If your name is less than 14 characters then consider remaining as zeros. : - Write your answer in the table 0 1 2 3 4 5 6 7 8 9 10 11 12 13
USE PYTHON
A .Write ASCII Codes of first 14 characters of your name”UMAMA NAZEER”without name space. Each letter in one box
And consider all characters as upper case (ASCII code for A= 65 and Z=90). If your name is less than
14 characters then consider remaining as zeros. :
- Write your answer in the table
|
0 |
1 |
2 |
3 |
4 |
5 |
6 |
7 |
8 |
9 |
10 |
11 |
12 |
13 |
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
def Sort(A): for i in range(len(A)): idx = i for j in range(i+1, len(A)): if A[idx] < A[j]: idx = j A[i], A[idx] = A[idx], A[i]
|
B.Perform first five iterations of the following sorting
Write your answer in the table
|
0 |
1 |
2 |
3 |
4 |
5 |
6 |
7 |
8 |
9 |
10 |
11 |
12 |
13 |
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
0 |
1 |
2 |
3 |
4 |
5 |
6 |
7 |
8 |
9 |
10 |
11 |
12 |
13 |
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
0 |
1 |
2 |
3 |
4 |
5 |
6 |
7 |
8 |
9 |
10 |
11 |
12 |
13 |
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
0 |
1 |
2 |
3 |
4 |
5 |
6 |
7 |
8 |
9 |
10 |
11 |
12 |
13 |
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
C.consider above ASCII code based array/list, whose initial state in memory is 289 and each ASCII code is occupied thrice times. You are required to get memory address of [11].Mention all the steps of calculation and data gathering.
D.Calculate Big O notation on above algorithm with clear calculation steps .
Trending now
This is a popular solution!
Step by step
Solved in 4 steps with 3 images
