Scribd Logo
Upload

Welcome to Scribd!

  • 2K views

    Introduction To Data Structure

    Uploaded by

    rokeya_cse
    This document provides information about a Data Structures course offered at the International Islamic University Chittagong Dhaka Campus. The 3 credit, spring 2010 course covers internal data representation, abstract data types, and elementary and advanced data structures including arrays, lists, stacks, queues, trees, graphs, heaps, and B-trees. Students are required to have taken previous structured programming courses. The course meets three times a week for lectures and once a week for a sessional lab. Grading is based on class tests, homework, attendance, midterms, and finals. Students must complete programming assignments by given deadlines and copying will be penalized.

    Copyright:

    Attribution Non-Commercial (BY-NC)
    Download as DOC, PDF, TXT or read online from Scribd

    Introduction To Data Structure

    Uploaded by

    rokeya_cse
    2K views1 page
    This document provides information about a Data Structures course offered at the International Islamic University Chittagong Dhaka Campus. The 3 credit, spring 2010 course covers internal data representation, abstract data types, and elementary and advanced data structures including arrays, lists, stacks, queues, trees, graphs, heaps, and B-trees. Students are required to have taken previous structured programming courses. The course meets three times a week for lectures and once a week for a sessional lab. Grading is based on class tests, homework, attendance, midterms, and finals. Students must complete programming assignments by given deadlines and copying will be penalized.

    Original Title

    Introduction to Data Structure

    Copyright

    © Attribution Non-Commercial (BY-NC)

    Available Formats

    DOC, PDF, TXT or read online from Scribd

    Did you find this document useful?

    Is this content inappropriate?

    This document provides information about a Data Structures course offered at the International Islamic University Chittagong Dhaka Campus. The 3 credit, spring 2010 course covers internal data representation, abstract data types, and elementary and advanced data structures including arrays, lists, stacks, queues, trees, graphs, heaps, and B-trees. Students are required to have taken previous structured programming courses. The course meets three times a week for lectures and once a week for a sessional lab. Grading is based on class tests, homework, attendance, midterms, and finals. Students must complete programming assignments by given deadlines and copying will be penalized.

    Copyright:

    Attribution Non-Commercial (BY-NC)
    Download as DOC, PDF, TXT or read online from Scribd
    Download as doc, pdf, or txt
    2K views1 page

    Introduction To Data Structure

    Uploaded by

    rokeya_cse
    This document provides information about a Data Structures course offered at the International Islamic University Chittagong Dhaka Campus. The 3 credit, spring 2010 course covers internal data representation, abstract data types, and elementary and advanced data structures including arrays, lists, stacks, queues, trees, graphs, heaps, and B-trees. Students are required to have taken previous structured programming courses. The course meets three times a week for lectures and once a week for a sessional lab. Grading is based on class tests, homework, attendance, midterms, and finals. Students must complete programming assignments by given deadlines and copying will be penalized.

    Copyright:

    Attribution Non-Commercial (BY-NC)
    Download as DOC, PDF, TXT or read online from Scribd
    Download as doc, pdf, or txt
    of 1

    International Islamic University Chittagong

    Dhaka Campus
    Department of Computer Science & Engineering

    Course No.: CSE –2309 & 2310 Course Title: Data Structures (& Sessional)
    Credit Hours: 3 + 1 Session: Spring - 2010
    Instructor: Mohammed Shamsul Alam, Associate Professor, Department of CSE.
    Syllabus: Internal data representation; Abstract data types; Elementary data structures:
    arrays, lists, stacks, queue, trees, graphs; Advanced data structures: heaps, B-trees;
    Recursion; Sorting; Searching; Hashing; Storage management.
    Textbook: I will follow the following book as core textbook. Try to get a personal copy
    of this book.
    1. Seymour Lipschutz: (Schaum’s Outline Series) Theory and Problems of Data
    Structures, McGraw-Hill, 1986.
    Reference Books: There are also some other very standard texts on data structure in our
    library. We will consult these books from time to time. These are:
    1. D. Samanta: Classic Data Structures, Prentice Hall of India, 2003.
    2. Edward M. Reingold, Wilfred J. Hansen: Data Structures, CBS Publishers and
    Distributors.
    3. Mark Allen Weiss: Data Structures and Algorithm Analysis in C, 2/e, Addison
    Wesley Longman Inc, 2001.
    4. Robert L. Kruse, Bruce P. Leung, Clovis L. Tondo: Data Structures and Program
    Design in C, Prentice-Hall of India.
    5. Yedidyah Langsam, Moshe J. Augenstein, Aron M. Tenenbaum: Data Stuuctures
    using C and C++, 2/e, Prentice Hall India.
    6. Ellis horowitz, Sartaj Sahni, Dinesh Mehta: Fundamentals of Data Structures in C+
    +, Galgotia PublicationsPvt. Ltd., 2000.
    7. N. S. Kutti, P. Y. Padhye: Data Structures in C++, Prentice Hall of India, 2001.
    8. Nell Dale, Susan C Lilly: Pascal plus Data Structures, Algorithms and Advanced
    Programming, 3/e, Galgotia Publications, India.
    9. Robert Sedgewick, Algorithms in C, 3/e, Pearson Education, Inc, 2001.
    Prerequisites: CSE-1109 & 1110 Structured Programming (& Sessional), which was
    covered in your second semester.
    Class Schedule: We will have three lectures each of one hour duration and one sessional
    of two hours duration in a week. The schedule is as follows-
    Saturday : 12:00 – 01:55 – M513
    Sunday : 02:00 – 02:55 – M513
    Sunday : 03:00 – 04:55 – MCLAB2
    Tuesday: 3:00 – 4:55 – MCLAB1 (ACM)
    Grading Policy: CSE 2309: Class Tests 10, Homework 5, Class Attendance &
    Performance 5, Mid Term Examination 30 and Final Examination 50.
    CSE 2310: Programming Assignments 30, ACM Programming 10, Mid Term
    Examination 20 and Final Examination 40.
    Homework & Programming Assignments: You have to follow the deadline to submit
    your homework and assignments. No late submission will be accepted. Copying will be
    considered as an offence and will be penalized.

    You might also like