Syllabus

Artificial Intelligence OU Syllabus

UNIT-I Introduction, History, Intelligent Systems, Foundations of AI, Sub-areas of AI, Applications, Problem Solving. StateSpace Search and Control Strategies: Introduction, General Problem Solving, Characteristics of Problem, Exhaustive Searches, Heuristic Search Techniques, Iterative-Deepening, A*, Constraint Satisfaction. Game Playing, Bounded Look-ahead Strategy …

Artificial Intelligence OU Syllabus Read More »

Managerial Economics & Accountancy (MEA) OU Syllabus

UNIT–I Meaning and Nature of Managerial Economics: Managerial Economics and its useful nessto Engineers, fundamental Concepts of Managerial Economics-Scarcity, Marginalism, Equimarginalism, Opportunity costs, Discounting, Time Perspective, Risk and Uncertainty, Profits, Case study method. UNIT–II Consumer Behavior: Law of Demand, Determinants, …

Managerial Economics & Accountancy (MEA) OU Syllabus Read More »

Computer Graphics  OU Syllabus

UNIT-I Graphics Systems and Models: Graphics system, Images, Physical and Synthetic, Imaging system, Synthetic camera model, Programming interface, Graphics architectures, Programmable pipelines, Performance characteristics. Graphics Programming: Programming two-dimensional applications, Open GLAPI, Primitives and attributes, Color, Viewing and Control functions. UNIT-II …

Computer Graphics  OU Syllabus Read More »

Operating Systems OU Syllabus

UNIT-I Introduction to Operating Systems: OS structure and strategies, Process concepts, Multithreaded Programming, Process scheduling, Process synchronization, Deadlocks. UNIT-II Memory management strategies with example architectures: Swapping, Contiguous allocation, Paging, Segmentation, Segmentation with paging, Virtual memory management: Demand paging, Page replacement, …

Operating Systems OU Syllabus Read More »

Automata, Languages & Computation (ALC) OU Syllabus

UNIT–I Introduction: Finite state automata, Non-deterministic finite state automata, FA with-transitions, Regular expressions, FA with outputs, Applications of FA. Properties of regular sets-Pumping Lemma, Closure properties, Myhill-Nerode Theorem, Minimization of FA, Decision Algorithms. UNIT–II Context-Free Grammars and Languages: Derivations, Parse-trees, …

Automata, Languages & Computation (ALC) OU Syllabus Read More »

Scroll to Top