se it syllabus

8/6/2019 SE IT Syllabus

1/38

Structure of S.E. (Information Technology) 2008 Course Proposed in year 2009 - 10

Part I Teaching

Sub ect Code Sub ect

Scheme Hours / Week

Examination Scheme Total Marks

No. Lect. Pract. Paper T/W Pract. Oral Total

210241 Discrete Structures 4 ---- 100 --- --- --- 100

214442 Computer Organization 3 ---- 100 --- --- --- 100

210243 Digital Electronics and Logic Design 4 ---- 100 --- --- --- 100

214441 Fundamental of Data structures 4 ---- 100 --- --- --- 100

207005 Humanities and Social Sciences 3 ---- 100 --- --- --- 100

214443 Digital Laboratory ---- 4 ---- 50 50 ---- 100

214444 Programming Laboratory --- 4 --- 50 50 --- 100

214445 Communication and Language Lab. 1 2 --- 50 ---- --- 50

Total 19 10 500 150 100 --- 750

Total of Part I (A) 29 Hrs 750

Part II

Subject Code Subject

TeachingSchemeHours / Week

Examination Scheme Total Marks

No. Lect. Pract. Paper T/W Pract. Oral Total

Total of Part II (B) 29 Hrs 750

Grand Total (A) + (B) 1500 1

207003 Engineering Mathematics III 4 --- 100 --- --- --- 100

214446 Computer Graphics 3 --- 100 --- --- --- 100

214447 Processor Architecture & Interfacing 3 --- 100 --- --- --- 100

214448 Data Structures and Files 3 --- 100 --- --- --- 100

214449 Data Communication 3 --- 100 --- --- --- 100 214450 Processor Interfacing Laboratory --- 4 --- 25 --- 50 75

214451 Data Structures and Files Laboratory --- 4 --- 25 50 --- 75

214452 Objected Oriented Programming 1 4 --- 50 50 --- 100and Computer Graphics Laboratory

Total 17 12 500 100 100 50 750


2/38


3/38

210241: DISCRETE STRUCTURES

Teaching Scheme Examination SchemeLectures: 4 hrs/week Theory: 100 Marks

Discrete mathematics- the mathematics of integers and of collections of object underlies theoperation of digital computer, and is used widely in all fields of computer science for reasoningabout data structures algorithms and complexity. The primary objective of subject is to preparestudents mathematically for the study of computer engineering. Topics covered in the courseinclude proof techniques, logic and sets, functions, relations, counting techniques, probability andrecurrences. By the end of the course, students should be able to formulate problems precisely,solve the roblems, a l formal roof techni ues, and ex lain their reasonin clearl .

Prerequisite: Basic Mathematics

Learning objectives: the student will be able to

Use appropriate set, function, or relation models to analyze practical examples, interpret theassociated operations and terminology in context.

Determine number of logical possibilities and probability of events. Learn logic and proof techniques to expand mathematical maturity. Formulate problems precisely, solve the problems, apply formal proof techniques, and

ex lain their reasonin clearl .

Unit I : (8 Hrs)Sets and Propositions

Sets, Combination of sets, Finite and Infinite sets, Un-countably infinite sets, Principle of inclusionand exclusion, multisets. Propositions, Conditional Propositions, Logical Connectivity, Propositional calculus, Universaland Existential uantifiers Normal forms methods of roofs Mathematical Induction.

Unit II : (8 Hrs)Groups and Rings Algebraic Systems, Groups, Semi Groups, Monoid, Subgroups, Permutation Groups, Codes andGroup codes, Isomorphism and Automorphisms, Homomorphism and Normal Subgroups, Ring,Integral Domain, Field, Ring Homomorphism, Polynomial Rings and Cyclic Codes .

Unit III : (10 Hrs)Relations and Functions Properties of Binary Relations, Closure of relations, Warshalls algorithm, Equivalence Relations and partitions, Partial ordering relations and lattices, Chains and Anti chains. Functions, Composition of functions, Invertible functions, Pigeonhole Principle, Discrete Numeric functions and Generating functions, Job scheduling Problem. Recurrence Relations Recurrence Relation, Linear Recurrence Relations With constant Coefficients, Homogeneous Solutions, Total solutions, solutions by the method of generating functions.

3


4/38

Unit IV : (8 Hrs)Graphs Basic terminology, multi graphs and weighted graphs, paths and circuits, shortest path in weighted graph, Hamiltonian and Euler paths and circuits, factors of a graph, planer graph and Travelling salesman problem.

Unit V : (8 Hrs)Trees Trees, rooted trees, path length in rooted trees, prefix codes, binary search trees, spanning trees andcut set, minimal spanning trees, Kruskals and Prims algorithms for minimal spanning tree, TheMax flow Min cut theorem (transport network).

Unit VI : (8 Hrs)Permutations, Combinations and Discrete Probability Permutations and Combinations: rule of sum and product, Permutations, Combinations,Algorithms for generation of Permutations and Combinations. Discrete Probability,Conditional Probability, Bayes Theorem, Information and Mutual Information.

Text Books:

1. C. L. Liu and D. P. Mohapatra, Elements of Discrete Mathematics, SiE Edition,TataMcGraw-Hill, 2008, ISBN 10:0-07-066913-9

2. R.Johnsonbaugh,Discrete Mathematics,5 thEdition,PearsonEducation,2001ISBN817808279-9(Recommended for Unit I and Unit II)

Reference Books:

1. N. Biggs,Discrete Mathematics,3 rdEdition,Oxford University Press, ISBN 019850717- 8 2. Kenneth H. Rosen, Discrete Mathematics and its Applications, 6th edition, McGraw-Hill,

2007. ISBN 978-0-07-288008-3 3. E. Goodaire and M.Parmenter,Discrete Mathematics with Graph Theory,2 nd edition,Pearson

Education,2003 ISBN 8178088274 4. Semyour Lipschutz & Marc Lipson,Discrete Mathematics,McGraw-Hill,3

rdSpecial Indian

Edition, ISBN-13 : 978-0-07-060174-1 5. B. Kolman,R.Busby and S. Ross,Discrete Mathematical Structures,4 th Edition,Pearson

Education,2002, ISBN 81-7808-556-96. N. Deo, Graph Theory with application to Engineering and Computer Science, Prentice Hall

of India,1990, 0 87692 145 4

4


5/38

214442 COMPUTER ORGANIZATION

Teaching Scheme Examination scheme Lectures: 3 hrs / week Theory: 100 Marks

Learning Objectives

1. To understand the structure, function and characteristics of computer systems. 2. To understand the design of the various functional units of digital computers. 3. To learn basics of Parallel Computer Architecture.

Unit I : (8 Hrs)Computer Evolution & Arithmetic A Brief History of computers, Designing for Performance, Von Neumann Architecture, Hardwarearchitecture, Computer Components, Interconnection Structures, Bus Interconnection, Scalar DataTypes, Fixed and Floating point numbers, Signed numbers, Integer Arithmetic, 2s Complementmethod for multiplication, Booths Algorithm, Hardware Implementation, Division, Restoring andNon Restoring algorithms, Floating point representations, IEEE standards, Floating pointarithmetic.

Unit II : (8 Hrs)The Central Processing Unit

Machine Instruction characteristics, types of operands, types of operations, Addressingmodes, Instruction formats, Instruction types, Processor organization, Intel 8086 as example,Programmers model of 8086, max/min mode, Register Organization, Instruction cycles, ReadWrite c cles, 8086 assembl instruction exam les to ex lain addressin modes.

Unit III : (6 Hrs)The Control Unit

Single Bus Organization, Control Unit Operations: Instruction sequencing, Microoperations and Register Transfer. Hardwired Control: Design methods State table and classicalmethod, Design Examples - Multiplier CU. Micro-programmed Control: Basic concepts,Microinstructions and micro- program sequencing.

Unit IV : (6 Hrs)Memory Organization

Characteristics of memory systems, Internal and External Memory, Types of memories:ROM: PROM, EPROM, EEPROM, RAM: SRAM, DRAM, SDRAM, RDRAM High-Speed Memories: Cache Memory, Organization and Mapping Techniques, ReplacementAlgorithms, Cache Coherence, MESI protocol. Virtual Memory: Main Memory allocation,Segmentation, Paging, Address Translation Virtual to Physical. Secondar Stora e: Ma netic Disk, Ta e, DAT, RAID, O tical memor , CDROM, DVD.

Unit V : (6 Hrs)I/O Organization

Input/Output Systems, Programmed I/O, Interrupt Driven I/O,8086 Interrupt structure,Direct Memory Access (DMA),8237 features Buses and standard Interfaces: Synchronous,Asynchronous, Parallel I/O 8255 features, Serial I/O 8251 features, PCI, SCSI, USB PortsWorking mechanisms of Peripherals: Keyboard, Mouse, Scanners, Video Displays, Touch Screenpanel, Dot Matrix, Desk-jet and Laser Printers(features and principles).

5


6/38

Unit VI : (8 Hrs)Parallel Organization

Instruction level pipelining and Superscalar Processors, Multiple Processor Organizations,Closely and Loosely coupled multiprocessors systems, Symmetric Multiprocessors, Clusters, UMA NUMA, Vector Computations,

RISC: Instruction execution characteristics,, RISC architecture and i elinin . RISC Vs CISC.

Te t Books

1. W. Stallings, Computer Organization and Architecture: Designing for performance, 67h Edition, Prentice Hall of India, 2003, ISBN 81 203 2962 7

2. C. Hamacher, V. Zvonko, S. Zaky, Computer Organization, McGraw Hill, 2002, 5th edition ISBN 007-120411-3

Reference Books

1. J. Hays, Computer Architecture and Organization, 2nd Edition, McGraw-Hill, 1988 ISBN 0 07 100479 3

2. W. Stallings William, Computer Organization and Architecture: Principles of Structureand Function, 2nd Ed, Maxwell Macmillan Editions, 1990 ISBN 0 02 946297 5 (Chapter: 2,3,4,5,7,8,9,10,11,12,13,14).

3. Tanenbaum, Structured Computer Organization, 4th Edition , Prentice Hall of India, 1991 ISBN 81 203 1553 7 (Chapter: 1,4,5,6,8).

4. G. George, Computer Organization: Hardware and Software, 2nd Edition, Prentice Hall of India, 1986 (Chapter: 3,4,5).

5. D. Paterson, J. Hennesy, Computer Organization and Design: The Hardware Software Interface, 2nd Edition, Morgan Kauffman, 2000

6


7/38

210243 DIGITAL ELECTRONICS AND LOGIC DESIGN

Teaching Scheme Examination scheme Lectures: 4 hrs / week Theory : 100 Marks

Prerequisites : Basic Electronics Engineering.

Learning Objectives

1. To learn and understand basic digital design techniques. 2. To learn and understand design and construction of combinational and sequential

circuits. 3. To introduce basic components of microprocessors.

Unit I : (8 Hrs)Number System& Logic Design Minimization Techniques

Introduction. Binary, Hexadecimal numbers, Octal numbers and number conversion.Signed Binary number representation. Signed Magnitude, 1s complement and 2s complementrepresentation. Binary, Hexadecimal Arithmetic. 2s complement arithmetic. Algebra for logic circuits : Logic variables; Logic function : NOT, AND, NOR, XOR, OR, XNOR, NAND. Codes : BCD, Excess-3, Gray code , Binary Code and their conversion. Boolean algebra. Truth tables and Boolean algebra. Idealized logic gates and symbols. DeMorgan'srules Axiomatic definition of Boolean algebra, Basic theorems and properties of Boolean algebra.

Unit II : (6 Hrs)Logic Families

TTL: Standard TTL characteristics- Speed, power dissipation, fan-in, fan-out, current andvoltage parameters, noise margin, operating temperature etc. Operation of TTL NAND gate. TTLConfigurations- Active pull-up, Wired AND, totem pole, open collector. CMOS: CMOS Inverter, CMOS characteristics, CMOS configurations- Wired Logic, Open drainoutputs. Interfacin : TTL to CMOS and CMOS to TTL.

Unit III : (8 Hrs)Combinational Logic

Logic minimization Representation of truth-table, SOP form, POS form, Simplification of logical functions, Minimization of SOP and POS forms, Dont care conditions. Reduction techniques: K-Maps (only up to 4 variables) & Quine McClusky technique Arithmetic Operations: - Binary Addition, Subtraction, BCD Addition Circuits: - Half- Adder, Full Adder, Half Subtract or, Full Sub tractor, BCD adder using andsubtractor using IC 7483, look ahead carry, parity generator and checker using IC 74180, magnitude comparator using IC 7485. Multiplexers (MUX) : Working of MUX, Implementation of expression using MUX (IC 74153, Demultiplexers IC 74151). Demultiplexers (DEMUX):- Implementation of expression using DEMUX, Decoder (IC 74138).

7


8/38

Unit IV : (8 Hrs)Sequential Logic

Introduction: Se uential Circuits. Difference between combinational circuits and se uential circuits Flip- flop : SR, JK, D, T; Preset & Clear, Master and Slave Flip Flops their truth tables and excitation tables, Conversion from one type to another typeof Flip Flop. Study of 7473,7474,7476 Application of Flip-flops. Bounce Elimination Switch, registers, counters.Registers : Buffer register; shift register;7495 Counters : Asynchronous counter, Synchronous counter, Ring counters, BCD Counter,Johnson Counter, Modulus n counter (IC 7490, IC 74191), Pseudo Random Binary Sequence Generator, Sequence generator and detector.

Unit V : (8 Hrs)ASM & Programmable Logic Devices

Algorithmic State Machines,ASM charts, notations, design of simple controller,multiplexer controller method. Examples. Sequence Generator, Types of Counter. Programmable Logic Devices: PLD: PLA- Input, Output Buffers, AND, OR, Invert/ Non-Invert Matrix.Design Example- Any 4 Variables SOP function using PLDs. Stud of basic architecture of FPGA CPLD.

Unit VI : (6 Hrs)VHDL and Introduction to Microprocessors

Introduction to HDL, VHDL- Library, Entity, Architecture, Modeling Styles, Concurrentand Sequential Statements, Data Objects & Data Types, Attributes. Design Examples. VHDL for Combinational Circuits-Adder, MUX. VHDL for Sequential Circuits-Synchronous and Asynchronous Counter. ,Shift Register.Introduction to Microprocessor. Introduction of Ideal Microprocessor, Data Bus, Address Bus,Control Bus, 8085 Pro rammers model as an exam le.

Te t Books

1. James Bignell, Robert Donavan Digital Electronics 5th edition CENEGAGE Learning ISBN

2. TB 1. R.P.Jain, Modern Digital Electronics, 3rd Edition, Tata McGraw-Hill, 2003, ISBN 0 07 049492 4

3. TB 2. Stephen Brown, Zvonko Vranesic Fundamentals of Digital Logic with VHDLDesign Mcgraw-Hill

Reference Books

1. John Yarbrough, Digital Logic applications and Design Thomson 2. Flyod Digital Principles, Pearson Education 3. Malvino, D.Leach Digital Principles and Applications, 5th edition, Tat Mc-Graw Hill 4. J.Bhaskar VHDL Primer 3rd Edition, Pearson Edition

8


9/38

214441 FUNDAMENTAL OF DATA STRUCTURE


Prerequisite : Fundamental knowledge of C from Fundamentals of Programming Language.

Learning Objectives

The students shall learn the C language and pointers in depth. They will be able to useointers for data mani ulation. The will learn linear data structures.

Unit I : (8 Hrs)Introduction to C

Constants, variables and keywords in C, operators and control structure in c(decision, loopand case), functions, macros, arrays and string manipulation, structure, union, enumeration, bitwiseo erations.

Unit II : (8 Hrs)Arrays & Pointers in C Functions: Parameter passing call by value and call by reference, scope rules, functions andpointers, function returning pointer and pointer to function, String manipulations usingarrays,pointer to pointer. Structure and Union: Passing and returning structure as parameter for function ,structure andpointer. Recursion: Definition, writin recursive functions & how recursion works. File handlin usin C.

Unit III : (8 Hrs)Introduction to Data structures & Analysis of Algorithams Introduction to Data Structures: Concept of data, Data object, Data structure, Abstract Data Types (ADT), realization of ADT in C. Concept of Primitive and non primitive, linear and Non-linear, static and dynamic ,persistent andephemeral data structures. Analysis of algorithm: frequency count and its importance in analysis of an algorithm, Timecomplexity & Space complexity of an algorithm, Big O, and notations, Best, Worst andAvera e case anal sis of an al orithm.

Unit IV : (8 Hrs)Searching and sorting techniques Need of searching and sorting, why various methods of searching and sorting, Sortingmethods:Linear and binary search. Sorting methods : Bubble, insertion, selection, merge, quick, bucket, Time com lexit of each searchin and sortin al orithm.

9


10/38

Unit IV : (8 Hrs)Linear data structures using sequential organization

Concept of sequential organization, Concept of Linear data structures, Concept of orderedlist, Storage representations of ordered list such as row major , column major and their addresscalculation.

Representation of sparse matrix using arrays, application of array in polynomialrepresentation and algorithm for sparse matrix addition, multiplication, simple and fast transpose.

Unit VI : (6 Hrs)Linear data structures using linked organization

Concept of linked organization, singly linked list, doubly linked list, circular linked list.Linked list as ADT. Representation and manipulations of polynomials using linked lists,comparison of sequential linked organization with linked organization, concept GeneralizedLinked List.

Te t Books 1. R. Gilberg, B. Forouzan, Data Structures: A pseudo code approach with C, Cenage Learning,

ISBN 9788131503140. 2. E. Horowitz , S.Sahani, S.Anderson-Freed Fundamentals of Data Structures in C,

Universities Press ,2008 ,ISBN 10:8173716056 3. Yashwant Kanitkar,Let us C & Pointer in C,BPB Publication

References Books

1. Kernighan and Ritchie, "The C Programming Language", Prentice Hall 2. Tremblay and Sorenson , "An introduction to data structures with applications", Tata

McGrawHill, Second Edition

10


11/38

207005 HUMANITIES AND SOCIAL SCIENCES


Learning Objectives

This course will lead to the learning of 1. Human and social development. 2. Contemporary national and international affairs. 3. Emergence of Indian society and Economics. 4. Sectoral development and Economic development and related issues (such as international

economics, WTO, RBI, etc).

Unit II : (6 Hrs)Indian Society

Structure of Indian Society, Indian Social Demography Social and Cultural,Differentiations: caste, class, gender and tribe; Institutions of marriage, family and kinship-Secularization Social Movements and Regionalism- Panchayatraj Institutions; Affirmative ActionPro ramme of the Government-various reservations and commissions.

Unit II : (6 Hrs)Social Development

Scientific approach to the study of human beings. Evolution of human kind, social changeand evolution. Industrial revolution. National policy on education, health and health care andhuman develo ment.

Unit III : (6 Hrs)Sectoral Development

Agriculture : Technology changes, Green revolutions, Employment Rural and Urban,Government Schemes. Industrial Development : Strategies, Public and Private Sectors, Categories, infrastructure,trans ort and communication, Consumer Awareness.

Unit IV : (6 Hrs)Environment and Ecology

Ecosystems : Structure, Working, components. Pollution : Water and Air Pollution, Global Warming, Control Strategies, International Treaties.Energy Sources : Renewable and Non Renewable, Hydro power, Biomass, Ocean, Geothermal andTidal . Global Environmental Issues : Po ulation Growth, Soil De radation, Loss of Biodiversit .

Unit V : (6 Hrs)Economic Development

Need for planned economic development Law of demand and supply. Planning objective,five years plan, priorities and problems. Population and development. Indian Economics basic features, natural recourses population size and composition, national

income conce ts, micro economics of India, inflation.

11


12/38

Unit VI : (6 Hrs)Banking and Trades

Financial Analysis, Ratios, Cost Analysis, financial Institutions, Finance Commissions,Budget Analysis. Indian Banking, Role of Reserve bank of India. International Econom , WTO, International aid for economic rowth.

Outcome

Making engineering and technology students aware of the various issues concerning man andsociety. These issues will help to sensitize students to be broader towards the social, cultural,economic and human issues, involved in social chan es.

Methodologies

1. Suitable case studies should be discussed. 2. Student group discussion activity. 3. Social Networking activity.

Reference Books

1. Krugman, International Economics, Pearson Education. 2. Prakash, The Indian Economy, Pearson Education. 3. Thursen Gerald, Engineering Economics, Prentice Hall. 4. C.S. Rao, Environmental Pollution Control Engineering,New Age International Pvt. Ltd.

5. Rangarajan, Environmental Issues in India, Pearson Education. 6. University of Delhi, The Individual & Society, Pearson Education. 7. Wikipedia.org / wiki /social studies. 8. M. N. Srinivas, Social change in modern India, 1991, Orient Longman. 9. David Mandelbaum, Society in India, 1990, Popular.

12


13/38

214443 DIGITAL LABORATORY

Teaching Scheme Examination scheme Practical: 4 hrs / week Practical: 50 Marks

Term Work: 50 Marks A. Combinational logic design

1. TTL Characteristics (study and write-up only). 2. Design ( truth table, K map ) and implement 4 bit Code converter.

i. Binary to gray and vice versa. ii. BCD to Excess-3 and vice versa.

3. Design ( truth table, K map ) and implement 4 bit BCD Adder / Subtractor using IC 7483. 4. Realization of Boolean expression using multiplexer IC 74151/74153. 5. Design ( truth table, K map ) and implement Parity generator / detector using EX-OR gates

and IC 74180.

B. Sequential circuit design

1. Design & Implement of SR ,JK flip-flop using discrete gates and T, D flip-flop using Master Slave J-K flip-flop IC 7476.

2. Design (State diagram) and implement 4 bit Up, Down, Controlled Up/Down Ripplecounter using master slave JK flip-flop IC 7476.

3. Design (State diagram, state table, K map ) and implement 4 bit Up, Down, Controlled Up/Down Synchronous counter using master slave JK flip-flop IC 7476.

4. Design and implement Modulo n counter with IC 7490 and IC 74191. 5. Design (State diagram, state table, K map, Bush table & Bush diagram) and implement

Sequence Generator (with & without bushing) using master slave JK flip-flop IC 7476. 6. Design (State diagram, State table, K map) and implement Sequence Detector using master

slave JK flip-flop IC 7476.

C. VHDL Programming Simulation of

1. 4:1 multiplexer using data flow modeling. 2. Full adder with Half adder using structural modeling. 3. D Flip-Flop using behavioral modeling. 4. 3 bit bidirectional shift register.

D. ASM, PALS and FPGA 1. Simple ASM using multiplexer controller method. 2. Implementation of combinational logic using PLAs 3. Study of FPGA devices (Study and Write up only).

Instructor will frame assignments based on the suggested assignments as given above. Studentswill submit the term work in the form of journal consisting of minimum of 16 assignments owhich assi nment of Grou C and 2 assi nments from Grou D are com ulsor .

Practical examination will be based on the term work and questions will be asked to judge theunderstandin of assi nments erformed at the time of examination.

Note : Concern staff member should take care that the Students verify the functionalityof the ICs bein used.

13


14/38

214444 PROGRAMMING LABORATORY

Teaching Scheme Examination scheme Practical: 4 hrs / week Practical: 50 Marks

Term work: 50 Marks

This laboratory includes the assignments based on Fundamentals of Data Structures using featuresof C Lan ua e.

List of experiments:

1. Implement set operations using arrays and perform union, intersection, difference,symmetric difference.

2. Implement following Matrix operations: a. addition with pointers to arrays, b. multiplication without pointers to arrays,c. transpose with pointers to arrays, d. saddle point without pointers to arrays.

3. Perform following String operations with and without pointers to arrays (without using thelibrary functions) : a. substring, b. palindrome, c. compare, d. copy, e. reverse.

4. Structure manipulation (for any database like Employee or Bank database) with andwithout pointers to structures.

5. Accept student information (e.g. RollNo, Name, Percentage etc.). a. Display the data in descending order of Percentage (Bubble Sort). b. Display data for Roll No specified by user (Linear Search). c. Display the number of passes and comparisons for different test cases (Worst,

Average, Best case). 6. Accept Mobile user information (e.g. MobileNo, Name, BillAmount etc.).

a. Display the data in descending order of MobileNo. (insertion Sort)b. Display the data in ascending order of Name (Selection Sort) c. Display details for Mobileno specified by user (Binary Search) d. Display the number of passes and comparisons for different test cases (Worst,

Average, Best case).

7. Implement Quick Sort recursively of the following set of numbers such as 56, - 90, 80, 78, 234, 654, 432, 12, 0, -11.

8. Implement Sparse matrix and perform following operations on it: Addition, Simple

Transpose and Fast Transpose. 9. Create a singly linked list with options:

a. insert (at front, at end, in the middle),b. delete (at front, at end, in the middle),c. Display, d. Display Reverse,e. Revert the SLL.

10. Accept input as a string and construct a Doubly Linked List for the input string with eachnode contains, as a data one character from the string and perform:

a Insert b delete, c Dis la forward, d Dis la backward.

14


15/38

Reference:

STEVE McCONNEL, Code complete

Note : While performing the assignments following care should be taken

1. Proper indenting, coding styles, commenting, naming conventions should befollowed.

2. Avoid using global variables as far as possible 3. Use of functions is necessary 4. All Assignments to be implemented using C and Time and Space Complexity is to

be verified with theoretical findings. 5. Faculty should prepare a lab manual including standard test cases & should be

available for reference to students.

Student should submit term work in the form of a journal based on the above assignments.Practical examination will be based on the term work. Questions will be asked during theexamination to judge the understanding of the practical performed at the time of examination.Candidate is ex ected to know the theor involved in the ex eriment.

15


16/38

214445 COMMUNICATIONS AND LANGUAGE LABORATORY

Teaching Scheme Examination scheme Lectures: 1hr/week. Practical: 2 hrs / week Term work: 50 Marks

Learning Objectives

Provide a sound grammatical and functional framework and systematic practice of keylanguage.

Present language in relevant and realistic situations. Develop an essential Business English vocabulary. Integrate pronunciation practice with the main language points. Build confidence by developing tactics to help learners control conversations and avoid

communication breakdowns. Motivate learners with activities to check their progress. Encourage learners to talk about their own jobs and experiences. Raise awareness of the cultural as ects of business communication.

Overview This course is designed for students with a limited knowledge of English who now want tocommunicate simply and confidently in a range of job-related situations. It maximizes study timeby focusing on essential language and skills and developing effective learning strategies. Studentslearn listening, speaking, reading and writing skills with exposure to Business English. It willallow systematic coverage of Grammar & Vocabulary through natural recycling of language. The

course will enable students to speak and write simple English in a range of everyday situations aswell as communicate effectively in business environment. It will also focus on remedial teaching.The course aims at enabling students to revise, consolidate and extend their command of Englishgrammar and vocabulary.

Teaching methodology in a Language Lab Teaching with one to one and one to many control with the teacher. This facility may be

utilised for teaching topics like Grammar, Writing Skills, Vocabulary, Phonetics etc. Broadcasting facility could be utilised for conducting both reading and listening

comprehension. One to one as well as one to many conversation facility in the software may be utilised for

making corrections, remedial teaching and discussions with students. Conference grouping could be used for conducting GDs. Word chatting. Pairing discussion may be used for conducting various activities to improve

communication skills. Students demonstration. Class tests. Student monitoring by teacher. Audio recording. Audio on demand (by students). Video on demand (by students). Material upload ( by teacher for upgradation of teaching material).

16


17/38

1: (4 Hrs)Vocabulary building expressions used in day to day situations, word & phrases useful in a professional context,business ex ressions, abbreviations, tele hone lan ua e, business idioms, olite re uests,

2 : (6 Hrs)

Phonetics Consonants, vowels, word stress, elementary intonation, Pronunciation practice, Generalhonetics exercises in lan ua e laborator .

3 : (6 Hrs)Grammer Functional Grammer, the tense: structure and use, formation of correct sentences in various situations, common mistakes and how to avoid them, auxiliary verbs and various ways in which each can be used, Re orted s eech and its use in s oken communication.

4 : (4 Hrs)Reading & Listening Skills Reading Comprehension, Listening Comprehension and Discussions based on Listening sessionsin groups of 10. Comprehension with various purposes such as finding precise information,inter retation of the information, understandin the ist.

5 : (4 Hrs)Writing Skills Business Correspondence: Business Letters, Covering Letters, Minutes of meeting, E-mailEtiquettes, Resume. Technical Writing: Introduction to Technical Writing (Manuals, brochuresetc. Technical Re orts.

6 : (4 Hrs)Communication Skills Formality and politeness, Body Language, Communication barriers, Planning, preparation, delivery and assessment of activities like: Public Speaking, Presentation Skills, Group Discussion, Interview Skills, Extempore, Expressing agreement or disagreement politely, Telephone etiquettes, Practice in lan ua e laborator , PPT.

7. Meeting Purpose,Procedure,Chairmanship,participation.minutes of meetind ,Physical arrangements.

8. Group Discussion

Group Dynamics ,Purpose, Organization, Group discussion for any 4 technical/non technicalto ics.

9.Audio Visual aids Basic Principles and guidelines, types of aids and use, Development of Power Point presentationon any technical or non technical topic with animation, Sound , video etc.

10 Effective Stress Management Sources of stress, Recognizing stress ,Managing emotional and physical stress.

17


18/38

Term work

Term work shall consist o f Journal/Reports/Presentations assigned by teacher and home assignements. A minimum of 10 assignments must be completed covering all topics. On topics 1 to 4 must be in a language lab. Group discussions oral presentation must be in batches.It is in the best interest of Institute that students develop the skills and senior Faculty Guest faculty be involved.

Reference Books 1.Krishna Mohan and Banerji Meera: Developing Communication Skills Macmillan India 2.Rutherford A.J. :Communication Skills for Technical Communiaction. Pearson Education

18


19/38

Semester - II

Information Technology 2008 Course

19


20/38


21/38

214446 COMPUTER GRAPHICS


Pre-requisites

1. Computer Programming and basic data structures. 2. Mathematics topics such as analytical geometry, trigonometry, linear algebra and matrices. 3. Knowledge of vector space, Matrices, Dot products and distances.

Learning Objectives

1. Understand the foundations of computer graphics: hardware systems, math basis, light and

color. 2. Come to appreciate the complexities of modeling realistic objects through modeling

complex scenes using a high-level scene description language. 3. Become acquainted with some advanced topics in computer graphics. 4. The student should gain an expanded vocabulary for discussing issues relevant to computer

graphics (including both the underlying mathematics and the actual programming). 5. The student should gain an appreciation and understanding of the hardware and software

utilized in constructing computer graphics applications. 6. The student should gain a comprehension of windows, clipping and view-ports in relation

to images displayed on screen. 7. The student should gain an understanding of geometric, mathematical and algorithmic

concepts necessary for programming computer graphics.

Teaching aid Faculties should use LCD to demonstrate the concept of Graphics.

Introduction Unit I : (6 Hrs)Basic Concepts Graphics Primitives: Introduction to computer graphics, Basics of Graphics systems, Raster scan

& random scan displays, display processor, display file structure, algorithms and display fileinterpreter. Display devices, Interactive devices: Tablets, touch panels, mouse, joysticks, track balls, light pen

etc., Data generating devices: Scanners and digitizers, primitive operations, display file structure,algorithms and display file interpreter, Text and line styles. Scan conversions , lines, line segments, vectors, pixels and frame buffers, vector generation, DDAand Bresenhams line and circle drawing algorithms*, initialising, thick lines, character generation:Stroke Principle, Starburst Principle, Bit map method, display of frame buffer. (* Scan conversion algorithms should be given mathematical treatment).

21


22/38

Unit II : (8 Hrs) 2D & 3D Transformations

2D Geometric Transformations, Basic transformations- translation, scaling, rotation, othertransformations such as reflection, shearing, matrix representation and homogeneous coordinatesystem, Composite transformation, 3D transformation Polygon filling methods.

Unit III : (8 Hrs) 3D Viewing & 3D object representation

Projections, Specifying an arbitrary 3D View, Examples of 3D viewing .Polygon surfaces,polygon tables, plane equation, polygon meshes, curved lines & surfaces, quadric surfaces, Splinerepresentation.

Unit IV : (5 Hrs)Color models & animation

Colors spaces : RGB, HSV, CMY(K), YIQ, Color Mixing. Computer Animation : Animation sequences ,functions & Languages, Key-frame systems, Motion S ecifications.

Unit V : (6 Hrs)Ray Tracing

Ray tracing methods, algorithms, ray surface intersection calculations. Transformation,Hierarch , Local Illumination and shadin .

Unit VI : (5 Hrs)Advanced Topics

Rendering equation and Monte Carlo methods, anti-aliasing, texture mapping, shadows,GPU, Bezier curves, Fractals, fractal lines and surfaces(With complete mathematical treatment of this unit)

Interactive Graphics & usage of at least two tools of computer graphics (3D studio,Ma a, Similar tools ( Usa e of tools in Lab .

Te t Books

1. Steven Harrington,Computer Graphics A Programming approach,Tata McGraw Hill.

2. M Paulin Baker,Computer Graphics, Pearson Education. Reference Books

1. Davis Rogers,Procedural Elements for Computer Graphics, Tata McGraw Hill 2. Foley and Van Dam,Computer Graphics:Principles and Practice, Pearson Education 3. F.S. Hill JR,Computer Graphics Using Open GL. Pearson Education 4. Amarendra N Sinha, Arun D Udai,Computer Graphics, Tata McGraw Hill

22


23/38

214447 PROCESSOR ARCHITECTURE AND INTERFACING

Teaching Scheme Examination scheme Lectures : 3 hrs week Theory : 100 Marks

Prerequisites : Computer Organization

Learning Objectives

1. To learn the architecture and assembly language programming of 80386 Microprocessor. 2. To provide insight to DOS and BIOS and their functions. 3. To study architecture and programming 8051 micro-controllers.

Unit I : (8 Hrs)Introduction to 80X86 Processors

16/32bit processor 80x86, 80386 Features and Architecture, Pin Description, Functional Description, Register Set , 80386 Real mode, Segmentation Bus Cycles Initialization and configuration, Bus operations , Address pipelined ,Memor or anization and I/O or anization, 16/32 bit transfer.

Unit II : (8 Hrs)Assembly Language Programming

Introduction to assembly language programming, Instruction set, Assembler, linker, loader,concepts, Assembler directives, file I/O processing, Far and near procedures, macros, Timing anddelay loops, DOS internal, DOS calls, .EXE, .COM files, Interfacing with 8086: Programmableparallel ports, 8255 A PPI, interfacing, keyboard & display, parallel printer interface, interfacingRAM.

Unit III : (6 Hrs)Protected Mode

Segmentation- support registers, related instructions descriptors, memory managementthrough segmentation, logical to linear/physical address translation, protection in segmentation,Privilege instructions.

Paging - support registers, descriptors, linear to physical address translation, TLB, page

level rotection, virtual memor , .enterin into PM mode and returnin back to RM mode.

Unit IV : (6 Hrs)Multitasking, Interrupts, Exceptions and I/O Inter-privilege level transfer using Call gates and confirming code segment .Multitasking - Support registers, related descriptors, Task switching, I/O permission bit map.

Virtual Mode - features, address generation, privilege level, instructions and registers available,entering and leaving V86 mode. Interru t structure - Real, Protected and Virtual 8086 modes, Com arison of all three modes

23


24/38

Unit V : (6 Hrs)Microcontroller

Microcontroller 8051 Architecture, On-Chip data memory and program memoryorganization - Register set, Register bank, SFRs, External data memory and program memory,Interru ts structure and Res onse.

Unit VI : (6 Hrs)Microcontroller

Timers and their programming, Serial port and programming, Other features, Design of minimum system using 8051 micro-controller for various applications. Features of PIC 16C, PIC 16F8XX ,Texas MSP 430.

Te t Books

1. Turley, Advanced Programming of 80386 2. Douglas V Hall., Microprocessors and Interfacing 3. Ayala ,The 8051 Micro Controller 3rd Edition, IE

Reference Books

1. Tribel Singh ,8088 /8086 Processor, PHI

2. Mazidi M.Gillipse J. The 8051 Microcontroller and Embedded Systems, Pearsoneducation,2002,ISBN-81-7808-574-7

3. Intel 8 bit Microcontroller manual. 4. Deshmukh A., "Microcontrollers - Theory and Applications", Tata McGraw-Hill, 2004,

ISBN 0-07-058595-4

24


25/38

214448 DATA STRUCTURES AND FILES Teaching Scheme Examination scheme Lectures: 3 hrs / week Theory: 100 Marks

Learning objectives

The students should be capable of applying appropriate data structures for any given application.

Unit I : (8 Hrs)File organization

C Files and command line argument, Primitive operations and implementation in C,Concept of sequential, simple Index file and direct access file , Hashing, Hashing function and itscharacteristics, Concept of collision resolution, linear probing, chaining with & withoutreplacement, rehashing, Processing of sequential, Index-sequential and direct files. Sequential file organisation, direct file organisation, index sequential file organisation and theirimplementation.

Unit II : (6 Hrs)Stack

Concept of stack as ADT, Implementation of stacks using linked and sequentialorganization. Concept of multistacks, Importance of stack in recurssion, Importance of implict andex lict stack A lication of stacks.

Unit III : (6 Hrs)Queues

Concept of queues as ADT, Implementation of linear and circular queue using linked andsequential organization. Concept of multiqueues, dequeue and priority queue. Application of

ueues.

Unit IV : (6 Hrs)Tree

Difference in linear and non-linear data structure, Trees and binary trees-concept andterminology.binary tree as an ADT. Algorithm for tree traversals (recursive and non recursive).Conversion of general tree to binary tree. Binary search trees, Concept of threaded binarytree.Threaded binary tree as an ADT. Preorder, Inorder traversals of inorder threaded binary searchtree.

Unit V : (6 Hrs)Graphs

Graph as an ADT, Representation of graphs using adjacentcy matrix, adjacentcy list, Depth First Search and Breadth First Search. Algorithms for minimal spanning tree (Prims and Kruskals and shortest ath- Di kstras al orithm A lication of these al orithms.

Unit VI : (6 Hrs)Symbol Tables and Dynamic Trees

Notion of Symbol Table, AVL Trees, OBST, Heap data strucutre its application in heapsort, Huffman's al orithm,

25


26/38

Hash Tables: Basic concepts, hash function, hashing methods, collision resolution, buckethashin .

Te t Books 1. R. Gilberg, B. Forouzan, Data Structures: A pseudo code approach with C, Cengage

Learning, ISBN 9788131503140. 2. A. Michael Berman, Data structures via C++, Oxford University Press, 2002, ISBN-0-

19-510843-4.

Reference Books

1. E. Horowitz, S. Sahni, D. Mehta Fundamentals of Data Structures in C++, Galgotia Book Source, New Delhi, 1995, ISBN 16782928.

2. Y. Langsam, M. Augenstin and A. Tannenbaum, Data Structures using C and C++, 2nd Edition, Prentice Hall of India, 2002, ISBN-81-203-1177-9.

3. R. Gilberg, B. Forouzan, Data Structures: A pseudo code approach with C++, Cengage Learning, ISBN 9788131504925.

4. A. Tharp ,File organisation and processing,2008 ,Willey India edition ,9788126518685 5. A. Drozdek, Data Structures in C++, 2nd Edition, Thomson Brookes /COLE Books, 2002,

ISBN 981 240 079 6. 6. J. Tremblay, P. Soresan, An introduction to data structures with Applications, 2nd edition,

Tata McGraw-Hill International Editions, 1984, ISBN-0-07-462471-7. 7. M. Folk, B. Zoellick, G. Riccardi, File Structure An Object oriented approach with C++,

Pearson Education, 2002, ISBN 81 7808 131 8. 8. M. Weiss, Data Structures and Algorithm Analysis in C++, 2nd edition, Pearson Education,

2002, ISBN-81-7808-670-0

26


27/38


28/38

Unit III : (6 Hrs)Transmission Media And Switching

Guided Media : Twisted-Pair , Coaxial and Fiber-Optic Cable Unguided Media : Wireless, Radio Waves, Microwaves, Infrared Circuit-switched Networks : Three Phases, Efficiency, Delay, Circuit-Switched Technology in Telephone Networks Datagram networks: Routing Table , Efficiency, Delay, Datagram Networks in the Internet Virtual-circuit networks: Addressing, Three Phases, Efficiency, Delay in Virtual-Circuit Networks,Circuit-Switched Technology in WANs Structure of a switch: Structure of Circuit Switches, Structure of Packet Switches Di ital Subscriber Line: ADSL, ADSL Lite, HDSL, SDSL, VDSL.

Unit IV : (6 Hrs)Error Control And Data Link Control

Ttypes of errors : Redundancy, detection versus correction, forward error correction versusretransmission, coding , modular arithmetic Block coding: error detection, error correction , hamming distance, minimum hamming distance Linear block codes : minimum distance for linear block codes, some linear block codes Cyclic codes : cyclic redundancy check ,hardware implementation ,polynomials, cyclic codeanalysis, advantages of cyclic codes Checksum : idea, , one's complement, internet checksum Framing : fixed-size framing, variable-size framing flow and error control: flow control, error controlprotocols Noiseless channels: simplest protocol, stop-and-wait protocol

Noisy channels: stop-and-wait automatic repeat request, go-back-n automatic repeat request ,selective repeat automatic repeat request, piggybacking HDLC: configurations and transfer modes, frames, control field

Point-to-point Protocol: Framing, Transition Phases, Multiplexing, Multilink PPP.

Unit V : (6 Hrs)Multiple Access and Ethernet

Random access : Aloha, Carrier Sense Multiple Access (CSMA), Carrier Sense MultipleAccess With Collision Detection (CSMALCD), Carrier Sense Multiple Access With CollisionAvoidance (CSMALCA) Controlled access; reservation, polling, token passing

Channelization : Frequency Division Multiple Access (FDMA), Time-Division Multiple Access (TDMA), Code Division Multiple Access (CDMA)ETHERNET :IEEE standards, data link layer, physical layerStandard Ethernet : MAC Sub-layer, Physical Layer bridged Ethernet, switched Ethernet, full-duplex Ethernet Fast Ethernet: MAC Sub-layer, Physical Layer Gigabit Ethernet : MAC sub-layer, Physical Layer, Ten-gigabit Ethernet

28


29/38

Unit VI : (6 Hrs)Devices, Backbone networks and SONET

Connecting devices: passive hubs, repeaters, active hubs, bridges, two-layer switchesrouters, three-layer switches, gateway Backbone networks: bus backbone, star backbone. Virtual LANs: membership, configuration, communication between switches, IEEE standard ,advantages SONET Architecture : signals, Sonet devices, connections. Sonet layers: path layer, line layer , section layer, photonic layer, device-layer relationships, Sonetframes : frame, byte, and bit transmission, STS-L frame format, overheads, encapsulation

Te t Books

1. Behrouz a Forouzan, Data Communications and Networking, 4th Edition 2. P. C. Gupta,Data Communications, PHI

Reference Books

1. William Stallings,Data & Computer Communications, 7th Edition: PHI Publications 2. Leon - Garcia, Indra Widijaja ,Communication Networks Fundamental Concepts and Key

Architectures 3. Achyut Godbole,Data Communication Networks,TMGH

29


30/38

214450 PROCESSOR INTERFACING LABORATORY

Teaching Scheme Examination schemePractical: 4 hrs / week Term Work: 25 Marks

Oral: 50 Marks Instructions :- The term work of students should be assessed depending on 11 assignment listed asfollows.

GROUP NO. OF ASSIGNMENT

A 3

B 2

C 2

D 4

Group A: ALP based 8086 Microprocessor

1.Write Assembly language program (ALP) to add array of N numbers stored in the memory.

OR

1.Write ALP to perform non-overlapped and overlapped block transfer.

2. Write ALP to convert 4-digit Hex number into its equivalent BCD number and 5-digit BCDnumber into its equivalent HEX number. Make your program user friendly to accept the choice fromuser for

i. HEX to BCD ii. BCD to HEX iii. EXIT.

Display proper strings to prompt the user while accepting the input and displaying the result.

3. Write ALP to perform string manipulation to calculate string length and reverse a string. Thestrings to be accepted from the user is to be stored in code segment Module_1 and write FARPROCEDURES in code segment Module_2 for following operations on the string:

Concatenation of two strings

Compare two strings

OR

Number of occurrences of a sub-string in the given string

Find number of words, characters, number of lines and number of capital letters from the given text

in the data segment

Note: Use PUBLIC and EXTERN directive. Create .OBJ files of both the modules and link them tocreate an EXE file.


31/38

Group B: Interfacing with 8086/8051

4. (a) Write 8086 ALP to convert an analog signal in the range of 0V to 5V to its

Corresponding digital signal using either successive approximation ADC or dual slope ADC.

4. (b) Write 8086 ALP to interface DAC and generate following waveforms on oscilloscope,

(i) Square wave - Variable Duty Cycle and frequency,

(ii) Ramp wave - Variable direction,

(iii) Trapezoidal wave,

(iv) Stair case wave.

4.(c) Write 8086 ALP to rotate a stepper motor for given number of steps at a given angle and in thegiven direction of rotation based on the user choice.

Any two assignments based on 8086 interfacing (4a-4c)

OR

4.Write ALP to interface 8051 with :

(a) Interfacing DAC and writing programs to generate triangular, trapezoidal and sinewaveforms.

(b) Interfacing 8/12 bit ADC to 8051 or equivalent and to write a program to find out the averagevalue for 10 readings.

(c) Interface stepper motor to 8051 and write a program to rotate motor with different step anglesand with different speeds.

Any two assignments based on 8051 interfacing (4a-4c)

Group C: File Processing / Dos Commands

5. Write following programs in C using int86, int86x, intdos, intdosx functions

To delete a file

To create a directory

Read and display disk information such as Drive, tracks, sectors etc

OR

5. Write ALP to read Boot Sector and Display contents of Boot Sector(use Inline C Code).

6. Write 8086 ALP to perform Encryption and Decryption of a text message.

Program should open, say, FILE1, read the content of FILE1 and encrypt it using suitable encryptionkey. Store encrypted text along with encryption key in, say, FILE2. Read and display the contents of encrypted file i.e. FILE2. Decrypt the data and store the decrypted data in, say, FILE3. Compare the


32/38

contents of FILE1 and FILE3 after decryption. Make your program user friendly with proper screenechoes.

OR

6. Write 8086 ALP to read command line arguments using PSP(Program Segment Prefix) andimplement DOS COPY Command . Use File Handle function for handling the files. Handle all theerrors and display appropriate message if user does not enter proper command line argument.

GroupD: Assignments based on programming 8051 microcontroller.

7. Write a program to add n, 8 bits numbers found in internal RAM location 40H onwards and storeresults in R6 and R7.

8. Write a program to multiply 16 bit number by 8 bit number and store the result and internalmemory location.

9. Write a program for block transfer for internal / external memory.

10. Timer programming :ISR based

Write ALP to generate square wave using Timer interrupt on any port pin.

OR

10. Serial port programming : ISR based

Connect two 8051 Ics using serial ports Send FFH and 00H alternatively to receiver .Output receivedbyte to port1 ,see port1 pin waveform on CRO.

Write ALP to establish communication between two 8051 in asynchronous or synchronous mode.

11. Write ALP to switch from real mode to protected mode and back to real mode. Display anappropriate message in each mode.


33/38

214451 DATA STRUCTURES AND FILES LIBORATORY

Teaching Scheme Examination scheme Practical: 4 hrs / week Termwork : 25 Marks

Practical : 50 Marks

1. Implement all primitive operations on Sequential file in C

2. Implementation of Hash table using array and handle collisions using Linear probing withre lacement and Chainin without re lacement

3. Represent single variable polynomial as a circular linked list. Accept the terms in thepolynomial in any order, i.e. not necessarily in the decreasing order of exponent. Sort whilecreating polynomial in the decreasing order of exponent and write a menu driven programto erform dis la , addition, multi lication and evaluation.

4. Implement stack as an abstract data type (ADT) using linked list. Use this ADT for a) infixto refix conversion, b infix to ostfix conversion, c evaluation of ostfix ex ression.

5. Consider a scenario for Hospital to cater services to different kinds of patients as a) Serious (top priority), b) non-serious (medium priority), c) General Checkup (Least

priority). Implement the priority queue to cater services to the patients.

6. Accept a postfix expression and construct an expression tree and perform recursive andnon recursive traversals.

7. Create a binary search tree of mnemonics from assembly language(e.g. add, mult, div, subetc.) and perform following operations:

a) Insert, b) delete, c) depth of the tree, d) search a node, e) Find its mirror image f)Print ori inal mirror ima e level wise.

8. Represent a given graph using adjacency list and perform DFS and BFS Use the map of thearea around the college as the graph. Identify the prominent land marks as nodes and

erform DFS and BFS on that

9. Represent a given graph using adjacency matrix and find the shortest path using Dijkstras algorithm. Use the map of the area around the college as the graph. Identify theprominent land marks as nodes and find minimum distance to various land marks from thecollege as the source.

10. Implement Huffmans algorithm.

32


34/38


35/38

210253: OBJECT ORIENTED PROGRAMMING AND COMPUTER GRAPHICSLABORATORY

Teaching Scheme Examination schemeLectures : 1 hr / Week Practical : 50 MarksPractical : 4 hrs / week Term Work : 50 Marks

Unit I : (3 Hrs)Introduction to Object Oriented Programming

Introduction to procedural, modular, object-oriented and generic programming techniques,Limitations of procedural programming, Need of object-oriented programming, fundamentals of object-oriented programming: objects, classes, data members, methods, messages, dataenca sulation, data abstraction and information hidin , inheritance, ol mor hism.

Unit II : (2 Hrs)Programming with C++

++: Extensions to C: Variable declarations, global scope, const, reference variables,comments, default parameters, function prototypes, function overloading, inline functions, defaultand constant arguments, cin, cout, formatting and I/O manipulators, new and delete operators

Unit III : (4 Hrs)Classes and Objects:

Defining a class, data members and methods, public, private and protected members, inlinemember functions, static data members, static member functions, this pointer, constructors,destructors, friend function, dynamic memory allocation, array of objects, pointers and classes, classas ADTs and code reuse

Unit IV : (3 Hrs)Operator Overloading:

Introduction, Need of operator overloading, overloading the assignment, binary and unaryo erators, overloadin usin friends, rules for o erator overloadin , t e conversions

Unit V : (4 Hrs)Inheritance and Polymorphism

Concept and need, single inheritance, base and derived classes, friend classes, types oinheritance, hybrid inheritance, member access control, static class, multiple inheritance,ambiguity, virtual base class, polymorphism, virtual functions, pure virtual functions, abstract base

class, virtual destructors, earl and late bindin , container classes

Unit VI : (5 Hrs)Templates:

Introduction, Templates: Function template and class template, function overloading vs.function templates, member function templates and template arguments, Introduction to GenericProgramming: Introduction to Standard Template Library (STL), containers, iterators andalgorithms, study of container template classes for vectors and stacks and related algorithmsNameSpaces: Introduction, Rules of namespaces

34


36/38

Unit VII : (2 Hrs)Exception Handling:

Introduction, syntax for exception handling code: try-catch-throw, Multiple Exceptions,Exceptions with arguments, Introduction to RTTI Managing Console I/O Operations: Introduction, C++ streams, stream classes, unformatted I/O,formatted I/O and I/O mani ulators

Unit VIII : (2 Hrs)Files and Streams Concept of a file, file operations, streams, opening and closing a file, detecting end-of-file, filemodes, file ointer, structures and files, classes and files, se uential file rocessin , Error handlin

Text Books: 1. E. Balaguruswamy, Object Oriented Programming with C++, Tata McGraw-Hill

PublishingCompany Ltd, New Delhi ISBN 0 07 462038 X. 2. Saurav Sahay, Object Oriented Programming with C++, Oxford.

Reference Books: 1. R. Lafore, The Waite Groups Object oriented Programming in C++, 3rd Edition,

Galgotia Publications, 2001, ISBN 81-7515-269-9. 2. B. Stroustrup, C++ Programming Language, 3rd Edition, Pearson Education, 1997,

ISBN 0 201 32755 4. 3. Joyce Farrell, Object Oriented Programming with C++, Cengage learning, India Edition. 4. Rajesh Shukla Object Oriented Programming in C++, Wiley India Edu.

GROUP A: Constructor, Destructor:

Suggested list of Assignments

1. Create a class named weather report that holds a daily weather report with datamembers day_of_month,hightemp,lowtemp,amount_rain and amount_snow. Theconstructor initializes the fields with default values: 99 for day_of_month, 999 forhightemp,-999 for low emp and 0 for amount_rain and amount_snow. Include afunction that prompts the user and sets values for each field so that you can override thedefault values. Write a program that creates a monthly report.

Static member functions,friend class,this pointer,inline code and dynamic memoryallocation : 2. Develop an object oriented program in C++ to create a database of the personnel

information system containing the following information: Name,Date of Birth,Bloodgroup,Height,Weight,Insurance Policy number,Contact address,telephonenumber,driving licence no. etc Construct the database with suitable member functionsfor initializing and destroying the data viz constructor,default constructor,copyconstructor,destructor,static member functions,friend class,this pointer,inline code anddynamic memory allocation operators-new and delete.

Operator overloading : 3. Design a Class Complex with data members for real and imaginary part. Provide

default and parameterized constructors.Write a program to perform arithmeticoperations of two complex numbers using operator overloading (using either memberfunctions or friend functions .

35


37/38

4. Write a C++ program to perform String operationsi. = Equality

ii. == String Copyiii. + Concatenation iv. > To reverse a string

vi. Function to determine whether a string is a palindrome To find occurrence of a sub-string. Use Operator Overloading

Inheritance : 5. Design a base class with name,date of birth,blood group and another base class

consisting of the data members such as height and weight.Design one more base classconsisting of the insurance policy number and contact address.The derived classcontains the data members telephone numbers and driving licence number. Write a menu driven program to carry out the following things: i) Build a master table ii) Display iii) Insert a new entryiv) Delete entry v) Edit vi) Search for a record

Templates : 6. Write a program in C++ using function template to read two matrices of different data

types such as integers and floating point values and perform simple arithmeticoperations on these matrices separately and display it.

Virtual functions & files : 7. Design a base class consisting of the data members such as name of the student,roll

number and subject.The derived class consists of the data members subject code,internal assessment and university examination marks.Construct a virtual base class forthe item name of the student and roll number.The program should have the facilities. i) Build a master table ii) List a table iii) Insert a new entryiv) Delete old entry v) Edit an entry vi) Search for a record

Exception Handling : 8. Create a class named Television that has data members to hold the model number andthe screen size in inches,and the price.Member functions include overloaded insertionand extraction operators.If more than four digits are entered for the model,if the screensize is smaller than 12 or greater than 70 inches, or if the price is negative or over $5000 then throw an integer.Write a main() function that instantiates a televisionobject,allows user to enter data and displays the data members .If an exception is

GROUP B: 1. Assignments to understand functions available in graphics library such as,

(a) Text and Graphics mode, initialization of graphics mode, graphics drivers, switchingbetween text and graphics mode, error handling.

(b) Color, Color Palette, Aspect ratio, Text: fonts, alignment, size, orientation and justification.

(c) Graphics Primitives: Pixel, Line, Circle, Ellipse, Polygons, Line styles, Bar graphs, Pie Charts, Histograms, filling a polygon, windowing.

(d) Writing a Graphics Editor 2. Write a program to implement algorithm for line and circle drawing. 3. Write a program to implement algorithm for filling a polygon using scan-fill method. 4. Write a program to implement 2-D transformations. 5. Case study of any graphics tool.

36


38/38

Instructor will frame assignments based on the suggested assignments as given above.Instructors are expected to incorporate variations in above list.

Students will submit Term Work in the form of a journal that will include at least 13 assignments. Each programming assignment will consists of pseudo-algorithm, program listingwith proper documentation and printout of the output.

Practical Examination will be based on the term work and questions will be asked to judgeunderstandin of the assi nments at the time of the examination

se it syllabus

Documents