File Structures N F. Chapter 1-1. z M.Folk and B.Zoellick, File Structures, Addison Wesley.

Size: px
Start display at page:

Download "File Structures N F. Chapter 1-1. z M.Folk and B.Zoellick, File Structures, Addison Wesley."

Transcription

1 File Structures žöof ú êëov f Ž N F z M.Folk and B.Zoellick, File Structures, Addison Wesley. z E. Horowitz, S. Sahni, and S. Anderson-Freed, Fundamentals of Data Structures in C, Computer Science Press. Chapter 1-1 Chapter 1-1

2 N Ÿ z File Structures + Advanced Data Structures File Ž N F FileN ö Ó, I/O Processing, Access Method External Sorting Indexing Hashing, Heap Structures Search Structures: AVL Tree, 2-3 Trees, B-Tree, z Not Includes Dynamic Programming, Divide-And-Conquer NP-Hard and NP-Complete Problems, Chapter 1-2 N ªŸ 1 r Ž N :Š' 9 IndexingN F 2 File System Call 10 AVL Tree, 2-3, Storage Device 11 Red-Black Tree, B-Tree (1) 4 Buffering, Blocking 12 B-Tree (2) 5 Field, Record, Page 13 B-Tree (3) 6 External Sorting(1) 14 Hashing (1) 7 8 External Sorting(2) ú ÒÎ Hashing (2) &Æ ÒÎ Chapter 1-3 Chapter 1-2

3 Chapter 1 Introduction to File Structures Chapter The Heart of File Structure Design z Motivation Disks are slow. RAM ļ : 120 nanoseconds Disk ļ : 10 ~ 30 milliseconds DiskN Enormous capacity at much less cost than RAM Non-volatile storage device z Goal Accessing to all the capacity without making our applications spend a lot of time waiting for the disk Chapter 1-5 Chapter 1-3

4 2. A Short History of File Structure Design z General goal of research in file structures One access to the disk. Ideal Only two or three trips to the disk. Practical Grouping information for fewer trips W File N ãï' ( File ªŸ /6 b&n J ) Chapter 1-6 z History Sequential file in tape device Direct access of disk using index Simple index ( sequentially stored ) Tree structured index Binary search tree, AVL tree B-tree, B + -tree: log k N access Hashing Extendible, dynamic hashing Multi-key access method Spatial access method: R-tree, K-D-B tree Chapter 1-7 Chapter 1-4

5 3. A Conceptual Toolkit: File Structure Literacy z File structure r b'nšf ŸŠ FÚ Sequential Access Method Indexed Sequential Access Method Direct Access Method z Disk I/O r új& új ŸŠ FÚ Buffering Blocking Bucket Concept Splitting & Merging Chapter 1-8 z ò TN FÚ: :újj ¾Rª GŸ zræ RŸV ~Š & &j Ÿ package ÚN Ÿ ^ Chapter 1-9 Chapter 1-5

6 4. fj Jr {N z ¾š& Jr b fj þjòr ö Ö ~Š Jr ÿâ ¾š&, Ö ¾š& z N Jr ¾š& JrÆ Ÿ ³, ³{, þjò ö ¾š& JrÆ rú Ÿ z Bj Jr ¾š& JrÚúÆ ë«š fj ö &«ëú þs Chapter 1-10 z êö Jr Ÿ Æ V Ÿ 2R ' Jr š, Æâ š, úª ¾š& Jr š Šs êö z ª Jr ê ª Æ ö ê â^ {, ³{,, ¾š& þjò {, Ž, Æâ N þjò z j Jr ¾š&/ N/ª Jr çæ ör '» Jr ÒšR Ö Ò ëbv Ÿ 2R Ÿ Chapter 1-11 Chapter 1-6

7 2~ JÒ 2~ ªŸ 2~ öÿ [î² 1.1] þ Bj Jr 2~ JÒ ú Ö ò. Šb Ó [î² 1.2] Ö ¾š& Jr þjò Ö ~. Ö jz 2~ JÒ ò. Ú [î² 1.3] Ö ò. ¾š& Jr þjò Chapter ~ JÒ ïê Ó úê Ó ïj:º Ó [î² 1.4] 2~ z& ¾š& Jr þjò Inventory Master File Maintenance Audit Listing új:º Ó Page1 Update Product Quantity Quantity Reorder Code Code On Hand On Order Point ACTION A DR Addition C DR Change -- Qty on hand A DR Addition A DR Addition D DR4000 Deletion C GR Change -- Qty on order C GR Change -- Reorder point A SA Addition C SA Change -- Qty on hand [î² 1.5] ê ª N š N þ Chapter 1-13 Chapter 1-7

8 Inventory Master File Maintenance Error Listing Page1 Update Product Quantity Quantity Reorder Code Code On Hand On Order Point ERROR MESSAGE D DR3000 Invalid Delete -- Master Not On File C GR Invalid Change -- Master Not On File A HM Invalid Add -- Master Already On File X HM1308 Invalid Update code Y SA3014 Invalid Update code A SA Invalid Add -- Master Already On File D SD1103 Invalid Delete -- Master Not On File [î² 1.6] ê ª N Æâ š þ Chapter 1-14 Inventory Master File Listing Page1 Product Quantity Quantity Reorder Code On Hand On Order Point DR DR DR DR DR GR GR GR GR HM HM SA SA SA SA [î² 1.7] ¾š& JrN š þ Chapter 1-15 Chapter 1-8

9 Inventory Master File Listing of Records With Page 1 Quantity On Hand BELOW Recorder Point Product Quantity Quantity Reorder Code On Hand On Order Point DR HM SA [î² 1.8] ¾š& Jr êæ ör Šs êön þ Chapter 1-16 Transactions Read 578 Adds 461 Processed 446 Invalid 15 Changes 87 Processed 79 Invalid 8 Invalid Update Codes 1 Master Records Read 28,406 Master Records Written 28,825 [î² 1.9] ª JrN þ Chapter 1-17 Chapter 1-9

Introduction to File Structures

Introduction to File Structures 1 Introduction to File Structures Introduction to File Organization Data processing from a computer science perspective: Storage of data Organization of data Access to data This will be built on your knowledge

More information

This file contains an excerpt from the character code tables and list of character names for The Unicode Standard, Version 3.0.

This file contains an excerpt from the character code tables and list of character names for The Unicode Standard, Version 3.0. Range: This file contains an excerpt from the character code tables and list of character names for The Unicode Standard, Version.. isclaimer The shapes of the reference glyphs used in these code charts

More information

Chapter 10 Storage and File Structure

Chapter 10 Storage and File Structure Chapter 10 Storage and File Structure Table of Contents z 2 ºÆ Ö c z Storage Media z Buffer Management z File Organization Chapter 10-1 1 1. 2 ºÆ Ö c z File Structure Selection Sequential, Indexed Sequential,

More information

) $ G}] }O H~U. G yhpgxl. Cong

) $ G}] }O H~U. G yhpgxl. Cong » Þ åî ïî á ë ïý þý ÿ þ ë ú ú F \ Œ Œ Ÿ Ÿ F D D D\ \ F F D F F F D D F D D D F D D D D FD D D D F D D FD F F F F F F F D D F D F F F D D D D F Ÿ Ÿ F D D Œ Ÿ D Ÿ Ÿ FŸ D c ³ ² í ë óô ò ð ¹ í ê ë Œ â ä ã

More information

Lecture 5 C Programming Language

Lecture 5 C Programming Language Lecture 5 C Programming Language Summary of Lecture 5 Pointers Pointers and Arrays Function arguments Dynamic memory allocation Pointers to functions 2D arrays Addresses and Pointers Every object in the

More information

Pointers & Arrays. CS2023 Winter 2004

Pointers & Arrays. CS2023 Winter 2004 Pointers & Arrays CS2023 Winter 2004 Outcomes: Pointers & Arrays C for Java Programmers, Chapter 8, section 8.12, and Chapter 10, section 10.2 Other textbooks on C on reserve After the conclusion of this

More information

Chapter 15 Recovery System

Chapter 15 Recovery System Chapter 15 Recovery System Table of Contents 1. Failure Classification 2. Storage Structure 3. Recovery and Atomicity 4. Log-Based Recovery 5. Shadow Paging 6. ARIES 7. Media Recovery Chapter 15-1 1 1.

More information

]a a. ] v. A. Silberschatz, H. Korth and S. Sudarshan, Database System Concepts (3rd Edition), The McGraw Hill Company, 1997.

]a a. ] v. A. Silberschatz, H. Korth and S. Sudarshan, Database System Concepts (3rd Edition), The McGraw Hill Company, 1997. ]a a î íf= áõâfé ] v = A. Silberschatz, H. Korth and S. Sudarshan, Database System Concepts (3rd Edition), The McGraw Hill Company, 1997. C. Batini, S.Ceri, and S. Navathe, Conceptual Database Design -

More information

Pointers. CS2023 Winter 2004

Pointers. CS2023 Winter 2004 Pointers CS2023 Winter 2004 Outcomes: Introduction to Pointers C for Java Programmers, Chapter 8, sections 8.1-8.8 Other textbooks on C on reserve After the conclusion of this section you should be able

More information

Communication and processing of text in the Kildin Sámi, Komi, and Nenets, and Russian languages.

Communication and processing of text in the Kildin Sámi, Komi, and Nenets, and Russian languages. TYPE: 96 Character Graphic Character Set REGISTRATION NUMBER: 200 DATE OF REGISTRATION: 1998-05-01 ESCAPE SEQUENCE G0: -- G1: ESC 02/13 06/00 G2: ESC 02/14 06/00 G3: ESC 02/15 06/00 C0: -- C1: -- NAME:

More information

CMPT 470 Based on lecture notes by Woshun Luk

CMPT 470 Based on lecture notes by Woshun Luk * ) ( & 2XWOLQH &RPSRQHQ 2EMHF 0RGXOHV CMPT 470 ased on lecture notes by Woshun Luk What is a DLL? What is a COM object? Linking two COM objects Client-Server relationships between two COM objects COM

More information

R16 SET - 1 '' ''' '' ''' Code No: R

R16 SET - 1 '' ''' '' ''' Code No: R 1. a) Define Latency time and Transmission time? (2M) b) Define Hash table and Hash function? (2M) c) Explain the Binary Heap Structure Property? (3M) d) List the properties of Red-Black trees? (3M) e)

More information

APPLESHARE PC UPDATE INTERNATIONAL SUPPORT IN APPLESHARE PC

APPLESHARE PC UPDATE INTERNATIONAL SUPPORT IN APPLESHARE PC APPLESHARE PC UPDATE INTERNATIONAL SUPPORT IN APPLESHARE PC This update to the AppleShare PC User's Guide discusses AppleShare PC support for the use of international character sets, paper sizes, and date

More information

Communication and processing of text in the Chuvash, Erzya Mordvin, Komi, Hill Mari, Meadow Mari, Moksha Mordvin, Russian, and Udmurt languages.

Communication and processing of text in the Chuvash, Erzya Mordvin, Komi, Hill Mari, Meadow Mari, Moksha Mordvin, Russian, and Udmurt languages. TYPE: 96 Character Graphic Character Set REGISTRATION NUMBER: 201 DATE OF REGISTRATION: 1998-05-01 ESCAPE SEQUENCE G0: -- G1: ESC 02/13 06/01 G2: ESC 02/14 06/01 G3: ESC 02/15 06/01 C0: -- C1: -- NAME:

More information

Partha Sarathi Mandal

Partha Sarathi Mandal MA 252: Data Structures and Algorithms Lecture 1 http://www.iitg.ernet.in/psm/indexing_ma252/y12/index.html Partha Sarathi Mandal Dept. of Mathematics, IIT Guwahati Time Table D / T 8-8:55 9-9:55 10-10:55

More information

Cartons (PCCs) Management

Cartons (PCCs) Management Final Report Project code: 2015 EE04 Post-Consumer Tetra Pak Cartons (PCCs) Management Prepared for Tetra Pak India Pvt. Ltd. Post Consumer Tetra Pak Cartons (PCCs) Management! " # $ " $ % & ' ( ) * +,

More information

r v i e w o f s o m e r e c e n t d e v e l o p m

r v i e w o f s o m e r e c e n t d e v e l o p m O A D O 4 7 8 O - O O A D OA 4 7 8 / D O O 3 A 4 7 8 / S P O 3 A A S P - * A S P - S - P - A S P - - - - L S UM 5 8 - - 4 3 8 -F 69 - V - F U 98F L 69V S U L S UM58 P L- SA L 43 ˆ UéL;S;UéL;SAL; - - -

More information

Oracle Primavera P6 Enterprise Project Portfolio Management Performance and Sizing Guide. An Oracle White Paper December 2011

Oracle Primavera P6 Enterprise Project Portfolio Management Performance and Sizing Guide. An Oracle White Paper December 2011 Oracle Primavera P6 Enterprise Project Portfolio Management Performance and Sizing Guide An Oracle White Paper December 2011 Disclaimer The following is intended to outline our general product direction.

More information

Personal Conference Manager (PCM)

Personal Conference Manager (PCM) Chapter 3-Basic Operation Personal Conference Manager (PCM) Guidelines The Personal Conference Manager (PCM) interface enables the conference chairperson to control various conference features using his/her

More information

Sheila. Regular Bold. User s Guide

Sheila. Regular Bold. User s Guide Sheila Regular Bold User s Guide font faq HOW TO INSTALL YOUR FONT You will receive your files as a zipped folder. For instructions on how to unzip your folder, visit LauraWorthingtonType.com/faqs/. Your

More information

ERNST. Environment for Redaction of News Sub-Titles

ERNST. Environment for Redaction of News Sub-Titles ERNST Environment for Redaction of News Sub-Titles Introduction ERNST (Environment for Redaction of News Sub-Titles) is a software intended for preparation, airing and sequencing subtitles for news or

More information

To provide state and district level PARCC assessment data for the administration of Grades 3-8 Math and English Language Arts.

To provide state and district level PARCC assessment data for the administration of Grades 3-8 Math and English Language Arts. 200 West Baltimore Street Baltimore, MD 21201 410-767-0100 410-333-6442 TTY/TDD msde.maryland.gov TO: FROM: Members of the Maryland State Board of Education Jack R. Smith, Ph.D. DATE: December 8, 2015

More information

CSE 332: Data Structures & Parallelism Lecture 12: Comparison Sorting. Ruth Anderson Winter 2019

CSE 332: Data Structures & Parallelism Lecture 12: Comparison Sorting. Ruth Anderson Winter 2019 CSE 332: Data Structures & Parallelism Lecture 12: Comparison Sorting Ruth Anderson Winter 2019 Today Sorting Comparison sorting 2/08/2019 2 Introduction to sorting Stacks, queues, priority queues, and

More information

Sorting Goodrich, Tamassia Sorting 1

Sorting Goodrich, Tamassia Sorting 1 Sorting Put array A of n numbers in increasing order. A core algorithm with many applications. Simple algorithms are O(n 2 ). Optimal algorithms are O(n log n). We will see O(n) for restricted input in

More information

Banner 8 Using International Characters

Banner 8 Using International Characters College of William and Mary Banner 8 Using International Characters A Reference and Training Guide Banner Support January 23, 2009 Table of Contents Windows XP Keyboard Setup 3 VISTA Keyboard Setup 7 Creating

More information

Probabilistic analysis of algorithms: What s it good for?

Probabilistic analysis of algorithms: What s it good for? Probabilistic analysis of algorithms: What s it good for? Conrado Martínez Univ. Politècnica de Catalunya, Spain February 2008 The goal Given some algorithm taking inputs from some set Á, we would like

More information

Appendix C. Numeric and Character Entity Reference

Appendix C. Numeric and Character Entity Reference Appendix C Numeric and Character Entity Reference 2 How to Do Everything with HTML & XHTML As you design Web pages, there may be occasions when you want to insert characters that are not available on your

More information

State of Connecticut Workers Compensation Commission

State of Connecticut Workers Compensation Commission State of Connecticut Workers Compensation Commission Notice to Employees Workers Compensation Act Chapter 568 of the Connecticut General Statutes (the Workers Compensation Act) requires your employer,

More information

Part 1. Introduction to File Organization

Part 1. Introduction to File Organization Part 1 Introduction to File Organization Data processing from a computer science perspective: Storage of data Organization of data Access to data This will be built on your knowledge of Data Structures

More information

DATA STRUCTURES AND ALGORITHMS

DATA STRUCTURES AND ALGORITHMS DATA STRUCTURES AND ALGORITHMS Sorting algorithms External sorting, Search Summary of the previous lecture Fast sorting algorithms Quick sort Heap sort Radix sort Running time of these algorithms in average

More information

Keywords: Binary Sort, Sorting, Efficient Algorithm, Sorting Algorithm, Sort Data.

Keywords: Binary Sort, Sorting, Efficient Algorithm, Sorting Algorithm, Sort Data. Volume 4, Issue 6, June 2014 ISSN: 2277 128X International Journal of Advanced Research in Computer Science and Software Engineering Research Paper Available online at: www.ijarcsse.com An Efficient and

More information

ConMan. A Web based Conference Manager for Asterisk. How I Managed to get Con'd into skipping my summer vacation by building this thing

ConMan. A Web based Conference Manager for Asterisk. How I Managed to get Con'd into skipping my summer vacation by building this thing ConMan A Web based Conference Manager for Asterisk -or- How I Managed to get Con'd into skipping my summer vacation by building this thing $90503&07 $:3.74889028,-47,94708 $90503&078:3.42 Sun Labs, slide

More information

BUCKLEY. User s Guide

BUCKLEY. User s Guide BUCKLEY User s Guide O P E N T Y P E FAQ : For information on how to access the swashes and alternates, visit LauraWorthingtonType.com/faqs All operating systems come equipped with a utility that make

More information

Hashing IV and Course Overview

Hashing IV and Course Overview Date: April 5-6, 2001 CSI 2131 Page: 1 Hashing IV and Course Overview Other Collision Resolution Techniques 1) Double Hashing The first hash function determines the home address If the home address is

More information

1. Oracle Mobile Agents? 2. client-agent-server client-server

1. Oracle Mobile Agents? 2. client-agent-server client-server 1. Oracle Mobile Agents?!"#$ application software system%. &'( )'*+, -. */0 1 23 45 678 9:; >?, %@ +%. - 6A(mobility) : B? CDE@ F GH8!" * channel #I 1 = / 4%. ()'*, &', LAN) - * application

More information

HoneyBee User s Guide

HoneyBee User s Guide HoneyBee User s Guide font faq HOW TO INSTALL YOUR FONT You will receive your files as a zipped folder. For instructions on how to unzip your folder, visit LauraWorthingtonType.com/faqs/. Your font is

More information

font faq HOW TO INSTALL YOUR FONT HOW TO INSERT SWASHES, ALTERNATES, AND ORNAMENTS

font faq HOW TO INSTALL YOUR FONT HOW TO INSERT SWASHES, ALTERNATES, AND ORNAMENTS font faq HOW TO INSTALL YOUR FONT You will receive your files as a zipped folder. For instructions on how to unzip your folder, visit LauraWorthingtonType.com/faqs/. Your font is available in two formats:

More information

Cassandra: Distributed Access Control Policies with Tunable Expressiveness

Cassandra: Distributed Access Control Policies with Tunable Expressiveness Cassandra: Distributed Access Control Policies with Tunable Expressiveness p. 1/12 Cassandra: Distributed Access Control Policies with Tunable Expressiveness Moritz Y. Becker and Peter Sewell Computer

More information

124 DISTO pro 4 / pro 4 a-1.0.0zh

124 DISTO pro 4 / pro 4 a-1.0.0zh 0 30 40 50 DISTO PD-Z01 14 DISTO pro 4 / pro 4 a-1.0.0 DISTO pro 4 / pro 4 a-1.0.0 15 16 DISTO pro 4 / pro 4 a-1.0.0 DISTO pro 4 / pro 4 a-1.0.0 17 1 PD-Z03 3 7 4 5 6 10 9 8 18 DISTO pro 4 / pro 4 a-1.0.0

More information

Quick-Sort. Quick-Sort 1

Quick-Sort. Quick-Sort 1 Quick-Sort 7 4 9 6 2 2 4 6 7 9 4 2 2 4 7 9 7 9 2 2 9 9 Quick-Sort 1 Outline and Reading Quick-sort ( 4.3) Algorithm Partition step Quick-sort tree Execution example Analysis of quick-sort (4.3.1) In-place

More information

UNIVERSITY OF THE FREE STATE DEPARTMENT OF COMPUTER SCIENCE AND INFORMATICS CSIS1614. DATE: 5 March 2015 MARKS: 100 SECTION A (36)

UNIVERSITY OF THE FREE STATE DEPARTMENT OF COMPUTER SCIENCE AND INFORMATICS CSIS1614. DATE: 5 March 2015 MARKS: 100 SECTION A (36) UNIVERSITY OF THE FREE STATE DEPARTMENT OF COMPUTER SCIENCE AND INFORMATICS CSIS1614 DATE: 5 March 2015 MARKS: 100 ASSESSOR: Prof. P.J. Blignaut TIME: 180 minutes MODERATOR: Dr. L. de Wet SECTION A (36)

More information

Version /10/2015. Type specimen. Bw STRETCH

Version /10/2015. Type specimen. Bw STRETCH Version 1.00 08/10/2015 Bw STRETCH type specimen 2 Description Bw Stretch is a compressed grotesque designed by Alberto Romanos, suited for display but also body text purposes. It started in 2013 as a

More information

CPSC 310: Database Systems / CSPC 603: Database Systems and Applications Exam 2 November 16, 2005

CPSC 310: Database Systems / CSPC 603: Database Systems and Applications Exam 2 November 16, 2005 CPSC 310: Database Systems / CSPC 603: Database Systems and Applications Exam 2 November 16, 2005 Name: Instructions: 1. This is a closed book exam. Do not use any notes or books, other than your two 8.5-by-11

More information

ESCAPE SEQUENCE G0: ESC 02/08 04/13 C0: C1: NAME Extended African Latin alphabet coded character set for bibliographic information interchange

ESCAPE SEQUENCE G0: ESC 02/08 04/13 C0: C1: NAME Extended African Latin alphabet coded character set for bibliographic information interchange TYPE: 9-character graphic character set REGISTRATION NUMBER: 9 DATE OF REGISTRATION: ESCAPE SEQUENCE G: ESC /8 / G: ESC /9 / G: ESC / / G: ESC / / C: C: NAME Extended African Latin alphabet coded character

More information

font faq HOW TO INSTALL YOUR FONT HOW TO INSERT SWASHES, ALTERNATES, AND ORNAMENTS

font faq HOW TO INSTALL YOUR FONT HOW TO INSERT SWASHES, ALTERNATES, AND ORNAMENTS font faq HOW TO INSTALL YOUR FONT You will receive your files as a zipped folder. For instructions on how to unzip your folder, visit LauraWorthingtonType.com/faqs/. Your font is available in two formats:

More information

Design and Analysis of Algorithms Lecture- 9: B- Trees

Design and Analysis of Algorithms Lecture- 9: B- Trees Design and Analysis of Algorithms Lecture- 9: B- Trees Dr. Chung- Wen Albert Tsao atsao@svuca.edu www.408codingschool.com/cs502_algorithm 1/12/16 Slide Source: http://www.slideshare.net/anujmodi555/b-trees-in-data-structure

More information

Modules. CS2023 Winter 2004

Modules. CS2023 Winter 2004 Modules CS2023 Winter 2004 Outcomes: Modules C for Java Programmers, Chapter 7, sections 7.4.1-7.4.6 Code Complete, Chapter 6 After the conclusion of this section you should be able to Understand why modules

More information

Bold U S E R S G U I D E

Bold U S E R S G U I D E Yana Regular Bold Italic USER S GUIDE S S S font faq HOW TO INSTALL YOUR FONT You will receive your files as a zipped folder. For instructions on how to unzip your folder, visit LauraWorthingtonType.com/faqs/.

More information

B-Trees & its Variants

B-Trees & its Variants B-Trees & its Variants Advanced Data Structure Spring 2007 Zareen Alamgir Motivation Yet another Tree! Why do we need another Tree-Structure? Data Retrieval from External Storage In database programs,

More information

1 Swing 2006A 5 B? 18. Swing Sun Microsystems AWT. 3.1 JFrame JFrame GHI

1 Swing 2006A 5 B? 18. Swing Sun Microsystems AWT. 3.1 JFrame JFrame GHI ' þ ³ š ³ œ ³ 2006 1 Swing! " # &%' ()+-,./0 1 2 45-6 &8% 9 : ; < = >@? 2006A 5 B? 18 C@D E F : G HJILK-M!NPO-Q R S-I!T R!U V-W X Y!Z[N GUI\ ] ^ O-Q R S _a` b-w!c dje!f g Swing Wh i Z j k l m n N VisualEditor

More information

Second Year March 2017

Second Year March 2017 Reg. No. :... Code No. 5052 Name :... Second Year March 2017 Time : 2 Hours Cool-off time : 15 Minutes Part III COMPUTER APPLICATION (Commerce) Maximum : 60 Scores General Instructions to Candidates :

More information

Presentation for use with the textbook, Algorithm Design and Applications, by M. T. Goodrich and R. Tamassia, Wiley, 2015

Presentation for use with the textbook, Algorithm Design and Applications, by M. T. Goodrich and R. Tamassia, Wiley, 2015 Presentation for use with the textbook, Algorithm Design and Applications, by M. T. Goodrich and R. Tamassia, Wiley, 2015 Quick-Sort 7 4 9 6 2 2 4 6 7 9 4 2 2 4 7 9 7 9 2 2 9 9 2015 Goodrich and Tamassia

More information

font faq HOW TO INSTALL YOUR FONT HOW TO INSERT SWASHES, ALTERNATES, AND ORNAMENTS

font faq HOW TO INSTALL YOUR FONT HOW TO INSERT SWASHES, ALTERNATES, AND ORNAMENTS font faq HOW TO INSTALL YOUR FONT You will receive your files as a zipped folder. For instructions on how to unzip your folder, visit LauraWorthingtonType.com/faqs/. Your font is available in two formats:

More information

IS 709/809: Computational Methods in IS Research. Algorithm Analysis (Sorting)

IS 709/809: Computational Methods in IS Research. Algorithm Analysis (Sorting) IS 709/809: Computational Methods in IS Research Algorithm Analysis (Sorting) Nirmalya Roy Department of Information Systems University of Maryland Baltimore County www.umbc.edu Sorting Problem Given an

More information

Quick-Sort fi fi fi 7 9. Quick-Sort Goodrich, Tamassia

Quick-Sort fi fi fi 7 9. Quick-Sort Goodrich, Tamassia Quick-Sort 7 4 9 6 2 fi 2 4 6 7 9 4 2 fi 2 4 7 9 fi 7 9 2 fi 2 9 fi 9 Quick-Sort 1 Quick-Sort ( 10.2 text book) Quick-sort is a randomized sorting algorithm based on the divide-and-conquer paradigm: x

More information

You 2 Software

You 2 Software PrismaCards Enter text for languages with exotic fonts You 2 Software http://www.you2.de info@you2.de Introduction To work in PrismaCards and other programs with complex fonts for different languages you

More information

Models, Notation, Goals

Models, Notation, Goals Scope Ë ÕÙ Ò Ð Ò ÐÝ Ó ÝÒ Ñ ÑÓ Ð Ü Ô Ö Ñ Ö ² Ñ ¹Ú ÖÝ Ò Ú Ö Ð Ö ÒÙÑ Ö Ð ÔÓ Ö ÓÖ ÔÔÖÓÜ Ñ ÓÒ ß À ÓÖ Ð Ô Ö Ô Ú ß Ë ÑÙÐ ÓÒ Ñ Ó ß ËÑÓÓ Ò ² Ö Ò Ö Ò Ô Ö Ñ Ö ÑÔÐ ß Ã ÖÒ Ð Ñ Ó ÚÓÐÙ ÓÒ Ñ Ó ÓÑ Ò Ô Ö Ð Ð Ö Ò Ð ÓÖ Ñ

More information

Adorn. Slab Serif Smooth R E G U LAR. v22622x

Adorn. Slab Serif Smooth R E G U LAR. v22622x s u Adorn f Slab Serif Smooth R E G U LAR B OL D t 0 v22622x 9 user s guide PART OF THE ADORN POMANDER SMOOTH COLLECTION v O P E N T Y P E FAQ : For information on how to access the swashes and alternates,

More information

Chapter 17. Disk Storage, Basic File Structures, and Hashing. Records. Blocking

Chapter 17. Disk Storage, Basic File Structures, and Hashing. Records. Blocking Chapter 17 Disk Storage, Basic File Structures, and Hashing Records Fixed and variable length records Records contain fields which have values of a particular type (e.g., amount, date, time, age) Fields

More information

We can use a max-heap to sort data.

We can use a max-heap to sort data. Sorting 7B N log N Sorts 1 Heap Sort We can use a max-heap to sort data. Convert an array to a max-heap. Remove the root from the heap and store it in its proper position in the same array. Repeat until

More information

: À Ÿμ ª ÿ Æ ± μ « «(À Ÿμ ª ª ÿß æ.». 2553) ËÕÀ Ÿμ

: À Ÿμ ª ÿ Æ ± μ « «(À Ÿμ ª ª ÿß æ.». 2553) ËÕÀ Ÿμ ± μ«à «À 179 À Ÿμ ª ÿ Æ ± μ (ª..) «(À Ÿμ ª ª ÿß æ.». 2553) ËÕÀ Ÿμ Õ ß ƒ : À Ÿμ ª ÿ Æ ± μ «: Doctor of Philosophy Program in Accounting ËÕª ( ËÕ μá ) : ª ÿ Æ ± μ ( ) ( ËÕ àõ) : ª.. ( ) Õ ß ƒ ( ËÕ μá ) :

More information

Unit 6 Chapter 15 EXAMPLES OF COMPLEXITY CALCULATION

Unit 6 Chapter 15 EXAMPLES OF COMPLEXITY CALCULATION DESIGN AND ANALYSIS OF ALGORITHMS Unit 6 Chapter 15 EXAMPLES OF COMPLEXITY CALCULATION http://milanvachhani.blogspot.in EXAMPLES FROM THE SORTING WORLD Sorting provides a good set of examples for analyzing

More information

Hash-Based Indexes. Chapter 11

Hash-Based Indexes. Chapter 11 Hash-Based Indexes Chapter 11 1 Introduction : Hash-based Indexes Best for equality selections. Cannot support range searches. Static and dynamic hashing techniques exist: Trade-offs similar to ISAM vs.

More information

Exploiting scattering media for exploring 3D objects

Exploiting scattering media for exploring 3D objects Exploiting scattering media for exploring 3D objects Alok Kumar Singh 1, Dinesh N Naik 1,, Giancarlo Pedrini 1, Mitsuo Takeda 1, 3 and Wolfgang Osten 1 1 Institut für Technische Optik and Stuttgart Research

More information

Adorn. Serif. Smooth. v22622x

Adorn. Serif. Smooth. v22622x s u Adorn f Serif Smooth 9 0 t v22622x user s guide PART OF THE ADORN POMANDER SMOOTH COLLECTION v O P E N T Y P E FAQ : For information on how to access the swashes and alternates, visit LauraWorthingtonType.com/faqs

More information

Adorn. Serif. Smooth. v22622x. user s guide PART OF THE ADORN POMANDER SMOOTH COLLECTION

Adorn. Serif. Smooth. v22622x. user s guide PART OF THE ADORN POMANDER SMOOTH COLLECTION s u Adorn f Serif Smooth 9 0 t v22622x user s guide PART OF THE ADORN POMANDER SMOOTH COLLECTION v font faq HOW TO INSTALL YOUR FONT You will receive your files as a zipped folder. For instructions on

More information

Aman Kumar. Department of Computer Science & Engineering, IIT Kanpur 3 November, 2014

Aman Kumar. Department of Computer Science & Engineering, IIT Kanpur   3 November, 2014 A Comparison Based Analysis of Four Different Types of Sorting Algorithms in Data Structures with Their Performances Nidhi Imran Simarjeet International Journal of Advanced Research in Computer Science

More information

Parallel Algorithms for (PRAM) Computers & Some Parallel Algorithms. Reference : Horowitz, Sahni and Rajasekaran, Computer Algorithms

Parallel Algorithms for (PRAM) Computers & Some Parallel Algorithms. Reference : Horowitz, Sahni and Rajasekaran, Computer Algorithms Parallel Algorithms for (PRAM) Computers & Some Parallel Algorithms Reference : Horowitz, Sahni and Rajasekaran, Computer Algorithms Part 2 1 3 Maximum Selection Problem : Given n numbers, x 1, x 2,, x

More information

File Organization and Storage Structures

File Organization and Storage Structures File Organization and Storage Structures o Storage of data File Organization and Storage Structures Primary Storage = Main Memory Fast Volatile Expensive Secondary Storage = Files in disks or tapes Non-Volatile

More information

â Õß Golden Orange 40 nan

â Õß Golden Orange 40 nan â Õß Golden Orange 40 nan Õ À æ Èπ â π - º âæ Èπ Õß Local foods and fruits æ È π πõ À π ßÀ«πà π àμà ß Õ À μ ÿâ π ÕßÕ À ß Àπ Õ à«à ªìπ ߌ ß π π πè ß È «â «Õ âõ Ë«πÈ æ ÕàÕß Ë Õ À ª π â π ßÀ«Ààßπ È μà â À

More information

Parallel Sorting Algorithms

Parallel Sorting Algorithms CSC 391/691: GPU Programming Fall 015 Parallel Sorting Algorithms Copyright 015 Samuel S. Cho Sorting Algorithms Review Bubble Sort: O(n ) Insertion Sort: O(n ) Quick Sort: O(n log n) Heap Sort: O(n log

More information

Data on External Storage

Data on External Storage Advanced Topics in DBMS Ch-1: Overview of Storage and Indexing By Syed khutubddin Ahmed Assistant Professor Dept. of MCA Reva Institute of Technology & mgmt. Data on External Storage Prg1 Prg2 Prg3 DBMS

More information

Comparison Sorts. Chapter 9.4, 12.1, 12.2

Comparison Sorts. Chapter 9.4, 12.1, 12.2 Comparison Sorts Chapter 9.4, 12.1, 12.2 Sorting We have seen the advantage of sorted data representations for a number of applications Sparse vectors Maps Dictionaries Here we consider the problem of

More information

CPSC 310: Database Systems / CSPC 603: Database Systems and Applications Final Exam Fall 2005

CPSC 310: Database Systems / CSPC 603: Database Systems and Applications Final Exam Fall 2005 CPSC 310: Database Systems / CSPC 603: Database Systems and Applications Final Exam Fall 2005 Name: Instructions: 1. This is a closed book exam. Do not use any notes or books, other than your three 8.5-by-11

More information

CSE373: Data Structure & Algorithms Lecture 18: Comparison Sorting. Dan Grossman Fall 2013

CSE373: Data Structure & Algorithms Lecture 18: Comparison Sorting. Dan Grossman Fall 2013 CSE373: Data Structure & Algorithms Lecture 18: Comparison Sorting Dan Grossman Fall 2013 Introduction to Sorting Stacks, queues, priority queues, and dictionaries all focused on providing one element

More information

SORTING AND SELECTION

SORTING AND SELECTION 2 < > 1 4 8 6 = 9 CHAPTER 12 SORTING AND SELECTION ACKNOWLEDGEMENT: THESE SLIDES ARE ADAPTED FROM SLIDES PROVIDED WITH DATA STRUCTURES AND ALGORITHMS IN JAVA, GOODRICH, TAMASSIA AND GOLDWASSER (WILEY 2016)

More information

Adorn. Serif. v x. user s gu ide

Adorn. Serif. v x. user s gu ide Adorn f Serif t 9a0 v2226222x user s gu ide v fon t faq HOW T O I N S TA L L YOU R F ON T H O W T O I N S E R T S WA S H E S, You will receive your files as a zipped folder. For instructions on how to

More information

Myriad Pro Light. Lining proportional. Latin capitals. Alphabetic. Oldstyle tabular. Oldstyle proportional. Superscript ⁰ ¹ ² ³ ⁴ ⁵ ⁶ ⁷ ⁸ ⁹,.

Myriad Pro Light. Lining proportional. Latin capitals. Alphabetic. Oldstyle tabular. Oldstyle proportional. Superscript ⁰ ¹ ² ³ ⁴ ⁵ ⁶ ⁷ ⁸ ⁹,. Myriad Pro Light Latin capitals A B C D E F G H I J K L M N O P Q R S T U V W X Y Z & Æ Ł Ø Œ Þ Ð Á Â Ä À Å Ã Ç É Ê Ë È Í Î Ï Ì İ Ñ Ó Ô Ö Ò Õ Š Ú Û Ü Ù Ý Ÿ Ž Ă Ā Ą Ć Č Ď Đ Ě Ė Ē Ę Ğ Ģ Ī Į Ķ Ĺ Ľ Ļ Ń Ň Ņ

More information

Quick-Sort. Quick-sort is a randomized sorting algorithm based on the divide-and-conquer paradigm:

Quick-Sort. Quick-sort is a randomized sorting algorithm based on the divide-and-conquer paradigm: Presentation for use with the textbook Data Structures and Algorithms in Java, 6 th edition, by M. T. Goodrich, R. Tamassia, and M. H. Goldwasser, Wiley, 2014 Quick-Sort 7 4 9 6 2 2 4 6 7 9 4 2 2 4 7 9

More information

Using SmartXplorer to achieve timing closure

Using SmartXplorer to achieve timing closure Using SmartXplorer to achieve timing closure The main purpose of Xilinx SmartXplorer is to achieve timing closure where the default place-and-route (PAR) strategy results in a near miss. It can be much

More information

III. CLAIMS ADMINISTRATION

III. CLAIMS ADMINISTRATION III. CLAIMS ADMINISTRATION Insurance Providers: Liability Insurance: Greenwich Insurance Company American Specialty Claims Representative: Mark Thompson 142 N. Main Street, Roanoke, IN 46783 Phone: 260-672-8800

More information

Getting round your Mac with Shortcut Keys

Getting round your Mac with Shortcut Keys The Mac has many useful keyboard shortcuts but these do depend on you knowing the difference between the following keys: Shift Fn Ctrl Alt (Also referred to as Option) Command (Also referred to as the

More information

A COMPARISON BETWEEN OBJECT-ORIENTED DATABASE SYSTEMS AND INFORMATION SYSTEM SHELLS

A COMPARISON BETWEEN OBJECT-ORIENTED DATABASE SYSTEMS AND INFORMATION SYSTEM SHELLS A COMPARISON BETWEEN OBJECT-ORIENTED DATABASE SYSTEMS AND INFORMATION SYSTEM SHELLS ABSTRACT The work makes an overview of the main characteristics of object-oriented database systems (OODBS) and information

More information

VRF SYSTEM CENTRAL CONTROLLER ("Smart manager") WIRING

VRF SYSTEM CENTRAL CONTROLLER (Smart manager) WIRING VRF SYSTEM CENTRAL CONTROLLER ("Smart manager") WIRING Carrier provided ͳ ³ ² ¹» Û» ²» Ó±² ± ñý±² ± ñí» ²¹ ² ²» Carrier provided б» «² Ó ïîè ²¼±± Ü ¹ ññ ¹² Ó ²í ññ«î Ó±²» ± ½» ±² ±º» Ó ì ÐÝ ³«²»±«½½»

More information

[DP19] DN-500CD. Serial Command Protocol Guide

[DP19] DN-500CD. Serial Command Protocol Guide [DP19] Serial Command Protocol Guide Ver. 1.2 January 16, 2017 inmusic Brands, Inc. 1 1 Contents 2 General... 3 2.1 RS-232C Control... 3 3 Specification... 4 3.1 RS-232C Control... 4 4 Communication Protocol...

More information

DUROMETROS PORTATILES DE ALTA PRECISION

DUROMETROS PORTATILES DE ALTA PRECISION DUROMETROS PORTATILES DE ALTA PRECISION COMPUTEST SCX portable electronic hardness tester The proper solution for any hardness control issue DYNATEST SCX portable hardness tester HANDY ESATEST X portable

More information

Presentation for use with the textbook, Algorithm Design and Applications, by M. T. Goodrich and R. Tamassia, Wiley, 2015

Presentation for use with the textbook, Algorithm Design and Applications, by M. T. Goodrich and R. Tamassia, Wiley, 2015 Presentation for use with the textbook, Algorithm Design and Applications, by M. T. Goodrich and R. Tamassia, Wiley, 2015 Merge Sort 2015 Goodrich and Tamassia Merge Sort 1 Application: Internet Search

More information

Contrast. user s guide

Contrast. user s guide N Contrast chu U77777777V user s guide c P font faq HOW TO INSTALL YOUR FONT You will receive your files as a zipped folder. For instructions on how to unzip your folder, visit LauraWorthingtonType.com/faqs/.

More information

Database Applications (15-415)

Database Applications (15-415) Database Applications (15-415) DBMS Internals- Part V Lecture 13, March 10, 2014 Mohammad Hammoud Today Welcome Back from Spring Break! Today Last Session: DBMS Internals- Part IV Tree-based (i.e., B+

More information

Database Technology. Topic 7: Data Structures for Databases. Olaf Hartig.

Database Technology. Topic 7: Data Structures for Databases. Olaf Hartig. Topic 7: Data Structures for Databases Olaf Hartig olaf.hartig@liu.se Database System 2 Storage Hierarchy Traditional Storage Hierarchy CPU Cache memory Main memory Primary storage Disk Tape Secondary

More information

Storage hierarchy. Textbook: chapters 11, 12, and 13

Storage hierarchy. Textbook: chapters 11, 12, and 13 Storage hierarchy Cache Main memory Disk Tape Very fast Fast Slower Slow Very small Small Bigger Very big (KB) (MB) (GB) (TB) Built-in Expensive Cheap Dirt cheap Disks: data is stored on concentric circular

More information

Custom Reorder Point Report IM-1218

Custom Reorder Point Report IM-1218 Custom Reorder Point Report IM-1218 Overview This Extended Solution to the Inventory Management module adds a new Custom Reorder Point Report. Installation Before installing this Extended Solution, please

More information

Hiroki Yasuga, Elisabeth Kolp, Andreas Lang. 25th September 2014, Scientific Programming

Hiroki Yasuga, Elisabeth Kolp, Andreas Lang. 25th September 2014, Scientific Programming Hiroki Yasuga, Elisabeth Kolp, Andreas Lang 25th September 2014, Scientific Programming What is sorting and complexity? Big O notation Sorting algorithms: Merge sort Quick sort Comparison: Merge sort &

More information

Computer Algorithms. Introduction to Algorithm

Computer Algorithms. Introduction to Algorithm Computer Algorithms Introduction to Algorithm CISC 4080 Yanjun Li 1 What is Algorithm? An Algorithm is a sequence of well-defined computational steps that transform the input into the output. These steps

More information

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

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

More information

Sorting. Divide-and-Conquer 1

Sorting. Divide-and-Conquer 1 Sorting Divide-and-Conquer 1 Divide-and-Conquer 7 2 9 4 2 4 7 9 7 2 2 7 9 4 4 9 7 7 2 2 9 9 4 4 Divide-and-Conquer 2 Divide-and-Conquer Divide-and conquer is a general algorithm design paradigm: Divide:

More information

Infusion Pump CODAN ARGUS 717 / 718 V - Release Notes. Firmware V

Infusion Pump CODAN ARGUS 717 / 718 V - Release Notes. Firmware V Infusion Pump CODAN ARGUS 717 / 718 V - Release Notes Firmware V5.06.20165 Version Firmware V.5.06.20165 Release Date 28-May-2014 Update Type Optional Recommended Required (Field Safety Notice 1/2014 and

More information

Divide and Conquer Sorting Algorithms and Noncomparison-based

Divide and Conquer Sorting Algorithms and Noncomparison-based Divide and Conquer Sorting Algorithms and Noncomparison-based Sorting Algorithms COMP1927 16x1 Sedgewick Chapters 7 and 8 Sedgewick Chapter 6.10, Chapter 10 DIVIDE AND CONQUER SORTING ALGORITHMS Step 1

More information

Dynamic Fault-Tolerant Routing in Cube-Based Multicomputers

Dynamic Fault-Tolerant Routing in Cube-Based Multicomputers : Dynamic Fault-Tolerant Routing in Cube-Based Multicomputers ABSTRACT The safety level model is a special coded fault information model designed to support fault-tolerant routing in hypercubes. In this

More information

Calligraphic Packing. Craig S. Kaplan. Computer Graphics Lab David R. Cheriton School of Computer Science University of Waterloo. GI'07 May 28, 2007

Calligraphic Packing. Craig S. Kaplan. Computer Graphics Lab David R. Cheriton School of Computer Science University of Waterloo. GI'07 May 28, 2007 Calligraphic Packing Jie Xu Craig S. Kaplan Computer Graphics Lab David R. Cheriton School of Computer Science University of Waterloo GI'07 May 28, 2007 Outline 1 Background of NPR Packing Artistic Packing

More information