Course Catalogue

Cryptography is an indispensable tool for protecting information in computer systems. This course contains the inner workings of cryptographic systems and how to correctly use them in real-world applications. The course begins with a detailed discussion of how two parties who have a shared secret key can communicate securely when a powerful adversary eavesdrops and tampers with traffic. Examine many deployed protocols and analyze mistakes in existing systems. Discussion on public-key techniques that let two parties generate a shared secret key.

The overview of Principles of Forensics and IR, Data Collection Techniques, Forensic Hardware, Chain of Custody, Basic Incident Response Process, Pre-Incident Preparation, Documentation Requirements, Common Approaches, Containment and Remediation Strategies, Malware Footprints, Data Volatility, Installed Software and Hotfixes, Persistence Mechanisms, Windows Audit Policies, Malware Analysis, Prefetch Analysis, The Windows Registry, Windows Event Log Analysis, File Carving, Email Header Analysis, Determining File Headers, Extraction of Attachments, Extracting Specific File Types, Deleted Files and Recovery, Use of Hash Sets, Adding Hash Sets, Advantages of Timeline, Timeline Creation, Sources of Network Data, PCAP Analysis with Wireshark, Network Footprint Basics of Memory Acquisition and Analysis, Highlight Power of Memory, Live Response Best Practices and Order of Volatility, Following the Process Tree and Unix/Linux File Permissions.

Background, history, classifications, programming languages for embedded systems. Combinational logic and transistors, RT-level combinational and sequential components, customized single purpose processor design. Structure of microcontrollers, CPU, memory and I/O structure, various microcontrollers, ARM. I/O and memory mapping, addressing modes, interrupts and traps, bus protocols, DMA, system bus configurations, RAM, ROM, SDRAM, flash, basic I/O interfaces. Parallel ports, LEDs, pushbutton, keypad, 7-segment display, LCD display, touchscreen, timers and counters, serial Interface, networked embedded systems. C-language primer, state machines, streams, circular buffers. Development environment, hardware/software debugging techniques, performance analysis, use of hardware debugging modules. CPU and hardware acceleration, multiprocessor performance analysis. Design methodologies and flows, requirement analysis, specifications description, system analysis and architecture design, quality assurance.

This course covers general introductory concepts in the design and implementation of distributed systems, covering all the major branches such as Cloud Computing, Grid Computing, Cluster Computing, Supercomputing, and Many-core Computing. The specific topics that this course will cover are: scheduling in multiprocessors, memory hierarchies, synchronization, concurrency control, fault tolerance, data parallel programming models, scalability studies, distributed memory message passing systems, shared memory programming models, tasks, dependence graphs and program transformations, parallel I/O, applications, tools (Cuda, Swift, Globus, Condor, Amazon AWS, OpenStack, Cilk, gdb, threads, MPICH, OpenMP, Hadoop, FUSE), SIMD, MIMD, fundamental parallel algorithms, parallel programming exercises, parallel algorithm design techniques, interconnection topologies, heterogeneity, load balancing, memory consistency model, asynchronous computation, partitioning, determinacy, Amdahl's Law, scalability and performance studies, vectorization and parallelization, parallel programming languages, and power.