2003 Academic Challenge

Size: px
Start display at page:

Download "2003 Academic Challenge"

Transcription

1 Worldwide Youth in Science and Engineering 2003 Academic Challenge COMPUTER SCIENCE TEST - STATE FINALS Computer Science Test Production Team S. R. Subramanya, University of Missouri - Rolla Author/Team Coordinator Jennifer Leopold, University of Missouri - Rolla Author Sanjay Madria, University of Missouri - Rolla Author Scott Elliott, John A. Logan College Reviewer Don Wayman, WYSE Coordinator of Test Production GENERAL DIRECTIONS Please read the following instructions carefully. This is a timed test; any instructions from the test supervisor should be followed promptly. The test supervisor will give instructions for filling in any necessary information on the answer sheet. Some Academic Challenge test sites are using answer sheets that require you to fill in the letter of the answer you choose on the blank line after each question number. Others may ask you to indicate your answer to each question by marking an oval that corresponds to the correct answer for that question. Only one oval should be marked to answer each question. Multiple ovals will automatically be graded as an incorrect answer. Be sure ovals are marked as. Not as,,. Test Question - 1. What is the name of the robotic helicopter used for surveillance by the U. S. Army? a. Eye in the Sky b. ROBOT I c. Surveyor I d. CYPHER e. Robospierre Answer Sheet-- 1. If you wish to change an completely before marking your new choice. A B C E answer, erase your first mark You are advised to use your time effectively and to work as rapidly as you can without losing accuracy. Do not waste your time on questions that are too difficult for you. Go on to the other questions and come back to the difficult ones later if you can. *** TIME: 40 MINUTES *** DO NOT OPEN TEST BOOKLET UNTIL YOU ARE TOLD TO DO SO! 2003 Worldwide Youth in Science and Engineering WYSE, Worldwide Youth in Science and Engineering and the WYSE Design are service marks of and this work is Copyright 2003 Board of Trustees of the University of Illinois at Urbana - Champaign. All rights reserved.

2 WYSE Academic Challenge Computer Science Test (State Finals) A CPU designed using a RISC architecture allows A) Assembly language programs to be written more easily. B) Emphasis on software support for execution of instructions C) The processor to run at a faster clock speed. D) All of the above. E) None of the above. 2. In the process of normalizing a floating-point number, when the radix point of the mantissa is shifted left, then the exponent is A) Decreased by the number of positions the mantissa is shifted. B) Increased by the number of positions the mantissa is shifted. C) Divided by 2. D) Unchanged. E) Divided by In an n-bit one s complement representation, A) 2 n - 1 integers can be represented. B) An end-around carry is required when performing addition. C) Negation is performed by complementing every bit. D) 0 has two representations. E) All of the above are true. 4. An overflow has occurred when adding two s complement numbers, if A) There is a carry out of the most significant bit (MSB). B) There is a carry into the MSB. C) The carry into the MSB differs from the carry out of the MSB. D) The carry into the MSB equals the carry out of the MSB. E) All of the above. 5. If all variables are of type integer and if a = b (mod m) and x = y (mod m), which of the following must be true? I. a + x = b + y (mod m) II. ax = by (mod m) III. a/n = b (mod m)/n for all n!= 0 A) II only B) III only C) I and II only D) I and III only E) I, II, and III

3 Computer Science 2 6. What is the number of terminal strings of length 5 generated by the context-free grammar shown below? A) 4 B) 5 C) 6 D) 7 E) 8 S --> A0B A --> BB 0 B --> AA 1 7. A relation can be defined by giving the ordered pairs of elements for which the relation holds. If the relation R over {a, b, c} is given by R = {(a,a), (a,b), (b,a), (b,b), (c,c)}, which of the following properties does R have? I. Symmetry II. Antisymmetry III. Reflexivity IV. Transitivity A) None. B) II and III only. C) II and IV only. D) I, III, and IV only. E) III and IV only. 8. Of the following components of a computer, which one stores data and instructions? A) Input device. B) Output device. C) Arithmetic/logic unit. D) Control unit. E) Memory unit.

4 9. What is the output of the following algorithm when objects stored in the array A [1.7] are 15, 1, 18, 5, 6, 9, 0, where N is 7. FUNCTION FUNC(A, N) J= 1; REPEAT MIN = INDEX_OF_MINIMUM in (A[J]...A[N]); SWAP A[J], A[MIN]; J= J+1; UNTIL J > N; RETURN A; A) 18, 15, 9, 6, 5, 1, 0 B) 18, 15, 9, 0, 1, 5, 6 C) 0, 1, 5, 6, 18, 15, 9 D) 0, 1, 5, 6, 9, 15, 18 E) None of the above. 10. What is the following sorting algorithm called? FUNCTION FUNC (A, N) I = 1 REPEAT WHILE I < N IF A[I] > A[I+1] THEN SWAP A[I], A[I+1]; END IF; I = I +1 ; END WHILE; UNTIL I >N; A) Bubble sort. B) Bucket sort. C) Insertion sort. D) Dummy sort. E) Quick sort. Computer Science 3

5 Computer Science What is the number produced by the following function for N = 10? A) 51 B) 45 C) 55 D) 53 E) 33 FUNCTION FUNC(N) IF N == 1 OR N == 2 THEN RETURN 1; ELSE X = FUNC(N-1) + FUNC(N-2); RETURN X; 12. What will the function print for N =3 if we read C as x then y then z on each execution of the following function? A) xyzzyx B) xxyzzy C) xyzxyx D) yzxyxx E) yzxzyz FUNCTION FUNC(N) IF N == 0 THEN RETURN; ELSE READ C; PRINT C; FUNC(N-1); PRINT C; 13. What will be the output of the following function for integer N >= 0? FUNCTION FUNC( N ) IF N == 0 THEN PRINT 0; RETURN; ELSE PRINT N; FUNC( N- 1); PRINT 2N 1; PRINT 2N; A) Numbers from 0 to 2N. B) Numbers from N to 0 and from 1 to 2N.

6 C) Numbers from 2N to 0. D) Numbers 0, N, 2N 1 and 2N. E) All of the above. Computer Science What will be the output of the following function for N>=0, where N is an integer number? A) 2 N B) N 2 C) 2N D) 2(N-1) E) 0 FUNCTION FUNC ( N ) IF N == 0 RETURN 1; ELSE RETURN (2 * FUNC( N-1 )); END FUNC 15. The following function is equivalent (in its closed form) to 0 if n = 0 f( n) = 2 + f( n 1) if n > 0 A) f(n) = 2(n-1) B) f(n) = 0 C) f(n) = 2n D) f(n) = 2 +f(n-1) E) None of the above. 16. The three levels of programming languages in order from the most machine-oriented to the most human-oriented are. A) Machine language, high-level language, and assembly language. B) Machine language, high-level language, and binary representation. C) Binary representation, machine language, and assembly language. D) Machine language, assembly language, and high-level language. E) Binary representation, assembly language, and machine language. 17. If you used the formula length + width to calculate the area of a rectangle (when it should be length * width), you would have made a error. A) Logical. B) Syntax. C) Pseudocode. D) Debugging. E) Lexical.

7 Computer Science In what order will the following function traverse the tree? A) Preorder B) Postorder C) Inorder D) Semiorder E) Sequential order FUNCTION FUNC(TREE) IF TREE IS NULL, RETURN; PRINT(TREE.ROOT); FUNC(TREE.LEFT_SUBTREE); FUNC(TREE.RIGHT_SUBTREE); 19. In what order will the following function traverse the tree? FUNCTION FUNC(TREE) IF TREE IS NULL, RETURN; FUNC(TREE.LEFT_SUBTREE); PRINT(TREE.ROOT); FUNC(TREE.RIGHT_SUBTREE); A) Preorder. B) Postorder. C) Inorder. D) Semiorder. E) Sequential order. 20. One difference between a queue and a stack is: A) Queues require linked lists, but stacks do not. B) Stacks require linked lists, but queues do not. C) Queues use two ends of the structure; stacks use only one. D) Stacks use two ends of the structure, queues use only one. E) Stacks and Queues both are data structures to store data. 21. If the characters 'D', 'C', 'B', 'A' are placed in a queue (in that order), and then removed one at a time, in what order will they be removed? A) ABCD B) ABDC C) DCAB D) DCBA E) BADC

8 Computer Science The traversal of the following tree in order of 3 * ^ 2 is called + * ^ A) Breath First Serach B) Preorder C) Inorder D) Postorder E) Depth First Search The sum of the first n powers of 2; n, n>=0, is A) 2 (n+1) -1 B) 2 n + 1 C) 2 n 1 D) 2n(n+1) E) 2n The worst-case time complexity of the code below is: FOR I = 0 to 200 DO N = 2*4; A) O(1) B) O(N) C) O(N 2 ) D) O(N log(n)) E) O(log(N)) 25. What are some advantages of increasing the modularity of code? A) To organize your code (programming style). B) To avoid repeating code if several executions needed. C) To increase the complexity of your code. D) Both a, and b. E) Both a, and c. 26. The Boolean expression XY + X Y is equivalent to A) X B) X +Y

9 C) Y D) XY E) None of the above. Computer Science The Boolean expression ( B C + AD)( AB + CD) is equal to A) 0 B) BC C) AB D) CD E) BC + CD 28. In the following logic diagram, F is equal to A) Y Z + Y( W + X ) B) (Y + Z) (W+ X) C) Y Z + Y( W + X ) D) Y Z + Y( W + X ) E) ZY + ( W + X ) 29. The result of Subtracting 0001 from 0111 using 2's complement is A) B) -6 C) 1001 D) 1100 E) All of the above. 30. For all x < 1, 3 ln{(1 x) } + is equal to A) x 3 - x 6 /2 + x 9 /3 - x 12 / B) 3(x - x 2 /2 + x 3 /3 - x 4 / C) 3(1 + x 3 - x 6 /2 + x 9 /3 - x 12 /4 +...) D) 1 + 3(x - x 2 /2 + x 3 /3 - x 4 /4 +...

10 E) None of the above.

2001 Academic Challenge

2001 Academic Challenge Worldwide Youth in Science and Engineering 2001 Academic Challenge COMPUTER SCIENCE TEST - STATE FINALS Computer Science Test Production Team Fred Hanzelin (retired), South Suburban College Coordinator/Co-author

More information

2008 Academic Challenge

2008 Academic Challenge 2008 Academic Challenge COMPUTER SCIENCE TEST - REGIONAL - - This Test Consists of 30 Questions - - Computer Science Test Production Team Jim Feher, McKendree College Author/Team Leader Kian Pokorny, McKendree

More information

2001 Academic Challenge

2001 Academic Challenge Worldwide Youth in Science and Engineering 2001 cademic Challenge COMPUTER SCIENCE TEST - SECTIONL GENERL DIRECTIONS Computer Science Test Production Team Fred Hanzelin (retired), South Suburban College

More information

2005 Academic Challenge

2005 Academic Challenge 2005 Academic Challenge COMPUTER SCIENCE TEST - SECTIONAL Computer Science Test Production Team Sanjay Madria, University of Missouri at Rolla Author/Team Coordinator S. R. Subramanya, University of Missouri

More information

2009 Academic Challenge

2009 Academic Challenge 2009 Academic Challenge COMPUTER SCIENCE TEST - STATE FINALS This Test Consists of 30 Questions Computer Science Test Production Team Jim Feher, McKendree College Author/Team Leader Barry Bookout, East

More information

2015 Academic Challenge

2015 Academic Challenge 2015 Academic Challenge COMPUTER SCIENCE TEST - REGIONAL This Test Consists of 30 Questions Computer Science Test Production Team James D. Feher, McKendree University Author/Team Leader Nathan White, Central

More information

2009 Academic Challenge

2009 Academic Challenge 2009 Academic Challenge COMPUTER SCIENCE TEST - REGIONAL This Test Consists of 30 Questions Computer Science Test Production Team Jim Feher, McKendree University Author/Team Leader Barry Bookout, East

More information

2015 Academic Challenge

2015 Academic Challenge 2015 Academic Challenge COMPUTER SCIENCE TEST - STATE This Test Consists of 30 Questions Computer Science Test Production Team James D. Feher, McKendree University Author/Team Leader Nathan White, McKendree

More information

2015 Academic Challenge

2015 Academic Challenge 2015 Academic Challenge COMPUTER SCIENCE TEST - SECTIONAL This Test Consists of 30 Questions Computer Science Test Production Team James D. Feher, McKendree University Author/Team Leader Nathan White,

More information

2012 Academic Challenge

2012 Academic Challenge 2012 Academic Challenge COMPUTER SCIENCE TEST - REGIONAL This Test Consists of 30 Questions Computer Science Test Production Team Jim Feher, McKendree University Author/Team Leader Nathan White, McKendree

More information

2012 Academic Challenge

2012 Academic Challenge 2012 Academic Challenge COMPUTER SCIENCE TEST - SECTIONAL This Test Consists of 30 Questions Computer Science Test Production Team Jim Feher, McKendree University Author/Team Leader Nathan White, McKendree

More information

2013 Academic Challenge

2013 Academic Challenge Academic Challenge COMPUTER SCIENCE TEST - SECTIONAL This Test Consists of Questions Computer Science Test Production Team Jim Feher, McKendree University Author/Team Leader Nathan White, McKendree University

More information

CSE 373 Spring Midterm. Friday April 21st

CSE 373 Spring Midterm. Friday April 21st CSE 373 Spring 2006 Data Structures and Algorithms Midterm Friday April 21st NAME : Do all your work on these pages. Do not add any pages. Use back pages if necessary. Show your work to get partial credit.

More information

WYSE Academic Challenge 2002 Computer Science Test (Sectional) SOLUTION

WYSE Academic Challenge 2002 Computer Science Test (Sectional) SOLUTION Computer Science - 1 WYSE Academic Challenge 2002 Computer Science Test (Sectional) SOLUTION 1. Access to moving head disks requires three periods of delay before information is brought into memory. The

More information

Draw a diagram of an empty circular queue and describe it to the reader.

Draw a diagram of an empty circular queue and describe it to the reader. 1020_1030_testquestions.text Wed Sep 10 10:40:46 2014 1 1983/84 COSC1020/30 Tests >>> The following was given to students. >>> Students can have a good idea of test questions by examining and trying the

More information

FINALTERM EXAMINATION Fall 2009 CS301- Data Structures Question No: 1 ( Marks: 1 ) - Please choose one The data of the problem is of 2GB and the hard

FINALTERM EXAMINATION Fall 2009 CS301- Data Structures Question No: 1 ( Marks: 1 ) - Please choose one The data of the problem is of 2GB and the hard FINALTERM EXAMINATION Fall 2009 CS301- Data Structures Question No: 1 The data of the problem is of 2GB and the hard disk is of 1GB capacity, to solve this problem we should Use better data structures

More information

MID TERM MEGA FILE SOLVED BY VU HELPER Which one of the following statement is NOT correct.

MID TERM MEGA FILE SOLVED BY VU HELPER Which one of the following statement is NOT correct. MID TERM MEGA FILE SOLVED BY VU HELPER Which one of the following statement is NOT correct. In linked list the elements are necessarily to be contiguous In linked list the elements may locate at far positions

More information

MULTIMEDIA COLLEGE JALAN GURNEY KIRI KUALA LUMPUR

MULTIMEDIA COLLEGE JALAN GURNEY KIRI KUALA LUMPUR STUDENT IDENTIFICATION NO MULTIMEDIA COLLEGE JALAN GURNEY KIRI 54100 KUALA LUMPUR FIFTH SEMESTER FINAL EXAMINATION, 2014/2015 SESSION PSD2023 ALGORITHM & DATA STRUCTURE DSEW-E-F-2/13 25 MAY 2015 9.00 AM

More information

CS8391-DATA STRUCTURES QUESTION BANK UNIT I

CS8391-DATA STRUCTURES QUESTION BANK UNIT I CS8391-DATA STRUCTURES QUESTION BANK UNIT I 2MARKS 1.Define data structure. The data structure can be defined as the collection of elements and all the possible operations which are required for those

More information

University of Toronto Department of Electrical and Computer Engineering. Midterm Examination. ECE 345 Algorithms and Data Structures Fall 2010

University of Toronto Department of Electrical and Computer Engineering. Midterm Examination. ECE 345 Algorithms and Data Structures Fall 2010 University of Toronto Department of Electrical and Computer Engineering Midterm Examination ECE 345 Algorithms and Data Structures Fall 2010 Print your name and ID number neatly in the space provided below;

More information

DATA STRUCTURE : A MCQ QUESTION SET Code : RBMCQ0305

DATA STRUCTURE : A MCQ QUESTION SET Code : RBMCQ0305 Q.1 If h is any hashing function and is used to hash n keys in to a table of size m, where n

More information

Read this before starting!

Read this before starting! Points missed: Student's Name: Total score: /100 points East Tennessee State University Department of Computer and Information Sciences CSCI 2150 (Tarnoff) Computer Organization TEST 1 for Fall Semester,

More information

Data Structure Advanced

Data Structure Advanced Data Structure Advanced 1. Is it possible to find a loop in a Linked list? a. Possilbe at O(n) b. Not possible c. Possible at O(n^2) only d. Depends on the position of loop Solution: a. Possible at O(n)

More information

CSL 201 Data Structures Mid-Semester Exam minutes

CSL 201 Data Structures Mid-Semester Exam minutes CL 201 Data tructures Mid-emester Exam - 120 minutes Name: Roll Number: Please read the following instructions carefully This is a closed book, closed notes exam. Calculators are allowed. However laptops

More information

Computer Science /21/2000

Computer Science /21/2000 Computer Science 126 01/21/2000 Final Exam with Answers 1:30-4:30pm 1. Linked Lists and Recursion [11] This is based on final review question #6. Assume the following linked list definition. typedef struct

More information

CS 8391 DATA STRUCTURES

CS 8391 DATA STRUCTURES DEPARTMENT OF COMPUTER SCIENCE AND ENGINEERING QUESTION BANK CS 8391 DATA STRUCTURES UNIT- I PART A 1. Define: data structure. A data structure is a way of storing and organizing data in the memory for

More information

University of Palestine. Final Exam 2 nd semester 2014/2015 Total Grade: 50

University of Palestine. Final Exam 2 nd semester 2014/2015 Total Grade: 50 First Question Q1 B1 Choose the best Answer: No. of Branches (1) (10/50) 1) 2) 3) 4) Suppose we start with an empty stack and then perform the following operations: Push (A); Push (B); Pop; Push (C); Top;

More information

A6-R3: DATA STRUCTURE THROUGH C LANGUAGE

A6-R3: DATA STRUCTURE THROUGH C LANGUAGE A6-R3: DATA STRUCTURE THROUGH C LANGUAGE NOTE: 1. There are TWO PARTS in this Module/Paper. PART ONE contains FOUR questions and PART TWO contains FIVE questions. 2. PART ONE is to be answered in the TEAR-OFF

More information

CS8391-DATA STRUCTURES

CS8391-DATA STRUCTURES ST.JOSEPH COLLEGE OF ENGINEERING DEPARTMENT OF COMPUTER SCIENCE AND ENGINEERI NG CS8391-DATA STRUCTURES QUESTION BANK UNIT I 2MARKS 1.Explain the term data structure. The data structure can be defined

More information

Numerical Representations On The Computer: Negative And Rational Numbers

Numerical Representations On The Computer: Negative And Rational Numbers Numerical Representations On The Computer: Negative And Rational Numbers How are negative and rational numbers represented on the computer? How are subtractions performed by the computer? Subtraction In

More information

MAHARASHTRA STATE BOARD OF TECHNICAL EDUCATION (Autonomous) (ISO/IEC Certified)

MAHARASHTRA STATE BOARD OF TECHNICAL EDUCATION (Autonomous) (ISO/IEC Certified) WINTER 18 EXAMINATION Subject Name: Data Structure Model wer Subject Code: 17330 Important Instructions to examiners: 1) The answers should be examined by key words and not as word-to-word as given in

More information

COSC 2007 Data Structures II Final Exam. Part 1: multiple choice (1 mark each, total 30 marks, circle the correct answer)

COSC 2007 Data Structures II Final Exam. Part 1: multiple choice (1 mark each, total 30 marks, circle the correct answer) COSC 2007 Data Structures II Final Exam Thursday, April 13 th, 2006 This is a closed book and closed notes exam. There are total 3 parts. Please answer the questions in the provided space and use back

More information

Cambridge International Examinations Cambridge International Advanced Subsidiary and Advanced Level

Cambridge International Examinations Cambridge International Advanced Subsidiary and Advanced Level Cambridge International Examinations Cambridge International Advanced Subsidiary and Advanced Level *7825200973* COMPUTER SCIENCE 9608/32 Paper 3 Advanced Theory October/November 2018 1 hour 30 minutes

More information

Numerical Representations On The Computer: Negative And Rational Numbers

Numerical Representations On The Computer: Negative And Rational Numbers Numerical Representations On The Computer: Negative And Rational Numbers How are negative and rational numbers represented on the computer? How are subtractions performed by the computer? Subtraction In

More information

A6-R3: DATA STRUCTURE THROUGH C LANGUAGE

A6-R3: DATA STRUCTURE THROUGH C LANGUAGE A6-R3: DATA STRUCTURE THROUGH C LANGUAGE NOTE: 1. There are TWO PARTS in this Module/Paper. PART ONE contains FOUR questions and PART TWO contains FIVE questions. 2. PART ONE is to be answered in the TEAR-OFF

More information

The ALU consists of combinational logic. Processes all data in the CPU. ALL von Neuman machines have an ALU loop.

The ALU consists of combinational logic. Processes all data in the CPU. ALL von Neuman machines have an ALU loop. CS 320 Ch 10 Computer Arithmetic The ALU consists of combinational logic. Processes all data in the CPU. ALL von Neuman machines have an ALU loop. Signed integers are typically represented in sign-magnitude

More information

University of Waterloo Department of Electrical and Computer Engineering ECE 250 Data Structures and Algorithms. Final Examination

University of Waterloo Department of Electrical and Computer Engineering ECE 250 Data Structures and Algorithms. Final Examination University of Waterloo Department of Electrical and Computer Engineering ECE 250 Data Structures and Algorithms Instructor: Douglas Wilhelm Harder Time: 2.5 hours Aides: none 14 pages Final Examination

More information

F453 Module 7: Programming Techniques. 7.2: Methods for defining syntax

F453 Module 7: Programming Techniques. 7.2: Methods for defining syntax 7.2: Methods for defining syntax 2 What this module is about In this module we discuss: explain how functions, procedures and their related variables may be used to develop a program in a structured way,

More information

Introduction to C. Why C? Difference between Python and C C compiler stages Basic syntax in C

Introduction to C. Why C? Difference between Python and C C compiler stages Basic syntax in C Final Review CS304 Introduction to C Why C? Difference between Python and C C compiler stages Basic syntax in C Pointers What is a pointer? declaration, &, dereference... Pointer & dynamic memory allocation

More information

Cambridge International Examinations Cambridge International Advanced Subsidiary and Advanced Level

Cambridge International Examinations Cambridge International Advanced Subsidiary and Advanced Level Cambridge International Examinations Cambridge International Advanced Subsidiary and Advanced Level *4137415794* COMPUTER SCIENCE 9608/31 Paper 3 Advanced Theory October/November 2018 1 hour 30 minutes

More information

Programming II (CS300)

Programming II (CS300) 1 Programming II (CS300) Chapter 12: Heaps and Priority Queues MOUNA KACEM mouna@cs.wisc.edu Fall 2018 Heaps and Priority Queues 2 Priority Queues Heaps Priority Queue 3 QueueADT Objects are added and

More information

Name: CMSC 313 Fall 2001 Computer Organization & Assembly Language Programming Exam 1. Question Points I. /34 II. /30 III.

Name: CMSC 313 Fall 2001 Computer Organization & Assembly Language Programming Exam 1. Question Points I. /34 II. /30 III. CMSC 313 Fall 2001 Computer Organization & Assembly Language Programming Exam 1 Name: Question Points I. /34 II. /30 III. /36 TOTAL: /100 Instructions: 1. This is a closed-book, closed-notes exam. 2. You

More information

I Year MCA I Semester L T P To C FOUNDATIONS OF INFORMATION TECHNOLOGY

I Year MCA I Semester L T P To C FOUNDATIONS OF INFORMATION TECHNOLOGY I Year MCA I Semester L T P To C 3 1-4 4 MC101 FOUNDATIONS OF INFORMATION TECHNOLOGY Objectives of the Course: It offers students an overall idea of computer science and information technology to the student.

More information

WYSE Academic Challenge Computer Fundamentals Test (State Finals)

WYSE Academic Challenge Computer Fundamentals Test (State Finals) WYSE Academic Challenge Computer Fundamentals Test (State Finals) - 1998 1. What is the decimal value for the result of the addition of the binary values: 1111 + 0101? (Assume a 4 bit, 2's complement representation.)

More information

MARKING KEY The University of British Columbia MARKING KEY Computer Science 260 Midterm #2 Examination 12:30 noon, Thursday, March 15, 2012

MARKING KEY The University of British Columbia MARKING KEY Computer Science 260 Midterm #2 Examination 12:30 noon, Thursday, March 15, 2012 MARKING KEY The University of British Columbia MARKING KEY Computer Science 260 Midterm #2 Examination 12:30 noon, Thursday, March 15, 2012 Instructor: K. S. Booth Time: 70 minutes (one hour ten minutes)

More information

3. According to universal addressing, what is the address of vertex d? 4. According to universal addressing, what is the address of vertex f?

3. According to universal addressing, what is the address of vertex d? 4. According to universal addressing, what is the address of vertex f? 1. Prove: A full m-ary tree with i internal vertices contains n = mi + 1 vertices. 2. For a full m-ary tree with n vertices, i internal vertices, and l leaves, prove: (i) i = (n 1)/m and l = [(m 1)n +

More information

Google placement paper

Google placement paper Visit prepnode.com for more placement papers and interview tips. Google placement paper No. of questions : 25 Maximum Time allowed : 60 minutes 1. Teacher asked the students to find the cube root of a

More information

CHAPTER V NUMBER SYSTEMS AND ARITHMETIC

CHAPTER V NUMBER SYSTEMS AND ARITHMETIC CHAPTER V-1 CHAPTER V CHAPTER V NUMBER SYSTEMS AND ARITHMETIC CHAPTER V-2 NUMBER SYSTEMS RADIX-R REPRESENTATION Decimal number expansion 73625 10 = ( 7 10 4 ) + ( 3 10 3 ) + ( 6 10 2 ) + ( 2 10 1 ) +(

More information

CSE 332 Spring 2013: Midterm Exam (closed book, closed notes, no calculators)

CSE 332 Spring 2013: Midterm Exam (closed book, closed notes, no calculators) Name: Email address: Quiz Section: CSE 332 Spring 2013: Midterm Exam (closed book, closed notes, no calculators) Instructions: Read the directions for each question carefully before answering. We will

More information

Analysis of Algorithms. Unit 4 - Analysis of well known Algorithms

Analysis of Algorithms. Unit 4 - Analysis of well known Algorithms Analysis of Algorithms Unit 4 - Analysis of well known Algorithms 1 Analysis of well known Algorithms Brute Force Algorithms Greedy Algorithms Divide and Conquer Algorithms Decrease and Conquer Algorithms

More information

SPECIAL MOCK GCE EXAMINATIONS

SPECIAL MOCK GCE EXAMINATIONS PROGRESSIVE COMPREHENSIVE HIGH SCHOOL (PCHS) MANKON, BAMENDA SPECIAL MOCK GCE EXAMINATIONS 14 FEBRUARY 2014 ADVANCED LEVEL Subject/Code: Computer Science 795 Paper N 1 Examiner DZEUGANG Placide 795 COMPUTER

More information

Visit ::: Original Website For Placement Papers. ::: Data Structure

Visit  ::: Original Website For Placement Papers. ::: Data Structure Data Structure 1. What is data structure? A data structure is a way of organizing data that considers not only the items stored, but also their relationship to each other. Advance knowledge about the relationship

More information

CSE 373 Autumn 2010: Midterm #1 (closed book, closed notes, NO calculators allowed)

CSE 373 Autumn 2010: Midterm #1 (closed book, closed notes, NO calculators allowed) Name: Email address: CSE 373 Autumn 2010: Midterm #1 (closed book, closed notes, NO calculators allowed) Instructions: Read the directions for each question carefully before answering. We may give partial

More information

CSE 332 Autumn 2013: Midterm Exam (closed book, closed notes, no calculators)

CSE 332 Autumn 2013: Midterm Exam (closed book, closed notes, no calculators) Name: Email address: Quiz Section: CSE 332 Autumn 2013: Midterm Exam (closed book, closed notes, no calculators) Instructions: Read the directions for each question carefully before answering. We will

More information

Programming and Data Structure Solved. MCQs- Part 2

Programming and Data Structure Solved. MCQs- Part 2 Programming and Data Structure Solved MCQs- Part 2 Programming and Data Structure Solved MCQs- Part 2 Unsigned integers occupies Two bytes Four bytes One byte Eight byte A weather forecasting computation

More information

CS Algorithms and Complexity

CS Algorithms and Complexity CS 350 - Algorithms and Complexity Basic Sorting Sean Anderson 1/18/18 Portland State University Table of contents 1. Core Concepts of Sort 2. Selection Sort 3. Insertion Sort 4. Non-Comparison Sorts 5.

More information

CSE 373 Spring 2010: Midterm #1 (closed book, closed notes, NO calculators allowed)

CSE 373 Spring 2010: Midterm #1 (closed book, closed notes, NO calculators allowed) Name: Email address: CSE 373 Spring 2010: Midterm #1 (closed book, closed notes, NO calculators allowed) Instructions: Read the directions for each question carefully before answering. We may give partial

More information

Code No: R Set No. 1

Code No: R Set No. 1 Code No: R059210504 Set No. 1 II B.Tech I Semester Supplementary Examinations, February 2007 DIGITAL LOGIC DESIGN ( Common to Computer Science & Engineering, Information Technology and Computer Science

More information

Code No: R Set No. 1

Code No: R Set No. 1 Code No: R05010106 Set No. 1 1. (a) Draw a Flowchart for the following The average score for 3 tests has to be greater than 80 for a candidate to qualify for the interview. Representing the conditional

More information

FORTH SEMESTER DIPLOMA EXAMINATION IN ENGINEERING/ TECHNOLIGY- MARCH, 2012 DATA STRUCTURE (Common to CT and IF) [Time: 3 hours

FORTH SEMESTER DIPLOMA EXAMINATION IN ENGINEERING/ TECHNOLIGY- MARCH, 2012 DATA STRUCTURE (Common to CT and IF) [Time: 3 hours TED (10)-3071 Reg. No.. (REVISION-2010) (Maximum marks: 100) Signature. FORTH SEMESTER DIPLOMA EXAMINATION IN ENGINEERING/ TECHNOLIGY- MARCH, 2012 DATA STRUCTURE (Common to CT and IF) [Time: 3 hours PART

More information

Priority queues. Priority queues. Priority queue operations

Priority queues. Priority queues. Priority queue operations Priority queues March 30, 018 1 Priority queues The ADT priority queue stores arbitrary objects with priorities. An object with the highest priority gets served first. Objects with priorities are defined

More information

Department of Computer Science and Technology

Department of Computer Science and Technology UNIT : Stack & Queue Short Questions 1 1 1 1 1 1 1 1 20) 2 What is the difference between Data and Information? Define Data, Information, and Data Structure. List the primitive data structure. List the

More information

CS-301 Data Structure. Tariq Hanif

CS-301 Data Structure. Tariq Hanif 1. The tree data structure is a Linear data structure Non-linear data structure Graphical data structure Data structure like queue FINALTERM EXAMINATION Spring 2012 CS301- Data Structure 25-07-2012 2.

More information

1996 ILLINOIS JETS TEAMS DISTRICT COMPUTER FUNDAMENTALS TEST. 1. A computer program is:

1996 ILLINOIS JETS TEAMS DISTRICT COMPUTER FUNDAMENTALS TEST. 1. A computer program is: 1996 ILLINOIS JETS TEAMS DISTRICT COMPUTER FUNDAMENTALS TEST 1. A computer program is: a. a sequence of binary machine instructions b. a sequence of operations to carry out a defined task c. a set of computer

More information

DATA STRUCTURES AND ALGORITHMS

DATA STRUCTURES AND ALGORITHMS DATA STRUCTURES AND ALGORITHMS For COMPUTER SCIENCE DATA STRUCTURES &. ALGORITHMS SYLLABUS Programming and Data Structures: Programming in C. Recursion. Arrays, stacks, queues, linked lists, trees, binary

More information

APJ ABDUL KALAM TECHNOLOGICAL UNIVERSITY THIRD SEMESTER B.TECH DEGREE EXAMINATION, JULY 2017 CS205: DATA STRUCTURES (CS, IT)

APJ ABDUL KALAM TECHNOLOGICAL UNIVERSITY THIRD SEMESTER B.TECH DEGREE EXAMINATION, JULY 2017 CS205: DATA STRUCTURES (CS, IT) D B3D042 Pages: 2 Reg. No. Name: APJ ABDUL KALAM TECHNOLOGICAL UNIVERSITY THIRD SEMESTER B.TECH DEGREE EXAMINATION, JULY 2017 Max. Marks: 100 CS205: DATA STRUCTURES (CS, IT) PART A Answer all questions.

More information

CPSC 331 Term Test #2 March 26, 2007

CPSC 331 Term Test #2 March 26, 2007 CPSC 331 Term Test #2 March 26, 2007 Name: Please DO NOT write your ID number on this page. Instructions: Answer all questions in the space provided. Point form answers are acceptable if complete enough

More information

Search,Sort,Recursion

Search,Sort,Recursion Search,Sort,Recursion Searching, Sorting and Recursion Searching Linear Search Inserting into an Array Deleting from an Array Selection Sort Bubble Sort Binary Search Recursive Binary Search Searching

More information

CS301 - Data Structures Glossary By

CS301 - Data Structures Glossary By CS301 - Data Structures Glossary By Abstract Data Type : A set of data values and associated operations that are precisely specified independent of any particular implementation. Also known as ADT Algorithm

More information

CSE 143 Final Exam Part 1 - August 18, 2011, 9:40 am

CSE 143 Final Exam Part 1 - August 18, 2011, 9:40 am CSE 143 Final Exam Part 1 - August 18, 2011, 9:40 am Name Student ID # Section TA Name The exam is closed book, closed notes, closed devices, except that you may have a 5x8 card with handwritten notes

More information

Introduction to Computer Science. Homework 1

Introduction to Computer Science. Homework 1 Introduction to Computer Science Homework. In each circuit below, the rectangles represent the same type of gate. Based on the input and output information given, identify whether the gate involved is

More information

Question And Answer.

Question And Answer. Q.1 What is the number of swaps required to sort n elements using selection sort, in the worst case? A. &#920(n) B. &#920(n log n) C. &#920(n2) D. &#920(n2 log n) ANSWER : Option A &#920(n) Note that we

More information

Data Structures. 1. Each entry in a linked list is a called a (a)link (b)node (c)data structure (d)none of the above

Data Structures. 1. Each entry in a linked list is a called a (a)link (b)node (c)data structure (d)none of the above Data Structures 1. Each entry in a linked list is a called a --------- (a)link (b)node (c)data structure (d)none of the above 2. Linked list uses type of memory allocation (a)static (b)dynamic (c)random

More information

Info View Practice Test

Info View Practice Test Info View Practice Test http://tinyurl.com/pe48dnz 22.9.2015 1. Merge sort uses? [A] Divide and conquer strategy [C] Heuristic search [B] Backtracking approach [D] Greedy approach 2. The postfix expression

More information

R10 SET - 1. Code No: R II B. Tech I Semester, Supplementary Examinations, May

R10 SET - 1. Code No: R II B. Tech I Semester, Supplementary Examinations, May www.jwjobs.net R10 SET - 1 II B. Tech I Semester, Supplementary Examinations, May - 2012 (Com. to CSE, IT, ECC ) Time: 3 hours Max Marks: 75 *******-****** 1. a) Which of the given options provides the

More information

Arithmetic Operations

Arithmetic Operations Arithmetic Operations Arithmetic Operations addition subtraction multiplication division Each of these operations on the integer representations: unsigned two's complement 1 Addition One bit of binary

More information

Chapter 4. Divide-and-Conquer. Copyright 2007 Pearson Addison-Wesley. All rights reserved.

Chapter 4. Divide-and-Conquer. Copyright 2007 Pearson Addison-Wesley. All rights reserved. Chapter 4 Divide-and-Conquer Copyright 2007 Pearson Addison-Wesley. All rights reserved. Divide-and-Conquer The most-well known algorithm design strategy: 2. Divide instance of problem into two or more

More information

THIS IS A NEW SPECIFICATION

THIS IS A NEW SPECIFICATION THIS IS A NEW SPECIFICATION ADVANCED GCE COMPUTING Advanced Computing Theory F453 * OCE / 1 8786* Candidates answer on the Question Paper OCR Supplied Materials: None Other Materials Required: None Wednesday

More information

10.1. Unit 10. Signed Representation Systems Binary Arithmetic

10.1. Unit 10. Signed Representation Systems Binary Arithmetic 0. Unit 0 Signed Representation Systems Binary Arithmetic 0.2 BINARY REPRESENTATION SYSTEMS REVIEW 0.3 Interpreting Binary Strings Given a string of s and 0 s, you need to know the representation system

More information

Madhya Pradesh Bhoj (Open) University, Bhopal

Madhya Pradesh Bhoj (Open) University, Bhopal Subject- Computer Organisation & System Software Maximum Marks: 20 Q.1 What is Number System? Explain Its Types? Q.2 What is Program Interrupt? Explain it. Q.3 Explain the Floating Point Representation?

More information

Table of Contents. Chapter 1: Introduction to Data Structures... 1

Table of Contents. Chapter 1: Introduction to Data Structures... 1 Table of Contents Chapter 1: Introduction to Data Structures... 1 1.1 Data Types in C++... 2 Integer Types... 2 Character Types... 3 Floating-point Types... 3 Variables Names... 4 1.2 Arrays... 4 Extraction

More information

Second Examination Solution

Second Examination Solution University of Illinois at Urbana-Champaign Department of Computer Science Second Examination Solution CS 225 Data Structures and Software Principles Fall 2007 7p-9p, Thursday, November 8 Name: NetID: Lab

More information

INSTITUTE OF AERONAUTICAL ENGINEERING

INSTITUTE OF AERONAUTICAL ENGINEERING INSTITUTE OF AERONAUTICAL ENGINEERING (Autonomous) Dundigal, Hyderabad - 500 043 COMPUTER SCIENCE AND ENGINEERING TUTORIAL QUESTION BANK Course Name Course Code Class Branch DATA STRUCTURES ACS002 B. Tech

More information

Chapter 03: Computer Arithmetic. Lesson 09: Arithmetic using floating point numbers

Chapter 03: Computer Arithmetic. Lesson 09: Arithmetic using floating point numbers Chapter 03: Computer Arithmetic Lesson 09: Arithmetic using floating point numbers Objective To understand arithmetic operations in case of floating point numbers 2 Multiplication of Floating Point Numbers

More information

CS Divide and Conquer

CS Divide and Conquer CS483-07 Divide and Conquer Instructor: Fei Li Room 443 ST II Office hours: Tue. & Thur. 1:30pm - 2:30pm or by appointments lifei@cs.gmu.edu with subject: CS483 http://www.cs.gmu.edu/ lifei/teaching/cs483_fall07/

More information

8/27/2016. ECE 120: Introduction to Computing. Graphical Illustration of Modular Arithmetic. Representations Must be Unambiguous

8/27/2016. ECE 120: Introduction to Computing. Graphical Illustration of Modular Arithmetic. Representations Must be Unambiguous University of Illinois at Urbana-Champaign Dept. of Electrical and Computer Engineering ECE 120: Introduction to Computing Signed Integers and 2 s Complement Strategy: Use Common Hardware for Two Representations

More information

By, Ajinkya Karande Adarsh Yoga

By, Ajinkya Karande Adarsh Yoga By, Ajinkya Karande Adarsh Yoga Introduction Early computer designers believed saving computer time and memory were more important than programmer time. Bug in the divide algorithm used in Intel chips.

More information

Data Structures. Trees. By Dr. Mohammad Ali H. Eljinini. M.A. Eljinini, PhD

Data Structures. Trees. By Dr. Mohammad Ali H. Eljinini. M.A. Eljinini, PhD Data Structures Trees By Dr. Mohammad Ali H. Eljinini Trees Are collections of items arranged in a tree like data structure (none linear). Items are stored inside units called nodes. However: We can use

More information

Abstract Data Structures IB Computer Science. Content developed by Dartford Grammar School Computer Science Department

Abstract Data Structures IB Computer Science. Content developed by Dartford Grammar School Computer Science Department Abstract Data Structures IB Computer Science Content developed by Dartford Grammar School Computer Science Department HL Topics 1-7, D1-4 1: System design 2: Computer Organisation 3: Networks 4: Computational

More information

Introduction to Computer Science Midterm 3 Fall, Points

Introduction to Computer Science Midterm 3 Fall, Points Introduction to Computer Science Fall, 2001 100 Points Notes 1. Tear off this sheet and use it to keep your answers covered at all times. 2. Turn the exam over and write your name next to the staple. Do

More information

Inf2C - Computer Systems Lecture 2 Data Representation

Inf2C - Computer Systems Lecture 2 Data Representation Inf2C - Computer Systems Lecture 2 Data Representation Boris Grot School of Informatics University of Edinburgh Last lecture Moore s law Types of computer systems Computer components Computer system stack

More information

University Interscholastic League. Computer Science Competition

University Interscholastic League. Computer Science Competition University Interscholastic League Computer Science Competition Number 121 (District 1-2010) General Directions (Please read carefully!): 1) DO NOT OPEN EXAM UNTIL TOLD TO DO SO. 2) NO CALCULATOR OF ANY

More information

CS 216 Exam 1 Fall SOLUTION

CS 216 Exam 1 Fall SOLUTION CS 216 Exam 1 Fall 2004 - SOLUTION Name: Lab Section: Email Address: Student ID # This exam is closed note, closed book. You will have an hour and fifty minutes total to complete the exam. You may NOT

More information

CSC Design and Analysis of Algorithms

CSC Design and Analysis of Algorithms CSC 8301- Design and Analysis of Algorithms Lecture 6 Divide and Conquer Algorithm Design Technique Divide-and-Conquer The most-well known algorithm design strategy: 1. Divide a problem instance into two

More information

Class 2: Variables and Memory. Laura Marik Spring 2012 C++ Course Notes (Provided by Jason Minski)

Class 2: Variables and Memory. Laura Marik Spring 2012 C++ Course Notes (Provided by Jason Minski) Class 2: Variables and Memory Variables A variable is a value that is stored in memory It can be numeric or a character C++ needs to be told what type it is before it can store it in memory It also needs

More information

CS DATA STRUCTURES AND ALGORITHMS

CS DATA STRUCTURES AND ALGORITHMS Computer Science and Engineering Third Semester CS1211 - DATA STRUCTURES AND ALGORITHMS UNIT-I - INTRODUCTION TO DATASTRUCTURES 1.Write down the definition of data structures? PART -A A data structure

More information

Answers. 1. (A) Attempt any five : 20 Marks

Answers. 1. (A) Attempt any five : 20 Marks Important Instructions to examiners: 1) The answers should be examined by key words and not as word-to-word as given in the model answer scheme. 2) The model answer and the answer written by candidate

More information

Divide-and-Conquer. The most-well known algorithm design strategy: smaller instances. combining these solutions

Divide-and-Conquer. The most-well known algorithm design strategy: smaller instances. combining these solutions Divide-and-Conquer The most-well known algorithm design strategy: 1. Divide instance of problem into two or more smaller instances 2. Solve smaller instances recursively 3. Obtain solution to original

More information

CSC Design and Analysis of Algorithms. Lecture 6. Divide and Conquer Algorithm Design Technique. Divide-and-Conquer

CSC Design and Analysis of Algorithms. Lecture 6. Divide and Conquer Algorithm Design Technique. Divide-and-Conquer CSC 8301- Design and Analysis of Algorithms Lecture 6 Divide and Conquer Algorithm Design Technique Divide-and-Conquer The most-well known algorithm design strategy: 1. Divide a problem instance into two

More information

D.JJtl : A4, 803. M~4;t. ~~~ ~,~ ~~~C¼**a~ ~)a~ M * ffl1l$*;=m-, J{-11*~1- ~ ft j * s. ~~ *$~~$* ~ ~ ~,a~maft *m $*;=t,

D.JJtl : A4, 803. M~4;t. ~~~ ~,~ ~~~C¼**a~ ~)a~ M * ffl1l$*;=m-, J{-11*~1- ~ ft j * s. ~~ *$~~$* ~ ~ ~,a~maft *m $*;=t, .. D.JJtl : A4, 803 I. ~$t~ ~~4fy~~~'**+ ~AftA~,~~*** M~4;t 0 2. -~~$*~(T)LZ~~~~,~~# ~~L~ 0 3. *~##J1:.1~Jfl it.. ~ 0 4. Qi?f41f--(f.$*+ L1Ji=$ 0 s. ~~~~~~~~~~,~~-~~~,$~ 1t~~~~&M~ :Jt.~x.~~.n-it 0 6. $*~]fl

More information