CS502 Midterm Past Papers by Attiq Kundi

Mid · Quiz by Attiq Kundi · 100 % CORRECT MCSQ · AND Many MoRe · CS-502 · Fall 2011

Q1. Due to left complete nature of binary tree, the heap can be stored in (1 marks)

1. Arrays (Page 40)
2. Structures
3. Link Lis
4. Stack

Correct answer: Arrays (Page 40)

Q1. What type of instructions Random Access Machine (RAM) can execute? (1 marks)

1. Algebraic and logic
2. Geometric and arithmetic
3. Arithmetic and logic (Page 10)
4. Parallel and recursive

Correct answer: Arithmetic and logic (Page 10)

Q1. (1 marks)

1. We do not know the optimum k (Page 86)
2. We use divide and conquer for sorting only
3. We can easily perform it in linear time
4. Size of data is not given

Correct answer: We do not know the optimum k (Page 86)

Q1. What is the total time to heapify? (1 marks)

1. Ο(log n) (Page 43)
2. Ο(n log n)
3. Ο(n2 log n)
4. Ο(log2 n)

Correct answer: Ο(log n) (Page 43)

Q1. word Algorithm comes from the name of the muslim author ____________ (1 marks)

1. Abu Ja’far Mohammad ibn Musa al-Khowarizmi.

Q1. Please choose one al-Khwarizmi‟s (1 marks)

work was written in a book titled _______________

1. al Kitab al-mukhatasar fi hisab al-jabr wa’l-muqabalah

Spring 2010

Q1. Random access machine or RAM is a/an (1 marks)

1. Machine build by Al-Khwarizmi
2. Mechanical machine
3. Electronics machine
4. Mathematical model (Page 10)

Correct answer: Mathematical model (Page 10)

Q2. _______________ is a graphical representation of an algorithm (1 marks)

1.  notation

notation

1. Asymptotic notation

Q3. A RAM is an idealized machine with ______________ random-access memory. (1 marks)

1. 256MB
2. 512MB
3. an infinitely large (Page 10)
4. 100GB

Correct answer: an infinitely large (Page 10)