Scribd
Upload
490 views4 pages

4th Semester

This document outlines the course units for the Theory of Computation, Computer Graphics, Principles of Programming Languages, and Microprocessors courses. Unit I of each course provides introductory material, such as finite automata and regular expressions for Theory of Computation, 2D transformations for Computer Graphics, data types and control structures for different languages in Principles of Programming Languages, and the internal architecture of the 8086 microprocessor for Microprocessors. Later units cover more advanced topics like context-free grammars and pushdown automata, 3D graphics techniques, object-oriented programming, LISP, PROLOG and COBOL languages, and peripherals and interrupts for microprocessors. Comparisons are drawn

Uploaded by

yogendra kumar dewangan
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
490 views4 pages

4th Semester

This document outlines the course units for the Theory of Computation, Computer Graphics, Principles of Programming Languages, and Microprocessors courses. Unit I of each course provides introductory material, such as finite automata and regular expressions for Theory of Computation, 2D transformations for Computer Graphics, data types and control structures for different languages in Principles of Programming Languages, and the internal architecture of the 8086 microprocessor for Microprocessors. Later units cover more advanced topics like context-free grammars and pushdown automata, 3D graphics techniques, object-oriented programming, LISP, PROLOG and COBOL languages, and peripherals and interrupts for microprocessors. Comparisons are drawn

Uploaded by

yogendra kumar dewangan
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 4

IV- Semester

THEORY OF COMPUTATION
CS251

UNIT I
Introduction to alphabets, strings and languages, finite automata and finite state machines,
DFA (deterministic finite automata), NFA (non -deterministic finite automata), NFA with
€ Moves, equivalence among DFA, NFA and NFA with € moves.

UNIT II
Regular expressions, union, concatenation and kleen closure operations on regular expressions,
Correspondence between finite automata and regular expressions, finite automata and regular
Expressions, finite automata with output like Moore and Mealy machines, pumping lemma for
Regular sets, Myhill-nerode theorem and minimization of finite automata.

UNIT III
Context free grammar and languages, derivation trees, simplification of context free grammars,
Chomsky normal form (CNF), Greiabach normal form, ambiguity in grammars, push down automata,
deterministic and non- deterministic push down automata, equivalence between push down
Automata and context free grammars.

UNIT IV
Turing machines, church’s hypothesis, ram machines, recursive and recursively
Enumerable languages, undecidability and rice’s theorem.

UNIT V
P, NP, NP-complete and NP-hard problems, examples of these problems like satisfy ability
Problem, vertex cover problem, Hamiltonian path problem, chromatic number problem,
traveling salesman problem, partition problem etc.

References:

1. Introduction to automata theory , language and computation by John E Hopcroft and Jeffrey
D. Ullman, Narosa publishing house 1997.
2. Introduction to language and the theory of computation by john c. martin McGraw hill,
International Editions 1991.
COMPUTER GRAPHICS
CS252

UNIT I
Introduction to raster & random graphics fundamentals, Display devices & comparison
Point plotting, line drawing & circle drawing & their algorithm like DDA &
Bressenhams.
Video Basics, Adapter Cards (MCA, CGA, EGA, VGA, etc.)

UNIT II
2-D Transformation,
Clipping, Windowing graphics
View port, Graphics packages, segmented files, geometric models, Picture Structure.

UNIT III
Raster graphics, Character Displaying,, Natural images
Solid Area Scan Conversion Algo,
Raster display hardware, Filling areas, aliasing & anti-aliasing

UNIT IV
Curve generation methods & algorithm like B-Spline & Bezier curve methods,
3-D graphics, surface generation
3-D clipping & transformation, viewing transformations

UNIT V
Perspective view, Hidden surface elimination
Depth Algorithm, Scan line coherence Algo, Area coherence Algo etc
Shading, Graphics input out put devices techniques, Mouse, tablets, stylus, light pen,
valuators, digitizers, and plotter
Devices independent graphics systems, positioning constraints, rubber band technique,
dragging, inking & painting

References:

1. Principles of Interactive Computer Graphics by William M. Newman


2. Computer Graphics By D. Hern and M.P. Baker
PRINCIPLES OF PROGRAMMING LANGUAGES
CS253

UNIT I
Evaluation, design and applications of programming languages, using L and R values,
Von Neumann bottleneck, basics of logic and functional programming. Data types in
Ada, parameter passing mechanism, scope of a variable, binding, coercion, storage
allocation of multidimensional arrays in a computer, control structures like if statement,
while statement etc., data abstraction.

UNIT II
Data types, simple statements like (assignment statement, if statement, switch statement),
control statement like (for loop, while and do – while loops, break and continue
statements etc.), arrays, functions and pointers in C, C++ and Java.

UNIT III
Introduction to object oriented programming, concepts of objects, classes and instances,
various types of classes like base class, derived class, abstract class etc., class hierarchy,
difference between public, private and protected class, Inheritance, multiple Inheritance
and its problem, public and private Inheritance in C++ and Java.

UNIT IV
Introduction to applicative languages, study of LISP, programming style, lamda calculus,
property list and macro expansion in LISP and LISP programming. Data types and data
structures in PROLOG, basic statements, control structures and input – output statement
used in PROLOG, recursion and iteration used in PROLOG, programming in PROLOG.

UNIT V
Introduction to COBOL, various divisions and sections used in COBOL, simple type of
statements like ADD, SUBTRACT, COMPUTE, OPEN, CLOSE, MOVE etc. in
COBOL, loop type statements like PERFORM etc. in COBOL, table handling, sequential
file processing, file sorting and merging in COBOL. Comparative study of various
programming, language like C, C++, Java, LISP, PROLOG, Ada and COBOL.

References:

1. Fundamentals of Programming Languages by Ellis Horowitz, Galgotia


Publications Pvt. Ltd.
2. Programming Languages by Allen B. Tucker, Mc Graw Hill International Edition,
2nd Edition, 1987.
3. Object Oriented Programming in Turbo C++ By Robert Lafore, Galgotia Pub,
1998.
4. The complete reference JAVA By Herbert Schildtz & Patrick Naughton, Tata Mc
Graw Hill, 1997.
5. Programming with Advanced Structured COBOL by Lawrence R. Newcomes,
Schaum’s Outline Series, McGraw Hill Book Company, 1987.
MICROPROCESSORS
CS254
Unit I
Introduction to 16 bit microprocessors, internal architecture of 8086, various types of
segments used like CS, DS ES and SS, study of various registers used in 8086, various
types of addressing modes like immediate addressing, register addressing, direct
addressing mode and indirect addressing modes.

Unit II
Instruction set of 8086, conversion of high level statements like assignment statements, if
statements, for loops, while loops, procedures, function etc. to 8086 statements,
programming using 8086.

Unit III
Interrupts in 8086, maskable and non-maskable interrupts, hardware and software
interrupts, conditional interrupts, types 0, type 1, type 2 and other such types of
interrupts, timing diagrams for interrupts, steps for interrupt handling.

Unit IV
Study of peripherals like 8237, 8254, 8255A, 8259A, 8272A, USART and buses like
HPIB.

Unit V
Comparative study of 8086, 8087, 8088, 80386, 80486, Pentium etc., interfacing using
8086.

References:
1) Microprocessor architecture by R.Gaonkar

2) Microprocessor by D.V Hall

3)8051 Microcontroller by K.J Ayala

You might also like