Lecture 12: PI/T parallel I/O, part II

Size: px
Start display at page:

Download "Lecture 12: PI/T parallel I/O, part II"

Transcription

1 Lecture 12: PI/T parallel I/O, part II Terms ad defiitios PI/T modes of operatio Modes ad sub-modes A example i C lauae Microprocessor-based System Desi Wriht State Uiversity 1

2 Term ad symbol defiitios Pi-defiable Vs. No Pi-defiable Pi-defiable Used whe each pi i a port ca be idividually prorammed to act either as a iput lie or as a output lie. The directio of each pi is defied i the port s PxDDR Not pi-defiable Used whe ALL the bits i the port act as either iput lies or as output lies Latched Vs. No-latched Latched The value read by the CPU at the port reflects the state of the iput pi at the momet is was latched (i.e., whe the iput strobe was asserted) No-latched The value read by the CPU at the port reflects the state of the iput pi at the momet is is read (i.e., istataeous value) Uidirectioal Vs. Bidirectioal Uidirectioal (Modes 0 ad 1) The directio of data flow is determied by the PxDDR ad ca oly be modified by recofiuri this reister Bidirectioal (Modes 2 ad 3): Data ca flow i ay directio ad the cotets of the PxDDR are iored. Primary Data Directio The directio of the data trasfer that permits doublebufferi NPd* I/O port D 0 D 7 Iputs Outputs Iput strobe Uidirectioal Sile-buffered No-latched LEGEND Bidirectioal Pi-defiable Double-buffered *NPd: This is the ONLY mode that is Not Pi-defiable Microprocessor-based System Desi Wriht State Uiversity 2

3 The PI/T s modes of operatio PI/T operati modes PGCR cofi. 0 0 Mode 0 PGCR 0 1 Mode 1 PGCR 1 0 Mode 2 PGCR 1 1 Mode 3 PGCR Mode Uidirectioal 8-bit mode Uidirectioal 16-bit mode Bidirectioal 8-bit mode Bidirectioal 16-bit mode Data reister arraemet A B A B A B A B Submodes 00 Pi-defiable doublebuffered iput or silebuffered output 01 Pi-defiable doublebuffered output or o-latched iput X0 Pi-defiable doublebuffered iput or silebuffered output 01 Pi-defiable doublebuffered output or o-latched iput Port A is pi-defiable sile-buffered output or o-latched iput. Port B is double-buffered bidirectioal I/O Ports A ad B form a sile bidirectioal 16-bit port 1X Pi-defiable silebuffered output or o-latched iput Microprocessor-based System Desi Wriht State Uiversity 3

4 The PI/T s modes of operatio Mode 0 (1D/8bit) Mode 1 (1D/16bit) Mode 2 (2D/8bit) Mode 3 (2D/16bit) Sub-mode 00 A(B) [8] () () Sub-mode X0 A+B [16] A [8] B [8] Output Xfers Iput Xfers A+B [16] Output Xfers Iput Xfers Sub-mode 01 A(B) [8] () () Sub-mode X1 A+B [16] LEGEND Uidirectioal Double-buffered Sub-mode 1X A(B) [8] () () NPd* Bidirectioal Sile-buffered No-latched *NPd: This is the ONLY mode that is Not Pi-defiable Microprocessor-based System Desi Wriht State Uiversity 4

5 Mode 0, sub-mode 00 Data flow Double-buffered iput or Sile-buffered output Applicatios Normally used to receive data from devices such as A/D coverters Hadshaki Data is latched ito the iput reister by the asserted ede of behaves accordi to its prorammi fuctio defied below Port B behaves idetically (usi ad ) A(B) [8] () () Bit PACR7 PACR6 PACR5 PACR4 PACR3 PACR2 PACR1 PACR0 0 0 Cotrol It. Cotrol Sub-mode 00 PACR5 PACR4 PACR3 Cotrol S 0 X X Iput pi: Ede-sesitive iput Set o asserted ede Output pi: eated Always clear Output pi: asserted Always clear Output pi: iterlocked iput hadshake Always clear Output pi: pulsed iput hadshake Always clear PACR2 iterrupt 0 iterrupt disabled 1 iterrupt eabled PACR1 PACR0 Cotrol 0 X iterrupt ad DMA request disabled 1 X iterrupt ad DMA request eabled X X S status set aytime data is available i the double-buffered iput path Microprocessor-based System Desi Wriht State Uiversity 5

6 Mode 0, submode 00: example Cofiure the PI/T i mode 0, sub-mode 00 where Port A Bits 7 ad 6 of port A are used for output Bits 5 to 0 of port A are used for iput Pulsed hadshake is used i the primary directio Hadshake sials of Port A are active-hih Iterrupts are disabled PIT EQU $FE8001 ;PI/T base address o the SBC68K PGCR EQU $00 ;offset of PGCR PACR EQU $0C ;offset of PACG PADDR EQU $04 ;offset of PADDR PADR EQU $10 ;offset of PADR setup LEA PIT,A0 ;A0 poits to the PI/T s base address MOVE.B #% , PGCR(A0) ;setup PGCR for mode 0 operatio MOVE.B #% , PACG(A0) ;setup port A for submode 00 operatio * ;with pulsed output hadshake MOVE.B #% , PADDR(A0) ;setup bits 7,6 as outputs, 0 to 5 as iputs MOVE.B #% , PGCR(A0) ;eable 2 ad make, active-hih * ;ote that 2 is set to eable ad RTS sed MOVE.B D0,PADR(A0) ;write to port A to output bits 7 ad 6 RTS receive MOVE.B PADR(A0),D0 ;read from port A to iput bits 5 to 0 RTS Microprocessor-based System Desi Wriht State Uiversity 6

7 Mode 0, sub-mode 01 Data flow Double-buffered output or No-latched iput Applicatios Normally used to sed data to devices such as D/A coverters or priters Tables are almost idetical to 0/00 except for PACR0 If PACR0=0, S is set whe port A is half-empty If PACR0=1, S is set whe port A is full-empty Port B cotrol is idetical (usi ad, of course) A(B) [8] () () Bit PACR7 PACR6 PACR5 PACR4 PACR3 PACR2 PACR1 PACR0 0 1 Cotrol It. Cotrol Sub-mode 01 PACR5 PACR4 PACR3 Cotrol S 0 X X Iput pi: Ede-sesitive iput Set o asserted ede Output pi: eated Always clear Output pi: asserted Always clear Output pi: iterlocked iput hadshake Always clear Output pi: pulsed iput hadshake Always clear PACR2 iterrupt 0 iterrupt disabled 1 iterrupt eabled PACR1 PACR0 Cotrol 0 X iterrupt ad DMA request disabled 1 X iterrupt ad DMA request eabled X 0 S status set if either iitial or fial output latches ca accept data ad cleared otherwise X 1 S status set if both iitial ad fial output latches are empty ad cleared otherwise Microprocessor-based System Desi Wriht State Uiversity 7

8 Mode 0, sub-mode 1X Data flow Sile-buffered output or No-latched iput Applicatios A simple eeral-purpose bit I/O facility i which the various bits may be used idividually to perform iput or output as required cotrol is ede-sesitive ad plays NO ROLE i ay hadshaki may be prorammed as a ede-sesitive iput that sets bit S whe asserted Port B behaves idetically (usi ad ) A(B) [8] () () Bit PACR7 PACR6 PACR5 PACR4 PACR3 PACR2 PACR1 PACR0 1 X Cotrol It. Cotrol Sub-mode 1X PACR5 PACR4 PACR3 Cotrol S 0 X X Iput pi: Ede-sesitive iput Set o asserted ede 1 X 0 Output pi: eated Always clear 1 X 1 Output pi: asserted Always clear PACR2 iterrupt 0 iterrupt disabled 1 iterrupt eabled PACR1 PACR0 Cotrol 0 X iterrupt disabled 1 X iterrupt eabled X X is ede-sesitive iput: S status set by the asserted ede of Microprocessor-based System Desi Wriht State Uiversity 8

9 Mode 1, sub-mode X0 Data flow Double-buffered iput or Sile-buffered output Port A should cotai the Most Siificat Byte i the word The MOVEP.W PADR(A0),DO istructio will behave as follows: [DO(8:15)] [PADR(A0)] [DO(0:7)] [PBDR(A0)] The operatio of the port is cotrolled by PBCR ad (,) Port A Cotrol Reister used to provide additioal facilities with sials ad A+B [16] Bit PACR7 PACR6 PACR5 PACR4 PACR3 PACR2 PACR1 PACR0 0 0 Cotrol It. Cotrol Sub-mode XX PACR0-PACR5 behave exactly as i Mode 0, submode 1X Bit PBCR7 PBCR6 PBCR5 PBCR4 PBCR3 PBCR2 PBCR1 PBCR0 X 0 Cotrol It. Cotrol Sub-mode X0 PBCR5 PBCR4 PBCR3 Cotrol S 0 X X Iput pi: Ede-sesitive iput Set o asserted ede Output pi: eated Always clear Output pi: asserted Always clear Output pi: iterlocked iput hadshake Always clear Output pi: pulsed iput hadshake Always clear PBCR2 iterrupt 0 iterrupt disabled 1 iterrupt eabled PBCR1 PBCR0 Cotrol 0 X iterrupt ad DMA request disabled 1 X iterrupt ad DMA request eabled X X S status set if data preset i double-buffered iput path Microprocessor-based System Desi Wriht State Uiversity 9

10 Mode 1, sub-mode X1 Data flow Double-buffered output or No-latched iput Writi to the PI/T the MSB should be writte to Port A ad the LSB to port B IN THIS ORDER The operatio of the port is similar to Mode 1/X0 except for PBCR0 A+B [16] Bit PACR7 PACR6 PACR5 PACR4 PACR3 PACR2 PACR1 PACR0 0 0 Cotrol It. Cotrol Sub-mode XX PACR0-PACR5 behave exactly as i Mode 0, submode 1X Bit PBCR7 PBCR6 PBCR5 PBCR4 PBCR3 PBCR2 PBCR1 PBCR0 X 1 Cotrol It. Cotrol Sub-mode X1 PBCR5 PBCR4 PBCR3 Cotrol S 0 X X Iput pi: Ede-sesitive iput Set o asserted ede Output pi: eated Always clear Output pi: asserted Always clear Output pi: iterlocked iput hadshake Always clear Output pi: pulsed iput hadshake Always clear PBCR2 iterrupt 0 iterrupt disabled 1 iterrupt eabled PBCR1 PBCR0 Cotrol 0 X iterrupt ad DMA request disabled 1 X iterrupt ad DMA request eabled X 0 S status set wheever the iitial or fial output latches ca accept ew data ad cleared if both latches are full X 1 S status set whe BOTH the iitial or fial output latch are empty ad cleared if at least oe latch is full Microprocessor-based System Desi Wriht State Uiversity 10

11 Mode 2 Data flow Port A is uidirectioal (directio is determied by PADDR as usual) o-latched iput or sile-buffered output Port B is bidirectioal, double-buffered, o-pi addressable I/O (PBDDR is iored) All the hadshake sials are associated with Port B ad cotrol output trasfers Data writte by the CPU is passed to the peripheral whe the latter asserts ad cotrol iput trasfers Data latched o the asserted ede of A [8] B [8] Output Xfers Iput Xfers Bit PACR7 PACR6 PACR5 PACR4 PACR3 PACR2 PACR1 PACR0 X X mode Iterrupt Cotrol do t care PACR5 PACR4 PACR3 iterrupt S X X 0 Output pi: Iterlocked output hadshake Always cleared X X 1 Output pi: Pulsed output hadshake Always cleared PACR2 iterrupt 0 iterrupt disabled 1 iterrupt eabled PACR1 PACR0 Cotrol 0 X iterrupt ad DMA request disabled 1 X iterrupt ad DMA request eabled X 0 S status set if iitial or fial output latches ca accept data ad cleared otherwise X 1 S status set if both iitial ad fial output latches are empty ad cleared otherwise Bit PBCR7 PBCR6 PBCR5 PBCR4 PBCR3 PBCR2 PBCR1 PBCR0 X X mode Iterrupt Cotrol do t care PBCR5 PBCR4 PBCR3 iterrupt S X X 0 Output pi: Iterlocked output hadshake Always cleared X X 1 Output pi: Pulsed output hadshake Always cleared PBCR2 iterrupt 0 iterrupt disabled 1 iterrupt eabled PBCR1 PBCR0 Cotrol 0 X iterrupt ad DMA request disabled 1 X iterrupt ad DMA request eabled X X S status set if data is available i the double-buffered iput path Microprocessor-based System Desi Wriht State Uiversity 11

12 Mode 3 Data flow Both ports act like a 16-bit bidirectioal, double-buffered, o-pi addressable I/O port Applicatios Relatively hih speed data trasfers Keep i mid that the PI/T-CPU data bus is 8-bit wide so two R/W cycles are ecessary Hadshake sials are similar to Mode 2 ad cotrol output trasfers ad cotrol iput trasfers A+B [16] Output Xfers Iput Xfers Bit PACR7 PACR6 PACR5 PACR4 PACR3 PACR2 PACR1 PACR0 X X mode Iterrupt Cotrol do t care PACR5 PACR4 PACR3 iterrupt S X X 0 Output pi: Iterlocked output hadshake Always cleared X X 1 Output pi: Pulsed output hadshake Always cleared PACR2 iterrupt 0 iterrupt disabled 1 iterrupt eabled PACR1 PACR0 Cotrol 0 X iterrupt ad DMA request disabled 1 X iterrupt ad DMA request eabled X 0 S status set if iitial or fial output latches ca accept data ad cleared otherwise X 1 S status set if both iitial ad fial output latches are empty ad cleared otherwise Bit PBCR7 PBCR6 PBCR5 PBCR4 PBCR3 PBCR2 PBCR1 PBCR0 X X mode Iterrupt Cotrol do t care PBCR5 PBCR4 PBCR3 iterrupt S X X 0 Output pi: Iterlocked output hadshake Always cleared X X 1 Output pi: Pulsed output hadshake Always cleared PBCR2 iterrupt 0 iterrupt disabled 1 iterrupt eabled PBCR1 PBCR0 Cotrol 0 X iterrupt ad DMA request disabled 1 X iterrupt ad DMA request eabled X X S status set if data is available i the double-buffered iput path Microprocessor-based System Desi Wriht State Uiversity 12

13 A example i C lauae Write a C proram to Read data from Port A i a o-latched fashio Write the data from Port A to Port B i a sile-buffered fashio This procedure should be performed periodically every 5 secods USE TIMER INTERRUPTS!!! The vector umber is 70 (decimal) Microprocessor-based System Desi Wriht State Uiversity 13

14 Solutio /* Timer Reister Addresses */ #defie tmr ((usied char*) 0xFE8021) /* Timer Base Address */ #defie tcr (( usied char*) tmr) /* Timer Cotrol Re */ #defie tivr (( usied char*) tmr+?) /* Timer Iterrupt Vector Re */ #defie cprh (( usied char*) tmr+?) /* Preload Hi Re */ #defie cprm (( usied char*) tmr+?) /* Preload Mid Re */ #defie cprl (( usied char*) tmr+??) /* Preload Lo Re */ #defie crh (( usied char*) tmr+??) /* Couter Hi Re */ #defie crm (( usied char*) tmr+??) /* Couter Mid Re */ #defie crl (( usied char*) tmr+??) /* Couter Lo Re */ #defie tsr (( usied char*) tmr+??) /* Timer Status Re */ /* Parallel I/O Reister Addresses */ #defie PGCR ( usied char*)0xfe80?? /* PI/T Geeral Cotrol Re */ #defie PSRR ( usied char*)0xfe80?? /* PI/T Service Routie Re */ #defie PIVR ( usied char*)0xfe80?? /* PI/T Iterrupt Vector Re */ #defie PSR ( usied char*)0xfe80?? /* PI/T Status Re */ #defie PACR ( usied char*)0xfe80?? /* PI/T Port A Cotrol Re */ #defie PADDR ( usied char*)0xfe80?? /* Port A Data Directio Re */ #defie PADR ( usied char*)0xfe80?? /* Port A Data Re */ #defie PBCR ( usied char*)0xfe80?? /* Port B Cotrol Re */ #defie PBDDR ( usied char*)0xfe80?? /* Port B Data Directio Re */ #defie PBDR ( usied char*)0xfe80?? /* Port B Data Re */ void isr() { pritf("five secs has passed\"); *pbdr = *padr ; /* This is really the mai job of isr * It copies the cotet porta data resiter (our iput port) ad the places it to port B (our output port)*/ mai () { lo *vtable; it cout=?; asm( move.w #$2400,SR"); asm( movea.l #$20000,SP); *PGCR = 0x??; /* disable Port A & B */ *PADDR = 0x??; /* Set Port A as iput */ *PBDDR = 0x??; /* set Port B as Output */ *PSRR = 0x??; /* set PI/T for o Iterrupts */ *PBCR = 0x??; /*0r 0x??*/ /* Set Port B Cotrol */ *PACR = 0x??; /*0r 0x??*/ /* Set Port A Cotrol */ /****Prepare CPU for a iterrupt processi**/ *tivr =??; vtable = (lo *) (??*?); *vtable = isr; /****Set up timer cotrol reister*/ *tcr = 0x??; /* Set Timer Mode */ *cprl = (usied char) cout; cout = cout >> 8; /* shift riht 8 bits */ *cprm = (usied char) cout; cout = cout >> 8; /* shift riht 8 bits */ *cprh = (usied char) cout; *tcr = 0x??; /* Start timer */ } *tsr = 0x01; /* reset the ZDS bit */ asm(" rte"); while (1) { /* Create a ifiite loop which does othi*/ } } Microprocessor-based System Desi Wriht State Uiversity 14

15 Solutio /* Timer Reister Addresses */ #defie tmr ((usied char*) 0xFE8021) /* Timer Base Address */ #defie tcr (( usied char*) tmr) /* Timer Cotrol Re */ #defie tivr (( usied char*) tmr+2) /* Timer Iterrupt Vector Re */ #defie cprh (( usied char*) tmr+6) /* Preload Hi Re */ #defie cprm (( usied char*) tmr+8) /* Preload Mid Re */ #defie cprl (( usied char*) tmr+10) /* Preload Lo Re */ #defie crh (( usied char*) tmr+14) /* Couter Hi Re */ #defie crm (( usied char*) tmr+16) /* Couter Mid Re */ #defie crl (( usied char*) tmr+18) /* Couter Lo Re */ #defie tsr (( usied char*) tmr+20) /* Timer Status Re */ /* Parallel I/O Reister Addresses */ #defie PGCR ( usied char*)0xfe8001 /* PI/T Geeral Cotrol Re */ #defie PSRR ( usied char*)0xfe8003 /* PI/T Service Routie Re */ #defie PIVR ( usied char*)0xfe800b /* PI/T Iterrupt Vector Re */ #defie PSR ( usied char*)0xfe801b /* PI/T Status Re */ #defie PACR ( usied char*)0xfe800d /* PI/T Port A Cotrol Re */ #defie PADDR ( usied char*)0xfe8005 /* Port A Data Directio Re */ #defie PADR ( usied char*)0xfe8011 /* Port A Data Re */ #defie PBCR ( usied char*)0xfe800f /* Port B Cotrol Re */ #defie PBDDR ( usied char*)0xfe8007 /* Port B Data Directio Re */ #defie PBDR ( usied char*)0xfe8013 /* Port B Data Re */ void isr() { pritf("five secs has passed\"); *pbdr = *padr ; /* This is really the mai job of isr * It copies the cotet porta data resiter (our iput port) ad the places it to port B (our output port)*/ mai () { lo *vtable; it cout= ; asm( move.w #$2400,SR"); asm( movea.l #$20000,SP); *PGCR = 0x0F; /* disable Port A & B */ *PADDR = 0x00; /* Set Port A as iput */ *PBDDR = 0xFF; /* set Port B as Output */ *PSRR = 0x00; /* set PI/T for o Iterrupts */ *PBCR = 0x00; /*0r 0x80*/ /* Set Port B Cotrol */ *PACR = 0x40; /*0r 0x80*/ /* Set Port A Cotrol */ /****Prepare CPU for a iterrupt processi**/ *tivr = 70; vtable = (lo *) (70*4); *vtable = isr; /****Set up timer cotrol reister*/ *tcr = 0xA0; /* Set Timer Mode */ *cprl = (usied char) cout; cout = cout >> 8; /* shift riht 8 bits */ *cprm = (usied char) cout; cout = cout >> 8; /* shift riht 8 bits */ *cprh = (usied char) cout; *tcr = 0xA1; /* Start timer */ } *tsr = 0x01; /* reset the ZDS bit */ asm(" rte"); while (1) { /* Create a ifiite loop which does othi*/ } } Microprocessor-based System Desi Wriht State Uiversity 15

Lecture 2: MC68000 interrupt in C language

Lecture 2: MC68000 interrupt in C language Lecture 2: MC68000 iterrupt i C lauae Problem defiitio Vectored iterrupts The vector table Itroductio to the PI/T Basic PI/T operatio C lauae solutio Desi of Computi Systems Ricardo Gutierrez-Osua Wriht

More information

Lecture 11: PI/T parallel I/O, part I

Lecture 11: PI/T parallel I/O, part I Lecture 11: PI/T parallel I/O, part I Geeral descriptio of the parallel I/O fuctio Bufferi Hadshaki Iput ad Output trasfers Timi Diarams Reister model of the 68230 Port Geeral Cotrol Reister (PGCR) Port

More information

The Motorola PI/T

The Motorola PI/T The Motorola 623 PI/T bits wide H-H4 Port A Port A Data Register, PADR: $FF Data Direction Register, PADDR: $FF4 Port A Register, PACR: $FFC TCR TSR bits wide Port B Port B Data Register, PBDR: $FF2 Data

More information

The terminal display function can be done using HexOut.

The terminal display function can be done using HexOut. INTERRUPT TIMED CLOCK ABSTRACT: This laboratory will introduce the student to the generation of interrupts (using a programmable timer), the handling of an interrupt, and the priority of interrupts. This

More information

CSC 220: Computer Organization Unit 11 Basic Computer Organization and Design

CSC 220: Computer Organization Unit 11 Basic Computer Organization and Design College of Computer ad Iformatio Scieces Departmet of Computer Sciece CSC 220: Computer Orgaizatio Uit 11 Basic Computer Orgaizatio ad Desig 1 For the rest of the semester, we ll focus o computer architecture:

More information

MEMORY-MAPPED I /O. Universiti Teknikal Malaysia Melaka. Input/Output System Design

MEMORY-MAPPED I /O. Universiti Teknikal Malaysia Melaka. Input/Output System Design Universiti Teknikal Malaysia Melaka Faculty of Electronics and Computer Engineering Department of Computer Engineering BENM 2123 MICROPROCESSOR TECHNOLOGY Instead of connecting to auxiliary memory, address

More information

K-NET bus. When several turrets are connected to the K-Bus, the structure of the system is as showns

K-NET bus. When several turrets are connected to the K-Bus, the structure of the system is as showns K-NET bus The K-Net bus is based o the SPI bus but it allows to addressig may differet turrets like the I 2 C bus. The K-Net is 6 a wires bus (4 for SPI wires ad 2 additioal wires for request ad ackowledge

More information

Computer Architecture. Microcomputer Architecture and Interfacing Colorado School of Mines Professor William Hoff

Computer Architecture. Microcomputer Architecture and Interfacing Colorado School of Mines Professor William Hoff Computer rchitecture Microcomputer rchitecture ad Iterfacig Colorado School of Mies Professor William Hoff Computer Hardware Orgaizatio Processor Performs all computatios; coordiates data trasfer Iput

More information

CMSC Computer Architecture Lecture 12: Virtual Memory. Prof. Yanjing Li University of Chicago

CMSC Computer Architecture Lecture 12: Virtual Memory. Prof. Yanjing Li University of Chicago CMSC 22200 Computer Architecture Lecture 12: Virtual Memory Prof. Yajig Li Uiversity of Chicago A System with Physical Memory Oly Examples: most Cray machies early PCs Memory early all embedded systems

More information

Chapter 4 The Datapath

Chapter 4 The Datapath The Ageda Chapter 4 The Datapath Based o slides McGraw-Hill Additioal material 24/25/26 Lewis/Marti Additioal material 28 Roth Additioal material 2 Taylor Additioal material 2 Farmer Tae the elemets that

More information

DATA SHEET AND USER GUIDE

DATA SHEET AND USER GUIDE V L S I I P O W N E D B Y A V I R A L M I T T A L Mp3HufDec DATA SHEET AND USER GUIDE Mp3HufDec ISO 11172-3 LAYER III HUFFMAN DECODER. ISO 11172-3 Layer III or commoly called as Mp3, employs Huffma ecodi

More information

End Semester Examination CSE, III Yr. (I Sem), 30002: Computer Organization

End Semester Examination CSE, III Yr. (I Sem), 30002: Computer Organization Ed Semester Examiatio 2013-14 CSE, III Yr. (I Sem), 30002: Computer Orgaizatio Istructios: GROUP -A 1. Write the questio paper group (A, B, C, D), o frot page top of aswer book, as per what is metioed

More information

Elementary Educational Computer

Elementary Educational Computer Chapter 5 Elemetary Educatioal Computer. Geeral structure of the Elemetary Educatioal Computer (EEC) The EEC coforms to the 5 uits structure defied by vo Neuma's model (.) All uits are preseted i a simplified

More information

EE 459/500 HDL Based Digital Design with Programmable Logic. Lecture 13 Control and Sequencing: Hardwired and Microprogrammed Control

EE 459/500 HDL Based Digital Design with Programmable Logic. Lecture 13 Control and Sequencing: Hardwired and Microprogrammed Control EE 459/500 HDL Based Digital Desig with Programmable Logic Lecture 13 Cotrol ad Sequecig: Hardwired ad Microprogrammed Cotrol Refereces: Chapter s 4,5 from textbook Chapter 7 of M.M. Mao ad C.R. Kime,

More information

Fundamentals of. Chapter 1. Microprocessor and Microcontroller. Dr. Farid Farahmand. Updated: Tuesday, January 16, 2018

Fundamentals of. Chapter 1. Microprocessor and Microcontroller. Dr. Farid Farahmand. Updated: Tuesday, January 16, 2018 Fudametals of Chapter 1 Microprocessor ad Microcotroller Dr. Farid Farahmad Updated: Tuesday, Jauary 16, 2018 Evolutio First came trasistors Itegrated circuits SSI (Small-Scale Itegratio) to ULSI Very

More information

Chapter 9. Pointers and Dynamic Arrays. Copyright 2015 Pearson Education, Ltd.. All rights reserved.

Chapter 9. Pointers and Dynamic Arrays. Copyright 2015 Pearson Education, Ltd.. All rights reserved. Chapter 9 Poiters ad Dyamic Arrays Copyright 2015 Pearso Educatio, Ltd.. All rights reserved. Overview 9.1 Poiters 9.2 Dyamic Arrays Copyright 2015 Pearso Educatio, Ltd.. All rights reserved. Slide 9-3

More information

APPLICATION NOTE PACE1750AE BUILT-IN FUNCTIONS

APPLICATION NOTE PACE1750AE BUILT-IN FUNCTIONS APPLICATION NOTE PACE175AE BUILT-IN UNCTIONS About This Note This applicatio brief is iteded to explai ad demostrate the use of the special fuctios that are built ito the PACE175AE processor. These powerful

More information

EE University of Minnesota. Midterm Exam #1. Prof. Matthew O'Keefe TA: Eric Seppanen. Department of Electrical and Computer Engineering

EE University of Minnesota. Midterm Exam #1. Prof. Matthew O'Keefe TA: Eric Seppanen. Department of Electrical and Computer Engineering EE 4363 1 Uiversity of Miesota Midterm Exam #1 Prof. Matthew O'Keefe TA: Eric Seppae Departmet of Electrical ad Computer Egieerig Uiversity of Miesota Twi Cities Campus EE 4363 Itroductio to Microprocessors

More information

Python Programming: An Introduction to Computer Science

Python Programming: An Introduction to Computer Science Pytho Programmig: A Itroductio to Computer Sciece Chapter 1 Computers ad Programs 1 Objectives To uderstad the respective roles of hardware ad software i a computig system. To lear what computer scietists

More information

1. SWITCHING FUNDAMENTALS

1. SWITCHING FUNDAMENTALS . SWITCING FUNDMENTLS Switchig is the provisio of a o-demad coectio betwee two ed poits. Two distict switchig techiques are employed i commuicatio etwors-- circuit switchig ad pacet switchig. Circuit switchig

More information

Module Instantiation. Finite State Machines. Two Types of FSMs. Finite State Machines. Given submodule mux32two: Instantiation of mux32two

Module Instantiation. Finite State Machines. Two Types of FSMs. Finite State Machines. Given submodule mux32two: Instantiation of mux32two Give submodule mux32two: 2-to- MUX module mux32two (iput [3:] i,i, iput sel, output [3:] out); Module Istatiatio Fiite Machies esig methodology for sequetial logic -- idetify distict s -- create trasitio

More information

Ones Assignment Method for Solving Traveling Salesman Problem

Ones Assignment Method for Solving Traveling Salesman Problem Joural of mathematics ad computer sciece 0 (0), 58-65 Oes Assigmet Method for Solvig Travelig Salesma Problem Hadi Basirzadeh Departmet of Mathematics, Shahid Chamra Uiversity, Ahvaz, Ira Article history:

More information

Lecture 13: Validation

Lecture 13: Validation Lecture 3: Validatio Resampli methods Holdout Cross Validatio Radom Subsampli -Fold Cross-Validatio Leave-oe-out The Bootstrap Bias ad variace estimatio Three-way data partitioi Itroductio to Patter Recoitio

More information

COMPUTER ORGANIZATION AND DESIGN The Hardware/Software Interface. Chapter 4. The Processor. Part A Datapath Design

COMPUTER ORGANIZATION AND DESIGN The Hardware/Software Interface. Chapter 4. The Processor. Part A Datapath Design COMPUTER ORGANIZATION AND DESIGN The Hardware/Software Iterface 5 th Editio Chapter The Processor Part A path Desig Itroductio CPU performace factors Istructio cout Determied by ISA ad compiler. CPI ad

More information

Reversible Realization of Quaternary Decoder, Multiplexer, and Demultiplexer Circuits

Reversible Realization of Quaternary Decoder, Multiplexer, and Demultiplexer Circuits Egieerig Letters, :, EL Reversible Realizatio of Quaterary Decoder, Multiplexer, ad Demultiplexer Circuits Mozammel H.. Kha, Member, ENG bstract quaterary reversible circuit is more compact tha the correspodig

More information

L6: FSMs and Synchronization

L6: FSMs and Synchronization L6: FSMs ad Sychroizatio Ackowledgemets: Materials i this lecture are courtesy of the followig sources ad are used with permissio. Rex Mi J. Rabaey, A. Chadrakasa, B. Nikolic. igital Itegrated Circuits:

More information

Quality of Service. Spring 2018 CS 438 Staff - University of Illinois 1

Quality of Service. Spring 2018 CS 438 Staff - University of Illinois 1 Quality of Service Sprig 2018 CS 438 Staff - Uiversity of Illiois 1 Quality of Service How good are late data ad lowthroughput chaels? It depeds o the applicatio. Do you care if... Your e-mail takes 1/2

More information

CIS 121 Data Structures and Algorithms with Java Spring Stacks and Queues Monday, February 12 / Tuesday, February 13

CIS 121 Data Structures and Algorithms with Java Spring Stacks and Queues Monday, February 12 / Tuesday, February 13 CIS Data Structures ad Algorithms with Java Sprig 08 Stacks ad Queues Moday, February / Tuesday, February Learig Goals Durig this lab, you will: Review stacks ad queues. Lear amortized ruig time aalysis

More information

Avid Interplay Bundle

Avid Interplay Bundle Avid Iterplay Budle Versio 2.5 Cofigurator ReadMe Overview This documet provides a overview of Iterplay Budle v2.5 ad describes how to ru the Iterplay Budle cofiguratio tool. Iterplay Budle v2.5 refers

More information

Recursion. Computer Science S-111 Harvard University David G. Sullivan, Ph.D. Review: Method Frames

Recursion. Computer Science S-111 Harvard University David G. Sullivan, Ph.D. Review: Method Frames Uit 4, Part 3 Recursio Computer Sciece S-111 Harvard Uiversity David G. Sulliva, Ph.D. Review: Method Frames Whe you make a method call, the Java rutime sets aside a block of memory kow as the frame of

More information

Lecture 3. RTL Design Methodology. Transition from Pseudocode & Interface to a Corresponding Block Diagram

Lecture 3. RTL Design Methodology. Transition from Pseudocode & Interface to a Corresponding Block Diagram Lecture 3 RTL Desig Methodology Trasitio from Pseudocode & Iterface to a Correspodig Block Diagram Structure of a Typical Digital Data Iputs Datapath (Executio Uit) Data Outputs System Cotrol Sigals Status

More information

Algorithm. Counting Sort Analysis of Algorithms

Algorithm. Counting Sort Analysis of Algorithms Algorithm Coutig Sort Aalysis of Algorithms Assumptios: records Coutig sort Each record cotais keys ad data All keys are i the rage of 1 to k Space The usorted list is stored i A, the sorted list will

More information

Bezier curves. Figure 2 shows cubic Bezier curves for various control points. In a Bezier curve, only

Bezier curves. Figure 2 shows cubic Bezier curves for various control points. In a Bezier curve, only Edited: Yeh-Liag Hsu (998--; recommeded: Yeh-Liag Hsu (--9; last updated: Yeh-Liag Hsu (9--7. Note: This is the course material for ME55 Geometric modelig ad computer graphics, Yua Ze Uiversity. art of

More information

Overview. Chapter 18 Vectors and Arrays. Reminder. vector. Bjarne Stroustrup

Overview. Chapter 18 Vectors and Arrays. Reminder. vector. Bjarne Stroustrup Chapter 18 Vectors ad Arrays Bjare Stroustrup Vector revisited How are they implemeted? Poiters ad free store Destructors Iitializatio Copy ad move Arrays Array ad poiter problems Chagig size Templates

More information

Threads and Concurrency in Java: Part 1

Threads and Concurrency in Java: Part 1 Cocurrecy Threads ad Cocurrecy i Java: Part 1 What every computer egieer eeds to kow about cocurrecy: Cocurrecy is to utraied programmers as matches are to small childre. It is all too easy to get bured.

More information

Lecture 18. Optimization in n dimensions

Lecture 18. Optimization in n dimensions Lecture 8 Optimizatio i dimesios Itroductio We ow cosider the problem of miimizig a sigle scalar fuctio of variables, f x, where x=[ x, x,, x ]T. The D case ca be visualized as fidig the lowest poit of

More information

Threads and Concurrency in Java: Part 1

Threads and Concurrency in Java: Part 1 Threads ad Cocurrecy i Java: Part 1 1 Cocurrecy What every computer egieer eeds to kow about cocurrecy: Cocurrecy is to utraied programmers as matches are to small childre. It is all too easy to get bured.

More information

CS 111: Program Design I Lecture # 7: First Loop, Web Crawler, Functions

CS 111: Program Design I Lecture # 7: First Loop, Web Crawler, Functions CS 111: Program Desig I Lecture # 7: First Loop, Web Crawler, Fuctios Robert H. Sloa & Richard Warer Uiversity of Illiois at Chicago September 18, 2018 What will this prit? x = 5 if x == 3: prit("hi!")

More information

Classes and Objects. Again: Distance between points within the first quadrant. José Valente de Oliveira 4-1

Classes and Objects. Again: Distance between points within the first quadrant. José Valente de Oliveira 4-1 Classes ad Objects jvo@ualg.pt José Valete de Oliveira 4-1 Agai: Distace betwee poits withi the first quadrat Sample iput Sample output 1 1 3 4 2 jvo@ualg.pt José Valete de Oliveira 4-2 1 The simplest

More information

Recursion. Recursion. Mathematical induction: example. Recursion. The sum of the first n odd numbers is n 2 : Informal proof: Principle:

Recursion. Recursion. Mathematical induction: example. Recursion. The sum of the first n odd numbers is n 2 : Informal proof: Principle: Recursio Recursio Jordi Cortadella Departmet of Computer Sciece Priciple: Reduce a complex problem ito a simpler istace of the same problem Recursio Itroductio to Programmig Dept. CS, UPC 2 Mathematical

More information

Princeton University COS 217: Introduction to Programming Systems Fall 2005 Final Exam Answers

Princeton University COS 217: Introduction to Programming Systems Fall 2005 Final Exam Answers Priceto Uiversity COS 217: Itroductio to Programmig Systems Fall 2005 Fial Exam Aswers The exam was a three-hour, ope-book, ope-otes exam. Questio 1 (a) Sytax error: Ivalid declaratio statemet o lie 2.

More information

Computer Science Foundation Exam. August 12, Computer Science. Section 1A. No Calculators! KEY. Solutions and Grading Criteria.

Computer Science Foundation Exam. August 12, Computer Science. Section 1A. No Calculators! KEY. Solutions and Grading Criteria. Computer Sciece Foudatio Exam August, 005 Computer Sciece Sectio A No Calculators! Name: SSN: KEY Solutios ad Gradig Criteria Score: 50 I this sectio of the exam, there are four (4) problems. You must

More information

AN-946 APPLICATION NOTE

AN-946 APPLICATION NOTE A-946 APPLICATIO OTE One Technology Way P.O. Box 9106 orwood, MA 02062-9106, U.S.A. Tel: 781.329.4700 Fax: 781.461.3113 www.analog.com Flash/EE Memory Programming via LI Protocol 6 by Aude Richard ITRODUCTIO

More information

Digital System Design

Digital System Design July, 22 9:55 vra235_ch Sheet umber Page umber 65 black chapter Digital System Desig a b c d e f g h 8 7 6 5 4 3 2. Bd3 g6+, Ke8 d8 65 July, 22 9:55 vra235_ch Sheet umber 2 Page umber 66 black 66 CHAPTER

More information

Lecture 2. RTL Design Methodology. Transition from Pseudocode & Interface to a Corresponding Block Diagram

Lecture 2. RTL Design Methodology. Transition from Pseudocode & Interface to a Corresponding Block Diagram Lecture 2 RTL Desig Methodology Trasitio from Pseudocode & Iterface to a Correspodig Block Diagram Structure of a Typical Digital Data Iputs Datapath (Executio Uit) Data Outputs System Cotrol Sigals Status

More information

Lecture 1: Introduction and Strassen s Algorithm

Lecture 1: Introduction and Strassen s Algorithm 5-750: Graduate Algorithms Jauary 7, 08 Lecture : Itroductio ad Strasse s Algorithm Lecturer: Gary Miller Scribe: Robert Parker Itroductio Machie models I this class, we will primarily use the Radom Access

More information

Designing a learning system

Designing a learning system CS 75 Machie Learig Lecture Desigig a learig system Milos Hauskrecht milos@cs.pitt.edu 539 Seott Square, x-5 people.cs.pitt.edu/~milos/courses/cs75/ Admiistrivia No homework assigmet this week Please try

More information

Chapter 11. Friends, Overloaded Operators, and Arrays in Classes. Copyright 2014 Pearson Addison-Wesley. All rights reserved.

Chapter 11. Friends, Overloaded Operators, and Arrays in Classes. Copyright 2014 Pearson Addison-Wesley. All rights reserved. Chapter 11 Frieds, Overloaded Operators, ad Arrays i Classes Copyright 2014 Pearso Addiso-Wesley. All rights reserved. Overview 11.1 Fried Fuctios 11.2 Overloadig Operators 11.3 Arrays ad Classes 11.4

More information

Basic allocator mechanisms The course that gives CMU its Zip! Memory Management II: Dynamic Storage Allocation Mar 6, 2000.

Basic allocator mechanisms The course that gives CMU its Zip! Memory Management II: Dynamic Storage Allocation Mar 6, 2000. 5-23 The course that gives CM its Zip Memory Maagemet II: Dyamic Storage Allocatio Mar 6, 2000 Topics Segregated lists Buddy system Garbage collectio Mark ad Sweep Copyig eferece coutig Basic allocator

More information

On Infinite Groups that are Isomorphic to its Proper Infinite Subgroup. Jaymar Talledo Balihon. Abstract

On Infinite Groups that are Isomorphic to its Proper Infinite Subgroup. Jaymar Talledo Balihon. Abstract O Ifiite Groups that are Isomorphic to its Proper Ifiite Subgroup Jaymar Talledo Baliho Abstract Two groups are isomorphic if there exists a isomorphism betwee them Lagrage Theorem states that the order

More information

CS Polygon Scan Conversion. Slide 1

CS Polygon Scan Conversion. Slide 1 CS 112 - Polygo Sca Coversio Slide 1 Polygo Classificatio Covex All iterior agles are less tha 180 degrees Cocave Iterior agles ca be greater tha 180 degrees Degeerate polygos If all vertices are colliear

More information

condition w i B i S maximum u i

condition w i B i S maximum u i ecture 10 Dyamic Programmig 10.1 Kapsack Problem November 1, 2004 ecturer: Kamal Jai Notes: Tobias Holgers We are give a set of items U = {a 1, a 2,..., a }. Each item has a weight w i Z + ad a utility

More information

1. (a) Write a C program to display the texts Hello, World! on the screen. (2 points)

1. (a) Write a C program to display the texts Hello, World! on the screen. (2 points) 1. (a) Write a C program to display the texts Hello, World! o the scree. (2 poits) Solutio 1: pritf("hello, World!\"); Solutio 2: void mai() { pritf("hello, World!\"); (b) Write a C program to output a

More information

UNIVERSITY OF MORATUWA

UNIVERSITY OF MORATUWA UNIVERSITY OF MORATUWA FACULTY OF ENGINEERING DEPARTMENT OF COMPUTER SCIENCE & ENGINEERING B.Sc. Egieerig 2014 Itake Semester 2 Examiatio CS2052 COMPUTER ARCHITECTURE Time allowed: 2 Hours Jauary 2016

More information

EE123 Digital Signal Processing

EE123 Digital Signal Processing Last Time EE Digital Sigal Processig Lecture 7 Block Covolutio, Overlap ad Add, FFT Discrete Fourier Trasform Properties of the Liear covolutio through circular Today Liear covolutio with Overlap ad add

More information

Weston Anniversary Fund

Weston Anniversary Fund Westo Olie Applicatio Guide 2018 1 This guide is desiged to help charities applyig to the Westo to use our olie applicatio form. The Westo is ope to applicatios from 5th Jauary 2018 ad closes o 30th Jue

More information

State-space feedback 6 challenges of pole placement

State-space feedback 6 challenges of pole placement State-space feedbac 6 challeges of pole placemet J Rossiter Itroductio The earlier videos itroduced the cocept of state feedbac ad demostrated that it moves the poles. x u x Kx Bu It was show that whe

More information

Math Section 2.2 Polynomial Functions

Math Section 2.2 Polynomial Functions Math 1330 - Sectio. Polyomial Fuctios Our objectives i workig with polyomial fuctios will be, first, to gather iformatio about the graph of the fuctio ad, secod, to use that iformatio to geerate a reasoably

More information

. Written in factored form it is easy to see that the roots are 2, 2, i,

. Written in factored form it is easy to see that the roots are 2, 2, i, CMPS A Itroductio to Programmig Programmig Assigmet 4 I this assigmet you will write a java program that determies the real roots of a polyomial that lie withi a specified rage. Recall that the roots (or

More information

ELEG 5173L Digital Signal Processing Introduction to TMS320C6713 DSK

ELEG 5173L Digital Signal Processing Introduction to TMS320C6713 DSK Departmet of Electrical Egieerig Uiversity of Arasas ELEG 5173L Digital Sigal Processig Itroductio to TMS320C6713 DSK Dr. Jigia Wu wuj@uar.edu ANALOG V.S DIGITAL 2 Aalog sigal processig ASP Aalog sigal

More information

Computers and Scientific Thinking

Computers and Scientific Thinking Computers ad Scietific Thikig David Reed, Creighto Uiversity Chapter 15 JavaScript Strigs 1 Strigs as Objects so far, your iteractive Web pages have maipulated strigs i simple ways use text box to iput

More information

Major CSL Write your name and entry no on every sheet of the answer script. Time 2 Hrs Max Marks 70

Major CSL Write your name and entry no on every sheet of the answer script. Time 2 Hrs Max Marks 70 NOTE:. Attempt all seve questios. Major CSL 02 2. Write your ame ad etry o o every sheet of the aswer script. Time 2 Hrs Max Marks 70 Q No Q Q 2 Q 3 Q 4 Q 5 Q 6 Q 7 Total MM 6 2 4 0 8 4 6 70 Q. Write a

More information

Introduction to GAMIT/GLOBK Applications of GLOBK. Lecture 11 OVERVIEW

Introduction to GAMIT/GLOBK Applications of GLOBK. Lecture 11 OVERVIEW Itroductio to GAMIT/GLOBK Applicatios of GLOBK Lecture 11 GAMIT/GLOBK Lec11 1 OVERVIEW o I this lecture we cover: o Basic types of aalyses with globk l Velocity ad repeatability rus o GLOBK acillary programs

More information

Computational Geometry

Computational Geometry Computatioal Geometry Chapter 4 Liear programmig Duality Smallest eclosig disk O the Ageda Liear Programmig Slides courtesy of Craig Gotsma 4. 4. Liear Programmig - Example Defie: (amout amout cosumed

More information

A graphical view of big-o notation. c*g(n) f(n) f(n) = O(g(n))

A graphical view of big-o notation. c*g(n) f(n) f(n) = O(g(n)) ca see that time required to search/sort grows with size of We How do space/time eeds of program grow with iput size? iput. time: cout umber of operatios as fuctio of iput Executio size operatio Assigmet:

More information

Behavioral Modeling in Verilog

Behavioral Modeling in Verilog Behavioral Modelig i Verilog COE 202 Digital Logic Desig Dr. Muhamed Mudawar Kig Fahd Uiversity of Petroleum ad Mierals Presetatio Outlie Itroductio to Dataflow ad Behavioral Modelig Verilog Operators

More information

EE260: Digital Design, Spring /16/18. n Example: m 0 (=x 1 x 2 ) is adjacent to m 1 (=x 1 x 2 ) and m 2 (=x 1 x 2 ) but NOT m 3 (=x 1 x 2 )

EE260: Digital Design, Spring /16/18. n Example: m 0 (=x 1 x 2 ) is adjacent to m 1 (=x 1 x 2 ) and m 2 (=x 1 x 2 ) but NOT m 3 (=x 1 x 2 ) EE26: Digital Desig, Sprig 28 3/6/8 EE 26: Itroductio to Digital Desig Combiatioal Datapath Yao Zheg Departmet of Electrical Egieerig Uiversity of Hawaiʻi at Māoa Combiatioal Logic Blocks Multiplexer Ecoders/Decoders

More information

Solutions to Final COMS W4115 Programming Languages and Translators Monday, May 4, :10-5:25pm, 309 Havemeyer

Solutions to Final COMS W4115 Programming Languages and Translators Monday, May 4, :10-5:25pm, 309 Havemeyer Departmet of Computer ciece Columbia Uiversity olutios to Fial COM W45 Programmig Laguages ad Traslators Moday, May 4, 2009 4:0-5:25pm, 309 Havemeyer Closed book, o aids. Do questios 5. Each questio is

More information

Chapter 1. Introduction to Computers and C++ Programming. Copyright 2015 Pearson Education, Ltd.. All rights reserved.

Chapter 1. Introduction to Computers and C++ Programming. Copyright 2015 Pearson Education, Ltd.. All rights reserved. Chapter 1 Itroductio to Computers ad C++ Programmig Copyright 2015 Pearso Educatio, Ltd.. All rights reserved. Overview 1.1 Computer Systems 1.2 Programmig ad Problem Solvig 1.3 Itroductio to C++ 1.4 Testig

More information

Python Programming: An Introduction to Computer Science

Python Programming: An Introduction to Computer Science Pytho Programmig: A Itroductio to Computer Sciece Chapter 6 Defiig Fuctios Pytho Programmig, 2/e 1 Objectives To uderstad why programmers divide programs up ito sets of cooperatig fuctios. To be able to

More information

Pattern Recognition Systems Lab 1 Least Mean Squares

Pattern Recognition Systems Lab 1 Least Mean Squares Patter Recogitio Systems Lab 1 Least Mea Squares 1. Objectives This laboratory work itroduces the OpeCV-based framework used throughout the course. I this assigmet a lie is fitted to a set of poits usig

More information

NTH, GEOMETRIC, AND TELESCOPING TEST

NTH, GEOMETRIC, AND TELESCOPING TEST NTH, GEOMETRIC, AND TELESCOPING TEST Sectio 9. Calculus BC AP/Dual, Revised 08 viet.dag@humbleisd.et /4/08 0:0 PM 9.: th, Geometric, ad Telescopig Test SUMMARY OF TESTS FOR SERIES Lookig at the first few

More information

Data Structures Week #5. Trees (Ağaçlar)

Data Structures Week #5. Trees (Ağaçlar) Data Structures Week #5 Trees Ağaçlar) Trees Ağaçlar) Toros Gökarı Avrupa Gökarı October 28, 2014 Boraha Tümer, Ph.D. 2 Trees Ağaçlar) October 28, 2014 Boraha Tümer, Ph.D. 3 Outlie Trees Deiitios Implemetatio

More information

Pseudocode ( 1.1) Analysis of Algorithms. Primitive Operations. Pseudocode Details. Running Time ( 1.1) Estimating performance

Pseudocode ( 1.1) Analysis of Algorithms. Primitive Operations. Pseudocode Details. Running Time ( 1.1) Estimating performance Aalysis of Algorithms Iput Algorithm Output A algorithm is a step-by-step procedure for solvig a problem i a fiite amout of time. Pseudocode ( 1.1) High-level descriptio of a algorithm More structured

More information

Architectural styles for software systems The client-server style

Architectural styles for software systems The client-server style Architectural styles for software systems The cliet-server style Prof. Paolo Ciacarii Software Architecture CdL M Iformatica Uiversità di Bologa Ageda Cliet server style CS two tiers CS three tiers CS

More information

Mark IIIA/IV/VLBA Tape Formats, Recording Modes and Compatibility

Mark IIIA/IV/VLBA Tape Formats, Recording Modes and Compatibility rk IIIA/IV/VLBA Tape Formats, Recordi Modes ad Compatibility COTETS Revisio 1.2 Ala R. Whitey MIT Haystack Observatory 28 September 2000 1. ITRODUCTIO 3 2. MARK IV TAPE FORMAT AD RECORDIG MODES 3 2.1 Loitudial

More information

CIS 121 Data Structures and Algorithms with Java Spring Stacks, Queues, and Heaps Monday, February 18 / Tuesday, February 19

CIS 121 Data Structures and Algorithms with Java Spring Stacks, Queues, and Heaps Monday, February 18 / Tuesday, February 19 CIS Data Structures ad Algorithms with Java Sprig 09 Stacks, Queues, ad Heaps Moday, February 8 / Tuesday, February 9 Stacks ad Queues Recall the stack ad queue ADTs (abstract data types from lecture.

More information

top() Applications of Stacks

top() Applications of Stacks CS22 Algorithms ad Data Structures MW :00 am - 2: pm, MSEC 0 Istructor: Xiao Qi Lecture 6: Stacks ad Queues Aoucemets Quiz results Homework 2 is available Due o September 29 th, 2004 www.cs.mt.edu~xqicoursescs22

More information

MOTIF XF Extension Owner s Manual

MOTIF XF Extension Owner s Manual MOTIF XF Extesio Ower s Maual Table of Cotets About MOTIF XF Extesio...2 What Extesio ca do...2 Auto settig of Audio Driver... 2 Auto settigs of Remote Device... 2 Project templates with Iput/ Output Bus

More information

CSC165H1 Worksheet: Tutorial 8 Algorithm analysis (SOLUTIONS)

CSC165H1 Worksheet: Tutorial 8 Algorithm analysis (SOLUTIONS) CSC165H1, Witer 018 Learig Objectives By the ed of this worksheet, you will: Aalyse the ruig time of fuctios cotaiig ested loops. 1. Nested loop variatios. Each of the followig fuctios takes as iput a

More information

Analysis Metrics. Intro to Algorithm Analysis. Slides. 12. Alg Analysis. 12. Alg Analysis

Analysis Metrics. Intro to Algorithm Analysis. Slides. 12. Alg Analysis. 12. Alg Analysis Itro to Algorithm Aalysis Aalysis Metrics Slides. Table of Cotets. Aalysis Metrics 3. Exact Aalysis Rules 4. Simple Summatio 5. Summatio Formulas 6. Order of Magitude 7. Big-O otatio 8. Big-O Theorems

More information

Solution printed. Do not start the test until instructed to do so! CS 2604 Data Structures Midterm Spring, Instructions:

Solution printed. Do not start the test until instructed to do so! CS 2604 Data Structures Midterm Spring, Instructions: CS 604 Data Structures Midterm Sprig, 00 VIRG INIA POLYTECHNIC INSTITUTE AND STATE U T PROSI M UNI VERSI TY Istructios: Prit your ame i the space provided below. This examiatio is closed book ad closed

More information

Improvement of the Orthogonal Code Convolution Capabilities Using FPGA Implementation

Improvement of the Orthogonal Code Convolution Capabilities Using FPGA Implementation Improvemet of the Orthogoal Code Covolutio Capabilities Usig FPGA Implemetatio Naima Kaabouch, Member, IEEE, Apara Dhirde, Member, IEEE, Saleh Faruque, Member, IEEE Departmet of Electrical Egieerig, Uiversity

More information

JoLetter 6.7. JoLauterbach Software GmbH. Mail and merge with QuarkXPress. JoLauterbach Software GmbH. Stolzingstraße 4a Bayreuth Germany

JoLetter 6.7. JoLauterbach Software GmbH. Mail and merge with QuarkXPress. JoLauterbach Software GmbH. Stolzingstraße 4a Bayreuth Germany JoLetter 6.7 Mail ad merge with QuarkXPress JoLauterbach Software GmbH Stolzigstraße 4a 95445 Bayreuth Germay Telefo: +49-921-730 3363 Fax: +49-921-730 3394 E-Mail: ifo@jolauterbach.com Iteret: http://www.jolauterbach.com

More information

Lecture 17: Feature Subset Selection II

Lecture 17: Feature Subset Selection II Lecture 17: Feature Subset Selectio II Expoetial search methods Brach ad Boud Approximate Mootoicity with Brach ad Boud Beam Search Radomized alorithms Radom Geeratio plus Sequetial Selectio Simulated

More information

Chapter 3 Classification of FFT Processor Algorithms

Chapter 3 Classification of FFT Processor Algorithms Chapter Classificatio of FFT Processor Algorithms The computatioal complexity of the Discrete Fourier trasform (DFT) is very high. It requires () 2 complex multiplicatios ad () complex additios [5]. As

More information

Lecture 5. Counting Sort / Radix Sort

Lecture 5. Counting Sort / Radix Sort Lecture 5. Coutig Sort / Radix Sort T. H. Corme, C. E. Leiserso ad R. L. Rivest Itroductio to Algorithms, 3rd Editio, MIT Press, 2009 Sugkyukwa Uiversity Hyuseug Choo choo@skku.edu Copyright 2000-2018

More information

Algorithm Design Techniques. Divide and conquer Problem

Algorithm Design Techniques. Divide and conquer Problem Algorithm Desig Techiques Divide ad coquer Problem Divide ad Coquer Algorithms Divide ad Coquer algorithm desig works o the priciple of dividig the give problem ito smaller sub problems which are similar

More information

CMSC Computer Architecture Lecture 3: ISA and Introduction to Microarchitecture. Prof. Yanjing Li University of Chicago

CMSC Computer Architecture Lecture 3: ISA and Introduction to Microarchitecture. Prof. Yanjing Li University of Chicago CMSC 22200 Computer Architecture Lecture 3: ISA ad Itroductio to Microarchitecture Prof. Yajig Li Uiversity of Chicago Lecture Outlie ISA uarch (hardware implemetatio of a ISA) Logic desig basics Sigle-cycle

More information

Exact Minimum Lower Bound Algorithm for Traveling Salesman Problem

Exact Minimum Lower Bound Algorithm for Traveling Salesman Problem Exact Miimum Lower Boud Algorithm for Travelig Salesma Problem Mohamed Eleiche GeoTiba Systems mohamed.eleiche@gmail.com Abstract The miimum-travel-cost algorithm is a dyamic programmig algorithm to compute

More information

5.3 Recursive definitions and structural induction

5.3 Recursive definitions and structural induction /8/05 5.3 Recursive defiitios ad structural iductio CSE03 Discrete Computatioal Structures Lecture 6 A recursively defied picture Recursive defiitios e sequece of powers of is give by a = for =0,,, Ca

More information

COSC 1P03. Ch 7 Recursion. Introduction to Data Structures 8.1

COSC 1P03. Ch 7 Recursion. Introduction to Data Structures 8.1 COSC 1P03 Ch 7 Recursio Itroductio to Data Structures 8.1 COSC 1P03 Recursio Recursio I Mathematics factorial Fiboacci umbers defie ifiite set with fiite defiitio I Computer Sciece sytax rules fiite defiitio,

More information

Panel for Adobe Premiere Pro CC Partner Solution

Panel for Adobe Premiere Pro CC Partner Solution Pael for Adobe Premiere Pro CC Itegratio for more efficiecy The makes video editig simple, fast ad coveiet. The itegrated pael gives users immediate access to all medialoopster features iside Adobe Premiere

More information

Computer Architecture ELEC3441

Computer Architecture ELEC3441 CPU-Memory Bottleeck Computer Architecture ELEC44 CPU Memory Lecture 8 Cache Dr. Hayde Kwok-Hay So Departmet of Electrical ad Electroic Egieerig Performace of high-speed computers is usually limited by

More information

Appendix D. Controller Implementation

Appendix D. Controller Implementation COMPUTER ORGANIZATION AND DESIGN The Hardware/Software Iterface 5 th Editio Appedix D Cotroller Implemetatio Cotroller Implemetatios Combiatioal logic (sigle-cycle); Fiite state machie (multi-cycle, pipelied);

More information

Exercise 6 (Week 42) For the foreign students only.

Exercise 6 (Week 42) For the foreign students only. These are the last exercises of the course. Please, remember that to pass exercises, the sum of the poits gathered by solvig the questios ad attedig the exercise groups must be at least 4% ( poits) of

More information

Designing a learning system

Designing a learning system CS 75 Itro to Machie Learig Lecture Desigig a learig system Milos Hauskrecht milos@pitt.edu 539 Seott Square, -5 people.cs.pitt.edu/~milos/courses/cs75/ Admiistrivia No homework assigmet this week Please

More information

Contactless Card Read/Write Module YW-201 User s Manual

Contactless Card Read/Write Module YW-201 User s Manual Cotactless Card Read/Write Module YW-201 User s Maual (versio 1.4) Eglish WEB: MSN&EMAIL: Zhou21c@126.com PHONE: 086-10-87171913 MOBILE: 086-13671114914 MANAGER: Mr Zhou Cotactless Card, RFID Page 1 /

More information

Running Time. Analysis of Algorithms. Experimental Studies. Limitations of Experiments

Running Time. Analysis of Algorithms. Experimental Studies. Limitations of Experiments Ruig Time Aalysis of Algorithms Iput Algorithm Output A algorithm is a step-by-step procedure for solvig a problem i a fiite amout of time. Most algorithms trasform iput objects ito output objects. The

More information

Reliable Transmission. Spring 2018 CS 438 Staff - University of Illinois 1

Reliable Transmission. Spring 2018 CS 438 Staff - University of Illinois 1 Reliable Trasmissio Sprig 2018 CS 438 Staff - Uiversity of Illiois 1 Reliable Trasmissio Hello! My computer s ame is Alice. Alice Bob Hello! Alice. Sprig 2018 CS 438 Staff - Uiversity of Illiois 2 Reliable

More information