CMPE 211 ( Data Structure )

Categories: Computer Science
Wishlist Share
Share Course
Page Link
Share On Social Media

About Course

This course covers the basic science behind the use of computers to provide effective and efficient methods for carrying out tasks. Tasks examined include data storage and retrieval, sorting and searching. To carry out these tasks, both algorithms and structures for the storage of data need to be specified. Mathematical tools have to be developed that enable us to measure the fundamental effectiveness of algorithms and in particular the way these algorithms scale as the size of the task being performed increases. This course introduces the basic sorting and searching methods and dynamic data structures such as linked lists, trees and hash tables

Show More

What Will You Learn?

  • Upon successful completion of the course, students will be able to;
  • Recognise and define data structures, such as lists, queues, priority queues, trees, balanced search trees, hash tables.
  • Discuss and compare their implementations
  • Define fundamental characteristics of a number of data structures rigorously.
  • Use recursive and loop invariants to analyse the correctness of programs.
  • Use asymptotic notation to analyse algorithm performance.

Course Content

intro To course
Introduction to course, Java language prerequisites: Java data types (primitive types/reference types), type conversion (implicit vs casting), arrays and array processing, static methods, method overloading, using external libraries

  • intro to course
    01:10:00

Data Abstraction

Linked List

Stack and Queue

Doubly Linked List

time complexity

MidTerm Revision

Merge Sort

Quick Sort

Heap Sort

Student Ratings & Reviews

No Review Yet
No Review Yet
Open chat
💬 كيف يمكنني مساعدتك؟
مرحبا Ostazy
كيف يمكن ان اساعدك