>> SJCNY-BR Fall 2018
College Experience Computer Programming Sat 10:00AM - 01:00PM, McE Room 203
Introduction to the methods used to store and access data efficiently, and their influence on program performance; methods introduced are linear lists, linked list, restricted lists, trees, hashing schemes, and graphs. Included are the related topics of recursion and sorting algorithms and their influence on algorithm efficiency.

COM-140 Computer Applications I Friday 01:40PM - 04:40PM, McE 402
This course is designed as an introductory course to provide the background necessary for the effective use of microcomputers. The emphasis is on the major applications of microcomputers: word processing, relational databases, spreadsheets, and the use of the Internet. The course includes “hands-on” experience with common applications software as well as an introduction to computer hardware. No previous computer related experience necessary.

COM-150 Intro to Computer Programming MW 01:40PM - 03:05PM, McE Room 402
Introduction to the methods used to store and access data efficiently, and their influence on program performance; methods introduced are linear lists, linked list, restricted lists, trees, hashing schemes, and graphs. Included are the related topics of recursion and sorting algorithms and their influence on algorithm efficiency.

COM-210 Data Structures and Algorithms Using Java W 06:15PM - 09:15PM, McE Room 405
This course explores specific classes of problems and their solutions. Fundamental questions concerning computational complexity, data storage and access, data encapsulation using objects, space/time bounds, optimal algorithms and data structures including lists, queues, and trees, are addressed. Algorithms for important classes of problems such as searching, sorting, and pattern-matching will be designed, implemented and tested in a laboratory environment. (Corresponds to ACM CS2.)

COM-304 Algorithm Design and Analysis M, W 11:10AM - 12:35PM, McE Room 203
Review of algorithm basics including growth functions (Big-Oh, Big-Theta and Big-Omega notation), algorithms for searching, sorting (Mergesort, Quicksort, Heap Sort), median order statistic, hashing, priority queues, binary trees (red-black and AVL), dynamic programming, amortized analysis, graph algorithms for shortest path problems, minimum spanning tree, min-cut and max-flow problems and NP completeness.

COM-360 Computer Commun. & Networking M 06:15PM - 09:15PM, McE Room 402
The Open System Interconnection (OSI) model provides the theoretical basis for the study of computer communications. Topics include the physical transmission of data, communication protocols and architecture, network addressing, services and applications such as file transfer (ftp), telnet, and e-mail. Topologies, design and implementation issues involved in LANs, WANs and internetworking will be explored.

COM-380 - Database Systems M, W 03:10PM - 04:35PM, McE Room 204
An introduction to the principal functions of a Database Management System (DBMS), physical data organization, relational query languages, and issues of data security and consistency.