72 Pages

chapter4-comlogic03

Course: MR 310, Spring 2010
School: Shanghai Jiao Tong...
Rating:
 
 
 
 
 

Word Count: 2589

Document Preview

Logic Introduction Digital Ratioed IC 1 EE141 Ratioed Logic design Ratioed Logic design Basic concept Resistive load Depletion NMOS Pseudo NMOS DCVSL logic Pseudo NMOS logic effort Digital IC 2 Ratioed Logic VDD Resistive Load VDD Depletion Load RL PDN F In1 In2 In3 VSS (a) resistive load PMOS Load VSS VT < 0 F In1 In2 In3 VDD PDN VSS (b) depletion load NMOS F In1 In2 In3 PDN...

Register Now

Unformatted Document Excerpt

Coursehero >> China >> Shanghai Jiao Tong University >> MR 310

Course Hero has millions of student submitted documents similar to the one
below including study guides, practice problems, reference materials, practice exams, textbook help and tutor support.

Course Hero has millions of student submitted documents similar to the one below including study guides, practice problems, reference materials, practice exams, textbook help and tutor support.
Logic Introduction Digital Ratioed IC 1 EE141 Ratioed Logic design Ratioed Logic design Basic concept Resistive load Depletion NMOS Pseudo NMOS DCVSL logic Pseudo NMOS logic effort Digital IC 2 Ratioed Logic VDD Resistive Load VDD Depletion Load RL PDN F In1 In2 In3 VSS (a) resistive load PMOS Load VSS VT < 0 F In1 In2 In3 VDD PDN VSS (b) depletion load NMOS F In1 In2 In3 PDN VSS (c) pseudo-NMOS Goal: to reduce the number of devices over complementary CMOS Digital IC 3 How to obtain good load How to obtain a good load What is a good load Low power VOL tend to zero Charge time short (large charge current) Memory address decoder match the structure Low power when address hold the line Change quickly when address content is changed Digital IC 4 Ratioed Logic design Ratioed Logic design Basic concept Resistive load Depletion NMOS Pseudo NMOS DCVSL logic Pseudo NMOS logic effort Digital IC 5 Ratioed Logic-resistive load VDD N transistors + Load Resistive Load VOH = V DD RL VOL = F In1 In2 In3 RPN PN RPN + RL Assymetrical response PDN Static power consumption tpL= 0.69 RLCL VSS Digital IC 6 Resistive load Resistive load Could not be to low VOL RPDN = VDD RPDN + RL In order to obtain wide range low noise marginRL>>RPDN Then resistive size should be adjust Could not be to high Then enough large current could give quick switch time, ti because t pLH = 0.69 RL C L t pHL = 0.69( RL RPDN )C L Decrease power consumption as soon as possible Digital IC 7 Ratioed Logic design Ratioed Logic design Basic concept Resistive load Depletion NMOS Pseudo NMOS DCVSL logic Pseudo NMOS logic effort Digital IC 8 Active Loads VDD Depletion Load VDD PMOS Load VT < 0 VSS F In1 In2 In3 F In1 In2 In3 PDN VSS PDN VSS depletion load NMOS pseudo-NMOS Digital IC 9 Depletion NMOS load Depletion NMOS load Depletion load has negative threshold voltage It is reasonable when we assume the load transistor works at saturate state, just like a current source I L= k n ,load 2 VTn 2 Practically, the load curve slant down Load transistors source is connect with output, which VSB will effect threshold voltage of the transistor Compared with resistive load, depletion load has smaller area 40k resistive load need 3200m2(0.5um) which could occupy 1000 unit transistor Digital IC 10 Depletion NMOS ratios computing At leas, VOL should close next stage MOS transistor Vout Vt 0.3Vdd Vdd RPDN 0.3Vdd RPDN + RNMOSs load RPDN RNMOS load 3 7 WNMOSs load 3 WPDN 7 Inverter: nMOS Digital IC 11 Ratioed Logic design Ratioed Logic design Basic concept Resistive load Depletion NMOS Pseudo NMOS DCVSL logic Pseudo NMOS logic effort Digital IC 12 Pseudo Pseudo-NMOS ratios computing ratios computing PMOSs source and substrate voltage is always zero that means no body effect Load transistors saturate current is kp I L = (VDD VTp ) 2 2 So pMOS load current is larger than that of nMOS Digital IC 13 Pseudo-NMOS ratios computing 2 OL 2 VDSATp V k n ((VDD VTn )VOL ) + k p ((VDD VTp )VDSATp 2 2 k p (VDD + VTp )VDSATp pW p VOL = VDSATp k n (VDD VTn ) nWn )=0 n = 3800 cm 2 /v . s, p = 1800 cm 2 /v . s VOL n 1800 0.4 = = = 0.19 3800 1 Wn pVDSATp Wp pMOS load for 1/5, always 1/3-1/6 Digital IC 14 Pseudo NMOS logic design rule Pseudo NMOS logic design rule Static power Paverage = Vdd I low = Constrains should be regarded kp 2 Vdd (Vdd VT ) 2 ILshould be low in order to decrease power VOL=ILRPDN should be lower in order to obtain effective low voltage voltage ILshould high in order to decrease tpLH=(CLVdd)/(2IL) RPDNshould be small in order to decrease tpHL=0.69RPDNCL, Pull Pull-down transistors should be wider ,but we can not benefit from both power and delay Digital IC 15 Pseudo-NMOS VTC 3.0 2.5 W/Lp = 4 Vou t [V] 2.0 1.5 W/L W/Lp = 2 1.0 0.5 W/Lp = 0.5 W/Lp = 1 W/Lp = 0.25 0.0 0.0 0.5 1.0 1.5 2.0 2.5 Vin [V] Digital IC 16 Pseudo-NMOS NMOS ratioed logic Pseudo-NMOS ratioed logic merits N-fan-in needs N+1 transistorswith smaller area and parasitic capacity Every input only connects with one transistor, which load capacity is smaller as front stage logic. shortcoming Static power1mW per logic50W consumption if chip has 100,000 such logic structure application Can not fit for large scale circuit not fit for large scale circuit Only apply on high speed circuit Only apply on 1-state on most output(such as address decoder) Large fan-in Digital IC 17 Load curve analysis Load curve analysis Resistive load VDD Vout IL = RL More output voltage, lower charge current, which increase charge time increase charge time Ideally, constant current source Charge current does not be decreased by output voltage Digital IC 18 Improved Loads VD D M1 Enable M2 M1 >> M2 F A B C D CL Adaptive Load Digital IC 19 Improved Loads (2) VDD M1 VDD M2 Out A A B B Out PDN1 PDN2 VSS VSS Differential Cascode Voltage Switch Logic (DCVSL) Digital IC 20 Ratioed Logic design Ratioed Logic design Basic concept Resistive load Depletion NMOS Pseudo NMOS DCVSL logic Pseudo NMOS logic effort Digital IC 21 DCVSL Example Out 2.5 B B B V ol ta ge [V] Out B AB 1.5 0 .5 A AB A,B A, B A - 0 .5 0 XOR-NXOR gate Digital IC 0.2 0.4 0.6 Time [ns] 0.8 1.0 22 Pseudo Pseudo-nMOS Power Power Pseudo-nMOS draws power whenever Y = 0 Called static power P = IVDD A few mA / gate * 1M gates would be a problem few mA gate 1M gates would be problem This is why nMOS went extinct! Use pseudo-nMOS sparingly for wide NORs Turn off pMOS when not in use en Y A B Digital IC C 23 Pass-Transistor Logic Introduction Digital IC 24 EE141 Pass Pass- transistor logic outline outline Pass-transistor principle Pass-transistor VTC How to solve pass-transistor threshold drop issue Solution 1:Level Restoring Transistor Resistive issue Solution 2: Single Transistor Pass Gate with VT=0 Solution 3: Transmission Gate Complementary PassTransistor Logic Transmission gate principle Some issues of transmission gate issues of transmission gate Resistive issue Delay issue Digital IC 25 Pass-Transistor Logic Inputs B Switch Out A Out B Network B N transistors transistors No static consumption Pass Pass-transistor logic is a path, not a not road connected with rail directly Digital IC 26 Example: AND Gate B A B F = AB 0 Digital IC 27 Pass Transistors Pass Transistors Transistors can be used as switches g s d g s d 1: Circuits & Layout Digital IC Slide 28 Pass Transistors Pass Transistors Transistors can be used as switches g=0 g s d s d Input g = 1 Output 0 strong 0 g=1 g=1 s d g=0 g s s 1 Input d d g=1 s d Digital IC degraded 1 g=0 0 Output degraded 0 g=0 strong 1 Slide 29 NMOS-Only Logic In x 0.5 m/0 .25 m 3.0 Out In 0.5 m/0.25 m NMOS keep onthen VGS>Vt Voltage [V] VD D 1.5 m/0.25 m Out 2.0 x 1.0 VDG=0,which means means NMOS always works in 0.0 0 0.5 1 1.5 2 Time [ns] the saturation state Digital IC 30 NMOS-only Switch C = 2.5V C = 2.5 V M2 A = 2 .5 V A = 2.5 V B B Mn CL VB does not pull up to 2.5V, but 2.5V - M1 VTN Threshold voltage loss causes static power consumption NMOS has higher threshold than PMOS (body effect) Digital IC 31 The proper way of cascading pass gates The proper way of cascading pass gates Weak for passing high voltage Vs = min{ G VT , VD } V Proper way of cascading pass transistors,which will not accumulate threshold drop Digital IC 32 Output of passing-transistor should not be connected with the gate of next stage Digital IC 33 Transmission Gates Transmission Gates Pass transistors produce degraded outputs Transmission gates pass both 0 and 1 well Digital IC Slide 34 Transmission Gates Transmission Gates Pass transistors produce degraded outputs Transmission gates pass both 0 and 1 well Input g = 0, gb = 1 gb a b b gb b gb g = 1, gb = 0 gb strong 1 1 g g a g = 1, gb = 0 0 strong 0 g = 1, gb = 0 a b g a Output a g b gb a b gb Digital IC Slide 35 Tristates Tristates Tristate buffer produces Z when not enabled EN A 0 0 0 1 1 0 1 EN Y 1 Y A EN Y A EN Digital IC Slide 36 Tristates Tristates Tristate buffer produces Z when not enabled EN A Y 0 0 Z 0 1 Z 1 0 0 1 1 EN 1 Y A EN Y A EN Digital IC Slide 37 Nonrestoring Tristate Transmission Tristate Nonrestoring gate acts as tristate buffer Only two transistors But nonrestoring Noise on A is passed on to Y EN A Y EN Digital IC Slide 38 Tristate Inverter Tristate Inverter Tristate inverter produces restored output Violates conduction complement rule Because we want a Z output A EN Y EN Digital IC Slide 39 Tristate Inverter Tristate Inverter Tristate inverter produces restored output Violates conduction complement rule Because we want a Z output A A A EN Y Y Y EN = 0 Y = 'Z' EN = 1 Y=A EN Digital IC Slide 40 Multiplexers Multiplexers 2:1 multiplexer chooses between two inputs S S D1 D0 0 X 0 0 X 1 1 0 X 1 1 Y X D0 0 Y D1 Digital IC 1 Slide 41 Multiplexers Multiplexers 2:1 multiplexer chooses between two inputs S S D1 D0 Y 0 X 0 0 0 X 1 1 1 0 X 0 1 1 X 1 Digital IC D0 0 Y D1 1 Slide 42 Gate Gate-Level Mux Design Mux Design Y = SD1 + SD0 (too many transistors) How many transistors are needed? Digital IC Slide 43 Gate Gate-Level Mux Design Mux Design Y = SD1 + SD0 (too many transistors) How many transistors are needed? 20 D1 S D0 D1 S D0 Y 4 2 4 2 4 2 Y 2 Digital IC Slide 44 Transmission Gate Mux Transmission Gate Mux Nonrestoring mux uses two transmission gates Digital IC Slide 45 Transmission Gate Mux Transmission Gate Mux Nonrestoring mux uses two transmission gates Only 4 transistors S D0 Y S D1 S Digital IC Slide 46 Inverting Mux Inverting Mux Inverting multiplexer Use compound AOI22 Or pair of tristate inverters Essentially the same thing th thi Noninverting multiplexer adds an inverter D0 S S D0 S D1 D1 S Y S S S Y S D0 Y S D1 Digital IC 0 1 Slide 47 4:1 Multiplexer 4:1 Multiplexer 4:1 mux chooses one of 4 inputs using two selects 1: Circuits & Layout Digital IC Slide 48 4:1 Multiplexer 4:1 Multiplexer 4:1 mux chooses one of 4 inputs using two selects Two levels of 2:1 muxes Or four tristates S1S0 S1S0 S1S0 S1S0 D0 S0 D0 0 D1 1 S1 D1 0 Y Y D2 0 D3 1 1 D2 D3 Digital IC Slide 49 Pass Pass- transistor logic outline outline Pass-transistor principle Pass-transistor VTC How to solve pass-transistor threshold drop issue Solution 1:Level Restoring Transistor Resistive issue Solution 2: Single Transistor Pass Gate with VT=0 Solution 3: Transmission Gate Complementary PassTransistor Logic Transmission gate principle Some issues of transmission gate issues of transmission gate Resistive issue Delay issue Digital IC 50 Pass Pass-transistors VTC VTC Digital IC 51 Complementary Pass Transistor Logic A A B B Pass-Transistor Network F (a) A A B B B Inverse Pass-Transistor Network B B A F B B A A B F=AB A B F=A+B F=AB AND/NAND A F=A (b) A A B B F =A+B B OR/NOR Digital IC A F=A EXOR/NEXOR 52 Pass Pass- transistor logic outline outline Pass-transistor principle Pass-transistor VTC How to solve pass-transistor threshold drop issue Solution 1:Level Restoring Transistor Resistive issue Solution 2: Single Transistor Pass Gate with VT=0 Solution 3: Transmission Gate Complementary PassTransistor Logic Transmission gate principle gate principle Some issues of transmission gate Resistive issue Delay issue Digital IC 53 Solution 1:Level Restoring Transistor V DD Level Restorer V DD Mr B A Mn M2 X Out M1 Advantage: Full Swing Restorer adds capacitance, takes away pull down current at X Ratio problem Digital IC 54 Restorer Sizing V oltage [V] 3.0 2.0 Upper limit on restorer size Pass-transistor pull-down can have several transistors in stack stack W /Lr =1.75/0.25 W /L r =1.50/0.25 1.0 W/ Lr =1.0/0.25 0.0 0 100 200 W /L r =1.25/0.25 300 Time [ps] 400 Digital IC 500 55 pass pass- transistor logic outline outline Pass-transistor principle Pass-transistor VTC How to solve pass-transistor threshold drop issue Solution 1:Level Restoring Transistor Resistive issue Solution 2: Single Transistor Pass Gate with VT=0 Solution 3l: Transmission Gate Complementary Pass-Transistor Logic Transmission gate principle Some issues of transmission gate issues of transmission gate Resistive issue Delay issue Digital IC 56 Solution 2: Single Transistor Pass Gate with VT=0 VDD 0V 2.5V VDD 0V VDD Out 2.5V WATCH OUT FOR LEAKAGE CURRENTS Digital IC 57 pass pass- transistor logic outline outline Pass-transistor principle Pass-transistor VTC How to solve pass-transistor threshold drop issue Solution 1:Level Restoring Transistor Resistive issue Solution 2: Single Transistor Pass Gate with VT=0 Solution 3: Transmission Gate Complementary Pass-Transistor Logic Transmission gate principle Some issues of transmission gate issues of transmission gate Resistive issue Delay issue Digital IC 58 Solution 3: Transmission Gate C A C A B B C C C = 2.5 V A = 2.5 V B CL C=0V Digital IC 59 pass pass- transistor logic outline outline Pass-transistor principle Pass-transistor VTC How to solve pass-transistor threshold drop issue Solution 1:Level Restoring Transistor Resistive issue Solution 2: Single Transistor Pass Gate with VT=0 Solution 3: Transmission Gate Complementary PassTransistor Logic Transmission gate principle Some issues of transmission gate issues of transmission gate Resistive issue Delay issue Digital IC 60 Pass-Transistor Based Multiplexer S S S S VDD S A V DD M2 F S M1 B S GND In 1 Digital IC In 2 61 Transmission Gate XOR B B M2 A A F M1 M3/M4 B B Digital IC 62 Transmission Gate Full Adder P VDD Ci A P A A P B VDD Ci VDD S Sum Generation Ci P A B P Ci VDD A P Co Carry Generation Ci A P Setup Similar delays for sum and carry Digital IC 63 pass pass- transistor logic outline outline Pass-transistor principle Pass-transistor VTC How to solve pass-transistor threshold drop issue Solution 1:Level Restoring Transistor Resistive issue Solution 2: Single Transistor Pass Gate with VT=0 Solution 3: Transmission Gate Complementary PassTransistor Logic Transmission gate principle Some issues of transmission gate issues of transmission gate Resistive issue Delay issue Digital IC 64 More detail about a processing of low-to-high Two transistors stories NMOS For VGS=VDS , VGD=0<Vt ,then NMOS always works in the saturation or off state PMOS For VGS=-2.5V, transistor turn from saturation to linear state More detail Vout <| Vtp |: NMOS and PMOS are in saturation | Vtp |< Vout < Vdd Vtn : NMOS in satur.PMOS in linear Vdd Vtn < Vout : NMOS cut offPMOS in linear off Digital IC 65 Transmission gate effective resistance of low-to-high Relatively constant Req=Rp||Rn Rn = VDD Vout 2 VDSATn W k ( ) N ((VDD Vout VTn )VDSATn ) L 2 ' n VDD Vout k n (VDD Vout VTn )VDSATn Rp = VDD Vout = I Dn Vout VDD = I Dp VDD Vout (Vout VDD ) 2 W k ( ) P ((VDD VTp )(Vout VDD ) ) L 2 ' p 1 k p (VDD VTp ) Digital IC 66 pass pass- transistor logic outline outline Pass-transistor principle Pass-transistor VTC VTC How to solve pass-transistor threshold drop issue Solution 1:Level Restoring Transistor Resistive issue Solution 2: Single Transistor Pass Gate with VT=0 Solution 3: Transmission Gate Complementary Pass-Transistor Logic Transmission gate principle Some issues of transmission gate Resistive issue Delay issue Complementary Pass-Transistor Logic Digital IC 67 Delay in Transmission Gate Networks Many applications use transmission like that Replaced by their equivalent resistances Digital IC 68 Computing delay time Computing delay time How to do Solving the differential equation Vi 1 = (Vi +1 Vi (Vi Vi 1 )) t Req C dQ CdV , I C = I i +1 I i , I C = = dt dt Vi 1 = ( I i +1 I i ) t C It is too complex to find precise solution,we have to find some approximate solution Digital IC 69 A close solution close solution Delay time is n(n + 1) (Vn ) = CReq k = CReq 2 k =0 n Break chain and Insert buffer Digital IC 70 Transmission gate delay optimization Total delay time Assume all has n transmission gatebreak chain every m switchs,buffer delay time is tbuf n m ( m + 1) n t p = 0 .69[ CR eq ] + ( 1)t buf m m 2 n ( m + 1) n = 0 .69 CR eq + ( 1)t buf m 2 Digital IC 71 Optimal number of switch moptimal t p t p m m =0 = 0.69CReq moptimal = 1.7 tbuf CReq Digital IC ntbuf n 2 =0 2m It is independent with n = 1 .7 72
Find millions of documents on Course Hero - Study Guides, Lecture Notes, Reference Materials, Practice Exams and more. Course Hero has millions of course specific materials providing students with the best way to expand their education.

Below is a small sample set of documents:

Shanghai Jiao Tong University - MR - 310
Digital IntegratedCircuitsA Designg PerspectiveDesignin CombinationalLogic CircuitsFuyuzhuoSchool of Microelectronics,SJTUIntroductionDigital ICDynamic LogicIntroductionDigital IC2EE141Dynamic logic outlineDynamic logic outlineDynamic logi
Shanghai Jiao Tong University - MR - 310
Digital IntegratedCircuitsA Designg PerspectiveDesignin CombinationalLogic CircuitsFuyuzhuoSchool of Microelectronics,SJTUIntroductionDigital IChomeworkhomeworkSketch a 4-input NAND gate with transistor widthschosen to achieve effective rise a
Shanghai Jiao Tong University - MR - 310
Digital Integrated CircuitsA Design PerspectiveChapter 5Arithmetic CircuitsIntroductionDigital IC1A Generic Digital ProcessorIN PU T -OU T PU TM EM ORYCONTROLDATAPATHDigital IC2Building Blocks for Digital ArchitecturesArithmetic unit Bit-s
Shanghai Jiao Tong University - MR - 310
Manchester Carry ChainDigital IC1Carry-Skip AdderCarry-ripple is slow through all N stagesCarry-skip allows carry to skip over groups of n bits Decision based on n-bit propagate signalA16:13 B16:13A8:5 B8:5A4:1P16:13CoutA12:9 B12:9P12:9P8:5
Shanghai Jiao Tong University - MR - 310
Digital Integrated CircuitsA Design PerspectiveThe WireThanks for Dr.Guoyong.SHI for his slides contributed for the talkIntroductionDigital ICThe WiretransmittersreceiversschematicsphysicalDigital IC2Interconnect Impact on ChipDigital IC3W
Shanghai Jiao Tong University - MR - 310
Digital IntegratedCircuitsA Design PerspectiveDesigning SequentialLogic CircuitsIntroductionDigital ICDesign Sequential Logic CircuitsIntroductionTimingStatic Latches and RegistersDynamic Latches and Registerssequentional logicDigital IC2Se
University of Maryland - HIST - 428V
Notes 3.11929 Wailing Wall Disturbances/RiotsArgument between the Jews and Muslims over who has access to the wall mostsignificant wall in the worldo The only remaining wall of the ancient temple mounto Where Jews have prayed at since 70 CE when the
University of Auckland - COMPSCI - 101
415.101ACTHE UNIVERSITY OF AUCKLANDEXAMINATION FOR BA BSc ETC 2000COMPUTER SCIENCEPrinciples of Programming(Time Allowed: TWO hours)Surname(Family name):First Name(s)(Given names):Student ID:NOTE: Attempt ALL questions.Write your answers in th
University of Auckland - COMPSCI - 101
415.101ACTHE UNIVERSITY OF AUCKLANDEXAMINATION FOR BA BSc ETC 2000COMPUTER SCIENCEPrinciples of Programming(Time Allowed: TWO hours)Surname(Family name):First Name(s)(Given names):Student ID:NOTE: Attempt ALL questions.Write your answers in th
University of Auckland - COMPSCI - 101
415.101AC 2000 Test SolutionsQ.1 (5 marks)Q.2 (5 marks)public class ApplicEsQ2 cfw_public static void main(String args[]) cfw_int int1, int2;System.out.println(&quot;Numbers: &quot;);int1 = Keyboard.readInt();int2 = Keyboard.readInt();if (int1 &gt; 62)cfw_Sy
University of Auckland - COMPSCI - 101
415.101AC 2000Principles of ProgrammingTest:Monday 31st January 3.00pm 4.30pmSurname (Family Name):First Name(s):ID Number:TUESDAY/WEDNESDAYLab Time:Note: Attempt ALL questions. Calculators are NOT permitted.Write your answers in the spaces prov
University of Auckland - COMPSCI - 101
- 11 -415.101FCAnswer bookSURNAME:FORENAMES:DEGREE (BSc, COP, Etc):STUDENT IDENTIFICATION NUMBER:SIGNATURE:Examiner to complete:QuestionMarkQuestion1526374Mark8TOTALANSWER BOOK- 12 -Surname:Forenames:415.101FCID no:1. Fixing lo
University of Auckland - COMPSCI - 101
415.101FCTHE UNIVERSITY OF AUCKLAND_EXAMINATION FOR BSc ETC 2000_COMPUTER SCIENCEPrinciples of Programming(Time allowed: TWO hours)NOTE:Attempt ALL questions.Write your answers in the answer book provided at the end of the exam paper. Youmay de
University of Auckland - COMPSCI - 101
415.101FC PRINCIPLES OFPROGRAMMINGANSWER BOOKTest - Tuesday 11th April 6:30pm-8:00pm1. Draw the output.2. Corrected program (with changes CIRCLED):1) Word static missing from main() declaration2) variable toss is not declared3) the = sign should b
University of Auckland - COMPSCI - 101
4 15.101FC PRINCIPLESOF PROGRAMMINGTest Tuesday 11th April 20006 :30pm - 8:00pmINSTRUCTIONSThis test constitutes 15% of your final grade for the course.You have 5 minutes reading time.Do not write until you are told.No one is to leave in the last
University of Auckland - COMPSCI - 101
415.101 STTHE UNIVERSITY OF AUCKLANDEXAMINATION FOR BA BSc ETC 2000COMPUTER SCIENCEPrinciples of Programming(Time Allowed: TWO hours)SurnameForenamesStudent IDLogin (UPI)NOTE:Attempt ALL questions.Write your answers in the space provided.Ther
University of Auckland - COMPSCI - 101
415.101 STTHE UNIVERSITY OF AUCKLANDEXAMINATION FOR BA BSc ETC 2000COMPUTER SCIENCEPrinciples of Programming(Time Allowed: TWO hours)SurnameForenamesStudent IDLogin (UPI)NOTE:Attempt ALL questions.Write your answers in the space provided.Ther
University of Auckland - COMPSCI - 101
415.101SC/ST 2000Principles of ProgrammingTest SOLUTIONS:Monday 21st August 6.30pm 7.45pmQuestion 1 (10 marks)Question 2 (5 marks)1 () after String2 = after rand3 ; after if4 glass5 missing cfw_ after mainQuestion 3 (10 marks)public void paint
University of Auckland - COMPSCI - 101
415.101SC/ST 2000Principles of ProgrammingTest:Monday 21st August 6.30pm 7.45pmSurname (Family Name):First Name(s):Login Name:ID Number:Lab Time:Note: Attempt ALL questions. Calculators are NOT permitted.Write your answers in the spaces provided
University of Auckland - COMPSCI - 101
T HE UNIVERSITY OF AUCKLANDSUMMER SEMESTER, 2001COMPUTER SCIENCEPrinciples of ProgrammingEXAM ANSWERSQuestion 1 (6 marks):i)String[] allStrings = new String[300];ii)allStrings[9] = &quot;Relax&quot;;iii)len = allStrings[9].length();Question 2 (15 marks)
University of Auckland - COMPSCI - 101
Question / Answer Sheet-2-CompSci 101 ACSurname: . Forenames: .Question 1 (6 marks)i) Declare and create an array of String elements called allStrings which is large enough tocontain 300 String elements:ii) Assign the String, &quot; Relax&quot; to the 10th e
University of Auckland - COMPSCI - 101
C ompSci 101 AC - 2001Terms Test AnswersQuestion 1:Output from class Q1:615.04.05.0Question 2:The completed actionPerformed() method for the class Q2:public void actionPerformed(ActionEvent e) cfw_String s1 = tOne.getText();String s2 = tTwo.g
University of Auckland - COMPSCI - 101
Question/Answer Sheet- Page 1 -SURNAME: .CompSci 101 ACFORENAMES: .Question 1 (5 marks)What is the output of the following Java application?public class Q1 cfw_public static void main(String[] args) cfw_int i;double d;i = 6 % 10;System.out.pri
University of Auckland - COMPSCI - 101
C ompSci 101 FCTHE UNIVERSITY OF AUCKLANDFIRST SEMESTER, 2001City CampusCOMPUTER SCIENCEPrinciples of Programming(Time allowed: TWO h ours)Surname:PerfectForenames:Mr.Student ID number:2001INSTRUCTIONS:Attempt ALL questions - write your answ
University of Auckland - COMPSCI - 101
C ompSci 101 FCTHE UNIVERSITY OF AUCKLANDFIRST SEMESTER, 2001City CampusCOMPUTER SCIENCEPrinciples of Programming(Time allowed: TWO h ours)Surname:Forenames:Student ID number:INSTRUCTIONS:Attempt ALL questions - write your answers in the space
University of Auckland - COMPSCI - 101
C ompSci 101 FC 2001Terms Test AnswersQuestion 1 (10 marks)Part A (5 marks)The contents of a simple HTML file is given below. The page contains an applet called Test, which hasbeen compiled, and the class file for this applet is in the same directory
University of Auckland - COMPSCI - 101
COMPSCI 101 SC/STTHE UNIVERSITY OF AUCKLANDSECOND SEMESTER, 2001Campus: City/TamakiCOMPUTER SCIENCEPrinciples of Programming(Time allowed: TWO hours)NOTE:Attempt ALL questions.Write your answers in the space provided.There is space at the back f
University of Auckland - COMPSCI - 101
COMPSCI 101 SC/STTHE UNIVERSITY OF AUCKLANDSECOND SEMESTER, 2001Campus: City/TamakiCOMPUTER SCIENCEPrinciples of Programming(Time allowed: TWO hours)NOTE:Attempt ALL questions.Write your answers in the space provided.There is space at the back f
University of Auckland - COMPSCI - 101
COMPSCI 101 TESTTHE UNIVERSITY OF AUCKLANDSECOND SEMESTER, 2001Campus: City/TamakiCOMPUTER SCIENCETEST SOLUTIONSPrinciples of Programming(Time allowed: ONE hour and 15 minutes)NOTE:Attempt ALL questions.Write your answers in the space provided.
University of Auckland - COMPSCI - 101
COMPSCI 101 TESTTHE UNIVERSITY OF AUCKLANDSECOND SEMESTER, 2001Campus: City/TamakiCOMPUTER SCIENCETESTPrinciples of Programming(Time allowed: ONE hour and 15 minutes)NOTE:Attempt ALL questions.Write your answers in the space provided.There is s
University of Auckland - COMPSCI - 101
Question/Answer SheetSURNAME: .- Page 25 -CompSci 101 ACFORENAMES: .CompSci 101 AC 2002 Final Exam Model AnswersQUESTION 1a)b)c)d)e)-115.105d is: 12.0i is : 1232QUESTION 2private static String randomString(String[] words) cfw_int randIn
University of Auckland - COMPSCI - 101
C ompSci 101 ACTHE UNIVERSITY OF AUCKLANDSummer School, 2002City CampusCOMPUTER SCIENCEPrinciples of Programming(Time allowed: TWO h ours)Surname:Forenames:Student ID number:INSTRUCTIONS:Attempt ALL questions - write your answers in the space p
University of Auckland - COMPSCI - 101
C ompSci 101 AC 2002 Terms TestMODEL ANSWERSQUESTION 1a)b)c)d)e)f)g)h)i)2ter3.34THE CODE WILL COMPILE123456System.out.println(&quot;\n\n\n&quot;);i is: 80d is: 4.5-1655QUESTION 24 syntax errors:1) String allStars = ' *' ;single quotes, sh
University of Auckland - COMPSCI - 101
C ompSci 101 ACTHE UNIVERSITY OF AUCKLANDSUMMER SCHOOL, 2002COMPUTER SCIENCEPrinciples of ProgrammingTERMS TEST(Time allowed: 75 MINUTES)Surname:Forenames:Student ID number:Circle ONE of the following:Lab time:T hursday 11-1Friday 11-1Thursd
University of Auckland - COMPSCI - 101
- 13 -COMPSCI 101FCAnswer bookSURNAME:FORENAMES:DEGREE (BSc, COP, Etc):STUDENT IDENTIFICATION NUMBER:SIGNATURE:Examiner to complete:QuestionMarkQuestion1627384Mark95TOTALCONTINUEDANSWER BOOK- 14 -Surname:Forenames:COMPSCI 101FC
University of Auckland - COMPSCI - 101
COMPSCI 101FCTHE UNIVERSITY OF AUCKLAND_EXAMINATION FOR BSc ETC 2002_COMPUTER SCIENCEPrinciples of Programming(Time allowed: TWO hours)NOTE:Attempt ALL questions.Write your answers in the answer book provided at the end of the exam paper. Youma
University of Auckland - COMPSCI - 101
COMPSCI 101FC 2002 TEST AND ANSWER BOOKPAGE 1STUDENT UPI:Question 1 (11 marks)a) What would be printed out by the following code segment?int i = 10;double d = i / 3;System.out.println(d);3.0(1 mark)b) What is printed by the following?System.out
University of Auckland - COMPSCI - 101
C OMPSCI 101FC Principles ofP rogrammingTest and Answer BookT est - Thursday 18th April 6:30pm-8:00pmFamily name or surnameGiven namesLab Day and Time (e.g. Monday 9)I nstructionsThis test constitutes 15% of your final grade for the course.No one
University of Auckland - COMPSCI - 101
COMPSCI 101THE UNIVERSITY OF AUCKLANDSECOND SEMESTER, 2002Campus: City and TamakiCOMPUTER SCIENCEPrinciples of Programming(Time allowed: TWO hours)NOTE: Attempt ALL questions.Write your answers in the space provided.There is space at the back for
University of Auckland - COMPSCI - 101
COMPSCI 101THE UNIVERSITY OF AUCKLANDSECOND SEMESTER, 2002Campus: City and TamakiCOMPUTER SCIENCEPrinciples of Programming(Time allowed: TWO hours)NOTE: Attempt ALL questions.Write your answers in the space provided.There is space at the back for
University of Auckland - COMPSCI - 101
COMPSCI 101THE UNIVERSITY OF AUCKLANDSECOND SEMESTER, 2002Campus: City and TamakiCOMPUTER SCIENCETESTPrinciples of Programming(Time allowed: 75 minutes)NOTE:Attempt ALL questions.Write your answers in the space provided.There is space at the ba
University of Auckland - COMPSCI - 101
COMPSCI 101THE UNIVERSITY OF AUCKLANDSECOND SEMESTER, 2002Campus: City and TamakiCOMPUTER SCIENCETESTPrinciples of Programming(Time allowed: 75 minutes)NOTE: Attempt ALL questions.Write your answers in the space provided.There is space at the ba
University of Auckland - COMPSCI - 101
CompSci 101 SS CTHE UNIVERSITY OF AUCKLANDSummer School, 2003City CampusCOMPUTER SCIENCEPrinciples of Programming(Time allowed: TWO HOURS)Surname:Forenames:Student ID number:Login name (UPI):INSTRUCTIONS:Attempt ALL questions - write your answ
University of Auckland - COMPSCI - 101
CompSci 101 SS CTHE UNIVERSITY OF AUCKLANDSummer School, 2003City CampusCOMPUTER SCIENCEPrinciples of Programming(Time allowed: TWO HOURS)Surname:Forenames:Student ID number:Login name (UPI):INSTRUCTIONS:Attempt ALL questions - write your answ
University of Auckland - COMPSCI - 101
CompSci 101 SS C Terms Test 2003Answers to question 1, 2, 10 and 11QUESTION 1a)b)c)d)e)f)g)h)5.0Total = 51.5Total = &quot; + 5 + 1.5n\\n10097int rand = (int)(Math.random() * 50) * 2) + 1;System.out.println(rand);QUESTION 24 syntax errors:
University of Auckland - COMPSCI - 101
C ompSci 1 01 S S CTHE UNIVERSITY OF AUCKLANDSUMMER SCHOOL, 2003COMPUTER SCIENCEPrinciples of ProgrammingTERMS TEST(Time allowed: 75 MINUTES)Surname:Forenames:Student ID number:Login name (UPI):INSTRUCTIONS:Attempt ALL questions - write your a
University of Auckland - COMPSCI - 101
CompSci 101 S1 CTHE UNIVERSITY OF AUCKLANDFirst Semester, 2003City CampusCOMPUTER SCIENCEPrinciples of Programming(Time allowed: TWO HOURS)Surname:Forenames:Student ID number:Login name (UPI):INSTRUCTIONS:Attempt ALL questions - write your ans
University of Auckland - COMPSCI - 101
CompSci 101 S1 CTHE UNIVERSITY OF AUCKLANDFirst Semester, 2003City CampusCOMPUTER SCIENCEPrinciples of Programming(Time allowed: TWO HOURS)Surname:Forenames:Student ID number:Login name (UPI):INSTRUCTIONS:Attempt ALL questions - write your ans
University of Auckland - COMPSCI - 101
CompSci 101 S1 CTHE UNIVERSITY OF AUCKLANDFIRST SEMESTER, 2003COMPUTER SCIENCEPrinciples of ProgrammingTERMS TEST(Time allowed: 60 MINUTES)Surname:SOLUTIONSForenames:Student ID number:Login name (UPI):INSTRUCTIONS:Attempt ALL questions - writ
University of Auckland - COMPSCI - 101
CompSci 101 S1 CTHE UNIVERSITY OF AUCKLANDFIRST SEMESTER, 2003COMPUTER SCIENCEPrinciples of ProgrammingTERMS TEST(Time allowed: 60 MINUTES)Surname:Forenames:Student ID number:Login name (UPI):INSTRUCTIONS:Attempt ALL questions - write your ans
University of Auckland - COMPSCI - 101
COMPSCI 101 S2 C/TTHE UNIVERSITY OF AUCKLANDSecond Semester, 2003City/Tamaki CampusCOMPUTER SCIENCEPrinciples of Programming(Time allowed: TWO HOURS)Surname:Forenames:Student ID number:Login name (UPI):INSTRUCTIONS:Attempt ALL questions - writ
University of Auckland - COMPSCI - 101
COMPSCI 101 S2 C/TTHE UNIVERSITY OF AUCKLANDSecond Semester, 2003City/Tamaki CampusCOMPUTER SCIENCEPrinciples of Programming(Time allowed: TWO HOURS)Surname:Forenames:Student ID number:Login name (UPI):INSTRUCTIONS:Attempt ALL questions - writ
University of Auckland - COMPSCI - 101
COMPSCI 101 S2THE UNIVERSITY OF AUCKLANDSECOND SEMESTER, 2003COMPUTER SCIENCEPrinciples of ProgrammingTEST(Time allowed: 75 MINUTES)Surname:Forenames:Student ID number:Login name (UPI):Lab Group (e.g. Mon 1-3):INSTRUCTIONS:Attempt ALL questio
University of Auckland - COMPSCI - 101
COMPSCI 101 S2THE UNIVERSITY OF AUCKLANDSECOND SEMESTER, 2003COMPUTER SCIENCEPrinciples of ProgrammingTEST(Time allowed: 75 MINUTES)Surname:Forenames:Student ID number:Login name (UPI):Lab Group (e.g. Mon 1-3):INSTRUCTIONS:Attempt ALL questio
University of Auckland - COMPSCI - 101
CompSci 101 SS CTHE UNIVERSITY OF AUCKLANDSummer Semester, 2004City CampusCOMPUTER SCIENCEPrinciples of Programming(Time allowed: TWO HOURS)Surname:Forenames:Student ID number:Login name (UPI):INSTRUCTIONS:Attempt ALL questionsWrite your answ
University of Auckland - COMPSCI - 101
CompSci 101 SS CTHE UNIVERSITY OF AUCKLANDSummer Semester, 2004City CampusCOMPUTER SCIENCEPrinciples of Programming(Time allowed: TWO HOURS)Surname:Forenames:Student ID number:Login name (UPI):INSTRUCTIONS:Attempt ALL questionsWrite your answ
University of Auckland - COMPSCI - 101
CompSci 101THE UNIVERSITY OF AUCKLANDFirst Semester, 2004Campus: City and TamakiCOMPUTER SCIENCEPrinciples of Programming(Time allowed: TWO HOURS)Surname:MODELForenames:ANSWERSStudent ID number:123456789Login name (UPI):abcd001INSTRUCTIONS:
University of Auckland - COMPSCI - 101
CompSci 101THE UNIVERSITY OF AUCKLANDFirst Semester, 2004Campus: City and TamakiCOMPUTER SCIENCEPrinciples of Programming(Time allowed: TWO HOURS)Surname:Forenames:Student ID number:Login name (UPI):INSTRUCTIONS:Attempt ALL questions, calculat
University of Auckland - COMPSCI - 101
e) What is printed by the following?CompSci 101 S1 2004 City and TamakiSystem.out.println(5 + 9 % 2 * (10 / 4) - 6);Terms Test Model Answers1Question 1 (20 marks)(2 marks)a) What is printed by the following?f) What is printed by the following?Sys
University of Auckland - COMPSCI - 101
CompSci 101THE UNIVERSITY OF AUCKLANDSEMESTER ONE, 2004Campus: City and TamakiCOMPUTER SCIENCETESTPrinciples of Programming(Time allowed: 75 MINUTES)NOTE: Attempt ALL questions Write your answers in the space provided There is space at the back
University of Auckland - COMPSCI - 101
CompSci 101 Semester 2, 2004Test Answers123456789101112131415161718192021222324252627282930ADDCDEDACDDEDEAADABAEDDAABDECACOMPSCI 101 - Laboratory 0631num1:num1:num1:num1:0,1,2,8,num2: