Home
N7
Home
About
Blog
Pricing
Contact
Login
Register
Assaf Dagai
Member since
Apr 2021
@assafdag
Questions (8)
Tests (1)
Extended Response
6 Marks
Shared
(a).
Explain why a binary tree is a dynamic data structure
[2]
(b).
Explain why a binary search tree is most suitable for maintaining a list of people’s surnames in such a way as to facilitate faster surname searching.
[2]
(c).
Draw a binary search tree with the following nodes added from left to right: Ohana, Cohen, Greenberg, Lee, Rich, Paul, Zion
[2]
4
Uses
22
Views
0
Likes
Extended Response
15 Marks
Shared
GHIS school is thinking on changing ManageBac to a new application - SchoolForYou to reduce costs.
(a).
Outline 2 possible risks of performing this change?
[2]
(b).
Decribe how can the school can mitigate these risks
[3]
(c).
The SchoolForYou application requires a local deployment, while ManageBac which is a SaaS to deployment. Discuss the advantage and disadvantages of each option for the school.
[5]
(d).
The school is considering two installation alternatives: parrallel running or pilot running. Describe and explain the option you would recommend the school should take.
[5]
5
Uses
23
Views
0
Likes
Short Answer
2 Marks
Shared
I have the following variables declared and initiated: int num1 = 1; int num2 = 2; double ratio = num1 / 2.0; (a). What will be the output of System.out.println(num1/num2); (b). What will be the value of ratio?
[2]
2
Uses
12
Views
0
Likes
Short Answer
2 Marks
Community
Define Distributed consensus
[2]
1
Use
23
Views
1
Like
Short Answer
2 Marks
Shared
Define digital signature
[2]
0
Uses
14
Views
0
Likes
Short Answer
4 Marks
Shared
Explain how the Merkle tree stores transaction data more efficiently than if the data were just held in a list.
[4]
0
Uses
9
Views
1
Like
Short Answer
4 Marks
Shared
Outline each step in the proof of work from proposed block to an addition to the Blockchain.
[4]
0
Uses
18
Views
1
Like
Extended Response
10 Marks
Shared
(a).
Two parallel arrays contain the names and telephone numbers of up to 200 people. Both arrays are of type String and unordered. New names are added to the end of the array. The last valid name in the array is followed by the end-of-data marker "XXXX". | [0] | [1] | [2] | [3] | ... | [65] | [66] | ... |[199] names | "Ally" | "Gioia" | "Alan" | "Jordan" | ... | "Max" | "XXXX" | ... | - phone |"123456" | "654321" | "002233" | "334422" | ... | "554433" | - | ... | - (a) State the number of names stored in the above array. [1 mark] (b) Construct a method, findName() , which takes a String parameter representing the phone number and returns the name of the corresponding person, or "XXXX" if the number is not present. [5 marks] (c) Without constructing an algorithm, outline the steps that should be taken to bubble sort the data in order of name. [5 marks] (d) State two reasons why the telephone numbers are stored as String data and not int values. [2 marks] (e) Describe another data structure that could have been used in place of two parallel arrays. [2 marks]
[10]
2
Uses
30
Views
1
Like