Question: 2. Explain with examples the use of Hashing function in cryptographs. (5 marks) 3. (5 marks) a) Explain about the computer representation of sets. b)

2. Explain with examples the use of Hashing function in cryptographs. (5 marks) 3. (5 marks) a) Explain about the computer representation of sets. b) Suppose that the universal set is U- 1,2,3, 4, 5, 6, 7, 8, 9, 10. Find the set specified by each of these bit strings. 111001111 0101111000 ) 1000000001
Step by Step Solution
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
