FACULY OF NATURAL SCIENCE
DEPARTMENT OF COMPUTER SCIENCE
NAME OF STUDENT : S. GANGATA
STUDENT NUMBER : 213240300
MODULE : DATA STRUCTURES
MODULE CODE : CSI22M2
TASK : ASSIGNMENT #1
TOPIC : ROLE OF DATA STRUCTURES
QUALIFICATION : B Sc. COMPUTER SCIENCE
DUE DATE : 04-08-2015
LECTURER : MR L. TINARWO
1. Stack
Properties
(Weiss, 1992) In a stack insertion and deletion are performed only in one position called the top. Operations of the stack are push, and push is the same as to insert, and pop which deletes is an element that is recently inserted. That element is pre-examined to performing a pop using routine. A stack uses the LIFO order which stands for Last In First Out. For example in a stack of boxes when you want
…show more content…
Designing a queuing system
This one can be used in banks, grocery stores, theatre movies et cetera, and people try to execute their programs using the same processors.
2. Customer
Each customer have got the arrival time, waiting time and time for leaving. Every customer follows those operations sequentially.
3. Server
All the servers have timer, the program should know which customers are served by which customers.
3. Trees
(Malik, 2010)Trees are used to represent arithmetic and Boolean expressions. A tree as a data structure arranges the collection of items using a hierarchical structure. Mathematical formulas are represented using the trees. Trees also help in the analysis of electrical circuits. “The function search searches binary search tree for a given item”. Item returns true if it is found in the binary tree but false if it is not found. When we have inserted an item in a binary search tree, the resulting binary tree have to be a binary search tree too.
Applications
1. Coding and data compression
Reduction of the number of bits used to store or transmit data
2. Spell checker
Helps on words that have been typed wrongly
3. Genealogies
For tracing the history of the families
4. Organisation
…show more content…
Used in sociology.
6. Hash table
Properties
(Malik, 2010) Hash table is denoted by HT and it is stored in an array. Hash function is denoted by h and we calculate h(X) where X is the element of an item to find the address of the item in the hash table. Data is organised in two ways, firstly data is stored within the hash table i.e. in an array. Secondly it is stored in linked lists and the hash table is an array of pointers to such linked lists.
Applications and some examples
1. Mid-Square -We square the identifier when calculating the hash function.
2. Folding
The key X is partitioned to parts so that all parts have the same length except the last parts.
3. Collision resolution
Its techniques are classified into two categories namely open addressing (or closed hashing) and chaining (or open hashing).
4. For driver’s license records
Helps to quickly get information about a driver using a license number.
5. For internet search engines.
Helps to quickly see what you are searching for in the internet
6. For implementation of passwords for systems with multiple users.
For example in a school computer lab two or more student may have different account in the same machine
7. Heap
Exercise 7-13 I have to announce everyone in the group that we will not be able to meet the June 1 commitment to ship 100 operating tables to Southeast Surgical Supplies. To be clear, we only have 30 tables on hand as a report of this morning. However, this is not our fault entirely. Six months ago, purchasing warned us about shrinking supplies and suggested we buy as much as we could in advance for the next 12 months. We tried to follow their advice, but we were never be able to buy supplies in advance due to company’s policy about never buying more than three months worth of materials in advance.
The signal with the lowest value is taken into consideration. As said in the previous section (hue calculation algorithm) it is available for us on the bus can be used for this computation. This improves the worktime and also reduces the burden on the device. Minimum value is to be multiplied with an integer value ‘3’, which is same for every change in the input values.
The numbers $N_{\omega}^{rec}$ and $N_{\omega\to\pi^0\gamma}^{rec}$, extracted from the different combinations for two energies, are plotted in Fig.~\ref{fitbr15sysin} and Fig.~\ref{fitbr15sysex}, respectively. The numbers are listed in Appendix~\ref{fitsysematicinclusve} for reference. The distributions are fitted with a constant fit to have the error estimate.
Check boxes: The checkboxes are left aligned and user can be activate or deactivate.as per the requirement. Radio buttons: Are mutually exclusive, which means that only one radio button can be active at the same time. Radio buttons are shown to the left of the text. Switch:
In response the application receives data from server regarding the parking slot to be used. This data is shown to the client in a graphical manner which is easy to understand. User has to fill register form which is having the following fields:- (a) Name of the user (b) Birth date (c) Gender (d) Email (e) Mobile Number (f) Password
CMO570 Report 1. Item and Customer data are stored in a hashPublic Map getCustomers() { return customers;} Public Map getItems(){return items;} When you search for a key/value pair in a hash table you can go directly to the location that contains the item you want, you rarely have to look at any other items, you can just look at the key and go directly to the location where it is stored. Hash maps allow the execution time of basic operations, such as get() to remain constant even for large sets. HashSets and HashMaps are implemented using a data structure known as a hashtable. ‘The concept of a hash table is a generalized idea of an array where key does not have to be an integer.
Everyone please read the instructions to all assignments to make sure I outlined all the potions correctly. You are not only responsible for your own portion, but for everyone else’s as well. I sometimes find Walden’s instructions to be quite difficult, so to make sure that I understood them correctly I would like everyone to go over them and correct any mistakes and/or typos I may have made. Professor Bissonette pointed out that I outlined root cause as a plural (root causes) whereas it should be a single root cause. That one S at the end of “cause” could have affected our entire project.
Let U = {0, 1,..,m-1} be the universe of ‘m’ keys from which an application draws its keys. If this universe of keys is reasonably small and if no two elements have the same key, then we can use an array to store the keys. Each slot in the array corresponds to a key in the universe U. Hence there will be ‘m’ slots in the array or Direct-address table, corresponding to each element in the universe. We can use the key value as index of the array to directly access the array location to see whether an element is present or not.
“Other things may change us, but we start and end with family” – Anthony Bradt Emelyne Sterling was a woman of many words; few actually listened to her. The young F.B.I had helped save many, but what about her? Who saved the young profiler? Where would she get the love she never got from her schizophrenic mother? She was rotting from within, but you couldn’t tell from the outside.
Upon reading both passages, it is my belief that both of them provide competitive arguments but also conflict each other in the same aspect. For instance, in paragraph 2 of the first passage it claims that the freedom that the child has can provide a strong sense of self. At the same time, paragraph 3 of the second passage claims that the organizational activities cause children to develope a strong sense of identity. Both passages have thus made the same statement but, neither can provide reasons as to which method would be best suited for causing this behavior. A blend of both methods, in my opinion, could provide the best option.
1. Prior to this week’s assigned reading my understanding of nature was one that is ever expanding, with atoms at the core. Being science and mathematics nearly always come hand in hand, I related math to be an essential matter as well. Through our reading I found connections through Heraclitus, as he understood our world as one of fire “meaning there is always” change and flux. Condensing the entire world into one substance is quite brave as the world as we know and understand is composed of many elements and substances.
Introduction to Bioinformatics Fig.1:-Branches of Bioinformatics Bioinformatics is a type of interdisciplinary field which has all developed method and software tools for all the biological data and to understand it. Bioinformatics is a combination of many fields of subjects to study and for the processing of the biological data. Bioinformatics are used repeatedly in the fields of genetics and genomics. Commonly it is used for the identification of genes and nucleotides of a particular person. It is based on the organizational principles within nucleic acid and protein sequences.
This will make my searches more efficient and it will save me a lot of time. Not only do I find Boolean’s operators for searching very valuable, but I find that the vast amount of databases that I have access to can be very useful to me especially in my graduate school life. I had always thought that there were only two scholarly databases available. I did not know that there were many more that I had just not discovered yet. In addition to my new knowledge, I will be able to apply what I have learned to being more careful in selecting keywords in my future searches.
1. SQL History: SQL A structured query language used to delete, insert, update, and retrieve data from databases. It began in 1970 when Dr. E.F Codd published a paper entitled "A Relational Model of Data for Large Shared Data Banks." This paper described a new way of organizing data into a database and led to relational database systems that we use today. While the paper of Dr. Codd defined the structure, his colleagues Donald D. Chamberlain and Raymond F Boyce in IBM were developing the query language known as SQUARE (identifying queries as relational expressions), which used group theory and assigned math to select data from the database.
The data in a file system is interpreted to create files that contain data in an application-specific format. Each of these layers has its own analysis techniques and requirements. Examples of common digital analysis