Data structure
This presentation is the property of its rightful owner.
Sponsored Links
1 / 16

Data Structure PowerPoint PPT Presentation

  • Uploaded on
  • Presentation posted in: General

Data Structure. Dr. Mohamed Khafagy. Welcome to the course Data Structure. Personal Email: [email protected] Web Site Course mail: [email protected] Description of Course. This course investigates abstract data types (ADTs).

Download Presentation

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.While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server.

- - - - - - - - - - - - - - - - - - - - - - - - - - E N D - - - - - - - - - - - - - - - - - - - - - - - - - -

Presentation Transcript

Data structure

Data Structure

Dr. Mohamed Khafagy

Welcome to the course data structure

Welcome to the course Data Structure

  • Personal Email:[email protected]

  • Web Site

  • Course mail:[email protected]

Description of course

Description of Course

  • This course investigates abstract data types (ADTs).

  • The Stack and Representing the stack in C++ like Infix, Postfix.

  • Queues and Lists implementation using Dynamic Variables. Circular Lists, Doubly Linked Lists. Trees and Operations on Binary Trees. Binary Tree Representations.

  • Searching Sequential Search. Indexed Sequential Search. Binary Search. Binary Search Trees. Inserting into a Binary Search Tree. Deleting from a Binary Search Tree. B-Trees.

  • Hashing.



  • Stack.

  • Infix, Postfix, and Prefix notations; Infix-to-Postfix conversion

  • Queues

  • Linked Lists

  • Inserting and Removing Nodes from a Linked list

  • Trees and Binary Trees

  • Searching

  • Hashing

Data structure

  • What are we doing ? What’s the reason you’re here?



  • To be familiar of abstract data types (ADTs) and also to develop deferent ADTs with Programming using C++ and be able to apply them to real-world problems.

Course methodology

Course Methodology

  • The course will be taught through lectures, with class participation expected and encouraged. There will be frequent reading assignments to supplement the lectures. The workload will include both written assignments and projects. Projects will be primarily individual, and self-contained.



  • Understand different types of ADTs

  • Understand the basic components and implementation of Stack.

  • Understand the deferent use of stack Infix, Postfix

  • Understand the basic components and implementation of Queues

  • Understand the basic components and implementation of Linked Lists

  • Understand how Inserting and Removing Nodes from a Linked list

  • Understand the basic components and implementation Trees and Binary Trees

  • Understand the basic components deferent way of Searching

  • Understand the basic components Hashing



  • C++ Data Structure ,T h i r d E d i t i o n, Nell Dale,J O N E S A N D B A R T L E T T C O M P U T E R S C I E N C E,2003

  • There will also be supplemental readings assigned during the semester.



  • It is important to attend every class session. Please notify me in advance if you must miss a class either personally, or through e-mail .

  • Three or more unexplained absences will result in a lowering of the final grade.

Class participation

Class Participation:

  • Class participation is an essential part of this class.

  • Perfect attendance does not ensure a good class participation grade.

  • Asked to present some material in class and this will also factor into the class participation grade.

Homework quizzes


  • Homework assignments are an important part of the class, and should be completed on time.

  • Late assignments will be penalized.

  • Homework assignments may take several forms: problem sets, short write-ups of supplemental readings, and in-class presentations.

  • There may be several quizzes during the semester to ensure that the readings are completed on time.

Final course project

Final Course Project

  • In addition to homework assignments, there will be an in-depth course project, due at the end of the term.

  • This project can be done in group The project will differ for each group, based on their interests and ideas.

  • Each project must be approved by the instructor.

  • The description and results of the project must be written up in a report.



  • Final Exam 80

  • Three or more unexplained absences -5

  • Mid Term 40

  • Projects20/2

  • Two Quizzes(2*10)/2

  • Homework/Assignments20

  • Make up exam will be in Last session

  • Class participation bonus 5

  • Final Lab 40

  • Total200

  •  Exams May be open note / open book. To avoid a disparity between resources available to different students, electronic aids are not permitted.

Point scale

point scale:

  • 10 Exceptional work.

  • 8 This corresponds to an A grade.

  • 6 This corresponds to a B grade.

  • 4 This corresponds to a C grade.

  • 2 Not really good enough, but something.

  • 0 Missing work, or so bad.

  • Late work will be penalized 1 point per day (24 hour period). This penalty will apply except in case of documented emergency (e.g., medical emergency), or by prior arrangement if doing the work in advance is impossible due to fault of the instructor

Academic honesty

Academic Honesty

  • All work produce in this course should be your own unless I specifically specify otherwise.

  • Login