Learn more about our help with Assignments: Algorithms
Search & Filtering
Algorithms
Suppose you have a quadratic probe hash table of size 13 with the hash function 'k%13'. Insert the keys 19, 42, 55, 12, 29, 16 into the table (in order).
Is this the correct resulting hash table after insertion: [NULL, NULL, 16, 42, 55, NULL, 19, 29, NULL, NULL, NULL, NULL, 12]?
Is this the correct resulting hash table after insertion: [NULL, NULL, 16, 42, 55, NULL, 19, 29, NULL, NULL, NULL, NULL, 12]?
Algorithms
Consider a linear probe hash table of length m = 12 with the hash function: h(key) = key mod m. Click the sequence for inserting keys 20,22,24,26,36,49,50,56,59 such that the resulting content of the hash table is:
36 | 49 | 50 | 26 | 24 | NULL | NULL | NULL | 56 | 20 | 22 | 59
Algorithms
An array of 11 integers is being sorted in ascending order using Quicksort.
Suppose the algorithm has just finished the first pass of partitioning and pivot swapping thus changing the content of the original array into the following array:
[101, 103, 110, 106, 107, 100, 109, 111, 104, 112, 115]
From the resulting array above, determine how many integers could have been the pivot?
Note: elements == pivot are partitioned to the right.
Suppose the algorithm has just finished the first pass of partitioning and pivot swapping thus changing the content of the original array into the following array:
[101, 103, 110, 106, 107, 100, 109, 111, 104, 112, 115]
From the resulting array above, determine how many integers could have been the pivot?
Note: elements == pivot are partitioned to the right.
Algorithms
An array of 10 integers is being sorted in ascending order using Quicksort.
Suppose the algorithm has just finished the first pass of partitioning and pivot swapping thus changing the content of the original array into the following array:
[100, 107, 110, 101, 105, 106, 109, 111, 114, 112]
From the resulting array above, determine how many integers could have been the pivot?
Note: elements == pivot are partitioned to the right.
Suppose the algorithm has just finished the first pass of partitioning and pivot swapping thus changing the content of the original array into the following array:
[100, 107, 110, 101, 105, 106, 109, 111, 114, 112]
From the resulting array above, determine how many integers could have been the pivot?
Note: elements == pivot are partitioned to the right.
Algorithms
Write an Algorithm to check if a student is eligible for sitting in ETE or not. If student’s attendance is <75 and he is having CA<40 he is not allowed to take ETE else, he is allowed. Ask user to enter his attendance and CA marks.
Algorithms
As a renowned Event Organizer, you have been advising your clients to buy soft drinks from vending machines. Your clients can only pay for their purchases by inserting coins into the vending machines. Using pseudo code, outline the algorithm for paying for these purchases. Explain your pseudo code.
Algorithms
Insert {1, 2, 5, 10, 17, 25, 36, 49} into empty hash table with Table Size = 16 using
a. Linear Probing
b. Quadratic Probing
a. Linear Probing
b. Quadratic Probing
Algorithms
1. Insert {1, 2, 5, 10, 17, 25, 36, 49} into empty hash table with Table Size = 16 using
a. Linear Probing
b. Quadratic Probing
a. Linear Probing
b. Quadratic Probing
Algorithms
1. Insert {1, 2, 5, 10, 17, 25, 36, 49} into empty hash table with Table Size = 16 using
a. Linear Probing
b. Quadratic Probing
2. If the nested parenthesis representation of a tree is as follows, (A (B (E, F (J, K ) ), C ( G ( L ) ), D ( H, I ( M ) ) ) ) then
a. what is the graphical representation of the tree?
b. determine the height of the tree
c. what is the degree of the tree?
d. what is the maximum number of nodes at the level 2?
e. what is the maximum number of nodes the tree can hold?
f. Draw the array representation of the tree
g. Give the preorder representation of the tree
3.a. Differentiate between program and algorithm
b.
i. Write the algorithm for searching unsorted linked list
ii. What is the running time of this algorithm (the algorithm in i above)?
c. Explain the following (give examples where necessary):
i. PUSH
ii. QUEUE
iii. TOP
iv. POSTFIX EXPRESSION
a. Linear Probing
b. Quadratic Probing
2. If the nested parenthesis representation of a tree is as follows, (A (B (E, F (J, K ) ), C ( G ( L ) ), D ( H, I ( M ) ) ) ) then
a. what is the graphical representation of the tree?
b. determine the height of the tree
c. what is the degree of the tree?
d. what is the maximum number of nodes at the level 2?
e. what is the maximum number of nodes the tree can hold?
f. Draw the array representation of the tree
g. Give the preorder representation of the tree
3.a. Differentiate between program and algorithm
b.
i. Write the algorithm for searching unsorted linked list
ii. What is the running time of this algorithm (the algorithm in i above)?
c. Explain the following (give examples where necessary):
i. PUSH
ii. QUEUE
iii. TOP
iv. POSTFIX EXPRESSION
Algorithms
a. Using Cohen-Sutherland algorithm,
Let, the rectangular window A (15, 15), B (80, 15), C (80, 60), D (15, 60). Find the region codes, slope, intersection points to clip the line with P1(10,20) and P2(70, 80).
b. Calculate the dot product of a= (22, 2, 7) & b= (12, -9, 11). And Cross Product of c= (4, 0, 3) & d= (3, 1, 7).
Let, the rectangular window A (15, 15), B (80, 15), C (80, 60), D (15, 60). Find the region codes, slope, intersection points to clip the line with P1(10,20) and P2(70, 80).
b. Calculate the dot product of a= (22, 2, 7) & b= (12, -9, 11). And Cross Product of c= (4, 0, 3) & d= (3, 1, 7).
