Data Structures and Algorithms Winter term 2006/2007 Final Exam
|
|
- Victor Wells
- 5 years ago
- Views:
Transcription
1 Page 0 German University in Cairo Winter 2006/2007 Computer Science Department Prof. Dr. Slim Abdennadher Data Structures and Algorithms Winter term 2006/2007 Final Exam Bar Code Instructions: Read carefully before proceeding. 1) Duration of the exam: 3 hours (180 minutes). 2) (Non-programmable) Calculators are allowed. 3) No books or other aids are permitted for this test. 4) This exam booklet contains 15 pages, including this one. Three extra sheets of scratch paper are attached and have to be kept attached. Note that if one or more pages are missing, you will lose their points. Thus, you must check that your exam booklet is complete. 5) Write your solutions in the space provided. If you need more space, write on the back of the sheet containing the problem or on the three extra sheets and make an arrow indicating that. Scratch sheets will not be graded unless an arrow on the problem page indicates that the solution extends to the scratch sheets. 6) When you are told that time is up, stop working on the test. Good Luck! Don t write anything below;-) Exercise Marks Final Marks
2 Data Structures and Algorithms, Final Exam, Winter 2006/2007 Page 1 Exercise 1 (6 Marks) a) True or False? Justify your answer. Searching for a valuexin a binary search tree is always faster than searching for the same value in a binary tree. False: A binary search tree could be a linear tree with search in O(n) which is the same as search in a binary tree. b) Give one reason why it is helpful for a programmer to think in terms of Abstract Data Types (ADT). It is better to think in terms of ADT because this will eliminate the overhead of how a certain Data structure is implemented, we do not care about its implementation, but instead we only care about the Interface that we are going to use. c) A List ADT can be implemented using either an array or a linked-list. Give one advantage for each implementation. An advantage of using a linked-list is that, unlike an array, it is not restricted to a size that cannot be changed after its creation, which means that a link-list is more useful when the size of the data is not known at the time of creation of the data structure. An advantage of using an array is having a random access time of O(1), which is useful when frequent random access to individual elements using an index is needed.
3 Data Structures and Algorithms, Final Exam, Winter 2006/2007 Page 2 Exercise 2 (10 Marks) Consider the following problem. You are given an array ofnnumbers. The array contains only0 s and1 s, and it is sorted in increasing order. For example, the array might bea = [0, 0, 0, 0, 0, 0, 1, 1, 1]. a) Write an algorithm that prints the indexiat which the numbers switch from0 s to1 s, i.e.a[i] = 0 and A[i + 1] = 1. In the example above, it should print"5", as A[5] = 0 and A[6] = 1. public static void print(int[]a) for(int i=0;i<a.length;i++) if(a[i] == 1) System.out.println(i-1); break; b) What is the time complexity of your implementation in parta)? O(n) c) If the time complexity of your algorithm is O(n) or worse, describe in one short sentence a modification to your algorithm that will perform in better that O(n). We can use the concept of binary search so that we check the middle of the array, if it is a zero and the next value is 1 we print the current index, if it is a zero and the next value is zero too then we binary search the right half of the array, otherwise we binary search the left half.
4 Data Structures and Algorithms, Final Exam, Winter 2006/2007 Page 3 Exercise 3 (10 Marks) Write a methodislegal(strings) that takes as argument a Stringsand checks if it is a legal postfix expression. For example: is legal. * 5 4 is not legal / + is not legal. You are required to use stacks to implement your method. public static boolean islegal(string s) Stack operands = new Stack(); for(int i=0; i < s.length(); i++) if(character.isdigit(s.charat(i))) operands.push(1); else if(operands.isempty()) return false; operands.pop(); if(operands.isempty()) return false; if(operands.isempty()) return false; operands.pop(); return operands.isempty();
5 Data Structures and Algorithms, Final Exam, Winter 2006/2007 Page 4 Exercise 4 (6 Marks) a) What does the following code fragment print? int [] a = new int[3]; IntQueueq=new IntQueue(); for (int b : a) q.enqueue(b); while(!q.isempty()) for (int i = 2; i > q.peek();i--) q.enqueue(q.dequeue()); System.out.println(q.dequeue()); b) What does the following code fragment print? IntQueueq=new IntQueue(); q.enqueue(0); q.enqueue(0); q.enqueue(0); for (int i = 0; i < 8; i++) int c = q.dequeue(); int b = q.dequeue(); int a = q.dequeue(); System.out.println(a+ " " + b + " " + c); c++; b += c / 2; a += b / 2; c = c % 2; b = b % 2; a = a % 2; q.enqueue(c); q.enqueue(b); q.enqueue(a);
6 Data Structures and Algorithms, Final Exam, Winter 2006/2007 Page 5 Exercise 5 (10 Marks) a) Why is a Binary Search Tree called Binary? Why is it convenient for searching? A tree where each node has no more than 2 children is called binary. The search tree is convenient because at each node you can select which of the two branches to search and completely eliminate the other - the tree is organized so that one side is always greater, the other less, than the current node. If the tree is full and balanced, then you effectively halve the search area with each step, eliminating one or the other subtree. b) Given the following inputs sequence Construct the corresponding binary search tree by inserting the elements of the sequence starting from left to right Redraw the tree when Node 63 is deleted from the tree
7 Data Structures and Algorithms, Final Exam, Winter 2006/2007 Page 6 Exercise 6 Suppose that linked lists of integers are made from objects belonging to the class (12 Marks) class Node int item; Node next; The linked list is defined as follows class LinkedList public Node first; public LinkedList() first = null; a) Write a methodvoid organize(inti) that will modifythis list, with the elements starting at indexibeing split in half. The first half should be placed at the beginning of the list and the second half at the end of the list. For example, given the list[1, 2, 3, 4, 5, 6, 7] andi = 3, the list should be modified to[4, 5, 1, 2, 3, 6, 7]. Do not assume the existence of any methods. public void organize(int i) // solutionfor 0 < i < size - 1 Node current = first; int size; for(size = 0; current!= null; size++) current = current.next; Node a = first,b=first; for(intj=1; j < i; j++) a = a.next; for(intj=1; j < i + ((size-i) / 2); j++) b = b.next; Node oldfirst = first; first = a.next; a.next = b.next; b.next = oldfirst; b) Re-implement the method organize given that you now supposed to return a new linked list with the required organization and that you are allowed to use the methods insertfirst, insertlast, removefirst, andremovelast of the classlinkedlist. public static LinkedList organize(linkedlist l, int i) LinkedList temp = new LinkedList(); int size = 0; while(!l.isempty())
8 Data Structures and Algorithms, Final Exam, Winter 2006/2007 Page 7 size++; temp.insertlast(l.deletefirst().item); for(intj=0; j < i; j++) l.insertlast(temp.deletefirst().item); LinkedList t = new LinkedList(); for(intj=0; j < (size - i) / 2; j++) t.insertlast(temp.deletefirst().item); for(intj=0; j < (size - i) / 2; j++) l.insertfirst(t.deletelast().item); while(!temp.isempty()) l.insertlast(temp.deletefirst().item); return l;
9 Data Structures and Algorithms, Final Exam, Winter 2006/2007 Page 8 Exercise 7 (10 Marks) A Quaternary Search Tree is search tree where each node has at most four children. This tree will be used to store information aboutbooks that are located on a block of shelves in a bookstore. A book has to be to the right,left,above, orbelow any other book. Given that a methodint locate(bookx, Book y) will return one of the values1, 2, 3, 4 meaning that bookyis located to theright,left,above, below compared to bookx. Assuming that the time complexity of thelocate method is O(1) and that books are stored in the Quaternary Search Tree using the same concept that is used to store integer values in a binary search tree. Answer the following questions: a) What is the worst case time complexity of searching for a book in a Quaternary Search Tree? O(n) b) What is the worst case time complexity of searching for a book in a Quaternary Search Tree with an ideal topology, which is defined similarly as the ideal topology of binary search trees presented in class? O(log n) c) Assuming that the root of the tree is at level 0 and its children are at level 1, what is the maximum number of books that can be stored at level 3? 64
10 Data Structures and Algorithms, Final Exam, Winter 2006/2007 Page 9 Exercise 8 (8 Marks) a) For a binary search tree (BST) with n items, what is the worse-case running time to find the maximum difference between any two elements? Justify your answer. Does the running time depend on whether the binary search tree is balanced? Say why or why not. To find the maximum difference, sufficient to find the minimum element in the BST, the maximum element in the BST and compute their difference. Running time depends on the worst-case depth of the minimum and maximum elements in the BST. Worst case running time for an unbalanced BST is O(n) Worst case running time for a balanced BST is O(log(n)) b) Add an instance method to thebinarysearchtree class that swaps all nodes to the right of the root with all nodes to the left of the root. Does the resulting tree satifies a similar property like the binary search tree presented in the lecture. public void swap() if(root!= null) Node temp = root.left; root.left = root.right; root.right = temp;
11 Data Structures and Algorithms, Final Exam, Winter 2006/2007 Page 10 Exercise 9 Write a static recursive method (8 Marks) public static boolean sameshape(tree x, Tree y) that takes two tree references as inputs and determines whether they have the same tree shape and pointer structure. public static boolean sameshape(tree t1, Tree t2) return(sameshape(t1.root,t2.root)); public static boolean sameshape(node x, Node y) if (x == null && y == null)returntrue; // both null if (x == null y == null)returnfalse; // exactlyone null return sameshape(x.left, y.left)&& sameshape(x.right, y.right);
12 Data Structures and Algorithms, Final Exam, Winter 2006/2007 Page 11 Exercise 10 (8 Marks) In an attempt to describe a family tree we would like to modify the tree implementation presented in class in order to make nodes represent persons. Each person should be allowed to have an arbitrary (not predefined) number of children and also have a spouse (another person to which the person is married). a) What are the instance variables needed to implement the family tree described above? We need two more instance variable: A reference to the spouse A reference to an array (or some other data structure) of children class Node Node spouse; Node [] children; b) Implement a boolean method that checks if every node in the tree and its spouse have the same children. public boolean check(node c) if(c!= null) Node s = c.spouse; if(s!=null) if(c.children!= s.children) return false; for(inti=0; i < c.children.length;i++) if(check(c.children[i]) == false) return false; return true; c) Implement a boolean method that checks if two given nodes are siblings, i.e. have the same parent. public Node find(node p, Node c) if(p!= null) if(p.children!= null) for(inti=0; i < p.children.length;i++) if(c == p.children[i]) return p; for(inti=0; i < p.children.length;i++) Node x = find(p.children[i], c); if(x!= null) returnx;
13 Data Structures and Algorithms, Final Exam, Winter 2006/2007 Page 12 return null; public boolean siblings(node c1, Node c2) Node p1 = find(root, c1); Node p2 = find(root, c2); if(p1 == p2) return true; else return false;
14 Data Structures and Algorithms, Final Exam, Winter 2006/2007 Page 13 Exercise 11 (10 Marks) Consider inserting the keys 104, 221, 316, 444, 6042, 281, 174, 880, 442, 253 into a hash table of sizeb = 12 and using the hash function h(x)=sum-of-digitis(x)%b. Use a strategy of your choice to resolve further collisions. The function sum-of-digits(n) will sum up the digits of n. For example, if n = 221, then sum-of-digits(221) = 2+2+1=5. a) What is the strategy that you will use for resolving collisions? Explain the strategy in few words. Linear Probing b) Insert the keys in the given order in the hash table below
15 Data Structures and Algorithms, Final Exam, Winter 2006/2007 Page 14 Extra Sheet
16 Data Structures and Algorithms, Final Exam, Winter 2006/2007 Page 15 Extra Sheet
17 Data Structures and Algorithms, Final Exam, Winter 2006/2007 Page 16 Extra Sheet
Data Structures and Algorithms Winter Semester
Page 0 German University in Cairo October 24, 2018 Media Engineering and Technology Faculty Prof. Dr. Slim Abdennadher Dr. Wael Abouelsadaat Data Structures and Algorithms Winter Semester 2018-2019 Midterm
More informationCSEN202: Introduction to Computer Science Spring Semester 2017 Midterm Exam
Page 0 German University in Cairo April 6, 2017 Media Engineering and Technology Faculty Prof. Dr. Slim Abdennadher CSEN202: Introduction to Computer Science Spring Semester 2017 Midterm Exam Bar Code
More informationData Structures and Algorithms Winter term 2016
Page 0 German University in Cairo December 26, 2016 Media Engineering and Technology Prof. Dr. Slim Abdennadher Dr. Wael Abouelsaadat Data Structures and Algorithms Winter term 2016 Final Exam Bar Code
More informationCSEN 202: Introduction to Computer Programming Spring term Final Exam
Page 0 German University in Cairo May 28, 2016 Media Engineering and Technology Prof. Dr. Slim Abdennadher Dr. Wael Aboul Saadat CSEN 202: Introduction to Computer Programming Spring term 2015-2016 Final
More informationData Structures and Algorithms Winter term 2012
Page 0 German University in Cairo November 4, 2012 Faculty of Media Engineering and Technology Prof. Dr. Slim Abdennadher Data Structures and Algorithms Winter term 2012 Midterm Exam Bar Code Instructions:
More informationINF2220: algorithms and data structures Series 1
Universitetet i Oslo Institutt for Informatikk A. Maus, R.K. Runde, I. Yu INF2220: algorithms and data structures Series 1 Topic Trees & estimation of running time (Exercises with hints for solution) Issued:
More informationModule 4: Index Structures Lecture 13: Index structure. The Lecture Contains: Index structure. Binary search tree (BST) B-tree. B+-tree.
The Lecture Contains: Index structure Binary search tree (BST) B-tree B+-tree Order file:///c /Documents%20and%20Settings/iitkrana1/My%20Documents/Google%20Talk%20Received%20Files/ist_data/lecture13/13_1.htm[6/14/2012
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 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 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 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 informationSecond 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- 1 - Handout #22S May 24, 2013 Practice Second Midterm Exam Solutions. CS106B Spring 2013
CS106B Spring 2013 Handout #22S May 24, 2013 Practice Second Midterm Exam Solutions Based on handouts by Eric Roberts and Jerry Cain Problem One: Reversing a Queue One way to reverse the queue is to keep
More informationCS134 Spring 2005 Final Exam Mon. June. 20, 2005 Signature: Question # Out Of Marks Marker Total
CS134 Spring 2005 Final Exam Mon. June. 20, 2005 Please check your tutorial (TUT) section from the list below: TUT 101: F 11:30, MC 4042 TUT 102: M 10:30, MC 4042 TUT 103: M 11:30, MC 4058 TUT 104: F 10:30,
More informationCOMP 250 Midterm #2 March 11 th 2013
NAME: STUDENT ID: COMP 250 Midterm #2 March 11 th 2013 - This exam has 6 pages - This is an open book and open notes exam. No electronic equipment is allowed. 1) Questions with short answers (28 points;
More informationCMPSCI 187: Programming With Data Structures. Review for Final Exam David Mix Barrington 10 December 2012
CMPSCI 187: Programming With Data Structures Review for Final Exam David Mix Barrington 10 December 2012 Exam Overview Thursday 13 December, 1:30-3:30 p.m., Marcus 131 Format is the same as the Fall 2011
More informationTrees 2: Linked Representation, Tree Traversal, and Binary Search Trees
Trees 2: Linked Representation, Tree Traversal, and Binary Search Trees Linked representation of binary tree Again, as with linked list, entire tree can be represented with a single pointer -- in this
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 informationCMPSCI 187: Programming With Data Structures. Lecture #28: Binary Search Trees 21 November 2011
CMPSCI 187: Programming With Data Structures Lecture #28: Binary Search Trees 21 November 2011 Binary Search Trees The Idea of a Binary Search Tree The BinarySearchTreeADT Interface The LinkedBinarySearchTree
More informationData Structures and Algorithms, Winter term 2017 Practice Assignment 10
German University in Cairo Media Engineering and Technology Prof. Dr. Slim Abdennadher Dr. Wael Abouelsaadat Data Structures and Algorithms, Winter term 2017 Practice Assignment 10 Exercise 10-1 Traversal
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 informationAnnouncements. Midterm exam 2, Thursday, May 18. Today s topic: Binary trees (Ch. 8) Next topic: Priority queues and heaps. Break around 11:45am
Announcements Midterm exam 2, Thursday, May 18 Closed book/notes but one sheet of paper allowed Covers up to stacks and queues Today s topic: Binary trees (Ch. 8) Next topic: Priority queues and heaps
More informationCSE373 Winter 2014, Midterm Examination January 29, 2014
CSE373 Winter 2014, Midterm Examination January 29, 2014 Please do not turn the page until the bell rings. Rules: The exam is closed-book, closed-note, closed calculator, closed electronics. Please stop
More informationUniversity of Illinois at Urbana-Champaign Department of Computer Science. Second Examination
University of Illinois at Urbana-Champaign Department of Computer Science Second Examination CS 225 Data Structures and Software Principles Sample Exam 1 75 minutes permitted Print your name, netid, and
More informationCSE373: Data Structures & Algorithms Lecture 4: Dictionaries; Binary Search Trees. Kevin Quinn Fall 2015
CSE373: Data Structures & Algorithms Lecture 4: Dictionaries; Binary Search Trees Kevin Quinn Fall 2015 Where we are Studying the absolutely essential ADTs of computer science and classic data structures
More informationTrees 2: Linked Representation, Tree Traversal, and Binary Search Trees
Trees 2: Linked Representation, Tree Traversal, and Binary Search Trees Linked representation of binary tree Again, as with linked list, entire tree can be represented with a single pointer -- in this
More informationFall, 2015 Prof. Jungkeun Park
Data Structures and Algorithms Binary Search Trees Fall, 2015 Prof. Jungkeun Park Copyright Notice: This material is modified version of the lecture slides by Prof. Rada Mihalcea in Univ. of North Texas.
More informationSpring 2018 Mentoring 8: March 14, Binary Trees
CSM 6B Binary Trees Spring 08 Mentoring 8: March 4, 08 Binary Trees. Define a procedure, height, which takes in a Node and outputs the height of the tree. Recall that the height of a leaf node is 0. private
More informationData Structures in Java
Data Structures in Java Lecture 9: Binary Search Trees. 10/7/015 Daniel Bauer 1 Contents 1. Binary Search Trees. Implementing Maps with BSTs Map ADT A map is collection of (key, value) pairs. Keys are
More informationData Structures and Algorithms 2018
Question 1 (12 marks) Data Structures and Algorithms 2018 Assignment 4 25% of Continuous Assessment Mark Deadline : 5pm Monday 12 th March, via Canvas Sort the array [5, 3, 4, 6, 8, 4, 1, 9, 7, 1, 2] using
More informationCPSC 211, Sections : Data Structures and Implementations, Honors Final Exam May 4, 2001
CPSC 211, Sections 201 203: Data Structures and Implementations, Honors Final Exam May 4, 2001 Name: Section: Instructions: 1. This is a closed book exam. Do not use any notes or books. Do not confer with
More informationCSE373 Fall 2013, Second Midterm Examination November 15, 2013
CSE373 Fall 2013, Second Midterm Examination November 15, 2013 Please do not turn the page until the bell rings. Rules: The exam is closed-book, closed-note, closed calculator, closed electronics. Please
More informationCSE 530A. B+ Trees. Washington University Fall 2013
CSE 530A B+ Trees Washington University Fall 2013 B Trees A B tree is an ordered (non-binary) tree where the internal nodes can have a varying number of child nodes (within some range) B Trees When a key
More informationUniversity of Toronto Mississauga. Flip to the back cover and write down your name and student number.
University of Toronto Mississauga Midterm Test Course: CSC263H5 Winter 2016 Instructor: Larry Zhang Duration: 50 minutes Aids allowed: 1 double sided 8.5 x 11 aid sheet Last Name: Given Name: Flip to the
More informationBinary Search Trees. Contents. Steven J. Zeil. July 11, Definition: Binary Search Trees The Binary Search Tree ADT...
Steven J. Zeil July 11, 2013 Contents 1 Definition: Binary Search Trees 2 1.1 The Binary Search Tree ADT.................................................... 3 2 Implementing Binary Search Trees 7 2.1 Searching
More informationSection 05: Solutions
Section 05: Solutions 1. Memory and B-Tree (a) Based on your understanding of how computers access and store memory, why might it be faster to access all the elements of an array-based queue than to access
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 informationCOS 226 Midterm Exam, Spring 2009
NAME: login ID: precept: COS 226 Midterm Exam, Spring 2009 This test is 10 questions, weighted as indicated. The exam is closed book, except that you are allowed to use a one page cheatsheet. No calculators
More informationInstructions. Definitions. Name: CMSC 341 Fall Question Points I. /12 II. /30 III. /10 IV. /12 V. /12 VI. /12 VII.
CMSC 341 Fall 2013 Data Structures Final Exam B Name: Question Points I. /12 II. /30 III. /10 IV. /12 V. /12 VI. /12 VII. /12 TOTAL: /100 Instructions 1. This is a closed-book, closed-notes exam. 2. You
More informationComputer Science II Fall 2009
Name: Computer Science II Fall 2009 Exam #2 Closed book and notes. This exam should have five problems and six pages. Problem 0: [1 point] On a scale of 0 5, where 5 is highest, I think I deserve a for
More informationComputer Science 302 Spring 2007 Practice Final Examination: Part I
Computer Science 302 Spring 2007 Practice Final Examination: Part I Name: This practice examination is much longer than the real final examination will be. If you can work all the problems here, you will
More informationCSL 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 informationParallel and Sequential Data Structures and Algorithms Lecture (Spring 2012) Lecture 16 Treaps; Augmented BSTs
Lecture 16 Treaps; Augmented BSTs Parallel and Sequential Data Structures and Algorithms, 15-210 (Spring 2012) Lectured by Margaret Reid-Miller 8 March 2012 Today: - More on Treaps - Ordered Sets and Tables
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 informationCSE 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 informationCOMP 103 Introduction to Data Structures and Algorithms
T E W H A R E W Ā N A N G A O T E Ū P O K O O T E I K A A M Ā U I VUW V I C T O R I A UNIVERSITY OF WELLINGTON Student ID:..................... EXAMINATIONS 2005 END-YEAR COMP 103 Introduction to Data
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 informationCS 223: Data Structures and Programming Techniques. Exam 2
CS 223: Data Structures and Programming Techniques. Exam 2 Instructor: Jim Aspnes Work alone. Do not use any notes or books. You have approximately 75 minutes to complete this exam. Please write your answers
More informationCSE 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 informationCSE 332: Data Structures & Parallelism Lecture 7: Dictionaries; Binary Search Trees. Ruth Anderson Winter 2019
CSE 332: Data Structures & Parallelism Lecture 7: Dictionaries; Binary Search Trees Ruth Anderson Winter 2019 Today Dictionaries Trees 1/23/2019 2 Where we are Studying the absolutely essential ADTs of
More informationMidterm II Exam Principles of Imperative Computation Frank Pfenning. March 31, 2011
Midterm II Exam 15-122 Principles of Imperative Computation Frank Pfenning March 31, 2011 Name: Sample Solution Andrew ID: fp Section: Instructions This exam is closed-book with one sheet of notes permitted.
More informationUniversity of Illinois at Urbana-Champaign Department of Computer Science. Second Examination
University of Illinois at Urbana-Champaign Department of Computer Science Second Examination CS 225 Data Structures and Software Principles Spring 2014 7-10p, Tuesday, April 8 Name: NetID: Lab Section
More informationAdvanced Java Concepts Unit 5: Trees. Notes and Exercises
Advanced Java Concepts Unit 5: Trees. Notes and Exercises A Tree is a data structure like the figure shown below. We don t usually care about unordered trees but that s where we ll start. Later we will
More informationData Structures and Algorithms, Winter term 2018 Practice Assignment 3
German University in Cairo Media Engineering and Technology Prof. Dr. Slim Abdennadher Dr. Wael Abouelsaadat Data Structures and Algorithms, Winter term 2018 Practice Assignment 3 Exercise 3-1 Search in
More informationEXAMINATIONS 2005 END-YEAR. COMP 103 Introduction to Data Structures and Algorithms
T E W H A R E W Ā N A N G A O T E Ū P O K O O T E I K A A M Ā U I ÎÍÏ V I C T O R I A UNIVERSITY OF WELLINGTON EXAMINATIONS 2005 END-YEAR COMP 103 Introduction to Data Structures and Algorithms Time Allowed:
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 informationCSE373 Fall 2013, Midterm Examination October 18, 2013
CSE373 Fall 2013, Midterm Examination October 18, 2013 Please do not turn the page until the bell rings. Rules: The exam is closed-book, closed-note, closed calculator, closed electronics. Please stop
More informationTotal Score /1 /20 /41 /15 /23 Grader
NAME: NETID: CS2110 Spring 2015 Prelim 2 April 21, 2013 at 5:30 0 1 2 3 4 Total Score /1 /20 /41 /15 /23 Grader There are 5 questions numbered 0..4 on 8 pages. Check now that you have all the pages. Write
More informationCS 315 Data Structures mid-term 2
CS 315 Data Structures mid-term 2 1) Shown below is an AVL tree T. Nov 14, 2012 Solutions to OPEN BOOK section. (a) Suggest a key whose insertion does not require any rotation. 18 (b) Suggest a key, if
More informationHash Tables. CS 311 Data Structures and Algorithms Lecture Slides. Wednesday, April 22, Glenn G. Chappell
Hash Tables CS 311 Data Structures and Algorithms Lecture Slides Wednesday, April 22, 2009 Glenn G. Chappell Department of Computer Science University of Alaska Fairbanks CHAPPELLG@member.ams.org 2005
More informationCSCE 2014 Final Exam Spring Version A
CSCE 2014 Final Exam Spring 2017 Version A Student Name: Student UAID: Instructions: This is a two-hour exam. Students are allowed one 8.5 by 11 page of study notes. Calculators, cell phones and computers
More informationBST Implementation. Data Structures. Lecture 4 Binary search trees (BST) Dr. Mahmoud Attia Sakr University of Ain Shams
Lecture 4 Binary search trees (BST) Dr. Mahmoud Attia Sakr mahmoud.sakr@cis.asu.edu.eg Cairo, Egypt, October 2012 Binary Search Trees (BST) 1. Hierarchical data structure with a single reference to root
More informationCS210 (161) with Dr. Basit Qureshi Final Exam Weight 40%
CS210 (161) with Dr. Basit Qureshi Final Exam Weight 40% Name ID Directions: There are 9 questions in this exam. To earn a possible full score, you must solve all questions. Time allowed: 180 minutes Closed
More informationA set of nodes (or vertices) with a single starting point
Binary Search Trees Understand tree terminology Understand and implement tree traversals Define the binary search tree property Implement binary search trees Implement the TreeSort algorithm 2 A set of
More informationMulti-way Search Trees! M-Way Search! M-Way Search Trees Representation!
Lecture 10: Multi-way Search Trees: intro to B-trees 2-3 trees 2-3-4 trees Multi-way Search Trees A node on an M-way search tree with M 1 distinct and ordered keys: k 1 < k 2 < k 3
More informationCSE 250 Final Exam. Fall 2013 Time: 3 hours. Dec 11, No electronic devices of any kind. You can open your textbook and notes
CSE 250 Final Exam Fall 2013 Time: 3 hours. Dec 11, 2013 Total points: 100 14 pages Please use the space provided for each question, and the back of the page if you need to. Please do not use any extra
More informationPROBLEM 1 : (And the winner is...(12 points)) Assume you are considering the implementation of a priority queue that will always give you the smallest
CPS 100, Ramm Hour Exam #2 (11/1/99) Fall, 1999 NAME (print): Honor Acknowledgment (signature): DO NOT SPEND MORE THAN 10 OR SO MINUTES ON ANY OF THE OTHER QUESTIONS! If you don't see the solution to a
More informationCMSC351 - Fall 2014, Homework #2
CMSC351 - Fall 2014, Homework #2 Due: October 8th at the start of class Name: Section: Grades depend on neatness and clarity. Write your answers with enough detail about your approach and concepts used,
More informationIntroduction to Algorithms October 12, 2005 Massachusetts Institute of Technology Professors Erik D. Demaine and Charles E. Leiserson Quiz 1.
Introduction to Algorithms October 12, 2005 Massachusetts Institute of Technology 6.046J/18.410J Professors Erik D. Demaine and Charles E. Leiserson Quiz 1 Quiz 1 Do not open this quiz booklet until you
More informationCSE 332 Winter 2015: Midterm Exam (closed book, closed notes, no calculators)
_ UWNetID: Lecture Section: A CSE 332 Winter 2015: Midterm Exam (closed book, closed notes, no calculators) Instructions: Read the directions for each question carefully before answering. We will give
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 informationDo not turn this page until you have received the signal to start. In the meantime, please read the instructions below carefully.
CSC 148 H1 / L0101 Term Test # 2 13 March 2013 Duration: Aids Allowed: 50 minutes None Student Number: Last (Family) Name(s): First (Given) Name(s): Do not turn this page until you have received the signal
More informationCSE 373 OCTOBER 11 TH TRAVERSALS AND AVL
CSE 373 OCTOBER 11 TH TRAVERSALS AND AVL MINUTIAE Feedback for P1p1 should have gone out before class Grades on canvas tonight Emails went to the student who submitted the assignment If you did not receive
More informationCMSC 341 Lecture 14: Priority Queues, Heaps
CMSC 341 Lecture 14: Priority Queues, Heaps Prof. John Park Based on slides from previous iterations of this course Today s Topics Priority Queues Abstract Data Type Implementations of Priority Queues:
More informationMulti-Way Search Trees
Multi-Way Search Trees Manolis Koubarakis 1 Multi-Way Search Trees Multi-way trees are trees such that each internal node can have many children. Let us assume that the entries we store in a search tree
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 informationCOMP 250. Lecture 22. binary search trees. Oct. 30, 2017
COMP 250 Lecture 22 binary search trees Oct. 30, 2017 1 (binary search) tree binary (search tree) 2 class BSTNode< K >{ K BSTNode< K > BSTNode< K > : } key; leftchild; rightchild; The keys are comparable
More informationQueues. ADT description Implementations. October 03, 2017 Cinda Heeren / Geoffrey Tien 1
Queues ADT description Implementations Cinda Heeren / Geoffrey Tien 1 Queues Assume that we want to store data for a print queue for a student printer Student ID Time File name The printer is to be assigned
More informationMulti-Way Search Trees
Multi-Way Search Trees Manolis Koubarakis 1 Multi-Way Search Trees Multi-way trees are trees such that each internal node can have many children. Let us assume that the entries we store in a search tree
More informationRed-Black trees are usually described as obeying the following rules :
Red-Black Trees As we have seen, the ideal Binary Search Tree has height approximately equal to log n, where n is the number of values stored in the tree. Such a BST guarantees that the maximum time for
More informationBINARY HEAP cs2420 Introduction to Algorithms and Data Structures Spring 2015
BINARY HEAP cs2420 Introduction to Algorithms and Data Structures Spring 2015 1 administrivia 2 -assignment 10 is due on Thursday -midterm grades out tomorrow 3 last time 4 -a hash table is a general storage
More information! Tree: set of nodes and directed edges. ! Parent: source node of directed edge. ! Child: terminal node of directed edge
Trees & Heaps Week 12 Gaddis: 20 Weiss: 21.1-3 CS 5301 Fall 2018 Jill Seaman!1 Tree: non-recursive definition! Tree: set of nodes and directed edges - root: one node is distinguished as the root - Every
More informationBinary Trees and Binary Search Trees
Binary Trees and Binary Search Trees Learning Goals After this unit, you should be able to... Determine if a given tree is an instance of a particular type (e.g. binary, and later heap, etc.) Describe
More informationa graph is a data structure made up of nodes in graph theory the links are normally called edges
1 Trees Graphs a graph is a data structure made up of nodes each node stores data each node has links to zero or more nodes in graph theory the links are normally called edges graphs occur frequently in
More informationSolution to CSE 250 Final Exam
Solution to CSE 250 Final Exam Fall 2013 Time: 3 hours. December 13, 2013 Total points: 100 14 pages Please use the space provided for each question, and the back of the page if you need to. Please do
More informationSelf-Balancing Search Trees. Chapter 11
Self-Balancing Search Trees Chapter 11 Chapter Objectives To understand the impact that balance has on the performance of binary search trees To learn about the AVL tree for storing and maintaining a binary
More informationCS 112 Final May 8, 2008 (Lightly edited for 2012 Practice) Name: BU ID: Instructions
CS 112 Final May 8, 2008 (Lightly edited for 2012 Practice) Name: BU ID: This exam is CLOSED book and notes. Instructions The exam consists of six questions on 11 pages. Please answer all questions on
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 61B Summer 2005 (Porter) Midterm 2 July 21, SOLUTIONS. Do not open until told to begin
CS 61B Summer 2005 (Porter) Midterm 2 July 21, 2005 - SOLUTIONS Do not open until told to begin This exam is CLOSED BOOK, but you may use 1 letter-sized page of notes that you have created. Problem 0:
More information9/29/2016. Chapter 4 Trees. Introduction. Terminology. Terminology. Terminology. Terminology
Introduction Chapter 4 Trees for large input, even linear access time may be prohibitive we need data structures that exhibit average running times closer to O(log N) binary search tree 2 Terminology recursive
More informationData Structures and Algorithms, Winter term 2017 Practice Assignment 7
German University in Cairo Media Engineering and Technology Prof. Dr. Slim Abdennadher Dr. Wael Abouelsaadat Data Structures and Algorithms, Winter term 2017 Practice Assignment 7 Exercise 7-1 Using the
More informationEECS 311 Data Structures Midterm Exam Don t Panic!
April 5, 7 EECS Data Structures Midterm Exam Don t Panic!. ( pts) In each box below, show the AVL trees that result from the successive addition of the given elements. Show the nodes, links and balance
More informationPractice Midterm Exam Solutions
CSE 332: Data Abstractions Autumn 2015 Practice Midterm Exam Solutions Name: Sample Solutions ID #: 1234567 TA: The Best Section: A9 INSTRUCTIONS: You have 50 minutes to complete the exam. The exam is
More informationCMSC 341 Priority Queues & Heaps. Based on slides from previous iterations of this course
CMSC 341 Priority Queues & Heaps Based on slides from previous iterations of this course Today s Topics Priority Queues Abstract Data Type Implementations of Priority Queues: Lists BSTs Heaps Heaps Properties
More informationData Structure. A way to store and organize data in order to support efficient insertions, queries, searches, updates, and deletions.
DATA STRUCTURES COMP 321 McGill University These slides are mainly compiled from the following resources. - Professor Jaehyun Park slides CS 97SI - Top-coder tutorials. - Programming Challenges book. Data
More informationCS 314 Exam 2 Fall 2017
Points off 1 2 3 4 5 Total off CS 314 Exam 2 Fall 2017 Your Name Your UTEID Circle your TAs Name: Gilbert Jacob Jorge Joseph Lucas Rebecca Shelby Instructions: 1. There are 5 questions on this test. 100
More informationComputer Science E-22 Practice Final Exam
name Computer Science E-22 This exam consists of three parts. Part I has 10 multiple-choice questions that you must complete. Part II consists of 4 multi-part problems, of which you must complete 3, and
More informationRecitation 9. Prelim Review
Recitation 9 Prelim Review 1 Heaps 2 Review: Binary heap min heap 1 2 99 4 3 PriorityQueue Maintains max or min of collection (no duplicates) Follows heap order invariant at every level Always balanced!
More informationYork University AK/ITEC INTRODUCTION TO DATA STRUCTURES. Final Sample II. Examiner: S. Chen Duration: Three hours
York University AK/ITEC 262 3. INTRODUCTION TO DATA STRUCTURES Final Sample II Examiner: S. Chen Duration: Three hours This exam is closed textbook(s) and closed notes. Use of any electronic device (e.g.
More informationCSE 332 Spring 2014: Midterm Exam (closed book, closed notes, no calculators)
Name: Email address: Quiz Section: CSE 332 Spring 2014: Midterm Exam (closed book, closed notes, no calculators) Instructions: Read the directions for each question carefully before answering. We will
More information