Course Descriptions (Page 3)

CSCI 271 - CSCI 333

CSCI 271 Data Structures

An in-depth presentation of recursion, collections and iterators, fundamental techniques in graphics, and threading. Students implement linked lists, stacks, queues, trees, heaps, graphs, hash tables and related algorithms. Students implement a significant programming project.
Prerequisites: MATH 200 Precalculus and CSCI 252 Computer Science II Using Java.

CSCI 306 Introduction to .NET using Visual Basic
An introduction to the .NET programming environment and the object oriented programming model using the Visual Basic .NET programming language. Topics include object-oriented programming, Visual Basic .NET objects such as forms and controls, code construction, functions and subroutines, parameter passing, looping and other programming structures, persistence of data using text files and database tables, error handling, and debugging of programs. Note: Students cannot receive credit for both CSCI 306 Introduction to .NET using Visual Basic and 63.205 Introduction to .NET using Visual Basic.
Prerequisite: CSCI 252 Computer Science II using Java.

CSCI 317 Discrete Structures
An intermediate to advanced course on discrete mathematical structures used in computer science. Students study abstract structures used to represent discrete objects and the relationships between these objects. Topics include principles of logic, incompleteness, diagonal proof, inductive proof, t and correctness of simple algorithms. Coverage of set theory will extend to relations, graphs, functions, countability, formal languages, and non-well-foundedness. Students write recurrences to define computable functions and explore discrete probability and randomness from a computational viewpoint.
Prerequisites: CSCI 271 Data Structures and either MATH 215 Finite Mathermatics or MATH 292 Discrete Mathematics I

CSCI 320 Windows Server & Client Management
Designed to teach students how to plan, set up, and configure Windows server and client workstations with TCP/IP enterprise protocol; monitor and control security within the systems network; administer user accounts, system disks, file system, mail, print and remote access services; and recover from server failures.
Prerequisite: CSCI 252 Computer Science II Using Java.

CSCI 321 Digital Electronics
An introduction to the techniques of designing and constructing digital circuits with emphasis on understanding the logic circuits of a digital computer. Topics discussed include: application of Boolean algebra to logic design; operation of diodes and transistors; construction of IC logic gates; characteristics of TTL, ECL and CMOS logic families; using Karnaugh Maps to design combinatorial circuits; decoders; priority encoders; multiplexers; parity circuits; adders, subtracters and ALU’s; latches and flipflops; counters; shift registers, and the design and analysis of synchronous state machines. Includes a weekly three-hour laboratory period.
Prerequisite: CSCI 152 Computer Science I Using Java.


CSCI 333 Object-Oriented Programming Using C++
A presentation of advanced features of programming with an emphasis on class construction and object-oriented design and programming. Topics covered include namespaces, encapsulation, function and operator overloading, templates, collection classes, containers, iterators, inheritance, polymorphism, and exception handling. Course touches on Standard Template Libraries (STL). NOTE: Students may not receive credit for both CSCI 333 Object –Oriented Programming Using C++ and 63.259 Object-Oriented Programing Using C++.
Prerequisite: CSCI 252 Computer Science II Using Java.

100 State Street

PO Box 9101

Framingham, MA 01701-9101

|

Phone: 508-620-1220


Mobile Version

Copyright © 2014 Framingham State University