Skip to main content

National College Credit Recommendation Service

Board of Regents  |  University of the State of New York

Computer Science - Maalot Educational Network

Descriptions and credit recommendations for all evaluated learning experiences

Length:

39 hours (13 weeks). 

Dates:
September 2009 - Present
Objectives:

Upon successful completion of the course, students will be able to apply different advanced data structures in problem solving and create and use data structures in a program.

Instruction:
Topics include: sorting algorithms, exchange, selections, tree, insertion, merge and radix sorts, heaps, searching techniques, b-trees, b+ trees, red-black trees, hashing, and graphs. Methods of instruction include lecture and lab.
Credit recommendation:

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

Length:

39 hours (13 weeks). 

Dates:
September 2009 - Present.
Objectives:

Upon successful completion of the course, students will be able to: discuss concepts pertinent to web based programming; program a web-based interactive application interacting with a relational database for the storage and retrieval of information; and build advanced web pages using  HTML, CSS, Javascript and Php.

Instruction:

Major topics are: design of interactive web pages, scripting, server side programming and control, session persistence, HTML, style sheets, the Document Object Model - accessing objects and properties, manipulating them, trigger events, scripting, browser compatibility issues, Php and MySql.NOTE: this course is for non-computer majors. 

Credit recommendation:

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

Length:

Version 1: 39 hours (13 weeks). Version 2: 52 hours (17 weeks). 

Dates:

Version 1: September 2009 - March 2015. Version 2: April 2015 - Present.

Objectives:

Version 1 and 2: Upon successful completion of the course, students will be able to: understand the basic components of a computer system; be familiar with terms being used in computer world today; be knowledgeable in the Windows Operating System; and demonstrate proficiency in the most common Microsoft Office applications.

Instruction:

Version 1 and 2: This course may be delivered in a classroom or online format. The course is intended as an introduction to computers and the basic application software categories of word processing, database and spreadsheets using Microsoft Office software applications.

Credit recommendation:

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

Length:

Version 1 and 2: 39 hours (13 weeks).

Dates:

Version 1: September 2009 - August 2014. Version 2: September 2014 - Present.

Objectives:

Version 1 and 2: Upon successful completion of the course, students will be able to write programs in C++ using basic and advanced features of the features of the language.

Instruction:

Version 1 and 2: Major topics are: arithmetic and relational operators, data types, control structures, functions (parameters call by value and call by reference), pointers and addresses, arrays, strings, structures, enumerations, type conversions, default parameters, dynamic allocation of memory, and references.

Credit recommendation:

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

Length:

Version 1 and 2: 39 hours (13 weeks).

Dates:

Version 1: September 2009 - August 2014. Version 2: September 2014 - Present. 

Objectives:

Version 1 and 2: Upon successful completion of the course, students will be able to approach programming problems with an object oriented approach and use object-oriented techniques to solve programming problems.

Instruction:

Version 1 and 2: Major topics are: declaring classes, classes with strings, dynamic allocated memory and private functions as members, abstract data types, inheritance, encapsulation, implementation hiding, polymorphism, static variables, multiple and virtual inheritance, containment, virtual functions and binding, templates.

Credit recommendation:

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

Length:

39 hours (13 weeks). 

Dates:

September 2009 - Present.

Objectives:

Upon successful completion of the course, students will be able to understand the general structure of a digital computer, the structure of machine language, BIOS, input/output rules, RISC processors, peripheral devices and secondary storage.

Instruction:

Major topics are: the main roles and components of the ALU, CPU, main memory, I/O, BIOS and the connections between them, RISC processors and multiple processors and x.86 architecture.

Credit recommendation:

In the upper division baccalaureate degree category, 3 semester hours as an elective in Computer Science (2/11) (4/16 revalidation) (3/21 revalidation).

Length:

39 hours (13 weeks). 

Dates:

September 2009 - Present.

Objectives:

Upon successful completion of the course, students will be able to explain different data structures, how they are used in problem solving, and create and use data structures in a program to be posted.

Instruction:

Major topics are: dynamic storage allocation, pointers, linked lists, recursion, stacks, queues, circular and doubly linked lists, binary trees, general trees, and sorting and searching methods.

Credit recommendation:

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

Length:

39 hours (13 weeks). 

Dates:

September 2009 - Present.

Objectives:

Upon successful completion of the course, students will be able to: discuss database concepts, such as data normalization, data modeling, query design, relationships, SQL, client/server and transation processing and apply them by designing, building and implementing a fully functional relational database using either Microsoft Access and/or SQL Server.

Instruction:

Major topics are: database concepts and definitions, logical organization, components of databases, database architecture and data modeling, data normalization, data descriptions and query languages, SQL, query processing, transaction processing, database integrity, database design, client/server environment, Microsoft Access, data access using ADO and DAO. Pre- or co-requisites: Introduction to Computers, Visual Basic.

Credit recommendation:

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

Length:

39 hours (13 weeks).

Dates:

September 2009 - Present.

Objectives:

Upon successful completion of the course, students will be able to: analyze a problem, write an algorithm for it and code the solution; debug and thoroughly test the program; and demonstrate proficiency in concepts of information technology and computer systems.

Instruction:

Major topics are: processing numeric and character information, debugging and testing (verification) of programs, program structure, arithmetic operations, looping, input/output operations, arrays, subroutines, character string manipulation, sorting and searching. General concepts and terminology of computer technology including hardware and software fundamentals, graphics, multimedia, networking, security and privacy issues are also explored. 

Credit recommendation:

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

Length:

39 hours (13 weeks).

Dates:

September 2009 - Present.

Objectives:

Upon successful completion of the course, students will be able to: describe the basic structure of an operating system and its components; understand fundamental operating systems abstractions such as processes, threads, files, and semaphores; understand the principles of concurrency and synchronization and interprocess communication; understand basic resource management techniques (scheduling, memory management) and principles and how they can be implemented. Other concepts include issues of performance, fairness objectives, and avoiding deadlocks.

Instruction:

Major topics are: general introduction to operating systems; the services provided to users, and how users can request services through system calls; algorithms for and approaches to CPU scheduling; disk scheduling; file management; memory management; input/output handling; concurrent programming; and problems such as critical sections, process coordination, and deadlock and solutions to these problems.

Credit recommendation:

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

Top