4 - 1 ةباج إو¡ةمئسأ¡رتفد ةبلاطل¡...

Info iconThis preview shows pages 1–2. Sign up to view the full content.

View Full Document Right Arrow Icon

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon
This is the end of the preview. Sign up to access the rest of the document.

Unformatted text preview: 1 ةباج إو¡ةمئسأ¡رتفد ةبلاطل¡ مس¡ ....................................................... : يع¢اجل¡ ةبلاطل¡ مقر .................... مس£ل¡ ( ) ¤¡ؤسل¡ ¤و¥¡ يناثل¡ ¦لاثل¡ §ب¡رل¡ عو¢ج¢لإ ةباتك¡£اط¤¢لإ¡ةجردلإ ¡ ةجردل¡ §¨قوتل¡ Question No. 1 Circle the correct answer for each of the following: (5 Marks) 1- Which of the following sorting algorithm is of divide-and-conquer type? a. Bubble sort b. Insertion sort c. Quick sort d. All of above 2- Two main measures for the efficiency of an algorithm are a. Processor and memory b. Complexity and capacity c. Time and space d. Data and space 3- Which of the following case does not exist in complexity theory a. Best case b. Worst case c. Average case d. Null case 4- The complexity of Bubble sort algorithm is a. O(n) b. O(log n) c. O(n2) d. O(n log n) 5- The time factor when determining the efficiency of algorithm is measured by a. Counting microsecond's b. Counting the number of key operations c. Counting the number of statements c....
View Full Document

This note was uploaded on 01/02/2012 for the course COMPUTER 101 taught by Professor Dr.kahan during the Spring '11 term at Akademia Ekonomiczna w Krakowie.

Page1 / 3

4 - 1 ةباج إو¡ةمئسأ¡رتفد ةبلاطل¡...

This preview shows document pages 1 - 2. Sign up to view the full document.

View Full Document Right Arrow Icon
Ask a homework question - tutors are online