bajarlovelyit123.blogspot.com
IT123A0809: March 2009
http://bajarlovelyit123.blogspot.com/2009_03_01_archive.html
Thursday, March 12, 2009. Programmer’s name: Lovely Bajar. Name of Program: Queue implementation. Date Started: March 11, 2009. Date Finished : March 12, 2009. Instructor : Mr. Dony Dongiapon. Course: IT 123: Data Structures. Objective: To be able to make a program that implements a queue data structure in a linked list. Concept: List of employees in a given company. Public int employeenum;. Public String firstname;. Public String Lastname;. Public char Middlename;. Public Queue next;. Private Queue last;.
ortiznellengraceit123.blogspot.com
IT123A0809: October 2009
http://ortiznellengraceit123.blogspot.com/2009_10_01_archive.html
9829;♥♥ WELCOME TO MY SITE! 9829;♥♥. Wednesday, October 7, 2009. Nellen Grace C. Ortiz. Analyn S. Obal. 1 The purpose of packages is to group the classes into a subsystem. Packages serves as containers for the classes or use cases such as class diagram, sequence diagram and so on. Reference: http:/ vinci.org/uml/packagex.html. 8226; A simple example showing 3 dependent components. 8226; The Web browser communicates customer orders to a shopping cart. Reference: http:/ vinci.org/uml/componentx.html. 8226;...
pellejochrisdyllit123.blogspot.com
IT123A0809
http://pellejochrisdyllit123.blogspot.com/2009/04/quick-sort-definition-it-is-well-known.html
A very educational blog. i swear you would learn a lot if you really read and understand. (Warning. the two girls on the photo are absolutely and irrevocably gorgeous and awesome creature. are you ready for their charm? THE NEXT FAMOUS PERSONALITIES. Monday, April 6, 2009. It is a well-known sorting algorithm developed by C.A.H Hoare. 9829; this is performed through finding its pivot and sort it. 9829; typically unstable and somewhat complex but among the fastest sorting algorithms. Var list less, greater.
pabiojulieann-it123.blogspot.com
IT1230809
http://pabiojulieann-it123.blogspot.com/2009/04/shell-sort-was-invented-by-donald-shell.html
Sunday, April 5, 2009. This is an effective in terms of the efficiency of the sorted list. Input: an array a of length ninc ← round(n/2). While inc 0 do:. For i = inc . n − 1 do:. Temp ← a[i]. J ← i. While j ≥ inc and a[j − inc] temp do:. A[j] ← a[j − inc]. J ← j − inc. A[j] ← temp. Inc ← round(inc / 2.2). Application: Sorting the numbers in a certain row. Reference:http:/ en.wikipedia.org/wiki/Sorting algorithm#Shell sort. Subscribe to: Post Comments (Atom). All About Me. . . View my complete profile.
lopezrachelleit123.blogspot.com
IT1230809: Shell Sort
http://lopezrachelleit123.blogspot.com/2009/03/shell-sort.html
Sunday, March 15, 2009. Shell sort is a sorting algorithm that is a generalization of insertion sort, with two observations:. Reference:http:/ en.wikipedia.org/wiki/Shell sort. Http:/ www.iti.fh-flensburg.de/lang/algorithmen/sortieren/shell/shellen.htm. Subscribe to: Post Comments (Atom). Beauty Tip of the Day. Doubly Linked List implementation. View my complete profile. Hello gUyz and gAls.tnx 4 viewing my profile!
lanuganrubyit123.blogspot.com
IT123A0809
http://lanuganrubyit123.blogspot.com/2010/01/lanugan-ruby-m.html
HeygUyz wElcome To my pAge. Friday, January 8, 2010. Lanugan, Ruby M. . 1 . Name the five key concepts about an operating system that you think a user needs to know and understand. 1 Command Interface -This. This component is responsible for allocating the central processing unit (CPU). The status of each process must be tracked, and the Processor Manager handles matters such as process prioritization and multithreading. The tasks of the Processor Manager can be divided into two main catego...This ...
pabiojulieann-it123.blogspot.com
IT1230809
http://pabiojulieann-it123.blogspot.com/2009/04/merge-sort-takes-advantage-of-ease-of.html
Sunday, April 5, 2009. Var list left, right, result. If length(m) ≤ 1. This calculation is for 1-based arrays. For 0-based, use length(m)/2 - 1. Var middle = length(m) / 2. For each x in m up to middle. Add x to left. For each x in m after middle. Add x to right. Left = merge sort(left). Right = merge sort(right). Result = merge(left, right). Application: Merging a bundle of something like sticks and other. Http:/ en.wikipedia.org/wiki/Sorting algorithm#Merge sort. Subscribe to: Post Comments (Atom).
pabiojulieann-it123.blogspot.com
IT1230809
http://pabiojulieann-it123.blogspot.com/2009/04/quicksort-is-divide-and-conquer.html
Sunday, April 5, 2009. This is performed through finding its pivot and sort it. Typically unstable and somewhat complex but among the fastest sorting algorithms. Var list less, greater. If length(array) ≤ 1. Select and remove a pivot value pivot from array. For each x in array. If x ≤ pivot then append x to less. Else append x to greater. Return concatenate(quicksort(less), pivot, quicksort(greater). Finding the pivot of a given example and then sort it. Http:/ en.wikipedia.org/wiki/Quicksort.
lanuganrubyit123.blogspot.com
IT123A0809: 7 Cases in deadlocks
http://lanuganrubyit123.blogspot.com/2010/02/7-cases-in-deadlocks.html
HeygUyz wElcome To my pAge. Tuesday, February 9, 2010. 7 Cases in deadlocks. Deadlocks on file requests. Any other programs that require F1 or F2 are put on hold as long as this situation continues. If jobs can request and hold files for duration of their execution, deadlock can occur. Deadlock remains until a programs is withdrawn or forcibly removed and its file is released. Deadlock can occur if 2 processes access and lock records in database. 3 different levels of locking :. Disk accepts output from ...