This preview has intentionally blurred sections. Sign up to view the full version.View Full Document
Unformatted text preview: CSC 1254 Practice Exam # 1 February 15, 2005 Section 1 or 2 • This exam consists of three parts. • Calculators are not allowed. • Use descriptive names for your identifiers, but no other documentation is required. • Use only ANSI C commands in your code. • Write your full name on every sheet you turn in. • Read the instructions preceding each section carefully before beginning the section. • If you need extra sheets, ask the proctor. Use only sheets provided you by the proctor. DURATION: 120 Minutes Table 1: Distribution of Points PART WORTH I x 1 = 30 II x 2 = 30 III x 3 = 40 Total 10 ∑ i =1 x i Exam Score 100 DO NOT TURN THIS PAGE UNTIL YOU ARE TOLD TO DO SO. 1 1 MULTIPLE-CHOICE 1 Multiple-Choice Instruction: Shade the circle that precedes the word or phrase that best an- swers the question or completes the sentence. (3 points each) 1. A composite data structure which consists of a collection of homogeneous data items is a(n) . circlecopyrt pointer circlecopyrt array circlecopyrt struct circlecopyrt union 2. A variable which holds the memory address of another variable is a(n) . circlecopyrt pointer circlecopyrt array circlecopyrt struct circlecopyrt union 3. Memory for a local variables is allocated from a pool of memory called the . circlecopyrt heap circlecopyrt queue circlecopyrt stack circlecopyrt cache 4. The process by which global variables are allocated memory is called . circlecopyrt automatic memory allocation circlecopyrt static memory allocation circlecopyrt dynamic memory allocation circlecopyrt latent memory allocation 5. Which of the following may NOT lead to the inefficient use of memory?...
View Full Document
This note was uploaded on 01/17/2012 for the course CSC 1254 taught by Professor Blanks,l during the Fall '08 term at LSU.
- Fall '08