Draw a diagram of an empty circular queue and describe it to the reader.
|
|
- Alban Gilmore
- 5 years ago
- Views:
Transcription
1 1020_1030_testquestions.text Wed Sep 10 10:40: /84 COSC1020/30 Tests >>> The following was given to students. >>> Students can have a good idea of test questions by examining and trying the questions in the text book. Most test questions will either (1) come directly from the texts, (2) be based on the reports, (3) be based on class lectures, or, be variations of such questions. Without limiting the types of questions to be asked, students can expect questions of the following types. In brief, consider all concepts and terminolgy used in the text book, reports, and lectures and ask the typical questions - how, why, when, where and what - individually and in combination. 1. Definition. What does a technical term mean. E.g. What is a compiler? Define what is meant by computable. What does the term recursion mean? Give a definition for an abstract data type. Such questions can involve any of the terms in the textbooks and Pascal manuals. 2. Example. Give examples illustrating particular concepts. E.g. Give an example showing that arithmetic on real numbers is not commutative. Draw a diagram of an empty circular queue and describe it to the reader. 3. Tracing. Play at being a computer to show what happens within a program at execution time. E.g. Given the listing of a program show what the values of some variables are after 5 iterations of the loop. What is the final result? 4. Program. Write either complete or fragments of programs which solve standard problems, or illustrate particular programming concepts. E.g. Write a program to find the maximum of three integers. Write a program fragment to insert a node in a doubly linked list. Write a procedure to swap the top two elements on a stack. 5. Analysis. Compare and contrast algorithms and concepts. E.g. Distinguish between a compiler and an interpreter. Under what circumstances can a binary search be used? Compare the efficency of insertion sort and quicksort? Can quicksort and merge sort be used equally effectively on files? Explain your answer. Which algorithm of A or B takes more time to execute? more space? 6. Describe concepts and methods. E.g. Describe top down design. Describe what big O notation is. Why we use it? When do we use it?
2 1020_1030_testquestions.text Wed Sep 10 10:40: The following questions and problems have been given on previous tests. This list should give you a better idea of what to expect on future tests. You will have to examine each question and decide if the coresponding topic is addressed in this course. The questions are a subset of test questions used over the previous 20 years, not all topics are covered in any particular year. 1. Assume that real numbers are represented by: (1) a +/- sign for the number; (2) 3 decimal digits for the mantissa (fraction part); and, (3) 2 decimal digits for the exponent, using excess 50 to represent positive and negative exponents. In each part below give examples of two real non zero numbers A and B representable in the above system which show the statement to be TRUE. 1a) A + B = A 1b) A+B underflows 1c) Sum of A copies of 1/A is not equal to 1. A must be positive. 1d) (X+Y) + Z <> (X+Z) + Y 1e) A * (1/A) <> 1 1f) A+B overflows 2a) Draw a syntax diagram of the Pascal xxx statement. 2b) Give a BNF definition of the Pascal xxx statement. Where xxx is any of the statement types in Pascal. For example, CASE, FOR, WHILE, REPEAT...UNTIL, etc. 3. Describe the semantics of the statement in Question Study the following logic frames for a Pascal program. No additional declarations of variables of any type are to be made. PROGRAM FOUR (INPUT, OUTPUT) ; {Logic Frame 1} VAR A : INTEGER ; PROCEDURE ONE ; VAR B : REAL ; BEGIN... END {ONE} PROCEDURE TWO ; VAR C : REAL ; PROCEDURE THREE ; VAR D : INTEGER ; BEGIN... END {THREE} BEGIN... END {TWO} BEGIN... END {FOUR} PROGRAM ONE (INPUT, OUTPUT) ; {Logic Frame 2} VAR A : INTEGER ; PROCEDURE THREE ; VAR B : REAL ; PROCEDURE FOUR ; VAR D : INTEGER ; BEGIN... END {FOUR}
3 1020_1030_testquestions.text Wed Sep 10 10:40: BEGIN... END {THREE} PROCEDURE TWO ; VAR C : REAL ; BEGIN... END {TWO} BEGIN... END {ONE} For the programs and procedures named on the first line below, list all identifiers satisfying the criteria specified on the left. ONE TWO THREE FOUR Local Identifiers Global Identifiers Referencable Variables Referencable Procedures 5a) Explain the meaning of the terms CALL BY VALUE, CALL BY ADDRESS, and CALL BY NAME. 5b) In the example programs given below: What is the value printed for X under CALL BY VALUE? What is the value printed for X under CALL by ADDRESS? MAIN PROGRAM - 1 MAIN PROGRAM - 2 X := 2 ; Y := 4 ; A := 6 A := 2 ; Y := 4 ; X := 6 testcase ( X, A+X, Y, Y ) testcase ( Y, A+X, Y, X ) print X print X END END SUBPROGRAM - 1 SUBPROGRAM - 2 testcase ( A, B, X, Y ) testcase ( X, B, Y, A ) Y := A + Y - B Y := A + Y - B A := X * Y A := X * Y END END 6. What is the definition of an abstract data type? 7. Describe three different Pascal data types from the perspective of abstract data types. 8. Describe what the PCL command in the Computer Science VAX operating system does. 9. Classify and describe in English, including examples of type declarations, the Pascal data types covered to date.
4 1020_1030_testquestions.text Wed Sep 10 10:40: Explain what is meant by side effects. Give an example which shows why side effects should be avoided. 11. Explain what is meant by recursive programming. Give an example of a recursive subprogram in Pascal and describe with comments what the program is doing. 12. Describe sequential files in Pascal as an abstract data type. 13. Describe the components of a structured Pascal program. Consider all the different aspects of a program from the top down. Cover each aspect to about the same level of detail. 14. Describe a typical structure of a recursive program. 15. Describe the set of appropriateness questions which a programmer should consider in the decomposition of a program into the standard components: sequence, decision, loop. 16. Describe a general template (logic frame) showing how a programmer would handle the input of data from sequential files. 17. For mathematical algorithms dealing with real numbers define and describe: a) roundoff errors d) overflow b) truncation errors e) underflow c) representation errors 18. Describe the syntax and semantics of syntax diagrams, include an example. 19. Contrast the use of the REPEAT Statement with that of the WHILE statement 20. Describe the main features of block structuring in a programming language such as Pascal (Consider the scope of variables). 21a. Define and describe in general terms what is an Abstract Data Type. b. Why is an Abstract Data Type a useful concept? 22. Describe with an annotated Pascal program the input and output processing of text files. 23a. In Pascal what is a pointer type? b. Why are pointers useful in a programming language? c. What operations can and cannot be performed with pointer variables in Pascal. 24a. Describe the types of subprograms in Pascal. b. Describe the linkage between formal and actual parameters in Pascal. 25. The following two algorithms both describe how to behave when approaching traffic signals. {From Goldschlager p68.}
5 1020_1030_testquestions.text Wed Sep 10 10:40: IF signal is working THEN IF signal is red or signal is amber THEN stop ELSE proceed IF signal is working THEN IF signal is red or signal is amber THEN stop ELSE proceed In what circumstances do the algorithms describe different behaviour? Which algorithm do you consider the more satisfactory? 26. Write Pascal expressions using ORD and CHR functions to duplicate the effects of PRED and SUCC with CHAR arguments. Include descriptive and explanatory comments. {From Cooper p52.} 27. Write a segment of Pascal code to reverse the case (change lower case to upper case, and upper case to lower case) for all of the alphabetic characters in word (defined below). Include descriptive and explanatory comments. Assume the following have been defined: ; VAR word : PACKED ARRAY [1..max] OF CHAR wi : 1..max {Index to the characters in word.} 28. Explain what is meant by the notation O( f(n) ) when referring to the time or space requirements of an algorithm. 29. If an algorithm requires a time T(n) = O(2*n) to execute, show that T(n) = O(n). 30. Demonstrate that if an algorithm consists of two sequential steps A ::= A1 ; A2 and if the time to do A1 is T(n) = O(n**2) and the time to do A2 is T(n) = (n log n), then the time to do A is T(n) = O(n**2). 31. What conditions must exist before a binary search algorithm can be used? 32. What conditions force one to use a linear search algorithm? 33. Demonstrate and describe why linear search is an O(n) algorithm and binary search is an O(n log n) algorithm. 34. Demonstrate why merge sort is considered to be an O(n log n) algorithm. How do its best and worst cases compare. 35. Demonstrate why quicksort is considered to be an O(n log n) algorithm. How do its best and worst cases compare. Explain. 36. Quicksort requires the use of a stack to remember which partitions remain to be sorted. How can one ensure that the stack will not require more
6 1020_1030_testquestions.text Wed Sep 10 10:40: than (log n) entries? 37. Describe under what conditions one would use an O(n**2) sorting algorithm when O(n log n) algorithms are in general considered to be faster. 38. Given a list of n numbers and a pivot value, pv, show with a series of annotated diagrams how the partition algorithm in quicksort does its work. 39. Describe, and give examples, of what is meant by infix, postfix and prefix notations. 40. Describe with commented pseudo code how one converts from infix to (a) postfix, (b) prefix. 41. Describe with commented pseudo code how one converts from postfix (or prefix) to fully parenthesized infix notation. 42. Given a set of expressions in infix, postfix and prefix forms convert to the other two forms. 43. Compare and contrast the notions of compilation and interpretation. 44. Write commented program segments in Pascal for: stacks : array representation - push and pop operations. list representation queues : array representation - add and take operations. list representation dequeues : as for queues. singly linked lists and doubly linked lists insert new element delete an element 45. Compare and constrast the stack and queue data structures. When would they be used? 46. Under what circumstances is it preferable to use doubly linked lists instead of singly linked lists. 47. Described with annotated pseudo code the standard logic frame for a search algorithm. 48. Given a set of postfix (prefix) expressions with numeric operands, evaluate the expressions. QUESTIONS ON TREES 49. Give a definition of a binary tree.
7 1020_1030_testquestions.text Wed Sep 10 10:40: Describe a logic frame for tree traversal. 51. Describe what is meant by inorder, postorder and preorder traversal of a binary tree. 52. What is meant by the terms breadth first search, and depth first search? 53. Define what is meant by a sorted binary tree. 54. Describe a logic frame for searching a sorted binary tree. 55. Describe a logic frame for adding a new leaf node to a binary tree. 56. With respect to trees define the following terms: parent node, descedent node, ancestor node, sibling node, leaf node, root node, path, path length, depth, height, degree, general tree, n ary tree, binary tree, balanced tree. 57. Describe a general tree as an abstract data type. COMPUTBILITY 58. Explain what is the Church-Turing thesis? 59. Outline in general terms two methods which are used to show that some problems are impossible to solve. 60. What is the most important property that most unsolvable problems have in common? 61. Does the unsolvability of the halting problem mean that we should not try to show an algorithm halts? Explain. 62. Describe the general operation of a Turing machine. 63. Describe the general operation of a Markov algorithm. 64. If all computational models are equivalent, why do we have different models of computers? Explain. 65. Explain what is meant by the terms: computable, partially computable, not partially computable. QUESTIONS ON RECURSION THEOREM 66. What is the recursion theorem? Explain. 67. Given the following program segment (in pseudo-pascal) with all string variables. means concatenation. A := A B C ; B := DE F G ; C := CopyAndDoubleUpQuotesIn(A) ; D := CopyAndDoubleUpQuotesIn(B) ; E := A X Y B S T C D ; Execute the above statements. Show the contents of memory for each of A, B, C, D, E in the spaces below. Each box contains exactly one character. An empty box means blank.
8 1020_1030_testquestions.text Wed Sep 10 10:40: VAR LENGTH MEMORY A etc. QUESTIONS ON COMPLEXITY Note: questions 28, 29, 30 are also in this category. 68. Discuss how we measure time and space complexity of an algorithm. What are some of the difficulties we encounter in measuring complexity? How do we get around such difficulties? 69. What is meant by the complexity of a problem? Explain. 70. Describe how we determine the complexity of a problem. 71. Explain why for sequential machines the complexity of a problem must be of O(n) or greater. 72. Describe what we mean by polynomial time and exponential time algorithms. 73. Describe what we mean by the terms: P-problems, NP-problems. Why is this considered important in computer science? 74. Describe in general terms the various ways in which we attempt to reduce complexity of an algorithm. 75. Describe the basic structures of algorithms which have complexity measures of O(f(n)) where f(n) is: constant, (log n), n, n**c, 2**n, a**n, n**n. 76. Given the fundamental O(f(n)) complexity of an algorithm what can you deduce about the way in which the algorithm is structured and how much work it does. COSC1020/30 Test - Header Page Student Number: Surname: First Name(s):
9 1020_1030_testquestions.text Wed Sep 10 10:40: COSC Introduction to Computer Science II Final Examination : April 10, 1984 Three hours : 3:30 pm to 6:30 pm Please circle the name of the instruction for your section. G. Gotshalks M. Shepherd 1. All questions are to be attempted. 2. This is a closed book test. 3. Values of the questions are indicated below: QUES MAX MARK TOTAL RAW SCORE LETTER GRADE TOT 135
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 informationR10 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 informationR13. II B. Tech I Semester Supplementary Examinations, May/June DATA STRUCTURES (Com. to ECE, CSE, EIE, IT, ECC)
SET - 1 II B. Tech I Semester Supplementary Examinations, May/June - 2016 PART A 1. a) Write a procedure for the Tower of Hanoi problem? b) What you mean by enqueue and dequeue operations in a queue? c)
More informationCS301 - 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 informationCode 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 informationINSTITUTE 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 information1) What is the primary purpose of template functions? 2) Suppose bag is a template class, what is the syntax for declaring a bag b of integers?
Review for Final (Chapter 6 13, 15) 6. Template functions & classes 1) What is the primary purpose of template functions? A. To allow a single function to be used with varying types of arguments B. To
More informationData Structures Question Bank Multiple Choice
Section 1. Fundamentals: Complexity, Algorthm Analysis 1. An algorithm solves A single problem or function Multiple problems or functions Has a single programming language implementation 2. A solution
More informationFORTH 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 information17CS33:Data Structures Using C QUESTION BANK
17CS33:Data Structures Using C QUESTION BANK REVIEW OF STRUCTURES AND POINTERS, INTRODUCTION TO SPECIAL FEATURES OF C Learn : Usage of structures, unions - a conventional tool for handling a group of logically
More informationDepartment 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 information1. Stack overflow & underflow 2. Implementation: partially filled array & linked list 3. Applications: reverse string, backtracking
Review for Test 2 (Chapter 6-10) Chapter 6: Template functions & classes 1) What is the primary purpose of template functions? A. To allow a single function to be used with varying types of arguments B.
More information12 Abstract Data Types
12 Abstract Data Types 12.1 Foundations of Computer Science Cengage Learning Objectives After studying this chapter, the student should be able to: Define the concept of an abstract data type (ADT). Define
More informationCS8391-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 information1 P a g e A r y a n C o l l e g e \ B S c _ I T \ C \
BSc IT C Programming (2013-2017) Unit I Q1. What do you understand by type conversion? (2013) Q2. Why we need different data types? (2013) Q3 What is the output of the following (2013) main() Printf( %d,
More informationPROGRAMMING IN C++ (Regulation 2008) Answer ALL questions PART A (10 2 = 20 Marks) PART B (5 16 = 80 Marks) function? (8)
B.E./B.Tech. DEGREE EXAMINATION, NOVEMBER/DECEMBER 2009 EC 2202 DATA STRUCTURES AND OBJECT ORIENTED Time: Three hours PROGRAMMING IN C++ Answer ALL questions Maximum: 100 Marks 1. When do we declare a
More informationFirst Semester - Question Bank Department of Computer Science Advanced Data Structures and Algorithms...
First Semester - Question Bank Department of Computer Science Advanced Data Structures and Algorithms.... Q1) What are some of the applications for the tree data structure? Q2) There are 8, 15, 13, and
More informationDATA 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 informationA6-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 informationPrepared By: Ms. Nidhi Solanki (Assist. Prof.) Page 1
QUESTION BANK ON COURSE: 304: PRELIMINARIES: 1. What is array of pointer, explain with appropriate example? 2 2. Differentiate between call by value and call by reference, give example. 3. Explain pointer
More informationCS8391-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 informationVALLIAMMAI ENGNIEERING COLLEGE SRM Nagar, Kattankulathur DEPARTMENT OF COMPUTER SCIENCE AND ENGINEERING QUESTION BANK
VALLIAMMAI ENGNIEERING COLLEGE SRM Nagar, Kattankulathur 603203. DEPARTMENT OF COMPUTER SCIENCE AND ENGINEERING QUESTION BANK Degree & Branch : B.E E.C.E. Year & Semester : II / IV Section : ECE 1, 2 &
More informationTREES. Trees - Introduction
TREES Chapter 6 Trees - Introduction All previous data organizations we've studied are linear each element can have only one predecessor and successor Accessing all elements in a linear sequence is O(n)
More informationTable 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 informationGUJARAT TECHNOLOGICAL UNIVERSITY COMPUTER ENGINEERING (07) / INFORMATION TECHNOLOGY (16) / INFORMATION & COMMUNICATION TECHNOLOGY (32) DATA STRUCTURES
GUJARAT TECHNOLOGICAL UNIVERSITY COMPUTER ENGINEERING () / INFMATION TECHNOLOGY (6) / INFMATION & COMMUNICATION TECHNOLOGY (32) DATA STRUCTURES Type of course: Compulsory SUBJECT CODE: 2302 B.E. 3 rd Semester
More informationR10 SET - 1. Code No: R II B. Tech I Semester, Supplementary Examinations, May
Code No: R21051 R10 SET - 1 II B. Tech I Semester, Supplementary Examinations, May - 2012 DATA STRUCTURES (Com. to CSE, IT, ECC ) Time: 3 hours Max Marks: 75 Answer any FIVE Questions All Questions carry
More informationCS 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 informationFORTH SEMESTER DIPLOMA EXAMINATION IN ENGINEERING/ TECHNOLIGY- OCTOBER, 2012 DATA STRUCTURE
TED (10)-3071 Reg. No.. (REVISION-2010) Signature. FORTH SEMESTER DIPLOMA EXAMINATION IN ENGINEERING/ TECHNOLIGY- OCTOBER, 2012 DATA STRUCTURE (Common to CT and IF) [Time: 3 hours (Maximum marks: 100)
More informationDYNAMIC MEMORY ALLOCATION AND DEALLOCATION
COURSE TITLE DATA STRUCTURE DETAILED SYLLABUS SR.NO NAME OF CHAPTERS & DETAILS HOURS ALLOTTED 1 USER DEFINED DATATYPE /STRUCTURE About structure Defining structure Accessing structure element Array of
More informationPESIT Bangalore South Campus Department of MCA Course Information for
1. GENERAL INFORMATION: PESIT Bangalore South Campus Department of MCA Course Information for Data Structures Using C(13MCA21) Academic Year: 2015 Semester: II Title Code Duration (hrs) Lectures 48 Hrs
More informationEnd-Term Examination Second Semester [MCA] MAY-JUNE 2006
(Please write your Roll No. immediately) Roll No. Paper Code: MCA-102 End-Term Examination Second Semester [MCA] MAY-JUNE 2006 Subject: Data Structure Time: 3 Hours Maximum Marks: 60 Note: Question 1.
More informationBinary Trees, Binary Search Trees
Binary Trees, Binary Search Trees Trees Linear access time of linked lists is prohibitive Does there exist any simple data structure for which the running time of most operations (search, insert, delete)
More information7.1 Introduction. A (free) tree T is A simple graph such that for every pair of vertices v and w there is a unique path from v to w
Chapter 7 Trees 7.1 Introduction A (free) tree T is A simple graph such that for every pair of vertices v and w there is a unique path from v to w Tree Terminology Parent Ancestor Child Descendant Siblings
More informationUniversity 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 informationCS 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 informationChapter 4 Trees. Theorem A graph G has a spanning tree if and only if G is connected.
Chapter 4 Trees 4-1 Trees and Spanning Trees Trees, T: A simple, cycle-free, loop-free graph satisfies: If v and w are vertices in T, there is a unique simple path from v to w. Eg. Trees. Spanning trees:
More information1. Attempt any three of the following: 15
(Time: 2½ hours) Total Marks: 75 N. B.: (1) All questions are compulsory. (2) Make suitable assumptions wherever necessary and state the assumptions made. (3) Answers to the same question must be written
More informationPreface... (vii) CHAPTER 1 INTRODUCTION TO COMPUTERS
Contents Preface... (vii) CHAPTER 1 INTRODUCTION TO COMPUTERS 1.1. INTRODUCTION TO COMPUTERS... 1 1.2. HISTORY OF C & C++... 3 1.3. DESIGN, DEVELOPMENT AND EXECUTION OF A PROGRAM... 3 1.4 TESTING OF PROGRAMS...
More informationCourse Review for. Cpt S 223 Fall Cpt S 223. School of EECS, WSU
Course Review for Midterm Exam 1 Cpt S 223 Fall 2011 1 Midterm Exam 1 When: Friday (10/14) 1:10-2pm Where: in class Closed book, closed notes Comprehensive Material for preparation: Lecture slides & in-class
More informationCS61B Lecture #20: Trees. Last modified: Wed Oct 12 12:49: CS61B: Lecture #20 1
CS61B Lecture #2: Trees Last modified: Wed Oct 12 12:49:46 216 CS61B: Lecture #2 1 A Recursive Structure Trees naturally represent recursively defined, hierarchical objects with more than one recursive
More informationPA3 Design Specification
PA3 Teaching Data Structure 1. System Description The Data Structure Web application is written in JavaScript and HTML5. It has been divided into 9 pages: Singly linked page, Stack page, Postfix expression
More informationMID 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 information17 February Given an algorithm, compute its running time in terms of O, Ω, and Θ (if any). Usually the big-oh running time is enough.
Midterm Review CSE 2011 Winter 2011 17 February 2011 1 Algorithm Analysis Given an algorithm, compute its running time in terms of O, Ω, and Θ (if any). Usually the big-oh running time is enough. Given
More informationLargest Online Community of VU Students
WWW.VUPages.com http://forum.vupages.com WWW.VUTUBE.EDU.PK Largest Online Community of VU Students MIDTERM EXAMINATION SEMESTER FALL 2003 CS301-DATA STRUCTURE Total Marks:86 Duration: 60min Instructions
More informationTrees! Ellen Walker! CPSC 201 Data Structures! Hiram College!
Trees! Ellen Walker! CPSC 201 Data Structures! Hiram College! ADTʼs Weʼve Studied! Position-oriented ADT! List! Stack! Queue! Value-oriented ADT! Sorted list! All of these are linear! One previous item;
More informationSummer Final Exam Review Session August 5, 2009
15-111 Summer 2 2009 Final Exam Review Session August 5, 2009 Exam Notes The exam is from 10:30 to 1:30 PM in Wean Hall 5419A. The exam will be primarily conceptual. The major emphasis is on understanding
More informationLec 17 April 8. Topics: binary Trees expression trees. (Chapter 5 of text)
Lec 17 April 8 Topics: binary Trees expression trees Binary Search Trees (Chapter 5 of text) Trees Linear access time of linked lists is prohibitive Heap can t support search in O(log N) time. (takes O(N)
More informationAPJ 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 informationCOMP 250 Fall binary trees Oct. 27, 2017
The order of a (rooted) tree is the maximum number of children of any node. A tree of order n is called an n-ary tree. It is very common to use trees of order 2. These are called binary trees. Binary Trees
More informationBinary Trees
Binary Trees 4-7-2005 Opening Discussion What did we talk about last class? Do you have any code to show? Do you have any questions about the assignment? What is a Tree? You are all familiar with what
More informationEE 368. Week 6 (Notes)
EE 368 Week 6 (Notes) 1 Expression Trees Binary trees provide an efficient data structure for representing expressions with binary operators. Root contains the operator Left and right children contain
More informationAn Introduction to Trees
An Introduction to Trees Alice E. Fischer Spring 2017 Alice E. Fischer An Introduction to Trees... 1/34 Spring 2017 1 / 34 Outline 1 Trees the Abstraction Definitions 2 Expression Trees 3 Binary Search
More informationRevision Statement while return growth rate asymptotic notation complexity Compare algorithms Linear search Binary search Preconditions: sorted,
[1] Big-O Analysis AVERAGE(n) 1. sum 0 2. i 0. while i < n 4. number input_number(). sum sum + number 6. i i + 1 7. mean sum / n 8. return mean Revision Statement no. of times executed 1 1 2 1 n+1 4 n
More informationSample Question Paper
Scheme - I Sample Question Paper Marks : 70 Time: 3 Hrs. Q.1) Attempt any FIVE of the following. 10 Marks a. Write any four applications of data structure. b. Sketch the diagram of circular queue. c. State
More informationMarch 20/2003 Jayakanth Srinivasan,
Definition : A simple graph G = (V, E) consists of V, a nonempty set of vertices, and E, a set of unordered pairs of distinct elements of V called edges. Definition : In a multigraph G = (V, E) two or
More informationCS61B Lecture #20: Trees. Last modified: Mon Oct 8 21:21: CS61B: Lecture #20 1
CS61B Lecture #20: Trees Last modified: Mon Oct 8 21:21:22 2018 CS61B: Lecture #20 1 A Recursive Structure Trees naturally represent recursively defined, hierarchical objects with more than one recursive
More informationCourse Review for Finals. Cpt S 223 Fall 2008
Course Review for Finals Cpt S 223 Fall 2008 1 Course Overview Introduction to advanced data structures Algorithmic asymptotic analysis Programming data structures Program design based on performance i.e.,
More informationLecture 26. Introduction to Trees. Trees
Lecture 26 Introduction to Trees Trees Trees are the name given to a versatile group of data structures. They can be used to implement a number of abstract interfaces including the List, but those applications
More information6-TREE. Tree: Directed Tree: A directed tree is an acyclic digraph which has one node called the root node
6-TREE Data Structure Management (330701) Tree: A tree is defined as a finite set of one or more nodes such that There is a special node called the root node R. The remaining nodes are divided into n 0
More informationCSI33 Data Structures
Outline Department of Mathematics and Computer Science Bronx Community College November 13, 2017 Outline Outline 1 C++ Supplement.1: Trees Outline C++ Supplement.1: Trees 1 C++ Supplement.1: Trees Uses
More informationLecture Notes 16 - Trees CSS 501 Data Structures and Object-Oriented Programming Professor Clark F. Olson
Lecture Notes 16 - Trees CSS 501 Data Structures and Object-Oriented Programming Professor Clark F. Olson Reading: Carrano, Chapter 15 Introduction to trees The data structures we have seen so far to implement
More informationVisit ::: 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 informationFINALTERM 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 informationDS ata Structures Aptitude
DS ata Structures Aptitude 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
More informationTree. A path is a connected sequence of edges. A tree topology is acyclic there is no loop.
Tree A tree consists of a set of nodes and a set of edges connecting pairs of nodes. A tree has the property that there is exactly one path (no more, no less) between any pair of nodes. A path is a connected
More informationCE 221 Data Structures and Algorithms
CE 221 Data Structures and Algorithms Chapter 4: Trees (Binary) Text: Read Weiss, 4.1 4.2 Izmir University of Economics 1 Preliminaries - I (Recursive) Definition: A tree is a collection of nodes. The
More informationDEPARTMENT OF COMPUTER SCIENCE AND ENGINEERING B.E SECOND SEMESTER CS 6202 PROGRAMMING AND DATA STRUCTURES I TWO MARKS UNIT I- 2 MARKS
DEPARTMENT OF COMPUTER SCIENCE AND ENGINEERING B.E SECOND SEMESTER CS 6202 PROGRAMMING AND DATA STRUCTURES I TWO MARKS UNIT I- 2 MARKS 1. Define global declaration? The variables that are used in more
More informationStacks, Queues and Hierarchical Collections
Programming III Stacks, Queues and Hierarchical Collections 2501ICT Nathan Contents Linked Data Structures Revisited Stacks Queues Trees Binary Trees Generic Trees Implementations 2 Copyright 2002- by
More informationCpt S 122 Data Structures. Course Review Midterm Exam # 1
Cpt S 122 Data Structures Course Review Midterm Exam # 1 Nirmalya Roy School of Electrical Engineering and Computer Science Washington State University Midterm Exam 1 When: Friday (09/28) 12:10-1pm Where:
More informationIntroduction to Computers and Programming. Concept Question
Introduction to Computers and Programming Prof. I. K. Lundqvist Lecture 7 April 2 2004 Concept Question G1(V1,E1) A graph G(V, where E) is V1 a finite = {}, nonempty E1 = {} set of G2(V2,E2) vertices and
More informationINF2220: algorithms and data structures Series 1
Universitetet i Oslo Institutt for Informatikk I. Yu, D. Karabeg INF2220: algorithms and data structures Series 1 Topic Function growth & estimation of running time, trees Issued: 24. 08. 2016 Exercise
More informationE.G.S. PILLAY ENGINEERING COLLEGE (An Autonomous Institution, Affiliated to Anna University, Chennai) Nagore Post, Nagapattinam , Tamilnadu.
17CA 104DATA STRUCTURES Academic Year : 018-019 Programme : MCA Year / Semester : I / I Question Bank Course Coordinator: Mrs. C.Mallika Course Objectives The student should be able to 1. To understand
More informationCS61B Lecture #20. Today: Trees. Readings for Today: Data Structures, Chapter 5. Readings for Next Topic: Data Structures, Chapter 6
CS61B Lecture #20 Today: Trees Readings for Today: Data Structures, Chapter 5 Readings for Next Topic: Data Structures, Chapter 6 Last modified: Wed Oct 14 03:20:09 2015 CS61B: Lecture #20 1 A Recursive
More informationVALLIAMMAI ENGINEERING COLLEGE
VALLIAMMAI ENGINEERING COLLEGE SRM Nagar, Kattankulathur 603 203 DEPARTMENT OF INFORMATION TECHNOLOGY QUESTION BANK III SEMESTER CS8391-Data Structures Regulation 2017 Academic Year 2018 19(odd Semester)
More informationTopics. Trees Vojislav Kecman. Which graphs are trees? Terminology. Terminology Trees as Models Some Tree Theorems Applications of Trees CMSC 302
Topics VCU, Department of Computer Science CMSC 302 Trees Vojislav Kecman Terminology Trees as Models Some Tree Theorems Applications of Trees Binary Search Tree Decision Tree Tree Traversal Spanning Trees
More informationCOSC 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 informationBasic Data Structures (Version 7) Name:
Prerequisite Concepts for Analysis of Algorithms Basic Data Structures (Version 7) Name: Email: Concept: mathematics notation 1. log 2 n is: Code: 21481 (A) o(log 10 n) (B) ω(log 10 n) (C) Θ(log 10 n)
More informationData Structures. Chapter 06. 3/10/2016 Md. Golam Moazzam, Dept. of CSE, JU
Data Structures Chapter 06 1 Stacks A stack is a list of elements in which an element may be inserted or deleted only at one end, called the top of the stack. This means that elements are removed from
More informationIntroduction p. 1 Pseudocode p. 2 Algorithm Header p. 2 Purpose, Conditions, and Return p. 3 Statement Numbers p. 4 Variables p. 4 Algorithm Analysis
Introduction p. 1 Pseudocode p. 2 Algorithm Header p. 2 Purpose, Conditions, and Return p. 3 Statement Numbers p. 4 Variables p. 4 Algorithm Analysis p. 5 Statement Constructs p. 5 Pseudocode Example p.
More information( ) + n. ( ) = n "1) + n. ( ) = T n 2. ( ) = 2T n 2. ( ) = T( n 2 ) +1
CSE 0 Name Test Summer 00 Last Digits of Student ID # Multiple Choice. Write your answer to the LEFT of each problem. points each. Suppose you are sorting millions of keys that consist of three decimal
More informationObjective Questions for Online Practical Exams under CBCS Scheme Subject: Data Structure-I (CS-113)
Objective Questions for Online Practical Exams under CBCS Scheme Subject: Data Structure-I (CS-113) 1. The number of interchanges required to sort 5, 1, 6, 2 4 in ascending order using Bubble Sort (A)
More informationTotal No. of Questions :09] [Total No. of Pages : 02. II/IV B.Tech. DEGREE EXAMINATIONS, NOV/DEC First Semester CSE/IT DATA STRUCTURES USING C
CSE/IT 216 (CR) Total No. of Questions :09] [Total No. of Pages : 02 Time: Three Hours 1. a. ADT II/IV B.Tech. DEGREE EXAMINATIONS, NOV/DEC- 2015 First Semester CSE/IT DATA STRUCTURES USING C Answer Question
More informationFundamentals of Data Structure
Fundamentals of Data Structure Set-1 1. Which if the following is/are the levels of implementation of data structure A) Abstract level B) Application level C) Implementation level D) All of the above 2.
More informationUNIVERSITY OF WATERLOO DEPARTMENT OF ELECTRICAL AND COMPUTER ENGINEERING ECE ALGORITHMS AND DATA STRUCTURES Total:
UNIVERSITY OF WATERLOO DEPARTMENT OF ELECTRICAL AND COMPUTER ENGINEERING ECE 250 - ALGORITHMS AND DATA STRUCTURES Final Examination Instructor:R.E.Seviora December 9, 1999, 2-5 PM Name: Student id: 1 2
More informationMIDTERM EXAMINATION Spring 2010 CS301- Data Structures
MIDTERM EXAMINATION Spring 2010 CS301- Data Structures Question No: 1 Which one of the following statement is NOT correct. In linked list the elements are necessarily to be contiguous In linked list the
More informationCS 445: Data Structures Final Examination: Study Guide
CS 445: Data Structures Final Examination: Study Guide Java prerequisites Classes, objects, and references Access modifiers Arguments and parameters Garbage collection Self-test questions: Appendix C Designing
More informationCS302 Data Structures using C++
CS302 Data Structures using C++ Study Guide for the Final Exam Fall 2018 Revision 1.1 This document serves to help you prepare towards the final exam for the Fall 2018 semester. 1. What topics are to be
More informationComputer Science Foundation Exam. Dec. 19, 2003 COMPUTER SCIENCE I. Section I A. No Calculators! KEY
Computer Science Foundation Exam Dec. 19, 2003 COMPUTER SCIENCE I Section I A No Calculators! Name: KEY SSN: Score: 50 In this section of the exam, there are Three (3) problems You must do all of them.
More informationCSE 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 informationCOMP-421 Compiler Design. Presented by Dr Ioanna Dionysiou
COMP-421 Compiler Design Presented by Dr Ioanna Dionysiou Administrative! Any questions about the syllabus?! Course Material available at www.cs.unic.ac.cy/ioanna! Next time reading assignment [ALSU07]
More informationData Structure. IBPS SO (IT- Officer) Exam 2017
Data Structure IBPS SO (IT- Officer) Exam 2017 Data Structure: In computer science, a data structure is a way of storing and organizing data in a computer s memory so that it can be used efficiently. Data
More informationMLR Institute of Technology
MLR Institute of Technology Laxma Reddy Avenue, Dundigal, Quthbullapur (M), Hyderabad 500 043 Phone Nos: 08418 204066 / 204088, Fax : 08418 204088 TUTORIAL QUESTION BANK Course Name : DATA STRUCTURES Course
More informationStacks, Queues and Hierarchical Collections. 2501ICT Logan
Stacks, Queues and Hierarchical Collections 2501ICT Logan Contents Linked Data Structures Revisited Stacks Queues Trees Binary Trees Generic Trees Implementations 2 Queues and Stacks Queues and Stacks
More informationTrees. (Trees) Data Structures and Programming Spring / 28
Trees (Trees) Data Structures and Programming Spring 2018 1 / 28 Trees A tree is a collection of nodes, which can be empty (recursive definition) If not empty, a tree consists of a distinguished node r
More informationINSTITUTE OF AERONAUTICAL ENGINEERING (Autonomous) Dundigal, Hyderabad
INSTITUTE OF AERONAUTICAL ENGINEERING (Autonomous) Dundigal, Hyderabad -500 043 COMPUTER SCIENCE AND ENGINEERING TUTORIAL QUESTION BANK Course Name : DATA STRUCTURES Course Code : A30502 Class : II B.
More informationData Structure (CS301)
WWW.VUPages.com http://forum.vupages.com WWW.VUTUBE.EDU.PK Largest Online Community of VU Students Virtual University Government of Pakistan Midterm Examination Spring 2003 Data Structure (CS301) StudentID/LoginID
More informationSection Summary. Introduction to Trees Rooted Trees Trees as Models Properties of Trees
Chapter 11 Copyright McGraw-Hill Education. All rights reserved. No reproduction or distribution without the prior written consent of McGraw-Hill Education. Chapter Summary Introduction to Trees Applications
More informationI 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& ( D. " mnp ' ( ) n 3. n 2. ( ) C. " n
CSE Name Test Summer Last Digits of Mav ID # Multiple Choice. Write your answer to the LEFT of each problem. points each. The time to multiply two n " n matrices is: A. " n C. "% n B. " max( m,n, p). The
More informationUpcoming ACM Events Linux Crash Course Date: Time: Location: Weekly Crack the Coding Interview Date:
Upcoming ACM Events Linux Crash Course Date: Oct. 2nd and 3rd Time: 1:15 pm - 3:15 pm Location: UW1-210 (10/02) and UW1-221 (10/03) Weekly Crack the Coding Interview Date: Weekly Fridays from Oct. 5th
More information