McGill University Department of Electrical and Computer Engineering. Course ECSE-322A -- Computer Engineering. MidTerm Test Version 1 Solutions
|
|
- Elizabeth Williamson
- 5 years ago
- Views:
Transcription
1 Signature: I.D. Number: Printed Name: McGill University Department of Electrical and Computer Engineering Course ECSE-322A -- Computer Engineering PLEASE NOTE CAREFULLY: MidTerm Test Version 1 Solutions Monday, October 27, 2008 Sign this paper, fill in your student ID number and print your name at the top of the first page as well as the mark sense sheets - If you do not do this, the exam may not be marked. Initial each page of the exam paper in case the sheets should get separated. Make sure the signed paper in its entirety is handed in at the end of the examination. INSTRUCTIONS: This exam consists of two parts: Part 1 consists of a set of 16 multiple choice questions. Part 2 consists of a set of 2 questions with short answers. The answers to the questions in Part 1 (the first 16 questions) should be entered on the computer marked sheets. The answers to Part 2 should be written on this question paper in the space provided. DO NOT USE ANY OTHER EXAM BOOKS FOR ANSWERS TO BE MARKED. The scoring method for the multiple choice part of the examination is as follows: 1 mark for each correct answer, 0 marks for a blank or wrong answer. All multiple choice questions will be weighted equally in scoring. Therefore, Part 1 is worth a total of 16 marks. Part 2 is worth 14 marks. The exam is out of 30 marks total. This is a closed book exam. However, the candidates are allowed to bring in one sheet of letter size paper which may have handwritten notes on both sides. Student answers in the multiple choice section will be subject to analysis by the McGill Exam Security Computer Monitoring Program in order to identify unusually similar answer patterns. Please sign this paper at the top of this page, write your name legibly, and read the important notice above. MidTerm 2008A- 1
2 TEST QUESTIONS PART 1 - This part consists of 16 multiple choice questions. Indicate the correct answer to each question on the computer readable sheets provided. 1. Which of the following is TRUE with regards to a light pen? It is a graphical output device that is useful in CAD design. It is a high resolution device. When you point it at the screen, the computer picks up the light it emits and converts it to a position. It is as comfortable to use as a pen and paper model. It is an absolute device. Answer: e 2. Which of the following is set by the CPU on the Device Status Register: Device on. Device busy. Interrupt enabled. Interrupt set. Vectored address LOAD. Answer: c 3. Out of the 25 lines in a full RS232 protocol, which of the following are NOT responsible for maintaining synchronization? Received Data Data Set Ready Clear To Send Data Terminal Ready Request to Send Answer: a MidTerm 2008A- 2
3 4. In a particular sorting process the first iteration places 1 data item in the correct position; the second places a further 2; by the fourth pass 15 items are correctly placed. The time complexity of this process is O (constant) O (log 2 N) O(N) O (Nlog 2 N) O(N 2 ) Answer. 5. In a serial communications system using a START/STOP protocol with 1 STOP bit, what is the maximum number of ASCII characters that can be transmitted per second on a baud connection? (to the nearest multiple of 10) Answer: c 6. A complete binary tree contains 10 nodes. What is the height of the tree? Impossible to determine. Answer: c 7. A graphics system is designed such that each pixel has 2 bits for red, 2 bits for green and 2 bits for blue. The system can display a total of: 6 colours 12 colours 64 colours 128 colours 256 colours Answer: c MidTerm 2008A- 3
4 8. The device status register (sometimes referred to as the status and control register) is best defined as: A location on the device interface used to pass information between the CPU and the device. A location in memory used by the CPU to communicate with a device. A location on the device used to store data from the bus lines. A pointer to data currently being processed. A location used to store the ISR (Interrupt Service Routine). Answer: a 9. Which of the following is TRUE? I/O is impossible without interrupts. Polled interrupts determine device priority through an interrupt acknowledge line. Priority interrupts cause the device which has waited the longest to be handled next. Interrupt service routines may themselves be interrupted. In programmed I/O, device priority is determined in software through a general ISR. Answer: d 10. A buffer is useful to speed up a slow device when: A buffer is only useful for a fast device. Data are transmitted in bursts and each burst has a limited number of characters. Data are continuously sent over the line. The speed of data transmission over the line is low. Used in conjunction with the RS-232 protocol. Answer: b 11. A Composite Video Signal is so named because: It includes color and/or grey scale picture information. It embeds both control and video data signals in one stream. It embeds the vertical synch pulse in the middle of the vertical blank. It provides an analog video signal. It provides both frame and line synchronization. Answer: b MidTerm 2008A- 4
5 12. The introduction of a dedicated graphics CPU (GPU) permitted: The frame buffer to be tightly coupled to the main CPU. The reduction of the communications speed requirement between the frame buffer and the CRT. The frame buffer to transform the instruction draw a line into bit patterns. The possibility of the CPU sending compact instructions in the form of graphics instructions over a serial line. The creation of a lookup ROM to store the optimal bit patterns for all possible graphical images. Answer: d 13. Numbers are added to an empty stack in the following order: 45, 29, 42, 11, 32. Which of the following statements is true? The stack pointer points to element 45. If the items are removed one at a time, they would be removed in the following order: 32, 11, 42, 29, 45. To access item 11, 3 items would have to be popped off the stack. The next data item to be added to the stack will be added after item 32. The next data item to be removed would be data item 45. Stacks cannot be implemented as linked lists. Solution: b 14. Threaded lists are: A set of independent linked lists (each with its own set of nodes). A linked list where each node has multiple entry points but only one exit point. A linked list with more than one chain of pointers that link the same nodes. Subsets of trees. A linked list where each node has a pointer to the next element. Answer: c 15. Which of the following is an abstract data type (and NOT a data structure)? A stack. A linked list. An array. A binary tree. IEEE-754 real number. MidTerm 2008A- 5
6 Answer: a 16. The advantage of using array vectoring with multi-dimensional arrays is: It provides a way to pre-store the exact address of each array element. It is a way to store arrays of vectors. Less memory is used. It speeds up the address polynomial computations. It speeds up the address polynomial computations only if the array is sparse. Answer: d PART 2 of this exam starts on the next page. Please turn over the page and begin Part 2 NOW! MidTerm 2008A- 6
7 B MidTerm Test Version 1 PART 2 - This part consists of 2 short answer questions. YOU MUST ANSWER BOTH QUESTIONS. Write your answers to the questions in the space provided on this exam paper. Do not use extra paper - any answers written outside of the allowed space will not be marked. Each question is worth 7 marks. 17. Give 2 characteristics of an Abstract Data Type (ADT) (0.5 marks each) 1. An ADT describes the form of the data (not its physical implementation) 2. An ADT defines how components of the data can be accessed (the operations on the data) (ii) What differentiates a data structure from an abstract data type? (1 mark) A data structure provides the physical implementation of the abstract data type. MidTerm 2007A - 7
8 (i) Consider the following list of numbers: 53, 22, 93, 23, 63, 56, 18. Show the results of one iteration of QuickSort given the first element as the pivot. (Write out all the steps to attain partial marks if there are errors.) Do not implement the method that uses an additional array. (1.5 marks) Solution: 53 is the pivot (ii) What is your estimate of the time complexity of running QuickSort to completion on this set of numbers? (0.5 marks) Solution: Since the first pivot is approximately in the center, we can estimate the time complexity is O(NlogN). MidTerm 2008A- 8
9 Consider a set of N data items. Fill in the table below with the expected time for each operation. Use big-o notation. The operations are delete (remove an item from the data structure, including determining the location of the item), member (test if a given item is in the data structure), and traverse (visit every element in the structure once). Try to use efficient methods when possible. (3 marks) Data Structure delete* member traverse Sorted array O(logN)+O(N) O(logN) O(N) Binary Search Tree O(logN)+O(1) O(logN) O(N) Sorted linked list O(N)+O(1) O(N) O(N) Unsorted linked list O(N)+O(1) O(N) O(N) *Note: Delete format should be: Search Time + Delete Time, e.g. O(N) + O(N). MidTerm 2008A- 9
10 18. i. One possible design of an interrupt system assigns each interface with its own interrupt line. Describe two problems with this approach. (1 mark) Possible Solutions: 1. As each interface is added, a change must take place in the CPU architecture. 2. Wiring complexity grows. 3. The CPU has many lines to check each time! ii. Draw the truth table (including filling in the signal names) for the logic that will generate the Interrupt Set signal within the Device Status Register. (0.5 mark) Answer: Signals: Device Busy and Interrupt Enable Device Busy Interrupt Enable Interrupt Set iii. During a vectored interrupt process, a LOAD signal is required to place the ISR address on the Data bus. Construct the truth table for the logic that will generate the LOAD signal (including filling in the signal names). (0.5 mark). Answer: Signals: Interrupt Set and Interrupt Acknowledge: Interrupt Set Interrupt Load Acknowledge MidTerm 2008A- 10
11 iv. Draw the digital logic circuit for generating the LOAD signal in (ii) above including all the signals in (i) label each signal clearly (1 mark): MidTerm 2008A- 11
12 A particular interrupt system takes (on the average) 60 microseconds to get to the pertinent ISR after the interrupt is received and the FETCH and EXECUTE cycle is broken. The overhead of the ISR itself (i.e. time taken up with restoring the contents of the CPU registers, etc.) takes 30 microseconds. i. If 20% of the interrupt time is associated with the overhead, determine how much ISR execution time it takes to actually service the I/O device on average. (1 mark) Solution: If the total time for the ISR to execute takes x microseconds on average, then (60+30)/(60+x) = 0.20 (0.2) * (60 + x) = x = 90 x = 390 microseconds. However, 30 microseconds of that time is spent on the overhead of the ISR. The time to service the I/O device is then: = 360 microseconds. Can be solved by: If the total time for the ISR to service the I/O device takes x microseconds on average, then (60+30)/(60+x+ 30) = 0.20 (0.2) * (60 + x + 30) = x = 90 x = 360 microseconds. ii. Measurements on a real system suggest that only 18% of the CPU time is spent on interrupts. What is the average number of interrupts received by the CPU each second? (1 mark). Solution: If there are n interrupts per second, then the time taken is n * 450*10-6 seconds. Thus : n * 450*10-6 = 0.18 n = 400 interrupts/second MidTerm 2008A- 12
13 A printer is designed to connect to a computer using a three wire (ground, send, receive) serial communications system. A large memory buffer is placed in the printer to allow the interface to send characters in a stream at a rate which is much higher than the printer can actually output them. It is also required to keep the printer running continuously, i.e. it should not have to wait for data to arrive. i. Describe a system which can be implemented to both avoid the buffer overflowing and keep the printer running. (1mark) Implement an XON/XOFF protocol. When the buffer is about 20% full send and XON character to the interface to begin transmission; when the buffer is about 80% full, send an XOFF character to the interface to stop transmission. ii. The printer can output 100 characters per second (ignoring carriage returns) and the computer is designed to output 1 page of text (5000 characters) in 0.5 seconds. If the computer is to send one page every minute, how much memory will be needed in the printer buffer? (Assuming that a character is 8 bits long). (1 mark) 5000 characters in 500 milliseconds is a rate of characters per second or one character takes 100 microseconds to send. The printer takes 10 milliseconds to print one character. In this time, 100 characters have arrived, i.e. 99 need to be stored. A page arrives in 0.5 seconds and only 1 page arrives per minute. On the printer side, at 100 characters per second, it will take 5000/100 = 50 seconds to print the page. Thus the buffer will be empty by the time the second page arrives and only enough space is needed to deal with a single page. There are 5000 characters in a page (or 50x100 characters = 50x100 bytes). Thus, from the above, the buffer needs to be 50*99 bytes = 4950 bytes. MidTerm 2008A- 13
University of California, Berkeley. CS 186 Introduction to Databases, Spring 2014, Prof. Dan Olteanu MIDTERM
University of California, Berkeley CS 186 Introduction to Databases, Spring 2014, Prof. Dan Olteanu MIDTERM This is a closed book examination sided). but you are allowed one 8.5 x 11 sheet of notes (double
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 informationYork University. AP/ITEC Section M INTRODUCTION TO DATA STRUCTURES Winter Midterm Test
York University AP/ITEC 2620 3.0 Section M INTRODUCTION TO DATA STRUCTURES Winter 2016 Midterm Test Examiner: S. Chen Duration: One Hour and 30 Minutes This exam is closed textbook(s) and closed notes.
More informationCSE 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 informationECE 341. Lecture # 19
ECE 341 Lecture # 19 Instructor: Zeshan Chishti zeshan@ece.pdx.edu December 3, 2014 Portland State University Announcements Final exam is on Monday, December 8 from 5:30 PM to 7:20 PM Similar format and
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 informationAbout this exam review
Final Exam Review About this exam review I ve prepared an outline of the material covered in class May not be totally complete! Exam may ask about things that were covered in class but not in this review
More informationAdvanced Database Systems
Lecture IV Query Processing Kyumars Sheykh Esmaili Basic Steps in Query Processing 2 Query Optimization Many equivalent execution plans Choosing the best one Based on Heuristics, Cost Will be discussed
More informationChapter 8 & Chapter 9 Main Memory & Virtual Memory
Chapter 8 & Chapter 9 Main Memory & Virtual Memory 1. Various ways of organizing memory hardware. 2. Memory-management techniques: 1. Paging 2. Segmentation. Introduction Memory consists of a large array
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 informationOn my honor I affirm that I have neither given nor received inappropriate aid in the completion of this exercise.
CS 2413 Data Structures EXAM 2 Fall 2015, Page 1 of 10 Student Name: Student ID # OU Academic Integrity Pledge On my honor I affirm that I have neither given nor received inappropriate aid in the completion
More informationIMPORTANT: Circle the last two letters of your class account:
Spring 2011 University of California, Berkeley College of Engineering Computer Science Division EECS MIDTERM I CS 186 Introduction to Database Systems Prof. Michael J. Franklin NAME: STUDENT ID: IMPORTANT:
More informationECE251: Thursday September 27
ECE251: Thursday September 27 Exceptions: Interrupts and Resets Chapter in text and Lab #6. READ ALL this material! This will NOT be on the mid-term exam. Lab Practical Exam #1 Homework # due today at
More informationDigital Design Laboratory Lecture 6 I/O
ECE 280 / CSE 280 Digital Design Laboratory Lecture 6 I/O Input/Output Module Interface to CPU and Memory Interface to one or more peripherals Generic Model of I/O Module External Devices Human readable
More informationNCSU - ECE 306- Exam 2 March 27, 2003
NCSU - ECE 306- Exam 2 March 27, 2003 Name: User ID Question 1-15 16-22 23-Algo 23-code Total Score /45 /60 /15 /30 /150 You are permitted 75 minutes to take this test, no more. This is an open book/open
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 informationYork University AS/AK/ITEC INTRODUCTION TO DATA STRUCTURES. Midterm Sample I. Examiner: S. Chen Duration: One Hour and 30 Minutes
York University AS/AK/ITEC 2620 3.0 INTRODUCTION TO DATA STRUCTURES Midterm Sample I Examiner: S. Chen Duration: One Hour and 30 Minutes This exam is closed textbook(s) and closed notes. Use of any electronic
More informationExam Datastrukturer. DIT960 / DIT961, VT-18 Göteborgs Universitet, CSE
Exam Datastrukturer DIT960 / DIT961, VT-18 Göteborgs Universitet, CSE Day: 2018-10-12, Time: 8:30-12.30, Place: SB Course responsible Alex Gerdes, tel. 031-772 6154. Will visit at around 9:30 and 11:00.
More informationFaculty of Science FINAL EXAMINATION
Faculty of Science FINAL EXAMINATION COMPUTER SCIENCE COMP 273 INTRODUCTION TO COMPUTER SYSTEMS Examiner: Prof. Michael Langer April 18, 2012 Associate Examiner: Mr. Joseph Vybihal 2 P.M. 5 P.M. STUDENT
More informationQ.1 Explain Computer s Basic Elements
Q.1 Explain Computer s Basic Elements Ans. At a top level, a computer consists of processor, memory, and I/O components, with one or more modules of each type. These components are interconnected in some
More informationFinal Examination CSE 100 UCSD (Practice)
Final Examination UCSD (Practice) RULES: 1. Don t start the exam until the instructor says to. 2. This is a closed-book, closed-notes, no-calculator exam. Don t refer to any materials other than the exam
More informationCS 140: Operating Systems and Systems Programming Midterm Exam
CS 140: Operating Systems and Systems Programming Midterm Exam Ben Pfaff Stanford University Department of Computer Science July 19, 2005 In recognition of and in the spirit of the Stanford University
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 informationCPT1. Unit 1 Computer Systems, Programming and Networking Concepts. General Certificate of Education January 2004 Advanced Subsidiary Examination
Surname Other Names Leave blank Centre Number Candidate Number Candidate Signature General Certificate of Education January 2004 Advanced Subsidiary Examination COMPUTING Unit 1 Computer Systems, Programming
More informationCS-245 Database System Principles
CS-245 Database System Principles Midterm Exam Summer 2001 SOLUIONS his exam is open book and notes. here are a total of 110 points. You have 110 minutes to complete it. Print your name: he Honor Code
More informationPerformance and Optimization Issues in Multicore Computing
Performance and Optimization Issues in Multicore Computing Minsoo Ryu Department of Computer Science and Engineering 2 Multicore Computing Challenges It is not easy to develop an efficient multicore program
More informationAbstract 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 informationCSE 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 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 informationCS 245 Midterm Exam Solution Winter 2015
CS 245 Midterm Exam Solution Winter 2015 This exam is open book and notes. You can use a calculator and your laptop to access course notes and videos (but not to communicate with other people). You have
More informationInterrupts Peter Rounce - room 6.18
Interrupts Peter Rounce - room 6.18 P.Rounce@cs.ucl.ac.uk 20/11/2006 1001 Interrupts 1 INTERRUPTS An interrupt is a signal to the CPU from hardware external to the CPU that indicates than some event has
More informationCS 245 Midterm Exam Winter 2014
CS 245 Midterm Exam Winter 2014 This exam is open book and notes. You can use a calculator and your laptop to access course notes and videos (but not to communicate with other people). You have 70 minutes
More informationOperating Systems (1DT020 & 1TT802)
Uppsala University Department of Information Technology Name: Perso. no: Operating Systems (1DT020 & 1TT802) 2009-05-27 This is a closed book exam. Calculators are not allowed. Answers should be written
More information4) In response to the the 8259A sets the highest priority ISR, bit and reset the corresponding IRR bit. The 8259A also places
Lecture-52 Interrupt sequence: The powerful features of the 8259A in a system are its programmability and the interrupt routine address capability. It allows direct or indirect jumping to the specific
More informationMcGill University Faculty of Engineering FINAL EXAMINATION Fall 2007 (DEC 2007)
McGill University Faculty of Engineering FINAL EXAMINATION Fall 2007 (DEC 2007) VERSION 1 Examiner: Professor T.Arbel Signature: INTRODUCTION TO COMPUTER ENGINEERING ECSE-221A 6 December 2007, 1400-1700
More informationChapter 12: Query Processing. Chapter 12: Query Processing
Chapter 12: Query Processing Database System Concepts, 6 th Ed. See www.db-book.com for conditions on re-use Chapter 12: Query Processing Overview Measures of Query Cost Selection Operation Sorting Join
More informationOperating Systems. Designed and Presented by Dr. Ayman Elshenawy Elsefy
Operating Systems Designed and Presented by Dr. Ayman Elshenawy Elsefy Dept. of Systems & Computer Eng.. AL-AZHAR University Website : eaymanelshenawy.wordpress.com Email : eaymanelshenawy@yahoo.com Reference
More informationMidterm Exam Amy Murphy 6 March 2002
University of Rochester Midterm Exam Amy Murphy 6 March 2002 Computer Systems (CSC2/456) Read before beginning: Please write clearly. Illegible answers cannot be graded. Be sure to identify all of your
More informationClass Note #02. [Overall Information] [During the Lecture]
Class Note #02 Date: 01/11/2006 [Overall Information] In this class, after a few additional announcements, we study the worst-case running time of Insertion Sort. The asymptotic notation (also called,
More information2 MARKS Q&A 1 KNREDDY UNIT-I
2 MARKS Q&A 1 KNREDDY UNIT-I 1. What is bus; list the different types of buses with its function. A group of lines that serves as a connecting path for several devices is called a bus; TYPES: ADDRESS BUS,
More informationQUESTION BANK CS2252 MICROPROCESSOR AND MICROCONTROLLERS
FATIMA MICHAEL COLLEGE OF ENGINEERING & TECHNOLOGY Senkottai Village, Madurai Sivagangai Main Road, Madurai -625 020 QUESTION BANK CS2252 MICROPROCESSOR AND MICROCONTROLLERS UNIT 1 - THE 8085 AND 8086
More informationChapter 12: Query Processing
Chapter 12: Query Processing Database System Concepts, 6 th Ed. See www.db-book.com for conditions on re-use Overview Chapter 12: Query Processing Measures of Query Cost Selection Operation Sorting Join
More informationComputer Science Foundation Exam
Computer Science Foundation Exam August 26, 2017 Section I A DATA STRUCTURES NO books, notes, or calculators may be used, and you must work entirely on your own. Name: UCFID: NID: Question # Max Pts Category
More informationMidterm Examination - Answers October 25, 2012 In Class Instructor: Joseph Vybihal
McGill University School of Computer Science Introduction to Computer Systems Midterm Examination - Answers October 25, 2012 In Class Instructor: Joseph Vybihal Student Name: Student ID: Instructions No
More informationBlog - https://anilkumarprathipati.wordpress.com/
Input-Output organization 1. Peripheral Devices The input-output subsystem of a computer, referred to as I/O, provides an efficient mode of communication between the central system and the outside environment.
More informationCSC227: Operating Systems Fall Chapter 1 INTERRUPTS. Dr. Soha S. Zaghloul
CSC227: Operating Systems Fall 2016 Chapter 1 INTERRUPTS Dr. Soha S. Zaghloul LAYOUT 1.3 Devices Controlling Techniques 1.3.1 Polling 1.3.2 Interrupts H/W Interrupts Interrupt Controller Process State
More informationCOSC 6377 Mid-Term #2 Fall 2000
Name: SSN: Signature: Open book, open notes. Your work must be your own. Assigned seating. Test time: 7:05pm to 8:05pm. You may not use a calculator or PalmPilot to calculate subnetting/host/netid information.
More informationComputer 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 informationChapter 9: Virtual Memory. Operating System Concepts 9 th Edition
Chapter 9: Virtual Memory Silberschatz, Galvin and Gagne 2013 Chapter 9: Virtual Memory Background Demand Paging Copy-on-Write Page Replacement Allocation of Frames Thrashing Memory-Mapped Files Allocating
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 informationInterrupts Peter Rounce
Interrupts Peter Rounce P.Rounce@cs.ucl.ac.uk 22/11/2011 11-GC03 Interrupts 1 INTERRUPTS An interrupt is a signal to the CPU from hardware external to the CPU that indicates than some event has occured,
More informationCS171 Midterm Exam. October 29, Name:
CS171 Midterm Exam October 29, 2012 Name: You are to honor the Emory Honor Code. This is a closed-book and closed-notes exam. You have 50 minutes to complete this exam. Read each problem carefully, and
More informationCSE373 Fall 2013, Final Examination December 10, 2013 Please do not turn the page until the bell rings.
CSE373 Fall 2013, Final Examination December 10, 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 promptly
More informationUnited States Naval Academy Electrical and Computer Engineering Department EC310-6 Week Midterm Spring 2015
United States Naval Academy Electrical and Computer Engineering Department EC310-6 Week Midterm Spring 2015 1. Do a page check: you should have 8 pages including this cover sheet. 2. You have 50 minutes
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 informationComputer Science Foundation Exam
Computer Science Foundation Exam August 6, 017 Section I A DATA STRUCTURES SOLUTIONS NO books, notes, or calculators may be used, and you must work entirely on your own. Question # Max Pts Category Passing
More informationChapter 13: Query Processing
Chapter 13: Query Processing! Overview! Measures of Query Cost! Selection Operation! Sorting! Join Operation! Other Operations! Evaluation of Expressions 13.1 Basic Steps in Query Processing 1. Parsing
More informationIntroduction to Embedded Systems. Lab Logistics
Introduction to Embedded Systems CS/ECE 6780/5780 Al Davis Today s topics: lab logistics interrupt synchronization reentrant code 1 CS 5780 Lab Logistics Lab2 Status Wed: 3/11 teams have completed their
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 informationInput and output Systems. Peter Rounce - room G06
Input and output Systems Peter Rounce - room G06 P.Rounce@cs.ucl.ac.uk 1 Keyboard Each key-press sends on byte Each key is numbered Possibly two bytes one when pressed, one when released E.g. shift key
More informationInput / Output. School of Computer Science G51CSA
Input / Output 1 Overview J I/O module is the third key element of a computer system. (others are CPU and Memory) J All computer systems must have efficient means to receive input and deliver output J
More informationECS 15: Introduction to Computers Midterm November 2 nd, 2011
ECS 15: Introduction to Computers Midterm November 2 nd, 2011 Notes: 1) The midterm is open book, open notes. 2) You have 50 minutes, no more: I will strictly enforce this. 3) The midterm is divided into
More informationVirtual Memory. Chapter 8
Virtual Memory 1 Chapter 8 Characteristics of Paging and Segmentation Memory references are dynamically translated into physical addresses at run time E.g., process may be swapped in and out of main memory
More informationA Secondary storage Algorithms and Data Structures Supplementary Questions and Exercises
308-420A Secondary storage Algorithms and Data Structures Supplementary Questions and Exercises Section 1.2 4, Logarithmic Files Logarithmic Files 1. A B-tree of height 6 contains 170,000 nodes with an
More informationCROWDMARK. Examination Midterm. Spring 2017 CS 350. Closed Book. Page 1 of 30. University of Waterloo CS350 Midterm Examination.
Times: Thursday 2017-06-22 at 19:00 to 20:50 (7 to 8:50PM) Duration: 1 hour 50 minutes (110 minutes) Exam ID: 3520593 Please print in pen: Waterloo Student ID Number: WatIAM/Quest Login Userid: Sections:
More informationCPSC 441 COMPUTER COMMUNICATIONS MIDTERM EXAM
CPSC 441 COMPUTER COMMUNICATIONS MIDTERM EXAM Department of Computer Science University of Calgary Professor: Carey Williamson November 1, 2005 This is a CLOSED BOOK exam. Textbooks, notes, laptops, personal
More informationGeneral Objectives: To understand the process management in operating system. Specific Objectives: At the end of the unit you should be able to:
F2007/Unit5/1 UNIT 5 OBJECTIVES General Objectives: To understand the process management in operating system Specific Objectives: At the end of the unit you should be able to: define program, process and
More information538 Lecture Notes Week 5
538 Lecture Notes Week 5 (October 4, 2017) 1/18 538 Lecture Notes Week 5 Announements Midterm: Tuesday, October 25 Answers to last week's questions 1. With the diagram shown for a port (single bit), what
More informationChapter 1 Computer System Overview
Operating Systems: Internals and Design Principles Chapter 1 Computer System Overview Seventh Edition By William Stallings Objectives of Chapter To provide a grand tour of the major computer system components:
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 informationLast 2 Classes: Introduction to Operating Systems & C++ tutorial. Today: OS and Computer Architecture
Last 2 Classes: Introduction to Operating Systems & C++ tutorial User apps OS Virtual machine interface hardware physical machine interface An operating system is the interface between the user and the
More informationUNIVERSITY REGULATIONS
CPSC 221: Algorithms and Data Structures Midterm Exam, 2015 October 21 Name: Student ID: Signature: Section (circle one): MWF(101) TTh(102) You have 90 minutes to solve the 8 problems on this exam. A total
More informationUNIT V MICRO CONTROLLER PROGRAMMING & APPLICATIONS TWO MARKS. 3.Give any two differences between microprocessor and micro controller.
UNIT V -8051 MICRO CONTROLLER PROGRAMMING & APPLICATIONS TWO MARKS 1. What is micro controller? Micro controller is a microprocessor with limited number of RAM, ROM, I/O ports and timer on a single chip
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 informationSTUDENT NAME: STUDENT ID: Problem 1 Problem 2 Problem 3 Problem 4 Problem 5 Total
University of Minnesota Department of Computer Science CSci 5103 - Fall 2016 (Instructor: Tripathi) Midterm Exam 1 Date: October 17, 2016 (4:00 5:15 pm) (Time: 75 minutes) Total Points 100 This exam contains
More information! A relational algebra expression may have many equivalent. ! Cost is generally measured as total elapsed time for
Chapter 13: Query Processing Basic Steps in Query Processing! Overview! Measures of Query Cost! Selection Operation! Sorting! Join Operation! Other Operations! Evaluation of Expressions 1. Parsing and
More informationChapter 13: Query Processing Basic Steps in Query Processing
Chapter 13: Query Processing Basic Steps in Query Processing! Overview! Measures of Query Cost! Selection Operation! Sorting! Join Operation! Other Operations! Evaluation of Expressions 1. Parsing and
More informationVisualizing Data Structures. Dan Petrisko
Visualizing Data Structures Dan Petrisko What is an Algorithm? A method of completing a function by proceeding from some initial state and input, proceeding through a finite number of well defined steps,
More information15110 PRINCIPLES OF COMPUTING SAMPLE EXAM 2
15110 PRINCIPLES OF COMPUTING SAMPLE EXAM 2 Name Section Directions: Answer each question neatly in the space provided. Please read each question carefully. You have 50 minutes for this exam. No electronic
More informationCornell University Computer Science 211 Second Preliminary Examination 18 April 2006
Cornell University Computer Science 211 Second Preliminary Examination 18 April 2006 There are 4 problems on this exam. It is 8 pages long, so make sure you have the whole exam. You will have 1 1 hours
More informationChapter 02: Computer Organization Functional units and components in a computer organization Part 3 Bus Structures
Chapter 02: Computer Organization Functional units and components in a computer organization Part 3 Bus Structures Objective: Understand the IO Subsystem and Understand Bus Structures Understand the functions
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 information5. Hashing. 5.1 General Idea. 5.2 Hash Function. 5.3 Separate Chaining. 5.4 Open Addressing. 5.5 Rehashing. 5.6 Extendible Hashing. 5.
5. Hashing 5.1 General Idea 5.2 Hash Function 5.3 Separate Chaining 5.4 Open Addressing 5.5 Rehashing 5.6 Extendible Hashing Malek Mouhoub, CS340 Fall 2004 1 5. Hashing Sequential access : O(n). Binary
More informationCPSC 441 COMPUTER NETWORKS MIDTERM EXAM
CPSC 441 COMPUTER NETWORKS MIDTERM EXAM Department of Computer Science University of Calgary Professor: Carey Williamson March 7, 2018 This is a CLOSED BOOK exam. Textbooks, notes, laptops, personal digital
More informationChapter 9: Virtual Memory
Chapter 9: Virtual Memory Silberschatz, Galvin and Gagne 2013 Chapter 9: Virtual Memory Background Demand Paging Copy-on-Write Page Replacement Allocation of Frames Thrashing Memory-Mapped Files Allocating
More informationQuery Processing. Debapriyo Majumdar Indian Sta4s4cal Ins4tute Kolkata DBMS PGDBA 2016
Query Processing Debapriyo Majumdar Indian Sta4s4cal Ins4tute Kolkata DBMS PGDBA 2016 Slides re-used with some modification from www.db-book.com Reference: Database System Concepts, 6 th Ed. By Silberschatz,
More informationDEBUGGING SERIAL COMMUNICATIONS WITH OTHER DEVICES
DEBUGGING SERIAL COMMUNICATIONS WITH OTHER DEVICES NOTE: This application note is intended for users connecting an external device to a HomeVision serial port. It may be helpful to users connecting to
More informationDesign of Digital Circuits ( L) ETH Zürich, Spring 2017
Name: Student ID: Final Examination Design of Digital Circuits (252-0028-00L) ETH Zürich, Spring 2017 Professors Onur Mutlu and Srdjan Capkun Problem 1 (70 Points): Problem 2 (50 Points): Problem 3 (40
More informationData Structures. Topic #7
Data Structures Topic #7 Today s Agenda How to measure the efficiency of algorithms? Discuss program #3 in detail Review for the midterm what material to study types of questions walk through a sample
More informationMatriculation number:
Department of Informatics Prof. Dr. Michael Böhlen Binzmühlestrasse 14 8050 Zurich Phone: +41 44 635 4333 Email: boehlen@ifi.uzh.ch AlgoDat Midterm 2 Spring 2018 27.04.2018 Name: Matriculation number:
More informationComputer Architecture CS 355 Busses & I/O System
Computer Architecture CS 355 Busses & I/O System Text: Computer Organization & Design, Patterson & Hennessy Chapter 6.5-6.6 Objectives: During this class the student shall learn to: Describe the two basic
More informationOPERATING SYSTEMS CS136
OPERATING SYSTEMS CS136 Jialiang LU Jialiang.lu@sjtu.edu.cn Based on Lecture Notes of Tanenbaum, Modern Operating Systems 3 e, 1 Chapter 5 INPUT/OUTPUT 2 Overview o OS controls I/O devices => o Issue commands,
More informationCS244a: An Introduction to Computer Networks
Name: Grade: S MC: L MC: 15: 16: 17: Total: CS244a: An Introduction to Computer Networks Midterm Exam: Thursday You are allowed 1 hour to complete this exam. (i) This exam is closed book and closed notes.
More informationMA 113 Calculus I Fall 2015 Exam 2 Tuesday, 20 October Multiple Choice Answers. Question
MA 113 Calculus I Fall 2015 Exam 2 Tuesday, 20 October 2015 Name: Section: Last digits of student ID #: This exam has ten multiple choice questions (five points each) and five free response questions (ten
More informationECE 485/585 Midterm Exam
ECE 485/585 Midterm Exam Time allowed: 100 minutes Total Points: 65 Points Scored: Name: Problem No. 1 (12 points) For each of the following statements, indicate whether the statement is TRUE or FALSE:
More informationINPUT-OUTPUT ORGANIZATION
1 INPUT-OUTPUT ORGANIZATION Peripheral Devices Input-Output Interface Asynchronous Data Transfer Modes of Transfer Priority Interrupt Direct Memory Access Input-Output Processor Serial Communication 2
More informationChapter 8: Virtual Memory. Operating System Concepts Essentials 2 nd Edition
Chapter 8: Virtual Memory Silberschatz, Galvin and Gagne 2013 Chapter 8: Virtual Memory Background Demand Paging Copy-on-Write Page Replacement Allocation of Frames Thrashing Memory-Mapped Files Allocating
More informationProcess Context & Interrupts. New process can mess up information in old process. (i.e. what if they both use the same register?)
1 Process Context 1.1 What is context? A process is sometimes called a task, subroutine or program. Process context is all the information that the process needs to keep track of its state. Registers Temporary
More informationS.E. (Computer) (First Semester) EXAMINATION, 2011 DATA STRUCTURES AND ALGORITHM (2008 PATTERN) Time : Three Hours Maximum Marks : 100
Total No. of Questions 12] [Total No. of Printed Pages 7 [4062]-204 S.E. (Computer) (First Semester) EXAMINATION, 2011 DATA STRUCTURES AND ALGORITHM (2008 PATTERN) Time : Three Hours Maximum Marks : 100
More information4.3 Digital Communication
Data Acquisition & Computer Control 11 4.3 Digital Communication Why digital communication (often termed digital input/output, or DIO)? Because the language of computers (and many peripheral devices) is
More information