(CIS110 -Cmptr Prgrmmng Dsgn) Final Exam

# (CIS110 -Cmptr Prgrmmng Dsgn) Final Exam - Date Taken:...

This preview shows pages 1–4. Sign up to view the full content.

Date Taken: 3/23/2008 11:22:47 AM Time Spent: 1:34:14 (2:00 allowed) Points Received: 200 / 200 (100%) 1 Processing a large number of items in a(n) ________ is usually easier than processing a large number of items stored in s Constant Variable Array CORRECT Loop * Points Received: 4 of 4 2 What is the term used for the number inside the bracket that specifies the number of values that an array can hold? Sixe Size declarator CORRECT Number Number declarator * Points Received: 4 of 4 3 Access to the individual elements in an array is by using their _____________. Size Number Integer Subscript CORRECT * Points Received: 4 of 4 4 Which is the simplest search technique to find an item in an array? Sequential CORRECT Binary Bubble Select * Points Received: 4 of 4 5 ________________ arrays are two or more arrays that hold related data, and the elements are accessed using a common Sequential Binary Parallel CORRECT Linear * Points Received: 4 of 4 6 How many subscripts do you need to access one element in a two-dimensional array? One Two CORRECT Three Four

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

View Full Document
C F CORRECT * Points Received: 4 of 4 11 Which sorting algorithm moves elements to their final sorted position in the array? Bubble

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

View Full Document
This is the end of the preview. Sign up to access the rest of the document.

## This note was uploaded on 01/19/2012 for the course COMPUTER S 100 taught by Professor Brown during the Spring '11 term at Strayer.

### Page1 / 9

(CIS110 -Cmptr Prgrmmng Dsgn) Final Exam - Date Taken:...

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

View Full Document
Ask a homework question - tutors are online