The campus will remain closed until 12 noon Thursday, 02/13/25. Students should log into Canvas for specific class information from their instructors. Please contact event organizers for information on specific activities. Normal operations will resume at 12pm on Thursday.
Computer scientists turn this miraculous machine’s potential into power. Beginning with a study of the design and development of automated computation and information processing systems, they incorporate theoretical mathematics, logic, and engineering to improve hardware and software, conceive new applications, explore artificial intelligence, and push the boundaries of automation.
LTU’s certificate in computer science will introduce you to a challenging and rewarding career in a dynamic field with unparalleled projected employment growth. It is the jumping-off point for a wide variety of potential career paths in both the public and private sectors. Opportunities await in such diverse specialties, as computer security, data mining, web applications, game development, robotics, and artificial intelligence. Computer Science professionals are in great demand by private businesses, financial institutions, healthcare providers, and government.
Why LTU?
Course Name
Course #
Credits
Introduction to programming with C++. Binary, two’s complement, decimal, hex, and octal representations. Variable types. Simple, iterative, and conditional statements. Procedure and functions with parameters by value and reference with or without a returning value. Arrays and vectors, multidimensional arrays, bubble and selection sorts, linear and binary search. Pointer and dynamic memory allocation, character and C-strings, file input/output (sequential). Classes, friends, array of objects, and operators’ overloading. Inheritance, polymorphism, virtual function, and recursion.
MCS1514
4
Records, advanced file input/output (random access), dynamic memory allocation. Static and dynamic implementation of stacks, linked lists (ordered and unordered), queue (regular and priority), circular queues. Selection and insertion sort, binary search. Lecture 3 hrs., Lab 1hr.
MCS2514
4
Number Theory, review of induction and recursion, advanced counting, equivalence, partial ordering, graphs, trees.
MCS2523
3
Analysis of algorithms, Big Oh notation, asymptotic behavior. Advanced sorting (heapsort, quicksort), external sorting. Binary, multiway, and AVL trees. Lecture 4 hrs.
MCS2534
4
Organization of database systems. Data definition, retrieval, manipulation. Relational databases, SQL. Practice using standard databases.
MCS2543
3
This course is a brief overview of software engineering topics including software development models, requirements, software design & implementation, software debugging & testing, software maintenance, software quality & metrics, and software project management. Focused in depth learning goals include system modelling & analysis tools, model-based design, coding standards, IDE tools, version control systems, and the introduction of agile software development methodologies. In addition to theories, students will practice in the development of a long-running software project applying & utilizing software engineering techniques & tools covered in class.
MCS3643
3
Basic Structure of computer hardware and assembly programming. Internal representation, processing unit arithmetic, memory addressing modes, stack processing, CISC, RISC. Lecture 3 hrs.
MCS3663
3
Beginning course on theory of computation. Regular languages, finite automata, context-free language, Turing Machine, Chomsky hierarchy, applications to parsing. Lecture 3 hrs.
MCS4653
3
This course focuses on the core concepts that underlie contemporary operating systems. It introduces the structure and responsibilities of operating systems, discusses the cutting-edge advances in computing that are redefining operating systems, and addresses design considerations, such as performance, fault tolerance, security, modularity, and cost.
Topics include Operating System Architecture, Process Concepts and Management, Thread Concepts, Asynchronous Concurrent Execution, Concurrent Programming, Deadlock and Indefinite Postponement, Processor Scheduling Algorithms, Real Memory Organization and Management, Virtual Memory Organization and Management, Disk Performance Optimization, RAID, File Systems, and Case Studies.
MCS4663
3
Total Credits:
30
MCS 1514 and MCS 2514 may be transferred in with a grade of B or better.
Use Your Cell Phone as a Document Camera in Zoom
From Computer
Log in and start your Zoom session with participants
From Phone
To use your cell phone as a makeshift document camera
