Skip to main content

National College Credit Recommendation Service

Board of Regents  |  University of the State of New York

Maalot Educational Network | Evaluated Learning Experience

Data Structures (COS241)

Length: 

39 hours (13 weeks). 

Location: 
Maalot, Jerusalem, and other authorized locations.
Dates: 

September 2009 - Present.

Instructional delivery format: 
Traditional classroom model
Hybrid course/exam
Learner Outcomes: 

Upon successful completion of the course, students will be able to: explain what data structures are and why they are important; implement and operate upon arrays, ordered arrays, linked lists of various types, stacks, queues, deques, binary trees and binary search trees; analyze time complexity of data structures and their operations (insertion, deletion, searching, etc.); identify which data structures and algorithms are more suited to particular tasks and scenarios; identify and appreciate efficiency in programming; explain and utilize pointers; identify practical applications of data structures; understand the beauty of recursion; trace through recursive algorithms with a clear understanding of how they work and what’s being done at each step in the code; utilize recursion in one’s own programming; differentiate between different types of trees; identify different parts of a tree as well as a tree’s size, height and the depth of a given node; implement binary trees with multiple underlying data structures.

Instruction: 

Topics covered are: Pointers, algorithm and data structure complexity analysis (big o), linked lists, recursion, stacks, queues and deques, circular and doubly linked lists, binary trees, general trees.

Credit recommendation: 

In the lower division baccalaureate/associate degree category, 3 semester hours in Computer Science (2/11) (4/16 revalidation) (3/21 revalidation).

Top