DS Introduction2015 .pdf
Original filename: DS-Introduction2015.pdf
Title: Operating Systems CSC 522
Author: Sameh Elsharkawy
This PDF 1.5 document has been generated by Microsoft® PowerPoint® 2013, and has been sent on pdf-archive.com on 05/11/2015 at 21:41, from IP address 41.37.x.x.
The current document download page has been viewed 569 times.
File size: 919 KB (32 pages).
Privacy: public file
Download original PDF file
DS-Introduction2015.pdf (PDF, 919 KB)
Share on social networks
Link to this file download page
Algorithms vs. programs (1)
– can be performed by humans or machines
– can be expressed in any suitable language
– may be as abstract as we like.
– must be performed by machines
– must be expressed in a programming
– must be detailed and specific.
• A data structure is a systematic way of organizing a
collection of data.
• A static data structure is one whose capacity is
fixed at creation.
• A dynamic data structure is one whose capacity is
variable, so it can expand or contract at any time.
E.g.: linked list, binary tree.
• For each data structure we need algorithms for
insertion, deletion, searching, etc.
Overview of the Array
• Insert a new data item.
• Search for a specified item.
• Delete a specified item.
What is the difference between Order
Array and Unorder Array?
• Is Insert Function will Change?
• Is Find Function will Change?
• Is Delete Function will Change?
• Stacks often are drawn vertically:
• Some stack operations:
– push - add an item to the top of the stack
– pop - remove an item from the top of the
– peek - retrieves the top item without
– empty - returns true if the stack is empty
• We can define the operations for a queue
– enqueue - add an item to the rear of the queue
– dequeue (or serve) - remove an item from the front of the
– empty - returns true if the queue is empty
An Abstract Picture
A link is an object of a class called something like Link.
Each link object contains a pointer (which we’ll call
pNext) to the next link in the list.
• Why Use Binary Trees?
• You can search a tree quickly, as you can an ordered
array, and you can also insert & delete items
quickly, as you can with a linked list.
• What Is a Tree?
Link to this page
Use the permanent link to the download page to share your document on Facebook, Twitter, LinkedIn, or directly with a contact by e-Mail, Messenger, Whatsapp, Line..
Use the short link to share your document on Twitter or by text message (SMS)
Copy the following HTML code to share your document on a Website or Blog