note-for-it.blogspot.com
Note For IT: November 2008
http://note-for-it.blogspot.com/2008_11_01_archive.html
Tuesday, November 25, 2008. Algorithms and Data Structures - Hashing. At the end of the class learner will be able to answer the following:. Design and implement hash-list searches. Discuss the merits of different collision resolution algorithms. The goal of a hashed search is to find the target data in only one test. After discussing some basic hashed list concepts, we discuss eight hashing methods. Hashing is a key-to-address mapping process. Terms must be familiarized. Address = key MODULO listsize 1.
note-for-it.blogspot.com
Note For IT: Linked List Based Implementation of Stack and Queue
http://note-for-it.blogspot.com/2008/12/linked-list-based-implementation-of.html
Saturday, December 20, 2008. Linked List Based Implementation of Stack and Queue. The way the data structure is implemented is a measure of its efficiency (time and space). It is important to see different alternatives. So far we have discussed array based implementation (vector). What if we use second class arrays? Discuss linked list based implementation of stack and queue. Compare and contrast two implementations. Linked List based Stack. Stack is LIFO data structure. Intially toOftheStack is null.
note-for-it.blogspot.com
Note For IT: Algorithms & Data Structures - Linked List
http://note-for-it.blogspot.com/2008/12/algorithms-data-structures-linked-list.html
Saturday, December 20, 2008. Algorithms and Data Structures - Linked List. At the end of the class you should be able to answer:. Explain the design, use, and operation of a linear list. Implement a linear list using a linked list structure. Understand the operation of the linear list ADT. Write application programs using the linear list ADT. Design and implement different link-list structures. The four basic list operations are :. Insertion is used to add a new element to the list. Several data structur...
note-for-it.blogspot.com
Note For IT: October 2008
http://note-for-it.blogspot.com/2008_10_01_archive.html
Wednesday, October 15, 2008. Multimedia storage and retrieval. Redundant Array of Inexpensive Disks (RAID). Large capacity but slower access near-line mass-storage (jukeboxes). CD-ROM - Compact Disc Read Only memory. CD-ROM has several advantages and few disadvantages. A) CD-ROM can hold about 650 megabytes of data, the equivalent of thousands of floppy disc. B) CD-ROM are not damaged by magnetic fields or the x-rays. C) The data on a CD-ROM can be accessed much faster than on a tape. Data is distributed...
note-for-it.blogspot.com
Note For IT: December 2008
http://note-for-it.blogspot.com/2008_12_01_archive.html
Saturday, December 20, 2008. Linked List Based Implementation of Stack and Queue. The way the data structure is implemented is a measure of its efficiency (time and space). It is important to see different alternatives. So far we have discussed array based implementation (vector). What if we use second class arrays? Discuss linked list based implementation of stack and queue. Compare and contrast two implementations. Linked List based Stack. Stack is LIFO data structure. Intially toOftheStack is null.
note-for-it.blogspot.com
Note For IT: Algorithms & Data Structures - Sorting
http://note-for-it.blogspot.com/2009/05/algorithms-data-structures-sorting.html
Saturday, May 16, 2009. Algorithms and Data Structures - Sorting. At the end of the class you should be in a position to answer:. 8730;Understand the basic concepts of internal and external sorts. 8730;Discuss the relative efficiency of different sorts. 8730;Recognize and discuss selection, insertion and exchange sorts. 8730;Discuss the design and operation of external sorts. 8730;Design and implement sequential searches. 8730;Discuss the relative merits of different sequential searches. In each pass of ...
note-for-it.blogspot.com
Note For IT: August 2009
http://note-for-it.blogspot.com/2009_08_01_archive.html
Saturday, August 29, 2009. Rolling a Six-Sided Die 6000 Times (Java Coding). Import java.util.Random;. Public class RollDie {. Public static void main(String[] args) {. Random randomNumbers = new Random();. Int freq1 = 0;. Int freq2 = 0;. Int freq3 = 0;. Int freq4 = 0;. Int freq5 = 0;. Int freq6 = 0;. For(int roll=1; roll. Face = 1 randomNumbers.nextInt(6);. System.out.println("Face tFrequency" );. System.out.printf("1 t%d n2 t%d n3 t%d n4 t%d n5 t%d n6 t%d n",. Freq1, freq2, freq3, freq4, freq5, freq6);.
note-for-it.blogspot.com
Note For IT: November 2007
http://note-for-it.blogspot.com/2007_11_01_archive.html
Wednesday, November 21, 2007. Problem solving tools that:. Why is a computer so powerful? What is Computing Literacy? Learning how to use computer to benefit your life or work. Required by most occupations. Functions of a Computer. 1Arithmetic - add, subtract, multiply, divide. 2Comparisons - greater than, less than, equal. What Computers Can Do? What Computers Cannot Do? 1Cannot identify a problem to be solved. 2Cannot identify and collect data. 4Cannot identify the output needed to solve a problem.
note-for-it.blogspot.com
Note For IT: Algorithms & Data Structures - Queue
http://note-for-it.blogspot.com/2009/02/algorithms-data-structures-queue.html
Friday, February 27, 2009. Algorithms and Data Structures - Queue. Queue is an ordered collection of items. These items may be deleted at one end (called the HEAD of the queue) and inserted at other end (called the TAIL of the queue). Example, to withdraw money at ATM. Also known as FIFO – first in first out. Array and linked list implementation. Enqueue is the shortened version of "entering a queue". It refers to a situation where a new item is inserted to the queue. Using array to implement the queue.
note-for-it.blogspot.com
Note For IT: May 2009
http://note-for-it.blogspot.com/2009_05_01_archive.html
Saturday, May 16, 2009. Algorithms and Data Structures - Searching. 8730;The process used to find the location of a target among the list of object. 8730;We begin with list searching and a discussion of two basic search algorithm. 8730;The two basic searches for arrays are the sequential search and the binary search. 8730;The sequencial search is used whenever the list is not ordered. 8730;It is useful for small lists or lists that are not searched often. 8730;The efficiency of sequential search is O(n).
