COMP1500 Sample Final exam

Apuntes

COMP1500 Sample Final exam MCQ (12 questions * 1 mark = 12 Marks) 1) Which of the following we use to interact with abstraction? a) Algorithm b) Interface c) Botha a and b d) None 2) Binary search tree is also known as _________________? a) Tree b) Binary tree c) Ordered Binary tree d) None of the above 3) Dijkstra’s shortest path algorithm uses a _____________ data structure a) List b) Array c) Tree d) Graph 4) In recursion, a function calls _______________ a) Other functions b) itself c) Nothing d) Variable 5) How many bits are required to represent the number 1234? a) 10 b) 11 c) 12 d) 13 ..... ..... ..... COMP1500 Sample Final exam Short Answer (5 questions * 8 marks = 40 Marks): 1. i) What is Abstraction? Mention the difference between abstraction and interface (4 marks) ii)What is the difference between Caesar Cipher and public key cryptography? (4 marks) 2. Convert the following Decimal number to the Binary number: 189 (4 marks) Convert the following Binary number to the Hexadecimal number: 101101 (4 marks) COMP1500 Sample Final exam 3. What is the difference between tree, binary tree and binary search tree? (8 marks) 4. Given the Truth Table below with 3 inputs (M, N, O...