Government College of Engineering, Aurangabad

Department of Information Technology S.E. Information Technology Curriculum Structure and Scheme of Evaluation
SEMESTER I Sr. No . Scheme of Teaching (Hrs/week) Name of the Subjects L General Elective-I Engineering Mathematics-III Data Structures Fundamentals of Information Technology Digital Circuits Discrete Mathematics Lab.- Fundamentals of Information Technology Lab.- Data Structures Lab.-Digital Circuits (A) Total of Semester - I
1 2 GE-212 GE-215

Scheme of Evaluation (Marks) Theory Test 25 20 20 20 20 20 Assign. 25 20 20 20 20 20 ESE Term Wor k Pract ./ Vivavoce

Cours e Code

Total Credi ts 2 4 4 4 3 3

Total Marks 50 100 100 100 100 100

1 2

GE-202 GE-205

3 4 5 6 7 8 9

IT-203 IT-204 IT-205 IT-206 IT-207 IT-208 IT-209

2 4 4 4 3 3 2 2 2 20 2 3 4 4 3 4 2 2 2 20 40 06 12

60 60 60 60 60 25 50 25 25 50 25 100

1 2 1 125 25 20 20 20 20 20 300

50 100 50 750 50 100 100 100 100 100

3 4 5 6 7 8 9

IT-210 IT-211 IT-212 IT-213 IT-214 IT-215 IT-216

General Elective-II Engineering Mathematics-IV Object Oriented Programming Systems Computer Graphics Microprocessor Systems Data Communication Lab.- Microprocessor Systems Lab.- Computer Graphics Lab.- Object Oriented Programming Systems ( B) Total of Semester- II Grand Total = (A) +( B)

6 24 125 SEMESTER II 2 25 3 20 4 4 3 4 1 2 1 24 48 125 250 20 20 20 20

100

60 60 60 60 60 25 50 25 25 50 25 100 200

50 100 50 750 1500

125 250

300 600

100 200

(Note: L: Lecture, P: Practical, ESE: End Semester Examination) General Electives (GE): 1) Rural development 3) Technical Writing 5) Behavioral Science & Organizational Skills 7) Foreign Language 2)Total Quality Management 4) Entrepreneurship Development 6) Society Science & Humanities 8) Environmental System Management

GE-202 General Elective- I

Foreign Language- Japanese Teaching Scheme : Lectures : 2 hrs/week

Test : 25 Marks Assignment : 25 Marks Credits : 2

Objectives: - To equip students to take up global careers. - To train the students to lay a strong foundation for new language learning.
CONTENTS: 1. Introduction to Japanese language Script , Self Introduction in Japanese. 2. Script (Writing) Construction of small sentences (Hiragana) 3. Script This/That 4. Script(complete) Prepositions , Verbs , Months , Days of week and Date 5. Introduction to Time and revision 6. Introduction to Adjectives, Past Tense and Negation 7. Various Verbs and vocabulary 8. Katakana and Kanji 9. How to use Katakana and Kanjis 10. Construction of sentences using verbs and adjectives 11. Creation of some topic in Japanese language 12. Group discussion

TERM Work:
The term work shall consist of at least 8 assignments/ tutorials based on the syllabus of the subject. Assessment of term work should be done based on the points mentioned below: - Continuous assessment - Examination conducted (internally) at the time of submission

GE-205 Engineering Mathematics-III Teaching Scheme : Lectures : 4 Hrs. / week Examination Scheme: Test 20 Marks End Sem Exam 60 Marks Assignment - 20 Marks (8)

Unit 1 :
Method of variation of parameters. Simultaneous linear differential equation.

Linear differential equations of nth order with applications of electrical and electrical Engineering. Engineering.

Unit 2

(8)

Measures of central tendency, Measures of dispersion Moments, skewness, Kurtosis, correlation, coefficient of correlation, lines of regression of bivariate data, fitting of curves, least square principle.

Unit 3
transforms, convolution theorem, solution of LDE by Laplace Transform

(8)

Laplace Transform, Definition, & Properties, Laplace transform of elementary function, derivatives, integrals. Inverse Laplace

Unit 4
Inverse finite Fourier sine & cosine transform & its inverse.

(8)

Fourier Transform - Fourier Integral, Fourier sine and cosine integral. Fouriers transform, complex Fourier transform & its

Unit 5

(8)

Function of Complex Variables, Introduction, Analytic function, Cauchy-Riemann Equations, Harmonic function, Taylors & Laurents series, Singularities, Residues, Cauchy Residue theorem. Integration along unit circle & along the upper half semi circle, conformal and bilinear transformation. Books 1) A Text Book of Engineering Mathematics (Vol. I & II) P.N. Wartikar and J.N.Wartikar, Pune Vidhyarthi Griha Prakashan,Pune. 2) Higher Engineering MathematicsB.S.Grewal, Khanna Publicatons,New Delhi. 3) Advanced Engineering Mathematics (8th Edition) Erwin Kreyszing, Willey Eastern Ltd.,Mumbai. 4) Advanced Engineering MathematicsH.K.Das, S. Chand & Co., New Delhi.

IT203 : Data Structures

Teaching Scheme : Lectures : 4 hrs/week Examination Scheme : Test : 20 Marks Assignment : 20 Marks End Sem. Exam. : 60 Marks Credits : 4

Objective: - To train the students on fundamentals that one must learn of data structures - To train the students to lay a strong foundation for programming.
CONTENTS ( C language will be used as a reference.)

Unit 1 . Introduction to data structure, The Stacks& Queues -

(8)

The Arrays as an ADT: Using One-Dimensional Arrays, Using Two-Dimensional Arrays, Using Multidimensional Arrays, Definition and Examples, Primitive Operation, The stack as an ADT, The queue and its sequential representation, The queue as an ADT, Basic Definition and examples: Infix, Postfix, and Prefix, Program to evaluate a Postfix expression, Limitations of the program, Circular Queue, priority queue Unit 2 . Linear Data Structure & their representation
(8)

Definition, concept, operation on linked lists, Circular linked lists Doubly linked lists, Operations like insertion, deletion, insertion in order, searching, updating , Applications of linked lists such as polynomial manipulation, Comparison of singly linked, circularly linked & doubly linked list Unit 3. Trees
(8)

Definition, Basic terminology, operation on binary trees, linked storage representation for binary search trees, Basic operation on binary search tree such as creating a binary search tree, searching, modifying an element, inserting & deleting the element, destroy a binary search tree, tree traversals ,in-order, pre-order, post-order , tree application for expression evaluation & for solving sparse matrices. Unit 4. Graphs
(8)

Definitions, basic terminology, matrix representation & implementation of graphs, graph travels, DFS, BFS, Shortest path, spanning tree

Unit 5. Sorting & searching

(8)

Different sorting tech, classification on the basis of big-O notation, tech such as straight selection sort, bubble sort, merge sort, quick sort, heap sort, shell sort, radix sort, comparisons between different sorting techniques Sequential searching, binary searching, height balanced trees2-3 tree, B trees, B+ trees, AVL trees Text Books: 1. Yedidyah Langsam, Moshe J. Augenstein, Aaron M.Tenenbaum, Data Structures using C and C++ , Pearson Pub. 2. Yashavant P Kanetkar, Data Structures through C, BPB Pub. ( Book with CD) 3. G.S. Baluja, Principles of Data Structures using C and C++, Reference Books : 1. Ellis Horowitz, Sartaj Sahni, Fundamentals of Data Structures, 2. Robert L Kruse, Data Structures and Program Design, PHI IT 204 - Fundamentals of Information Technology Teaching Scheme: Theory: 4 Hrs/week Examination Scheme: ESE 60 marks, Test 20 marks Assignment 20 marks
Credits : 4

Objectives: - To train the students on fundamentals that one must learn in order to pursue any endeavor in IT field. - To train the students to lay a strong foundation for joining this field. - To give an outline of many technologies that the student will be learning in detail in further studies.
CONTENTS Unit 1: Computer Basics and Devices (8)

Computer Basics: Evolution, Generations, Classification and Applications of Computers Input Output Media: Types of Input Devices- Principle of working of all devices like Keyboard, Mouse, Light Pen, Touch Screen, Digital Camera, Scanner, Optical Scanners (OCR, OMR, MICR, Bar Code). Output Devices- Principle of working of Types of Printers, Plotters, Monitors, Inside a Computer: SMPS, Motherboard, Ports and interfaces, Expansion cards, Memory Chips, Disk controllers Unit 2: Operating System /IT Basics (8)

Operating System: Evolution, Types, Functions, Examples of OS. Microsoft Windows XP: Desktop, My Computer, Files and Folders, Explorer, Help and Support, Searching in Windows XP, System utilities Information Technology Basics: Information, IT, Present Scenario, Role of IT, IT and Internet, Careers in IT industry Multimedia ( MM )Essentials: Definition of Multimedia, Building Blocks, MM System, Applications, Virtual Reality

Unit 3: Computer Software /Internet

(8)

Computer Software: Definition, Categories, Installing and Uninstalling, Piracy, Terminologies Spreadsheets and Microsoft Excel 2000: Working with workbook and worksheet, Formula and functions, Inserting Charts, Printing in Excel Internet: Evolution,, Basic terminology- Browser, URL, Hypertext, ISP, Web Server, Online-Offline, Types of Internet Connection, Applications- Email, FTP, Telnet, Internet Relay Chat, Telephony, Video Conferencing, Newsgroups(Usenet), Data Over InternetStatic, Dynamic (Perl, JavaScript, VBScript, ASP,PHP,XML) Unit 4: Internet Tools /Security (8)

Internet Tools: Search Engine, Instant Messaging: Features, Yahoo Messenger, Sending Messages and files, Computer Security: Definition, Malicious Programs, Cryptography, Digital Signature, Firewall, User Identification and Authentication Emerging Trends in IT: E-commerce, m- commerce, Electronic Data Exchange (EDI), Mobile communication, Bluetooth, Global Positioning System (GPS), Infrared communication, Smart Card, Imminent Technologies( Nano Technology, DNA Computing, Quantum Computers) Unit 5: Database Fundamentals (8)

Database Fundamentals: Definition, Logical and Physical data concepts, DBMS Architecture, Models- Codds Rules, Types of databases (Centralized and distributed), SQL: Getting started, DDL commands, DML commands, SQL joins, DBMS with Microsoft Access 2000: Tables, Queries, Forms, Reports Reference Books: 1. Introduction to Information Technology, ITL Education Solutions Ltd, Pearson Education 2. Shravankumar, Parameswaran, Jayalaxmi, A Textbook of Information Technology, S.Chand

***

IT-205

Digital Circuits
Examination Scheme : Test : 20 Marks Assignment : 20 Marks End Sem. Exam. : 60 Marks Credits : 3

Teaching Scheme : Lectures : 3 hrs/week

Objective: - To train the students on fundamentals of Digital basics - To train the students to lay a strong foundation for digital systems.
CONTENTS

Unit 1. Number Systems and codes , Logic Gates, Boolean algebra

(6)

Number system and codes: Number systems, Binary number system, signed binary numbers, binary arithmetic, 2s complement arithmetic, octal number system, Hexadecimal number system, Gray code, Excess three codes, error detecting and correcting codes. Basic gates, Universal gates and their truth tables, De-Morgans theorem.

Unit 2. Combinational circuit design:

Combinational Circuit Design : K-Map minimization using K-map , dont care condition, Binary half and full adders and subtractors, BCD to Seven Segment decoder, binary to gray and gray to binary conversion. , Quine-McClusky minimization technique .

(6)

Unit 3. Combinational Logic Design and Flip-Flops, Sequential Logic Design :

(6)

Multiplexers, cascading of multiplexers, Demultiplexers, cascading of Demultiplexers, Binary and BCD Adders Flip -flops - One bit memory cell, Clocked SRFF, JKFF, D Type, T Type FF, Application of Flip-flops Introduction registers, shift registers, universal registers, application of shift registers, as ring counters, twisted ring counter

Unit 4. Counters :
Cascading of ripple counter ICs, Synchronous counters, up/down counters

(6)

Ripple or Asynchronous Counters, Modulus of Counters, Introduction to general purpose 54/74 series, Asynchronous ICs,

Unit 5. Digital Systems

(6)

Timing circuits: Application of logic gates in timing circuits, OP AMP and its application in timing circuits, Schmitt trigger ICs, Monostable multivibrator ICs, 555 timer , A/D Conveter , D/A Converter , Examples of Digital Systems .
Text Books :

1. R. P Jain, Modern Digital Electronics, Tata Mcgraw Hill. 2. R. P. Jain & Thomas L. Floyd, Digital Fundamentals, Pearson Education IT-206- DISCRETE MATHEMATICS
Teaching Scheme : Lectures : 3 hrs/week Examination Scheme : Test : 20 Marks End Sem. Exam. : 60 Marks Assignment : 20 Marks Credits : 3

Objectives: - To train the students on fundamentals of Discrete Mathematics used in Programming. - To learn the Discrete mathematics required for computer science.
CONTENTS

Unit 1. Sets & Propositions:

Combination of sets, finite & infinite sets, mathematical induction, Principle of inclusion & exclusion, propositions, multisets.

(6)

Unit 2. Permutation, Combinations & Discrete Probability

(6) The rules of sum & product, permutation, combinations, generation of permutation & combinations, discrete probability, conditional probability.

Unit 3

(6) A relational model for databases, properties of binary relations, Equivalence relations & partitions, partial ordering relation & lattices chains & antichains, job scheduling problem, functions & pigeonhole principle.

Unit 4. Graphs & Trees

(6) Basic terminology, Multigraphs and Weighted graphs, Paths and Circuits, Shortest paths in weighted graphs, Eulerian paths and circuits, The traveling salesman problem, factors of a graph, Planner graphs, Trees, Rooted Trees, Path lengths in rooted trees, Prefix codes, Binary search trees, spanning trees and cutsets, Minimum spanning trees. Transport networks.

Unit 5. Discrete Numerical Functions and Recurrence Relations (6) Manipulation and Numerical Functions, Asymptotic behavior, Generating functions and Combinatorial Problems, Recurrence relations, Linear recurrence relations with constant coefficients, Homogeneous solutions, Particular Solutions, Total Solutions, Solutions by the method of generating functions.

Text books :

1. C.L.Liu , Elements of Discrete Mathematics, Tata McGraw-Hill Publication 2. Kollman, Busby and Ross, Discrete Mathematical Structures, PHI Reference Books: 1. Swapankumar Sarkar, A Text book of Discrete Mathematics, S Chand Publication 2. Satindar Pal Gupta , Discrete mathematics and structures, Laxmi publications 3. G Shankarrao , Mathematical foundation of Computer Science , I.K. International 4. Trembley , Manohar, Discrete mathematical Structures with Application to Computer Science, McGraw Hill Pub.
IT -207 Lab - Fundamentals of Information Technology Teaching Scheme : Practical : 2 hrs/week Examination Scheme : Term Work : 25 Marks Pract/Viva-vice : 25 Marks Credits: 1

Suggestive List of Experiments: 1. 2. 3. 4. 5. 6. 7. 8. 9. 10. Study of Computer Motherboard, SMPS ports, Memory chips Study of different types of printers Use of Windows XP functions and system utilities Use of MS Excel Software Preparing the bills using MS-Excel Experiment using different charts available in MS-Excel Creating static web-pages with HTML Study of different type of Internet connection Facilities available with E-mail accounts Sending messages and files

TERM Work: The term work shall consist of at least 10 experiments/ assignments based on the syllabus of the subject. Assessment of term work should be done based on the points mentioned below: - Continuous lab assessment - Actually performing practicals in the laboratory - Oral Examination conducted (internally) at the time of submission Practical Examination: The Practical Examination shall consist of writing and performing an experiment / assignment and oral based on the syllabus as per the journal record. Duration of examination is three hours. IT208 Lab : Data Structures
Teaching Scheme : Examination Scheme :

Practical : 2 hrs/week Suggestive List of Experiments -

Term Work : 50 Marks Pract/Viva-voce : 50 Marks Credits : 2

1. Program for implementing Stack and Queue. 2. Program for implementing Singly Linked List and Doubly Linked List. 3. Program for implementing Circular Queue using Linked List. 4. Program for Creation of Binary Tree and operations on it. 5. Program for Creation of Binary Threaded Tree. 6. Program for Depth First search and Breadth First search. 7. Program for Bubble Sort and Bucket Sort. 8. Program for Merge Sort and Heap Sort. 9. Program for Insertion Sort and Quick sort. 10. Program for Binary Search to search an element in the given sequence. 11. Program to implement two stacks in the one array. TERM Work: The term work shall consist of at least 10 experiments/ assignments based on the syllabus of the subject. Assessment of term work should be done based on the points mentioned below: - Continuous lab assessment - Actually performing practicals in the laboratory - Oral Examination conducted (internally) at the time of submission Practical Examination: The Practical Examination shall consist of writing and performing an experiment / assignment and oral based on the syllabus as per the journal record. Duration of examination is three hours.

10

IT209 Lab : DIGITAL CIRCUITS

Teaching Scheme : Practical : 2 hrs/week Suggestive list of Programs Examination Scheme : Term Work : 25 Marks Pract/Viva-vice,. : 25 Marks Credits : 2

1. Study of digital ICs and verification of Logic Gates 2. Study & verification of operation of half and full Adder 3. Study & verification of operation of half and full Substractor 4. Verification of operation code converter 5. Verification of operation Multiplexer & Demultiplexer 6. Verification of operation 2 bit comparator 7. Verification of operation of ALU 8. Study & Verification of operation FILP FLOP 9. Study & Verification of operation Shift Registers 10. Study & Verification of operation of counters TERM Work: The term work shall consist of at least 10 experiments/ assignments based on the syllabus of the subject. Assessment of term work should be done based on the points mentioned below: - Continuous lab assessment - Actually performing practicals in the laboratory - Oral Examination conducted (internally) at the time of submission Practical Examination: The Practical Examination shall consist of writing and performing an experiment / assignment and oral based on the syllabus as per the journal record. Duration of examination is three hours.

11

GE-215 Engineering Mathematics - IV Teaching Scheme : Lectures : 4 Hrs. / week Examination Scheme: Test 20 Marks End Sem Exam 60 Marks Assignment - 20 Marks

Unit 1
equation), one dimension heat flow, and two-dimensional heat flow (Laplace equation).

[8 Hrs]

Solution of partial differential equations by method of separation of variables. Applications to vibrating string (Wave

Unit 2
Taylors series method, Eulers modified method and Runge-Kutta fourth order method. Unit 3

[8 Hrs]

Lagranges interpolation formula, Numerical differentiation, solution of ordinary differential equation by Picards method,

[8 Hrs]

Vector calculus, different ion, gradient, and divergence, curl of vector function. Vector integration. Greens Theorem, stokes theorem, Gauss divergence theorem. Irrorational & solenoidal fields.

Unit 4

[8 Hrs]

Probability: Binomial Poisson & Normal distribution. Solution of algebric & transcendental equations by Newtons Raphson method. Solution of linear simultaneous equations by Gauss elimination method, Gauss-Seidal method.

Unit 5

[8 Hrs] Probability: Random variables & probability distribution Mathematical expectation probability generating function. Books 1) A Text Book of Engineering Mathematics (Vol. I & II) P.N. Wartikar and J.N.Wartikar, Pune Vidhyarthi Griha Prakashan, Pune. 2) Higher Engineering MathematicsB.S.Grewal, Khanna Publicatons,New Delhi. 3) Advanced Engineering Mathematics (8th Edition) Erwin Kreyszing, Willey Eastern Ltd.,Mumbai. 4) Engineering MathematicsH.K. Das, S. Chand & Co., New Delhi.

12

IT-210 Object Oriented Programming Systems

Teaching Scheme : Lectures : 4 hrs/week Examination Scheme : Test : 20 Marks End Sem. Exam. : 60 Marks Assignment : 20 Marks Credits : 4

Objectives:

- To train the students on fundamentals of Object Oriented Programming - To train the students for a strong foundation for using these concepts in software development
CONTENTS

Unit 1. Introduction to OOPS:

(8) Advantages of OOPS language & development platform, Basic programming construction functions, program statements preprogramming directives, include directives, header files ,I/O statement variables, manipulators, Loops & Decisions, Arrays , Structures, Functions Unit 2. Objects and Classes: (8) Class as Data type, Object as function arguments, Encapsulation, Data hiding overloaded constructors, object as argument, returning object from function, static class data, Constructors, destructors.

Unit 3. Operator Overloading:

(8)

Overloading unary and binary operators, Overloading binary operators, multiple overloading, comparison operators, conversion between basic types, conversion between objects of different classes conversion between basic types, conversion between basic types between objects of different classes . Unit 4. Inheritance and Polymorphism: (8) Derived class and base class-specifying the derived class, accessing base class member, derived class constructors, overriding member functions public and private inheritance-access combinations classes and structures accessing specifies, levels of inheritance-multiple inheritance. Run time and compile time polymorphism.

Unit 5. Files and streams, Templates in C++:

(8)

Streams-stream class hierarchy, stream classes-string I/O Writing strings, detecting end of file, character I/O Object I/O,I/O with multiple objects-the fstream class, open function-file pointers-specifying position, specifying the offset, the calling function, error handling-redirection-redirecting input, carr and clog objects, IOS flags Template classes for Stack, vector, linked list. Text books 1. Object oriented programming in Turbo C++ by E. Balguruswami 2. Object oriented analysis and design with application by Grady Booch Reference Web Sites 1.www.cplusplus.com/doc/tutorial/ 2. www.smartdraw.com/tutorials/software-uml/uml.html

13

IT- 211 COMPUTER GRAPHICS

Teaching Scheme : Lectures : 4 hrs/week Examination Scheme : Test : 20 Marks Assignment : 20 Marks End Sem. Exam. : 60 Marks Credits : 4

Objective: Introduce the students to graphics fundamentals Make them aware of 2-D and 3-D graphics primitives Study the GUI design methods Know the basics of multimedia applications
CONTENTS

Unit 1: Introduction and applications (8) What is Computer Graphics?, GUI Applications, Conceptual framework for CG. Display Devices: Random scan and raster scan monitors, color CRT, Plasma panel displays, LCD panels, 3-D viewing devices Graphical Input Devices, Hard copy devices, Introduction to graphics standards (SRGP, PHIGS etc) Line drawing algorithms: DDA and Bresenhams. Graphics primitives, Line functions, character attributes, properties of circle, Circle generating algorithm, filling rectangles, filling polygons Unit 2: 2-D Drawing Geometry and transformation
(8)

2-D transformations, homogeneous coordinates and matrix representation of 2-D transformations, other 2-D transformations: reflection and shear, window to viewport transformation, clipping in raster world, clipping lines, clipping polygons, text clipping and exterior clipping Unit 3: 3 D transformations/ User interface
(8)

3-D viewing: An introduction, Projections, 3-D transformations, matrix representation, composition of 3-D transformation, coordinate system GUI and interactive input methods: The user dialogue, features of GUI:Windows and icons, accommodating multiple skill levels, consistency, minimizing memorization, backup and error handling, feedback. Logical classification of input devices, input functions, concurrent use of input modes, interactive picture construction techniques

14

Unit 4: Curves/ Visible surface Detection Curves: Parametric cubic curves, parametric bicubic surfaces. Curve drawing and fitting techniques. Bezier curves: Its properties, parametric representation.
Fractal geometry methods, classification of fractals.

(8)

Techniques for visible surface detection, algorithm for visible line determination, Back face detection and removal, Zbuffer algorithm, Visible surface Ray tracing algorithm. Unit 5: Multimedia and its applications (8) What is multimedia, multimedia building blocks: text audio, images, animation, Design of animation sequences, animation functions, morphing, simulation, video. Elements of multimedia system, multimedia hardware, basic tools in multimedia

Text Books: 1.Donald Hearn and Baker, Computer Graphics, PHI Pub. 2. ISRD Group, Computer Graphics, Tata McGraw Hill Pub. , ISBN-0-07-059376-0. Reference Books: 1. A P Godse , Computer Graphics, Technical pub., 3rd Revised Edition 2. J.D. Foley, A V Dam, Computer Graphics, Principles and Practice, Addison Wesley Pub.

IT-212 MICROPROCESSOR SYSTEMS

Teaching Scheme : Lectures : 3 hrs/week Examination Scheme : Test : 20 Marks End Sem. Exam. : 60 Marks Assignment : 20 Marks Credits : 3

Objective: - To train the students on fundamentals of Microprocessor 8085 and 8086. - To train the students on basic Design issues of processors - To study assembly Language programming and newer technologies in Microprocessors
CONTENTS

Unit 1. Microprocessor Architecture

Intel 8O85-Functions of ALU, Timing and Control unit, Registers," Data, Address and Control, Buses, Pin Configuration and functions of various pins, Opcode, Operand.

(06 )

15

 Instruction Word Size, Fetch, Execute Operation, Machine Cycle and States, Instruction and Data flow, Timing Diagram, Memory Read Write operation, 8085 based Microcomputer System.

Unit 2. Instruction Set for Intel 8085

Instruction and data formats, Addressing modes, Status Flags, Data transfer Arithmetic, Logical, Branch Group Machine Control instruction, looping, Counting and indexing, Use of Counters and Time Delays, Use of Stacks & Subroutines, Example of Assembly Language programming

(06)

Unit 3. Interfacing and Data Transfer Schemes

Memory Mapped I/O and I/O mapped I/O schemes, Memory interfacing, I/O interfacing. Data transfer scheme Programmable data transfer, DMA Data transfer, Synchronous, Asynchronous and Interrupt driven data transfer. Interrupts of 8085 : Interrupt process, Maskable & Non-maskable Interrupt, Steps to initiate and implement Interrupt, Interrupts priority, SIM & RIM instructions, Brief concept of DMA.

(06)

Unit 4. Introduction to Microcontrollers

(06) - Comparison with microprocessors - Study of Microcontroller (MCS 51 family) -8051 microcontroller: Architecture instruction set programming , addressing modes

Unit 5.Microcontroller Interfacing and Applications

(06)

Interrupts- ports ,timers, serial data transmission - Interfacing with Stepper motor ,ADC and DAC- Typical embedded applications.

Text Books:
1. Ramesh S. Gaonkar ,Microprocessor Architecture, Programming, and Applications with the 8085, 5/E Prentice Hall ,2002. 2 . B.Ram Fundamentals of Microprocessors and Microcontrollers 3. Borole and Vibhute, Microprocessor, 2nd edition, Technova Publications 4.Muhammad Ali Mazidi and Janice Gillispie Mazidi, The 8051 Microcontroller and Embedded Systems , Pearson education ,2000

Reference Books
1 Kenneth J Ayala, The 8051 Microcontroller, Architecture ,Programming and Applications

,International Thompson Publishing . 2. Microprocessors and Digital Systems by Douglas V. Hall

16

IT-213 DATA COMMUNICATION

Teaching Scheme : Lectures : 4 hrs/week Examination Scheme : Test : 20 Marks End Sem. Exam. : 60 Marks Assignment : 20 Marks Credits : 4

Objective: - To train the students on fundamentals of existing and upcoming

communication technologies.

- To train the students to lay a strong foundation for Computer Networks

CONTENTS

Unit 1. An Overview of Data Communication & Terminal Devices

(8) The Importance of Data Communications, The First Data Communications Systems, Two-State Communications Systems, Early Communications Codes, Modern Codes, Tele-printers , Data Communications in Computing, General Description of Data Communications Systems, Tele-printers, Tele-printers versus CRT Terminals, Serial Printers, CRT Terminals, Parts of a Terminal, PC Terminals, The Need for Speed, Data Transmission. Need for a modulation in communication systems. Concept of AM, FM, PM, PAM, FSK, PSK and PCM (no mathematical treatment)

Unit 2. Messages and Transmission Channels

(8) Information as a Quantity, Bounded Medium, Unbounded Medium, Effects of Bandwidth on a Transmission Channel, Bandwidth Requirements for Signals.

Unit 3. Synchronous , Asynchronous Modems and Interfaces

(8)

Why Data can not be transmitted Directly, Solving the Problem with Modems, Analog Modulation, V.21 Standard, Modem Features, Interface and Signaling Standards, The RS- 232 and V.24 Interface, Smart Modems, Fax Modems Synchronous Signaling and Standards, Typical Synchronous Components, High-Speed Modems.

Unit 4. Multiplexing, Fiber-Optic and Satellite Communications

(8) ] Sharing a Channel: FDM ,DM , PCM, Framing, Time Division Multiplexing ,Statistical Time-Division Multiplexing, Introduction and Historical Perspective, Fundamentals of Fiber-Optic Systems, Fiber-Optic Subsystems and Components, Satellite Transmission Systems.

Unit 5. PC Communications Software/ Local Area Networks/ The Internet

(8)

Communications Program Features, Dial-Up Networking, Overview of LANs, The Ideal LAN, LAN Standards, Internetworking Devices, Evolution of the Internet, Application Services, Internet Access Providers, IP Addressing Mobile Wireless, GSM, CDMA & Network Types

17

Text Books: 1. Gilbert Held , Understanding Data Communications, Seventh Edition Addison Wesley,

Reference Books
1. Introduction to Data Communications- A Practical Approach by Larry Hughes, Narosa Publishing House Pvt Ltd , Darya Ganj New Delhi 110002 2. William Stalling , Data and Computer Communication , PHI Publiations 3. A.S. Tanenbaum , Computer Networks , PHI Publiations

18

IT-214 Lab Microprocessor Systems

Teaching Scheme : Practical : 2 hrs/week Examination Scheme : Term Work : 25 Marks Pract/Viva-vice,. : 25 Marks Credits : 1

Suggestive List of Experiments 1. Study of 8085 Microprocessor Kit used in laboratory Familiarization with Kit and identification of its various parts like keyboard, Memory, Timer, Interrupt Controller, Display Unit, Interface Unit 2. Writing an assembly language program using mnemonics and test them on 8 BIT MICROPORCESSOR KIT Addition of two 8 bit number Subtraction of 8 bit number Multiplication of 8 bit number Division of 8 bit number Finding average of N given Integers Finding maximum number out of three given numeric To arrange the data array in ascending ancJ descending order Addition of two 16 Bit number Setting up 0 to 09 count BCD addition, BCD subtraction and other Exercises given by the Lab-Incharge. 3. Study of interfacing cards of A/D and D/A converter 4. Study of 8255, 8257, 8259, 8279, 8253 study card using a 8 bit Microprocessor 5. Some exercises of assembly language programmes using a 8255 input & output ports.

TERM Work: The term work shall consist of at least 10 experiments/ assignments based on the syllabus of the subject. Assessment of term work should be done based on the points mentioned below: - Continuous lab assessment - Actually performing practicals in the laboratory - Oral Examination conducted (internally) at the time of submission Practical Examination: The Practical Examination shall consist of writing and performing an experiment / assignment and oral based on the syllabus as per the journal record. Duration of examination is three hours.

19

IT 215 Lab : Computer Graphics

Teaching Scheme : Practical : 2 hrs/week Examination Scheme : Term Work : 50 Marks Pract/Viva-vice,. : 50 Marks Credits : 2

Suggestive List of Experiments -

1] Write a program for DDA Line drawing Algorithm 2] Write a program for Bresenhams Line drawing Algorithm 3] Write a program for polygon filling 4] Write a program for 2 D transformation 5] Write a program for 3 D transformation 6] Write a program for Line clipping Algorithm 7] Write a program for Bezier curves 8] Program on Animation TERM Work: The term work shall consist of at least 10 experiments/ assignments based on the syllabus of the subject. Assessment of term work should be done based on the points mentioned below: - Continuous lab assessment - Actually performing practicals in the laboratory - Oral Examination conducted (internally) at the time of submission Practical Examination: The Practical Examination shall consist of writing and performing an experiment / assignment and oral based on the syllabus as per the journal record. Duration of examination is three hours.

20

IT 216 LAB- OOPS

Teaching Scheme : Practical : 2 hrs/week Examination Scheme : Term Work : 25 Marks Pract/Viva-vice,. : 25 Marks Credits : 1

Suggestive List of Experiments -

1] Write a program to demonstrate different types of constructors. 2] Write a program for overloading various unary operators. 3] Write a program for overloading various binary operators. 4] Write a program for type conversion (basic to class, class to basic ,class to class) 5] Write a program for multiple inheritance 6] Write a program for hybrid inheritance 7] Write a program for polymorphism(virtual function) 8] Write a program for templates 9] Program using files 10] Program using streams TERM Work: The term work shall consist of at least 10 experiments/ assignments based on the syllabus of the subject. Assessment of term work should be done based on the points mentioned below: - Continuous lab assessment - Actually performing practicals in the laboratory - Oral Examination conducted (internally) at the time of submission Practical Examination: The Practical Examination shall consist of writing and performing an experiment / assignment and oral based on the syllabus as per the journal record. Duration of examination is three hours.
=================

21