programme code: ec ec 11 203 - government … code conversion: gray to binary, binary to gray 06 08...

Government Polytechnic Mumbai DIPLOMA IN INFORMATION TECHNOLOGY

Programme Code: EC

Course Code: EC 11 203 Course Title: Basic Electronics

Compulsory / Optional: Compulsory

Teaching Scheme and Credits Examination Scheme

TH TU PR Total TH TS PR OR TW Total

4 -- 2 6 80 20 25 -- 25 150

Rationale:

It is necessary for the students of electronics and related branches to study and apply the basic

principles, analyze and troubleshoot simple subsystems. To acquire this level of understanding, the basic

knowledge of electronic devices and circuits is essential. This Course is one of the core subjects which is

deals with construction, working principle, application of active components.

Objectives:

The students will be able to

• Understand principle and terminology of electronics.

• Draw symbol and characteristics of electronic devices.

• Analyze the characteristics of electronic devices.

• Understand the working of basic circuits such as rectifiers, amplifiers etc.

• Build and test simple circuit.

Section I

Contents: Hours Marks

1. Semiconductor Theory:

1.1 Classification of component on the basis of energy band theory. Intrinsic and

Extrinsic Semiconductors, majority and minority charge carriers. P-type and N-

type Semiconductors.

1.2 P-N Junction formation, Concept of depletion layer and barrier potential.

1.3 Biased PN Junction, Forward and reverse biased V-I characteristics, Diode

current Equation, Static and dynamic resistance of PN Diode.

1.4 Comparison of Si and Ge Diode. Packages of Diode.

1.5 Definition of following terms:

Forward Voltage (VF), Maximum Forward Current (IF), PIV Rating, Power

dissipation of diode, Junction Capacitance and Knee Voltage

10

10

2. Diode application:

2.1 Half wave rectifier: Circuit, waveform, working.

2.2 Full Wave rectifier (Centre Tapped): Circuit, waveform, working.

2.3 Bridge rectifier: Circuit, waveform, working.

2.4 Passive Filters: Waveform and working of Capacitor, Choke input and Π-type

filter circuit.

2.5 Block diagram of regulated power supply: Definition of load regulation, line

regulation. ( Simple numerical on end expression, no derivation to be asked in

the exam)

2.6 Diode as clipper and clamper:

(A) Circuit diagram, waveform and working of positive, negative and biased

14

20


clipper.

(B) Circuit diagram, waveform and working of positive, negative and biased

clamper.

3. Special Diode:

Symbol, construction, characteristics, working and application of the following

diodes.

3.1 Zener Diode 3.2 Schottky Diode

3.3 Light Emitting Diode 3.4 Photo Diode

08

10

Section II


4. Transistor Fundamentals:

4.1 Construction and working of PNP and NPN transistors.

4.2 Transistor configuration:

Working and characteristics of transistors in CE, CB, CC modes; Expression of

collector current, Relation between α and β, Concept of collector leakage

current.

4.3 Biasing method of transistor:

Need of biasing, circuit and analysis of biasing network such as Fixed bias,

Collector feedback bias, Emitter Bias, Voltage divider bias. Concept of thermal

stability.

(No derivation to be asked in the examination. Simple numerical on the end

expression such as stability factor, current gain is expected.)

10

12

5. Transistor as an amplifier:

5.1 Single stage Common Emitter (CE) amplifier: Working and frequency response,

Concept of phase reversal, DC and AC equivalent circuit, Load line analysis,

Calculation of Zin, Zo, Av and β. Graphical representation of amplification.

5.2 Coupling Methods:

Need and Types of Coupling

RC Coupled amplifier: working and frequency response.

10

12

6. Field Effect Transistor:

6.1 Construction, working and characteristics of JFET and MOSFET (Depletion and

enhancement Type)

6.2 JFET Parameters, relation between JFET parameters.

6.3 Comparison of FET with BJT.

06

08

7. Introduction to Power devices:

Construction, working, symbol and characteristics of SCR, TRIAC, DIAC, UJT.

06

08


List of Practical:

1. To plot the V-I characteristic of semiconductor P-N diode. Find out static, dynamic resistance and

knee voltage of P-N diode.

2. To construct and test half wave rectifier and draw i/p and o/p waveforms.

3. To construct and test full wave rectifier and draw i/p and o/p waveforms.

4. To construct and test bridge rectifier and draw i/p and o/p waveforms.

5. To construct and test power supply using full wave rectifier with capacitor input filter. Measure o/p

voltage (DC) with and without filter.

6. To construct and test clipper circuit (Positive, negative and biased) Draw input and output

waveform.

7. To construct and test clamper circuit (Positive, negative and biased) Draw input and output

waveform.

8. To plot the V-I characteristics of LED. Find out static and dynamic resistance of LED.

9. Verify the characteristics of photo diode.

10. To plot regulation characteristics of zener diode. Find out load and line regulation.

11. To plot i/p and o/p characteristics of BJT and find out input resistance and o/p resistance of BJT in

CE Mode

12. To plot i/p and o/p characteristics of BJT and find out input resistance and o/p resistance of BJT in CB

mode.

13. To plot the frequency response of CE amplifier and find out gain bandwidth product of given circuit.

14. To plot frequency response of RC-coupled amplifier.

15. To plot the characteristic of FET. Label and interpret the various parameters on it.

16. To plot the V-I characteristics of UJT. Label and interpret the various regions on it.

17. To plot V-I characteristics of SCR and label various parameters on it.

Reference Books:

1. A text book of APPLIED ELECTRONICS by R. S. Sedha, Publisher: S. Chand and Co. Ltd.

2. Principles of Electronics by V. K. Mehta, Publisher: S. Chand and Co. Ltd.

3. Electronic Device and circuit by G. K. Mitthal, Publisher: Khanna publishers

4. Electronic Principles by Malvino, Publisher: Tata McGraw Hill, Education

5. Basic Electronic and Linear circuit by N. N. Bhargava, S. C. Gupta, Publisher: Tata McGraw Hill,

Education.


Digital Techniques

Rationale:

This course forms the foundation of computers. This course is introduced with the

view that students will be familiar with various digital devices and circuits which are used in

microprocessor, Computer & other digital systems

Objectives:

Students will be able to –

1. Understand the concept of various number systems.

2. Understand the concept & principles of logic devices

3. Draw the logic circuit diagram

4. Explain the operation of different logic devices

5. Test the different logic devices

6. Identify the logic devices

7. Construct the circuits using logic devices

8. Develop simple application using logic devices

Programme Code : CO/IF/IS

Course Code : EC 11 208 Course Title : Digital Techniques

Compulsory/Optional : Compulsory

Teaching Scheme and Credits Duration of Written

Examination Examination Scheme

TH TU PR TOTAL TH TS TH TS PR OR TW TOTAL

4 - 2 6 3 hrs 2 Tests of 1

Hour each 80 20 50 - - 150

( * ) indicates assessment by Internal and External examiners


SECTION I

Topic

no

CONTENTS Hours

32

Marks

40

1 Number system, & Codes:

1.1 Concept of weighted and non-weighted number system

1.2 Concept of base of a number system Binary, Decimal,

Octal, Hexadecimal

1.3 Conversion of one number system to another system

(Fractional point number )

1.4 Types of codes:-BCD,HEX,Excess-3,Gray code,octal

1.5 Code conversion: gray to binary, binary to gray

06

08

2 Binary Arithmetic: 2.1 Rules for binary addition ,subtraction

2.2 BCD addition ,subtraction

2.3 Concept of 1’s , 2’s Complements of binary numbers

2.4 Subtraction using 1’s & 2’s complements

2.5 Concept of signed magnitude, 1’s & 2’s complement

2.6 Parity, Definition of even & odd parity , Applications

06

08

3 Logic gates and families

3.1 concept of digital signals

3.2 Logic gates: AND gate, OR gate, Inverter and buffer,

Concept of universal gates NAND gate ,NOR gate

Exclusive OR ,Exclusive NOR gate

3.3 Symbols ,Logic equation, truth table ,IC numbers,

3.4 NOR and NAND as universal gates

3.5 Concept of logic family

3.6 Classification of logic families:-saturated and non saturated

Types ,examples of each

3.7 Concept of integration: SSI,MSI,LSI,VLSI

3.8 General specification of digital IC’s

3.9 Definition of Fan in and Fan out ,Noise Immunity,

Propagation delay (Typical values for TTL and CMOS)

I/P High,I/P Low ,O/P High ,O/P Low

08

10

4 Boolean Algebra

4.1 Construction of Logic circuits using gates for Boolean

expression

4.2 Rules of Boolean Algebra

4.3 Demorgan’s Theorem

4.4 Concept of SOP & POS

4.5 Concept of minterm & maxterm, standard form

4.6 Concept of K map

4.7 Simplification using K map for 2, 3, 4, variables

4.8 Realization of reduced expression using logic gates

07

08

5 Combinational Circuits

5.1 Half adder, full adder

5.2 Half subtractor ,full subtractor

5.3 Block diagram and truth table of Encoders

5.4 Priority Encoders ICs and Decoders

5.5 Decimal to BCD Encoders –IC 74147

BCD to 7-segment Decoder

5.6 Comparator : 1 bit & 2 bit -IC 7485

05

06


SECTION II

Topic CONTENTS Hours

32

Marks

40

6 Multiplexer / Demultiplexer

6.1 Multiplexer

- Necessity of multiplexing

- Principle of multiplexing &

- their types –2 : 1, 4 : 1 , 8 : 1

- Block diagram, operating principle, Applications

- Multiplexer tree 32 to 1 and multiplexing 16 to 1 line

6.2 Demultiplexer

- Necessity of demultiplexing

- Principle of demultiplexing &

- their types - 1 : 2 , 1 : 4 , 1 : 8

- block diagram, operating principle, Applications

04

06

7

Flip Flops 7.1 Difference between combinational and sequential circuits

7.2 Basic concept of Flip Flop

7.3 Types of Flip Flop: RS, Clocked RS, T & D flip flop, JK

FF, Master slave JK FF ( Diagram, Symbol, Truth

table, operation, Application )

7.4 Concept of Preset & Clear, Race around condition

7.5 Types of triggering : Edge, level triggering

7.6 Flip flop IC’s

10

10

8

Counters 8.1 Basic concept of counters

8.2 Classification of counters:

Synchronous &Asynchronous/ripple

8.3 Concept of UP & DOWN counter

8.4 3 bit /4 Bit Binary counter

8.5 BCD counter

8.6 Design MOD – N counter

( Circuit diagram, operation, Timing diagram of above Counter )

08

10

9

Shift Registers

9.1 Definition, Classification

9.2 Working of 4 Bit SISO, SIPO, PISO, PIPO Registers

9.3 Universal shift registers, Bidirectional shift register

9.4 Ring Counter, Twisted ring counter

( Diagram, operation, waveform, applications of shift

Registers)

06

08

10 A-D and D-A converter

10.1 Need of data converters,types of data converter

10.2 DAC specification

10.3 Circuit diagram and working of R-2R Ladder DAC

10.4 ADC specification

10.5 Block diagram and working of RAMP ADC

04

06


LIST OF PRACTICALS ( any 10 ) :--

Sr.No. Title of Experiment

1

Verification of Truth Table of AND, OR, NOT, NAND,NOR,Ex-OR,Ex-NOR gates using ICS

2 Truth table verification of Basic gates using discrete components such as diode,Transistor etc.

3 Construction of logic circuit for a given Boolean expression

4 Verification of Truth Tables of RS, flip flop using respective ICs

5 Verification of Truth Tables of JK, flip flop using respective ICs

6 Verification of Truth Tables of T & D flip flops using respective ICs

7

To built 3 bit ripple counter using Flip Flop & its ICs and observation of its timing waveform

8 Construction of BCD counter using Flip Flop & its IC 7490

9 Construction of 4 bit shift register using & ICs 7494 / 74194

10 Implementation of adder circuit using Multiplexer IC 74150

11 Implementation of adder circuit using Demultiplexer IC 74154

12 Construction of UP & DOWN counter & observation of its operation

13 To built & study Comparator ( IC 7485 )

14 To study d/a converter using IC 0808

Reference Books:

Sr. No. Title Author Publisher

01 Modern Digital Electronics R.P. Jain Tata McGraw Hill

02 Principle of Digital Electronics Malvino A.P & Leach Tata McGraw Hill

03 Digital Logic Design & Application N.G.Palan Tech-Max

04 Pulse Digital & Switching waveforms Millman & Taub S . Chand

05 Digital Electronics William Gothmann Tat McGraw Hill

Web Reference:- 1. Signetics Logic TTL Data Manual.

2. www.all about circuts.com

3. www.electronicsforu.com


Object Oriented Programming Using C ++

Rationale-

This subject intends to teach the students the basic concepts of object-oriented programming

(OOP). Large programs are probably the most complicated entities ever created by humans. Because

of this complexity, programs are prone to error and software errors can be expensive and even life-

threatening. Object-Oriented Programming offers a new and powerful way to coupe with this

complexity. Its goal is clearer, more reliable, more easily maintained programs. This subject will act

as backbone for all other subjects that are based on Object Oriented concept.

Objectives: - Students will be able to-

1. Compare procedure oriented and object oriented approach.

2. Implement real life object in programming

3. Implement inheritance and multiple inheritances.

4. Prepare reusable code.

Programme Code : IF

Course Code : CO 11 305 Course Title : Object Oriented Programming

Using C ++

Compulsory/Optional : Compulsory

Teaching Scheme and Credits Duration of Written



3 - 4 7 3hr 1hr 80 20 50* - - 150



Topic No Contents Hours Marks

SECTION-I 24

1.0 Introduction to Object Oriented Programming Introduction

- OOP need and requirements

- Limitations of C

- Procedure–oriented programming Vs Object-Oriented

programming concept

- Features of OOPs.

- Structure of C++ programming

- C++ I/O statements

6 8

2.0 Objects and Classes Classes

- Specifying a class

- Defining member functions

- Arrays within a class

Objects - Creating objects

- Memory allocation for objects

- Static data and member function

- Array of objects

- Objects as function arguments

8 14

3.0 Constructors and destructuros Constructors

- Definition

- Concept

- Types of Constructors

- Default

- Parameterized

- copy

- Overloaded Constructors( Multiple Constructor)

- Constructor with default argument

- Destructor

10 18



SECTION-II 24

4.0 Inheritance

Introduction Base Classes

Derived classes

Member declaration: protected

Types Of Inheritance - Single inheritance

- Multilevel inheritance

- Hybrid inheritance

- Multiple inheritance

Virtual base classes

Abstract classes

Constructors in derived classes

10 18

5.0 Polymorphism

Compile Time Polymorphism

- Functions overloading

- Operator Overloading (unary and binary )

- Overloading Vs Overriding

Run Time Polymorphism - Virtual functions

- Static and dynamic binding

6 10

6.0 Pointers in C++

Concept of Pointers - Pointer declaration

- Memory management operators (new, delete)

Pointers and Functions - Call by value

- Call by reference

- Pointer to functions

- Passing function to another function

Pointers and objects - Pointers to objects

- Array of pointer to objects

- This pointer

- Pointers to derived classes

8 12


List of Practicals:

Reference Books:

Sr.No. Book Title Author Publication

1 Object Oriented Programming with C++. Balgurusamy Tata McGraw-Hill

2 C++ The Complete Reference Schilt Tata McGraw-Hill

3 Let Us C++ Kanetkar BPB Publication

Web References:

1. www.cplusplus.com

2. www.mycplus.com

Sr.No. Title of Experiment

1 Write two C++ programs using Input /output statements

2 Write program for printing formatted output (Make use of manipulators )

3 Write program making use of C++ control structures.

4 Write any three programs using different type of function approach.

5 Write a complete C++ program which makes use of classes & objects.

6 Write a complete C++ program which makes use of classes Static data and member function

7 Write C++ program which makes use of array of objects.

8 Write C++ program using constructors & destructors.

9 Write program making use of single inheritance

10 Write program making use of multiple inheritance

11 Write program making use of multilevel inheritance

12 Write program making use of hybrid inheritance.

13 Write a program which makes use of friend function.

14 Write program making use of Function Overloading.

15 Write program using operator overloading

16 Write a program which uses virtual function & polymorphism


System Programming

Rationale:

A modern computer has powerful capabilities such as fast CPU, large memory, Input-Output

devices and networking support. However, It has to be instructed through the machine language. A

common user does not wish to interact with the computer at this level. The System programs are the

collection of programs that bridge the gap between the users and the operating system. The main aim

of System programming is to understand designing and implementation of software’s like

assemblers, loaders and compilers. Using system programming students will have an idea about how

the system tools coordinates with operating system.

Objectives:

Students will be able to:

1. Understand the concept of machine structure, machine language and assembly language.

2. Define symbols, literals, instructions, and assign addresses.

3. Understand the concept of lexical, syntax and semantic analysis.

4. Differentiate between procedures and subroutines.

5. Understand macros, macro call and expansion.

6. Understand the concepts of Memory allocation, loading and linking.

7. Understand design of compiler, loader, linker and assembler

Programme Code : IF

Course Code : CO 11 401 Course Title : System Programming

Compulsory/Optional : Optional

Credits Duration of Written



3 - 2 5 3 hrs 2 Tests of 1

Hour each 80 20 50* - - 150



Topic

No

Contents Hours Marks

SECTION-I 24 40

1.0

INTRODUCTION TO SYSTEM PROGRAMMING

1.1 What is System Software? Goals of System Software. 1.2 Components of System Software : Assemblers, Loader,

compiler, Macro processor

1.3 Evolution of System Software and Operating System

1.4 Foundations of system Programming, Machine

Structure

6 12

2.0 ASSEMBLER

2.1 Elements of assembly language programming

2.2 Overview of assembly process

2.3 General design procedure

2.4 Pass structure of assembler

2.5 Single pass & multi pass translation

2.2 Design of the assembler :Statement of the problem;

Data Structure; Format of databases; Algorithm;

Look for modularity

2.7 Flowchart of Pass-I & Pass-II of assembler

10 16

3.0 TABLE PROCESSING: SEARCHING AND SORTING 3.1 Searching- Linear Search,Binary Search

3.2 Sorting: Interchange sort; Shell sort; Bucket sort;

Radix exchange sort; Address calculation sort;

3.3 Comparisons of sort;

3.4 Hash or Random entry searching

8 12


Topic

No

Contents Hours Marks

SECTION-II 24 40

4.0 MACRO LANGUAGE AND MACRO PROCESSORS 4.1 Macro Instructions

4.2 Features of a Macro facility - Macro Instruction

Arguments; Conditional macro expansion; Macro call

within Macros; Macro Instruction defining Macros

4.3 Implementation - Implementation of restricted faculty:

4.4 Pass-I & Pass-II Algorithm,

4.5 A Single Pass Algorithm,

4.6 Implementation of macro calls within Macros,

Implementation within an assembler

8 12

5.0 LOADERS AND LINKING

5.1 Loaders Schemes : “Compile and go” loaders; General

Loader Schemes; Absolute Loaders; Subroutine linkages;

Relocating loaders; Direct linking loaders; Other loaders

scheme: Binders, Linking loaders Overlays, Dynamic

Binders

5.2 Design of Absolute loaders

5.3 Design of Direct Linking Loaders: Specification Problem;

Specification of data structures; Format of database;

Algorithm

8 16

6.0 COMPILER

6.1 Statement of a problem: Recognizing basic elements;

Recognizing Syntactic units and Interpreting meaning;

Intermediate from: Arithmetic statements, Non-

Arithmetic statement, Non-executable statements; Storage

Allocation; Code Generation: Optimization(M/c

independent), Optimization (M/c dependent); Assembly

Phase; General Model of Compiler.

6.2 Phases of Compiler : Analysis Phase ,Lexical Phase,

Syntax Phase, Interpretation Phase, Optimization phase

Code Generation.

6.3 Passes of a Compiler, compiler construction tools

6.4 Parsing

Top down parser

Bottom up parser

8 12


List of Practical:

1 Write a C program for Interchange sort

2 Write a C program for Bucket sort

3 Write a C program for Radix Interchange sort

4 Write a C program for Address calculation sort

5 Write a program for generating a symbol table

6 Design of Macro assembler

7 Design of Loader

8 Write a a program to read tokens and print its type

9 Write a a program for code generation

10 Write a a program for identifying loop invariant

11 Write a program to parse input to check it belongs to given syntax of language

12 Design an interpreter for C language

Reference Books:

Sr.

No

.

Author Title Publisher

1 John J. Donovan System Programming

Tata McGraw-Hill Edition

2 D.M. Dhamdhere System Programming and Operating

System

Tata McGraw-Hill Edition

3 G.Sudha Sadashiv Compiler Design SciTech

4 Rajesh K. Maurya System Programming Dreamtech

Web Reference: 1. www.dreamtechpress.com (PPTs available)

2. www.cs.princeton.edu/~appel/modern (for compiler implementation in /ML/C)


Computer Graphics

Rationale

In recent trend, every computer system interacts with the user through a graphical user

interface. User can understand the information in both textual and graphical format where

information on the display screen is conveyed in both textual and graphical forms.

Computer Graphics is the study of techniques to improve communication between human

and machine. The word Computer Graphics means pictures, graphics or scene drawn with the help of

a computer system.

After studying this subject, a learner will be able to work with 2-dimensional, 3-dimensional

graphics, multimedia and animation techniques. Computer graphics techniques can be used in many

fields such as Engineering drawing, business graphs, architectural design and also for video games,

which provides a new form of entertainment.

Objectives: -

The students will be able

1. To develop the logic and algorithms for developing basic graphics software.

2. Use of programming language constructs in program implementation.

3. To describe file structure of display & graphics file formats.

4. To apply the algorithms to draw lines, circles and polygons.

5. To use transformation techniques to scale, rotate and translate the object.

6. To select the methods of enlarging visible portion of drawing.

7. To develop the logic for drawing the natural objects using different algorithms for

curved lines.

Programme Code : IF

Course Code : CO 11 402 Course Title : Computer Graphics

Compulsory/Optional : Optional

Credits Duration of Written



3 - 2 5 3 hrs 2 Tests of 1

Hour each 80 20 50* - - 150




SECTION-I 24 40

1.0 Basics of Computer Graphics 1.1 Display devices Random scan display, Raster scan display, Colour CRT

Monitors, Plasma panel, Liquid crystal display.

1.2 Primitive operations: - moveto, lineto

Display-file interpreter, Display file structure

1.3 Graphics file formats.

Basics, advantages, disadvantages, BMP,GIF, JPEG,TIFF, PCX.

1.4 Graphics Mode Functions- Text mode, Graphic mode

Shapes, colors, Co-ordinate systems.

1.5 Need for graphics standards, Graphics standards: CORE,GKS,

PHIGS,IGES,CGM,VDI, Advantages of Graphics standards,

Hazards of Graphics standards

1.6 Applications of computer graphics & tools.

08 12

2.0 Line, circle, and polygon.

2.1 Basic concepts in line drawing, Line drawing algorithms:

2.1.1 DDA algorithm

2.1.2 Bresenham’s algorithm

2.2 Circle generating algorithms: 2.2.1 DDA circle drawing algorithm

2.2.2 Bresenham’s circle drawing algorithm

2.2.3 midpoint circle algorithm

2.3 Polygons 2.3.1 Types of polygons

2.3.2 Polygon representation

2.3.3 Entering polygons

2.3.4 inside–outside test

2.3.5 Polygon filling Algorithms: Flood fill, scan-line algorithm,

Sample problems to illustrate above algorithms.

10 16

3.0 Transformations 3.1 2D transformation: scaling, Reflection, shearing, Rotation,

Translation, Rotation about an arbitrary point.

3.2 3D Transformation: scaling, rotation, translation,

Rotation about arbitrary axis. Sample problems with sample

coordinates.

06 12



SECTION-II 24 40

4.0 Windowing & clipping 4.1 Viewing transformation: Normalization transformation,

Workstation transformation.

4.2 Line clipping: Cohen-Sutherland Line clipping algorithm,

Midpoint subdivision algorithm.

4.3 Polygon clipping: Sutherland–Hodgeman Polygon clipping

algorithm. Sample problems with sample coordinate to illustrate

above algorithms.

12 18

5.0 Curves and fractals 5.1 Curve generation: arc generation using DDA algorithm,

Interpolation, Spline Representation, B-Spline, Bezier curves.

5.2 Fractals: Hilbert’s Curve, Koch curve, Fractal lines, Fractal

Surfaces.

08 16

6.0 Computer Animation

6.1 Introduction, Key Frame Animations, Construction of Animation

sequences.

6.2 Motion control methods, Introduction to Morphing

6.3 Warping, Mesh Warping, Feature based image Warping.

04 06

List of Practicals:

1 Implement DDA algorithm and Bresennham’s algorithm for line drawing.

2 Implement DDA algorithm and Bresennham’s algorithm of circle drawing.

3 Implement Flood fill algorithm for Polygon filling.

4 Implement scan-line algorithm for polygon filling.

5 Write Program for 2-D transformations -> scaling, Rotation

6 Write Program for 2 D transformations -> shearing and Translation program

7 Write and implement program for rotation about an arbitrary point

8 Implement Cohen- Sutherland algorithm for line clipping.

9 Implement midpoint subdivision algorithm for line clipping.

10 Implement Sutherland-Hodgeman algorithm for polygon clipping.

11 Write a program to draw a curve using Bezier’s algorithm

12 Write a program to draw fractal lines.

List of Practical oriented Projects:

1) Oral geometry insertion for character animation (Develop a system to create an animated

mouth in head geometry)


2) Online storyboarding system (Create a system that will keep still images, text descriptions,

sample animations, sample audio for each scene of an animation)

Reference Books:

Sr. No. Book Title Author Publication

01 Computer Graphics Steven Harington Mc Graw Hill

02 Computer Graphics M.Pauline Baker &

Donald Hearn Prentice-Hall

03 Principles of Interactive Computer

Graphics Newman and Sproull Tata McGraw Hill

04 Computer Graphics Plastock Tata McGraw Hill

Web Reference:

1. www.insidecg.com

2. www.graphics.standard.edu

3. www.cmp.uea.ac.uk/research

4. www.computer.co.uk


Programme Code: IF

Course Code:IF11301 Course Title: Professional Practice




-- 02 -- 02 -- -- -- -- 50 50

Rationale:

Due to globalization and competition in the industrial and service sectors the selection for the job is

based on campus interviews or competitive tests. While selecting candidates a normal practice

adopted is to see general confidence, ability to communicate and attitude, in addition to basic

technological concepts.

The purpose of introducing professional practices is to provide opportunity to students to undergo

activities which will enable them to develop confidence. Industrial visits, expert lectures, seminars

on technical topics and group discussion are planned in a semester so that there will be increased

participation of students in learning process.

Objectives:

Student will be able to:

1. Acquire information from different sources.

2. Prepare reports and make posters for given topic.

3. Present given topic in a seminar.

4. Interact with peers to share thoughts.

Section I

Contents: Hours

1. Information Search

Information search can be done through manufacturers, catalogue,

internet, magazines; books etc. and submit a report.

Following topics are suggested:

1. Collect information about Buying of a new computer (cost, make,

model etc.).

2. Comparison of different computer architectures

3. Collect information from Computer repairing center (at which

level repairing is done, cost).

4. Collect information regarding latest requirement for a job from

any industry

5. Collect information regarding number of industries open to IT

professionals

6. Any other suitable topic

04

2. Lectures by Professional / Industrial Expert

Organize lectures on any two topics of the following suggested areas or

any other suitable topics (2hrs each topic):

1. spoken English

2. Personality Development

3. Current trends in IT

4. How to improve positive thinking

5. Certification course guidance

04


6. Career guidance

7. Preparation of Bio-data

8. Interview Techniques

9. Any other suitable topic

3. Group Discussion

The students should discuss in group of six to eight students and write a

brief report on the same as a part of term work. The faculty members

may select the topic of group discussions. Some of the suggested topics

are -

1. Load shading and remedial measures.

2. Use of mobile in college campus

3. Internet surfing good or bad

4. Chatting on Net

5. Work in BPO

6. Hacking

7. Computer virus

8. Software piracy

9. Computer gaming

10. Cyber Laws

11. Nano Technology

12. Ethical Hacking

13. Mobile Computing

14. Any another suitable topic

08

Section II

Contents: Hours

4. Information Search and Seminar

Information search can be done through manufacturers, catalogue, internet,

magazines; books etc. give seminar, make poster and submit a report.

Following topics are suggested : 1. Market survey of different processors.

2. Blue tooth Technology

3. Artificial Technology

4. Data ware-housing

5. Cryptography

6. Digital signal processing

7. Bio-informatics

8. Any other suitable areas

12

5. Personality Development

1. Conduct aptitude, general knowledge test

2. Resume writing

3. Interview Techniques

04


Programme Code: IF

Course Code: IF 11304 Course Title: Computer Architecture and Organization




3 -- 2 5 80 (3 Hrs.) 20 -- 50* -- 150

Rationale:

The aim of the subject is to teach the basic working of the computer motherboard, peripherals and

add-on cards. The subject helps the students to select the proper peripheral as per their

specification and requirement. This is the core subject and practical oriented and will develop the

debugging skills in the students.

Objectives:

The students will be able to

• Describe the working of computer system.

• Assemble the system.

• Load the operating system and device drivers in the system.

• Identify the different add-on cards.

Section I


1. Overview of PC Architecture

1.1 Types of computers, Functional units, Basic Operational concepts

1.2 Processing unit, Memory unit, I/O slots, Add-on cards

1.3 Motherboard, types of Mother boards

1.4 Introduction to Power supplies and Peripherals

1.5 Introduction to 80286,80386,80486,Pentium Processors based

Machines.

06

10

2. Addressing Methods and Machine program sequencing

2.1. Basic Concepts. Memory locations, Addresses and encoding of

Information, Main memory operations

2.2 Instruction and Instruction Sequencing

(instruction execution and straight line sequencing/Branching)

2.3 Addressing Modes

2.4 Basic Input-Output operations.

08

14

3. Processing unit

3.1 Some fundamental concepts

Fetching a word from memory / storing a word in memory / register

transfers / performing an arithmetic or logic operation

3.2 Execution of a complete instruction

- Branching

3.3 Hardwired control unit

- Design Method

- CPU control unit

3.4 Microprogrammed Control unit

Basic organization of Microprogrammed control unit

10

16


Section II


4. Input & Output Devices

4.1 Keyboard : Types of keyswitches : Membrane, Mechanical,

Rubber dome, Capacitive and interface

4.2 Mouse : Mechancial, Optomechanical, optical (New design)

4.3 Scanner : Flat bed, sheetfed, Handheld

4.4 Modem : Internal and External

4.5 Printer: Dot matrix, Inkjet, Laser :

09

15

5. Memory unit

5.1 Some basic concepts

5.2 Semiconductor RAM Memories

5.3Read-Only Memories

5.4 Cache Memories

5.5 virtual memories

09

15

6. Storage devices & Interfacing

6.1 Types of storage devices.

6.2 Hard disk construction and working

Terms related to Hard Disk : Track, Sector cylinder, cluster,

6.3 Formatting, Low level formatting, High level formatting,Partitioning

6.4 FAT basics, Introduction to file system FAT 16, FAT 32, NTFS

6.5 Hard disk drive interface : features of parallel AT attachment(PATA),

Serial ATA (SATA), Introduction to CDROM , DVD.

06

10

List of Practicals:

1. Study of Computer Architecture.

2. Drawing the motherboard layout of Pentium IV and studying the chipset .

3. Demonstration of CMOS setup.

4. Identifying and Installation of add-on-cards like sound,TV tuner,Camera card and graphics

card

5. Identifying different types of monitors.

6. Study of SIMM and DIMM.

7. Identifying various components of HDD and write their functions

8. Hard Disk Partitioning and formatting.

9. Installation of Windows operating system on computer.

10. Installation of Scanner and Printers.

11. Study of SMPS (ATX)

12. Installation of CD-ROM drives

13. Assembling of PC and Installation of Operating System.

Reference Books:

1.Computer Architecture & Organization by J.P.Hayez, Publisher: Mc-Hill pub.

2.Computer Organization by Hamacher and Zaky, Publisher: Mc-Hill pub.

3.The Complete PC upgrade and Maintenance by Mark Minasi, Publisher:BPB pub.

programme code: ec ec 11 203 - government … code conversion: gray to binary, binary to gray 06 08...

Documents