lec-1_introduction

Document Sample
lec-1_introduction Powered By Docstoc
					Data Structures & Agorithms
         Lecture-1:
        Introduction
Instructor
Muhammad Nazir
Email: mohdnz@uaar.edu.pk

Visiting Hours:
Will be announced shortly




2/25/2012         Datastructures and Algorithms   2
Research Interests
   Areas of Interests
      Algorithms


           Digital Image Processing

           Artificial Intelligence

           Data mining & Data warehousing
2/25/2012                   Datastructures and Algorithms   3
   Never hesitate to contact with me
    whenever you have some problem




2/25/2012         Datastructures and Algorithms   4
Pre-Requisites
   Must have Good OOP Concepts

   Good programming skills

   Familiar with programming



2/25/2012        Datastructures and Algorithms   5
Books
   Data Structures Using C and C++
    By Y. Langsam, M. J. Augenstein, A. M. Tenenbaum

   Data Structures and Algorithms
    By A. V. Aho, J. E. Hopcroft, J. D. Ullman

   Introductions to algorithms by Thomas H.Cormen,
    Leiserson, Rivest and Stein.

   Schaum's Outline Series, Theory and problems of Data
    Structures By Seymour Lipschutz

Some topics will be covered from other books. Material will
                be provided for these topics.
2/25/2012               Datastructures and Algorithms     6
Projects/Homeworks
submission
 Deadlines are always final
 Submission guidelines must be followed.
 Name your submission folder in the format
  RollNo_Name_HW#
 e.g. 123_Umar_HW#3
 Submissions by email will not be accepted



2/25/2012       Datastructures and Algorithms   7
Dishonesty, Cheating in Quizzes,
Assignments & Projects
   Copying material in any form (code or otherwise)
    is not allowed.
   This will still be cheating even if you try to
    substitute or restructure words, structures,
    paras.
   You can always discuss ways to solve problem
    with your colleagues however you should not
    copy code.
   Penalty can be a zero in that and one other
    assignment on to a penalty of an F in the course.
2/25/2012           Datastructures and Algorithms   8
Grading

Assignments, Quizzes,                               12
Projects
Midterm Exam                                        18
 Final(Theory)                                      30
 Final(Practical)                                   20
Total                                               80


2/25/2012           Datastructures and Algorithms        9
Course Execution
 However some tutorials may be arranged
  occasionally
 Course Folder: DS-(A-B)-Spring09
 Course Yahoo Group: DS-(A-
    B)2011@yahoogroups.com




2/25/2012             Datastructures and Algorithms   10
Guidelines
 Read your email and messages on the
  course yahoo group regularly
 Check notice board sub folder in course
  folder daily
 Start working on projects/homeworks from
  first day.
 Remain attentive during the class. Do not
  sleep and ask questions.
 I will ask questions very often
2/25/2012       Datastructures and Algorithms   11
Course Contents
   Introduction
   Complexity Analysis
   Simple Data Types and Abstract Data Types
   Arrays and Lists
   Elementary Data Structures
   Stack and Queues
   Recursion and Time Complexity of Recursive Algorithms
   Trees and Graphs
   Set structure
   Searching techniques
   Hashing
   Sorting techniques
2/25/2012             Datastructures and Algorithms     12
What is a Computer Program?
   To exactly know, what is data structure?
    We must know:
       What        is a computer program?




                        Some mysterious
                          processing                       Output
            Input
2/25/2012                  Datastructures and Algorithms        13
Example
   Data structure for storing data of students:-
       Arrays
       Linked       Lists
   Issues
       Space  needed
       Operations efficiency (Time required to complete
        operations)
               Retrieval
               Insertion
               Deletion
2/25/2012                    Datastructures and Algorithms   14
What data structure to use?
Data structures let the input and output be represented in a way
that can be handled efficiently and effectively.
                                                               array

                                                           Linked list




                          queue
      tree                                             stack

2/25/2012              Datastructures and Algorithms               15

				
DOCUMENT INFO
Shared By:
Categories:
Tags:
Stats:
views:0
posted:2/25/2012
language:
pages:15