Review of object-oriented concepts; Basic algorithms analysis; Fundamental data structures implementation strategies for stacks, queues, and linked lists; Recursion; Implementation strategies for tree and graph algorithms; Greedy Algorithms; Hash tables; Applications of data structures (e.g., data compression and string matching).

Propositional Logic, Propositional Equivalence, Predicates and Quantifiers, Nested Quantifiers, Rules of Inference, Introduction to Proofs; Sets, Set Operations, Functions, Sequences and Summations; Mathematical Induction, Strong Induction, Recursive Definitions and Structural Induction; Basics of Counting, Pigeonhole Principle, Permutations and Combinations, Binomial Coefficients, Discrete Probability, Probability Theory; Recurrence Relations, Solving Linear Recurrence Relations, Generating Functions, Inclusion-Exclusion.

Basic database concepts; Conceptual data modeling; Relational data model; Relational theory and languages; Database design; SQL; Introduction to query processing and optimization; Introduction to concurrency and recovery. 

Introduction to computer networks and layered architectures: Connectivity, topology, circuit and packet switching, TCP/IP and ISO models; Application layer: C/S model, DNS, SMTP, FTP, WWW; Transport layer: TCP and UDP, ARQ, congestion and flow control; Network layer: Internetworking, addressing and routing algorithms and protocols; Data link layer: Framing, error detection and correction, medium access control and LANs; Physical layer: Principles of data communications, circuit switching, encoding, multiplexing and transmission media; Introduction to network security. 
Note: This course cannot be taken for credit with COE 344.

Security properties; Confidentiality, integrity, authentication, non-repudiation; Attack vectors, malicious software and countermeasures; Risk management and analysis; Security mechanisms; Secure software development; Defensive programming; Input sanitization; Symmetric and public-key cryptography; User authentication and access control; Internet security: Email and web security, network security protocols and standards such as IPSec and SSL/TLS; Security technologies and systems: Firewalls, VPNs and IDSs/IPSs; Information security process, ethical and legal issues
Prerequisites: ICS 343 or COE 344

Basic algorithmic analysis; Analysis of iterative and recursive algorithms; Advanced algorithmic design techniques (induction, divide and conquer, dynamic programming, backtracking); The complexity classes P and NP; Basic computability; Parallel algorithms

Regular grammars: Equivalence of DFA, NDFA and regular expressions, pumping lemma, emptiness and membership; Context-Free Grammars: parsing and ambiguity, normal forms, applications, equivalence of PDA's and CFG's, pumping lemma, emptiness and membership; Turing machines: Programming techniques for Turing machines, universal Turing- June 2009 CS Student Guide Page 17 of 19 machine; Undecidability: Recursively enumerable and recursive languages, undecidability, problem reduction, undecidable problems of CFG's, RE's and TM's.

AI history and applications; Intelligent agents and expert systems; Introduction to AI programming; Problem solving agents by uninformed, heuristic and local search; Constraint satisfaction and programming, games and adversarial search; Knowledge-based agents: Propositional and first-order logic, Forward and backward chaining and inference; Planning and reasoning in uncertain situations; Basics of machine learning; Natural language processing; Exposure to other applications of AI (e.g. Vision and Robotics)
Co-requisites: STAT 319

A continuous period of 16 weeks spent as a normal “new” employee in industry, business, or government agencies with the purpose of familiarizing students with the real world of work and enabling them to integrate their learning to a real work environment. During this period, a student is exposed to a real-life work in the field and work as a normal employee. Each student is required to participate with at least one project. Students are required to submit progress reports during the work period. Students are also required to give a presentation and submit a final report on their experience and the knowledge they gained during their work.

Prerequisites: ENGL 214, ICS 321, SWE 206, SWE 363, Completion of at least 86 hours, Major and Cumulative GPA of at least 2.0.

A continuous period of 8 weeks spent as a normal employee in industry, business, or government agencies with the purpose of familiarizing students with the real world of work and enabling them to integrate their classroom learning to a real work environment. During this period, a student is exposed to a real-life work in the field. Students are required to submit progress reports during the work period. Students are also required to give a presentation and submit a final report on their experience and the knowledge they gained during their Training.

Programming paradigms: Object-oriented, imperative, functional, and logic; Application development in these paradigms; Fundamentals of Language Design: Syntax and semantics; Language implementation: virtual machines; Compilation, interpretation, and hybrid.

Project-oriented course in which students work in teams on an applied real-world problem of their interest, go through its software development lifecycle in order to develop a prototype software solution for the problem at hand. The senior project offers the opportunity to integrate the knowledge acquired in preceding courses, as well as promote and instill communication skills, writing skills, and lifelong self-learning. 

Compiler techniques and methodology; Organization of compilers; Lexical and syntax analysis; Parsing techniques; Object code generation and optimization, detection and recovery from errors; Contrast between compilers and interpreters.

Applications of computer graphics; Graphics systems and devices; Output primitives and their attributes; Geometric transformations; Window to viewport mapping and clipping; Curves and surfaces; Three-dimensional viewing; Hidden surface removal; illumination and color models; Animation.

Data preprocessing, data warehousing and OLAP; Security, transaction processing, concurrency control techniques, and backup and recovery of relational databases; Introduction to non-relational database systems such as NoSQL and NewSQL databases.

History and evolution of operating systems; Types of operating systems; Operating system structures; Process management: processes, threads, CPU scheduling, process synchronization; Memory management and virtual memory; File systems; I/O systems; Security and protection; Distributed systems; Case studies.

Introduction to penetration testing and ethical hacking, requirements and legal issues, setting up virtual lab; Exploring Kali Linux and Metasploit framework, hacking and penetration testing phases; Information gathering through passive and active reconnaissance, footprinting, social engineering, port scanning; Advanced fuzzing techniques; Exploitation, password attacks and gaining access to remote services; Web penetration testing and web-based exploitation; Maintaining access with backdoors and rootkits; Bypassing defense applications; Wireless and mobile device hacking techniques; Writing penetration testing report; Tools and programming available for penetration testers in both Windows and Linux platforms such as Kali Linux, OpenVAS, Burp, NMAP, Netcat, Python, etc

Overview of network design and management; Design methodologies; Network management strategies; Network configuration management; Network management protocols: SNMP, and RMON; Network management tools and systems; Network management applications; Desktop and web-based network management; Network troubleshooting.
Note: This course cannot be taken for credit with COE 444.
Prerequisites: ICS 343 or COE 344

Network Management Standards, Models, and protocols. Network Management Applications, Tools, and Systems. Remote Monitoring and Management (RMM). Large scale network management techniques and systems. Security of LANs, wireless LANs, and cellular networks. Authentication, authorization, accountability, and access controls of computer networks. Network protection tools: Firewalls, Intrusion Detection and Prevention Systems, Sandboxing, provies. Study of diverse attack types: DDoS, spoofing, flooding, hijacking, poisoning, DNS, replay attacks and their countermeasures. Hands-on experiences in network security using Kali Linux. Hands-on experiences in implementing secure, manageable networks. 
Note: Cross-listed with COE 555.
Prerequisites: ICS 343 or COE 344 or EE 400

Introduction to high performance computing: Types of parallel computers, system architectures and performance measures; Message passing programming; Complexity analysis of parallel algorithms; Embarrassingly parallel computations; Partitioning and divide-and-conquer strategies; Pipelined computations; Synchronous computations; Load balancing and termination detection; Programming with shared memory; Parallel sorting algorithms; Numerical algorithms; Parallel image processing; Searching and optimization.
Note: It cannot be taken for credit with COE 420.
Prerequisites: ICS 202 and Junior Standing 

Performance measures and evaluation techniques; Advanced network architectures and differentiated services in IP networks; Switched, fast and gigabit Ethernet; VLANs; Wireless LANs; ISDN and ATM; Frame relay; Mobile computing and mobile IP; VPN and enterprise networks; Emerging network trends and technologies.
Note: It cannot be taken for credit with COE 446.
Prerequisites: ICS 343 or COE 344

Installing, configuring, securing, and administering network services. Assessing tools for improving data/service protection; Securing remote and local network infrastructures; DNS servers, web servers, network file sharing, and other common network communication components; Practical experience through hands-on lab exercises.