<?xml version='1.0' encoding='UTF-8'?><?xml-stylesheet href="http://www.blogger.com/styles/atom.css" type="text/css"?><feed xmlns='http://www.w3.org/2005/Atom' xmlns:openSearch='http://a9.com/-/spec/opensearchrss/1.0/' xmlns:georss='http://www.georss.org/georss' xmlns:gd='http://schemas.google.com/g/2005' xmlns:thr='http://purl.org/syndication/thread/1.0'><id>tag:blogger.com,1999:blog-1300399623975330669</id><updated>2011-07-07T17:29:04.412-07:00</updated><category term='SOFTSKILL'/><category term='BAHASA INGGRIS'/><title type='text'>- i R a -</title><subtitle type='html'></subtitle><link rel='http://schemas.google.com/g/2005#feed' type='application/atom+xml' href='http://asmarnovira.blogspot.com/feeds/posts/default'/><link rel='self' type='application/atom+xml' href='http://www.blogger.com/feeds/1300399623975330669/posts/default?max-results=100'/><link rel='alternate' type='text/html' href='http://asmarnovira.blogspot.com/'/><link rel='hub' href='http://pubsubhubbub.appspot.com/'/><author><name>IRA</name><uri>http://www.blogger.com/profile/04417846760028408557</uri><email>noreply@blogger.com</email><gd:image rel='http://schemas.google.com/g/2005#thumbnail' width='16' height='16' src='http://img2.blogblog.com/img/b16-rounded.gif'/></author><generator version='7.00' uri='http://www.blogger.com'>Blogger</generator><openSearch:totalResults>14</openSearch:totalResults><openSearch:startIndex>1</openSearch:startIndex><openSearch:itemsPerPage>100</openSearch:itemsPerPage><entry><id>tag:blogger.com,1999:blog-1300399623975330669.post-345542174305765621</id><published>2010-06-18T07:03:00.000-07:00</published><updated>2010-06-18T07:12:18.065-07:00</updated><category scheme='http://www.blogger.com/atom/ns#' term='SOFTSKILL'/><title type='text'>Pemanfaatan Hard Disk</title><content type='html'>&lt;div style="text-align: center;"&gt;Pemanfaatan Hard Disk&lt;br /&gt;&lt;/div&gt;&lt;br /&gt;&lt;div style="text-align: justify;"&gt;Ketika kita menyimpan data di komputer, salah satu media penyimpanan yang paling terkenal adalah di hard disk. Hard disk mempunyai peranan yang cukup penting dalam komputer karena merupakan media penyimpanan dari OS atau sistem operasi komputer. Fungsi utamanya sebagai media penyimpanan atau storage data secara permanen. Hard disk menyimpan bermacam-macam informasi, salah satunya informasi mengenai hardware yang ada di dalam PC tersebut, lalu OS itu sendiri. Hard disk merupakan salah satu komponen yang menentukan kinerja PC. Semakin cepat hard disk bekerja, semakin cepat pula transfer yang dihasilkan. Hard disk IDE mempunyai 4 tingkatan kelas, masing-masing Ultra DMA/33, Ultra DMA/66, Ultra/100, dan Ultra DMA/133. DMA singkatan dari Direct Memory Access yang berfungsi untuk meningkatkan transfer data. Maksud Ultra DMA/33 adalah daya transfer rata-ratanya 33 MBps. Jadi, Ultra DMA/133 sama dengan transfer datanya 133 MBps. Penggunaan hard disk jenis SATA masih sedikit dan mahal, tetapi kecepatan transfernya lebih cepat daripada ATA. Hard disk lambat laun mengalami peningkatan dalam hal kapasitas penyimpanan data. Pada masa Windows 3.1, penggunaan hard disk dengan ukuran 300 Mb sudah cukup. Pada Windows 98, hard disk dengan ukuran 8.3 Gb sudah lebih dari cukup. Untuk pemakaian hard disk yang intensif, ukuran tersebut sangat kurang, apalagi menggunakan OS yang baru dan program yang baru pula. Mungkin untuk ukuran standar, hard disk yang dipakai sekarang adalah 20 GB atau lebih tergantung kebutuhan anda. Kecepatan putar hard disk bermacam-macam, antara lain 5400 RPM, 7200 RPM, atau lebih. Putaran yang dihasilkan hard disk yang memiliki RPM 7200 lebih bising daripada 5400 RPM, akibatnya hard disk menjadi lebih cepat panas. Kita memerlukan kipas pendingin untuk mendinginkan dan menjaga peranti ini dapat hidup bertahan lama. Untuk membagi(partisi) hardisk sebenarnya sesuai kebutuhan kita. Ada macam-macam cara membagi hardisk yang baik. Misalkan, untuk hardisk yang kapasitasnya 20 Gb, maka pembagiannya 5 Gb untuk sistem dan 15 Gb untuk data (tanpa install berbagai macam game). Alasan mengapa untuk sistem kapasitasnya lebih kecil karena kalau kecil maka cara kerjana juga lebih cepat. Pembagian hardisk ini sangat penting. Jika partisi sistem rusak, data-data kita tidak ikut hilang.&lt;/div&gt;&lt;div class="blogger-post-footer"&gt;&lt;img width='1' height='1' src='https://blogger.googleusercontent.com/tracker/1300399623975330669-345542174305765621?l=asmarnovira.blogspot.com' alt='' /&gt;&lt;/div&gt;</content><link rel='replies' type='application/atom+xml' href='http://asmarnovira.blogspot.com/feeds/345542174305765621/comments/default' title='Poskan Komentar'/><link rel='replies' type='text/html' href='http://asmarnovira.blogspot.com/2010/06/pemanfaatan-hard-disk.html#comment-form' title='0 Komentar'/><link rel='edit' type='application/atom+xml' href='http://www.blogger.com/feeds/1300399623975330669/posts/default/345542174305765621'/><link rel='self' type='application/atom+xml' href='http://www.blogger.com/feeds/1300399623975330669/posts/default/345542174305765621'/><link rel='alternate' type='text/html' href='http://asmarnovira.blogspot.com/2010/06/pemanfaatan-hard-disk.html' title='Pemanfaatan Hard Disk'/><author><name>IRA</name><uri>http://www.blogger.com/profile/04417846760028408557</uri><email>noreply@blogger.com</email><gd:image rel='http://schemas.google.com/g/2005#thumbnail' width='16' height='16' src='http://img2.blogblog.com/img/b16-rounded.gif'/></author><thr:total>0</thr:total></entry><entry><id>tag:blogger.com,1999:blog-1300399623975330669.post-3933911202521692748</id><published>2010-06-17T04:59:00.000-07:00</published><updated>2010-06-17T05:16:19.010-07:00</updated><category scheme='http://www.blogger.com/atom/ns#' term='SOFTSKILL'/><title type='text'>Quicksort</title><content type='html'>&lt;meta http-equiv="Content-Type" content="text/html; charset=utf-8"&gt;&lt;meta name="ProgId" content="Word.Document"&gt;&lt;meta name="Generator" content="Microsoft Word 12"&gt;&lt;meta name="Originator" content="Microsoft Word 12"&gt;&lt;link rel="File-List" href="file:///C:%5CDOCUME%7E1%5CDELL%5CLOCALS%7E1%5CTemp%5Cmsohtmlclip1%5C01%5Cclip_filelist.xml"&gt;&lt;link rel="themeData" href="file:///C:%5CDOCUME%7E1%5CDELL%5CLOCALS%7E1%5CTemp%5Cmsohtmlclip1%5C01%5Cclip_themedata.thmx"&gt;&lt;link rel="colorSchemeMapping" href="file:///C:%5CDOCUME%7E1%5CDELL%5CLOCALS%7E1%5CTemp%5Cmsohtmlclip1%5C01%5Cclip_colorschememapping.xml"&gt;&lt;!--[if gte mso 9]&gt;&lt;xml&gt;  &lt;w:WordDocument&gt;   &lt;w:View&gt;Normal&lt;/w:View&gt;   &lt;w:Zoom&gt;0&lt;/w:Zoom&gt;   &lt;w:TrackMoves/&gt;   &lt;w:TrackFormatting/&gt;   &lt;w:PunctuationKerning/&gt;   &lt;w:ValidateAgainstSchemas/&gt;   &lt;w:SaveIfXMLInvalid&gt;false&lt;/w:SaveIfXMLInvalid&gt;   &lt;w:IgnoreMixedContent&gt;false&lt;/w:IgnoreMixedContent&gt;   &lt;w:AlwaysShowPlaceholderText&gt;false&lt;/w:AlwaysShowPlaceholderText&gt;   &lt;w:DoNotPromoteQF/&gt;   &lt;w:LidThemeOther&gt;EN-US&lt;/w:LidThemeOther&gt;   &lt;w:LidThemeAsian&gt;X-NONE&lt;/w:LidThemeAsian&gt;   &lt;w:LidThemeComplexScript&gt;X-NONE&lt;/w:LidThemeComplexScript&gt;   &lt;w:Compatibility&gt;    &lt;w:BreakWrappedTables/&gt;    &lt;w:SnapToGridInCell/&gt;    &lt;w:WrapTextWithPunct/&gt;    &lt;w:UseAsianBreakRules/&gt;    &lt;w:DontGrowAutofit/&gt;    &lt;w:SplitPgBreakAndParaMark/&gt;    &lt;w:DontVertAlignCellWithSp/&gt;    &lt;w:DontBreakConstrainedForcedTables/&gt;    &lt;w:DontVertAlignInTxbx/&gt;    &lt;w:Word11KerningPairs/&gt;    &lt;w:CachedColBalance/&gt;   &lt;/w:Compatibility&gt;   &lt;w:BrowserLevel&gt;MicrosoftInternetExplorer4&lt;/w:BrowserLevel&gt;   &lt;m:mathPr&gt;    &lt;m:mathFont m:val="Cambria Math"/&gt;    &lt;m:brkBin m:val="before"/&gt;    &lt;m:brkBinSub m:val="--"/&gt;    &lt;m:smallFrac m:val="off"/&gt;    &lt;m:dispDef/&gt;    &lt;m:lMargin m:val="0"/&gt;    &lt;m:rMargin m:val="0"/&gt;    &lt;m:defJc m:val="centerGroup"/&gt;    &lt;m:wrapIndent m:val="1440"/&gt;    &lt;m:intLim m:val="subSup"/&gt;    &lt;m:naryLim m:val="undOvr"/&gt;   &lt;/m:mathPr&gt;&lt;/w:WordDocument&gt; &lt;/xml&gt;&lt;![endif]--&gt;&lt;!--[if gte mso 9]&gt;&lt;xml&gt;  &lt;w:LatentStyles DefLockedState="false" DefUnhideWhenUsed="true"   DefSemiHidden="true" DefQFormat="false" DefPriority="99"   LatentStyleCount="267"&gt;   &lt;w:LsdException Locked="false" Priority="0" SemiHidden="false"    UnhideWhenUsed="false" QFormat="true" Name="Normal"/&gt;   &lt;w:LsdException Locked="false" Priority="9" SemiHidden="false"    UnhideWhenUsed="false" QFormat="true" Name="heading 1"/&gt;   &lt;w:LsdException Locked="false" Priority="9" QFormat="true" Name="heading 2"/&gt;   &lt;w:LsdException Locked="false" Priority="9" QFormat="true" Name="heading 3"/&gt;   &lt;w:LsdException Locked="false" Priority="9" QFormat="true" Name="heading 4"/&gt;   &lt;w:LsdException Locked="false" Priority="9" QFormat="true" Name="heading 5"/&gt;   &lt;w:LsdException Locked="false" Priority="9" QFormat="true" Name="heading 6"/&gt;   &lt;w:LsdException Locked="false" Priority="9" QFormat="true" Name="heading 7"/&gt;   &lt;w:LsdException Locked="false" Priority="9" QFormat="true" Name="heading 8"/&gt;   &lt;w:LsdException Locked="false" Priority="9" QFormat="true" Name="heading 9"/&gt;   &lt;w:LsdException Locked="false" Priority="39" Name="toc 1"/&gt;   &lt;w:LsdException Locked="false" Priority="39" Name="toc 2"/&gt;   &lt;w:LsdException Locked="false" Priority="39" Name="toc 3"/&gt;   &lt;w:LsdException Locked="false" Priority="39" Name="toc 4"/&gt;   &lt;w:LsdException Locked="false" Priority="39" Name="toc 5"/&gt;   &lt;w:LsdException Locked="false" Priority="39" Name="toc 6"/&gt;   &lt;w:LsdException Locked="false" Priority="39" Name="toc 7"/&gt;   &lt;w:LsdException Locked="false" Priority="39" Name="toc 8"/&gt;   &lt;w:LsdException Locked="false" Priority="39" Name="toc 9"/&gt;   &lt;w:LsdException Locked="false" Priority="35" QFormat="true" Name="caption"/&gt;   &lt;w:LsdException Locked="false" Priority="10" SemiHidden="false"    UnhideWhenUsed="false" QFormat="true" Name="Title"/&gt;   &lt;w:LsdException Locked="false" Priority="1" Name="Default Paragraph Font"/&gt;   &lt;w:LsdException Locked="false" Priority="11" SemiHidden="false"    UnhideWhenUsed="false" QFormat="true" Name="Subtitle"/&gt;   &lt;w:LsdException Locked="false" Priority="22" SemiHidden="false"    UnhideWhenUsed="false" QFormat="true" Name="Strong"/&gt;   &lt;w:LsdException Locked="false" Priority="20" SemiHidden="false"    UnhideWhenUsed="false" QFormat="true" Name="Emphasis"/&gt;   &lt;w:LsdException Locked="false" Priority="59" SemiHidden="false"    UnhideWhenUsed="false" Name="Table Grid"/&gt;   &lt;w:LsdException Locked="false" UnhideWhenUsed="false" Name="Placeholder Text"/&gt;   &lt;w:LsdException Locked="false" Priority="1" SemiHidden="false"    UnhideWhenUsed="false" QFormat="true" Name="No Spacing"/&gt;   &lt;w:LsdException Locked="false" Priority="60" SemiHidden="false"    UnhideWhenUsed="false" Name="Light Shading"/&gt;   &lt;w:LsdException Locked="false" Priority="61" SemiHidden="false"    UnhideWhenUsed="false" Name="Light List"/&gt;   &lt;w:LsdException Locked="false" Priority="62" SemiHidden="false"    UnhideWhenUsed="false" Name="Light Grid"/&gt;   &lt;w:LsdException Locked="false" Priority="63" SemiHidden="false"    UnhideWhenUsed="false" Name="Medium Shading 1"/&gt;   &lt;w:LsdException Locked="false" Priority="64" SemiHidden="false"    UnhideWhenUsed="false" Name="Medium Shading 2"/&gt;   &lt;w:LsdException Locked="false" Priority="65" SemiHidden="false"    UnhideWhenUsed="false" Name="Medium List 1"/&gt;   &lt;w:LsdException Locked="false" Priority="66" SemiHidden="false"    UnhideWhenUsed="false" Name="Medium List 2"/&gt;   &lt;w:LsdException Locked="false" Priority="67" SemiHidden="false"    UnhideWhenUsed="false" Name="Medium Grid 1"/&gt;   &lt;w:LsdException Locked="false" Priority="68" SemiHidden="false"    UnhideWhenUsed="false" Name="Medium Grid 2"/&gt;   &lt;w:LsdException Locked="false" Priority="69" SemiHidden="false"    UnhideWhenUsed="false" Name="Medium Grid 3"/&gt;   &lt;w:LsdException Locked="false" Priority="70" SemiHidden="false"    UnhideWhenUsed="false" Name="Dark List"/&gt;   &lt;w:LsdException Locked="false" Priority="71" SemiHidden="false"    UnhideWhenUsed="false" Name="Colorful Shading"/&gt;   &lt;w:LsdException Locked="false" Priority="72" SemiHidden="false"    UnhideWhenUsed="false" Name="Colorful List"/&gt;   &lt;w:LsdException Locked="false" Priority="73" SemiHidden="false"    UnhideWhenUsed="false" Name="Colorful Grid"/&gt;   &lt;w:LsdException Locked="false" Priority="60" SemiHidden="false"    UnhideWhenUsed="false" Name="Light Shading Accent 1"/&gt;   &lt;w:LsdException Locked="false" Priority="61" SemiHidden="false"    UnhideWhenUsed="false" Name="Light List Accent 1"/&gt;   &lt;w:LsdException Locked="false" Priority="62" SemiHidden="false"    UnhideWhenUsed="false" Name="Light Grid Accent 1"/&gt;   &lt;w:LsdException Locked="false" Priority="63" SemiHidden="false"    UnhideWhenUsed="false" Name="Medium Shading 1 Accent 1"/&gt;   &lt;w:LsdException Locked="false" Priority="64" SemiHidden="false"    UnhideWhenUsed="false" Name="Medium Shading 2 Accent 1"/&gt;   &lt;w:LsdException Locked="false" Priority="65" SemiHidden="false"    UnhideWhenUsed="false" Name="Medium List 1 Accent 1"/&gt;   &lt;w:LsdException Locked="false" UnhideWhenUsed="false" Name="Revision"/&gt;   &lt;w:LsdException Locked="false" Priority="34" SemiHidden="false"    UnhideWhenUsed="false" QFormat="true" Name="List Paragraph"/&gt;   &lt;w:LsdException Locked="false" Priority="29" SemiHidden="false"    UnhideWhenUsed="false" QFormat="true" Name="Quote"/&gt;   &lt;w:LsdException Locked="false" Priority="30" SemiHidden="false"    UnhideWhenUsed="false" QFormat="true" Name="Intense Quote"/&gt;   &lt;w:LsdException Locked="false" Priority="66" SemiHidden="false"    UnhideWhenUsed="false" Name="Medium List 2 Accent 1"/&gt;   &lt;w:LsdException Locked="false" Priority="67" SemiHidden="false"    UnhideWhenUsed="false" Name="Medium Grid 1 Accent 1"/&gt;   &lt;w:LsdException Locked="false" Priority="68" SemiHidden="false"    UnhideWhenUsed="false" Name="Medium Grid 2 Accent 1"/&gt;   &lt;w:LsdException Locked="false" Priority="69" SemiHidden="false"    UnhideWhenUsed="false" Name="Medium Grid 3 Accent 1"/&gt;   &lt;w:LsdException Locked="false" Priority="70" SemiHidden="false"    UnhideWhenUsed="false" Name="Dark List Accent 1"/&gt;   &lt;w:LsdException Locked="false" Priority="71" SemiHidden="false"    UnhideWhenUsed="false" Name="Colorful Shading Accent 1"/&gt;   &lt;w:LsdException Locked="false" Priority="72" SemiHidden="false"    UnhideWhenUsed="false" Name="Colorful List Accent 1"/&gt;   &lt;w:LsdException Locked="false" Priority="73" SemiHidden="false"    UnhideWhenUsed="false" Name="Colorful Grid Accent 1"/&gt;   &lt;w:LsdException Locked="false" Priority="60" SemiHidden="false"    UnhideWhenUsed="false" Name="Light Shading Accent 2"/&gt;   &lt;w:LsdException Locked="false" Priority="61" SemiHidden="false"    UnhideWhenUsed="false" Name="Light List Accent 2"/&gt;   &lt;w:LsdException Locked="false" Priority="62" SemiHidden="false"    UnhideWhenUsed="false" Name="Light Grid Accent 2"/&gt;   &lt;w:LsdException Locked="false" Priority="63" SemiHidden="false"    UnhideWhenUsed="false" Name="Medium Shading 1 Accent 2"/&gt;   &lt;w:LsdException Locked="false" Priority="64" SemiHidden="false"    UnhideWhenUsed="false" Name="Medium Shading 2 Accent 2"/&gt;   &lt;w:LsdException Locked="false" Priority="65" SemiHidden="false"    UnhideWhenUsed="false" Name="Medium List 1 Accent 2"/&gt;   &lt;w:LsdException Locked="false" Priority="66" SemiHidden="false"    UnhideWhenUsed="false" Name="Medium List 2 Accent 2"/&gt;   &lt;w:LsdException Locked="false" Priority="67" SemiHidden="false"    UnhideWhenUsed="false" Name="Medium Grid 1 Accent 2"/&gt;   &lt;w:LsdException Locked="false" Priority="68" SemiHidden="false"    UnhideWhenUsed="false" Name="Medium Grid 2 Accent 2"/&gt;   &lt;w:LsdException Locked="false" Priority="69" SemiHidden="false"    UnhideWhenUsed="false" Name="Medium Grid 3 Accent 2"/&gt;   &lt;w:LsdException Locked="false" Priority="70" SemiHidden="false"    UnhideWhenUsed="false" Name="Dark List Accent 2"/&gt;   &lt;w:LsdException Locked="false" Priority="71" SemiHidden="false"    UnhideWhenUsed="false" Name="Colorful Shading Accent 2"/&gt;   &lt;w:LsdException Locked="false" Priority="72" SemiHidden="false"    UnhideWhenUsed="false" Name="Colorful List Accent 2"/&gt;   &lt;w:LsdException Locked="false" Priority="73" SemiHidden="false"    UnhideWhenUsed="false" Name="Colorful Grid Accent 2"/&gt;   &lt;w:LsdException Locked="false" Priority="60" SemiHidden="false"    UnhideWhenUsed="false" Name="Light Shading Accent 3"/&gt;   &lt;w:LsdException Locked="false" Priority="61" SemiHidden="false"    UnhideWhenUsed="false" Name="Light List Accent 3"/&gt;   &lt;w:LsdException Locked="false" Priority="62" SemiHidden="false"    UnhideWhenUsed="false" Name="Light Grid Accent 3"/&gt;   &lt;w:LsdException Locked="false" Priority="63" SemiHidden="false"    UnhideWhenUsed="false" Name="Medium Shading 1 Accent 3"/&gt;   &lt;w:LsdException Locked="false" Priority="64" SemiHidden="false"    UnhideWhenUsed="false" Name="Medium Shading 2 Accent 3"/&gt;   &lt;w:LsdException Locked="false" Priority="65" SemiHidden="false"    UnhideWhenUsed="false" Name="Medium List 1 Accent 3"/&gt;   &lt;w:LsdException Locked="false" Priority="66" SemiHidden="false"    UnhideWhenUsed="false" Name="Medium List 2 Accent 3"/&gt;   &lt;w:LsdException Locked="false" Priority="67" SemiHidden="false"    UnhideWhenUsed="false" Name="Medium Grid 1 Accent 3"/&gt;   &lt;w:LsdException Locked="false" Priority="68" SemiHidden="false"    UnhideWhenUsed="false" Name="Medium Grid 2 Accent 3"/&gt;   &lt;w:LsdException Locked="false" Priority="69" SemiHidden="false"    UnhideWhenUsed="false" Name="Medium Grid 3 Accent 3"/&gt;   &lt;w:LsdException Locked="false" Priority="70" SemiHidden="false"    UnhideWhenUsed="false" Name="Dark List Accent 3"/&gt;   &lt;w:LsdException Locked="false" Priority="71" SemiHidden="false"    UnhideWhenUsed="false" Name="Colorful Shading Accent 3"/&gt;   &lt;w:LsdException Locked="false" Priority="72" SemiHidden="false"    UnhideWhenUsed="false" Name="Colorful List Accent 3"/&gt;   &lt;w:LsdException Locked="false" Priority="73" SemiHidden="false"    UnhideWhenUsed="false" Name="Colorful Grid Accent 3"/&gt;   &lt;w:LsdException Locked="false" Priority="60" SemiHidden="false"    UnhideWhenUsed="false" Name="Light Shading Accent 4"/&gt;   &lt;w:LsdException Locked="false" Priority="61" SemiHidden="false"    UnhideWhenUsed="false" Name="Light List Accent 4"/&gt;   &lt;w:LsdException Locked="false" Priority="62" SemiHidden="false"    UnhideWhenUsed="false" Name="Light Grid Accent 4"/&gt;   &lt;w:LsdException Locked="false" Priority="63" SemiHidden="false"    UnhideWhenUsed="false" Name="Medium Shading 1 Accent 4"/&gt;   &lt;w:LsdException Locked="false" Priority="64" SemiHidden="false"    UnhideWhenUsed="false" Name="Medium Shading 2 Accent 4"/&gt;   &lt;w:LsdException Locked="false" Priority="65" SemiHidden="false"    UnhideWhenUsed="false" Name="Medium List 1 Accent 4"/&gt;   &lt;w:LsdException Locked="false" Priority="66" SemiHidden="false"    UnhideWhenUsed="false" Name="Medium List 2 Accent 4"/&gt;   &lt;w:LsdException Locked="false" Priority="67" SemiHidden="false"    UnhideWhenUsed="false" Name="Medium Grid 1 Accent 4"/&gt;   &lt;w:LsdException Locked="false" Priority="68" SemiHidden="false"    UnhideWhenUsed="false" Name="Medium Grid 2 Accent 4"/&gt;   &lt;w:LsdException Locked="false" Priority="69" SemiHidden="false"    UnhideWhenUsed="false" Name="Medium Grid 3 Accent 4"/&gt;   &lt;w:LsdException Locked="false" Priority="70" SemiHidden="false"    UnhideWhenUsed="false" Name="Dark List Accent 4"/&gt;   &lt;w:LsdException Locked="false" Priority="71" SemiHidden="false"    UnhideWhenUsed="false" Name="Colorful Shading Accent 4"/&gt;   &lt;w:LsdException Locked="false" Priority="72" SemiHidden="false"    UnhideWhenUsed="false" Name="Colorful List Accent 4"/&gt;   &lt;w:LsdException Locked="false" Priority="73" SemiHidden="false"    UnhideWhenUsed="false" Name="Colorful Grid Accent 4"/&gt;   &lt;w:LsdException Locked="false" Priority="60" SemiHidden="false"    UnhideWhenUsed="false" Name="Light Shading Accent 5"/&gt;   &lt;w:LsdException Locked="false" Priority="61" SemiHidden="false"    UnhideWhenUsed="false" Name="Light List Accent 5"/&gt;   &lt;w:LsdException Locked="false" Priority="62" SemiHidden="false"    UnhideWhenUsed="false" Name="Light Grid Accent 5"/&gt;   &lt;w:LsdException Locked="false" Priority="63" SemiHidden="false"    UnhideWhenUsed="false" Name="Medium Shading 1 Accent 5"/&gt;   &lt;w:LsdException Locked="false" Priority="64" SemiHidden="false"    UnhideWhenUsed="false" Name="Medium Shading 2 Accent 5"/&gt;   &lt;w:LsdException Locked="false" Priority="65" SemiHidden="false"    UnhideWhenUsed="false" Name="Medium List 1 Accent 5"/&gt;   &lt;w:LsdException Locked="false" Priority="66" SemiHidden="false"    UnhideWhenUsed="false" Name="Medium List 2 Accent 5"/&gt;   &lt;w:LsdException Locked="false" Priority="67" SemiHidden="false"    UnhideWhenUsed="false" Name="Medium Grid 1 Accent 5"/&gt;   &lt;w:LsdException Locked="false" Priority="68" SemiHidden="false"    UnhideWhenUsed="false" Name="Medium Grid 2 Accent 5"/&gt;   &lt;w:LsdException Locked="false" Priority="69" SemiHidden="false"    UnhideWhenUsed="false" Name="Medium Grid 3 Accent 5"/&gt;   &lt;w:LsdException Locked="false" Priority="70" SemiHidden="false"    UnhideWhenUsed="false" Name="Dark List Accent 5"/&gt;   &lt;w:LsdException Locked="false" Priority="71" SemiHidden="false"    UnhideWhenUsed="false" Name="Colorful Shading Accent 5"/&gt;   &lt;w:LsdException Locked="false" Priority="72" SemiHidden="false"    UnhideWhenUsed="false" Name="Colorful List Accent 5"/&gt;   &lt;w:LsdException Locked="false" Priority="73" SemiHidden="false"    UnhideWhenUsed="false" Name="Colorful Grid Accent 5"/&gt;   &lt;w:LsdException Locked="false" Priority="60" SemiHidden="false"    UnhideWhenUsed="false" Name="Light Shading Accent 6"/&gt;   &lt;w:LsdException Locked="false" Priority="61" SemiHidden="false"    UnhideWhenUsed="false" Name="Light List Accent 6"/&gt;   &lt;w:LsdException Locked="false" Priority="62" SemiHidden="false"    UnhideWhenUsed="false" Name="Light Grid Accent 6"/&gt;   &lt;w:LsdException Locked="false" Priority="63" SemiHidden="false"    UnhideWhenUsed="false" Name="Medium Shading 1 Accent 6"/&gt;   &lt;w:LsdException Locked="false" Priority="64" SemiHidden="false"    UnhideWhenUsed="false" Name="Medium Shading 2 Accent 6"/&gt;   &lt;w:LsdException Locked="false" Priority="65" SemiHidden="false"    UnhideWhenUsed="false" Name="Medium List 1 Accent 6"/&gt;   &lt;w:LsdException Locked="false" Priority="66" SemiHidden="false"    UnhideWhenUsed="false" Name="Medium List 2 Accent 6"/&gt;   &lt;w:LsdException Locked="false" Priority="67" SemiHidden="false"    UnhideWhenUsed="false" Name="Medium Grid 1 Accent 6"/&gt;   &lt;w:LsdException Locked="false" Priority="68" SemiHidden="false"    UnhideWhenUsed="false" Name="Medium Grid 2 Accent 6"/&gt;   &lt;w:LsdException Locked="false" Priority="69" SemiHidden="false"    UnhideWhenUsed="false" Name="Medium Grid 3 Accent 6"/&gt;   &lt;w:LsdException Locked="false" Priority="70" SemiHidden="false"    UnhideWhenUsed="false" Name="Dark List Accent 6"/&gt;   &lt;w:LsdException Locked="false" Priority="71" SemiHidden="false"    UnhideWhenUsed="false" Name="Colorful Shading Accent 6"/&gt;   &lt;w:LsdException Locked="false" Priority="72" SemiHidden="false"    UnhideWhenUsed="false" Name="Colorful List Accent 6"/&gt;   &lt;w:LsdException Locked="false" Priority="73" SemiHidden="false"    UnhideWhenUsed="false" Name="Colorful Grid Accent 6"/&gt;   &lt;w:LsdException Locked="false" Priority="19" SemiHidden="false"    UnhideWhenUsed="false" QFormat="true" Name="Subtle Emphasis"/&gt;   &lt;w:LsdException Locked="false" Priority="21" SemiHidden="false"    UnhideWhenUsed="false" QFormat="true" Name="Intense Emphasis"/&gt;   &lt;w:LsdException Locked="false" Priority="31" SemiHidden="false"    UnhideWhenUsed="false" QFormat="true" Name="Subtle Reference"/&gt;   &lt;w:LsdException Locked="false" Priority="32" SemiHidden="false"    UnhideWhenUsed="false" QFormat="true" Name="Intense Reference"/&gt;   &lt;w:LsdException Locked="false" Priority="33" SemiHidden="false"    UnhideWhenUsed="false" QFormat="true" Name="Book Title"/&gt;   &lt;w:LsdException Locked="false" Priority="37" Name="Bibliography"/&gt;   &lt;w:LsdException Locked="false" Priority="39" QFormat="true" Name="TOC Heading"/&gt;  &lt;/w:LatentStyles&gt; &lt;/xml&gt;&lt;![endif]--&gt;&lt;style&gt; &lt;!--  /* Font Definitions */  @font-face 	{font-family:Wingdings; 	panose-1:5 0 0 0 0 0 0 0 0 0; 	mso-font-charset:2; 	mso-generic-font-family:auto; 	mso-font-pitch:variable; 	mso-font-signature:0 268435456 0 0 -2147483648 0;} @font-face 	{font-family:"Cambria Math"; 	panose-1:2 4 5 3 5 4 6 3 2 4; 	mso-font-charset:0; 	mso-generic-font-family:roman; 	mso-font-pitch:variable; 	mso-font-signature:-1610611985 1107304683 0 0 159 0;} @font-face 	{font-family:Cambria; 	panose-1:2 4 5 3 5 4 6 3 2 4; 	mso-font-charset:0; 	mso-generic-font-family:roman; 	mso-font-pitch:variable; 	mso-font-signature:-1610611985 1073741899 0 0 159 0;} @font-face 	{font-family:Calibri; 	panose-1:2 15 5 2 2 2 4 3 2 4; 	mso-font-charset:0; 	mso-generic-font-family:swiss; 	mso-font-pitch:variable; 	mso-font-signature:-1610611985 1073750139 0 0 159 0;}  /* Style Definitions */  p.MsoNormal, li.MsoNormal, div.MsoNormal 	{mso-style-unhide:no; 	mso-style-qformat:yes; 	mso-style-parent:""; 	margin-top:0cm; 	margin-right:0cm; 	margin-bottom:10.0pt; 	margin-left:0cm; 	line-height:115%; 	mso-pagination:widow-orphan; 	font-size:11.0pt; 	font-family:"Calibri","sans-serif"; 	mso-fareast-font-family:Calibri; 	mso-bidi-font-family:"Times New Roman";} h2 	{mso-style-noshow:yes; 	mso-style-priority:9; 	mso-style-qformat:yes; 	mso-style-link:"Heading 2 Char"; 	mso-style-next:Normal; 	margin-top:12.0pt; 	margin-right:0cm; 	margin-bottom:3.0pt; 	margin-left:0cm; 	line-height:115%; 	mso-pagination:widow-orphan; 	page-break-after:avoid; 	mso-outline-level:2; 	font-size:14.0pt; 	font-family:"Cambria","serif"; 	mso-fareast-font-family:"Times New Roman"; 	font-weight:bold; 	font-style:italic;} h3 	{mso-style-noshow:yes; 	mso-style-priority:9; 	mso-style-qformat:yes; 	mso-style-link:"Heading 3 Char"; 	mso-style-next:Normal; 	margin-top:12.0pt; 	margin-right:0cm; 	margin-bottom:3.0pt; 	margin-left:0cm; 	line-height:115%; 	mso-pagination:widow-orphan; 	page-break-after:avoid; 	mso-outline-level:3; 	font-size:13.0pt; 	font-family:"Cambria","serif"; 	mso-fareast-font-family:"Times New Roman"; 	font-weight:bold;} a:link, span.MsoHyperlink 	{mso-style-priority:99; 	color:blue; 	text-decoration:underline; 	text-underline:single;} a:visited, span.MsoHyperlinkFollowed 	{mso-style-noshow:yes; 	mso-style-priority:99; 	color:purple; 	mso-themecolor:followedhyperlink; 	text-decoration:underline; 	text-underline:single;} p 	{mso-style-priority:99; 	mso-margin-top-alt:auto; 	margin-right:0cm; 	mso-margin-bottom-alt:auto; 	margin-left:0cm; 	mso-pagination:widow-orphan; 	font-size:12.0pt; 	font-family:"Times New Roman","serif"; 	mso-fareast-font-family:"Times New Roman";} span.Heading2Char 	{mso-style-name:"Heading 2 Char"; 	mso-style-noshow:yes; 	mso-style-priority:9; 	mso-style-unhide:no; 	mso-style-locked:yes; 	mso-style-link:"Heading 2"; 	mso-ansi-font-size:14.0pt; 	mso-bidi-font-size:14.0pt; 	font-family:"Cambria","serif"; 	mso-ascii-font-family:Cambria; 	mso-fareast-font-family:"Times New Roman"; 	mso-hansi-font-family:Cambria; 	font-weight:bold; 	font-style:italic;} span.Heading3Char 	{mso-style-name:"Heading 3 Char"; 	mso-style-noshow:yes; 	mso-style-priority:9; 	mso-style-unhide:no; 	mso-style-locked:yes; 	mso-style-link:"Heading 3"; 	mso-ansi-font-size:13.0pt; 	mso-bidi-font-size:13.0pt; 	font-family:"Cambria","serif"; 	mso-ascii-font-family:Cambria; 	mso-fareast-font-family:"Times New Roman"; 	mso-hansi-font-family:Cambria; 	font-weight:bold;} span.texhtml 	{mso-style-name:texhtml; 	mso-style-unhide:no;} span.mw-headline 	{mso-style-name:mw-headline; 	mso-style-unhide:no;} span.shorttext 	{mso-style-name:short_text; 	mso-style-unhide:no;} p.listparagraph, li.listparagraph, div.listparagraph 	{mso-style-name:listparagraph; 	mso-style-unhide:no; 	mso-margin-top-alt:auto; 	margin-right:0cm; 	mso-margin-bottom-alt:auto; 	margin-left:0cm; 	mso-pagination:widow-orphan; 	font-size:12.0pt; 	font-family:"Times New Roman","serif"; 	mso-fareast-font-family:"Times New Roman";} .MsoChpDefault 	{mso-style-type:export-only; 	mso-default-props:yes; 	font-size:10.0pt; 	mso-ansi-font-size:10.0pt; 	mso-bidi-font-size:10.0pt; 	mso-ascii-font-family:Calibri; 	mso-fareast-font-family:Calibri; 	mso-hansi-font-family:Calibri;} @page Section1 	{size:595.45pt 841.7pt; 	margin:72.0pt 72.0pt 72.0pt 72.0pt; 	mso-header-margin:36.0pt; 	mso-footer-margin:36.0pt; 	mso-paper-source:0;} div.Section1 	{page:Section1;}  /* List Definitions */  @list l0 	{mso-list-id:264652503; 	mso-list-template-ids:-38119086;} @list l0:level1 	{mso-level-tab-stop:36.0pt; 	mso-level-number-position:left; 	text-indent:-18.0pt;} @list l1 	{mso-list-id:318389095; 	mso-list-template-ids:1593602552;} @list l1:level1 	{mso-level-number-format:bullet; 	mso-level-text:; 	mso-level-tab-stop:36.0pt; 	mso-level-number-position:left; 	text-indent:-18.0pt; 	mso-ansi-font-size:10.0pt; 	font-family:Symbol;} @list l2 	{mso-list-id:423458376; 	mso-list-template-ids:-816160810;} @list l2:level1 	{mso-level-number-format:bullet; 	mso-level-text:; 	mso-level-tab-stop:36.0pt; 	mso-level-number-position:left; 	text-indent:-18.0pt; 	mso-ansi-font-size:10.0pt; 	font-family:Symbol;} @list l3 	{mso-list-id:1175877264; 	mso-list-template-ids:-1794101840;} @list l3:level1 	{mso-level-number-format:bullet; 	mso-level-text:; 	mso-level-tab-stop:36.0pt; 	mso-level-number-position:left; 	text-indent:-18.0pt; 	mso-ansi-font-size:10.0pt; 	font-family:Symbol;} ol 	{margin-bottom:0cm;} ul 	{margin-bottom:0cm;} --&gt;&lt;/style&gt;&lt;p class="MsoNormal" style="margin-bottom: 0.0001pt; text-align: center; line-height: normal;" align="center"&gt;&lt;b&gt;&lt;span style="font-size: 12pt; font-family: &amp;quot;Cambria&amp;quot;,&amp;quot;serif&amp;quot;;" lang="IN"&gt;&lt;span style=""&gt;&lt;/span&gt;&lt;/span&gt;&lt;span style="font-size: 18pt; font-family: &amp;quot;Cambria&amp;quot;,&amp;quot;serif&amp;quot;;" lang="IN"&gt;&lt;o:p&gt;&lt;br /&gt;&lt;/o:p&gt;&lt;/span&gt;&lt;/b&gt;&lt;/p&gt;  &lt;p class="MsoNormal" style="margin-bottom: 0.0001pt; text-align: center; line-height: normal;" align="center"&gt;&lt;b&gt;&lt;span style="font-size: 16pt; font-family: &amp;quot;Times New Roman&amp;quot;,&amp;quot;serif&amp;quot;;"&gt;Quicksort&lt;/span&gt;&lt;/b&gt;&lt;b&gt;&lt;span style="font-size: 16pt; font-family: &amp;quot;Times New Roman&amp;quot;,&amp;quot;serif&amp;quot;;" lang="IN"&gt;&lt;o:p&gt;&lt;/o:p&gt;&lt;/span&gt;&lt;/b&gt;&lt;/p&gt;  &lt;p class="MsoNormal" style="margin-bottom: 0.0001pt; text-align: center; line-height: normal;" align="center"&gt;&lt;span style="font-size: 12pt; font-family: &amp;quot;Times New Roman&amp;quot;,&amp;quot;serif&amp;quot;;" lang="IN"&gt;&lt;o:p&gt; &lt;/o:p&gt;&lt;/span&gt;&lt;/p&gt;  &lt;p class="MsoNormal" style="margin-bottom: 0.0001pt; text-align: center; line-height: normal;" align="center"&gt;&lt;span style="font-size: 12pt; font-family: &amp;quot;Times New Roman&amp;quot;,&amp;quot;serif&amp;quot;;" lang="IN"&gt;&lt;o:p&gt; &lt;/o:p&gt;&lt;/span&gt;&lt;/p&gt;  &lt;p style="margin: 0cm 0cm 0.0001pt; text-align: justify;"&gt;&lt;span style=""&gt;Quicksort&lt;/span&gt; is a well-known &lt;a href="http://en.wikipedia.org/wiki/Sorting_algorithm" title="Sorting algorithm"&gt;&lt;span style="color: windowtext;"&gt;sorting algorithm&lt;/span&gt;&lt;/a&gt; developed by &lt;a href="http://en.wikipedia.org/wiki/C._A._R._Hoare" title="C. A. R. Hoare"&gt;&lt;span style="color: windowtext;"&gt;C. A. R. Hoare&lt;/span&gt;&lt;/a&gt; that, &lt;a href="http://en.wikipedia.org/wiki/Average_performance" title="Average performance"&gt;&lt;span style="color: windowtext;"&gt;on average&lt;/span&gt;&lt;/a&gt;, makes &lt;span class="texhtml"&gt;(&lt;i&gt;n&lt;/i&gt;log&lt;i&gt;n&lt;/i&gt;)&lt;/span&gt; (&lt;a href="http://en.wikipedia.org/wiki/Big_O_notation" title="Big O notation"&gt;&lt;span style="color: windowtext;"&gt;big O notation&lt;/span&gt;&lt;/a&gt;) comparisons to sort &lt;i&gt;n&lt;/i&gt; items. In the &lt;a href="http://en.wikipedia.org/wiki/Best,_worst_and_average_case" title="Best, worst and average case"&gt;&lt;span style="color: windowtext;"&gt;worst case&lt;/span&gt;&lt;/a&gt;, it makes &lt;span class="texhtml"&gt;(&lt;i&gt;n&lt;/i&gt;&lt;sup&gt;2&lt;/sup&gt;)&lt;/span&gt; comparisons, though if implemented correctly this behavior is rare. Typically, quicksort is significantly faster in practice than other &lt;span class="texhtml"&gt;(&lt;i&gt;n&lt;/i&gt;log&lt;i&gt;n&lt;/i&gt;)&lt;/span&gt; algorithms, because its inner loop can be efficiently implemented on most architectures, and in most real-world data, it is possible to make design choices which minimize the probability of requiring &lt;a href="http://en.wikipedia.org/wiki/Quadratic_time" title="Quadratic time"&gt;&lt;span style="color: windowtext;"&gt;quadratic time&lt;/span&gt;&lt;/a&gt;. Additionally, quicksort tends to make excellent usage of the &lt;a href="http://en.wikipedia.org/wiki/Memory_hierarchy" title="Memory hierarchy"&gt;&lt;span style="color: windowtext;"&gt;memory hierarchy&lt;/span&gt;&lt;/a&gt;, taking perfect advantage of virtual memory and available caches. Coupled with the fact that quicksort is an &lt;a href="http://en.wikipedia.org/wiki/Sorting_algorithm#Classification" title="Sorting algorithm"&gt;&lt;span style="color: windowtext;"&gt;in-place sort&lt;/span&gt;&lt;/a&gt; and uses no temporary memory, it is very well suited to modern computer architectures.&lt;span style=""&gt; &lt;/span&gt;Quicksort (also known as "partition-exchange sort") is a &lt;a href="http://en.wikipedia.org/wiki/Comparison_sort" title="Comparison sort"&gt;&lt;span style="color: windowtext;"&gt;comparison sort&lt;/span&gt;&lt;/a&gt; and, in efficient implementations, is not a &lt;a href="http://en.wikipedia.org/wiki/Sorting_algorithm#Classification" title="Sorting algorithm"&gt;&lt;span style="color: windowtext;"&gt;stable sort&lt;/span&gt;&lt;/a&gt;.&lt;span style="" lang="IN"&gt;&lt;o:p&gt;&lt;/o:p&gt;&lt;/span&gt;&lt;/p&gt;  &lt;p style="margin: 0cm 0cm 0.0001pt; text-align: justify;"&gt;&lt;span style="" lang="IN"&gt;&lt;o:p&gt; &lt;/o:p&gt;&lt;/span&gt;&lt;/p&gt;  &lt;h2 style="margin: 0cm 0cm 0.0001pt; text-align: justify; line-height: normal;"&gt;&lt;span class="mw-headline"&gt;&lt;span style="font-size: 12pt; font-family: &amp;quot;Times New Roman&amp;quot;,&amp;quot;serif&amp;quot;;"&gt;History&lt;/span&gt;&lt;/span&gt;&lt;span class="mw-headline"&gt;&lt;span style="font-size: 12pt; font-family: &amp;quot;Times New Roman&amp;quot;,&amp;quot;serif&amp;quot;;" lang="IN"&gt;&lt;o:p&gt;&lt;/o:p&gt;&lt;/span&gt;&lt;/span&gt;&lt;/h2&gt;  &lt;p class="MsoNormal" style="margin-bottom: 0.0001pt; text-align: justify; line-height: normal;"&gt;&lt;span style="font-size: 12pt; font-family: &amp;quot;Times New Roman&amp;quot;,&amp;quot;serif&amp;quot;;"&gt;The quicksort algorithm was developed in 1960 by &lt;a href="http://en.wikipedia.org/wiki/C._A._R._Hoare" title="C. A. R. Hoare"&gt;&lt;span style="color: windowtext;"&gt;C. A. R. Hoare&lt;/span&gt;&lt;/a&gt; while in the &lt;a href="http://en.wikipedia.org/wiki/Soviet_Union" title="Soviet Union"&gt;&lt;span style="color: windowtext;"&gt;Soviet Union&lt;/span&gt;&lt;/a&gt;, as a visiting student at &lt;a href="http://en.wikipedia.org/wiki/Moscow_State_University" title="Moscow State University"&gt;&lt;span style="color: windowtext;"&gt;Moscow State University&lt;/span&gt;&lt;/a&gt;. At that time, Hoare worked in a project on &lt;a href="http://en.wikipedia.org/wiki/Machine_translation" title="Machine translation"&gt;&lt;span style="color: windowtext;"&gt;machine translation&lt;/span&gt;&lt;/a&gt; for the &lt;a href="http://en.wikipedia.org/wiki/National_Physical_Laboratory,_UK" title="National Physical Laboratory, UK"&gt;&lt;span style="color: windowtext;"&gt;National Physical Laboratory&lt;/span&gt;&lt;/a&gt;. He developed the algorithm in order to sort the words to be translated, to make them more easily matched to an already-sorted Russian-to-English dictionary that was stored on magnetic tape.&lt;/span&gt;&lt;span style="font-size: 12pt; font-family: &amp;quot;Times New Roman&amp;quot;,&amp;quot;serif&amp;quot;;" lang="IN"&gt;&lt;o:p&gt;&lt;/o:p&gt;&lt;/span&gt;&lt;/p&gt;  &lt;p class="MsoNormal" style="margin-bottom: 0.0001pt; text-align: justify; line-height: normal;"&gt;&lt;span style="font-size: 12pt; font-family: &amp;quot;Times New Roman&amp;quot;,&amp;quot;serif&amp;quot;;" lang="IN"&gt;&lt;o:p&gt; &lt;/o:p&gt;&lt;/span&gt;&lt;/p&gt;  &lt;h2 style="margin: 0cm 0cm 0.0001pt; text-align: justify; line-height: normal;"&gt;&lt;span class="mw-headline"&gt;&lt;span style="font-size: 12pt; font-family: &amp;quot;Times New Roman&amp;quot;,&amp;quot;serif&amp;quot;;"&gt;Algorithm&lt;/span&gt;&lt;/span&gt;&lt;span style="font-size: 12pt; font-family: &amp;quot;Times New Roman&amp;quot;,&amp;quot;serif&amp;quot;;"&gt;&lt;o:p&gt;&lt;/o:p&gt;&lt;/span&gt;&lt;/h2&gt;  &lt;p class="MsoNormal" style="margin-bottom: 0.0001pt; text-align: justify; line-height: normal;"&gt;&lt;span style="font-size: 12pt; font-family: &amp;quot;Times New Roman&amp;quot;,&amp;quot;serif&amp;quot;;"&gt;Quicksort sorts by employing a &lt;a href="http://en.wikipedia.org/wiki/Divide_and_conquer_algorithm" title="Divide and conquer algorithm"&gt;&lt;span style="color: windowtext;"&gt;divide and conquer&lt;/span&gt;&lt;/a&gt; strategy to divide a &lt;a href="http://en.wikipedia.org/wiki/List_%28computing%29" title="List (computing)"&gt;&lt;span style="color: windowtext;"&gt;list&lt;/span&gt;&lt;/a&gt; into two sub-lists.&lt;/span&gt;&lt;span style="font-size: 12pt; font-family: &amp;quot;Times New Roman&amp;quot;,&amp;quot;serif&amp;quot;;"&gt; &lt;/span&gt;&lt;span style="font-size: 12pt; font-family: &amp;quot;Times New Roman&amp;quot;,&amp;quot;serif&amp;quot;;"&gt;Full example of quicksort on a random set of numbers. The boxed element is the pivot. It is always chosen as the last element of the partition.&lt;o:p&gt;&lt;/o:p&gt;&lt;/span&gt;&lt;/p&gt;  &lt;p class="MsoNormal" style="margin-bottom: 0.0001pt; text-align: justify; line-height: normal;"&gt;&lt;span style="font-size: 12pt; font-family: &amp;quot;Times New Roman&amp;quot;,&amp;quot;serif&amp;quot;;"&gt;The steps are:&lt;o:p&gt;&lt;/o:p&gt;&lt;/span&gt;&lt;/p&gt;  &lt;ol style="margin-top: 0cm;" start="1" type="1"&gt;&lt;li class="MsoNormal" style="margin-bottom: 0.0001pt; text-align: justify; line-height: normal;"&gt;&lt;span style="font-size: 12pt; font-family: &amp;quot;Times New Roman&amp;quot;,&amp;quot;serif&amp;quot;;"&gt;Pick an element, called a &lt;a href="http://en.wikipedia.org/wiki/Pivot_element" title="Pivot element"&gt;&lt;i&gt;&lt;span style="color: windowtext;"&gt;pivot&lt;/span&gt;&lt;/i&gt;&lt;/a&gt;, from the list.&lt;o:p&gt;&lt;/o:p&gt;&lt;/span&gt;&lt;/li&gt;&lt;li class="MsoNormal" style="margin-bottom: 0.0001pt; text-align: justify; line-height: normal;"&gt;&lt;span style="font-size: 12pt; font-family: &amp;quot;Times New Roman&amp;quot;,&amp;quot;serif&amp;quot;;"&gt;Reorder the list so that all elements with values less      than the pivot come before the pivot, while all elements with values      greater than the pivot come after it (equal values can go either way).      After this partitioning, the pivot is in its final position. This is      called the &lt;span style=""&gt;partition&lt;/span&gt;      operation.&lt;o:p&gt;&lt;/o:p&gt;&lt;/span&gt;&lt;/li&gt;&lt;li class="MsoNormal" style="margin-bottom: 0.0001pt; text-align: justify; line-height: normal;"&gt;&lt;span style="font-size: 12pt; font-family: &amp;quot;Times New Roman&amp;quot;,&amp;quot;serif&amp;quot;;"&gt;&lt;a href="http://en.wikipedia.org/wiki/Recursion_%28computer_science%29" title="Recursion (computer science)"&gt;&lt;span style="color: windowtext;"&gt;Recursively&lt;/span&gt;&lt;/a&gt;      sort the sub-list of lesser elements and the sub-list of greater elements.&lt;o:p&gt;&lt;/o:p&gt;&lt;/span&gt;&lt;/li&gt;&lt;/ol&gt;  &lt;p style="margin: 0cm 0cm 0.0001pt; text-align: justify;"&gt;The &lt;a href="http://en.wikipedia.org/wiki/Base_case#Recursive_programming" title="Base case"&gt;&lt;span style="color: windowtext;"&gt;base case&lt;/span&gt;&lt;/a&gt; of the recursion are lists of size zero or one, which are always sorted.&lt;span style=""&gt; &lt;/span&gt;The correctness of the partition algorithm is based on the following two arguments:&lt;/p&gt;  &lt;ul style="margin-top: 0cm;" type="disc"&gt;&lt;li class="MsoNormal" style="margin-bottom: 0.0001pt; text-align: justify; line-height: normal;"&gt;&lt;span style="font-size: 12pt; font-family: &amp;quot;Times New Roman&amp;quot;,&amp;quot;serif&amp;quot;;"&gt;At each iteration, all the elements processed so far      are in the desired position: before the pivot if less than or equal to the      pivot's value, after the pivot otherwise (loop invariant).&lt;o:p&gt;&lt;/o:p&gt;&lt;/span&gt;&lt;/li&gt;&lt;li class="MsoNormal" style="margin-bottom: 0.0001pt; text-align: justify; line-height: normal;"&gt;&lt;span style="font-size: 12pt; font-family: &amp;quot;Times New Roman&amp;quot;,&amp;quot;serif&amp;quot;;"&gt;Each iteration leaves one fewer element to be processed      (loop variant).&lt;o:p&gt;&lt;/o:p&gt;&lt;/span&gt;&lt;/li&gt;&lt;/ul&gt;  &lt;p class="MsoNormal" style="margin-bottom: 0.0001pt; text-align: justify; line-height: normal;"&gt;&lt;span style="font-size: 12pt; font-family: &amp;quot;Times New Roman&amp;quot;,&amp;quot;serif&amp;quot;;"&gt;The correctness of the overall algorithm follows from inductive reasoning: for zero or one element, the algorithm leaves the data unchanged; for a larger data set it produces the concatenation of two parts, elements less than or equal to the pivot and elements greater than it, themselves sorted by the recursive hypothesis.&lt;/span&gt;&lt;span style="font-size: 12pt; font-family: &amp;quot;Times New Roman&amp;quot;,&amp;quot;serif&amp;quot;;" lang="IN"&gt;&lt;o:p&gt;&lt;/o:p&gt;&lt;/span&gt;&lt;/p&gt;  &lt;h3 style="margin: 0cm 0cm 0.0001pt; text-align: justify; line-height: normal;"&gt;&lt;span class="mw-headline"&gt;&lt;i style=""&gt;&lt;span style="font-size: 12pt; font-family: &amp;quot;Times New Roman&amp;quot;,&amp;quot;serif&amp;quot;;"&gt;Parallelizations&lt;/span&gt;&lt;/i&gt;&lt;/span&gt;&lt;i style=""&gt;&lt;span style="font-size: 12pt; font-family: &amp;quot;Times New Roman&amp;quot;,&amp;quot;serif&amp;quot;;"&gt;&lt;o:p&gt;&lt;/o:p&gt;&lt;/span&gt;&lt;/i&gt;&lt;/h3&gt;  &lt;p style="margin: 0cm 0cm 0.0001pt; text-align: justify;"&gt;Like &lt;a href="http://en.wikipedia.org/wiki/Merge_sort" title="Merge sort"&gt;&lt;span style="color: windowtext;"&gt;merge sort&lt;/span&gt;&lt;/a&gt;, quicksort can also be easily &lt;a href="http://en.wikipedia.org/wiki/Parallel_algorithm" title="Parallel algorithm"&gt;&lt;span style="color: windowtext;"&gt;parallelized&lt;/span&gt;&lt;/a&gt; due to its divide-and-conquer nature. Individual in-place partition operations are difficult to parallelize, but once divided, different sections of the list can be sorted in parallel. If we have &lt;span class="texhtml"&gt;&lt;i&gt;p&lt;/i&gt;&lt;/span&gt; processors, we can divide a list of &lt;span class="texhtml"&gt;&lt;i&gt;n&lt;/i&gt;&lt;/span&gt; elements into &lt;span class="texhtml"&gt;&lt;i&gt;p&lt;/i&gt;&lt;/span&gt; sublists in &lt;span class="texhtml"&gt;(&lt;i&gt;n&lt;/i&gt;)&lt;/span&gt; average time, then sort each. Ignoring the &lt;span class="texhtml"&gt;(&lt;i&gt;n&lt;/i&gt;)&lt;/span&gt; preprocessing, this is &lt;a href="http://en.wikipedia.org/wiki/Linear_speedup" title="Linear speedup"&gt;&lt;span style="color: windowtext;"&gt;linear speedup&lt;/span&gt;&lt;/a&gt;. Given &lt;span class="texhtml"&gt;&lt;i&gt;n&lt;/i&gt;&lt;/span&gt; processors, only &lt;span class="texhtml"&gt;(&lt;i&gt;n&lt;/i&gt;)&lt;/span&gt; time is required overall.&lt;/p&gt;  &lt;p style="margin: 0cm 0cm 0.0001pt; text-align: justify;"&gt;One advantage of parallel quicksort over other parallel sort algorithms is that no synchronization is required. A new thread is started as soon as a sublist is available for it to work on and it does not communicate with other threads. When all threads complete, the sort is done.&lt;span style=""&gt; &lt;/span&gt;Other more sophisticated parallel sorting algorithms can achieve even better time bounds.&lt;sup&gt;&lt;span style=""&gt; &lt;/span&gt;&lt;/sup&gt;For example, in 1991 David Powers described a parallelized quicksort that can operate in &lt;span class="texhtml"&gt;&lt;i&gt;O&lt;/i&gt;(log&lt;i&gt;n&lt;/i&gt;)&lt;/span&gt; time given enough processors by performing partitioning implicitly&lt;span style="" lang="IN"&gt;.&lt;o:p&gt;&lt;/o:p&gt;&lt;/span&gt;&lt;/p&gt;  &lt;p style="margin: 0cm 0cm 0.0001pt; text-align: justify;"&gt;&lt;span style="" lang="IN"&gt;&lt;o:p&gt; &lt;/o:p&gt;&lt;/span&gt;&lt;/p&gt;  &lt;h2 style="margin: 0cm 0cm 0.0001pt; text-align: justify; line-height: normal;"&gt;&lt;span class="mw-headline"&gt;&lt;span style="font-size: 12pt; font-family: &amp;quot;Times New Roman&amp;quot;,&amp;quot;serif&amp;quot;;"&gt;Formal analysis&lt;/span&gt;&lt;/span&gt;&lt;span style="font-size: 12pt; font-family: &amp;quot;Times New Roman&amp;quot;,&amp;quot;serif&amp;quot;;"&gt;&lt;o:p&gt;&lt;/o:p&gt;&lt;/span&gt;&lt;/h2&gt;  &lt;p style="margin: 0cm 0cm 0.0001pt; text-align: justify;"&gt;From the initial description it's not obvious that quicksort takes &lt;span class="texhtml"&gt;(&lt;i&gt;n&lt;/i&gt;log&lt;i&gt;n&lt;/i&gt;)&lt;/span&gt; time on average. It's not hard to see that the partition operation, which simply loops over the elements of the array once, uses &lt;span class="texhtml"&gt;(&lt;i&gt;n&lt;/i&gt;)&lt;/span&gt; time. In versions that perform concatenation, this operation is also &lt;span class="texhtml"&gt;(&lt;i&gt;n&lt;/i&gt;)&lt;/span&gt;.&lt;span style=""&gt; &lt;/span&gt;In the best case, each time we perform a partition we divide the list into two nearly equal pieces. This means each recursive call processes a list of half the size. Consequently, we can make only &lt;span class="texhtml"&gt;log&lt;i&gt;n&lt;/i&gt;&lt;/span&gt; nested calls before we reach a list of size 1. This means that the depth of the &lt;a href="http://en.wikipedia.org/wiki/Call_stack" title="Call stack"&gt;&lt;span style="color: windowtext;"&gt;call tree&lt;/span&gt;&lt;/a&gt; is &lt;span class="texhtml"&gt;(log&lt;i&gt;n&lt;/i&gt;)&lt;/span&gt;. But no two calls at the same level of the call tree process the same part of the original list; thus, each level of calls needs only &lt;span class="texhtml"&gt;(&lt;i&gt;n&lt;/i&gt;)&lt;/span&gt; time all together (each call has some constant overhead, but since there are only &lt;span class="texhtml"&gt;(&lt;i&gt;n&lt;/i&gt;)&lt;/span&gt; calls at each level, this is subsumed in the &lt;span class="texhtml"&gt;(&lt;i&gt;n&lt;/i&gt;)&lt;/span&gt; factor). The result is that the algorithm uses only &lt;span class="texhtml"&gt;(&lt;i&gt;n&lt;/i&gt;log&lt;i&gt;n&lt;/i&gt;)&lt;/span&gt; time.&lt;span style=""&gt; &lt;/span&gt;An alternate approach is to set up a &lt;a href="http://en.wikipedia.org/wiki/Recurrence_relation" title="Recurrence relation"&gt;&lt;span style="color: windowtext;"&gt;recurrence relation&lt;/span&gt;&lt;/a&gt; for the &lt;span class="texhtml"&gt;&lt;i&gt;T&lt;/i&gt;(&lt;i&gt;n&lt;/i&gt;)&lt;/span&gt; factor, the time needed to sort a list of size &lt;span class="texhtml"&gt;&lt;i&gt;n&lt;/i&gt;&lt;/span&gt;. Because a single quicksort call involves &lt;span class="texhtml"&gt;(&lt;i&gt;n&lt;/i&gt;)&lt;/span&gt; factor work plus two recursive calls on lists of size &lt;span class="texhtml"&gt;&lt;i&gt;n&lt;/i&gt; / 2&lt;/span&gt; in the best case&lt;span style="" lang="IN"&gt;. &lt;/span&gt;The &lt;a href="http://en.wikipedia.org/wiki/Master_theorem" title="Master theorem"&gt;&lt;span style="color: windowtext;"&gt;master theorem&lt;/span&gt;&lt;/a&gt; tells us that &lt;span class="texhtml"&gt;&lt;i&gt;T&lt;/i&gt;(&lt;i&gt;n&lt;/i&gt;) = (&lt;i&gt;n&lt;/i&gt;log&lt;i&gt;n&lt;/i&gt;)&lt;/span&gt;.&lt;span style=""&gt; &lt;/span&gt;In fact, it's not necessary to divide the list this precisely; even if each pivot splits the elements with 99% on one side and 1% on the other (or any other fixed fraction), the call depth is still limited to &lt;span class="texhtml"&gt;100&lt;i&gt;logn&lt;/i&gt;&lt;/span&gt;, so the total running time is still &lt;span class="texhtml"&gt;(&lt;i&gt;n&lt;/i&gt;log&lt;i&gt;n&lt;/i&gt;)&lt;/span&gt;.&lt;span style=""&gt; &lt;/span&gt;In the worst case, however, the two sublists have size 1 and &lt;span class="texhtml"&gt;&lt;i&gt;n&lt;/i&gt; − 1&lt;/span&gt; (for example, if the array consists of the same element by value), and the call tree becomes a linear chain of &lt;span class="texhtml"&gt;&lt;i&gt;n&lt;/i&gt;&lt;/span&gt; nested calls. This is the same relation as for &lt;a href="http://en.wikipedia.org/wiki/Insertion_sort" title="Insertion sort"&gt;&lt;span style="color: windowtext;"&gt;insertion sort&lt;/span&gt;&lt;/a&gt; and &lt;a href="http://en.wikipedia.org/wiki/Selection_sort" title="Selection sort"&gt;&lt;span style="color: windowtext;"&gt;selection sort&lt;/span&gt;&lt;/a&gt;, and it solves to &lt;span class="texhtml"&gt;&lt;i&gt;T&lt;/i&gt;(&lt;i&gt;n&lt;/i&gt;) = (&lt;i&gt;n&lt;/i&gt;&lt;sup&gt;2&lt;/sup&gt;)&lt;/span&gt;. Given knowledge of which comparisons are performed by the sort, there are adaptive algorithms that are effective at generating worst-case input for quicksort on-the-fly, regardless of the pivot selection strategy&lt;span style="" lang="IN"&gt;.&lt;o:p&gt;&lt;/o:p&gt;&lt;/span&gt;&lt;/p&gt;  &lt;p style="margin: 0cm 0cm 0.0001pt; text-align: justify;"&gt;&lt;span style="" lang="IN"&gt;&lt;o:p&gt; &lt;/o:p&gt;&lt;/span&gt;&lt;/p&gt;  &lt;h3 style="margin: 0cm 0cm 0.0001pt; text-align: justify; line-height: normal;"&gt;&lt;span class="mw-headline"&gt;&lt;i style=""&gt;&lt;span style="font-size: 12pt; font-family: &amp;quot;Times New Roman&amp;quot;,&amp;quot;serif&amp;quot;;"&gt;Randomized quicksort expected complexity&lt;/span&gt;&lt;/i&gt;&lt;/span&gt;&lt;i style=""&gt;&lt;span style="font-size: 12pt; font-family: &amp;quot;Times New Roman&amp;quot;,&amp;quot;serif&amp;quot;;"&gt;&lt;o:p&gt;&lt;/o:p&gt;&lt;/span&gt;&lt;/i&gt;&lt;/h3&gt;  &lt;p style="margin: 0cm 0cm 0.0001pt; text-align: justify;"&gt;Randomized quicksort has the desirable property that, for any input, it requires only &lt;span class="texhtml"&gt;(&lt;i&gt;n&lt;/i&gt;log&lt;i&gt;n&lt;/i&gt;)&lt;/span&gt; &lt;a href="http://en.wikipedia.org/wiki/Expected_value" title="Expected value"&gt;&lt;span style="color: windowtext;"&gt;expected&lt;/span&gt;&lt;/a&gt; time (averaged over all choices of pivots). But what makes random pivots a good choice?&lt;/p&gt;  &lt;p style="margin: 0cm 0cm 0.0001pt; text-align: justify;"&gt;Suppose we sort the list and then divide it into four parts. The two parts in the middle will contain the best pivots; each of them is larger than at least 25% of the elements and smaller than at least 25% of the elements. If we could consistently choose an element from these two middle parts, we would only have to split the list at most &lt;span class="texhtml"&gt;2log&lt;sub&gt;2&lt;/sub&gt;&lt;i&gt;n&lt;/i&gt;&lt;/span&gt; times before reaching lists of size 1, yielding an &lt;span class="texhtml"&gt;(&lt;i&gt;n&lt;/i&gt;log&lt;i&gt;n&lt;/i&gt;)&lt;/span&gt; algorithm.&lt;span style=""&gt; &lt;/span&gt;A random choice will only choose from these middle parts half the time. However, this is good enough. Imagine that you are flipping a coin over and over until you get &lt;span class="texhtml"&gt;&lt;i&gt;k&lt;/i&gt;&lt;/span&gt; heads. Although this could take a long time, on average only &lt;span class="texhtml"&gt;2&lt;i&gt;k&lt;/i&gt;&lt;/span&gt; flips are required, and the chance that you won't get &lt;span class="texhtml"&gt;&lt;i&gt;k&lt;/i&gt;&lt;/span&gt; heads after &lt;span class="texhtml"&gt;100&lt;i&gt;k&lt;/i&gt;&lt;/span&gt; flips is highly improbable. By the same argument, quicksort's recursion will terminate on average at a call depth of only &lt;span class="texhtml"&gt;2(2log&lt;sub&gt;2&lt;/sub&gt;&lt;i&gt;n&lt;/i&gt;)&lt;/span&gt;. But if its average call depth is &lt;span class="texhtml"&gt;(log&lt;i&gt;n&lt;/i&gt;)&lt;/span&gt;, and each level of the call tree processes at most &lt;span class="texhtml"&gt;&lt;i&gt;n&lt;/i&gt;&lt;/span&gt; elements, the total amount of work done on average is the product, &lt;span class="texhtml"&gt;(&lt;i&gt;n&lt;/i&gt;log&lt;i&gt;n&lt;/i&gt;)&lt;/span&gt;. Note that the algorithm does not have to verify that the pivot is in the middle half - if we hit it any constant fraction of the times, that is enough for the desired complexity.&lt;span style=""&gt; &lt;/span&gt;The outline of a formal proof of the &lt;span class="texhtml"&gt;&lt;i&gt;O&lt;/i&gt;(&lt;i&gt;n&lt;/i&gt;log&lt;i&gt;n&lt;/i&gt;)&lt;/span&gt; expected time complexity follows. Assume that there are no duplicates as duplicates could be handled with linear time pre- and post-processing, or considered cases easier than the analyzed. Choosing a pivot, uniformly at random from &lt;span class="texhtml"&gt;0&lt;/span&gt; to &lt;span class="texhtml"&gt;&lt;i&gt;n&lt;/i&gt; − 1&lt;/span&gt;, is then equivalent to choosing the size of one particular partition, uniformly at random from &lt;span class="texhtml"&gt;0&lt;/span&gt; to &lt;span class="texhtml"&gt;&lt;i&gt;n&lt;/i&gt; − 1&lt;/span&gt;. With this observation, the continuation of the proof is analogous to the one given in the &lt;a href="http://en.wikipedia.org/wiki/Quicksort#Average_complexity"&gt;&lt;span style="color: windowtext;"&gt;average complexity section&lt;/span&gt;&lt;/a&gt;.&lt;span style="" lang="IN"&gt;&lt;o:p&gt;&lt;/o:p&gt;&lt;/span&gt;&lt;/p&gt;  &lt;p style="margin: 0cm 0cm 0.0001pt; text-align: justify;"&gt;&lt;span style="" lang="IN"&gt;&lt;o:p&gt; &lt;/o:p&gt;&lt;/span&gt;&lt;/p&gt;  &lt;h3 style="margin: 0cm 0cm 0.0001pt; text-align: justify; line-height: normal;"&gt;&lt;span class="mw-headline"&gt;&lt;i style=""&gt;&lt;span style="font-size: 12pt; font-family: &amp;quot;Times New Roman&amp;quot;,&amp;quot;serif&amp;quot;;"&gt;Average complexity&lt;/span&gt;&lt;/i&gt;&lt;/span&gt;&lt;i style=""&gt;&lt;span style="font-size: 12pt; font-family: &amp;quot;Times New Roman&amp;quot;,&amp;quot;serif&amp;quot;;"&gt;&lt;o:p&gt;&lt;/o:p&gt;&lt;/span&gt;&lt;/i&gt;&lt;/h3&gt;  &lt;p style="margin: 0cm 0cm 0.0001pt; text-align: justify;"&gt;Even if pivots aren't chosen randomly, quicksort still requires only &lt;span class="texhtml"&gt;(&lt;i&gt;n&lt;/i&gt;log&lt;i&gt;n&lt;/i&gt;)&lt;/span&gt; time over all possible permutations of its input. Because this average is simply the sum of the times over all permutations of the input divided by &lt;span class="texhtml"&gt;&lt;i&gt;n&lt;/i&gt;&lt;/span&gt; factorial, it's equivalent to choosing a random permutation of the input. When we do this, the pivot choices are essentially random, leading to an algorithm with the same running time as randomized quicksort.&lt;span style="" lang="IN"&gt;&lt;o:p&gt;&lt;/o:p&gt;&lt;/span&gt;&lt;/p&gt;  &lt;p style="margin: 0cm 0cm 0.0001pt; text-align: justify;"&gt;&lt;span style="" lang="IN"&gt;&lt;o:p&gt; &lt;/o:p&gt;&lt;/span&gt;&lt;/p&gt;  &lt;h3 style="margin: 0cm 0cm 0.0001pt; text-align: justify; line-height: normal;"&gt;&lt;span class="mw-headline"&gt;&lt;i style=""&gt;&lt;span style="font-size: 12pt; font-family: &amp;quot;Times New Roman&amp;quot;,&amp;quot;serif&amp;quot;;"&gt;Space complexity&lt;/span&gt;&lt;/i&gt;&lt;/span&gt;&lt;i style=""&gt;&lt;span style="font-size: 12pt; font-family: &amp;quot;Times New Roman&amp;quot;,&amp;quot;serif&amp;quot;;"&gt;&lt;o:p&gt;&lt;/o:p&gt;&lt;/span&gt;&lt;/i&gt;&lt;/h3&gt;  &lt;p style="margin: 0cm 0cm 0.0001pt; text-align: justify;"&gt;The space used by quicksort depends on the version used.&lt;/p&gt;  &lt;p style="margin: 0cm 0cm 0.0001pt; text-align: justify;"&gt;Quicksort has a space complexity of &lt;span class="texhtml"&gt;(log&lt;i&gt;n&lt;/i&gt;)&lt;/span&gt;, even in the worst case, when it is carefully implemented such that&lt;/p&gt;  &lt;ul style="margin-top: 0cm;" type="disc"&gt;&lt;li class="MsoNormal" style="margin-bottom: 0.0001pt; text-align: justify; line-height: normal;"&gt;&lt;span style="font-size: 12pt; font-family: &amp;quot;Times New Roman&amp;quot;,&amp;quot;serif&amp;quot;;"&gt;in-place      partitioning is used. This requires &lt;span class="texhtml"&gt;(1)&lt;/span&gt;.&lt;o:p&gt;&lt;/o:p&gt;&lt;/span&gt;&lt;/li&gt;&lt;li class="MsoNormal" style="margin-bottom: 0.0001pt; text-align: justify; line-height: normal;"&gt;&lt;span style="font-size: 12pt; font-family: &amp;quot;Times New Roman&amp;quot;,&amp;quot;serif&amp;quot;;"&gt;After      partitioning, the partition with the fewest elements is (recursively)      sorted first, requiring at most &lt;span class="texhtml"&gt;(log&lt;i&gt;n&lt;/i&gt;)&lt;/span&gt;      space. Then the other partition is sorted using &lt;a href="http://en.wikipedia.org/wiki/Tail_recursion" title="Tail recursion"&gt;&lt;span style="color: windowtext;"&gt;tail recursion&lt;/span&gt;&lt;/a&gt; or iteration. (This      idea is commonly attributed to R.Sedgewick &lt;/span&gt;&lt;span style="font-size: 12pt; font-family: &amp;quot;Times New Roman&amp;quot;,&amp;quot;serif&amp;quot;;" lang="IN"&gt;. &lt;/span&gt;&lt;span style="font-size: 12pt; font-family: &amp;quot;Times New Roman&amp;quot;,&amp;quot;serif&amp;quot;;"&gt;&lt;o:p&gt;&lt;/o:p&gt;&lt;/span&gt;&lt;/li&gt;&lt;/ul&gt;  &lt;p class="MsoNormal" style="margin-bottom: 0.0001pt; text-align: justify; line-height: normal;"&gt;&lt;span style="font-size: 12pt; font-family: &amp;quot;Times New Roman&amp;quot;,&amp;quot;serif&amp;quot;;"&gt;The version of quicksort with in-place partitioning uses only constant additional space before making any recursive call. However, if it has made &lt;span class="texhtml"&gt;(log&lt;i&gt;n&lt;/i&gt;)&lt;/span&gt; nested recursive calls, it needs to store a constant amount of information from each of them. Since the best case makes at most &lt;span class="texhtml"&gt;(log&lt;i&gt;n&lt;/i&gt;)&lt;/span&gt; nested recursive calls, it uses &lt;span class="texhtml"&gt;(log&lt;i&gt;n&lt;/i&gt;)&lt;/span&gt; space. The worst case makes &lt;span class="texhtml"&gt;(&lt;i&gt;n&lt;/i&gt;)&lt;/span&gt; nested recursive calls, and so needs &lt;span class="texhtml"&gt;(&lt;i&gt;n&lt;/i&gt;)&lt;/span&gt; space; Sedgewick's improved version using tail recursion requires &lt;span class="texhtml"&gt;(log&lt;i&gt;n&lt;/i&gt;)&lt;/span&gt; space in the worst case.&lt;/span&gt;&lt;span style="font-size: 12pt; font-family: &amp;quot;Times New Roman&amp;quot;,&amp;quot;serif&amp;quot;;"&gt; &lt;/span&gt;&lt;span style="font-size: 12pt; font-family: &amp;quot;Times New Roman&amp;quot;,&amp;quot;serif&amp;quot;;"&gt;We are eliding a small detail here, however. If we consider sorting arbitrarily large lists, we have to keep in mind that our variables like &lt;i&gt;left&lt;/i&gt; and &lt;i&gt;right&lt;/i&gt; can no longer be considered to occupy constant space; it takes &lt;span class="texhtml"&gt;(log&lt;i&gt;n&lt;/i&gt;)&lt;/span&gt; bits to index into a list of &lt;span class="texhtml"&gt;&lt;i&gt;n&lt;/i&gt;&lt;/span&gt; items. Because we have variables like this in every stack frame, in reality quicksort requires &lt;span class="texhtml"&gt;((log&lt;i&gt;n&lt;/i&gt;)&lt;sup&gt;2&lt;/sup&gt;)&lt;/span&gt; bits of space in the best and average case and &lt;span class="texhtml"&gt;(&lt;i&gt;n&lt;/i&gt;log&lt;i&gt;n&lt;/i&gt;)&lt;/span&gt; space in the worst case. This isn't too terrible, though, since if the list contains mostly distinct elements, the list itself will also occupy &lt;span class="texhtml"&gt;(&lt;i&gt;n&lt;/i&gt;log&lt;i&gt;n&lt;/i&gt;)&lt;/span&gt; bits of space.&lt;/span&gt;&lt;span style="font-size: 12pt; font-family: &amp;quot;Times New Roman&amp;quot;,&amp;quot;serif&amp;quot;;" lang="IN"&gt;&lt;o:p&gt;&lt;/o:p&gt;&lt;/span&gt;&lt;/p&gt;  &lt;p class="MsoNormal" style="margin-bottom: 0.0001pt; text-align: justify; line-height: normal;"&gt;&lt;span style="font-size: 12pt; font-family: &amp;quot;Times New Roman&amp;quot;,&amp;quot;serif&amp;quot;;" lang="IN"&gt;&lt;o:p&gt; &lt;/o:p&gt;&lt;/span&gt;&lt;/p&gt;  &lt;h2 style="margin: 0cm 0cm 0.0001pt; text-align: justify; line-height: normal;"&gt;&lt;span class="mw-headline"&gt;&lt;span style="font-size: 12pt; font-family: &amp;quot;Times New Roman&amp;quot;,&amp;quot;serif&amp;quot;;"&gt;Selection-based pivoting&lt;/span&gt;&lt;/span&gt;&lt;span style="font-size: 12pt; font-family: &amp;quot;Times New Roman&amp;quot;,&amp;quot;serif&amp;quot;;"&gt;&lt;o:p&gt;&lt;/o:p&gt;&lt;/span&gt;&lt;/h2&gt;  &lt;p style="margin: 0cm 0cm 0.0001pt; text-align: justify;"&gt;A &lt;a href="http://en.wikipedia.org/wiki/Selection_algorithm" title="Selection algorithm"&gt;&lt;span style="color: windowtext;"&gt;selection algorithm&lt;/span&gt;&lt;/a&gt; chooses the &lt;i&gt;k&lt;/i&gt;th smallest of a list of numbers; this is an easier problem in general than sorting. One simple but effective selection algorithm works nearly in the same manner as quicksort, except that instead of making recursive calls on both sublists, it only makes a single tail-recursive call on the sublist which contains the desired element. This small change lowers the average complexity to linear or &lt;span class="texhtml"&gt;(&lt;i&gt;n&lt;/i&gt;)&lt;/span&gt; time, and makes it an &lt;a href="http://en.wikipedia.org/wiki/In-place_algorithm" title="In-place algorithm"&gt;&lt;span style="color: windowtext;"&gt;in-place algorithm&lt;/span&gt;&lt;/a&gt;. A variation on this algorithm brings the worst-case time down to &lt;span class="texhtml"&gt;(&lt;i&gt;n&lt;/i&gt;)&lt;/span&gt; (see &lt;a href="http://en.wikipedia.org/wiki/Selection_algorithm" title="Selection algorithm"&gt;&lt;span style="color: windowtext;"&gt;selection algorithm&lt;/span&gt;&lt;/a&gt; for more information).&lt;span style=""&gt; &lt;/span&gt;Conversely, once we know a worst-case &lt;span class="texhtml"&gt;(&lt;i&gt;n&lt;/i&gt;)&lt;/span&gt; selection algorithm is available, we can use it to find the ideal pivot (the median) at every step of quicksort, producing a variant with worst-case &lt;span class="texhtml"&gt;(&lt;i&gt;n&lt;/i&gt;log&lt;i&gt;n&lt;/i&gt;)&lt;/span&gt; running time. In practical implementations, however, this variant is considerably slower on average.&lt;span style=""&gt; &lt;/span&gt;Another variant is to choose the Median of Medians as the pivot element instead of the median itself for partitioning the elements. While maintaining the asymptotically optimal run time complexity of &lt;span class="texhtml"&gt;(&lt;i&gt;n&lt;/i&gt;log&lt;i&gt;n&lt;/i&gt;)&lt;/span&gt; (by preventing worst case partitions), it is also considerably faster than the variant that chooses the median as pivot.&lt;span style="" lang="IN"&gt;&lt;o:p&gt;&lt;/o:p&gt;&lt;/span&gt;&lt;/p&gt;  &lt;p style="margin: 0cm 0cm 0.0001pt; text-align: justify;"&gt;&lt;span style="" lang="IN"&gt;&lt;o:p&gt; &lt;/o:p&gt;&lt;/span&gt;&lt;/p&gt;  &lt;h2 style="margin: 0cm 0cm 0.0001pt; text-align: justify; line-height: normal;"&gt;&lt;span class="mw-headline"&gt;&lt;span style="font-size: 12pt; font-family: &amp;quot;Times New Roman&amp;quot;,&amp;quot;serif&amp;quot;;"&gt;Variants&lt;/span&gt;&lt;/span&gt;&lt;span style="font-size: 12pt; font-family: &amp;quot;Times New Roman&amp;quot;,&amp;quot;serif&amp;quot;;"&gt;&lt;o:p&gt;&lt;/o:p&gt;&lt;/span&gt;&lt;/h2&gt;  &lt;p class="MsoNormal" style="margin-bottom: 0.0001pt; text-align: justify; line-height: normal;"&gt;&lt;span style="font-size: 12pt; font-family: &amp;quot;Times New Roman&amp;quot;,&amp;quot;serif&amp;quot;;"&gt;There are three well known variants of quicksort:&lt;o:p&gt;&lt;/o:p&gt;&lt;/span&gt;&lt;/p&gt;  &lt;ul style="margin-top: 0cm;" type="disc"&gt;&lt;li class="MsoNormal" style="margin-bottom: 0.0001pt; text-align: justify; line-height: normal;"&gt;&lt;b&gt;&lt;span style="font-size: 12pt; font-family: &amp;quot;Times New Roman&amp;quot;,&amp;quot;serif&amp;quot;;"&gt;Balanced quicksort:&lt;/span&gt;&lt;/b&gt;&lt;span style="font-size: 12pt; font-family: &amp;quot;Times New Roman&amp;quot;,&amp;quot;serif&amp;quot;;"&gt;      choose a pivot likely to represent the middle of the values to be sorted,      and then follow the regular quicksort algorithm.&lt;o:p&gt;&lt;/o:p&gt;&lt;/span&gt;&lt;/li&gt;&lt;li class="MsoNormal" style="margin-bottom: 0.0001pt; text-align: justify; line-height: normal;"&gt;&lt;b&gt;&lt;span style="font-size: 12pt; font-family: &amp;quot;Times New Roman&amp;quot;,&amp;quot;serif&amp;quot;;"&gt;External quicksort:&lt;/span&gt;&lt;/b&gt;&lt;span style="font-size: 12pt; font-family: &amp;quot;Times New Roman&amp;quot;,&amp;quot;serif&amp;quot;;"&gt;      The same as regular quicksort except the pivot is replaced by a buffer.      First, read the M/2 first and last elements into the buffer and sort them.      Read the next element from the beginning or end to balance writing. If the      next element is less than the least of the buffer, write it to available      space at the beginning. If greater than the greatest, write it to the end.      Otherwise write the greatest or least of the buffer, and put the next      element in the buffer. Keep the maximum lower and minimum upper keys      written to avoid resorting middle elements that are in order. When done,      write the buffer. Recursively sort the smaller partition, and loop to sort      the remaining partition.&lt;o:p&gt;&lt;/o:p&gt;&lt;/span&gt;&lt;/li&gt;&lt;li class="MsoNormal" style="margin-bottom: 0.0001pt; text-align: justify; line-height: normal;"&gt;&lt;b&gt;&lt;span style="font-size: 12pt; font-family: &amp;quot;Times New Roman&amp;quot;,&amp;quot;serif&amp;quot;;"&gt;Three-way radix quicksort&lt;/span&gt;&lt;/b&gt;&lt;span style="font-size: 12pt; font-family: &amp;quot;Times New Roman&amp;quot;,&amp;quot;serif&amp;quot;;"&gt; (also called &lt;b&gt;multikey quicksort&lt;/b&gt;): is a      combination of &lt;a href="http://en.wikipedia.org/wiki/Radix_sort" title="Radix sort"&gt;&lt;span style="color: windowtext;"&gt;radix sort&lt;/span&gt;&lt;/a&gt;      and quicksort. Pick an element from the array (the pivot) and consider the      first character (key) of the string (multikey). Partition the remaining      elements into three sets: those whose corresponding character is less      than, equal to, and greater than the pivot's character. Recursively sort      the "less than" and "greater than" partitions on the      same character. Recursively sort the "equal to" partition by the      next character (key).&lt;o:p&gt;&lt;/o:p&gt;&lt;/span&gt;&lt;/li&gt;&lt;/ul&gt;  &lt;p class="MsoNormal" style="margin-bottom: 0.0001pt; text-align: justify; line-height: normal;"&gt;&lt;span style="font-size: 12pt; font-family: &amp;quot;Times New Roman&amp;quot;,&amp;quot;serif&amp;quot;;" lang="IN"&gt;&lt;o:p&gt; &lt;/o:p&gt;&lt;/span&gt;&lt;/p&gt;  &lt;p class="MsoNormal" style="margin-bottom: 0.0001pt; text-align: justify; line-height: normal;"&gt;&lt;span style="font-size: 12pt; font-family: &amp;quot;Times New Roman&amp;quot;,&amp;quot;serif&amp;quot;;" lang="IN"&gt;&lt;o:p&gt; &lt;/o:p&gt;&lt;/span&gt;&lt;/p&gt;  &lt;p class="MsoNormal" style="margin-bottom: 0.0001pt; text-align: justify; line-height: normal;"&gt;&lt;span style="font-size: 12pt; font-family: &amp;quot;Times New Roman&amp;quot;,&amp;quot;serif&amp;quot;;" lang="IN"&gt;&lt;o:p&gt; &lt;/o:p&gt;&lt;/span&gt;&lt;/p&gt;  &lt;p class="MsoNormal" style="margin-bottom: 0.0001pt; text-align: justify; line-height: normal;"&gt;&lt;span style="font-size: 12pt; font-family: &amp;quot;Times New Roman&amp;quot;,&amp;quot;serif&amp;quot;;" lang="IN"&gt;&lt;o:p&gt; &lt;/o:p&gt;&lt;/span&gt;&lt;/p&gt;  &lt;p style="margin: 0cm 0cm 0.0001pt; text-align: right;" align="right"&gt;&lt;span class="shorttext"&gt;&lt;b style=""&gt;&lt;i style=""&gt;&lt;span style="" lang="IN"&gt;S&lt;/span&gt;ource&lt;/i&gt;&lt;/b&gt;&lt;/span&gt;&lt;span class="shorttext"&gt;&lt;b style=""&gt;&lt;i style=""&gt;&lt;span style="" lang="IN"&gt; : &lt;/span&gt;&lt;/i&gt;&lt;/b&gt;&lt;/span&gt;&lt;b style=""&gt;&lt;i style=""&gt;&lt;a href="http://en.wikipedia.org/wiki/Quicksort"&gt;&lt;span style="color: windowtext;"&gt;http://en.wikipedia.org/wiki/Quicksort&lt;/span&gt;&lt;/a&gt;&lt;/i&gt;&lt;/b&gt;&lt;b style=""&gt;&lt;i style=""&gt;&lt;span style="" lang="IN"&gt;&lt;o:p&gt;&lt;/o:p&gt;&lt;/span&gt;&lt;/i&gt;&lt;/b&gt;&lt;/p&gt;  &lt;p style="margin: 0cm 0cm 0.0001pt; text-align: right;" align="right"&gt;&lt;b style=""&gt;&lt;i style=""&gt;&lt;span style="" lang="IN"&gt;&lt;o:p&gt; &lt;/o:p&gt;&lt;/span&gt;&lt;/i&gt;&lt;/b&gt;&lt;/p&gt;  &lt;p style="margin: 0cm 0cm 0.0001pt; text-align: right;" align="right"&gt;&lt;b style=""&gt;&lt;i style=""&gt;&lt;span style="" lang="IN"&gt;&lt;o:p&gt; &lt;/o:p&gt;&lt;/span&gt;&lt;/i&gt;&lt;/b&gt;&lt;/p&gt;  &lt;p style="margin: 0cm 0cm 0.0001pt; text-align: justify; line-height: 150%;"&gt;&lt;span style="" lang="IN"&gt;&lt;o:p&gt; &lt;/o:p&gt;&lt;/span&gt;&lt;/p&gt;  &lt;p style="margin: 0cm 0cm 0.0001pt; text-align: justify; line-height: 150%;"&gt;&lt;span style="" lang="IN"&gt;&lt;o:p style="font-weight: bold;"&gt;&lt;/o:p&gt;&lt;span style="font-weight: bold;"&gt;Pembahasan :&lt;/span&gt;&lt;o:p&gt;&lt;/o:p&gt;&lt;/span&gt;&lt;/p&gt;  &lt;p style="margin: 0cm 0cm 0.0001pt; text-align: justify; line-height: 150%;"&gt;Quicksort &lt;span style="" lang="IN"&gt;lebih dikenal sebagai&lt;/span&gt; algoritma sorting&lt;span style="" lang="IN"&gt;. &lt;/span&gt;Quicksort disebut juga dengan partition exchange sort&lt;span style="" lang="IN"&gt;. &lt;/span&gt;Algoritma quick sort mengurutkan dengan sangat cepat&lt;span style="" lang="IN"&gt; dibandingkan dengan algoritma yang lain&lt;/span&gt; karena loop dalamnya dapat secara efisien diimplementasikan pada kebanyakan arsitektur dan disebagian besar data di dunia nyata adalah mungkin untuk membuat pilihan desain yang meminimalkan kemungkinan membutuhkan waktu kuadrat&lt;span style="" lang="IN"&gt;,&lt;/span&gt; namun algoritma ini sangat komplex dan diproses secara rekursif.&lt;span style="" lang="IN"&gt;. &lt;/span&gt;Walaupun begitu algoritma quick sort tidak selalu merupakan pilihan yang terbaik. Seperti yang telah disebutkan sebelumnya, algoritma ini dilakukan secara rekursif yang berarti jika dilakukan untuk tabel yang berukuran sangat besar, walaupun cepat, dapat menghabiskan memori yang besar pula. Selain itu, algoritma ini adalah algoritma yang terlalu komplex untuk mengurutkan tabel yang berukuran kecil (hanya puluhan elemen misalnya). Selain itu algoritma quicksort mempunyai tingkat efisiensi yang buruk ketika dioperasikan pada tabel yang hampir terurut atau pada tabel yang terurut menurun.&lt;/p&gt;  &lt;p style="margin: 0cm 0cm 0.0001pt; text-align: justify; line-height: 150%;"&gt;Quick sort merupakan divide and conquer algorithm.&lt;span style=""&gt; &lt;span lang="IN"&gt;Langkah-langkahnya adalah sebagai berikut :&lt;o:p&gt;&lt;/o:p&gt;&lt;/span&gt;&lt;/span&gt;&lt;/p&gt;  &lt;p class="listparagraph" style="margin: 0cm 0cm 0.0001pt; text-align: justify; line-height: 150%;"&gt;a.&lt;span style="font-size: 7pt; line-height: 150%;"&gt; &lt;/span&gt;&lt;span style="font-size: 7pt; line-height: 150%;"&gt;&lt;span style=""&gt; &lt;/span&gt;&lt;/span&gt;Pilih satu elemen secara acak&lt;/p&gt;  &lt;p class="listparagraph" style="margin: 0cm 0cm 0.0001pt 13.5pt; text-align: justify; text-indent: -13.5pt; line-height: 150%;"&gt;b.&lt;span style="font-size: 7pt; line-height: 150%;"&gt; &lt;/span&gt;&lt;span style="font-size: 7pt; line-height: 150%;"&gt;&lt;span style=""&gt; &lt;/span&gt;&lt;/span&gt;Pindahka&lt;span style="" lang="IN"&gt;n&lt;/span&gt; semua elemen yang lebih kecil ke sebelah elemen tersebut dan semua elemen yang lebih besar ke sebelah kanannya. Elemen yang nilainya sama bisa disimpan di salah satunya. Ini disebut operasi partisi&lt;/p&gt;  &lt;p class="listparagraph" style="margin: 0cm 0cm 0.0001pt; text-align: justify; line-height: 150%;"&gt;c.&lt;span style="font-size: 7pt; line-height: 150%;"&gt; &lt;/span&gt;&lt;span style="font-size: 7pt; line-height: 150%;" lang="IN"&gt;&lt;span style=""&gt;  &lt;/span&gt;&lt;/span&gt;Lakukan sort secara rekursif terhadap sublist sebelah kiri dan kanannya.&lt;/p&gt;  &lt;p style="margin: 0cm 0cm 0.0001pt; text-align: justify;"&gt;&lt;span style="" lang="IN"&gt;&lt;o:p&gt; &lt;/o:p&gt;&lt;/span&gt;&lt;/p&gt;  &lt;div class="blogger-post-footer"&gt;&lt;img width='1' height='1' src='https://blogger.googleusercontent.com/tracker/1300399623975330669-3933911202521692748?l=asmarnovira.blogspot.com' alt='' /&gt;&lt;/div&gt;</content><link rel='replies' type='application/atom+xml' href='http://asmarnovira.blogspot.com/feeds/3933911202521692748/comments/default' title='Poskan Komentar'/><link rel='replies' type='text/html' href='http://asmarnovira.blogspot.com/2010/06/quicksort.html#comment-form' title='0 Komentar'/><link rel='edit' type='application/atom+xml' href='http://www.blogger.com/feeds/1300399623975330669/posts/default/3933911202521692748'/><link rel='self' type='application/atom+xml' href='http://www.blogger.com/feeds/1300399623975330669/posts/default/3933911202521692748'/><link rel='alternate' type='text/html' href='http://asmarnovira.blogspot.com/2010/06/quicksort.html' title='Quicksort'/><author><name>IRA</name><uri>http://www.blogger.com/profile/04417846760028408557</uri><email>noreply@blogger.com</email><gd:image rel='http://schemas.google.com/g/2005#thumbnail' width='16' height='16' src='http://img2.blogblog.com/img/b16-rounded.gif'/></author><thr:total>0</thr:total></entry><entry><id>tag:blogger.com,1999:blog-1300399623975330669.post-7704754508411974115</id><published>2009-12-01T09:06:00.001-08:00</published><updated>2009-12-01T09:19:07.585-08:00</updated><category scheme='http://www.blogger.com/atom/ns#' term='BAHASA INGGRIS'/><title type='text'>CONTOH SURAT LAMARAN-Bahasa Inggris Standar</title><content type='html'>&lt;div align="right"&gt;Jakarta, November 17th,2009&lt;/div&gt;&lt;div align="justify"&gt;&lt;br /&gt;Attention To:&lt;/div&gt;&lt;div align="justify"&gt;HRD Manager&lt;/div&gt;&lt;div align="justify"&gt;PT. Pranata Informatindo&lt;/div&gt;&lt;div align="justify"&gt;Jl. Raya Sudirman No. 17&lt;/div&gt;&lt;div align="justify"&gt;Jakarta&lt;/div&gt;&lt;div align="justify"&gt;&lt;br /&gt;Dear Sir/Madam,&lt;/div&gt;&lt;div align="justify"&gt;&lt;br /&gt;I have read from your advertisement at Republika that your company is looking for employees to hold some position. Based on the advertisement, I am interested in applying application for Engineer position according with my background educational as Engineering Physics.&lt;/div&gt;&lt;div align="justify"&gt;&lt;br /&gt;My name is Asmarnovira, I am twenty three years old. I have graduated from Engineering Physics Department ISTN on March 2009. My specialization in Engineering Physics is Instrumentation and Control specialist. I consider myself that I have qualifications as you want. I have good motivation for progress and growing, eager to learn, and can work with a team (team work) or by myself. Beside that I posses adequate computer skill and have good command in English (oral and written).&lt;/div&gt;&lt;div align="justify"&gt;&lt;br /&gt;With my qualifications, I confident that I will be able to contribute effectively to your company. Here with I enclose my :&lt;br /&gt;1. Copy of Bachelor Degree (S-1) Certificate and Academic Transcript.&lt;/div&gt;&lt;div align="justify"&gt;2. Curriculum Vitae.&lt;/div&gt;&lt;div align="justify"&gt;3. Copy of Job Training Certificate from Unocal Indonesia Company.&lt;/div&gt;&lt;div align="justify"&gt;4. Recent photograph with size of 4×6.&lt;/div&gt;&lt;div align="justify"&gt;&lt;br /&gt;I would express my gratitude for your attention and I hope I could follow your recruitment test luckily.&lt;/div&gt;&lt;div align="justify"&gt;&lt;br /&gt;Sincerely,&lt;/div&gt;&lt;div align="justify"&gt;&lt;br /&gt;Asmarnovira&lt;/div&gt;&lt;div class="blogger-post-footer"&gt;&lt;img width='1' height='1' src='https://blogger.googleusercontent.com/tracker/1300399623975330669-7704754508411974115?l=asmarnovira.blogspot.com' alt='' /&gt;&lt;/div&gt;</content><link rel='replies' type='application/atom+xml' href='http://asmarnovira.blogspot.com/feeds/7704754508411974115/comments/default' title='Poskan Komentar'/><link rel='replies' type='text/html' href='http://asmarnovira.blogspot.com/2009/12/contoh-surat-lamaran-bahasa-inggris.html#comment-form' title='0 Komentar'/><link rel='edit' type='application/atom+xml' href='http://www.blogger.com/feeds/1300399623975330669/posts/default/7704754508411974115'/><link rel='self' type='application/atom+xml' href='http://www.blogger.com/feeds/1300399623975330669/posts/default/7704754508411974115'/><link rel='alternate' type='text/html' href='http://asmarnovira.blogspot.com/2009/12/contoh-surat-lamaran-bahasa-inggris.html' title='CONTOH SURAT LAMARAN-Bahasa Inggris Standar'/><author><name>IRA</name><uri>http://www.blogger.com/profile/04417846760028408557</uri><email>noreply@blogger.com</email><gd:image rel='http://schemas.google.com/g/2005#thumbnail' width='16' height='16' src='http://img2.blogblog.com/img/b16-rounded.gif'/></author><thr:total>0</thr:total></entry><entry><id>tag:blogger.com,1999:blog-1300399623975330669.post-1903037347281799847</id><published>2009-12-01T08:10:00.000-08:00</published><updated>2009-12-01T09:00:04.818-08:00</updated><category scheme='http://www.blogger.com/atom/ns#' term='BAHASA INGGRIS'/><title type='text'>TESIS (2)</title><content type='html'>&lt;span style="color:#000000;"&gt;&lt;strong&gt;Future Perfect Tense&lt;/strong&gt;&lt;br /&gt;&lt;/span&gt;Future Perfect digunakan untuk menunjukkan waktu selesainya sesuatu. Contoh:&lt;br /&gt;I will have finished by 4.00. (Sampai jam 4.00 saya akan menyelesaikan sebuah aktivitas tertentu).&lt;br /&gt;Bentuk:&lt;br /&gt;Future Continous dibentuk dengan will + have + past participle (verb 3). Contoh:&lt;br /&gt;-I will have arrived by 4.00.&lt;br /&gt;-They will have left by next week.&lt;br /&gt;-He will have gone to America by the end of the month.&lt;br /&gt;&lt;br /&gt;Untuk bentuk negatif tambahkan not, contoh:&lt;br /&gt;-I won’t have arrived by 4.00.&lt;br /&gt;-They won’t have left by next week.&lt;br /&gt;-He won’t have gone to America until next month.&lt;br /&gt;&lt;br /&gt;Untuk pertanyaan tukar posisi will dengan subjek, contoh:&lt;br /&gt;-Will you have arrived by 4.00?&lt;br /&gt;-Will they have left by next week?&lt;br /&gt;-Will he have gone to America by next month?&lt;br /&gt;&lt;br /&gt;Kegunaan&lt;br /&gt;Future Perfect menunjukkan waktu dimana sesuatu selesai dilakukan/terjadi. Contoh:&lt;br /&gt;Next Friday, I‘ll have worked here for 5 years. (Ketika Jumat depan tiba, maka sudah 5 tahun saya bekerja disini).&lt;br /&gt;&lt;br /&gt;Kita sering menggunakan by untuk menunjukkan waktu sebelum sesuatu diselesaikan, contoh:&lt;br /&gt;Can I borrow you book? - You can have it tomorrow, I‘ll have read it by then.&lt;br /&gt;I‘ll have left by the time you arrive.&lt;br /&gt;&lt;br /&gt;&lt;a title="Permalink for : Future Continous Tense" style="PADDING-RIGHT: 0px; PADDING-LEFT: 0px; PADDING-BOTTOM: 0px; MARGIN: 0px; FONT: 1em 'Lucida Grande', 'Lucida Sans Unicode', Verdana, sans-serif; BORDER-TOP-STYLE: none; PADDING-TOP: 0px; BORDER-RIGHT-STYLE: none; BORDER-LEFT-STYLE: none; TEXT-DECORATION: none; BORDER-BOTTOM-STYLE: none" href="http://englishonline.blogdetik.com/2009/08/29/future-continous-tense/"&gt;&lt;strong&gt;&lt;span style="color:#000000;"&gt;Future Continous Tense&lt;/span&gt;&lt;/strong&gt;&lt;/a&gt;&lt;br /&gt;Future Continuous digunakan untuk aktivitas yang terjadi dalam periode waktu mendatang. Contoh:&lt;br /&gt;- This week I’m working in Boston, but next week I’ll be working in Los Angeles.&lt;br /&gt;- Where will you be staying? I’ll be staying at the Warwick Hotel.&lt;br /&gt;Bentuk:&lt;br /&gt;Future Continous dibentuk dengan will + kata kerja “to be” + bentuk -ing. Contoh:&lt;br /&gt;-I will be arriving at 4.00.&lt;br /&gt;-They will be staying for a few days.&lt;br /&gt;-She will be going to America.&lt;br /&gt;&lt;br /&gt;Untuk bentuk negatif ditambahkan not, contoh:&lt;br /&gt;-I won’t be arriving at 4.00.&lt;br /&gt;-We won’t be staying for a few days.&lt;br /&gt;-She won’t be going to America.&lt;br /&gt;&lt;br /&gt;Untuk bentuk pertanyaan posisi will ditukar dengan posisi subjek, contoh:&lt;br /&gt;-Will you be arriving at 4.00?&lt;br /&gt;-Will they be staying for a few days?&lt;br /&gt;-Will she be going to America?&lt;br /&gt;&lt;br /&gt;Kegunaan&lt;br /&gt;Future Continious juga digunakan untuk sebuah aktivitas yang terjadi sekitar waktu tertentu. Contoh:&lt;br /&gt;-I’ll be arriving at 7.00. (Saya akan tiba sekitar pukul 7.00)&lt;br /&gt;-I’ll be seeing you at Mike’s birthday party.&lt;br /&gt;-What time will you be leaving? I’ll be leaving at 10.00. (Saya tidak mungkin berangkat tepat jam 10 tetapi proses saya berangkat terjadi sekitar pukul 10.00).&lt;br /&gt;&lt;br /&gt;Future Continous Tense terkadang digunakan untuk penawaran formal, contoh:&lt;br /&gt;“Will you be needing a cab home, sir?”&lt;br /&gt;&lt;br /&gt;Future Continous juga digunakan untuk mengecek informasi, contoh:&lt;br /&gt;Will you be having lunch with us?&lt;br /&gt;&lt;br /&gt;Bandingkan dengan bentuk Future Simple, yang kedengaran lebih seperti sebuah penawaran, contoh:&lt;br /&gt;Will you have lunch with us?&lt;br /&gt;&lt;br /&gt;Future Continuous juga digunakan untuk membuat prediksi-prediksi tentang perasaan orang, contoh:&lt;br /&gt;-You’ll be feeling hungry after a hard day’s work.&lt;br /&gt;-You’ll be needing some rest before you go.&lt;br /&gt;&lt;br /&gt;&lt;a title="Permalink for : Past Perfect Tense" style="PADDING-RIGHT: 0px; PADDING-LEFT: 0px; PADDING-BOTTOM: 0px; MARGIN: 0px; FONT: 1em 'Lucida Grande', 'Lucida Sans Unicode', Verdana, sans-serif; BORDER-TOP-STYLE: none; PADDING-TOP: 0px; BORDER-RIGHT-STYLE: none; BORDER-LEFT-STYLE: none; TEXT-DECORATION: none; BORDER-BOTTOM-STYLE: none" href="http://englishonline.blogdetik.com/2009/08/29/past-perfect-tense/"&gt;&lt;span style="color:#000000;"&gt;&lt;strong&gt;Past Perfect Tense&lt;/strong&gt;&lt;/span&gt;&lt;/a&gt;&lt;br /&gt;Past Perfect digunakan untuk menghubungkan dua waktu lampau: sebuah waktu lampau sebelumnya dengan waktu lampau setelahnya. Dalam praktiknya present perfect digunakan untuk menyatakan peristiwa-peristiwa yang terjadi sebelum waktu lampau tertentu. Contoh:&lt;br /&gt;- When I arrived, the plane had left.&lt;br /&gt;- I arrived (waktu lampau), the plane left (waktu lampau sebelumnya)&lt;br /&gt;- Before I went to Canada, I hadn’t been abroad.&lt;br /&gt;- I went to Canada (waktu lampau), and before that time I never went abroad (waktu lampau sebelumnya).&lt;br /&gt;Bentuk:&lt;br /&gt;Past perfect dibentuk dengan had dan past participle (verb 3). Contoh:&lt;br /&gt;-Had eaten&lt;br /&gt;-She had played&lt;br /&gt;-They had flown, dan seterusnya.&lt;br /&gt;&lt;br /&gt;&lt;div align="justify"&gt;Kegunaan&lt;br /&gt;Seperti disebutkan Past Perfect menghubungkan dua waktu lampau: sebuah situasi lampau dan situasi lampau lain sebelumnya. Ada beberapa kaidah yang perlu diperhatikan dan berikut beberapa contoh untuk membantu anda melihat bagaimana penggunaannya.&lt;br /&gt;-I wasn’t busy yesterday. I had already finished my work. I wasn’t busypada satu waktu di masa lampau, karena sebelumnya I had finished my work.&lt;br /&gt;-I ate a small lunch, because I’d already eaten a big breakfast. I ate lunch pada satu waktu di masa lampau, dan I ate breakfast pada waktu lampau sebelumnya.&lt;br /&gt;-When I arrived, the concert had just started. I arrived di masa lampau, dan the concert started beberapa waktu sebelumnya. &lt;/div&gt;&lt;div align="justify"&gt;&lt;br /&gt;&lt;strong&gt;Past Perfect - Present Perfect&lt;br /&gt;&lt;/strong&gt;Present Perfect menghubungkan waktu lampau dan waktu sekarang, contoh:&lt;br /&gt;I haven’t eaten today, so I want some food. &lt;/div&gt;&lt;div align="justify"&gt;&lt;br /&gt;Past Perfect menghubungkan dua waktu lampau, Contoh:&lt;br /&gt;I hadn’t eaten yesterday, so I wanted some food. &lt;/div&gt;&lt;div align="justify"&gt;&lt;br /&gt;Begitu juga:&lt;br /&gt;-We don’t need an umbrella because the rain has stopped. (Present Perfect)&lt;br /&gt;-We didn’t need an umbrella, because the rain had stopped. (Past Perfect) &lt;/div&gt;&lt;div align="justify"&gt;&lt;br /&gt;&lt;a title="Permalink for : Present perfect 1 - Bentuk dan kegunaan" style="PADDING-RIGHT: 0px; PADDING-LEFT: 0px; PADDING-BOTTOM: 0px; MARGIN: 0px; FONT: 1em 'Lucida Grande', 'Lucida Sans Unicode', Verdana, sans-serif; BORDER-TOP-STYLE: none; PADDING-TOP: 0px; BORDER-RIGHT-STYLE: none; BORDER-LEFT-STYLE: none; TEXT-DECORATION: none; BORDER-BOTTOM-STYLE: none" href="http://englishonline.blogdetik.com/2009/08/15/present-perfect-1-bentuk-dan-kegunaan/"&gt;&lt;span style="color:#000000;"&gt;&lt;strong&gt;Present perfect&lt;/strong&gt;&lt;/span&gt; &lt;/a&gt;&lt;br /&gt;Present Perfect Tense digunakan untuk menghubungkan masa lampau dengan masa sekarang. Kegunaan utamanya adalah untuk menunjukkan relevansi tindakan atau situasi masa lampau dengan kondisi sekarang. Contoh:&lt;br /&gt;John has gone home. (telah pulang ke rumah)&lt;br /&gt;John pulang ke rumah di masa lampau, tetapi yang diinginkan kalimat diatas sebenarnya adalah dimana dia berada sekarang. Kalimat ini memberikan informasi masa lampau untuk menginformasikan situasi sekarang.&lt;br /&gt;Bentuk:&lt;br /&gt;Present Perfect dibuat dengan have/has (kata kerja bantu “to have”) danpast participle (kata kerja bentuk ke-3). Contoh:&lt;br /&gt;-I have worked in London.&lt;br /&gt;-She has worked in a bank.&lt;br /&gt;Pasti participle (Verb 3) beraturan dibentuk dengan menambahkan -ed ke kata kerja, misalnya work - worked, play - played. Akan tetapi ada banyak Verb 3 tidak beraturan yang perlu anda ketahui.&lt;/div&gt;&lt;div align="justify"&gt;&lt;br /&gt;Berikut adalah bentuk-bentuk Present Perfect dengan kata kerja to work:&lt;/div&gt;&lt;div align="justify"&gt;&lt;strong&gt;&lt;em&gt;Afirmatif&lt;/em&gt;&lt;/strong&gt;&lt;/div&gt;&lt;div align="justify"&gt;Tunggal:&lt;/div&gt;&lt;div align="justify"&gt;-I have worked&lt;/div&gt;&lt;div align="justify"&gt;-You have worked&lt;/div&gt;&lt;div align="justify"&gt;-He has worked&lt;/div&gt;&lt;div align="justify"&gt;-She has worked&lt;/div&gt;&lt;div align="justify"&gt;-It has worked&lt;/div&gt;&lt;div align="justify"&gt;&lt;/div&gt;&lt;div align="justify"&gt;Jamak:&lt;/div&gt;&lt;div align="justify"&gt;-We have worked&lt;/div&gt;&lt;div align="justify"&gt;-You have worked&lt;/div&gt;&lt;div align="justify"&gt;-They have worked&lt;/div&gt;&lt;div align="justify"&gt;&lt;/div&gt;&lt;div align="justify"&gt;&lt;strong&gt;&lt;em&gt;Negatif&lt;/em&gt;&lt;/strong&gt;&lt;/div&gt;&lt;div align="justify"&gt;Tunggal:&lt;/div&gt;&lt;div align="justify"&gt;-I haven’t worked (haven’t = have not)&lt;/div&gt;&lt;div align="justify"&gt;-You haven’t worked&lt;/div&gt;&lt;div align="justify"&gt;-He hasn’t worked&lt;/div&gt;&lt;div align="justify"&gt;-She hasn’t worked&lt;/div&gt;&lt;div align="justify"&gt;-It hasn’t worked&lt;/div&gt;&lt;div align="justify"&gt;&lt;/div&gt;&lt;div align="justify"&gt;Jamak:&lt;/div&gt;&lt;div align="justify"&gt;-We haven’t worked&lt;/div&gt;&lt;div align="justify"&gt;-You haven’t worked&lt;/div&gt;&lt;div align="justify"&gt;-They haven’t worked&lt;/div&gt;&lt;div align="justify"&gt;&lt;/div&gt;&lt;div align="justify"&gt;&lt;/div&gt;&lt;div align="justify"&gt;&lt;strong&gt;&lt;em&gt;Interogatif&lt;/em&gt;&lt;/strong&gt;&lt;/div&gt;&lt;div align="justify"&gt;Tunggal:&lt;/div&gt;&lt;div align="justify"&gt;Have I worked?&lt;/div&gt;&lt;div align="justify"&gt;Have you worked?&lt;/div&gt;&lt;div align="justify"&gt;Has he worked?&lt;/div&gt;&lt;div align="justify"&gt;Has she worked?&lt;/div&gt;&lt;div align="justify"&gt;Has it worked?&lt;/div&gt;&lt;div align="justify"&gt;&lt;/div&gt;&lt;div align="justify"&gt;Jamak:&lt;/div&gt;&lt;div align="justify"&gt;Have I worked?&lt;/div&gt;&lt;div align="justify"&gt;Have you worked?&lt;/div&gt;&lt;div align="justify"&gt;Have they worked?&lt;/div&gt;&lt;div align="justify"&gt;&lt;/div&gt;&lt;div align="justify"&gt;Kegunaan&lt;br /&gt;Berikut beberapa kegunaan Present Perfect. Perlu selalu diingat bahwa untuk semua poin berikut tujuan utama yakni menghubungkan masa lampau dan masa sekarang adalah sama:&lt;br /&gt;&lt;strong&gt;A. Masa lampau yang menginformasikan masa sekarang&lt;/strong&gt;&lt;br /&gt;1. Present Perfect Tense digunakan untuk memberikan informasi masa lampau yang relevan dengan keadaan sekarang. Contoh:Have you been shopping? Yes, I went this morning.&lt;br /&gt;Pertanyaan “Have you been shopping?” menanyakan tentang fakta masa lampau - apakah You pergi belanja atau tidak. Akan tetapi, pertanyaan ini ditanyakan karena kebutuhan masa sekarang - jika You sudah belanja, pembicara tidak perlu pergi sekarang - jika You belum belanja pembicara perlu pergi sekarang. Pertanyaan ini adalah pertanyaan tentang kebutuhan masa sekarang, bukan fakta masa lampau.&lt;/div&gt;&lt;div align="justify"&gt;&lt;br /&gt;2. Present Perfect Tense digunakan untuk menghubungkan pengalaman masa lampau. Contoh:&lt;br /&gt;Have you been to Italy? No, I haven’t been there. &lt;/div&gt;&lt;div align="justify"&gt;Lagi-lagi, pertanyaan “Have you been Italy?” menanyakan tentang fakta masa lampau, tetapi masa atau kondisi lampau tidak begitu penting. Justru penanya menginginkan informasi ini untuk kebutuhan sekarang - mungkin penanya sedang membicarakan tentang perjalanan keluar negeri, atau mungkin tertarik dengan Italia. Kita tidak bisa menjelaskan hanya dari satu kalimat, tetapi yang menjadi fokus disini adalah pada kebutuhan sekarang, bukan masa lampau.&lt;/div&gt;&lt;div align="justify"&gt;&lt;br /&gt;3. Present Perfect Tense digunakan untuk pencapaian/prestasi. Contoh:James has won first prize for math.&lt;br /&gt;James memenangkan hadiah di masa lampau, tetapi yang menjadi fokus kalimat adalah prestrasinya sekarang ini.&lt;/div&gt;&lt;div align="justify"&gt;&lt;br /&gt;&lt;strong&gt;B. Masa lampau sampai masa sekarang&lt;/strong&gt;&lt;br /&gt;1. Present Perfect digunakan untuk menunjukkan perubahan dari masa lampau sampai masa sekarang. Contoh:John’s English wasn’t very good, but he’s got much better.&lt;br /&gt;Antara sebuah waktu di masa dan sekarang, Bahasa Inggris John telah mengalami peningkatan. Fokus tidak terlalu ditujukan pada seberapa buruk English John di masa lampau, tetapi justru seberapa baik English dia sekarang.&lt;/div&gt;&lt;div align="justify"&gt;&lt;br /&gt;2. Present Perfect digunakan untuk sebuah situasi atau tindakan yang bermula di masa lampau dan masih terus berlanjut sampai sekarang. Kita umum menggunakan for dan since pada situasi-situasi seperti ini. Contoh:&lt;br /&gt;John has lived in Boston for 5 years.&lt;br /&gt;John datang ke Boston 5 tahun yang lalu dan masih tinggal disana.&lt;br /&gt;He has (He’s) been a lawyer for 12 years. &lt;/div&gt;&lt;div align="justify"&gt;&lt;br /&gt;3. Present Perfect digunakan untuk tindakan yang berulang yang dimulai di masa lampau dan terus berlanjut sampai sekarang Contoh:We’ve been to England 4 times.&lt;br /&gt;Subjek (we) pada kalimat diatas pergi ke England beberapa kali di masa lampau, dan kemungkinan akan kesana lagi di masa yang akan datang.&lt;/div&gt;&lt;div align="justify"&gt;&lt;br /&gt;4. Present Perfect digunakan untuk sebuah periode waktu yang dimulai di masa lampau tetapi masih terus berlanjut sampai sekarang. Contoh:&lt;br /&gt;I’ve studied at the library every day this week.&lt;br /&gt;This week bermula di masa lampau, tetapi masih berlangsung, belum berakhir.&lt;/div&gt;&lt;div align="justify"&gt;&lt;br /&gt;&lt;strong&gt;Waktu pasti dan tak pasti&lt;/strong&gt;&lt;br /&gt;Salah satu aturan mudah tentang Present Perfect adalah tenses ini tidak bisa digunakan bersama dengan waktu pasti (definite time). Contoh:&lt;br /&gt;-I’ve been on vacation. Benar&lt;br /&gt;-I went on vacation last month. Benar&lt;br /&gt;-I’ve been on vacation last month. Tidak benar&lt;br /&gt;Kita tidak bisa menggunakan waktu pasti bersaa dengan Present Perfect. Present Perfect menggunakan informasi masa lampau untuk berfokus pada waktu sekarang, jadi menyebutkan waktu lampau juga tidak tepat.&lt;br /&gt;Sebagai aturan umum: Jika waktu pasti di masa lampau penting, gunakan Present Simple - Jika waktu pasti di masa lampau tidak penting, gunakan Present Perfect. Contoh:&lt;br /&gt;-I went to Paris last year. (Yang menjadi fokus adala masa lampau)&lt;br /&gt;-I’ve been to Paris. (Yang menjadi fokus adalah bagaimana pengalaman di Paris mempengaruhi masa sekarang)&lt;/div&gt;&lt;div align="justify"&gt;&lt;br /&gt;Present Perfect bisa digunakan bersama dengan kata keterangan waktu. Contoh:&lt;br /&gt;I haven’t had a vacation recently. &lt;/div&gt;&lt;div align="justify"&gt;&lt;br /&gt;Perlu diperhatikan bahwa Present Perfect bisa digunakan dengan periode waktu yang belum selesai. Contoh:&lt;br /&gt;I haven’t had a vacation this year. Benar (Tahun ini belum habis, jadi Present Perfect digunakan untuk waktu yang terus berlanjut dari masa lalu sampai sekarang)&lt;br /&gt;I haven’t had a vacation last year. Tidak benar &lt;/div&gt;&lt;div align="justify"&gt;&lt;br /&gt;&lt;strong&gt;Have you ever…?&lt;br /&gt;&lt;/strong&gt;Have you ever…? merupakan struktur umum yang digunakan untuk menanyakan tentang pengalaman masa lampau. Contoh:&lt;br /&gt;-Have you ever met a famous person?&lt;br /&gt;Secara kasar kalimat diatas berarti: Apakah kamu memiliki pengalaman masa lampau bertemu dengan orang terkenal / Apakah kamu bertemu dengan orang terkenal di waktu mana saja di masa lampau?&lt;br /&gt;-Have you ever flown in a plane?&lt;br /&gt;-Have you ever won a competition?&lt;br /&gt;-Haven’t you ever done this before? &lt;/div&gt;&lt;div align="justify"&gt;&lt;br /&gt;&lt;strong&gt;Ever&lt;br /&gt;&lt;/strong&gt;Ever berarti “pada waktu kapan saja”, waktu spesifik tidak diketahui atau tidak penting.&lt;br /&gt;Ever digunakan dalam pertanyaan, lihat “Have you ever…? di atas.&lt;br /&gt;Ever juga digunakan bersama nothing, nobody dan sebagainya untuk hal-hal yang belum terjadi sebelumnya Contoh:&lt;br /&gt;-Nobody has ever travelled through time.&lt;br /&gt;-That window’s been broken for months, but nothing has ever been done about it.&lt;br /&gt;Ever juga digunakan dengan “the first time” untuk pengalaman pertama. Contoh:&lt;br /&gt;-This is the first time I’ve been abroad.&lt;br /&gt;-Is this your first time on a plane?&lt;br /&gt;-This is the first time I’ve ever eaten dog soup.&lt;br /&gt;Ever bisa digunakan dalam kalimat afirmatif meskipun lebih tidak lazim dan sering dianggap kuno. Untuk informasi lebih lanjut anda bisa cek disini&lt;a style="PADDING-RIGHT: 0px; PADDING-LEFT: 0px; PADDING-BOTTOM: 0px; MARGIN: 0px; FONT: 1em 'Lucida Grande', 'Lucida Sans Unicode', Verdana, sans-serif; PADDING-TOP: 0px; BORDER-BOTTOM: rgb(153,153,204) 1px dotted; TEXT-DECORATION: none" href="http://dictionary.reference.com/search?q=ever" target="_blank"&gt;http://dictionary.reference.com/search?q=ever&lt;/a&gt;&lt;/div&gt;&lt;div align="justify"&gt;&lt;br /&gt;&lt;strong&gt;Never&lt;/strong&gt;&lt;br /&gt;Never pada dasarnya merupakan singkat dari “not ever”. Digunakan bersama Present Perfect tense, never berarti subjek belum mengalami pengalaman tertentu sebelumnya. Contoh:&lt;br /&gt;-Have you ever been abroad? No, I’ve never been abroad. (Saya belum pernah mengalami pengalaman itu sebelumnya)&lt;br /&gt;-Have you ever been on a plane before? No, I’ve never been on a plane. &lt;/div&gt;&lt;div align="justify"&gt;&lt;br /&gt;Kalimat negatif dan bertanya juga mungkin. Contoh:&lt;br /&gt;Have you never eaten this before? &lt;/div&gt;&lt;div align="justify"&gt;&lt;br /&gt;Kalimat ini menunjukkan kejutan yang You belum pernah alami sebelumnya. Contoh:&lt;br /&gt;Have you never played soccer?&lt;/div&gt;&lt;div align="justify"&gt;&lt;br /&gt;Since dan for keduanya digunakan untuk situasi-situasi dan tindakan-tindakan yang dimulai di masa lampau dan terus berlanjut sampai sekarang. Contoh:&lt;br /&gt;-I’ve been at home for 4 hours.&lt;br /&gt;-I’ve been at home since 12.00.&lt;br /&gt;&lt;strong&gt;Since&lt;br /&gt;&lt;/strong&gt;Since digunakan dengan sebuah titik waktu. Contoh:&lt;br /&gt;-I’ve lived here since March.&lt;br /&gt;-I’ve been here since 9.00 this morning.&lt;br /&gt;Since hanya digunakan dengan bentuk Perfect seperti Present Perfect, Past Perfect dan seterusnya. Since tidak bisa digunakan bersama dengan bentuk-bentuk lainnya. Contoh:&lt;br /&gt;-I’ve studied english since last year - Benar&lt;br /&gt;-I studied / I am studying / I will study English since last year - Tidak benar&lt;br /&gt;Since juga digunakan bersama dengan klausa-klausa waktu. Contoh:&lt;br /&gt;-I’ve studied English since I was at university.&lt;br /&gt;-We haven’t seen my family since we got married.&lt;br /&gt;Perhatikan bahwa klausa utama menggunakan Present Perfect, dan klausa lainnya menggunakan past simple.&lt;br /&gt;&lt;/div&gt;&lt;div align="justify"&gt;&lt;strong&gt;For&lt;br /&gt;&lt;/strong&gt;For digunakan dengan sebuah periode waktu. Contoh:&lt;br /&gt;-I’ve lived here for 9 months.&lt;br /&gt;-She’s been here for 5 hours.&lt;br /&gt;Berbeda dengan since, for bisa digunakan dengan tensis-tensis selain perfect tense. Contoh:&lt;br /&gt;-I lived here for 9 months - Periode waktu ini dimulai dan berakhir di masa lampau, sekarang telah selesai.&lt;br /&gt;-I will live here for a year - Periode waktu ini akan dimulai dan berakhir di masa mendatang, sekarang belum dilakukan.&lt;br /&gt;-I have lived here for a long tome - Periode waktu ini dimulai di masa lampau dan masih terus berlanjut sampai sekarang. Belum berakhir. &lt;/div&gt;&lt;div align="justify"&gt;&lt;br /&gt;Memilih apakah harus menggunakan Present Perfect atau Pasti Simple biasanya tergantung pada apakah digunakan waktu pasti (definite) atau waktu tidak pasti (indefinite). Jika waktu pasti lampau digunakan, kita memakai Past Simple, dan jika tidak ada waktu pasti yang diberikan kita gunakan Present Perfect.&lt;/div&gt;&lt;div align="justify"&gt;&lt;br /&gt;Peristiwa tunggal&lt;br /&gt;-I went to America in March. - Kalimat ini memiliki waktu lampau yang pasti, jadi kita gunakan Past Simple.&lt;br /&gt;-I’ve been to America. - Disini waktu tidak penting, yang penting adalah fakta bahwa subjek pergi ke Amerika di waktu lampau.&lt;br /&gt;-I read this book last week. - Pekan lalu (Last week) subjek mulai dan menyelesaikan membaca buku ini.&lt;br /&gt;-I’ve read this book. - Disini waktu juga tidak penting, yang penting adalah fakta bahwa subjek sebelumnya telah membaca buku tersebut. &lt;/div&gt;&lt;div align="justify"&gt;&lt;br /&gt;Akan tetapi, Present Perfect bisa digunakan dengan periode waktu yang belum berakhir. Contoh:&lt;br /&gt;-I’ve been to the doctor today. - Today (hari ini) belum berakhir, jadi kalimat ini benar.&lt;br /&gt;-I went to the doctor today. - Ini juga benar, sebuah pernyataan tentang tindakan di masa lampau.&lt;br /&gt;-I’ve been to the doctor yesterday. - Ini tidak benar, yesterday (kemarin) merupakan periode yang telah berakhir yang tidak berlanjut sampai sekarang jadi kita tidak menggunakan Present Perfect pada kalimat ini. &lt;/div&gt;&lt;div align="justify"&gt;&lt;br /&gt;Banyak peristiwa&lt;br /&gt;Past Simple dan Present Perfect bisa sama-sama digunakan untuk peristiwa yang banyak. Contoh:&lt;br /&gt;-I went to America three times last year. - Dalam kalimat ini waktu dianggap penting.&lt;br /&gt;-I’ve been to America three times. - Disini waktu tidak penting, yang ditekankan adalah fakta bahwa subjek sudah pernah ke Amerika. &lt;/div&gt;&lt;div align="justify"&gt;&lt;br /&gt;Seperti di atas kita juga bisa menggunakan present perfect untuk banyak peristiwa apabila waktunya belum berakhir. Contoh:&lt;br /&gt;-I’ve been to America three times this year. - This year (tahun ini) belum berakhir, jadi kalimat ini benar.&lt;br /&gt;-I’ve been to America three times last year. - Tidak benar, last year (tahun lalu) merupakan periode yang telah berakhir, jadi kita tidak bisa menggunakan Present Perfect. &lt;/div&gt;&lt;div class="blogger-post-footer"&gt;&lt;img width='1' height='1' src='https://blogger.googleusercontent.com/tracker/1300399623975330669-1903037347281799847?l=asmarnovira.blogspot.com' alt='' /&gt;&lt;/div&gt;</content><link rel='replies' type='application/atom+xml' href='http://asmarnovira.blogspot.com/feeds/1903037347281799847/comments/default' title='Poskan Komentar'/><link rel='replies' type='text/html' href='http://asmarnovira.blogspot.com/2009/12/tesis-2.html#comment-form' title='0 Komentar'/><link rel='edit' type='application/atom+xml' href='http://www.blogger.com/feeds/1300399623975330669/posts/default/1903037347281799847'/><link rel='self' type='application/atom+xml' href='http://www.blogger.com/feeds/1300399623975330669/posts/default/1903037347281799847'/><link rel='alternate' type='text/html' href='http://asmarnovira.blogspot.com/2009/12/tesis-2.html' title='TESIS (2)'/><author><name>IRA</name><uri>http://www.blogger.com/profile/04417846760028408557</uri><email>noreply@blogger.com</email><gd:image rel='http://schemas.google.com/g/2005#thumbnail' width='16' height='16' src='http://img2.blogblog.com/img/b16-rounded.gif'/></author><thr:total>0</thr:total></entry><entry><id>tag:blogger.com,1999:blog-1300399623975330669.post-4472744570255611460</id><published>2009-12-01T07:48:00.000-08:00</published><updated>2009-12-01T08:06:44.958-08:00</updated><category scheme='http://www.blogger.com/atom/ns#' term='BAHASA INGGRIS'/><title type='text'>DETERMINERS</title><content type='html'>&lt;strong&gt;Articles, Determiners,and Quantifiers&lt;/strong&gt;&lt;br /&gt;&lt;div align="justify"&gt;&lt;br /&gt;&lt;strong&gt;&lt;em&gt;Definition&lt;br /&gt;&lt;/em&gt;&lt;/strong&gt;Articles, determiners, and quantifiers are those little words that precede and modify nouns:&lt;br /&gt;the teacher, a college, a bit of honey, that person, those people, whatever purpose, either way, your choice.&lt;br /&gt;Sometimes these words will tell the reader or listener whether we're referring to a specific or general thing (the garage out back; A horse! A horse! My kingdom for a horse!); sometimes they tell how much or how many (lots of trees, several books, a great deal of confusion). The choice of the proper article or determiner to precede a noun or noun phrase is usually not a problem for writers who have grown up speaking English, nor is it a serious problem for non-native writers whose first language is a romance language such as Spanish. For other writers, though, this can be a considerable obstacle on the way to their mastery of English. In fact, some students from eastern European countries — where their native language has either no articles or an altogether different system of choosing articles and determiners — find that these "little words" can create problems long after every other aspect of English has been mastered.&lt;br /&gt;Determiners are said to "mark" nouns. That is to say, you know a determiner will be followed by a noun. Some categories of determiners are limited (there are only three articles, a handful of possessive pronouns, etc.), but the possessive nouns are as limitless as nouns themselves. This limited nature of most determiner categories, however, explains why determiners are grouped apart from adjectives even though both serve a modifying function. We can imagine that the language will never tire of inventing new adjectives; the determiners (except for those possessive nouns), on the other hand, are well established, and this class of words is not going to grow in number. These categories of determiners are as follows: the articles (an, a, the — see &lt;a href="http://grammar.ccc.commnet.edu/grammar/determiners/determiners.htm#articles"&gt;below&lt;/a&gt;; possessive nouns (Joe's, the priest's, my mother's); possessive pronouns, (his, your, their, whose, etc.); numbers (one, two, etc.); indefinite pronouns (few, more, each, every, either, all, both, some, any, etc.); and demonstrative pronouns. The demonstratives (this, that, these, those, such) are discussed in the section on &lt;a href="http://grammar.ccc.commnet.edu/grammar/pronouns1.htm#demonstrative"&gt;Demonstrative Pronouns&lt;/a&gt;. Notice that the possessive nouns differ from the other determiners in that they, themselves, are often accompanied by other determiners: "my mother's rug," "the priests's collar," "a dog's life."&lt;br /&gt;This categorization of determiners is based on Understanding English Grammar by Martha Kolln. 4rth Edition. MacMillan Publishing Company: New York. 1994.&lt;br /&gt;&lt;a href="http://wadahqu.blogspot.com/2009/10/determiners.html" name="quantifiers"&gt;&lt;/a&gt;&lt;br /&gt;&lt;strong&gt;&lt;em&gt;Some Notes on Quantifiers&lt;br /&gt;&lt;/em&gt;&lt;/strong&gt;Like articles, quantifiers are words that precede and modify nouns. They tell us how many or how much. Selecting the correct quantifier depends on your understanding the distinction between &lt;a href="http://grammar.ccc.commnet.edu/grammar/noun_exercise.htm"&gt;Count and Non-Count Nouns&lt;/a&gt;. For our purposes, we will choose the count noun trees and the non-count noun dancing:&lt;br /&gt;The following quantifiers will work with count nouns:&lt;/div&gt;&lt;div align="justify"&gt;many trees&lt;/div&gt;&lt;div align="justify"&gt;a few trees&lt;/div&gt;&lt;div align="justify"&gt;few trees&lt;/div&gt;&lt;div align="justify"&gt;several trees&lt;/div&gt;&lt;div align="justify"&gt;a couple of trees&lt;/div&gt;&lt;div align="justify"&gt;none of the trees&lt;/div&gt;&lt;div align="justify"&gt;&lt;/div&gt;&lt;div align="justify"&gt;The following quantifiers will work with non-count nouns:&lt;/div&gt;&lt;div align="justify"&gt;not much dancing&lt;/div&gt;&lt;div align="justify"&gt;a little dancing&lt;/div&gt;&lt;div align="justify"&gt;little dancing&lt;/div&gt;&lt;div align="justify"&gt;a bit of dancing&lt;/div&gt;&lt;div align="justify"&gt;a good deal of dancing&lt;/div&gt;&lt;div align="justify"&gt;a great deal of dancing&lt;/div&gt;&lt;div align="justify"&gt;no dancing&lt;/div&gt;&lt;div align="justify"&gt;&lt;/div&gt;&lt;div align="justify"&gt;The following quantifiers will work with both count and non-count nouns:&lt;/div&gt;&lt;div align="justify"&gt;all of the trees/dancing&lt;/div&gt;&lt;div align="justify"&gt;some trees/dancing&lt;/div&gt;&lt;div align="justify"&gt;most of the trees/dancing&lt;/div&gt;&lt;div align="justify"&gt;enough trees/dancing&lt;/div&gt;&lt;div align="justify"&gt;a lot of trees/dancing&lt;/div&gt;&lt;div align="justify"&gt;lots of trees/dancing&lt;/div&gt;&lt;div align="justify"&gt;plenty of trees/dancing&lt;/div&gt;&lt;div align="justify"&gt;a lack of trees/dancing&lt;/div&gt;&lt;div align="justify"&gt;&lt;br /&gt;In formal academic writing, it is usually better to use many and much rather than phrases such as a lot of, lots of and plenty of. There is an important difference between "a little" and "little" (used with non-count words) and between "a few" and "few" (used with count words). If I say that Tashonda has a little experience in management that means that although Tashonda is no great expert she does have some experience and that experience might well be enough for our purposes. If I say that Tashonda has little experience in management that means that she doesn't have enough experience. If I say that Charlie owns a few books on Latin American literature that means that he has some some books — not a lot of books, but probably enough for our purposes. If I say that Charlie owns few books on Latin American literature, that means he doesn't have enough for our purposes and we'd better go to the library.&lt;br /&gt;Unless it is combined with of, the quantifier "much" is reserved for questions and negative statements:&lt;br /&gt;-Much of the snow has already melted.&lt;br /&gt;-How much snow fell yesterday?&lt;br /&gt;-Not much.&lt;br /&gt;Note that the quantifier "most of the" must include the definite article the when it modifies a specific noun, whether it's a count or a non-count noun: "most of the instructors at this college have a doctorate"; "most of the water has evaporated." With a general plural noun, however (when you are not referring to a specific entity), the "of the" is dropped:&lt;br /&gt;-Most colleges have their own admissions policy.&lt;br /&gt;-Most students apply to several colleges.&lt;/div&gt;&lt;div align="justify"&gt;&lt;br /&gt;An indefinite article is sometimes used in conjunction with the quantifier many, thus joining a plural quantifier with a singular noun (which then takes a singular verb):&lt;br /&gt;-Many a young man has fallen in love with her golden hair.&lt;br /&gt;-Many an apple has fallen by October.&lt;/div&gt;&lt;div align="justify"&gt;&lt;/div&gt;&lt;div align="justify"&gt;&lt;/div&gt;&lt;div align="justify"&gt;a few/a little - means that there are not a lot of something, but there is enough.&lt;br /&gt;-There are a few apples. There are enough apples.&lt;br /&gt;-There are a people at the meeting. There are enough people to hold a meeting. There are not a lot people, at the meeting, but there are enough&lt;br /&gt;-I know a little English. He know enough English to manage.&lt;br /&gt;-I have a little money. &lt;/div&gt;&lt;div align="justify"&gt;&lt;/div&gt;&lt;div align="justify"&gt;&lt;/div&gt;&lt;div align="justify"&gt;few/little - means that is not enough of something.&lt;br /&gt;-There are few apples. There are not enough apples.&lt;br /&gt;-There are few people. There are not enough people at the meeting. We can't hold a meeting, because there are not enough people.&lt;br /&gt;-There is little money. We can't buy a lot of expensive food.&lt;br /&gt;-If things for the holiday. I don't have enough money, then we will stay home and have a great time.&lt;br /&gt;-They know little English. They can't get around very well. They don't know enough English to manage.&lt;/div&gt;&lt;div class="blogger-post-footer"&gt;&lt;img width='1' height='1' src='https://blogger.googleusercontent.com/tracker/1300399623975330669-4472744570255611460?l=asmarnovira.blogspot.com' alt='' /&gt;&lt;/div&gt;</content><link rel='replies' type='application/atom+xml' href='http://asmarnovira.blogspot.com/feeds/4472744570255611460/comments/default' title='Poskan Komentar'/><link rel='replies' type='text/html' href='http://asmarnovira.blogspot.com/2009/12/determiners.html#comment-form' title='0 Komentar'/><link rel='edit' type='application/atom+xml' href='http://www.blogger.com/feeds/1300399623975330669/posts/default/4472744570255611460'/><link rel='self' type='application/atom+xml' href='http://www.blogger.com/feeds/1300399623975330669/posts/default/4472744570255611460'/><link rel='alternate' type='text/html' href='http://asmarnovira.blogspot.com/2009/12/determiners.html' title='DETERMINERS'/><author><name>IRA</name><uri>http://www.blogger.com/profile/04417846760028408557</uri><email>noreply@blogger.com</email><gd:image rel='http://schemas.google.com/g/2005#thumbnail' width='16' height='16' src='http://img2.blogblog.com/img/b16-rounded.gif'/></author><thr:total>0</thr:total></entry><entry><id>tag:blogger.com,1999:blog-1300399623975330669.post-2531984689010878478</id><published>2009-12-01T07:13:00.000-08:00</published><updated>2009-12-01T07:44:19.549-08:00</updated><category scheme='http://www.blogger.com/atom/ns#' term='BAHASA INGGRIS'/><title type='text'>A / AN / THE</title><content type='html'>&lt;div align="justify"&gt;&lt;strong&gt;Using Articles&lt;/strong&gt;&lt;br /&gt;What is an article? Basically, an article is an adjective. Like adjectives, articles modify nouns. English has two articles: the and a/an. The is used to refer to specific or particular nouns; a/an is used to modify non-specific or non-particular nouns. We call the the definite article and a/an the indefinite article.&lt;br /&gt;the = definite article&lt;br /&gt;a/an = indefinite article&lt;br /&gt;For example, if I say, "Let's read the book," I mean a specific book. If I say, "Let's read a book," I mean any book rather than a specific book. Here's another way to explain it: The is used to refer to a specific or particular member of a group. For example, "I just saw the most popular movie of the year." There are many movies, but only one particular movie is the most popular. Therefore, we use the. "A/an" is used to refer to a non-specific or non-particular member of the group. For example, "I would like to go see a movie." Here, we're not talking about a specific movie. We're talking about any movie. There are many movies, and I want to see any movie. I don't have a specific one in mind. Let's look at each kind of article a little more closely.&lt;/div&gt;&lt;div align="justify"&gt;&lt;br /&gt;&lt;strong&gt;&lt;em&gt;Indefinite Articles: a and an&lt;/em&gt;&lt;br /&gt;&lt;/strong&gt;"A" and "an" signal that the noun modified is indefinite, referring to any member of a group. For example:&lt;br /&gt;-"My daughter really wants a dog for Christmas." This refers to any dog. We don't know which dog because we haven't found the dog yet.&lt;br /&gt;-"Somebody call a policeman!" This refers to any policeman. We don't need a specific policeman; we need any policeman who is available.&lt;br /&gt;-"When I was at the zoo, I saw an elephant!" Here, we're talking about a single, non-specific thing, in this case an elephant. There are probably several elephants at the zoo, but there's only one we're talking about here.&lt;/div&gt;&lt;div align="justify"&gt;&lt;br /&gt;&lt;strong&gt;&lt;em&gt;Remember, using a or an depends on the sound that begins the next word. So...&lt;br /&gt;&lt;/em&gt;&lt;/strong&gt;a + singular noun beginning with a consonant: a boy; a car; a bike; a zoo; a dog.&lt;br /&gt;an + singular noun beginning with a vowel: an elephant; an egg; an apple; an idiot; an orphan.&lt;br /&gt;a + singular noun beginning with a consonant sound: a user (sounds like 'yoo-zer,' i.e. begins with a consonant 'y' sound, so 'a' is used); a university; a unicycle.&lt;br /&gt;In some cases where "h" is pronounced, such as "historical," us an:&lt;br /&gt;An historical event is worth recording.&lt;/div&gt;&lt;div align="justify"&gt;&lt;br /&gt;In writing, "a historical event" is more commonly used.&lt;br /&gt;Remember that this rule also applies when you use acronyms:&lt;br /&gt;Introductory Composition at Purdue (ICaP) handles first-year writing at the University. Therefore, an ICaP memo generally discusses issues concerning English 106 instructors. Another case where this rule applies is when acronyms start with consonant letters but have vowel sounds:&lt;br /&gt;An MSDS (material safety data sheet) was used to record the data. An SPCC plan (Spill Prevention Control and Countermeasures plan) will help us prepare for the worst. If the noun is modified by an adjective, the choice between a and an depends on the initial sound of the adjective that immediately follows the article:&lt;br /&gt;a broken egg&lt;br /&gt;an unusual problem&lt;br /&gt;a European country (sounds like 'yer-o-pi-an,' i.e. begins with consonant 'y' sound) &lt;/div&gt;&lt;div align="justify"&gt;&lt;br /&gt;&lt;/div&gt;&lt;div align="justify"&gt;&lt;/div&gt;&lt;div align="justify"&gt;&lt;/div&gt;&lt;div align="justify"&gt;Remember, too, that in English, the indefinite articles are used to indicate membership in a group:&lt;br /&gt;-I am a teacher. (I am a member of a large group known as teachers.)&lt;br /&gt;-Brian is an Irishman. (Brian is a member of the people known as Irish.)&lt;br /&gt;-Seiko is a practicing Buddhist. (Seiko is a member of the group of people known as Buddhists.)&lt;/div&gt;&lt;div align="justify"&gt;&lt;br /&gt;&lt;/div&gt;&lt;div align="justify"&gt;&lt;strong&gt;&lt;em&gt;&lt;/em&gt;&lt;/strong&gt;&lt;/div&gt;&lt;div align="justify"&gt;&lt;strong&gt;&lt;em&gt;&lt;/em&gt;&lt;/strong&gt;&lt;/div&gt;&lt;div align="justify"&gt;&lt;strong&gt;&lt;em&gt;&lt;/em&gt;&lt;/strong&gt;&lt;/div&gt;&lt;div align="justify"&gt;&lt;strong&gt;&lt;em&gt;Definite Article: the&lt;/em&gt;&lt;/strong&gt;&lt;br /&gt;The definite article is used before singular and plural nouns when the noun is specific or particular. The signals that the noun is definite, that it refers to a particular member of a group. For example:&lt;br /&gt;-"The dog that bit me ran away." Here, we're talking about a specific dog, the dog that bit me.&lt;br /&gt;-"I was happy to see the policeman who saved my cat!" Here, we're talking about a particular policeman. Even if we don't know the policeman's name, it's still a particular policeman because it is the one who saved the cat.&lt;br /&gt;-"I saw the elephant at the zoo." Here, we're talking about a specific noun. Probably there is only one elephant at the zoo.&lt;/div&gt;&lt;div align="justify"&gt;&lt;br /&gt;&lt;strong&gt;&lt;em&gt;Count and Noncount Nouns&lt;br /&gt;&lt;/em&gt;&lt;/strong&gt;The can be used with noncount nouns, or the article can be omitted entirely.&lt;br /&gt;-"I love to sail over the water" (some specific body of water) or "I love to sail over water" (any water).&lt;br /&gt;-"He spilled the milk all over the floor" (some specific milk, perhaps the milk you bought earlier that day) or "He spilled milk all over the floor" (any milk). &lt;/div&gt;&lt;div align="justify"&gt;&lt;br /&gt;&lt;/div&gt;&lt;div align="justify"&gt;&lt;/div&gt;&lt;div align="justify"&gt;&lt;/div&gt;&lt;div align="justify"&gt;&lt;/div&gt;&lt;div align="justify"&gt;&lt;/div&gt;&lt;div align="justify"&gt;"A/an" can be used only with count nouns.&lt;br /&gt;-"I need a bottle of water."&lt;br /&gt;-"I need a new glass of milk."&lt;br /&gt;&lt;/div&gt;&lt;div align="justify"&gt;Most of the time, you can't say, "She wants a water," unless you're implying, say, a bottle of water.&lt;/div&gt;&lt;div align="justify"&gt;&lt;br /&gt;&lt;strong&gt;&lt;em&gt;Geographical use of the&lt;/em&gt;&lt;/strong&gt;&lt;br /&gt;There are some specific rules for using the with geographical nouns. Do not use the before:&lt;br /&gt;-names of most countries/territories: Italy, Mexico, Bolivia; however, the Netherlands, the Dominican Republic, the Philippines, the United States&lt;br /&gt;-names of cities, towns, or states: Seoul, Manitoba, Miami&lt;br /&gt;-names of streets: Washington Blvd., Main St.&lt;br /&gt;-names of lakes and bays: Lake Titicaca, Lake Erie except with a group of lakes like the Great Lakes&lt;br /&gt;-names of mountains: Mount Everest, Mount Fuji except with ranges of mountains like the Andes or the Rockies or unusual names like the Matterhorn&lt;br /&gt;-names of continents (Asia, Europe)&lt;br /&gt;-names of islands (Easter Island, Maui, Key West) except with island chains like the Aleutians, the Hebrides, or the Canary Islands&lt;/div&gt;&lt;div align="justify"&gt;&lt;br /&gt;Do use the before:&lt;br /&gt;-names of rivers, oceans and seas: the Nile, the Pacific&lt;br /&gt;-points on the globe: the Equator, the North Pole&lt;br /&gt;-geographical areas: the Middle East, the West&lt;br /&gt;-deserts, forests, gulfs, and peninsulas: the Sahara, the Persian Gulf, the Black Forest, the Iberian Peninsula&lt;/div&gt;&lt;div align="justify"&gt;&lt;br /&gt;&lt;strong&gt;&lt;em&gt;Omission of Articles&lt;br /&gt;&lt;/em&gt;&lt;/strong&gt;Some common types of nouns that don't take an article are:&lt;br /&gt;-Names of languages and nationalities: Chinese, English, Spanish, Russian&lt;br /&gt;-Names of sports: volleyball, hockey, baseball&lt;br /&gt;-Names of academic subjects: mathematics, biology, history, computer science&lt;/div&gt;&lt;div class="blogger-post-footer"&gt;&lt;img width='1' height='1' src='https://blogger.googleusercontent.com/tracker/1300399623975330669-2531984689010878478?l=asmarnovira.blogspot.com' alt='' /&gt;&lt;/div&gt;</content><link rel='replies' type='application/atom+xml' href='http://asmarnovira.blogspot.com/feeds/2531984689010878478/comments/default' title='Poskan Komentar'/><link rel='replies' type='text/html' href='http://asmarnovira.blogspot.com/2009/12/an.html#comment-form' title='0 Komentar'/><link rel='edit' type='application/atom+xml' href='http://www.blogger.com/feeds/1300399623975330669/posts/default/2531984689010878478'/><link rel='self' type='application/atom+xml' href='http://www.blogger.com/feeds/1300399623975330669/posts/default/2531984689010878478'/><link rel='alternate' type='text/html' href='http://asmarnovira.blogspot.com/2009/12/an.html' title='A / AN / THE'/><author><name>IRA</name><uri>http://www.blogger.com/profile/04417846760028408557</uri><email>noreply@blogger.com</email><gd:image rel='http://schemas.google.com/g/2005#thumbnail' width='16' height='16' src='http://img2.blogblog.com/img/b16-rounded.gif'/></author><thr:total>0</thr:total></entry><entry><id>tag:blogger.com,1999:blog-1300399623975330669.post-1544626228730635443</id><published>2009-12-01T06:29:00.000-08:00</published><updated>2009-12-01T07:01:03.754-08:00</updated><category scheme='http://www.blogger.com/atom/ns#' term='BAHASA INGGRIS'/><title type='text'>OTHERS, THE OTHERS &amp; ANOTHERS</title><content type='html'>&lt;strong&gt;OTHERS, THE OTHERS &amp;amp; ANOTHERS&lt;/strong&gt;&lt;br /&gt;Kata other, another, dan others dapat diartikan dengan : yang lain atau lainnya. Ketiga kata tersebut sangat mudah membingungkan. Maka untuk menentukan bagaimana menggunakannya dengan tepat masing-masing kata itu harus diperhatikan empat hal, yaitu:&lt;br /&gt;1. Jika kata itu singular (tunggal) atau plural (jamak).&lt;br /&gt;2. Jika kata itu definite –the- (tentu) atau indefinite –a- (tak tentu)&lt;br /&gt;3. Jika kata itu berfungsi sebagai adjective yang menerangkan noun atau senantiasa bersama dengan noun.&lt;br /&gt;4. Jika kata itu berfungsi sebagai pronoun yang dapat berdiri sendiri.&lt;br /&gt;&lt;br /&gt;Perhatikanlah contoh-contoh berikut :&lt;br /&gt;a. I have another (adj.) book&lt;br /&gt;b. I have another (pron.)&lt;br /&gt;Perhatikan bahwa another digunakan hanya untuk menunjuk kepada an indefinite (tak tentu) dan dengan benda tunggal (singular).&lt;br /&gt;c. I have other (adj.) books.&lt;br /&gt;d. I have others. (pron)&lt;br /&gt;e. I have the other book (adj.)&lt;br /&gt;f. I have the other (pron.)&lt;br /&gt;g. I have the other books (adj.)&lt;br /&gt;h. I have the others (pron).&lt;br /&gt;Perhatikan bahwa Others hanya digunakan sebagai plural pronoun yang tidak bersama dengan noun(dapat berdiri sendiri). Sedangkan other dapat digunakan untuk semuanya&lt;br /&gt;i. I have three books, two are mine. The other book is yours. (The others is yours).&lt;br /&gt;j. I have three books, one is mine. The others are yours. (The others are yours).&lt;br /&gt;k. If you are still thirsty, I’ll make another pot of coffee.&lt;br /&gt;&lt;br /&gt;Example :&lt;br /&gt;OTHER -- the singular form. The word refers to something that is different from something else. For instance, Director A makes a movie based on a famous novel. Director B makes a different movie based on the same novel.&lt;br /&gt;Luke: "Did you like Director A's movie?"&lt;br /&gt;Ted: "Yes, but I liked the OTHER version much better."&lt;br /&gt;&lt;br /&gt;Luke: "What do you think of my new wrist watch?" [On his right wrist.]&lt;br /&gt;Ted: "I think you should wear it on your OTHER wrist."&lt;br /&gt;&lt;br /&gt;Two senators write two different pieces of legislation about the same topic. "I like Senator Luke's legislation, but the OTHER one will probably be approved."&lt;br /&gt;&lt;br /&gt;So, when we use the singular word "other," we are actually referring to something different from something else: X is fine, but I think the OTHER ["Y"] is more acceptable.&lt;br /&gt;&lt;br /&gt;&lt;strong&gt;OTHERS (the plural form, for more than one "other")&lt;/strong&gt;&lt;br /&gt;Some essays are easy to read; OTHERS are much more difficult.&lt;br /&gt;&lt;br /&gt;Many people chose to vote in the election. OTHERS simply stayed at home, not interested in voting at all. [OTHERS clearly indicates the "different" or "non-voting" people.]&lt;br /&gt;&lt;br /&gt;&lt;strong&gt;THE OTHERS (same as above, but used in cases where the article "the" is necessary)&lt;/strong&gt;&lt;br /&gt;Luke: "Would you like to have THESE shirts?"&lt;br /&gt;Ted: "No, I think THE OTHERS look more presentable.&lt;br /&gt;&lt;br /&gt;"The "chosen" people lived in the wealthy homes; all THE OTHERS lived in very poor houses. ["The others" in this example means "the people who are NOT wealthy" or THE OTHERS.]&lt;br /&gt;&lt;br /&gt;&lt;strong&gt;ANOTHER (The dictionary definition is this: "different or distinct from the one first considered" OR "additional" OR "later")&lt;/strong&gt;&lt;br /&gt;Different or distinct&lt;br /&gt;Luke: "Are you going to write your essay about global warming?"&lt;br /&gt;Ted: "I had thought I would, but I have changed my mind and will write on ANOTHER topic."&lt;br /&gt;&lt;br /&gt;Additional&lt;br /&gt;Luke: "Did you get enough to eat?"&lt;br /&gt;Ted: "No, I think I'll have another piece of pie."&lt;br /&gt;&lt;br /&gt;Later&lt;br /&gt;Luke: "Are you taking a trip this weekend?"&lt;br /&gt;Ted: "I think I'll wait until ANOTHER time."&lt;div class="blogger-post-footer"&gt;&lt;img width='1' height='1' src='https://blogger.googleusercontent.com/tracker/1300399623975330669-1544626228730635443?l=asmarnovira.blogspot.com' alt='' /&gt;&lt;/div&gt;</content><link rel='replies' type='application/atom+xml' href='http://asmarnovira.blogspot.com/feeds/1544626228730635443/comments/default' title='Poskan Komentar'/><link rel='replies' type='text/html' href='http://asmarnovira.blogspot.com/2009/12/others-others-anothers.html#comment-form' title='0 Komentar'/><link rel='edit' type='application/atom+xml' href='http://www.blogger.com/feeds/1300399623975330669/posts/default/1544626228730635443'/><link rel='self' type='application/atom+xml' href='http://www.blogger.com/feeds/1300399623975330669/posts/default/1544626228730635443'/><link rel='alternate' type='text/html' href='http://asmarnovira.blogspot.com/2009/12/others-others-anothers.html' title='OTHERS, THE OTHERS &amp; ANOTHERS'/><author><name>IRA</name><uri>http://www.blogger.com/profile/04417846760028408557</uri><email>noreply@blogger.com</email><gd:image rel='http://schemas.google.com/g/2005#thumbnail' width='16' height='16' src='http://img2.blogblog.com/img/b16-rounded.gif'/></author><thr:total>0</thr:total></entry><entry><id>tag:blogger.com,1999:blog-1300399623975330669.post-942513908241187711</id><published>2009-11-22T07:29:00.000-08:00</published><updated>2009-12-01T09:31:53.920-08:00</updated><category scheme='http://www.blogger.com/atom/ns#' term='BAHASA INGGRIS'/><title type='text'>TESIS</title><content type='html'>&lt;strong&gt;&lt;span style="font-size:130%;"&gt;Simple Present&lt;/span&gt;&lt;/strong&gt;&lt;br /&gt;&lt;em&gt;Bentuk Negatif Simple Present - kata kerja “to be”&lt;/em&gt;&lt;br /&gt;&lt;div align="justify"&gt;Kalimat negatif dan pertanyaan bentuk simple present yang menggunakan kata kerja “to be” terbentuk secara berbeda dengan pertanyaan-pertanyaan lain. Untuk membuat kalimat negatif kita cukup menambahkan “not” sebelum kata kerja “to be”.&lt;/div&gt;&lt;div align="justify"&gt;- Kalimat: You are a doctor&lt;/div&gt;&lt;div align="justify"&gt;- Negatif: Your are not a doctor&lt;/div&gt;&lt;div align="justify"&gt;&lt;/div&gt;&lt;div align="justify"&gt;- Kalimat: They are cats&lt;/div&gt;&lt;div align="justify"&gt;- Negatif: They are not cats&lt;/div&gt;Berikut adalah bentuk negatif dari kata kerja “to be” dalam bentuk Simple Present (bentuk sekarang sederhana):&lt;br /&gt;&lt;em&gt;&lt;strong&gt;Tunggal&lt;/strong&gt;&lt;/em&gt;&lt;br /&gt;I am not&lt;br /&gt;You are not&lt;br /&gt;He is not&lt;br /&gt;She is not&lt;br /&gt;It is not&lt;br /&gt;&lt;strong&gt;&lt;em&gt;Jamak&lt;/em&gt;&lt;/strong&gt;&lt;br /&gt;We are not&lt;br /&gt;You are not&lt;br /&gt;They are not&lt;br /&gt;&lt;em&gt;Pertanyaan Simple Present&lt;/em&gt;&lt;br /&gt;Untuk membuat pertanyaan kita cukup membalik posisi subjek dan “to be”.&lt;br /&gt;- Kalimat: You are a doctor&lt;br /&gt;- Pertanyaan: Are you a doctor?&lt;br /&gt;- Kalimat: They are cats&lt;br /&gt;- Pertanyaan: Are they cats?&lt;br /&gt;“To be” sebagai pertanyaan dalam bentuk Simple Present adalah sebagai berikut:&lt;br /&gt;&lt;strong&gt;&lt;em&gt;Tunggal&lt;/em&gt;&lt;/strong&gt;&lt;br /&gt;Am I (a teacher) ?&lt;br /&gt;Are you …?&lt;br /&gt;Is he …?&lt;br /&gt;Is she …?&lt;br /&gt;Is it …?&lt;br /&gt;&lt;strong&gt;&lt;em&gt;Jamak&lt;/em&gt;&lt;/strong&gt;&lt;br /&gt;Are we …?&lt;br /&gt;Are you …?&lt;br /&gt;Are they …?&lt;br /&gt;&lt;em&gt;Jawaban-Jawaban Singkat&lt;/em&gt;&lt;br /&gt;&lt;div align="justify"&gt;Kita bisa menjawab pertanyaan-pertanyaan ini dengan jawaban singkat menggunakan kata kerja “to be”. Sebagai contoh:&lt;/div&gt;- Are you a teacher?&lt;br /&gt;- Yes, I am / No, I am not&lt;br /&gt;- Is he a Student?&lt;br /&gt;- Yes, he is. / No, he is not.&lt;br /&gt;&lt;div align="justify"&gt;Perlu diperhatikan bahwa dalam Bahasa Inggris lisan kita biasanya menggunakan singkatan (contraction) untuk bentuk negatif. Contoh:No, I am not, bisa disingkat menjadi No, I’m not.Singkatan-singkatan ini akan dipelajari khusus pada unit selanjutnya.&lt;/div&gt;&lt;div align="justify"&gt;Contoh penggunaan dalam dialog:&lt;/div&gt;&lt;div align="justify"&gt;(1) Sylvia, are you a teacher?&lt;/div&gt;&lt;div align="justify"&gt;No, I’m not.&lt;/div&gt;&lt;div align="justify"&gt;I’m a doctor.&lt;/div&gt;&lt;div align="justify"&gt;That’s great!&lt;/div&gt;&lt;div align="justify"&gt;(2) So Tyler, what do you do?&lt;/div&gt;&lt;div align="justify"&gt;I’m a businessman. How about you?&lt;/div&gt;&lt;div align="justify"&gt;I’m a singer.&lt;/div&gt;&lt;div align="justify"&gt;Wow, that’s great!&lt;/div&gt;&lt;div align="justify"&gt;(3) What does your friend look like, Sylvia?&lt;/div&gt;&lt;div align="justify"&gt;Oh, he’s tall, handsome, and he has brown hair.&lt;/div&gt;&lt;div align="justify"&gt;Is he kind?&lt;/div&gt;&lt;div align="justify"&gt;Yes, he’s very kind. He’s really nice!&lt;/div&gt;&lt;div align="justify"&gt;(4) Hi, my name is Tyler. I’m tall, I’m funny, and I’m really happy. I’m a teacher and web designer. My friend’s name is Sylvia, she’s very cute, tall, and kind. She’s a teacher, too. She’s also really smart. It’s nice to meet you!&lt;/div&gt;&lt;div align="justify"&gt;&lt;/div&gt;&lt;div align="justify"&gt;&lt;em&gt;&lt;/em&gt;&lt;/div&gt;&lt;div align="justify"&gt;&lt;em&gt;&lt;/em&gt;&lt;/div&gt;&lt;div align="justify"&gt;&lt;em&gt;&lt;/em&gt;&lt;/div&gt;&lt;div align="justify"&gt;&lt;em&gt;Kosa Kata Baru&lt;/em&gt;&lt;/div&gt;&lt;div align="justify"&gt;teacher = guru&lt;/div&gt;&lt;div align="justify"&gt;doctor = dokter&lt;/div&gt;&lt;div align="justify"&gt;great = hebat&lt;/div&gt;&lt;div align="justify"&gt;do = kerjakan/pekerjaan&lt;/div&gt;&lt;div align="justify"&gt;businessman = pebisnis&lt;/div&gt;&lt;div align="justify"&gt;singer = penyayi&lt;/div&gt;&lt;div align="justify"&gt;friend = teman&lt;/div&gt;&lt;div align="justify"&gt;look like = seperti&lt;/div&gt;&lt;div align="justify"&gt;tall = tinggi&lt;/div&gt;&lt;div align="justify"&gt;handsome = tampan&lt;/div&gt;&lt;div align="justify"&gt;hair = rambut&lt;/div&gt;&lt;div align="justify"&gt;brown = coklat&lt;/div&gt;&lt;div align="justify"&gt;kind = baik&lt;/div&gt;&lt;div align="justify"&gt;funny = menyenangkan&lt;/div&gt;&lt;div align="justify"&gt;happy = bahagia/senang&lt;/div&gt;&lt;div align="justify"&gt;web designer = perancang situs&lt;/div&gt;&lt;div align="justify"&gt;cute = manis/elok&lt;/div&gt;&lt;div align="justify"&gt;smart = cerdas&lt;/div&gt;&lt;div align="justify"&gt;really = sungguh&lt;/div&gt;&lt;div align="justify"&gt;&lt;/div&gt;&lt;div align="justify"&gt;&lt;/div&gt;&lt;div align="justify"&gt;&lt;strong&gt;&lt;span style="font-size:130%;"&gt;&lt;/span&gt;&lt;/strong&gt;&lt;/div&gt;&lt;div align="justify"&gt;&lt;strong&gt;&lt;span style="font-size:130%;"&gt;Future Perfect Continuous Tense&lt;/span&gt;&lt;/strong&gt;&lt;/div&gt;&lt;div align="justify"&gt;&lt;/div&gt;&lt;div align="justify"&gt;&lt;strong&gt;&lt;span style="font-size:130%;"&gt;&lt;/span&gt;&lt;/strong&gt;&lt;/div&gt;&lt;div align="justify"&gt;&lt;strong&gt;&lt;span style="font-size:78%;"&gt;&lt;/span&gt;&lt;/strong&gt;&lt;/div&gt;&lt;div align="justify"&gt;Kita menggunakan tenses ini untuk menyatakan tindakan-tindakan yang sedang akan terjadi pada waktu tertentu di masa yang akan datang. Beberapa ekspresi waktu yang umum digunakan dalam Future Perfect Continuous:&lt;/div&gt;&lt;div align="justify"&gt;- By tomorrow / 8 o’clock&lt;/div&gt;&lt;div align="justify"&gt;- This year / month / week&lt;/div&gt;&lt;div align="justify"&gt;- Next year / month / week&lt;/div&gt;&lt;div align="justify"&gt;&lt;/div&gt;&lt;div align="justify"&gt;Bentuk:Subjek + will + have + been + Verb+ing. Contoh:&lt;/div&gt;&lt;div align="justify"&gt;We will have been driving 6 hours by the time we get home.&lt;/div&gt;&lt;div align="justify"&gt;In the summer Mike will have been trying to find a new job for five months.&lt;/div&gt;&lt;div align="justify"&gt;Jane will be very tired when she comes home, because she will have been flying over 24 hours.&lt;/div&gt;&lt;div align="justify"&gt;My father and I will have been breeding sheep for 20 years tomorrow.&lt;/div&gt;&lt;div align="justify"&gt;By the year 2020, linguists will have been studying and defining the Indo-European language family for more than 200 years.&lt;/div&gt;&lt;div align="justify"&gt;&lt;strong&gt;Catatan&lt;/strong&gt;: Jika durasi sebuah aktivitas (sejak April, selama 3 jam) tidak diketahui, maka Future Continuous harus digunakan ketimbang bentuk perfect.&lt;/div&gt;&lt;div align="justify"&gt;&lt;/div&gt;&lt;div align="justify"&gt;&lt;/div&gt;&lt;div align="justify"&gt;&lt;/div&gt;&lt;div align="justify"&gt;Untuk bentuk negatif kita tambahkan not.&lt;/div&gt;&lt;div align="justify"&gt;She won’t have been writing the book for four months by the end of October.&lt;/div&gt;&lt;div align="justify"&gt;&lt;/div&gt;&lt;div align="justify"&gt;&lt;/div&gt;&lt;div align="justify"&gt;Kalimat-kalimat negatif kedengarannya tidak natural. Kemungkinan karena jawaban terhadap sebuah pertanyaan seperti “Will she have been teaching for 30 years this year?” cukup “No, I don’t think so”.Bentuk negatif memiliki pola sebagai berikut:&lt;/div&gt;&lt;div align="justify"&gt;Will + subjek + have + been + verb+ing.&lt;/div&gt;&lt;div align="justify"&gt;Contoh:Will he have been writing the composition for a month by the end of February?&lt;/div&gt;&lt;div align="justify"&gt;&lt;/div&gt;&lt;div align="justify"&gt;Pertanyaan-pertanyaan yang dimulai dengan “how long” lebih umum:&lt;/div&gt;&lt;div align="justify"&gt;How long will you have been learning German this year?&lt;/div&gt;&lt;div align="justify"&gt;How long will you have been trying to get your driving license this week?&lt;/div&gt;&lt;div align="justify"&gt;I hope you’ll finally make it!&lt;/div&gt;&lt;div align="justify"&gt;&lt;/div&gt;&lt;div align="justify"&gt;&lt;span style="font-size:180%;"&gt;&lt;strong&gt;&lt;/strong&gt;&lt;/span&gt;&lt;/div&gt;&lt;div align="justify"&gt;&lt;strong&gt;&lt;span style="font-size:130%;"&gt;&lt;/span&gt;&lt;/strong&gt;&lt;/div&gt;&lt;div align="justify"&gt;&lt;strong&gt;&lt;span style="font-size:130%;"&gt;Past Perfect Continuous Tense&lt;/span&gt;&lt;/strong&gt;&lt;/div&gt;&lt;div align="justify"&gt;&lt;strong&gt;&lt;span style="font-size:130%;"&gt;&lt;/span&gt;&lt;/strong&gt;&lt;/div&gt;&lt;div align="justify"&gt;&lt;span style="font-size:78%;"&gt;&lt;/span&gt;&lt;/div&gt;&lt;div align="justify"&gt;&lt;/div&gt;&lt;div align="justify"&gt;Past Perfect Continuous (Past Perfect Progressive) digunakan untuk menyatakan tindakan-tindakan yang dimulai di waktu lampau dan berakhir sampai pada waktu yang lainnya di masa lampau juga. Durasi tindakan masa lampau sampai titik waktu tertentu di masa lampau juga. Kalimat-kalimat pengandaian (a) dan reported speech (b).&lt;/div&gt;&lt;div align="justify"&gt;Bentuk:Subjek + had + been + verb+ing. Contoh:&lt;/div&gt;&lt;div align="justify"&gt;I had been running for an hour when it started raining. (Kegunaan 1)&lt;/div&gt;&lt;div align="justify"&gt;Mary said she had never been swimming so much in one day. (Kegunaan 2b)&lt;/div&gt;&lt;div align="justify"&gt;Kathy put on weight because she had been eating too much sugar (Kegunaan 1)&lt;/div&gt;&lt;div align="justify"&gt;When I saw him I knew that he had been training. (Kegunaan 1)&lt;/div&gt;&lt;div align="justify"&gt;&lt;/div&gt;&lt;div align="justify"&gt;&lt;/div&gt;&lt;div align="justify"&gt;&lt;/div&gt;&lt;div align="justify"&gt;Bentuk bertanya memiliki pola sebagai berikut:&lt;/div&gt;&lt;div align="justify"&gt;Bentuk:Had + Subjek + been + verb+ing.&lt;/div&gt;&lt;div align="justify"&gt;Contoh:&lt;/div&gt;&lt;div align="justify"&gt;For how many hours had Fred been painting the house when the ladder fell?&lt;/div&gt;&lt;div align="justify"&gt;How long had the player been playing before he scored?&lt;/div&gt;&lt;div align="justify"&gt;&lt;/div&gt;&lt;div align="justify"&gt;&lt;/div&gt;&lt;div align="justify"&gt;&lt;/div&gt;&lt;div align="justify"&gt;Untuk bentuk negatif kita tambahkan not.&lt;/div&gt;&lt;div align="justify"&gt;Contoh:&lt;/div&gt;&lt;div align="justify"&gt;He said he wasn’t tired because he hadn’t been working that day. (Kegunaan 2b)&lt;/div&gt;&lt;div align="justify"&gt;If it hadn’t been raining, we would have played football. (Kegunaan 2a)&lt;/div&gt;&lt;div align="justify"&gt;Had I not been studying all night, I would have problems with this test now. (Kegunaan 2a)&lt;/div&gt;&lt;div align="justify"&gt;&lt;/div&gt;&lt;div align="justify"&gt;&lt;em&gt;&lt;/em&gt;&lt;/div&gt;&lt;div align="justify"&gt;&lt;em&gt;&lt;/em&gt;&lt;/div&gt;&lt;div align="justify"&gt;&lt;em&gt;Perbedaan Past Perfect dan Past Perfect Continuous&lt;/em&gt;&lt;/div&gt;&lt;div align="justify"&gt;Past Perfect menekankan selesainya (atau hasil tindakan lengkap), sedangkan Past Perfect Continuous menekankan durasi atau aktivitas sebuah tindakan.&lt;/div&gt;&lt;div align="justify"&gt;Contoh:&lt;/div&gt;&lt;div align="justify"&gt;By the time we arrived, he had left the house. (Past Perfect)&lt;/div&gt;&lt;div align="justify"&gt;By the time we arrived, he had been playing poker with his friends for 2 hours. (Continuous)&lt;/div&gt;&lt;div align="justify"&gt;&lt;/div&gt;&lt;div align="justify"&gt;&lt;em&gt;&lt;/em&gt;&lt;/div&gt;&lt;div align="justify"&gt;&lt;em&gt;&lt;/em&gt;&lt;/div&gt;&lt;div align="justify"&gt;&lt;em&gt;Perbedaan Present Perfect Continuous dan Past Perfect Continuous&lt;/em&gt;&lt;/div&gt;&lt;div align="justify"&gt;Past Perfect Continuous, berbeda dengan Present Continuous, tidak pernah menyatakan tindakan-tindakan yang berlanjut sampai sekarang.&lt;/div&gt;&lt;div align="justify"&gt;Contoh:&lt;/div&gt;&lt;div align="justify"&gt;He has been playing for two hours. (Dia masih sedang bermain atau baru saja berhenti.)&lt;/div&gt;&lt;div align="justify"&gt;He had been playing for two hours when I arrived. (Dia tidak sedang bermain bola sekarang.)&lt;/div&gt;&lt;div align="justify"&gt;&lt;/div&gt;&lt;div align="justify"&gt;&lt;span style="font-size:180%;"&gt;&lt;strong&gt;&lt;/strong&gt;&lt;/span&gt;&lt;/div&gt;&lt;div align="justify"&gt;&lt;strong&gt;&lt;span style="font-size:130%;"&gt;&lt;/span&gt;&lt;/strong&gt;&lt;/div&gt;&lt;div align="justify"&gt;&lt;strong&gt;&lt;span style="font-size:130%;"&gt;Present Perfect Continuous&lt;/span&gt;&lt;/strong&gt;&lt;/div&gt;&lt;div align="justify"&gt;&lt;strong&gt;&lt;span style="font-size:130%;"&gt;&lt;/span&gt;&lt;/strong&gt;&lt;/div&gt;&lt;div align="justify"&gt;&lt;strong&gt;&lt;span style="font-size:78%;"&gt;&lt;/span&gt;&lt;/strong&gt;&lt;/div&gt;&lt;div align="justify"&gt;&lt;/div&gt;&lt;div align="justify"&gt;Kita menggunakan Present Perfect Continuous (Progressive) untuk menyatakan tindakan-tindakan yang bermula di masa lampau dan terus berlanjut di masa sekarang.Tensis ini juga digunakan untuk membicarakan tentang tindakan-tindakan yang bermula di masa lampau dan baru saja telah berakhir.&lt;/div&gt;&lt;div align="justify"&gt;Kegunaan:&lt;/div&gt;&lt;div align="justify"&gt;Untuk menyatakan tindakan-tindakan yang bermula di masa lampau dan terus berlanjut di masa sekarang&lt;/div&gt;&lt;div align="justify"&gt;Untuk menyatakan tindakan-tindakan yang belum lama ini diselesaikan&lt;/div&gt;&lt;div align="justify"&gt;&lt;/div&gt;&lt;div align="justify"&gt;&lt;em&gt;&lt;/em&gt;&lt;/div&gt;&lt;div align="justify"&gt;&lt;em&gt;&lt;/em&gt;&lt;/div&gt;&lt;div align="justify"&gt;&lt;em&gt;Since dan For&lt;/em&gt;&lt;/div&gt;&lt;div align="justify"&gt;Science dan for merupakan ekspresi waktu sangat umum yang digunakan bersama dengan Present Perfect Continuous. Kita menggunakan for dengan sebuah periode waktu, contoh:I have been living here for 20 years. Ketika berbicara tentang sebuah titik permulaan, kita menggunakan since dengan sebuah titik dalam waktu, contoh:I have been living here since 1960.Perlu diperhatikan bahwa dalam Present Perfect Continuous anda tidak dapat menggunakan ekspresi waktu seperti:&lt;/div&gt;&lt;div align="justify"&gt;two months ago&lt;/div&gt;&lt;div align="justify"&gt;one year ago&lt;/div&gt;&lt;div align="justify"&gt;last week&lt;/div&gt;&lt;div align="justify"&gt;yesterday&lt;/div&gt;&lt;div align="justify"&gt;when I was five years old&lt;/div&gt;&lt;div align="justify"&gt;&lt;/div&gt;&lt;div align="justify"&gt;&lt;/div&gt;&lt;div align="justify"&gt;&lt;/div&gt;&lt;div align="justify"&gt;Ekspresi waktu diatas tidak dapat digunakan karena ekspresi-ekspresi waktu ini merinci secara akurat kapan sesuatu terjadi. Akan tetapi, anda bisa menggunakan ekspresi waktu seperti:&lt;/div&gt;&lt;div align="justify"&gt;already&lt;/div&gt;&lt;div align="justify"&gt;yet&lt;/div&gt;&lt;div align="justify"&gt;before&lt;/div&gt;&lt;div align="justify"&gt;never&lt;/div&gt;&lt;div align="justify"&gt;recently&lt;/div&gt;&lt;div align="justify"&gt;at last&lt;/div&gt;&lt;div align="justify"&gt;ever&lt;/div&gt;&lt;div align="justify"&gt;just&lt;/div&gt;&lt;div align="justify"&gt;lately&lt;/div&gt;&lt;div align="justify"&gt;&lt;/div&gt;&lt;div align="justify"&gt;&lt;em&gt;&lt;/em&gt;&lt;/div&gt;&lt;div align="justify"&gt;&lt;em&gt;&lt;/em&gt;&lt;/div&gt;&lt;div align="justify"&gt;&lt;em&gt;Perbedaan Present Perfect dan Present Prefect Continuous&lt;/em&gt;&lt;/div&gt;&lt;div align="justify"&gt;Pada kebanyakan kasus, kedua tenses ini dapat digunakan pada konteks yang sama.&lt;/div&gt;&lt;div align="justify"&gt;Contoh:&lt;/div&gt;&lt;div align="justify"&gt;I have lived in Los Angeles since 1985.&lt;/div&gt;&lt;div align="justify"&gt;I have been living in Los Angeles since 1985.&lt;/div&gt;&lt;div align="justify"&gt;&lt;/div&gt;&lt;div align="justify"&gt;&lt;/div&gt;&lt;div align="justify"&gt;&lt;/div&gt;&lt;div align="justify"&gt;Ada beberapa situasi dimana penggunaan salah satu tenses ini lebih baik dari tenses lainnya.&lt;/div&gt;&lt;div align="justify"&gt;Untuk menekankan durasi sebuah tindakan, gunakan Present Perfect Continuous.&lt;/div&gt;&lt;div align="justify"&gt;Contoh:I’ve been trading cars for 10 years.&lt;/div&gt;&lt;div align="justify"&gt;&lt;/div&gt;&lt;div align="justify"&gt;&lt;/div&gt;&lt;div align="justify"&gt;Untuk menekankan hasil sebuah tindakan, gunakan bentuk Present Perfect.&lt;/div&gt;&lt;div align="justify"&gt;Contoh:&lt;/div&gt;&lt;div align="justify"&gt;He has just came back from work.&lt;/div&gt;&lt;div align="justify"&gt;I have finished my workout.&lt;/div&gt;&lt;div align="justify"&gt;I’ve bought a new car.&lt;/div&gt;&lt;div align="justify"&gt;&lt;strong&gt;Tip:&lt;/strong&gt; Ada beberapa kata yang memberikan indikasi tenses mana yang harus digunakan.&lt;/div&gt;&lt;div align="justify"&gt;&lt;/div&gt;&lt;div align="justify"&gt;&lt;/div&gt;&lt;div align="justify"&gt;Contoh sederhana “never” dan “ever” mengindikasikan penggunaan present perfect:&lt;/div&gt;&lt;div align="justify"&gt;Kimberly has never had an accident.&lt;/div&gt;&lt;div align="justify"&gt;Have you ever seen an alien?&lt;/div&gt;&lt;div align="justify"&gt;&lt;/div&gt;&lt;div align="justify"&gt;&lt;/div&gt;&lt;div align="justify"&gt;&lt;/div&gt;&lt;div align="justify"&gt;“how long”,“since” dan “for” mengindikasikan penggunaan Present Perfect Continuous. Contoh:&lt;/div&gt;&lt;div align="justify"&gt;How long have you been staring at this car?&lt;/div&gt;&lt;div align="justify"&gt;I have been fishing for 2 hours.&lt;/div&gt;&lt;div align="justify"&gt;&lt;/div&gt;&lt;div align="justify"&gt;&lt;/div&gt;&lt;div align="justify"&gt;&lt;/div&gt;&lt;div align="justify"&gt;Bentuk (Present Perfect Continuous terdiri dari sebuah subjek, sebuah kata kerja -ing dan dua kata kerja bantu ”been” dan “have“):&lt;/div&gt;&lt;div align="justify"&gt;Subject + has/have + been + verb+ing.&lt;/div&gt;&lt;div align="justify"&gt;Contoh:&lt;/div&gt;&lt;div align="justify"&gt;She has been crying in her room for half an hour now&lt;/div&gt;&lt;div align="justify"&gt;We‘ve been waiting for a good offer to buy a car since March&lt;/div&gt;&lt;div align="justify"&gt;I‘ve been waiting for you to come (but now you’re back!)&lt;/div&gt;&lt;div align="justify"&gt;&lt;/div&gt;&lt;div align="justify"&gt;&lt;/div&gt;&lt;div align="justify"&gt;Untuk bentuk negatif ditambahkan not.&lt;/div&gt;&lt;div align="justify"&gt;Contoh:&lt;/div&gt;&lt;div align="justify"&gt;I haven’t been sleeping very well recently&lt;/div&gt;&lt;div align="justify"&gt;I haven’t been waiting for 50 minutes&lt;/div&gt;&lt;div align="justify"&gt;John hasn’t been using his A drive for a long time&lt;/div&gt;&lt;div align="justify"&gt;&lt;/div&gt;&lt;div align="justify"&gt;&lt;/div&gt;&lt;div align="justify"&gt;&lt;/div&gt;&lt;div align="justify"&gt;Untuk bentuk bertanya kita menukar posisi have/has dengan subjek.&lt;/div&gt;&lt;div align="justify"&gt;Contoh:Have you been running?&lt;/div&gt;&lt;div align="justify"&gt;Has Tom been walking the dog?&lt;/div&gt;&lt;div align="justify"&gt;How long have you been learning English?&lt;/div&gt;&lt;div align="justify"&gt;What have you been doing there?&lt;/div&gt;&lt;div class="blogger-post-footer"&gt;&lt;img width='1' height='1' src='https://blogger.googleusercontent.com/tracker/1300399623975330669-942513908241187711?l=asmarnovira.blogspot.com' alt='' /&gt;&lt;/div&gt;</content><link rel='replies' type='application/atom+xml' href='http://asmarnovira.blogspot.com/feeds/942513908241187711/comments/default' title='Poskan Komentar'/><link rel='replies' type='text/html' href='http://asmarnovira.blogspot.com/2009/11/tesis-simple-present-bentuk-negatif.html#comment-form' title='0 Komentar'/><link rel='edit' type='application/atom+xml' href='http://www.blogger.com/feeds/1300399623975330669/posts/default/942513908241187711'/><link rel='self' type='application/atom+xml' href='http://www.blogger.com/feeds/1300399623975330669/posts/default/942513908241187711'/><link rel='alternate' type='text/html' href='http://asmarnovira.blogspot.com/2009/11/tesis-simple-present-bentuk-negatif.html' title='TESIS'/><author><name>IRA</name><uri>http://www.blogger.com/profile/04417846760028408557</uri><email>noreply@blogger.com</email><gd:image rel='http://schemas.google.com/g/2005#thumbnail' width='16' height='16' src='http://img2.blogblog.com/img/b16-rounded.gif'/></author><thr:total>0</thr:total></entry><entry><id>tag:blogger.com,1999:blog-1300399623975330669.post-4203232460414364306</id><published>2009-11-13T20:14:00.000-08:00</published><updated>2009-11-13T20:16:04.035-08:00</updated><title type='text'>X.25</title><content type='html'>&lt;h2 style="text-align: justify;" class="title"&gt; &lt;a href="http://indrochubby.blogspot.com/2009/11/x25.html"&gt;X.25&lt;/a&gt; &lt;/h2&gt;&lt;div style="text-align: justify;"&gt;     &lt;/div&gt;&lt;p style="text-align: justify;" class="MsoNormal"&gt;&lt;span style=""&gt;X.25 merupakan sebuah protokol yang didefinisikan oleh CCITT (International Telegraph and Telephone Consultative Committee) yang sekarang berganti nama menjadi ITU (International Telecommunications &lt;st1:place st="\&amp;quot;on\&amp;quot;"&gt;Union&lt;/st1:place&gt;). Dalam standar yang diterbitkan oleh ITU, masing-masing standar diberikan kode tertentu untuk merepresentasikan sebuah domain tertentu. Misalnya standar dengan kode “X.” menyatakan standar untuk domain PSDN (Packet Switched Data Network), kode “V.” menyatakan standar untuk domain PSTN (Public Switched Telephone Network), dan kode “I.” yang menyatakan standar untuk domain ISDN (Integrated Services Digital Network).&lt;/span&gt;&lt;i style=""&gt;&lt;span style=""&gt;&lt;o:p&gt;&lt;/o:p&gt;&lt;/span&gt;&lt;/i&gt;&lt;/p&gt;&lt;div style="text-align: justify;"&gt; &lt;/div&gt;&lt;p style="text-align: justify;" class="MsoNormal"&gt;&lt;span style="" lang="ES"&gt;Perbandingan protokol X.25 dengan model OSI adalah seperti ditunjukan pada gambar berikut:&lt;o:p&gt;&lt;/o:p&gt;&lt;/span&gt;&lt;/p&gt;&lt;div style="text-align: justify;"&gt;&lt;img src="http://www.ristinet.com/artikel/x.25_1.gif" /&gt;&lt;/div&gt;&lt;p style="text-align: justify;"&gt;&lt;strong&gt;&lt;span style="font-size: 85%;"&gt;&lt;span style=""&gt;Gambar &lt;/span&gt;&lt;span style=""&gt;&lt;span style=""&gt;1&lt;/span&gt;&lt;/span&gt;&lt;span style=""&gt;. Protokol X.25 terhadap model OSI&lt;/span&gt;&lt;/span&gt;&lt;/strong&gt;&lt;/p&gt;&lt;div style="text-align: justify;"&gt; &lt;/div&gt;&lt;p style="text-align: justify;" class="MsoNormal"&gt;&lt;span style="" lang="ES"&gt;Walapun ITU merupakan organisasi internasional yang berkutat dengan standar namun badan resmi dunia untuk standar adalah ISO (&lt;i style=""&gt;International&lt;/i&gt; &lt;i style=""&gt;Standard Organization)&lt;/i&gt;. Standar yang dikeluarkan oleh ITU hanya bersifat rekomendasi dan tidak mengikat untuk dilaksanakan.&lt;o:p&gt;&lt;/o:p&gt;&lt;/span&gt;&lt;/p&gt;&lt;div style="text-align: justify;"&gt; &lt;/div&gt;&lt;p style="text-align: justify;" class="MsoNormal"&gt;&lt;span style="" lang="NL"&gt;Protokol X.25 merupakan protokol yang didefinisikan untuk antarmuka antara DTE dan jaringan PSDN. Di dalamnya hanya mengatur bagaimana sebuah DTE berkomunikasi dengan DCE. Protokol X.25 tidak mengatur bagaimana sebuah data paket X.25 ditransmisikan dari satu titik ke titik lain melalui jaringan data. Fitur yang cukup penting dalam protokol X.25 adalah bahwa protokol ini merupakan sebuah &lt;i style=""&gt;reliable service&lt;/i&gt; yang berarti bahwa data akan dikirimkan dengan jaminan bahwa urutan data akan sama dengan ketika dikirimkan.&lt;o:p&gt;&lt;/o:p&gt;&lt;/span&gt;&lt;/p&gt;&lt;div style="text-align: justify;"&gt; &lt;/div&gt;&lt;p style="text-align: justify;" class="MsoNormal"&gt;&lt;span style="" lang="ES"&gt;Sebagaimana dapat dilihat pada gambar 1 bahwa X.25 berada pada layer 3 yaitu layer &lt;i style=""&gt;network&lt;/i&gt;. &lt;/span&gt;&lt;span style=""&gt;Pada layer 2 sendiri, digunakan HDLC (&lt;i style=""&gt;High Level Data Link Control&lt;/i&gt;) LAPB (&lt;i style=""&gt;Link Access Procedure Balanced&lt;/i&gt;). HDLC LAPB (biasanya disebut dengan HDLC saja atau LAPB saja) merupakan protokol yang &lt;i style=""&gt;reliable&lt;/i&gt;. Di dalamnya terdapat kemampuan &lt;i style=""&gt;error detection&lt;/i&gt; dan &lt;i style=""&gt;error correction&lt;/i&gt; serta menjamin bahwa data yang diterima akan sama urutannya dengan ketikan dikirimkan.&lt;o:p&gt;&lt;/o:p&gt;&lt;/span&gt;&lt;/p&gt;&lt;div style="text-align: justify;"&gt; &lt;/div&gt;&lt;p style="text-align: justify;" class="MsoNormal"&gt;&lt;span style="" lang="DE"&gt;Struktur frame HDLC adalah seperti ditunjukan dalam gambar berikut:&lt;o:p&gt;&lt;/o:p&gt;&lt;/span&gt;&lt;/p&gt;&lt;div style="text-align: justify;"&gt;&lt;img src="http://www.ristinet.com/artikel/x.25_2.gif" /&gt;&lt;/div&gt;&lt;p style="text-align: justify;"&gt;&lt;b style=""&gt;&lt;span style=""&gt;Gambar &lt;span style="" seq="" gambar="" arabic=""&gt;&lt;span style=""&gt;2&lt;/span&gt;&lt;/span&gt;. Struktur frame HDLC&lt;/span&gt;&lt;/b&gt;&lt;span style=""&gt;&lt;o:p&gt; &lt;/o:p&gt;&lt;/span&gt;&lt;/p&gt;&lt;div style="text-align: justify;"&gt; &lt;/div&gt;&lt;p style="text-align: justify;" class="MsoNormal"&gt;&lt;span style=""&gt;Paket X.25 akan dibungkus dalam frame HDLC, tepatnya menempati field&lt;i style=""&gt; information&lt;/i&gt;. Paket X.25 terdiri dari 3 byte &lt;i style=""&gt;header&lt;/i&gt;, dan tergantung dari tipe paket, &lt;i style=""&gt;header&lt;/i&gt; ini akan diikuti oleh field data.&lt;o:p&gt;&lt;/o:p&gt;&lt;/span&gt;&lt;/p&gt;&lt;div style="text-align: justify;"&gt; &lt;/div&gt;&lt;p style="text-align: justify;" class="MsoNormal"&gt;&lt;span style="" lang="DE"&gt;Struktur paket X.25 adalah seperti ditunjukan pada gambar berikut:&lt;o:p&gt;&lt;/o:p&gt;&lt;/span&gt;&lt;/p&gt;&lt;p style="text-align: justify;"&gt;&lt;strong&gt;&lt;span style="font-size: 85%;"&gt;&lt;span style=""&gt;Gambar &lt;/span&gt;&lt;span style=""&gt;&lt;span style=""&gt;3&lt;/span&gt;&lt;/span&gt;&lt;span style=""&gt;. Format packet X.25&lt;/span&gt;&lt;/span&gt;&lt;/strong&gt;&lt;/p&gt;&lt;div style="text-align: justify;"&gt; &lt;/div&gt;&lt;p style="text-align: justify;" class="MsoNormal"&gt;&lt;span style=""&gt;Sebelum dua titik saling berkomunikasi dengan menggunakan protokol X.25 maka kedua titik ini harus terlehih dahulu membangun hubungan. Terdapat dua jenis mode dalam X.25 untuk membangun hubungan yaitu:&lt;o:p&gt;&lt;/o:p&gt;&lt;/span&gt;&lt;/p&gt;&lt;div style="text-align: justify;"&gt; &lt;/div&gt;&lt;p style="text-align: justify;" class="MsoNormal" 0in="" l2="" level1="" list=""&gt;&lt;span style="font-family: Verdana;"&gt;&lt;span style=""&gt;&lt;span style=""&gt;·&lt;span style="font-size: 85%;"&gt;&lt;span style="" 7pt="" times="" new=""&gt;         &lt;/span&gt;&lt;/span&gt;&lt;/span&gt;&lt;/span&gt;&lt;b style=""&gt;&lt;span style=""&gt;SVC&lt;/span&gt;&lt;/b&gt;&lt;span style=""&gt; (&lt;i style=""&gt;Switched Virtual Channel&lt;/i&gt;), Dalam mode ini &lt;i style=""&gt;node&lt;/i&gt; yang berinisiatif untuk membangun koneksi harus mengirimkan sinyal &lt;i style=""&gt;call request&lt;/i&gt; ke &lt;i style=""&gt;node&lt;/i&gt; tujuan. Bila diterima maka &lt;i style=""&gt;node&lt;/i&gt; tujuan akan mengirimkan sinyal &lt;i style=""&gt;call accepted&lt;/i&gt; dan sebaliknya bila ditolak maka &lt;i style=""&gt;node&lt;/i&gt; tujuan akan mengirimkan sinyal &lt;i style=""&gt;call rejected&lt;/i&gt;. Analogi dari mode koneksi ini adalah komunikasi melalui telepon, bila seseorang ingin menghubungi orang lain maka orang tersebut terlebih dahulu harus men-&lt;i style=""&gt;dial&lt;/i&gt; nomor tertentu. Diterima tidaknya panggilan ini tergantung dari titik tujuan. V&lt;i style=""&gt;irtual channel&lt;/i&gt; yang digunakan dalam mode SVC adalah &lt;i style=""&gt;per call basis&lt;/i&gt;.&lt;o:p&gt;&lt;/o:p&gt;&lt;/span&gt;&lt;/span&gt;&lt;/p&gt;&lt;div style="text-align: justify;"&gt; &lt;/div&gt;&lt;p style="text-align: justify;" class="MsoNormal" 0in="" l2="" level1="" list=""&gt;&lt;span style="font-family: Verdana;"&gt;&lt;span style=""&gt;&lt;span style=""&gt;·&lt;span style="font-size: 85%;"&gt;&lt;span style="" 7pt="" times="" new=""&gt;         &lt;/span&gt;&lt;/span&gt;&lt;/span&gt;&lt;/span&gt;&lt;b style=""&gt;&lt;span style=""&gt;PVC&lt;/span&gt;&lt;/b&gt;&lt;span style=""&gt; (&lt;i style=""&gt;Permanent Virtual Channel&lt;/i&gt;), Dalam mode ini &lt;i style=""&gt;virtual channel&lt;/i&gt; yang digunakan bersifat &lt;i style=""&gt;dedicated&lt;/i&gt; dan tidak perlu adanya ritual &lt;i style=""&gt;call setup&lt;/i&gt;. Analogi dari mode ini ini adalah saluran &lt;i style=""&gt;leased line&lt;/i&gt; dimana secara &lt;i style=""&gt;end-t-end&lt;/i&gt; hubungan fisik dan logik sudah terbentuk. &lt;/span&gt;&lt;/span&gt;&lt;span style="font-family: Verdana; font-size: 85%;"&gt;&lt;b style=""&gt;&lt;o:p&gt; &lt;/o:p&gt;&lt;/b&gt;&lt;/span&gt;&lt;/p&gt;&lt;div style="text-align: justify;"&gt; &lt;/div&gt;&lt;p style="text-align: justify;" class="MsoNormal"&gt;&lt;b style=""&gt;&lt;span style="" lang="ES"&gt;Antarmuka X.25 Pada Central TDM&lt;o:p&gt;&lt;/o:p&gt;&lt;/span&gt;&lt;/b&gt;&lt;/p&gt;&lt;div style="text-align: justify;"&gt; &lt;/div&gt;&lt;p style="text-align: justify;" class="MsoNormal"&gt;&lt;span style=""&gt;Sentral yang dimiliki oleh PT TELKOM sangat beragam dari sentral dengan kapasitas kecil hingga sentral dengan kapasitas besar. Tidak semua sentral TDM yang dimiliki oleh PT TELKOM&lt;span style=""&gt;  &lt;/span&gt;memiliki antarmuka X.25. Sebagian besar dari sentral-sentral ini hanya menyediakan antarmuka asinkron (RS-232) untuk keperluan &lt;i style=""&gt;operation &amp;amp; maintenance&lt;/i&gt; (O/M). Kondisi saat ini sebagian besar terminal OMT dari sentral-sentral ini terhubung ke sentral menggunakan kabel serial RS-232.&lt;o:p&gt;&lt;/o:p&gt;&lt;/span&gt;&lt;/p&gt;&lt;div style="text-align: justify;"&gt; &lt;/div&gt;&lt;p style="text-align: justify;" class="MsoNormal"&gt;&lt;span style=""&gt;Antarmuka serial ini memiliki kecepatan maksimum dalam mentransfer data adalah sebesar 9600 bps dan cukup cepat bila hanya digunakan oleh satu &lt;i style=""&gt;user&lt;/i&gt; saja. &lt;i style=""&gt;User&lt;/i&gt; yang menggunakan OMT biasanya hanya menggunakan terminal ini untuk memasukan beberapa &lt;i style=""&gt;command&lt;/i&gt; dengan respon yang tidak membutuhkan &lt;i style=""&gt;bandwidth&lt;/i&gt; terlalu besar.&lt;o:p&gt;&lt;/o:p&gt;&lt;/span&gt;&lt;/p&gt;&lt;div style="text-align: justify;"&gt; &lt;/div&gt;&lt;p style="text-align: justify;" class="MsoNormal"&gt;&lt;span style=""&gt;Sejalan dengan kondisi bisnis saat ini yang sangat kompetitif, kebutuhan untuk memberikan layanan yang cepat dan akurat kepada pelanggan sangatlah mendesak. Implementasi kebutuhan ini secara kongkret di lapangan adalah telah bermunculannya berbagai aplikasi hasil inovasi dari personal operasional untuk otomatisasi beberapa proses yang melibatkan perangkat sentral saat ini. Beberapa contoh aplikasi ini adalah sistem monitoring sentral, pengukuran trafik telepon, buka tutup pelanggan, dan lain-lain. Semua aplikasi ini menggunakan gerbang yang sama dalam melakukan akses ke sentral yaitu antarmuka OMT. Perangkat OMT yang sebelumnya hanya digunakan oleh &lt;i style=""&gt;single user&lt;/i&gt; saat ini sudah diganti dengan perangkat &lt;i style=""&gt;mediation device&lt;/i&gt; yang memungkinkan sentral diakses oleh beberapa user dalam waktu yang bersamaan. Kecepatan antarmuka asinkron yang hanya 9600 bps dirasakan kurang untuk dapat menangani banyak &lt;i style=""&gt;user &lt;/i&gt;dalam waktu yang bersamaan.&lt;o:p&gt;&lt;/o:p&gt;&lt;/span&gt;&lt;/p&gt;&lt;div style="text-align: justify;"&gt; &lt;/div&gt;&lt;p style="text-align: justify;" class="MsoNormal"&gt;&lt;span style=""&gt;Untuk sentral yang tidak memiliki antarmuka X.25 mungkin tidak memiliki pilihan lain selain menggunakan antarmuka asinkron walaupun kecepatan transfer datanya terbatas. Namun untuk sentral yang sudah tersedia antarmuka X.25, alangkah baiknya bila antarmuka ini diberdayakan karena antarmuka X.25 memiliki kecepatan maksimum sebesar 64 kbps. Kecepatan ini dirasakan cukup memadai untuk keperluan akses ke perangkat sentral secara bersama-sama dalam satu waktu. &lt;span style=""&gt; &lt;/span&gt;Selain itu saat ini antarmuka X.25 hanya digunakan untuk transfer file terutama untuk file-file &lt;i style=""&gt;billing&lt;/i&gt;, itupun hanya menggunakan sebuah &lt;i style=""&gt;channel&lt;/i&gt; dari beberapa &lt;i style=""&gt;channel&lt;/i&gt; yang tersedia dalam X.25. Sebagaimana diketahui bahwa protokol X.25 memiliki kemampuan untuk mengirimkan data melalui &lt;i style=""&gt;logical channel&lt;/i&gt; dalam sebuah &lt;i style=""&gt;physical channel&lt;/i&gt; yang sama. Hal ini memungkinkan beberapa aplikasi yang membutuhkan akses ke perangkat sentral untuk melakukannya tanpa harus saling mengganggu karena masing-masing aplikasi tersebut menggunakan &lt;i style=""&gt;channel&lt;/i&gt; komunikasi tersendiri.&lt;o:p&gt;&lt;/o:p&gt;&lt;/span&gt;&lt;/p&gt;&lt;div style="text-align: justify;"&gt; &lt;/div&gt;&lt;p style="text-align: justify;" class="MsoNormal"&gt;&lt;span style=""&gt;Bagaimanapun protokol X.25 memiliki beberapa kelebihan dan kekurangan yang perlu dijadikan sebagai bahan pertimbangan dalam implementasi protokol X.25. Beberapa kelebihan dan kekurangan tersebut adalah sebagai berikut:&lt;o:p&gt;&lt;/o:p&gt;&lt;/span&gt;&lt;/p&gt;&lt;div style="text-align: justify;"&gt; &lt;/div&gt;&lt;p style="text-align: justify;" class="MsoNormal"&gt;&lt;b style=""&gt;&lt;span style=""&gt;Kelebihan:&lt;o:p&gt;&lt;/o:p&gt;&lt;/span&gt;&lt;/b&gt;&lt;/p&gt;&lt;div style="text-align: justify;"&gt; &lt;/div&gt;&lt;p style="text-align: justify;" class="MsoNormal" 0in="" l1="" level1="" list=""&gt;&lt;span style="font-family: Verdana;"&gt;&lt;span style=""&gt;&lt;span style=""&gt;·&lt;span style="font-size: 85%;"&gt;&lt;span style="" 7pt="" times="" new=""&gt;         &lt;/span&gt;&lt;/span&gt;&lt;/span&gt;&lt;/span&gt;&lt;span style=""&gt;Protokol X.25 memiliki kecepatan yang lebih tinggi dibanding RS-232 (64 kbps dibanding 9600 bps).&lt;o:p&gt;&lt;/o:p&gt;&lt;/span&gt;&lt;/span&gt;&lt;/p&gt;&lt;div style="text-align: justify;"&gt; &lt;/div&gt;&lt;p style="text-align: justify;" class="MsoNormal" 0in="" l1="" level1="" list=""&gt;&lt;span style="font-family: Verdana;"&gt;&lt;span style=""&gt;&lt;span style=""&gt;·&lt;span style="font-size: 85%;"&gt;&lt;span style="" 7pt="" times="" new=""&gt;         &lt;/span&gt;&lt;/span&gt;&lt;/span&gt;&lt;/span&gt;&lt;span style=""&gt;Protokol X.25 memiliki kemampuan untuk menyediakan &lt;i style=""&gt;logical channel&lt;/i&gt; per aplikasi.&lt;o:p&gt;&lt;/o:p&gt;&lt;/span&gt;&lt;/span&gt;&lt;/p&gt;&lt;div style="text-align: justify;"&gt; &lt;/div&gt;&lt;p style="text-align: justify;" class="MsoNormal" 0in="" l1="" level1="" list=""&gt;&lt;span style="font-family: Verdana;"&gt;&lt;span style=""&gt;&lt;span style=""&gt;·&lt;span style="font-size: 85%;"&gt;&lt;span style="" 7pt="" times="" new=""&gt;         &lt;/span&gt;&lt;/span&gt;&lt;/span&gt;&lt;/span&gt;&lt;span style=""&gt;Pendudukan &lt;i style=""&gt;logical channel&lt;/i&gt; dapat dilakukan secara permanen dengan mode PVC (&lt;i style=""&gt;Permanent Virtual Channel&lt;/i&gt;) maupun temporary dengan mode SVC (&lt;i style=""&gt;Switched Virtual Channel&lt;/i&gt;) disesuaikan dengan kebutuhan.&lt;o:p&gt;&lt;/o:p&gt;&lt;/span&gt;&lt;/span&gt;&lt;/p&gt;&lt;div style="text-align: justify;"&gt; &lt;/div&gt;&lt;p style="text-align: justify;" class="MsoNormal" 0in="" l1="" level1="" list=""&gt;&lt;span style="font-family: Verdana;"&gt;&lt;span style=""&gt;&lt;span style=""&gt;·&lt;span style="font-size: 85%;"&gt;&lt;span style="" 7pt="" times="" new=""&gt;         &lt;/span&gt;&lt;/span&gt;&lt;/span&gt;&lt;/span&gt;&lt;span style=""&gt;Data transfer pada X.25 bersifat &lt;i style=""&gt;reliable&lt;/i&gt;, data dijamin bahwa urutan penerimaan akan sama dengan waktu data dikirimkan.&lt;o:p&gt;&lt;/o:p&gt;&lt;/span&gt;&lt;/span&gt;&lt;/p&gt;&lt;div style="text-align: justify;"&gt; &lt;/div&gt;&lt;p style="text-align: justify;" class="MsoNormal" 0in="" l1="" level1="" list=""&gt;&lt;span style="font-family: Verdana;"&gt;&lt;span style=""&gt;&lt;span style=""&gt;·&lt;span style="font-size: 85%;"&gt;&lt;span style="" 7pt="" times="" new=""&gt;         &lt;/span&gt;&lt;/span&gt;&lt;/span&gt;&lt;/span&gt;&lt;span style=""&gt;Protokol X.25 memiliki kemampuan &lt;i style=""&gt;error detection&lt;/i&gt; dan &lt;i style=""&gt;error correction&lt;/i&gt;.&lt;o:p&gt;&lt;/o:p&gt;&lt;/span&gt;&lt;/span&gt;&lt;/p&gt;&lt;div style="text-align: justify;"&gt; &lt;/div&gt;&lt;p style="text-align: justify;" class="MsoNormal"&gt;&lt;b style=""&gt;&lt;span style="" lang="ES"&gt;Kekurangan:&lt;o:p&gt;&lt;/o:p&gt;&lt;/span&gt;&lt;/b&gt;&lt;/p&gt;&lt;div style="text-align: justify;"&gt; &lt;/div&gt;&lt;p style="text-align: justify;" class="MsoNormal" 0in="" l0="" level1="" list=""&gt;&lt;span style="font-family: Verdana;"&gt;&lt;span style="" lang="ES"&gt;&lt;span style=""&gt;·&lt;span style="font-size: 85%;"&gt;&lt;span style="" 7pt="" times="" new=""&gt;         &lt;/span&gt;&lt;/span&gt;&lt;/span&gt;&lt;/span&gt;&lt;span style="" lang="ES"&gt;Tidak semua sentral memiliki antarmuka X.25. Sehingga diperlukan pengadaan modul X.25 dengan syarat bahwa sentral sudah &lt;i style=""&gt;support&lt;/i&gt; X.25.&lt;o:p&gt;&lt;/o:p&gt;&lt;/span&gt;&lt;/span&gt;&lt;/p&gt;&lt;div style="text-align: justify;"&gt; &lt;/div&gt;&lt;p style="text-align: justify;" class="MsoNormal" 0in="" l0="" level1="" list=""&gt;&lt;span style="font-family: Verdana;"&gt;&lt;span style="" lang="ES"&gt;&lt;span style=""&gt;·&lt;span style="font-size: 85%;"&gt;&lt;span style="" 7pt="" times="" new=""&gt;         &lt;/span&gt;&lt;/span&gt;&lt;/span&gt;&lt;/span&gt;&lt;span style="" lang="ES"&gt;Untuk pengembangan aplikasi berbasis protokol X.25 membutuhkan biaya yang relatif lebih besar dibanding dengan RS-232 terutama untuk pembelian &lt;i style=""&gt;card adapter&lt;/i&gt; X.25.&lt;o:p&gt;&lt;/o:p&gt;&lt;/span&gt;&lt;/span&gt;&lt;/p&gt;&lt;div style="text-align: justify;"&gt; &lt;/div&gt;&lt;p style="text-align: justify;" class="MsoNormal" 0in="" l0="" level1="" list=""&gt;&lt;span style="font-family: Verdana;"&gt;&lt;span style="" lang="ES"&gt;&lt;span style=""&gt;·&lt;span style="font-size: 85%;"&gt;&lt;span style="" 7pt="" times="" new=""&gt;         &lt;/span&gt;&lt;/span&gt;&lt;/span&gt;&lt;/span&gt;&lt;span style="" lang="ES"&gt;Untuk komunikasi data antara sentral dengan perangkat OMT beberapa sentral diidentifikasi menggunakan protokol &lt;i style=""&gt;proprietary&lt;/i&gt; vendor tertentu yang berjalan di atas protokol X.25.&lt;/span&gt;&lt;/span&gt;&lt;/p&gt;&lt;div style="text-align: justify;"&gt; &lt;/div&gt;&lt;p style="text-align: justify;" class="MsoNormal"&gt;&lt;b style=""&gt;&lt;span style="" lang="ES"&gt;Pengembangan Mediation Device Berbasis Protokol X.25&lt;o:p&gt;&lt;/o:p&gt;&lt;/span&gt;&lt;/b&gt;&lt;/p&gt;&lt;div style="text-align: justify;"&gt; &lt;/div&gt;&lt;p style="text-align: justify;" class="MsoNormal"&gt;&lt;span style="" lang="ES"&gt;Penggunaan antarmuka X.25 sebagai pintu akses ke sentral memang sangat menarik mengingat kelebihan-kelebihan protokol X.25 dibanding dengan antarmuka RS-232 yang saat ini banyak digunakan di lapangan. Optimalisasi perangkat yang dimiliki oleh TELKOM khususnya pemanfaatan interface X.25 akan sangat membantu operasional di lapangan dan meningkatkan kinerja.&lt;o:p&gt;&lt;/o:p&gt;&lt;/span&gt;&lt;/p&gt;&lt;div style="text-align: justify;"&gt; &lt;/div&gt;&lt;p style="text-align: justify;" class="MsoNormal"&gt;&lt;span style="" lang="ES"&gt;Dengan melihat berbagai nilai positif dari pemanfaatan antarmuka X.25 maka R&amp;amp;D Center khususnya Laboratorium TMN (&lt;i style=""&gt;Telecommunication Management Network&lt;/i&gt;) telah berinisiatif untuk mengembangkan aplikasi mediation device yang berbasis protokol X.25. Beberapa hal yang dapat dicapai dengan kegiatan pengembangan &lt;i style=""&gt;mediation device&lt;/i&gt; X.25 ini adalah:&lt;o:p&gt;&lt;/o:p&gt;&lt;/span&gt;&lt;/p&gt;&lt;div style="text-align: justify;"&gt; &lt;/div&gt;&lt;p style="text-align: justify;" class="MsoNormal" 0in="" l3="" level1="" list=""&gt;&lt;span style="font-family: Verdana;"&gt;&lt;span style="" lang="ES"&gt;&lt;span style=""&gt;·&lt;span style="font-size: 85%;"&gt;&lt;span style="" 7pt="" times="" new=""&gt;         &lt;/span&gt;&lt;/span&gt;&lt;/span&gt;&lt;/span&gt;&lt;span style="" lang="ES"&gt;Mengoptimalkan perangkat/modul yang telah dimiliki oleh TELKOM.&lt;o:p&gt;&lt;/o:p&gt;&lt;/span&gt;&lt;/span&gt;&lt;/p&gt;&lt;div style="text-align: justify;"&gt; &lt;/div&gt;&lt;p style="text-align: justify;" class="MsoNormal" 0in="" l3="" level1="" list=""&gt;&lt;span style="font-family: Verdana;"&gt;&lt;span style="" lang="ES"&gt;&lt;span style=""&gt;·&lt;span style="font-size: 85%;"&gt;&lt;span style="" 7pt="" times="" new=""&gt;         &lt;/span&gt;&lt;/span&gt;&lt;/span&gt;&lt;/span&gt;&lt;span style="" lang="ES"&gt;Meningkatkan kinerja operasional dengan meminimalkan titik-titik yang menjadi &lt;i style=""&gt;bottleneck&lt;/i&gt; dalam penyaluran informasi.&lt;o:p&gt;&lt;/o:p&gt;&lt;/span&gt;&lt;/span&gt;&lt;/p&gt;&lt;div style="text-align: justify;"&gt; &lt;/div&gt;&lt;p style="text-align: justify;" class="MsoNormal" 0in="" l3="" level1="" list=""&gt;&lt;span style="font-family: Verdana;"&gt;&lt;span style=""&gt;&lt;span style=""&gt;·&lt;span style="font-size: 85%;"&gt;&lt;span style="" 7pt="" times="" new=""&gt;         &lt;/span&gt;&lt;/span&gt;&lt;/span&gt;&lt;/span&gt;&lt;span style=""&gt;Menyediakan&lt;i style=""&gt; interface&lt;/i&gt; standar untuk mengakses sentral (misalnya; IP based interface).&lt;o:p&gt;&lt;/o:p&gt;&lt;/span&gt;&lt;/span&gt;&lt;/p&gt;&lt;div style="text-align: justify;"&gt; &lt;/div&gt;&lt;p style="text-align: justify;" class="MsoNormal"&gt;&lt;span style=""&gt;Pada awal pelaksanaan kegiatan pengembangan tim pengembang sempat mengalami kesulitan akibat ketiadaan informasi yang berkaitan dengan interface X.25 pada sentral eksisting. Dokumentasi yang ada sebagian besar hanyalah penjelasan bagaimana untuk men-&lt;i style=""&gt;setting&lt;/i&gt; &lt;i style=""&gt;interface&lt;/i&gt; yang ada. Tidak ada sedikitpun informasi yang berkaitan dengan spesifikasi dan arsitektur &lt;i style=""&gt;interface&lt;/i&gt; yang digunakan.&lt;o:p&gt;&lt;/o:p&gt;&lt;/span&gt;&lt;/p&gt;&lt;div style="text-align: justify;"&gt; &lt;/div&gt;&lt;p style="text-align: justify;" class="MsoNormal"&gt;&lt;span style=""&gt;Sempat diambil hipotesa bahwa protokol X.25 yang digunakan oleh sentral eksisting merupakan &lt;i style=""&gt;proprietary&lt;/i&gt; vendor yang tidak mungkin untuk dibongkar. Dalam kesimpulan awal ini, komunikasi data antara sentral dengan perangkat OMT X.25 menggunakan &lt;i style=""&gt;protokol stack&lt;/i&gt; lengkap hingga layer 7. Dalam arti bahwa protokol X.25 hanyalah protokol yang menempati layer 1 hingga 3, selebihnya adalah &lt;i style=""&gt;proprietary&lt;/i&gt; vendor.&lt;o:p&gt;&lt;/o:p&gt;&lt;/span&gt;&lt;/p&gt;&lt;div style="text-align: justify;"&gt; &lt;/div&gt;&lt;p style="text-align: justify;" class="MsoNormal"&gt;&lt;span style=""&gt;Namun dengan kerjasama tim yang kompak serta dedikasi dari para anggota tim akhirnya beberapa permasalahan yang sebelumnya muncul satu per satu dapat diatasi.&lt;o:p&gt;&lt;/o:p&gt;&lt;/span&gt;&lt;/p&gt;&lt;div style="text-align: justify;"&gt; &lt;span style=""&gt;Saat ini prototipe mediation device X.25 telah selesai dikembangkan dan sedang diujicobakan (&lt;i style=""&gt;stress test&lt;/i&gt;) di STO Subang. Antarmuka X.25 pada sentral Subang ini telah diintegrasikan dengan INMS-st (&lt;i style=""&gt;Integrated Network Management System for Switching &amp;amp; Transmission&lt;/i&gt;) yang sudah diimplementasikan secara penuh di TELKOM DIVRE III Jabar-Banten, terutama untuk melakukan penarikan data trafik mengingat data trafik merupakan data yang selama ini memakan &lt;i style=""&gt;bandwidth&lt;/i&gt; yang cukup besar.&lt;/span&gt;&lt;br /&gt;&lt;span style=""&gt;&lt;/span&gt;&lt;/div&gt;&lt;div class="blogger-post-footer"&gt;&lt;img width='1' height='1' src='https://blogger.googleusercontent.com/tracker/1300399623975330669-4203232460414364306?l=asmarnovira.blogspot.com' alt='' /&gt;&lt;/div&gt;</content><link rel='replies' type='application/atom+xml' href='http://asmarnovira.blogspot.com/feeds/4203232460414364306/comments/default' title='Poskan Komentar'/><link rel='replies' type='text/html' href='http://asmarnovira.blogspot.com/2009/11/x25.html#comment-form' title='0 Komentar'/><link rel='edit' type='application/atom+xml' href='http://www.blogger.com/feeds/1300399623975330669/posts/default/4203232460414364306'/><link rel='self' type='application/atom+xml' href='http://www.blogger.com/feeds/1300399623975330669/posts/default/4203232460414364306'/><link rel='alternate' type='text/html' href='http://asmarnovira.blogspot.com/2009/11/x25.html' title='X.25'/><author><name>IRA</name><uri>http://www.blogger.com/profile/04417846760028408557</uri><email>noreply@blogger.com</email><gd:image rel='http://schemas.google.com/g/2005#thumbnail' width='16' height='16' src='http://img2.blogblog.com/img/b16-rounded.gif'/></author><thr:total>0</thr:total></entry><entry><id>tag:blogger.com,1999:blog-1300399623975330669.post-5125903679043899796</id><published>2009-11-11T06:13:00.000-08:00</published><updated>2009-11-11T06:15:42.789-08:00</updated><title type='text'>Frame Relay</title><content type='html'>&lt;input class="blogger-ie-hack"&gt;&lt;input class="blogger-ie-hack"&gt;&lt;p&gt;Frame Relay adalah protokol &lt;i&gt;Packet-switching&lt;/i&gt; yang menghubungkan perangkat-perangkat telekomunikasi pada satu Wide Area Network (WAN). Protokol ini bekerja pada lapisan fisik dan dat link pada model referensi data OSI. Protokol Frame Relay menggunakan struktur &lt;i&gt;Frame&lt;/i&gt; yang menyerupai LAPD, perbedaannya adalah Frame Header pada LAPD digantikan oleh field header sebesar 2 bita pada Frame Relay.&lt;/p&gt;&lt;h2&gt;&lt;span id="Keuntungan_Frame_Relay"&gt;Keuntungan Frame Relay&lt;/span&gt;&lt;/h2&gt;&lt;p&gt;Frame Relay menawarkan alternatif bagi teknologi sirkuit sewa lain seperti X.25 dan sirkuit Sewa biasa. Kunci positif teknologi ini adalah:&lt;/p&gt;&lt;p&gt;&lt;br /&gt;&lt;/p&gt;&lt;ul&gt;&lt;li&gt;Sirkuit Virtual hanya menggunakan lebar pita saat ada data yang lewat di dalamnya, banyak sirkuit virtual dapat dibangun secara bersamaan dalam satu jaringan transmisi.&lt;/li&gt;&lt;li&gt;Kehandalan saluran komunikasi dan peningkatan kemampuan penanganan error pada perangkat-perangkat telekomunikasi memungkinkan protokol Frame Relay untuk mengacuhkan Frame yang bermasalah (mengandung error) sehingga mengurangi data yang sebelumnya diperlukan untuk memproses penanganan error.&lt;/li&gt;&lt;/ul&gt;&lt;p&gt;&lt;br /&gt;&lt;/p&gt;&lt;h2&gt;&lt;span id="Standarisasi_Frame_Relay"&gt;Standarisasi Frame Relay&lt;/span&gt;&lt;/h2&gt;&lt;p&gt;Proposal awal mengenai teknologi Frame Relay sudah diajukan ke CCIT semenjak tahun 1984, namun perkembangannya saat itu tidak signifikan karena kurangnya interoperasi dan standarisasi dalam teknologi ini. Perkembangan teknologi ini dimulai di saat Cisco, Digital Equipment Corporation(DEC), Northern Telecom, dan Strata com membentuk suatu konsorsium yang berusaha mengembangkan frame relay. Selain membahas dasar-dasar protokol Frame Relay dari CCITT, konsorsium ini juga mengembangkan kemampuan protokol ini untuk berinteroperasi pada jaringan yang lebih rumit. Kemampuan ini di kemudian hari disebut Local Management Interface (LMI).&lt;/p&gt;&lt;hr class="more"&gt;&lt;p&gt;&lt;br /&gt;&lt;/p&gt;&lt;p&gt;&lt;br /&gt;&lt;/p&gt;&lt;h2&gt;&lt;span id="Format_Frame_Relay"&gt;Format Frame Relay&lt;/span&gt;&lt;/h2&gt;&lt;div class="thumb tright"&gt;&lt;div class="thumbinner" style="width: 352px;"&gt;&lt;p&gt;&lt;a class="image" href="http://id.wikipedia.org/wiki/Berkas:FormatFrameRelay.jpg"&gt;&lt;img alt="" class="thumbimage" src="http://upload.wikimedia.org/wikipedia/id/thumb/4/49/FormatFrameRelay.jpg/350px-FormatFrameRelay.jpg" width="350" height="96" /&gt;&lt;/a&gt; &lt;/p&gt;&lt;div class="thumbcaption"&gt;&lt;div class="magnify"&gt;&lt;p&gt;&lt;a class="internal" href="http://id.wikipedia.org/wiki/Berkas:FormatFrameRelay.jpg" title="Perbesar"&gt;&lt;img alt="" src="http://id.wikipedia.org/skins-1.5/common/images/magnify-clip.png" width="15" height="11" /&gt;&lt;/a&gt;&lt;/p&gt;&lt;/div&gt;&lt;p&gt;Struktur Frame pada Frame Relay&lt;/p&gt;&lt;/div&gt;&lt;/div&gt;&lt;/div&gt;&lt;p&gt;Format Frame Relay terdiri atas bagian-bagian sebagai berikut:&lt;/p&gt;&lt;h3&gt;&lt;span id="Flags"&gt;Flags&lt;/span&gt;&lt;/h3&gt;&lt;p&gt;Membatasi awal dan akhir suatu frame. Nilai field ini selalu sama dan dinyatakan dengan bilanganHexadesimal 7E atau 0111 1110 dalam format biner Untuk mematikan bilangan tersebut tidak muncul pada bagian frame lainnya, digunakan prosedur Bit-stuffing dan Bit-destuffing.&lt;/p&gt;&lt;h3&gt;&lt;span id="Address"&gt;Address&lt;/span&gt;&lt;/h3&gt;&lt;p&gt;Terdiri dari beberapa informasi:&lt;/p&gt;&lt;ol&gt;&lt;li&gt;Data Link Connection Identifier (DLCI), terdiri dari 10 bita, bagian pokok dari header Frame Relay dan merepresentasikan koneksi virtual antara DTE dan Frame Relay. Tiap koneksi virtual memiliki 1 DLCI yang unik.&lt;/li&gt;&lt;li&gt;Extended Address (EA), menambah kemungkinan pengalamatan Transmisi&lt;/li&gt;&lt;li&gt;data dengan menambahkan 1 bit untuk pengalamatan&lt;/li&gt;&lt;li&gt;C/R, menentukan apakah frame ini termasuk dalam kategori Perintah (Command) atau Tanggapan (Response)&lt;/li&gt;&lt;li&gt;FECN (Forward Explicit Congestion Notification), indikasi jumlah frame yang dibuang karena terjadinya kongesti di jaringan tujuan&lt;/li&gt;&lt;li&gt;BECN (Backward Explicit Congestion Notification), indikasi jumlah frame yang mengarah ke switch FR tersebut tetapi dibuang karena terjadinya kongesti di jaringan asal&lt;/li&gt;&lt;li&gt;Discard Eligibility, menandai frame yang dapat dibuang jika terjadi kongesti di jaringan.&lt;/li&gt;&lt;/ol&gt;&lt;p&gt;&lt;br /&gt;&lt;/p&gt;&lt;h3&gt;&lt;span id="Data"&gt;Data&lt;/span&gt;&lt;/h3&gt;&lt;p&gt;Terdiri dari data pada layer di atasnya yang dienkapsulasi. Tiap frame yang panjangnya bervariasi ini dapat mencapai hingga 4096 Oktet.&lt;/p&gt;&lt;h3&gt;&lt;span id="Frame_Check_Sequence"&gt;Frame Check Sequence&lt;/span&gt;&lt;/h3&gt;&lt;p&gt;Bertujuan untuk memastikan integritas data yang ditransmisikan. nilai ini dihitung perangkat sumber dan diverifikasi oleh penerima.&lt;/p&gt;&lt;h2&gt;&lt;span id="Sirkuit_Virtual"&gt;Sirkuit Virtual&lt;/span&gt;&lt;/h2&gt;&lt;div class="thumb tright"&gt;&lt;div class="thumbinner" style="width: 352px;"&gt;&lt;p&gt;&lt;a class="image" href="http://id.wikipedia.org/wiki/Berkas:2SirkitFrameRelay.jpg"&gt;&lt;img alt="" class="thumbimage" src="http://upload.wikimedia.org/wikipedia/id/thumb/9/90/2SirkitFrameRelay.jpg/350px-2SirkitFrameRelay.jpg" width="350" height="189" /&gt;&lt;/a&gt; &lt;/p&gt;&lt;div class="thumbcaption"&gt;&lt;div class="magnify"&gt;&lt;p&gt;&lt;a class="internal" href="http://id.wikipedia.org/wiki/Berkas:2SirkitFrameRelay.jpg" title="Perbesar"&gt;&lt;img alt="" src="http://id.wikipedia.org/skins-1.5/common/images/magnify-clip.png" width="15" height="11" /&gt;&lt;/a&gt;&lt;/p&gt;&lt;/div&gt;&lt;p&gt;2 jenis sirkit dalam Frame Relay: Switched Virtual Circuit dan Permanent Virtual Circuit&lt;/p&gt;&lt;/div&gt;&lt;/div&gt;&lt;/div&gt;&lt;p&gt;Frame pada Frame Relay dikirimkan ke tujuannya dengan menggunakan sirkit virtual (jalur logikal dalam jaringan). Sirkit Virtual ini bisa berupa Sirkit Virtual Permanen (Permanent Virtual Circuit / PVC), atau Sirkit Virtual Switch (Switched Virtual Circuit / SVC).&lt;/p&gt;&lt;h3&gt;&lt;span id="Permanent_Virtual_Circuit_.28PVC.29"&gt;Permanent Virtual Circuit (PVC)&lt;/span&gt;&lt;/h3&gt;&lt;p&gt;PVC adalah koneksi yang terbentuk untuk menghubungkan 2 peralatan secara terus menerus tanpa memperhitungkan apakah sedang ada komunikasi data yang terjadi di dalam sirkit tersebut. PVC tidak memerlukan proses pembangunan panggilan seperti pada SVC dan memiliki 2 status kerja:&lt;/p&gt;&lt;ol&gt;&lt;li&gt;Data Transfer, pengiriman data sedang terjadi dalam sirkit&lt;/li&gt;&lt;li&gt;Idle, koneksi antar titik masih aktif tapi tidak ada data yang dikirimkan dalam sirkit&lt;/li&gt;&lt;/ol&gt;&lt;p&gt;&lt;br /&gt;&lt;/p&gt;&lt;h3&gt;&lt;span id="Switched_Virtual_Circuit_.28SVC.29"&gt;Switched Virtual Circuit (SVC)&lt;/span&gt;&lt;/h3&gt;&lt;p&gt;SVC adalah koneksi sementara yang terbentuk hanya pada kondisi dimana pengiriman data berlangsung. Status-status dalam koneksi ini adalah:&lt;/p&gt;&lt;ol&gt;&lt;li&gt;Call Setup, hubungan antar perangkat sedang dibangun&lt;/li&gt;&lt;li&gt;Data Transfer, data dikirimkan antar perangkat dalam sirkit virtual yang telah dibangun&lt;/li&gt;&lt;li&gt;Idle, ada koneksi aktif yang telah terbentuk, tetapi tidak ada data yang lewat di dalamnya&lt;/li&gt;&lt;li&gt;Call Termination, pemutusan hubungan antar perangkat, terjadi saat waktu idle melebihi patokan yang ditentukan.&lt;/li&gt;&lt;/ol&gt;&lt;p&gt;&lt;br /&gt;&lt;/p&gt;&lt;p&gt;Sumber: Wikipedia http://id.wikipedia.org/wiki/Frame_relay&lt;/p&gt;&lt;div class="blogger-post-footer"&gt;&lt;img width='1' height='1' src='https://blogger.googleusercontent.com/tracker/1300399623975330669-5125903679043899796?l=asmarnovira.blogspot.com' alt='' /&gt;&lt;/div&gt;</content><link rel='replies' type='application/atom+xml' href='http://asmarnovira.blogspot.com/feeds/5125903679043899796/comments/default' title='Poskan Komentar'/><link rel='replies' type='text/html' href='http://asmarnovira.blogspot.com/2009/11/frame-relay.html#comment-form' title='0 Komentar'/><link rel='edit' type='application/atom+xml' href='http://www.blogger.com/feeds/1300399623975330669/posts/default/5125903679043899796'/><link rel='self' type='application/atom+xml' href='http://www.blogger.com/feeds/1300399623975330669/posts/default/5125903679043899796'/><link rel='alternate' type='text/html' href='http://asmarnovira.blogspot.com/2009/11/frame-relay.html' title='Frame Relay'/><author><name>IRA</name><uri>http://www.blogger.com/profile/04417846760028408557</uri><email>noreply@blogger.com</email><gd:image rel='http://schemas.google.com/g/2005#thumbnail' width='16' height='16' src='http://img2.blogblog.com/img/b16-rounded.gif'/></author><thr:total>0</thr:total></entry><entry><id>tag:blogger.com,1999:blog-1300399623975330669.post-5820559464736737607</id><published>2009-11-11T05:53:00.001-08:00</published><updated>2009-11-11T05:54:09.662-08:00</updated><title type='text'></title><content type='html'>MULTIPLEXING&lt;br /&gt;&lt;br /&gt;Pembagian suatu saluran komunikasi untuk dipakai secara bersama diistilahkan&lt;br /&gt;sebagai multiplexing&lt;br /&gt;Keuntungannya :&lt;br /&gt;&lt;br /&gt;* Komputer host hanya butuh satu port I/O untuk banyak terminal&lt;br /&gt;* Hanya satu line transmisi yang dibutuhkan&lt;br /&gt;&lt;br /&gt;&lt;br /&gt;Tiga teknik multiplexing&lt;br /&gt;&lt;br /&gt;· Frequency-Division Multiplexing (FDM), paling umum dipakai untuk radio&lt;br /&gt;atau TV&lt;br /&gt;&lt;br /&gt;· Time-Division Multiplexing (TDM) atau synchronous TDM, dipakai untuk&lt;br /&gt;multiplexing digital voice dan banyak digunakan untuk menggabungkan&lt;br /&gt;aliran suara digital dan aliran data&lt;br /&gt;· Peningkatan efisiensi Synchronous TDM dengan variasi sebagai berikut :&lt;br /&gt;· Statistical TDM atau&lt;br /&gt;· Asynchronous TDM atau&lt;br /&gt;&lt;br /&gt;· Intelligent TDM&lt;br /&gt;&lt;br /&gt;Bertujuan memperbaiki efisiensi synchronous TDM dengan cara menambahkan&lt;br /&gt;rangkaian yang lebih kompleks di sisi multiplexer&lt;br /&gt;&lt;br /&gt;&lt;a name="more"&gt;&lt;/a&gt;&lt;br /&gt;&lt;br /&gt;&lt;br /&gt;Frequency Division Multiplexing&lt;br /&gt;&lt;br /&gt;Tiap sinyal dimodulasikan ke dalam frekuensi carrier yang berbeda dan&lt;br /&gt;frekuensi carrier tersebut terpisah dimana bandwidth dari sinyal-sinyal tersebut&lt;br /&gt;tidak overlap&lt;br /&gt;&lt;br /&gt;Ø FDM dimungkinkan jika bandwidth media transmisi jauh lebih besar daripada&lt;br /&gt;required BW sinyal yang akan dikirim. Contoh: sistem siaran televisi, CATV,&lt;br /&gt;AMPS analog&lt;br /&gt;Ø Pada gambar di atas , ada 6 sumber sinyal input mux, kemudian masing-masing&lt;br /&gt;dimodulasi menjadi frekuensi berbeda (f1, …, f6)&lt;br /&gt;&lt;br /&gt;Ø Untuk menghindari interferensi, antar kanal dipisahkan oleh guard band (menjadi&lt;br /&gt;bagian dari spektrum yang tak terpakai)&lt;br /&gt;&lt;br /&gt;Ø Sejumlah sinyal analog atau digital [mi(t); i=1,…n] dimultiplex pada media transmisi&lt;br /&gt;yang sama.&lt;br /&gt;&lt;br /&gt;Ø Masalah yang harus diatasi sistem FDM: crosstalk dan derau intermodulasi.&lt;br /&gt;&lt;br /&gt;&lt;br /&gt;&lt;br /&gt;Synchronous Time-Division Multiplexing&lt;br /&gt;&lt;br /&gt;Ø Time division multiplexing dimungkinkan apabila data rate yang dapat dicapai&lt;br /&gt;oleh media transmisi lebih besar daripada data rate sinyal digital yang akan dikirim.&lt;br /&gt;Ø Pada gambar berikut, sejumlah sinyal digital [mi(t); i=1,…n] dimultiplex pada&lt;br /&gt;media transmisi yang sama. Data yang datang dari tiap sumber mula-mula dimasukkan&lt;br /&gt;ke buffer.&lt;br /&gt;Ø Buffer di-scan secara sekuensial untuk membentuk sinyal digital gabungan mc(t).&lt;br /&gt;Operasi scan harus berlangsung cukup cepat agar tiap buffer dapat berada dalam&lt;br /&gt;keadaan kosong sebelum data berikutnya masuk.&lt;br /&gt;Ø Jadi, besarnya laju data mc(t) harus lebih dari atau sama dengan penjumlahan&lt;br /&gt;laju data masing-masing sumber (mi(t)). Sinyal digital mc(t) dapat dikirim langsung,&lt;br /&gt;atau dilewatkan melalui modem untuk membentuk sinyal analog.&lt;br /&gt;&lt;br /&gt;&lt;br /&gt;Dalam hal ini dipakai 2 teknik interlaving :&lt;br /&gt;&lt;br /&gt;Ø Character-interlaving :&lt;br /&gt;&lt;br /&gt;1. Dipakai dengan sumber asynchronous.&lt;br /&gt;&lt;br /&gt;2. Tiap time slot mengandung 1 karakter dari data.&lt;br /&gt;&lt;br /&gt;&lt;br /&gt;Ø Bit-interlaving :&lt;br /&gt;&lt;br /&gt;1. Dipakai dengan sumber synchronous dan boleh juga dengan sumber&lt;br /&gt;asynchronous.&lt;br /&gt;&lt;br /&gt;2. Tiap time slot mengandung hanya 1 bit.&lt;br /&gt;&lt;br /&gt;&lt;br /&gt;&lt;br /&gt;Synchronous TDM :&lt;br /&gt;&lt;br /&gt;Ø Disebut synchronous karena time slot-time slot-nya di alokasikan ke sumber-sumber&lt;br /&gt;dan tertentu dimana time slot untuk tiap sumber ditransmisi. Biar bagaimanapun&lt;br /&gt;sumber mempunyai data untuk dikirim.&lt;br /&gt;&lt;br /&gt;Ø Dapat mengendalikan sumber-sumber dengan kecepatan yang berbeda-beda.&lt;br /&gt;&lt;br /&gt;&lt;br /&gt;Statistical Time-Division Multiplexing&lt;br /&gt;&lt;br /&gt;Ø Statistical TDM yang dikenal juga sebagai Asynchronous TDM dan&lt;br /&gt;Intelligent TDM, sebagai alternative synchronous TDM.&lt;br /&gt;&lt;br /&gt;Ø Pada synchronous TDM, banyak kasus time slot kosong (tidak berisi data).&lt;br /&gt;Statistical TDM memanfaatkan fakta bahwa tidak semua terminal mengirim&lt;br /&gt;data setiap saat, sehingga data rate pada saluran output lebih kecil dari&lt;br /&gt;penjumlahan data rate semua terminal.&lt;br /&gt;Ø Ada n saluran input, tetapi hanya k time slot yang tersedia pada sebuah frame&lt;br /&gt;TDM. Di mana k &lt;&gt;&lt;br /&gt;Ø Di sisi pengirim, fungsi multiplexer adalah scanning buffer, mengumpulkan&lt;br /&gt;data sampai frame penuh, kemudian mengirimkan frame tersebut.&lt;br /&gt;Ø Konsekuensi: tambahan overhead, karena diperlukan field address dan&lt;br /&gt;length. Informasi address dibutuhkan untuk memastikan bahwa data diantarkan&lt;br /&gt;kepada penerima yang tepat.&lt;br /&gt;Ø Pada gambar berikut, ada 4 sumber data yang transmit pada waktu t0, t1, t2, t3.&lt;br /&gt;Multiplexer statistik tidak mengirimkan slot kosong jika terdapat data dari user lain&lt;br /&gt;&lt;br /&gt;Sumber : http://brahm.staff.gunadarma.ac.id/Downloads/files/8932/MULTIPLEXING.doc&lt;div class="blogger-post-footer"&gt;&lt;img width='1' height='1' src='https://blogger.googleusercontent.com/tracker/1300399623975330669-5820559464736737607?l=asmarnovira.blogspot.com' alt='' /&gt;&lt;/div&gt;</content><link rel='replies' type='application/atom+xml' href='http://asmarnovira.blogspot.com/feeds/5820559464736737607/comments/default' title='Poskan Komentar'/><link rel='replies' type='text/html' href='http://asmarnovira.blogspot.com/2009/11/multiplexing-pembagian-suatu-saluran.html#comment-form' title='0 Komentar'/><link rel='edit' type='application/atom+xml' href='http://www.blogger.com/feeds/1300399623975330669/posts/default/5820559464736737607'/><link rel='self' type='application/atom+xml' href='http://www.blogger.com/feeds/1300399623975330669/posts/default/5820559464736737607'/><link rel='alternate' type='text/html' href='http://asmarnovira.blogspot.com/2009/11/multiplexing-pembagian-suatu-saluran.html' title=''/><author><name>IRA</name><uri>http://www.blogger.com/profile/04417846760028408557</uri><email>noreply@blogger.com</email><gd:image rel='http://schemas.google.com/g/2005#thumbnail' width='16' height='16' src='http://img2.blogblog.com/img/b16-rounded.gif'/></author><thr:total>0</thr:total></entry><entry><id>tag:blogger.com,1999:blog-1300399623975330669.post-8211175286910069107</id><published>2009-11-11T05:42:00.000-08:00</published><updated>2009-11-11T05:46:36.988-08:00</updated><title type='text'>TDM,FDM,CDM</title><content type='html'>MULTIPLEXING&lt;br /&gt;&lt;br /&gt;Pembagian suatu saluran komunikasi untuk dipakai secara bersama diistilahkan&lt;br /&gt;sebagai multiplexing&lt;br /&gt;Keuntungannya :&lt;br /&gt;&lt;br /&gt;* Komputer host hanya butuh satu port I/O untuk banyak terminal&lt;br /&gt;* Hanya satu line transmisi yang dibutuhkan&lt;br /&gt;&lt;br /&gt;&lt;br /&gt;Tiga teknik multiplexing&lt;br /&gt;&lt;br /&gt;· Frequency-Division Multiplexing (FDM), paling umum dipakai untuk radio&lt;br /&gt;atau TV&lt;br /&gt;&lt;br /&gt;· Time-Division Multiplexing (TDM) atau synchronous TDM, dipakai untuk&lt;br /&gt;multiplexing digital voice dan banyak digunakan untuk menggabungkan&lt;br /&gt;aliran suara digital dan aliran data&lt;br /&gt;· Peningkatan efisiensi Synchronous TDM dengan variasi sebagai berikut :&lt;br /&gt;· Statistical TDM atau&lt;br /&gt;· Asynchronous TDM atau&lt;br /&gt;&lt;br /&gt;· Intelligent TDM&lt;br /&gt;&lt;br /&gt;Bertujuan memperbaiki efisiensi synchronous TDM dengan cara menambahkan&lt;br /&gt;rangkaian yang lebih kompleks di sisi multiplexer&lt;br /&gt;&lt;br /&gt;&lt;a name="more"&gt;&lt;/a&gt;&lt;br /&gt;&lt;br /&gt;&lt;br /&gt;Frequency Division Multiplexing&lt;br /&gt;&lt;br /&gt;Tiap sinyal dimodulasikan ke dalam frekuensi carrier yang berbeda dan&lt;br /&gt;frekuensi carrier tersebut terpisah dimana bandwidth dari sinyal-sinyal tersebut&lt;br /&gt;tidak overlap&lt;br /&gt;&lt;br /&gt;Ø FDM dimungkinkan jika bandwidth media transmisi jauh lebih besar daripada&lt;br /&gt;required BW sinyal yang akan dikirim. Contoh: sistem siaran televisi, CATV,&lt;br /&gt;AMPS analog&lt;br /&gt;Ø Pada gambar di atas , ada 6 sumber sinyal input mux, kemudian masing-masing&lt;br /&gt;dimodulasi menjadi frekuensi berbeda (f1, …, f6)&lt;br /&gt;&lt;br /&gt;Ø Untuk menghindari interferensi, antar kanal dipisahkan oleh guard band (menjadi&lt;br /&gt;bagian dari spektrum yang tak terpakai)&lt;br /&gt;&lt;br /&gt;Ø Sejumlah sinyal analog atau digital [mi(t); i=1,…n] dimultiplex pada media transmisi&lt;br /&gt;yang sama.&lt;br /&gt;&lt;br /&gt;Ø Masalah yang harus diatasi sistem FDM: crosstalk dan derau intermodulasi.&lt;br /&gt;&lt;br /&gt;&lt;br /&gt;&lt;br /&gt;Synchronous Time-Division Multiplexing&lt;br /&gt;&lt;br /&gt;Ø Time division multiplexing dimungkinkan apabila data rate yang dapat dicapai&lt;br /&gt;oleh media transmisi lebih besar daripada data rate sinyal digital yang akan dikirim.&lt;br /&gt;Ø Pada gambar berikut, sejumlah sinyal digital [mi(t); i=1,…n] dimultiplex pada&lt;br /&gt;media transmisi yang sama. Data yang datang dari tiap sumber mula-mula dimasukkan&lt;br /&gt;ke buffer.&lt;br /&gt;Ø Buffer di-scan secara sekuensial untuk membentuk sinyal digital gabungan mc(t).&lt;br /&gt;Operasi scan harus berlangsung cukup cepat agar tiap buffer dapat berada dalam&lt;br /&gt;keadaan kosong sebelum data berikutnya masuk.&lt;br /&gt;Ø Jadi, besarnya laju data mc(t) harus lebih dari atau sama dengan penjumlahan&lt;br /&gt;laju data masing-masing sumber (mi(t)). Sinyal digital mc(t) dapat dikirim langsung,&lt;br /&gt;atau dilewatkan melalui modem untuk membentuk sinyal analog.&lt;br /&gt;&lt;br /&gt;&lt;br /&gt;Dalam hal ini dipakai 2 teknik interlaving :&lt;br /&gt;&lt;br /&gt;Ø Character-interlaving :&lt;br /&gt;&lt;br /&gt;1. Dipakai dengan sumber asynchronous.&lt;br /&gt;&lt;br /&gt;2. Tiap time slot mengandung 1 karakter dari data.&lt;br /&gt;&lt;br /&gt;&lt;br /&gt;Ø Bit-interlaving :&lt;br /&gt;&lt;br /&gt;1. Dipakai dengan sumber synchronous dan boleh juga dengan sumber&lt;br /&gt;asynchronous.&lt;br /&gt;&lt;br /&gt;2. Tiap time slot mengandung hanya 1 bit.&lt;br /&gt;&lt;br /&gt;&lt;br /&gt;&lt;br /&gt;Synchronous TDM :&lt;br /&gt;&lt;br /&gt;Ø Disebut synchronous karena time slot-time slot-nya di alokasikan ke sumber-sumber&lt;br /&gt;dan tertentu dimana time slot untuk tiap sumber ditransmisi. Biar bagaimanapun&lt;br /&gt;sumber mempunyai data untuk dikirim.&lt;br /&gt;&lt;br /&gt;Ø Dapat mengendalikan sumber-sumber dengan kecepatan yang berbeda-beda.&lt;br /&gt;&lt;br /&gt;&lt;br /&gt;Statistical Time-Division Multiplexing&lt;br /&gt;&lt;br /&gt;Ø Statistical TDM yang dikenal juga sebagai Asynchronous TDM dan&lt;br /&gt;Intelligent TDM, sebagai alternative synchronous TDM.&lt;br /&gt;&lt;br /&gt;Ø Pada synchronous TDM, banyak kasus time slot kosong (tidak berisi data).&lt;br /&gt;Statistical TDM memanfaatkan fakta bahwa tidak semua terminal mengirim&lt;br /&gt;data setiap saat, sehingga data rate pada saluran output lebih kecil dari&lt;br /&gt;penjumlahan data rate semua terminal.&lt;br /&gt;Ø Ada n saluran input, tetapi hanya k time slot yang tersedia pada sebuah frame&lt;br /&gt;TDM. Di mana k &lt;&gt;&lt;br /&gt;Ø Di sisi pengirim, fungsi multiplexer adalah scanning buffer, mengumpulkan&lt;br /&gt;data sampai frame penuh, kemudian mengirimkan frame tersebut.&lt;br /&gt;Ø Konsekuensi: tambahan overhead, karena diperlukan field address dan&lt;br /&gt;length. Informasi address dibutuhkan untuk memastikan bahwa data diantarkan&lt;br /&gt;kepada penerima yang tepat.&lt;br /&gt;Ø Pada gambar berikut, ada 4 sumber data yang transmit pada waktu t0, t1, t2, t3.&lt;br /&gt;Multiplexer statistik tidak mengirimkan slot kosong jika terdapat data dari user lain&lt;br /&gt;&lt;br /&gt;Sumber : http://brahm.staff.gunadarma.ac.id/Downloads/files/8932/MULTIPLEXING.doc&lt;div class="blogger-post-footer"&gt;&lt;img width='1' height='1' src='https://blogger.googleusercontent.com/tracker/1300399623975330669-8211175286910069107?l=asmarnovira.blogspot.com' alt='' /&gt;&lt;/div&gt;</content><link rel='replies' type='application/atom+xml' href='http://asmarnovira.blogspot.com/feeds/8211175286910069107/comments/default' title='Poskan Komentar'/><link rel='replies' type='text/html' href='http://asmarnovira.blogspot.com/2009/11/tdmfdmcdm.html#comment-form' title='0 Komentar'/><link rel='edit' type='application/atom+xml' href='http://www.blogger.com/feeds/1300399623975330669/posts/default/8211175286910069107'/><link rel='self' type='application/atom+xml' href='http://www.blogger.com/feeds/1300399623975330669/posts/default/8211175286910069107'/><link rel='alternate' type='text/html' href='http://asmarnovira.blogspot.com/2009/11/tdmfdmcdm.html' title='TDM,FDM,CDM'/><author><name>IRA</name><uri>http://www.blogger.com/profile/04417846760028408557</uri><email>noreply@blogger.com</email><gd:image rel='http://schemas.google.com/g/2005#thumbnail' width='16' height='16' src='http://img2.blogblog.com/img/b16-rounded.gif'/></author><thr:total>0</thr:total></entry><entry><id>tag:blogger.com,1999:blog-1300399623975330669.post-3644214586005553315</id><published>2009-10-28T08:13:00.001-07:00</published><updated>2009-10-28T08:13:29.887-07:00</updated><title type='text'>Implementasi remote radio frekuensi (RF) pada sistem alarm kendaraan bermotor</title><content type='html'>Tingkat kriminalitas curanmor di negara ini semakin tinggi saja.&lt;br /&gt;Khususnya angka kriminalitas untuk pencurian kendaraan bermotor roda dua. Hal&lt;br /&gt;ini disebabkan karena alarm security sepeda motor masih kurang aman terhadap&lt;br /&gt;kondisi sekarang ini. Oleh karena itu melihat dari beberapa fakta dan masih&lt;br /&gt;tingginya tingkat pencurian sepeda motor, perlu adanya perbaikan terhadap sistem&lt;br /&gt;alarm security sepeda motor yang telah ada saat ini.&lt;br /&gt;Sistem Alarm security sepeda motor ini dilengkapi dengan sistem&lt;br /&gt;password serta dapat melakukan cut ignition mode dari jarak jauh melalui modul&lt;br /&gt;remote RF. Selain itu sistem alarm security sepeda motor ini dilengkapi dengan&lt;br /&gt;battery-backup. Sistem ini menggunakan mikrokontroler AT89C2051 sebagai&lt;br /&gt;pengolah data dan controller dari alarm security system sepeda motor. Digunakan&lt;br /&gt;shock sensor pada bodi sepeda motor dan sensor posisi kunci kontak sepeda&lt;br /&gt;motor.&lt;br /&gt;Dari hasil pengujian, alarm security system sepeda motor ini mampu&lt;br /&gt;memonitoring kondisi sepeda motor dari jarak 43,3m (pada area yang tidak&lt;br /&gt;terdapat halangan) sedangkan pada area yang terdapat halangan dapat&lt;br /&gt;memonitoring kondisi sepeda motor pada jarak 33,5m. Sistem alarm sepeda&lt;br /&gt;motor dapat berjalan sesuai dengan yang diinginkan dan diharapkan dapat&lt;br /&gt;menekan angka kriminalitas khususnya angka pencurian sepeda motor.&lt;div class="blogger-post-footer"&gt;&lt;img width='1' height='1' src='https://blogger.googleusercontent.com/tracker/1300399623975330669-3644214586005553315?l=asmarnovira.blogspot.com' alt='' /&gt;&lt;/div&gt;</content><link rel='replies' type='application/atom+xml' href='http://asmarnovira.blogspot.com/feeds/3644214586005553315/comments/default' title='Poskan Komentar'/><link rel='replies' type='text/html' href='http://asmarnovira.blogspot.com/2009/10/implementasi-remote-radio-frekuensi-rf.html#comment-form' title='0 Komentar'/><link rel='edit' type='application/atom+xml' href='http://www.blogger.com/feeds/1300399623975330669/posts/default/3644214586005553315'/><link rel='self' type='application/atom+xml' href='http://www.blogger.com/feeds/1300399623975330669/posts/default/3644214586005553315'/><link rel='alternate' type='text/html' href='http://asmarnovira.blogspot.com/2009/10/implementasi-remote-radio-frekuensi-rf.html' title='Implementasi remote radio frekuensi (RF) pada sistem alarm kendaraan bermotor'/><author><name>IRA</name><uri>http://www.blogger.com/profile/04417846760028408557</uri><email>noreply@blogger.com</email><gd:image rel='http://schemas.google.com/g/2005#thumbnail' width='16' height='16' src='http://img2.blogblog.com/img/b16-rounded.gif'/></author><thr:total>0</thr:total></entry><entry><id>tag:blogger.com,1999:blog-1300399623975330669.post-7458557125294624683</id><published>2009-10-14T00:11:00.000-07:00</published><updated>2009-10-14T00:12:28.099-07:00</updated><title type='text'>Protokol Session Initiation Protocol (SIP)</title><content type='html'>&lt;p&gt;SIP merupakan protokol persinyalan yang bertujuan untuk mengendalikan inisiasi, modifikasi, serta terminasi sesi-sesi multimedia, termasuk sesi komunikasi audio atau video. SIP merupakan protokol berbasis teks yang mirip dengan protokol HTTP dan Simple Mail Transfer Protocol (SMTP).&lt;/p&gt; &lt;p&gt;SIP adalah protokol peer-to-peer yang mengandung arti bahwa fungsi-fungsi call routing dan session management didistribusikan ke semua node (termasuk endpoint dan server) di dalam jaringan SIP. Hal ini berbeda dengan sistem telepon konvensional di mana terminal-terminal telepon sangat bergantung kepada perangkat switching yang terpusat.&lt;span id="more-14"&gt;&lt;/span&gt;&lt;/p&gt; &lt;p&gt;&lt;strong&gt;Fungsi-Fungsi SIP&lt;/strong&gt;&lt;/p&gt; &lt;p&gt;SIP memiliki fungsi-fungsi yang didefinisikan sebagai berikut:&lt;br /&gt;• User location SIP menyediakan kemampuan untuk menemukan lokasi pengguna akhir yang bermaksud akan membangun sebuah sesi atau mengirimkan sebuah permintaan&lt;br /&gt;• User capabilities SIP memungkinkan determinasi kemampuan media dari perangkat yang terlibat di dalam sesi&lt;br /&gt;• User availability SIP memungkinkan determinasi keinginan pengguna untuk melakukan komunikasi&lt;br /&gt;• Session setup SIP memungkinkan modifikasi, transfer, dan terminasi dari sebuah sesi aktif&lt;/p&gt; &lt;p&gt;&lt;strong&gt;Elemen Jaringan SIP&lt;/strong&gt;&lt;/p&gt; &lt;p&gt;Jaringan SIP terdiri dari elemen-elemen sebagai berikut:&lt;br /&gt;• User Agent (UA) berfungsi untuk menginisiasi atau merespon transaksi SIP. Sebuah UA dapat bertindak sebagai klien atau server.&lt;br /&gt;• User Agent Client (UAC) berfungsi untuk menginisiasi permintaan SIP dan menerima respon SIP&lt;br /&gt;• User Agent Server (UAS) berfungsi untuk menerima permintaan SIP dan mengirimkan kembali respon SIP&lt;br /&gt;• SIP Proxy adalah entitas yang berfungsi untuk proses routing dan meneruskan permintaan SIP kepada UAS atau proxy lain atas permintaan UAC&lt;br /&gt;• Redirect Server adalah sebuah UAS yang membangkitkan respon SIP terhadap permintaan yang diterima, memungkinkan UAC secara langsung menghubungi Uniform Resource Identifiers (URI)&lt;br /&gt;• Registrar Server adalah sebuah UAS yang menerima permintaan registrasi SIP dan memperbaharui informasi dari pesan tersebut ke dalam database lokasi&lt;br /&gt;• Back-to-Back User Agent (B2BUA) adalah entitas yang berfungsi untuk memproses permintaan SIP yang diterima di mana B2BUA akan bertindak sebagai UAC, membangkitkan kembali permintaan SIP dan mengirimkannya ke dalam jaringan&lt;/p&gt;&lt;div class="blogger-post-footer"&gt;&lt;img width='1' height='1' src='https://blogger.googleusercontent.com/tracker/1300399623975330669-7458557125294624683?l=asmarnovira.blogspot.com' alt='' /&gt;&lt;/div&gt;</content><link rel='replies' type='application/atom+xml' href='http://asmarnovira.blogspot.com/feeds/7458557125294624683/comments/default' title='Poskan Komentar'/><link rel='replies' type='text/html' href='http://asmarnovira.blogspot.com/2009/10/protokol-session-initiation-protocol.html#comment-form' title='0 Komentar'/><link rel='edit' type='application/atom+xml' href='http://www.blogger.com/feeds/1300399623975330669/posts/default/7458557125294624683'/><link rel='self' type='application/atom+xml' href='http://www.blogger.com/feeds/1300399623975330669/posts/default/7458557125294624683'/><link rel='alternate' type='text/html' href='http://asmarnovira.blogspot.com/2009/10/protokol-session-initiation-protocol.html' title='Protokol Session Initiation Protocol (SIP)'/><author><name>IRA</name><uri>http://www.blogger.com/profile/04417846760028408557</uri><email>noreply@blogger.com</email><gd:image rel='http://schemas.google.com/g/2005#thumbnail' width='16' height='16' src='http://img2.blogblog.com/img/b16-rounded.gif'/></author><thr:total>0</thr:total></entry></feed>
