0% found this document useful (0 votes)
52 views

HP11c Quick Reference Guide

The HP-11C is a pocket-sized calculator introduced by Hewlett-Packard in 1974. It has approximately 204 bytes of memory and 20 storage registers. Programming is done through program memory which stores up to 444 program steps. The calculator can perform basic arithmetic, trigonometric, logarithmic, and statistical functions. It also has programming capabilities allowing users to write programs of up to 444 steps in length using commands like GTO, GSB, and RCL.
Copyright
© Attribution Non-Commercial (BY-NC)
Available Formats
Download as PDF, TXT or read online on Scribd
0% found this document useful (0 votes)
52 views

HP11c Quick Reference Guide

The HP-11C is a pocket-sized calculator introduced by Hewlett-Packard in 1974. It has approximately 204 bytes of memory and 20 storage registers. Programming is done through program memory which stores up to 444 program steps. The calculator can perform basic arithmetic, trigonometric, logarithmic, and statistical functions. It also has programming capabilities allowing users to write programs of up to 444 steps in length using commands like GTO, GSB, and RCL.
Copyright
© Attribution Non-Commercial (BY-NC)
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 4

HP-11C

HP-11C Quick Reference


Thimet Memory & Display Memory Approx. 204 bytes of memory Default: 20 umber stora!e re!isters "# bytes ea$h% a & '4 pro!ram steps. (tora!e re!isters are automati$ally $o )erte& to pro!ram memory as ee&e&. 4-le)el sta$*+ ,ast--+ . &ex re!ister. /o )olatile memory+ partially mer!e& pro!ram $omma &s /umber Tur off+ press 0 hol& 1/+ press 2.2+ release 1/+ release 2.2 separator This to!!les bet3ee usi ! a &ot or $omma for the &e$imal separator. 4lobal Tur off+ press 0 hol& 1/+ press 2-2+ release 1/+ release 2-2 reset This $lears all perma e t memory5 M6M Displays memory assi! me t i the form 2P-56 r-,92 . this example there are 7' u use& pro!ram steps a & the ext stora!e re!ister $o )erte& to pro!ram memory is lo$atio 2+82 9.- 0-8 (ele$t fix-poi t format (C. 0-8 (ele$t s$ie tifi$ format 3ith expo e t 6/4 0-8 (ele$t e !i eeri ! format 3ith expo e t al3ays bei ! a multiple of : Clearing Data Deletes either the last &i!it &uri ! umber e try or the e tire --re!ister i $ase umber e try has bee termi ate&. Also use& i pro!rammi ! mo&e+ see there C,6A; Clear sta$* a & summatio re!isters 0-7 C,6A; P;4M ;</ mo&e: (et pro!ram $ou ter to 000 P;4M mo&e: 6rase e tire pro!ram memory C,6A; ;64 Clear all stora!e re!isters C,6A; Clear prefix *ey a & briefly &isplay all 10 &i!its of the ma tissa P;69.C, ;</ mo&e: Clear --re!ister P;4M mo&e: (tore the C,- $omma & as a pro!ram $omma & Storage Registers & Indirect ddressing (T1 0-8+ .0-.8 (T1 > 0-8 (T1 ? 0-8 (T1 x 0-8 (T1 0-8 ;C, 0-8+ .0-.8 (T1 . ;C, . or f . - . (tore - i the spe$ifie& stora!e re!ister. =y &efault+ 20 re!isters are a)ailable ;e!ister arithmeti$. 1 ly supporte& for re!isters 0-8. ;C, re!ister arithmeti$ is ot supporte&. To perform re!ister arithmeti$ 3ith re!isters .0-.8 use i &ire$t a&&ressi ! "see belo3%. ;e$all umber from stora!e re!ister to --re!ister (tore - i i &ex re!ister ;e$all )alue from i &ex re!ister 6x$ha !e - 3ith i &ex re!ister

HP-11C (T1 "i% (T1 >?x "i% ;C, "i% or f "i% - "i% ;C, > ,(T (tore - i the re!ister poi te& to by .. @alues of . a & $orrespo &i ! re!isters: 0-8 ;0-;8+ 10-18 ;.0-;.8+ 10 . Perform i &ire$t re!ister stora!e arithmeti$ ;e$all )alue from the re!ister poi te& to by . 6x$ha !e - 3ith the re!ister poi te& to by . ;e$all x a & y from the summatio re!isters i to - 0 A ;e$all last )alue of --re!ister as is 3as before the pre)ious operatio !unctions "Selection# ;A/B (T1 f ;A/B P ; H.M( H ;AD D64 Py+x Cy+x x5 ;/D 9;AC ./T yx J J Create ra &om umber 0 - C 1 (tore - as the e3 ra &om umber see& Co )ert "-Dx+ADx% from ortho!o al to polar $oor&i ates "-Dr+AD % (ee label o the ba$* of the $al$ulator Co )ert "-Dr+AD % from polar to ortho!o al $oor&i ates "-Dx+ADx% Co )ert fra$tio al hours to hours+ mi utes 0 se$o &s H.MMSSs Co )ert hours+ mi utes 0 se$o &s H.MMSSs to fra$tio al hours Co )ert &e!ress ":'0% to ra&ia s "2 % Co )ert ra&ia s "2 % to &e!ress ":'0% Permutatio s D A5 E "A--%5 /umber of possibilities to sele$t - eleme ts from a !roup of A &iffere t eleme ts 3here &iffere t seFue $es $ou t separately. Combi atio s D A5 E G-5 "A--%5H /umber of possibilities to sele$t - eleme ts from a !roup of A &iffere t eleme ts 3here &iffere t seFue $es do not $ou t separately. 9a$ulty a & 4amma. Cal$ulates "x>1%D 5 for positi)e a & o -i te!er e!ati)e umbers ;ou &s - to the umber of $urre tly &isplaye& &i!its ;etur s the fra$tio al part of ;etur s the i te!er part of A to the po3er of -. Ior*s also for e!ati)e A i $ase - is i te!er Cal$ulates - per$e t of A. Does ot pop the sta$*5 Per$e tial &iffere $e from A to -. Does ot pop the sta$*5 $rigonometric !unctions D64 ;AD 4;D (./ (./-1 HAP (./ HAP-1 (./ (et tri! mo&e 2&e!rees2 ":'0% (et tri! mo&e 2ra&ia s2 "2 %+ i &i$ate& i &isplay (et tri! mo&e 2!ra&2 "400% + i &i$ate& i &isplay C1( TA/ Tri!o ometri$ fu $tio s+ performe& i $urre t mo&e "D64+ ;AD+ 4;D% C1(-1 TA/-1 . )erse tri! fu $tio s HAP C1( HAP TA/ Hyperboli$ fu $tio s "i &epe &e t of tri! mo&e5% -1 -1 HAP HAP TA/ . )erse hyperboli$ fu $tio s C1(

HP-11C Summation & Statistics 4e eral The statisti$s re!isters o$$upy the stora!e re!isters 0-7+ see $al$ulatorKs ba$* label. (ee se$tio Clearing Data for statisti$s re!ister &eletio . (tats re!isters $a also be use& for )e$tor a&&itio a & substra$tio 5 ;e!ister usa!e: 0D + 1Dx+ 2Dx2+ :Dy+ 4Dy2+ 7Dxy A&& - a & A to the stats re!isters. This 3ill &isplay the total umber of e tries a & &isable sta$* lift so that the ext e try 3ill o)er3rite the $ou t. (ubstra$t - a & A from the stats re!isters ;e$all x a & y from the summatio re!isters i to - 0 A Cal$ulate x 0 y mea )alue a & pla$e result i - 0 A Cal$ulate x 0 y sta &ar& &e)iatio a & pla$e result i - 0 A. sxD(L;TG M x2 ? "x% 2N E M " -1%N H ,i ear re!ressio . Cal$ulates a strai!ht li e thru the "-+A% &ata poi ts a & retur s the slope of the li e i A a & the y-offset i This fu $tio assumes a strai!ht li e thru the "-+A% &ata poi ts a & $al$ulates for a !i)e - the approximate& y )alue 3hi$h is retur e& i -. . A this fu $tio retur s a estimate ho3 $lose the &ata poi ts $ome to a strai!ht li e. >1 i &i$ates that all poi ts lie o a li e 3ith positi)e slope+ -1 i &i$ates that all poi ts lie o a li e 3ith e!ati)e slope+ 0 i &i$ates that a approximatio by a strai!ht li e is Kt possible. Programming PE; ((T =(T . serti ! 0 &eleti ! steps To!!les bet3ee ;</ "pro!ram exe$utio % a & P;4M "pro!ram e try% mo&e. (ee se$tio Clearing Data for pro!ram memory a & pro!ram step &eletio . ;</: Display a & exe$ute ext pro!ram step P;4M: (tep for3ar& thru pro!ram ;</: Display a & !o ba$* to pre)ious pro!ram step but &o ot exe$ute a y pro!ram $o&e P;4M: (tep ba$*3ar&s thru pro!ram Pro!ram e try starts 3ith li e umber 1 ,i e 2000-2 i &i$ates the start of the pro!ram spa$e Comma &s are i serte& after the $urre tly &isplaye& li e Delete the $urre tly &isplaye& i stru$tio 3ith Pro!ram $o&e )alues i &i$ate the ro3 0 $olum of a $omma & 3ith the ex$eptio that umbers are &isplaye& as su$h. Prefix *ey ha)e their o3 $o&e. 6xample: 001-42.21. 0 $orrespo &s to 2,=, 12 "42Df+ 21D((TE,=,+ 0D0% ;</: 6xe$ute pro!ram starti ! at the !i)e label. A error o$$urs if the label is ot fou &. A y *eypress 3ill halt the pro!ram5 P;4M: . sert a 24(= label2 $omma & /ormally+ f A-6 must be presse& to exe$ute a pro!ram+ see abo)e. . <(6; mo&e the prefix-f is ot ee&e&+ ie. pressi ! ex 3ill imme&iately exe$ute the pro!ram starti ! at label =. <se the prefix-f to rea$h the *eys ormal fu $tio . <(6; mo&e is i &i$ate& i the &isplay

> (T1 > ;C, > x s ,.;. y+r

f A-6 <(6;

HP-11C ;E( Co ti ue pro!ram at $urre t pro!ram $ou ter . sert ;E( $omma & 3hi$h 3ill halt the pro!ram at this lo$atio ;T/ (et pro!ram $out er to 000 . sert a ;T/ i stru$tio . This 3ill retur from a subrouti e or at the top le)el e & the pro!ram a & set the pro!ram $ou ter to 000 4T1 . ;</ 0 P;4M mo&e: Oump to pro!ram li e 4T0 0-8+ A-6 ;</: (et pro!ram $ou ter to the spe$ifie& label P;4M: . sert a 4T1 i stru$tio 4(= 0-8+ A-6 ;</: 6xe$ute the pro!ram starti ! at the !i)e label P;4M: . sert a 4(= i stru$tio . A maximum of four subrouti e $alls $a be este& 9la!s There are two fla!s+ 0 a & 1. (9 : (et fla! + C9 : Clear fla! 9P : 6xe$ute ext step if fla! is set+ s*ip ext step if fla! is $lear Comparis -D0+ - 0+ -Q0+ - 0+ -DA+ - A+ -QA+ - A .f $amparis is false: (*ip the ext pro!ram step .f $amparis is true : 6xe$ute the ext pro!ram step P(6 Halt pro!ram for about 1 se$o & a & &isplay the --re!ister %sing $&e Inde' Register In Programs 4T1 . Oump to the label i &i$ate& by the . re!ister. 1 ly the i te!er part of . 3ill be use&5 @alues of . a & asso$iate& labels: .f . 0: 0...8 ,=, 0...,=, 8+ 10...14 ,=, A...,=, 6 .f .C0: Oump to the li e umber i &i$ate& by the absolute )alue of .. .e. if .D?7.: the Rump 3ill !o to li e umber 7. Perform subrouti e $all to the label i &i$ate& by the . re!ister . $reme t a & s*ip if !reater. This loop $omma & uses the i &ex re!ister . 3hi$h must $o tai a )alue i the form nnnnn.xxxyy 3here: : Curre t "i itial% loop $ou ter )alue xxx: Comparis )alue for loop $ou ter yy: ,oop $ou ter i $reme t "or &e$reme t for D(6%+ if yD0 the 1 is use& i stea& .(4 first i $reme ts by y a & the $ompares the e3 to x: .f Qx the ext pro!ram step is s*ippe& .f x the ext pro!ram step is exe$ute& .e. if i itially .D0.02: the the loop 3ill ru from 0 to 22 "or 1 to 2:% De$reme t a & s*ip if eFual "or smaller%. D(6 first &e$reme ts by y a & the $ompares the e3 to x: .f x the ext pro!ram step is s*ippe& .f Qx the ext pro!ram step is exe$ute& ;</: P;4M: ;</: P;4M:

4(= . .(4

D(6

You might also like