Theory of Automata, Formal Languages and Computation

Compare

Overview Grammars, Languages generated, Chomskian Hierarchy, CFG, Ambiguity, Reduced grammars, Normal forms - FSA,NFSA, NFSA with moves

System Analysis and Design

Compare

Overview Data and Information - Types of information: operational, tactical, strategic and statutory - why do we need information systems - management structure - requirements of information at different levels of management - functional allocation of management

Principles of Compiler Design

Compare

Overview An overview of a compiler - Lexical Analysis - Syntax Analysis - Semantic Analysis - Intermediate Code Generation - Run-Time Environments - Local Optimizations - Machine Code Generation - Global Register Allocation - Machine-independent Optimization - Instruction Scheduling and Software Pipelining - Automatic Parallelization

Riemann Hypothesis and its Applications

Compare

Overview Riemann Hypothesis is one of the most important unresolved conjectures in mathematics. It connects the distribution of prime numbers with zeroes of Zeta function, defined on the complex plane. A number of algorithms in algebra and number theory rely on the correctness of Riemann Hypothesis or its generalizations - This course will describe the connection between prime distributions and Zeta function leading to the Riemann Hypothesis proving Prime Number Theorem along the way. It will then investigate generalizations of Riemann Hypothesis and their applications to computer science problem

Ubuntu Tutorials

Compare

Overview Install Linux Ubuntu on Oracle VirtualBox in Windows 8 / Windows 8.1 - Install Linux Ubuntu on virtualbox in windows 7 / windows 8 - 10 Things To Do After Installing Ubuntu Linux - How to use Ubuntu - Ubuntu Tutorial for Beginners

Compiler Design I

Compare

Compiler design principles provide an in-depth view of translation and optimization process. Compiler design covers basic translation mechanism and error detection & recovery. It includes lexical, syntax, and semantic analysis as front end, and code generation and optimization as back-end.

Computer Architecture I

Compare

Overview Introduction, Amdahl's law, CPI equation - CPI equation, research practices, instruction set architecture - Instruction set architecture, case study with MIPS-I - Case study with MIPS - Binary instrumentation for architectural studies: PIN - Basic pipelining, branch prediction - Dynamic scheduling, speculative execution - Virtual memory and caches - Topics in memory system, DRAM and SRAM technology - Case study: MIPS R10000 - Case study: MIPS R10000 - Case study: Alpha 21264 - Case study: Intel Pentium 4 - Input/Output - Simultaneous multithreading, multi-cores

Theory of Computation II

Compare

Overview Regular languages:Introduction: Scope of study as limits to compubality and tractability - Why it suffices to consider only decision problems, equivalently, set membership problems. Notion of a formal language - DFAs and notion for their acceptance, informal and then formal definitions.