Artificial Intelligence III

Compare

Overview For an autonomous agent to behave in an intelligent manner it must be able to solve problems. This means it should be able to arrive at decisions that transform a given situation into a desired or goal situation. The agent should be able to imagine the consequence of its decisions to be able to identify the ones that work. In this first course on AI we study a wide variety of search methods that agents can employ for problem solving.

Parallel Algorithm

Compare

Overview Odd-Even Merging Network - Mesh Connected Computer - Lexicographic Combination - k th Element (EREW model) - k th Smallest Element in X+Y (CREW algorithm) - Bitonic merge - Merging Algorithm (EREW model)

Microsoft Excel 2013

Compare

Overview Introduction - Making Data Beautiful - Working with Cells - Formatting Numbers - Inserting Rows and Columns - Copy and Move Ranges - Worksheet Tips - Tables - Working with Tables - Total Row and Sorting Tables - Formatting Your Worksheet - Fitting Text and Merging Cells - Formatting Cells - Format Painter and Protecting Workbooks - Templates and Printing - Formulas and Functions - PEMDAS and Naming Ranges - Awesome Formula Tips - Referencing Cells Properly - Using Formulas in Tables - String Functions - More Cool String Functions - Boring Date and Time Stuff - Happy Erection Day! - Cool Counting Functions

Git Tutorials

Compare

Overview How to Download and Install Git - Config Our Username and Email - Creating Our First Repository - Commit - Adding Files and the Commit Log - Git Workflow - How to Edit Files - Viewing the Changes That You Made - Comparing the Staging Area with the Repository - How to Delete Files - How to Move and Rename Files - Working with an Actual Website - How to Commit Directly to the Repository - Checkout this video (Git it?) - Unstage Files - Getting Old Versions from the Repository - GitHub - Pushing to a GitHub Repository

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