Search & Filtering
Specify the characteristics of the following popular WLAN transmission methods: a) 802.11 a b) 802.11 b c) 802.11 g d) 802.11 n e) 802.11 ac
call this function
def test_sqrt():
a = 1
while a < 26:
print('a =', a,'| my_sqrt(a) =',my_sqrt(a),'| math.sqrt(a) =', math.sqrt(a),'| diff =', abs(math.sqrt(a)-my_sqrt(a)))
a = a + 1
return 0
Differentiate between wired networking and wireless networking and critically outline five major advantages and disadvantages of each.
You are going to the Rogers Centre to watch a baseball game. The aroma from
a hot dog cart catches your attention. Hot dogs are $2.50 each. Write a program
that asks you how much change you have in your pocket. If you have enough to
buy a hot output “Grab a hot dog.” In either case, output “Enjoy the game!” Test
your program using the values $2.00 and $3.00.
Student ID Map
you are given a sequence of student names Ni and their ids Di(corresponding to the student at the same index in Ni).
Write a program to print the student name and his ID from Ni and Di in alphabetical order of the name.
Explanation
For Example, if the given student names sequence and IDs sequenceare the following.
Anand,Ramesh,Kiran
ID102, ID101, ID100
Use Prim’s algorithm starting at node A to compute the Minimum Spanning Tree (MST) of the following graph. In particular, write down the edges of the MST in the order in which Prim’s algorithm adds them to the MST. Use the format (node1; node2) to denote an </span>edge.
You are instructed not to write the code. Otherwise you will be awarded 0 marks.
Given the following AVL tree, delete node 3 and rebalance the tree if required. State clearly which rotations you applied to which Nodes. Draw resultant tree after every step.
root=5
root->left =3
root->left->left=2
root->left->left->left=1
root->left->right =4
root->right =8
root->right->left=7
root->right->left->left =6
root->right - >right=10
root->right->right->left=9
root->right->right->right =11
root->right->right->right->right =12
The binary search tree shown below was constructed by inserting a sequence of items into a empty tree.
root=5
root->left=3
root->left->right=4
root->right=9
root->right->left=7
root->right->left->left=6
root->right ->left->right=8
root->right->right=12
root->right->right->right=20
Which of the following input sequences will not produce this binary search tree?
1)5 3 4 9 12 7 8 6 20
2)5 9 3 7 6 8 4 12 20
3)5 9 7 8 6 12 20 3 4
4)5 9 7 3 8 12 6 4 20
5)5 9 3 6 7 8 4 12 20
Verify it by doing rough work below others you will get 0 marks.
1. Write a java program that allows a user to choose the searching or sorting algorithm and request the list of items to search or sort.
2. Compute the running time of the algorithms
3. Determine the time complexity of your algorithm the searching and sorting algorithms.
4. Display the search value or the sorted list to the user.
1. Be innovative and design a user-friendly application
Note: the programming should take the list to search or sort at the running time, not compile time. [You are submitting the java code and the computed running time/time complexity of the algorithms
#340153 on Dec 2023