1 / 20

Data structure

MINISTRY OF EDUCATION & HIGHER EDUCATION COLLEGE OF SCIENCE AND TECHNOLOGY KHANYOUNIS- PALESTINE. Using C#. Information Technology , 3’rd Semester. Data structure. Lecture 1 : Introduction To Course. Presented By: Mahmoud Rafeek Alfarra. Outline. Who is Lecturer ?! Course objectives

dora-castaneda
Télécharger la présentation

Data structure

An Image/Link below is provided (as is) to download presentation Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author. Content is provided to you AS IS for your information and personal use only. Download presentation by click this link. While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server. During download, if you can't get a presentation, the file might be deleted by the publisher.

E N D

Presentation Transcript

  1. MINISTRY OF EDUCATION & HIGHER EDUCATION COLLEGE OF SCIENCE AND TECHNOLOGY KHANYOUNIS- PALESTINE Using C# Information Technology , 3’rd Semester Data structure Lecture 1 : Introduction To Course Presented By: Mahmoud Rafeek Alfarra

  2. Outline • Who is Lecturer ?! • Course objectives • Resources • Course guidelines • Assessment • A word about lectures • Sending Home works & Questions • Office Hours • How to be successfully ?! • Course outlines • What is Data Structures ? • Static memory allocation • Dynamic memory allocation • Emank X Mezank !!

  3. Who is Lecturer ?! • Mahmoud Rafeek Alfarra • Certificates: • MSc Computer Science,2008, Pattern Recognition, AAST, Alexandria, Egypt. • BSc Computer Science,2004, The Islamic University of Gaza, Palestine. • General Secondary School Certificate,1999, Science division, Khan Younis, Gaza, Palestine. • Currently : • lecturer in CST (Full Time). • Head of Information Technology Forum 1 (29 Nov. to 1 Dec. 2010) • Past: • Head Of Computer Center in CST (9-2009 To 10-2010) • Lecturer in UCAS, QOU, UP, CST as Part Time • E-mail: mrfarra@cst.ps • Web Site:staff.cst.ps/mfarra • Office Hours: (Mon, 10:00-11:00), (Wed , 9:30-11:00) Presented & Prepared by: Mahmoud R. Alfarra

  4. Course objectives • This course aims to make the student capable of understanding and writing : • Algorithms • A simple application programs that is used in different area such as programs for calculating employees' salaries or the amount of zakah an others using Java language. Presented & Prepared by: Mahmoud R. Alfarra

  5. Resources • Power point’s files prepared by me. • Books: • C# How to Program, Sixth Edition, By H. M. Deitel -  Deitel & Associates, Inc., P. J. Deitel -  Deitel & Associates, Inc. Presented & Prepared by: Mahmoud R. Alfarra

  6. Course guidelines • We have a common goal: It is my job to teach you what you need to know. Therefore… • Ask me questions. • Do NOT let me continue if you aren’t clear about something and remember that: question is the half of knowledge. • If I go too fast, ask me to slow down. • If I use a term that you aren’t familiar with, ask me for a definition. • Attendance: is encouraged and required. Presented & Prepared by: Mahmoud R. Alfarra

  7. Course guidelines • Prepare yourself: For best understanding… • Study lecture by lecture: • Respect the lecture: • Any noise made during the lecture (e.g. A mobile phone ringing, a student talking to, or laughing with his or her mate, absent) will be considered impolite. Therefore, one mark will be deducted. • Plagiarism is strictly punished: Don’t associate people’s work to yourself. Site everything you include in your reports that is not your original work. Presented & Prepared by: Mahmoud R. Alfarra

  8. Assessment Presented & Prepared by: Mahmoud R. Alfarra

  9. A word about lectures • PPT notes will be available after every lecture on my web site, BUT: • You learn better when you actually have to write things down yourself. • Just reading/Listening along with my notes makes you sleepy. • Everything I say is NOT in the lecture notes, but anything I say MIGHT be on an exam or in a assignments, so you need to take notes on what I say • In this course, you should read/do practice/ ask many times if you hope to have an excellent grade. Presented & Prepared by: Mahmoud R. Alfarra

  10. Notations Home Work HW 1.1 Be Care Very Important information Presented & Prepared by: Mahmoud R. Alfarra

  11. Sending Home works & Questions • All home work must be send by cstmail to my e-mail (mfarra@cst.ps). • You must set the title of your mail as • DS – Homework – fnamelname – HW# • DS – Question – fnamelname – Question about … • You must respect the dead Line of sending home work. • You can have CSTmail now • www.cst.ps/egate Presented & Prepared by: Mahmoud R. Alfarra

  12. Office Hours • Office Hours are a greatly time to have a good Science. • They are yours. • Every • Mon (10:00 To 11:00 AM) • Wed (9:30 To 11:00) • Office (D300) Presented & Prepared by: Mahmoud R. Alfarra

  13. How to be successfully ?! • Prepare my lectures. • Re-study them. • Have a mood. • Choose your friends. • Ask allah . Presented & Prepared by: Mahmoud R. Alfarra

  14. Course outlines • Array data structure • Swapping • Sorting Arrays • Searching Arrays • Insert elements • Recursion • Linked Lists • Stacks • Queues • Trees • Collection Classes Presented & Prepared by: Mahmoud R. Alfarra

  15. What is Data Structures ? • The collection of basic data types is called data structure. Presented & Prepared by: Mahmoud R. Alfarra

  16. Static memory allocation • Static memory allocation means the program must obtain its space before the execution and can not obtain more while or after execution. • The limit of the static memory allocation is the maximum limit of the data type. • Example: array data structure Presented & Prepared by: Mahmoud R. Alfarra

  17. Dynamic memory allocation • The dynamic memory allocation is the ability for a program to obtain more memory space at execution time to hold new nodes and to release space no longer needed. • The limit for dynamic memory allocation can be as large as the amount of available physical memory or a virtual-memory system. Presented & Prepared by: Mahmoud R. Alfarra

  18. Dynamic memory allocation • Creating and maintaining dynamic data structures requires dynamic memory allocation. • Dynamic data structures as: • Linked Lists • Stacks • Queues • Trees Presented & Prepared by: Mahmoud R. Alfarra

  19. Emank X Mezank !! • وقفة ثابتة في محاضراتنا نقف فيها مع الإيمان و الميزان و كيف تثقل الموازين و تخف و ما أثر ذلك في الدنيـا و الآخــرة

  20. Next Lecture Swapping & sorting Array

More Related