Topic outline

• Select topic General

  General

  Collapse all Expand all

  Lecturer : Nor Bahiah Binti Hj Ahmad Dayang Norhayati Bte Abang Jawawi Semester : Semester I 2010/2011
  Synopsis : This course provides an introduction to data structure and algorithms, types of data structures and programming principles. Student will learn abstract data type concepts using class and apply ADT concept in the implementation of data structures. Recursive function, algorithm efficiency, order of magnitude analysis and Big O notation will be discussed. Students will implement operations that can be applied to data structures using various sorting and searching techniques. Further, students will be exposed to linear data structures such as linked lists, stack and queue. Non-linear data structures such as tree and graphs will also be discussed. At the end of the course, students should be able to implement and apply the theory and concepts of data structure in the mini project which is conducted in group.
  This work,SCJ2013 Data Structure and Algorithm by Nor Bahiah Binti Hj Ahmad and Dayang Norhayati Bte Abang Jawawi is licensed under a Creative Commons Attribution-NonCommercial-ShareAlike 3.0 Unported License
• Select topic Topic 1

  Topic 1
  Introduction to Data Structure & Algorithm

  • Introduction to data structures & algorithm involving problem solving, algorithm concept and data structure concept.

  • Select activity Introduction to Data Structures & Algorithm

    

    Introduction to Data Structures & Algorithm File
  • Select activity Module 1 - Introduction to Data Structure

    

    Module 1 - Introduction to Data Structure File
• Select topic Topic 2

  Topic 2

  Abstract Data Type and C++ Class
  

  • Abstract data type concept and review C++ programming.

  • Select activity ADT and C++ Class

    

    ADT and C++ Class File
  • Select activity Module 2 - Abstract DaTa Types and C++

    

    Module 2 - Abstract DaTa Types and C++ File
• Select topic Topic 3

  Topic 3
  Recursive & Algorithm Efficiency

  • How to measure algorithm efficiency and the meaning of “big O notation”
  • Problem solving using characteristics using recursive, trace the implementation of recursive function, and write recursive function in solving a problem.

  • Select activity Recursive

    

    Recursive File
  • Select activity Algorithm Efficiency Analysis

    

    Algorithm Efficiency Analysis File
  • Select activity Module 3 - Recursive

    

    Module 3 - Recursive File
  • Select activity Module 4 - Algorithm Efficiency

    

    Module 4 - Algorithm Efficiency File
• Select topic Topic 4

  Topic 4
  Sorting Algorithms  

  • The purpose of sorting technique, simple sort techniques in problem solving, divide and conquer sorting technique in problem solving, and how to analyze the efficiency of the sorting technique.      
  • Selection sort implementation , analysis, issue and algorithm complexity.     
  • The insertion sort strategy, implementation, insertion sort best case and worse case, insertion sort analysis and algorithm complexity.    
  • Bubble sort activity, implementation, analysis, improved bubble sort and algorithm complexity.         

  • Select activity Introduction to Sorting

    

    Introduction to Sorting File
  • Select activity Bubble Sort

    

    Bubble Sort File
  • Select activity Selection Sort

    

    Selection Sort File
  • Select activity Insertion Sort

    

    Insertion Sort File
  • Select activity Module 5 - Sorting

    

    Module 5 - Sorting File
• Select topic Topic 5

  Topic 5
  Advanced Sort

  • The quick sort operation, implementation, and quick sort analysis.
  • The merge sort operation, implementation, and merge sort analysis.

  • Select activity Merge Sort

    

    Merge Sort File
  • Select activity Quick Sort

    

    Quick Sort File
• Select topic Topic 6

  Topic 6
  Searching Techniques
  

  • Searching technique concept and the purpose of searching operation, the implementation of basic searching algorithm for sequential and binary , the efficiency and implementation searching technique in problem solving.

  • Select activity Introduction & Sequential Search

    

    Introduction & Sequential Search File
  • Select activity Binary Search

    

    Binary Search File
  • Select activity Module 6 - SEARCHING

    

    Module 6 - SEARCHING File
• Select topic Topic 7

  Topic 7
  Linked List

  • The linear list concept using array and linked list, list variation and basic operation, the implementation and operation and program that can implement linked list concept.  

  • Select activity Introduction to List

    

    Introduction to List File
  • Select activity Module 7 - LINKED LIST

    

    Module 7 - LINKED LIST File
• Select topic Topic 8

  Topic 8
  Linked List Continued...

  • Select activity Linked List Implementation

    

    Linked List Implementation File
• Select topic Topic 9

  Topic 9
  Stack

  • Stack concept and its structure, stack operation, and how to implement stack using array and linked list.

  • Select activity Stack

    

    Stack File
  • Select activity Module 8 - STACK

    

    Module 8 - STACK File
• Select topic Topic 10

  Topic 10
  Stack Continued...

  • Select activity Stack Application

    

    Stack Application File
• Select topic Topic 11

  Topic 11
  Queue

  • The queue concept and applications, queue structure and operations that can be done on queue and how to implement queue using array and linked list : linear array, circular array, linear link and circular list.

  • Select activity Queue - Array Implementation

    

    Queue - Array Implementation File
  • Select activity Queue - Linked List Implementation

    

    Queue - Linked List Implementation File
  • Select activity Module 9 - QUEUE

    

    Module 9 - QUEUE File
• Select topic Topic 12

  Topic 12
  Tree

  Tree concept and term related to tree, the characteristics of general tree, binary tree and binary search tree, basic operation of tree, and how to implement and apply tree in problem solving and in programming.

  • Select activity Introduction to Tree

    

    Introduction to Tree File
  • Select activity Module 10 - TREE

    

    Module 10 - TREE File
• Select topic Topic 13

  Topic 13
  Tree Continued...

  • Select activity Binary Search Tree

    

    Binary Search Tree File
• Select topic Topic 14

  Topic 14

  Not available
• Select topic Topic 15

  Topic 15

  Not available
• Select topic Topic 16

  Topic 16

  Not available
• Select topic Topic 17

  Topic 17

  Not available
• Select topic Topic 18

  Topic 18

  Not available