This action might not be possible to undo. Are you sure you want to continue?
210241 214442 210243 214441 207005 214443 214444 214445
Structure of S.E. (Information Technology) 2008 Course Proposed in year 2009 - 10 Part – I Teaching Scheme Examination Scheme Subject Hours / Week Lect. Pract. Paper T/W Pract. Oral Discrete Structures Computer Organization Digital Electronics and Logic Design Fundamental of Data structures Humanities and Social Sciences Digital Laboratory Programming Laboratory Communication and Language Lab. Total Total of Part I (A) 4 3 4 4 3 -------119 29 Hrs Part– II ---------------4 4 2 10 100 100 100 100 100 -------500 ----------50 50 50 150 ----------50 50 ---100 750 --------------------
Total Marks Total 100 100 100 100 100 100 100 50 750
Subject Code No. 207003 214446 214447 214448 214449 214450 214451 214452
Teaching Scheme Hours / Week Lect. Pract. ----------4 4 4 12 29 Hrs 4 3 3 3 3 ----1 17 100 100 100 100 100 ------500
Examination Scheme Paper T/W ----------25 25 50 100 Pract. ------------50 50 100 750 1500 Oral ----------50 ----50
Total Marks Total 100 100 100 100 100 75 75 100 750
Engineering Mathematics – III Computer Graphics Processor Architecture & Interfacing Data Structures and Files Data Communication Processor Interfacing Laboratory Data Structures and Files Laboratory Object Oriented Programming and Computer Graphics Laboratory Total Total of Part II (B) Grand Total (A) + (B)
Semester - I Information Technology 2008 Course
210241: DISCRETE STRUCTURES Teaching Scheme Lectures: 4 Hrs/week Examination Scheme Theory: 100 Marks
Discrete mathematics- the mathematics of integers and of collections of object – underlies the operation of digital computer, and is used widely in all fields of computer science for reasoning about data structures algorithms and complexity. The primary objective of subject is to prepare students mathematically for the study of computer engineering. Topics covered in the course include proof techniques, logic and sets, functions, relations, counting techniques, probability and recurrences. By the end of the course, students should be able to formulate problems precisely, solve the problems, apply formal proof techniques, and explain their reasoning clearly.
Prerequisite: Basic Mathematics
Learning objectives: … the student will be able to
• • • •
Use appropriate set, function, or relation models to analyze practical examples, interpret the associated 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 explain their reasoning clearly.
Unit I : Sets and Propositions
Sets, Combination of sets, Finite and Infinite sets, Un-countably infinite sets, Principle of inclusion and exclusion, multisets. Propositions, Conditional Propositions, Logical Connectivity, Propositional calculus, Universal and Existential Quantifiers, Normal forms, methods of proofs, Mathematical Induction
Unit II : (8 Hrs) Groups and Rings Algebraic Systems, Groups, Semi Groups, Monoid, Subgroups, Permutation Groups, Codes and Group 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, Warshall’s 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
Busby and S. Bayes’ Theorem. 2001 ISBN 81 – 7808 – 279 .Unit IV : (8 Hrs) Graphs Basic terminology. path length in rooted trees. ISBN 978-0-07-288008-3 3. 5th Edition. “ Discrete Mathematics”. Unit V : (8 Hrs) Trees Trees.8 2. E. B. minimal spanning trees. 6th edition. Hamiltonian and Euler paths and circuits. rooted trees. multi graphs and weighted graphs. binary search trees. “Discrete Mathematics”. Pearson Education. Pearson Education. prefix codes. 2002. R. N. Deo. Conditional Probability. TataMcGraw-Hill. 2003 ISBN 81 – 7808 – 827 – 4 4. “Discrete Mathematics with Graph Theory”. Pearson Education. shortest path in weighted graph. Combinations. Kruskal’s and Prim’s algorithms for minimal spanning tree. L. Kolman. Goodaire and M. 3rd Special Indian Edition. 2007. Rosen. 2008. ISBN-13 : 978-0-07-060174-1 5. Biggs. spanning trees and cut set. “Discrete Mathematics”. “Graph Theory with application to Engineering and Computer Science”. Combinations and Discrete Probability Permutations and Combinations: rule of sum and product. Algorithms for generation of Permutations and Combinations. Discrete Probability. factors of a graph. The Max flow –Min cut theorem (transport network). ISBN 10:0-07-066913-9 (Recommended for Unit I and Unit II) 2. “Discrete Mathematical Structures”. “Discrete Mathematics and its Applications”. paths and circuits. C. McGraw-Hill. planer graph and Travelling salesman problem. ISBN 81-7808-556-9 N. Ross. Prentice Hall of India. SiE Edition. Permutations.9 Reference Books: 1. Johnsonbaugh. P. R. 3rd Edition. Kenneth H. 0 – 87692 – 145 – 4 4 . Oxford University Press. 1990. 2nd edition. 4th Edition. Unit VI : (8 Hrs) Permutations. Information and Mutual Information Text Books: 1. ISBN 0 –19 – 850717 . McGraw-Hill. Mohapatra. Semyour Lipschutz & Marc Lipson. Liu and D. Parmenter. “Elements of Discrete Mathematics”.
Programmers model of 8086. Instruction cycles. 8086 assembly instruction examples to explain addressing modes Unit III : (6 Hrs) The Control Unit Single Bus Organization. Video Displays. Fixed and Floating point numbers. Optical memory. EPROM. Von Neumann Architecture. Micro operations and Register Transfer.8086 Interrupt structure. types of operands. Unit I : (8 Hrs) Computer Evolution & Arithmetic A Brief History of computers. CDROM. Microinstructions and micro. Hardware Implementation. Desk-jet and Laser Printers. Scalar Data Types. Restoring and Non Restoring algorithms. Floating point arithmetic Unit II : (8 Hrs) The Central Processing Unit Machine Instruction characteristics. Asynchronous. EEPROM. Read Write cycles. RDRAM High-Speed Memories: Cache Memory. DAT. Interconnection Structures. Programmed I/O. DVD Unit V : (6 Hrs) I/O Organization Input/Output Systems. Micro-programmed Control: Basic concepts. Booths Algorithm. Designing for Performance. Floating point representations. Register Organization. Address Translation Virtual to Physical. Bus Interconnection. Cache Coherence. MESI protocol. IEEE standards. Processor organization. Direct Memory Access (DMA). Division. To understand the structure. Parallel I/O 8255 features.Multiplier CU. Hardware architecture. Control Unit Operations: Instruction sequencing. Instruction formats. Signed numbers.214442 – COMPUTER ORGANIZATION Teaching Scheme Lectures: 3 hrs / week Learning Objectives 1. RAM: SRAM. types of operations. PCI. To learn basics of Parallel Computer Architecture. To understand the design of the various functional units of digital computers 3. Design Examples . Replacement Algorithms. Secondary Storage: Magnetic Disk. Mouse. 2’s Complement method for multiplication. USB Ports Working mechanisms of Peripherals: Keyboard. Types of memories: ROM: PROM. Interrupt Driven I/O. Touch Screen panel.program sequencing Unit IV : (6 Hrs) Memory Organization Characteristics of memory systems. Instruction types. Tape. RAID.(features and principles) 5 Examination scheme Theory: 100 Marks .8237 features Buses and standard Interfaces: Synchronous. Serial I/O 8251 features. Virtual Memory: Main Memory allocation. Internal and External Memory. Computer Components. Integer Arithmetic. Scanners. SDRAM. Organization and Mapping Techniques. Segmentation. Paging. function and characteristics of computer systems 2. Dot Matrix. SCSI. Addressing modes. max/min mode. DRAM. Intel 8086 as example. Hardwired Control: Design methods – State table and classical method.
Morgan Kauffman. C. Hennesy. A. “Computer Organization and Architecture: Principles of Structure and Function”.8. RISC architecture and pipelining. S. V. Vector Computations. George. 2nd Edition. UMA NUMA. “Computer Architecture and Organization”. RISC Vs CISC Text Books 1. Tanenbaum. 1988 ISBN 0 – 07 – 100479 – 3 2. McGraw-Hill. Prentice Hall of India. W. Zaky. G. Stallings. 4th Ed. “Structured Computer Organization”. 4. J. Hamacher. ISBN 81 – 203 – 2962 – 7 2. 2nd Ed.4. 1986 (Chapter: 3. Multiple Processor Organizations. 1991 ISBN 81 – 203 – 1553 – 7 (Chapter: 1.9.11. Maxwell Macmillan Editions. “Computer Organization and Design: The Hardware Software Interface”.14).7. Zvonko. “Computer Organization: Hardware and Software”. 2002. J..3.8). 2003. 3. 2nd Edition. 5th edition ISBN 007-120411-3 Reference Books 1. Clusters.5). Paterson. 2nd Edition. Prentice Hall of India. “Computer Organization”. RISC: Instruction execution characteristics.13. 67h Edition.10. “Computer Organization and Architecture: Designing for performance”. Prentice Hall of India.5.Unit VI : (8 Hrs) Parallel Organization Instruction level pipelining and Superscalar Processors. D. 1990 ISBN 0 – 02 – 946297 – 5 (Chapter: 2.5. Symmetric Multiprocessors. W.188.8.131.52. McGraw Hill. Stallings William. 2000 ISB 6 . Closely and Loosely coupled multiprocessors systems. Hays.
Decoder. Minimization of SOP and POS forms.Adder. NOR.Active pull-up. look ahead and carry. totem pole. Gray code . Demultiplexers 74151). Signed Binary number representation. operating temperature etc. magnitude comparator using 7485. 2. CMOS characteristics. CMOS: CMOS Inverter. fan-out.Speed. Reduction techniques: K-Maps (only up to 4 variables) & Quine – McClusky technique Arithmetic Operations: . BCD adder using and subtract using 7483. power dissipation. Half Subtract or. Logic function : NOT. Examination scheme Theory : 100 Marks 7 . Hexadecimal Arithmetic. Truth tables and Boolean algebra. Simplification of logical functions. current and voltage parameters. XOR. Don’t care conditions.Implementation of expression using DEMUX. Full Adder. open collector. Interfacing: TTL to CMOS and CMOS to TTL Unit III : (8 Hrs) Combinational Logic Logic minimization Representation of truth-table. POS form. 1’s complement and 2’s complement representation. Signed Magnitude. fan-in.Wired Logic. XNOR. Hexadecimal numbers. Full Sub tractor.Half. Algebra for logic circuits : Logic variables. Unit I : (8 Hrs) Number System& Logic Design Minimization Techniques Introduction. Octal numbers and number conversion. CMOS configurations. Excess-3. Operation of TTL NAND gate.210243 – DIGITAL ELECTRONICS AND LOGIC DESIGN Teaching Scheme Lectures: 4 hrs / week Prerequisites : Basic Electronics Engineering Learning Objectives 1. Binary. 3. DeMorgan's rules Axiomatic definition of Boolean algebra. BCD Addition Circuits: . To learn and understand design and construction of combinational and sequential circuits. Basic theorems and properties of Boolean algebra Unit II : (6 Hrs) Logic Families TTL: Standard TTL characteristics. Implementation of expression using MUX (ICD74153. SOP form. Subtraction. To learn and understand basic digital design techniques. Open drain outputs. noise margin. TTL Configurations. To introduce basic components of microprocessors. Wired AND. parity generator and checker using 74180.Binary Addition. AND. NAND Codes : BCD. Binary Code and their conversion Boolean algebra. Idealized logic gates and symbols. 2’s complement arithmetic. Demultiplexers (DEMUX):. OR. (IC 74138). Multiplexers (MUX) : Working of MUX. Binary.
Study of7473. Pseudo Random Binary Sequence Generator. 74191). Registers : Buffer register. Stephen Brown. Johnson Counter. D. Bounce Elimination Switch. Modulus n counter(IC 7490. Design Example. Types of Counter Programmable Logic Devices PLD: PLA. Entity.7476 Application of Flip-flops. Invert/ Non-Invert Matrix. Preset & Clear. Architecture.Any 4 Variables SOP function using PLDs Study of basic architecture of FPGA CPLD Unit VI : (6 Hrs) VHDL and Introduction to Microprocessors Introduction to HDL. notations. registers. Modeling Styles. Robert Donavan “Digital Electronics” 5th edition CENEGAGE Learning ISBN 2. design of simple controller. Pearson Education Malvino.Leach “ Digital Principles and Applications”. Address Bus. Control Bus. “Modern Digital Electronics”. Tata McGraw-Hill. R. VHDL. Unit V : (8 Hrs) ASM & Programmable Logic Devices Algorithmic State Machines. Introduction of Ideal Microprocessor. Conversion from one type to another type of Flip Flop. multiplexer controller method Examples. James Bignell. Tat Mc-Graw Hill J. Sequence generator and detector. 4. OR. D. “Digital Logic applications and Design” Thomson Flyod “Digital Principles”. BCD Counter. AND. ISBN 0 – 07 – 049492 – 4 3.Unit IV : (8 Hrs) Sequential Logic Introduction: Sequential Circuits. MUX. 8085 Programmers model as an example. 3rd Edition. 2003. Attributes Design Examples.ASM charts. shift register. John Yarbrough. Data Objects & Data Types. JK. TB 2.flop : SR. Synchronous counter. T. Text Books 1. TB 1. counters. 2. ring counters. VHDL for Sequential Circuits-Synchronous and Asynchronous Counter.Bhaskar “VHDL Primer” 3rd Edition. Zvonko Vranesic “ Fundamentals of Digital Logic with VHDL Design” Mcgraw-Hill Reference Books 1.7474. Difference between combinational circuits and sequential circuits Flip. . Master and Slave Flip Flops their truth tables and excitation tables. 5th edition. Sequence Generator. Pearson Edition 8 .7495 Counters : Asynchronous counter.Input. Jain.Shift Register Introduction to Microprocessor. Data Bus. VHDL for Combinational Circuits-Adder. Concurrent and Sequential Statements. Output Buffers. 3.Library.
Unit IV : (8 Hrs) Searching and sorting techniques Need of searching and sorting. They will learn linear data structures. linear and Non-linear. Time complexity of each searching and sorting algorithm 9 . bitwise operations Unit II : (8 Hrs) Arreys & Pointers in C Functions: Parameter passing call by value and call by reference. static and dynamic . scope rules. Unit I : (8 Hrs) Introduction to C Constants. Best. Data structure. Unit III : (8 Hrs) Introduction to Data structures & Analysis of Algorithams Introduction to Data Structures: Concept of data. function returning pointer and pointer to function. merge. Concept of Primitive and non primitive. They will be able to able use pointers for data manipulation. Analysis of algorithm: frequency count and its importance in analysis of an algorithm. String manipulations using arrays. insertion. File handling using C.pointer to pointer. selection. Data object.structure and pointer. operators and control structure in c(decision. Worst and Average case analysis of an algorithm. Time complexity & Space complexity of an algorithm. Structure and Union: Passing and returning structure as parameter for function . why various methods of searching and sorting. union. functions.persistent and ephemeral data structures.214441 – FUNDAMENTAL OF DATA STRUCTURE Teaching Scheme Lectures: 4 hrs / week Examination scheme Theory: 100 Marks Prerequisite : Fundamental knowledge of ‘C’ from ‘Fundamentals of Programming Language. variables and keywords in C. loop and case). Big ‘O’. Learning Objectives The students shall learn the C language and pointers in depth. arrays and string manipulation. Sorting methods : Bubble. structure. Abstract Data Types (ADT). quick. realization of ADT in ‘C’. macros. enumeration. Recursion: Definition. writing recursive functions & how recursion works. Sorting methods:Linear and binary search. ‘Ω’ and ‘θ’ notations. bucket. functions and pointers.
E.ISBN 10:8173716056 3. Concept of ordered list. The C Programming Language. circular linked list.2008 . S. S. ISBN 9788131503140. 2. “Data Structures: A pseudo code approach with C”. B. Universities Press . doubly linked list. Prentice Hall "An introduction to data structures with applications". concept Generalized Linked List. Concept of Linear data structures. simple and fast transpose Unit VI : (6 Hrs) Linear data structures using linked organization Concept of linked organization.. Cenage Learning. Representation and manipulations of polynomials using linked lists. Text Books R.BPB Publication References Books 1.Unit IV : (8 Hrs) Linear data structures using sequential organization Concept of sequential organization. Storage representations of ordered list such as row major . multiplication. column major and their address calculation. Yashwant Kanitkar. Horowitz . application of array in polynomial representation and .Anderson-Freed ““Fundamentals of Data Structures in C”. 10 .algorithm for sparse matrix addition. comparison of sequential linked organization with linked organization. Let us C & Pointer in C.Sahani. Forouzan. Representation of sparse matrix using arrays. R. Linked list as ADT. 1. Second Edition 2. singly linked list. Gilberg. Tremblay and Sorenson Tata McGrawHill. Kernighan and Ritchie.
etc). Contemporary national and international affairs. International Treaties.Panchayatraj Institutions. natural recourses population size and composition. Global Environmental Issues : Population Growth. Indian Social Demography– Social and Cultural. components. Energy Sources : Renewable and Non Renewable. Industrial revolution. Employment Rural and Urban. Working. National policy on education. Biomass. Categories. Indian Economics – basic features. Unit II : (6 Hrs) Social Development Scientific approach to the study of human beings. Geothermal and Tidal . Evolution of human kind. infrastructure. Green revolutions. 4. Unit III : (6 Hrs) Sectoral Development Agriculture : Technology changes. micro economics of India. Hydro power. 11 . Population and development. Human and social development. Industrial Development : Strategies. Global Warming. health and health care and human development. inflation. Loss of Biodiversity. Government Schemes. Public and Private Sectors. family and kinshipSecularization –Social Movements and Regionalism. class. Soil Degradation. national income concepts.207005 – HUMANITIES AND SOCIAL SCIENCES Teaching Scheme Lectures: 3 hrs / week Learning Objectives This course will lead to the learning of 1. Unit IV : (6 Hrs) Environment and Ecology Ecosystems : Structure. Consumer Awareness. 2. transport and communication. Emergence of Indian society and Economics. Unit V : (6 Hrs) Economic Development Need for planned economic development – Law of demand and supply. 3. five years plan. Control Strategies. WTO. priorities and problems. Pollution : Water and Air Pollution. social change and evolution. gender and tribe. Institutions of marriage. Differentiations: caste. Planning objective. Examination scheme Theory: 100 Marks Unit II : (6 Hrs) Indian Society Structure of Indian Society. Affirmative Action Programme of the Government-various reservations and commissions. Sectoral development and Economic development and related issues (such as international economics. RBI. Ocean.
12 . 1991. Environmental Issues in India. Budget Analysis. 4. cultural. The Individual & Society. Popular.Unit VI : (6 Hrs) Banking and Trades Financial Analysis. Role of Reserve bank of India International Economy. C. Methodologies 1.org / wiki /social studies. Pearson Education. Srinivas. Prakash.S. 6. Suitable case studies should be discussed 2. WTO. Wikipedia. involved in social changes. Pearson Education. 9. Ltd. 7. Krugman. Social Networking activity. Finance Commissions. Outcome Making engineering and technology students aware of the various issues concerning man and society. International aid for economic growth. The Indian Economy. 3. N. Pearson Education. David Mandelbaum. financial Institutions. 8. Thursen Gerald. 1990. International Economics. Engineering Economics. Prentice Hall. economic and human issues. 5. Orient Longman. 2. Ratios. Social change in modern India. New Age International Pvt. University of Delhi. Indian Banking. Rangarajan. Student group discussion activity. Society in India. Reference Books 1. Environmental Pollution Control Engineering. These issues will help to sensitize students to be broader towards the social. 3. Pearson Education. Rao. M. Cost Analysis.
Study of FPGA devices (Study and Write up only). ASM. Binary to gray and vice versa ii. Design (State diagram. 6. C. Design ( truth table. K map ) and implement 4 bit Up. K map ) and implement Parity generator / detector using EX-OR gates and IC 74180. VHDL Programming Simulation of 1. Bush table & Bush diagram) and implement Sequence Generator (with & without bushing) using master slave JK flip-flop IC 7476. Down. state table. i. Design and implement Modulo ‘n’ counter with IC 7490 and IC 74191. 3. Down. Design (State diagram. K map) and implement Sequence Detector using master slave JK flip-flop IC 7476. 4. • Practical examination will be based on the term work and questions will be asked to judge the understanding of assignments performed at the time of examination Note : Concern staff member should take care that the Students verify the functionality of the ICs being used. 3 bit bidirectional shift register. TTL Characteristics (study and write-up only) 2. Design ( truth table. 5. Controlled Up/Down Synchronous counter using master slave JK flip-flop IC 7476. Students will submit the term work in the form of journal consisting of minimum of 16 assignments of which assignment of Group C and 2 assignments from Group D are compulsory . K map. Design (State diagram) and implement 4 bit Up. Controlled Up/Down Ripple counter using master slave JK flip-flop IC 7476. 4:1 multiplexer using data flow modeling. D flip-flop using Master Slave J-K flip-flop IC 7476. Design & Implement of SR . state table. 2. Examination scheme Practical: 50 Marks Term Work: 50 Marks • Instructor will frame assignments based on the suggested assignments as given above. State table. Realization of Boolean expression using multiplexer IC 74151/74153. B. 5. Full adder with Half adder using structural modeling. Implementation of combinational logic using PLAs 3. Design ( truth table.JK flip-flop using discrete gates and T. 4. D. Simple ASM using multiplexer controller method. Sequential circuit design 1. K map ) and implement 4 bit BCD Adder / Subtractor using IC 7483. Design (State diagram.214443 – DIGITAL LABORATORY Teaching Scheme Practical: 4 hrs / week A. 13 . 3. K map ) and implement 4 bit Code converter. PALS and FPGA 1. 2. 2. Combinational logic design 1. BCD to Excess-3 and vice versa 3. 4. D Flip-Flop using behavioral modeling.
Create a singly linked list with options: a.\ 6. Best case). RollNo. 234. Implement set operations using arrays and perform union.g. in the middle). multiplication without pointers to arrays. palindrome. Implement Sparse matrix and perform following operations on it: Addition. c. Display Reverse. 2. a. substring. e. 14 . 8. a. c) Display forward. b. b. Implement Quick Sort recursively of the following set of numbers such as 56.90.g. Name. compare. 7. saddle point without pointers to arrays 3. copy. 12. List of experiments: 1. d.). Revert the SLL 10. Implement following Matrix operations: a.214444 – PROGRAMMING LABORATORY Teaching Scheme Practical: 4 hrs / week Examination scheme Practical: 50 Marks Term work: 50 Marks This laboratory includes the assignments based on Fundamentals of Data Structures using features of C Language. Best case). at end. d. BillAmount etc. 0. reverse. addition with pointers to arrays. symmetric difference. Percentage etc. transpose with pointers to arrays. 4. Structure manipulation (for any database like Employee or Bank database) with and without pointers to structures. Display the data in descending order of Percentage (Bubble Sort) b. difference. Display the data in ascending order of Name (Selection Sort) c. MobileNo. Accept Mobile user information (e. 654. Average. 5. e. in the middle). Display data for RollNo specified by user (Linear Search) c. d. Display the data in descending order of MobileNo. Display details for Mobileno specified by user (Binary Search) d. insert (at front. (insertion Sort) b. 9. Accept student information (e. intersection. Display the number of passes and comparisons for different test cases (Worst. c. c. as a data one character from the string and perform: a) Insert b) delete. d) Display backward. delete (at front. Average. Name. Simple Transpose and Fast Transpose. Display the number of passes and comparisons for different test cases (Worst. Display. 432. b. . at end. 80. 78. Perform following String operations with and without pointers to arrays (without using the library functions) : a. -11.). Accept input as a string and construct a Doubly Linked List for the input string with each node contains.
2. Questions will be asked during the examination to judge the understanding of the practical performed at the time of examination.Reference: Code complete: STEVE McCONNEL Note : While performing the assignments following care should be taken 1. coding styles. 3. 4. Candidate is expected to know the theory involved in the experiment. Practical examination will be based on the term work. naming conventions should be followed. Faculty should prepare a lab manual including standard test cases & should be available for reference to students. 15 . Student should submit term work in the form of a journal based on the above assignments. 5. Avoid using global variables as far as possible Use of functions is necessary All Assignments to be implemented using C and Time and Space Complexity is to be verified with theoretical findings. Proper indenting. commenting.
It will also focus on remedial teaching. The course will enable students to speak and write simple English in a range of everyday situations as well as communicate effectively in business environment. Phonetics etc. Teaching methodology in a Language Lab • Teaching with one to one and one to many control with the teacher. speaking. Students learn listening.214445 COMMUNICATIONS AND LANGUAGE LABORATORY Teaching Scheme Lectures: 1hr/week. reading and writing skills with exposure to Business English. The course aims at enabling students to revise. 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 . Practical: 2 hrs / week Examination scheme Term work: 50 Marks Learning Objectives • • • • • • • • Provide a sound grammatical and functional framework and systematic practice of key language 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 aspects of business communication Overview This course is designed for students with a limited knowledge of English who now want to communicate simply and confidently in a range of job-related situations. This facility may be utilised for teaching topics like Grammar. Writing Skills. Vocabulary. consolidate and extend their command of English grammar and vocabulary. It maximizes study time by focusing on essential language and skills and developing effective learning strategies. • 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. It will allow systematic coverage of Grammar & Vocabulary through natural recycling of language.
Development of Power Point presentation on any technical or non technical topic with animation. Interview Skills. video etc 10 Effective Stress Management Sources of stress. Group discussion for any 4 technical/non technical topics. Extempore. Pronunciation practice. Practice in language laboratory. Communication barriers. Comprehension with various purposes such as finding precise information. business expressions. Telephone etiquettes. Minutes of meeting.Managing emotional and physical stress 17 .Physical arrangements 8.PPT 7. auxiliary verbs and various ways in which each can be used. Sound . word stress. British and American English 2: (6 Hrs) Phonetics Consonants. understanding the gist 5: (4 Hrs) Writing Skills Business Correspondence: Business Letters.Procedure.(4 !Vocabulary 1. E-mail Etiquettes. elementary intonation. Recognizing stress . 3: (6 Hrs) Grammer Functional Grammer. Technical Writing: Introduction to Technical Writing (Manuals. formation of correct sentences in various situations.participation.minutes of meetind . Expressing agreement or disagreement politely. telephone language. Organization. business idioms. common mistakes and how to avoid them. Covering Letters. 9. delivery and assessment of activities like: Public Speaking. abbreviations. vowels. Planning. Presentation Skills. brochures etc. Body Language.Chairmanship. preparation. interpretation of the information. MEETING Purpose. types of aids and use. word & phrases useful in a professional context.) Technical Reports 6: (4 Hrs) Communication Skills Formality and politeness. Group Discussion.Purpose.Vocabulary building: expressions used in day to day situations. Resume. polite requests. General phonetics exercises in language laboratory. register. Reported speech and its use in spoken communication 4: (4 Hrs) Reading & Listening Skills Reading Comprehension.Audio Visual aids Basic Principles and guidelines. the tense: structure and use. Listening Comprehension and Discussions based on Listening sessions in groups of 10. Group Discussion Group Dynamics .
J.Krishna Mohan and Banerji Meera: Developing Communication Skills Macmillan India 2.It is in the best interest o Institute that students develop the skills and senior Faculty Guest faculty be involved Reference Books 1.Term work Term work shall consist shall consist of Journal/Reports/Presentations assigned by teacher and home assignements. On topics 1 to 4 must be in a language lab. Pearson Education 18 . Group discussions oral presentation must be in batches. :Communication Skills for Technical Communiaction.Rutherford A. A minimum of 10 assignments must be completed covering all topics.
Semester .II Information Technology 2008 Course 19 .
Wylie C. Raman (Tata McGraw-Hill). Advanced Engineering Mathematics. 20 . 2. Cauchy’s & Legendre’s DE. Inc. Vector Differential Operator. (09 Hours) Unit V: Vector Differential Calculus Physical Interpretation of Vector Differentiation. Method of Variation of Parameters. Text Books: 1. Solution of Simple Difference Equations. & Barrett L. Pune). Greenberg (Pearson Education). ZT of Standard Sequences and their Inverses. Gauss’s Divergence Theorem. Introductory Z-Transform (ZT): Definition. Fourier Integral Theorem. D. N. Probability Distributions: Binomial. 4. Moments.III Teaching Scheme Examination scheme Lectures: 4 hrs / week Theory: 100 Marks SECTION I Unit I: Linear Differential Equations (LDE) (09 Hours) Solution of nth order LDE with Constant Coefficients. Application to Wave Equation. Divergence and Curl.) Higher Engineering Mathematics by B. Applied Mathematics (Volumes I and II) by P. Normal and Hypergometric. Advanced Engineering Mathematics. Applications to Problems in Electro-Magnetic Fields. N. Cauchy’s Theorem. Stoke’s Theorem.R. Solution of Simultaneous & Symmetric Simultaneous DE. by Thomas L. by M. 3. S. Grewal (Khanna Publication. 2e. 2. Unit VI: Vector Integral Calculus (09 Hours) Line. Laurent’s Series. Sine & Cosine Integrals. (McGraw-Hill. Vector Identities. Test of Hypothesis: Chi-Square test. Residue Theorem Unit III: Transforms (09 Hours) Fourier Transform (FT): Complex Exponential Form of Fourier Series. Analytic Functions. Solenoidal. Directional Derivative. Gradient. Thomson Learning). Advanced Engineering Mathematics by Erwin Kreyszig (Wiley Eastern Ltd. Standard Properties. Scalar Potential. Advanced Engineering Mathematics by Peter V. Wartikar (Pune Vidyarthi Griha Prakashan. Standard Deviation. James Dabney and Norman Richert (Brooks/Cole. Advanced Engineering Mathematics with MATLAB. Delhi).C. Cauchy’s Integral Formula. Probability Density Function. Correlation and Regression. Wartikar & J. Modeling of Electrical Circuits. Poisson. C-R Equations. Work-done. O'Neil (Cengage Learning).). Green’s Lemma. Unit II: Complex Variables (09 Hours) Functions of Complex Variables. Harman. 5. Reliability of Regression Estimates Theorems and Properties of Probability. Fourier Transform. 2e. Fourier Sine and Cosine Transform and their Inverses. 6. Skewness and Kurtosis. Surface and Volume integrals.207003 – ENGINEERING MATHEMATICS . Coefficient of Variation. Engineering Mathematics by B. Conformal Mapping.V. Bilinear Transformation. Reference Books: 1. SECTION II Unit IV: Statistics and Probability (09 Hours) Measures of Central Tendency. Irrotational and Conservative Fields.
display file structure. Matrices. clipping and view-ports in relation to images displayed on screen. Understand the foundations of computer graphics: hardware systems.. 7. Dot products and distances Learning Objectives 1. mouse. display processor. The student should gain a comprehension of windows. lines. Mathematics topics such as analytical geometry. light pen etc. algorithms and display file interpreter.214446 – COMPUTER GRAPHICS Teaching Scheme Lectures: 3 hrs / week Pre-requisites 1. joysticks. Become acquainted with some advanced topics in computer graphics. Interactive devices: Tablets. The student should gain an understanding of geometric. 3. light and color. Starburst Principle. Basics of Graphics systems. linear algebra and matrices. Text and line styles. mathematical and algorithmic concepts necessary for programming computer graphics. DDA and Bresenham’s line and circle drawing algorithms*. display of frame buffer. Introduction Unit I : (6 Hrs) Basic Concepts Graphics Primitives: Introduction to computer graphics. Computer Programming and basic data structures 2. algorithms and display file interpreter. 6. Raster scan & random scan displays. display file structure. Display devices. thick lines. 3. Knowledge of vector space. Bit map method. touch panels. Data generating devices: Scanners and digitizers. Come to appreciate the complexities of modeling realistic objects through modeling complex scenes using a high-level scene description language. The student should gain an appreciation and understanding of the hardware and software utilized in constructing computer graphics applications. pixels and frame buffers. Examination scheme Theory: 100 Marks Teaching aid Faculties should use LCD to demonstrate the concept of Graphics. line segments. 5. math basis. trigonometry. The student should gain an expanded vocabulary for discussing issues relevant to computer graphics (including both the underlying mathematics and the actual programming). vectors. initialising. (* Scan conversion algorithms should be given mathematical treatment) 21 . vector generation. 2. character generation: Stroke Principle. 4. track balls. Scan conversions. primitive operations.
rotation. Specifying an arbitrary 3D View. Computer Graphics : Principles and Practice by Foley and Van Dam. Pearson Education 3. polygon meshes. plane equation. polygon tables. YIQ. Unit VI : (5 Hrs) Advanced Topics Rendering equation and Monte Carlo methods. GPU. Procedural Elements for Computer Graphics by Davis Rogers. Examples of 3D viewing . Bezier curves. Pearson Education Computer Graphics by Amarendra N Sinha. Basic transformations. Unit V : (6 Hrs) Ray Tracing Ray tracing methods. JR. 2. Key-frame systems.Polygon surfaces. quadric surfaces. Maya. ray surface intersection calculations. Hierarchy. Reference Books 1. anti-aliasing.translation. Computer Graphics by M Paulin Baker. CMY(K). Composite transformation. Computer Graphics A Programming approach by Steven Harrington. Tata McGraw Hill 22 . Spline representation. Pearson Education. Computer Animation : Animation sequences . matrix representation and homogeneous coordinate system. Unit IV : (5 Hrs) Color models & animation Colors spaces : RGB. Similar tools) ( Usage of tools in Lab ) Text Books 1. Fractals. curved lines & surfaces. Hill.S. Computer Graphics Using Open GL by F. scaling. Motion Specifications. Color Mixing. Tata McGraw Hill 2. algorithms. other transformations such as reflection. fractal lines and surfaces(With complete mathematical treatment of this unit) Interactive Graphics & usage of at least two tools of computer graphics (3D studio.Unit II : (8 Hrs) 2D & 3D Transformations 2D Geometric Transformations. HSV. Transformation. 3D transformation Polygon filling methods Unit III : (8 Hrs) 3D Viewing & 3D object representation Projections. Local Illumination and shading. Tata McGraw Hill. shadows.functions & Languages. shearing. texture mapping. Arun D Udai.
Pin Description. Protected and Virtual 8086 modes. privilege level. Address pipelined . entering and leaving V86 mode. Timing and delay loops. Unit III : (6 Hrs) Protected Mode Segmentation. DOS internal. 80386 Features and Architecture. I/O permission bit map. Interrupt structure . address generation. To provide insight to DOS and BIOS and their functions. logical to linear/physical address translation. . DOS calls. 16/32 bit transfer. TLB. loader.Support registers. .Real. related descriptors. 8255 A PPI.features. Interrupts. . Assembler. page level protection. macros.support registers. descriptors. Memory organization and I/O organization. parallel printer interface. interfacing RAM. concepts. Functional Description. instructions and registers available. memory management through segmentation. 80386 Real mode. linker. Bus operations . Multitasking . To learn the architecture and assembly language programming of 80386 Microprocessor. keyboard & display. interfacing.EXE. Exceptions and I/O Inter-privilege level transfer using Call gates and confirming code segment . Segmentation Bus Cycles Initialization and configuration.214447 – PROCESSOR ARCHITECTURE AND INTERFACING Teaching Scheme Lectures : 3 hrs / week Prerequisites : Computer Organization Learning Objectives 1. Instruction set.entering into PM mode and returning back to RM mode Unit IV : (6 Hrs) Multitasking. file I/O processing. Task switching. Assembler directives.support registers. linear to physical address translation. Far and near procedures. Virtual Mode .COM files. Comparison of all three modes 23 . protection in segmentation. 3. Privilege instructions. To study architecture and programming 8051 micro-controllers Unit I : (8 Hrs) Introduction to 80X86 Processors 16/32bit processor 80x86. virtual memory. Paging . Register Set . 2. Examination scheme Theory : 100 Marks Unit II : (8 Hrs) Assembly Language Programming Introduction to assembly language programming. Interfacing with 8086: Programmable parallel ports. related instructions descriptors.
Douglas V Hall. 2004. Tribel Singh 8088 /8086 Processor PHI 2.. Serial port and programming. Deshmukh A. PIC 16F8XX . Features of PIC 16C.Unit V : (6 Hrs) Microcontroller Microcontroller 8051 Architecture. External data memory and program memory. Pearson education. “The 8051 Microcontroller and Embedded Systems”. Design of minimum system using 8051 micro-controller for various applications. SFRs. ISBN 0-07-058595-4 24 . Other features. IE Reference Books 1. Text Books 1.” Microprocessors and Interfacing” 3. Unit VI : (6 Hrs) Microcontroller Timers and their programming. Intel 8 bit Microcontroller manual 4. Interrupts structure and Response. Turley. Ayala .Register set.2002.ISBN-81-7808-574-7 3. "Microcontrollers .Gillipse J.Theory and Applications". Tata McGraw-Hill. Register bank. “Advanced Programming of 80386 ” 2..”The 8051 Micro Controller 3rd Edition”.Texas MSP 430. On-Chip data memory and program memory organization . Mazidi M.
Importance of stack in recurssion. Algorithm for tree traversals (recursive and non recursive). Trees and binary trees-concept and terminology. direct file organisation. Unit IV : (6 Hrs) Tree Difference in linear and non-linear data structure. Implementation of linear and circular queue using linked and sequential organization. Representation of graphs using adjacentcy matrix. Concept of multistacks. Preorder. Concept of threaded binary tree.214448 – DATA STRUCTURES AND FILES Teaching Scheme Lectures: 3 hrs / week Learning objectives The students should be capable of applying appropriate data structures for any given application. AVL Trees.Dijkstra’s algorithm Application of these algorithms Unit VI : (6 Hrs) Symbol Tables and Dynamic Trees Notion of Symbol Table. Conversion of general tree to binary tree. index sequential file organisation and their implementation. Sequential file organisation. Hashing. Binary search trees. Index-sequential and direct files. Heap data strucutre its application in heap sort. dequeue and priority queue. Examination scheme Theory: 100 Marks 25 . adjacentcy list. Inorder traversals of inorder threaded binary search tree Unit V : (6 Hrs) Graphs Graph as an ADT. Concept of multiqueues. Algorithms for minimal spanning tree (Prim’s and Kruskal’s )and shortest path. Application of queues. Processing of sequential. Importance of implict and explict stack Application of stacks. linear probing. Huffman's algorithm. Hashing function and it’s characteristics. Concept of sequential. rehashing. simple Index file and direct access file . Primitive operations and implementation in C.binary tree as an ADT. Unit I : (8 Hrs) File organization C Files and command line argument. Unit III : (6 Hrs) Queues Concept of queues as ADT. Concept of collision resolution. Implementation of stacks using linked and sequential organization. OBST. Depth First Search and Breadth First Search. chaining with & without replacement. Unit II : (6 Hrs) Stack Concept of stack as ADT.Threaded binary tree as an ADT.
“Data Structures using C and C++”. Text Books 1. 2002. R. 2002. 7. hash function. Drozdek. Thomson Brookes /COLE Books. New Delhi. Riccardi. “Data Structures and Algorithm Analysis in C++”. Oxford University Press. B. D. 1995. “Data structures via C++”. A. B. 2002. Pearson Education. M. Augenstin and A. ISBN-81-7808-670-0 26 .Willey India edition . Tremblay. P. Y. “Data Structures: A pseudo code approach with C”. Cengage Learning. 4. Gilberg. ISBN-019-510843-4. 2002. Michael Berman. Prentice Hall of India. 5. M. Tata McGraw-Hill International Editions. Forouzan. 3. 8. ISBN 81 – 7808 – 131 – 8. Soresan. A. bucket hashing. 2. Forouzan. ISBN-81-203-1177-9. 2nd Edition. 1984. collision resolution. 2002.9788126518685 A. B. ISBN 9788131503140. ISBN-0-07-462471-7. R. hashing methods. “Data Structures in C++”. Tannenbaum.Hash Tables: Basic concepts. 2. G. Cengage Learning. Tharp . Horowitz. J. 2nd Edition. Sahni.2008 . Galgotia Book Source. Mehta “Fundamentals of Data Structures in C++”. Langsam. Reference Books 1. E. “Data Structures: A pseudo code approach with C++”. ISBN 981 – 240 – 079 – 6. Pearson Education. “An introduction to data structures with Applications”. 6. M. Gilberg. 2nd edition. ISBN 9788131504925. Zoellick. “File Structure An Object oriented approach with C++”. S. Folk. Weiss.”File organisation and processing”. 2nd edition. ISBN 16782928.
Digital Signal As A Composite Analog Signal. Noisy Channel: Shannon Capacity. Encapsulation Layers In The OSI Model TCP/IP Protocol Suite Addressing : Physical &logical Addresses. Noise Data Rate Limits: Noiseless Channel: Nyquist Bit Rate. Delta Modulation (dm) transmission modes: parallel transmission. Line Coding Schemes. Amplitude Shift Keying. Composite Signals Bandwidth Digital Signals : Bit Rate . Periodic And Nonperiodic Signal Periodic Analog Signals: Sine Wave. Hierarchy The OSI Model : Layered Architecture. Basic Network configurations 3. Fundamentals of data communications 2. Frequency-Division Multiplexing. Phase. Analog And Digital Signals. Transmission Of Digital Signals Transmission Impairment: Attenuation. Direct Sequence Spread Spectrum 27 . Wavelength. Frequency Shift Keying. Latency (delay). Scrambling Analog to digital Conversion: Pulse Code Modulation (PCM). Wavelength-Division Multiplexing Synchronous Time-Division Multiplexing. Time And Frequency Domains. .bit Length. Bandwidth-delay Product. Phase Shift Keying. serial transmission Examination scheme Theory: 100 Marks Unit II : (6 Hrs) Modulation And Multiplexing Digital-to-analog Conversion: Aspects Of Digital-to-Analog Conversion. peer-to-peer Processes. Specific Addresses Analog And Digital : Analog And Digital Data. Port Addresses. Quadrature Amplitude Modulation Analog-to-analog Conversion: Amplitude Modulation. Practical examples of networks such as • Fundamentals of communications media • Hardware configurations within networks • Data transmissions Unit I : (8 Hrs) Layer Models and Signals Layered Tasks : Sender. Receiver.214449 – DATA COMMUNICATION Teaching Scheme Lectures: 3 hrs / week Learning Objectives 1. Using Both Limits Performance : Bandwidth. And Carrier. Phase Modulation Multiplexing. Throughput. Frequency Modulation. Distortion. Block Coding. Statistical Time-Division Multiplexing Spread Spectrum : Frequency Hopping Spread Spectrum (FHSS). Understanding the differences between data communications and telecommunications 4. Jitter Digital-to-digital Conversion: Line Coding.
Microwaves. variablesize framing flow and error control: flow control. Delay in Virtual-Circuit Networks. Radio Waves. data link layer. coding . Coaxial and Fiber-Optic Cable Unguided Media : Wireless. . Physical Layer Gigabit Ethernet : MAC sub-layer.polynomials. Circuit-Switched Technology in Telephone Networks Datagram networks: Routing Table . advantages of cyclic codes Checksum : idea. Delay. Ten-gigabit Ethernet 28 . VDSL. SDSL. Three Phases. stop-and-wait protocol Noisy channels: stop-and-wait automatic repeat request. Circuit-Switched Technology in WANs Structure of a switch: Structure of Circuit Switches. selective repeat automatic repeat request. Datagram Networks in the Internet Virtual-circuit networks: Addressing. go-back-n automatic repeat request . Carrier Sense Multiple Access (CSMA). Structure of Packet Switches Digital Subscriber Line: ADSL. token passing Channelization : Frequency Division Multiple Access (FDMA). Unit IV : (6 Hrs) Error Control And Data Link Control Ttypes of errors : Redundancy. Efficiency. Time-Division Multiple Access (TDMA).hardware implementation . physical layer Standard Ethernet : MAC Sub-layer. Transition Phases. Physical Layer. error correction . some linear block codes Cyclic codes : cyclic redundancy check . Physical Layer bridged Ethernet. modular arithmetic Block coding: error detection. hamming distance. Carrier Sense Multiple Access With Collision Avoidance (CSMALCA) Controlled access. internet checksum Framing : fixed-size framing. Delay. full-duplex Ethernet Fast Ethernet: MAC Sub-layer. Carrier Sense Multiple Access With Collision Detection (CSMALCD). Efficiency. polling. frames. Multilink PPP. detection versus correction. Efficiency. error control protocols Noiseless channels: simplest protocol. reservation. cyclic code analysis. Infrared Circuit-switched Networks : Three Phases. control field Point-to-point Protocol: Framing. HDSL. forward error correction versus retransmission. minimum hamming distance Linear block codes : minimum distance for linear block codes.Unit III : (6 Hrs) Transmission Media And Switching Guided Media : Twisted-Pair . one's complement. piggybacking HDLC: configurations and transfer modes. switched Ethernet. ADSL Lite. Unit V : (6 Hrs) Multiple Access and Ethernet Random access : Aloha. Multiplexing. Code Division Multiple Access (CDMA) ETHERNET :IEEE standards.
repeaters. byte. gateway Backbone networks: bus backbone. Virtual LANs: membership. three-layer switches.Communication Networks Fundamental Concepts and Key Architectures 3.Unit VI : (6 Hrs) Devices. Sonet layers: path layer.Garcia. William Stallings – Data & Computer Communications . Sonet frames : frame. configuration. encapsulation Text Books 1. Behrouz a Forouzan. P. IEEE standard . STS-L frame format. Indra Widijaja . 4th Edition 2. advantages SONET Architecture : signals. Gupta – Data Communications PHI Reference Books 1. section layer. communication between switches. and bit transmission. Data Communications and Networking. photonic layer. line layer . star backbone. Leon . active hubs. bridges. connections. two-layer switches routers. Backbone networks and SONET Connecting devices: passive hubs. C. Achyut Godbole – Data Communication Networks – TMGH 29 . device-layer relationships.7th Edition: PHI Publications 2. Sonet devices. overheads.
sectors etc 30 . 4. Make your program user friendly to accept the choice from user for i. intdosx functions i. Number of occurrences of a sub-string in the given string iv. (ii) Ramp wave . Write ALP to perform string manipulation to calculate string length and reverse a string.214450 PROCESSOR INTERFACING LABORATORY Teaching Scheme Practical: 4 hrs / week Examination scheme Term Work: 25 Marks Oral: 50 Marks 1. int86x. To delete a file ii.OBJ files of both the modules and link them to create an EXE file. characters. Write ALP to convert 4-digit Hex number into its equivalent BCD number and 5-digit BCD number into its equivalent HEX number. Find resolution used in both the ADC's and compare the results. (b) Write 8086 ALP to interface DAC and generate following waveforms on oscilloscope. The strings to be accepted from the user is to be stored in code segment Module_1 and write FAR PROCEDURES in code segment Module_2 for following operations on the string: i. BCD to HEX 3) EXIT. To create a directory Read and display disk information such as Drive. Write Assembly language program (ALP) to add array of N numbers stored in the memory. Display proper strings to prompt the user while accepting the input and displaying the result. 5 (a) Write 8086 ALP to convert an analog signal in the range of 0V to 5V to its corresponding digital signal using successive approximation ADC and dual slope ADC. (i) Square wave . 3. (iii) Trapezoidal wave (iv) Stair case wave (c) Write 8086 ALP to rotate a stepper motor for given number of steps at a given angle and in the given direction of rotation based on the user choice 6 Write following programs in C using int86. Find number of words. tracks.Variable Duty Cycle and frequency. Compare two strings iii. 2. Write ALP to perform non-overlapped and overlapped block transfer. Concatenation of two strings ii. HEX to BCD ii. Create . number of lines and number of capital letters from the given text in the data segment Note: Use PUBLIC and EXTERN directive.Variable direction. intdos.
FILE1. Register banks.7 . i. trapezoidal and sine waveforms. Write a program for block transfer for internal / external memory. Oral examination will be based on the term work. say. ii. Interface stepper motor to 8051 and write a program to rotate motor with different step angles and with different speeds. 8 bits numbers found in internal ram location 40H onwards and store results in R6 and R7. ii. Questions will be asked during the examination to judge the understanding of the practicals performed during the term.e. say. Interfacing 8/12 bit ADC to 8051 or equivalent and to write a program to find out the average value for 10 readings. External program. Compare the contents of FILE1 and FILE3 after decryption. i. Program should open. FILE2. Make your program user friendly with proper screen echoes. Interfacing DAC and writing programs to generate triangular. Write a program to multiply 16 bit number by 8 bit number and store the result and internal memory location. MOVC etc) Select any one of the given assignment.Output received byte to port1 . 8 9 10 Write ALP to read Boot Sector and Display contents of Boot Sector. 14 Write ALP to interface 8051 with : Select any two of the given assignment. read the content of FILE1 and encrypt it using suitable encryption key. Bit addressable area. iii. External data memory. Write a program to add n. FILE3. Candidate is expected to know the theory involved in the experiment. FILE2.Write 8086 ALP to perform Encryption and Decryption of a text message. say. Memory (MOVX.(use Inline C Code) 11 Assignments based on programming 8051 microcontroller using 8051 hardware or kits to cover following topics: a. 31 . Student should submit term work in the form of a journal based on the above assignments. Write ALP to switch from real mode to protected mode and back to real mode. Store encrypted text along with encryption key in. b. Decrypt the data and store the decrypted data in. Display an appropriate message in each mode. Write ALP to establish communication between two 8251 in asynchronous and synchronous mode. Read and display the contents of encrypted file i. Use File Handle function for handling the files. Write 8086 ALP to read command line arguments using PSP(Program Segment Prefix) and implement “DOS COPY Command “. 12 Timer programming :ISR based Write ALP to generate 2KHz square wave using Timer interrupt on any port pin.see port1 pin waveform on CRO. 13 Serial port programming : ISR based Connect two 8051 Ics using serial ports Send FFh and 00H alternatively to receiver . Handle all the errors and display appropriate message if user does not enter proper command line argument.
c) General Checkup (Least priority). Identify the prominent land marks as nodes and perform DFS and BFS on that 9. 10. Accept the terms in the polynomial in any order. b) delete. Implementation of Hash table using array and handle collisions using Linear probing with replacement and Chaining without replacement 3.214451 – DATA STRUCTURES AND FILES LIBORATORY Teaching Scheme Practical: 4 hrs / week Examination scheme Termwork : 25 Marks Practical : 50 Marks 1. Use the map of the area around the college as the graph. e) Find its mirror image f) Print original g) mirror image level wise. Use this ADT for a) infix to prefix conversion. mult. Represent single variable polynomial as a circular linked list. 7. 5. sub etc.) and perform following operations: a) Insert.e. 4. b) non-serious (medium priority). Implement all primitive operations on Sequential file in C 2. Sort while creating polynomial in the decreasing order of exponent and write a menu driven program to perform display. Implement Huffman’s algorithm. c) evaluation of postfix expression. 32 . 6. Implement stack as an abstract data type (ADT) using linked list. Consider a scenario for Hospital to cater services to different kinds of patients as a) Serious (top priority). c) depth of the tree. b) infix to postfix conversion. Accept a postfix expression and construct an expression tree and perform recursive and non recursive traversals. 8. Implement the priority queue to cater services to the patients. multiplication and evaluation. i. not necessarily in the decreasing order of exponent. d) search a node. Create a binary search tree of mnemonics from assembly language(e.g. Represent a given graph using adjacency matrix and find the shortest path using Dijkstra’s algorithm. Identify the prominent land marks as nodes and find minimum distance to various land marks from the college as the source. div. addition. add. Represent a given graph using adjacency list and perform DFS and BFS Use the map of the area around the college as the graph.
References: Code complete: STEVE McCONNEL Note: While performing the assignments following care should be taken 1. 4. 3. Candidate is expected to know the theory involved in the experiment. 33 . Proper indenting. 2. naming conventions should be followed. Student should submit term work in the form of a journal based on the above assignments. Questions will be asked during the examination to judge the understanding of the practical performed at the time of examination. coding styles. commenting. Practical examination will be based on the term work. Avoid using global variables as far as possible Use of functions is necessary Faculty should prepare a lab manual including standard test cases & should be available for reference to students.
overloading the assignment. function overloading. class as ADTs and code reuse Unit IV : (3 Hrs) Operator Overloading: Introduction. virtual functions. default parameters. ‘cout’. virtual base class. modular. Limitations of procedural programming. object-oriented and generic programming techniques. inline member functions. data abstraction and information hiding. ‘const’. type conversions Unit V : (4 Hrs) Inheritance and Polymorphism Concept and need. comments. destructors. single inheritance. public. static class. hybrid inheritance. static member functions. Need of object-oriented programming. Introduction to Generic Programming: Introduction to Standard Template Library (STL). fundamentals of object-oriented programming: objects. polymorphism. data members. new and delete operators Unit III : (4 Hrs) Classes and Objects: Defining a class. data encapsulation. function templates. inline functions. ambiguity. function overloading vs. dynamic memory allocation. global scope. Templates: Function template and class template. static data members. member access control. base and derived classes. Unit II : (2 Hrs) Programming with C++ ++: Extensions to C: Variable declarations. container classes Unit VI : (5 Hrs) Templates: Introduction. multiple inheritance. abstract base class. friend function. overloading using friends. types of inheritance.210253: OBJECT ORIENTED PROGRAMMING AND COMPUTER GRAPHICS LABORATORY Teaching Scheme Lectures : 1 Hrs / Week Practical : 4 hrs / week Examination scheme Practical : 50 Marks Term Work : 50 Marks Unit I : (3 Hrs) Introduction to Object Oriented Programming Introduction to procedural. member function templates and template arguments. methods. array of objects. default and constant arguments. early and late binding. ‘this’ pointer. constructors. ‘cin’. private and protected members. virtual destructors. classes. containers. study of container template classes for vectors and stacks and related algorithms NameSpaces: Introduction. iterators and algorithms. rules for operator overloading. Need of operator overloading. reference variables. pointers and classes. inheritance. friend classes. Rules of namespaces 34 . polymorphism. function prototypes. data members and methods. messages. pure virtual functions. binary and unary operators. formatting and I/O manipulators.
ISBN 81-7515-269-9. Create a class named weather report that holds a daily weather report with data members day_of_month. The constructor initializes the fields with default values: 99 for day_of_month. “Object Oriented Programming with C++”. file operations. C++ streams. stream classes. formatted I/O and I/O manipulators Unit VIII : (2 Hrs) Files and Streams Concept of a file. Introduction to RTTI Managing Console I/O Operations: Introduction. New Delhi ISBN 0 – 07 – 462038 – X. sequential file processing. Reference Books: 1.inline code and dynamic memory allocation : 2. Error handling Text Books: 1. Rajesh Shukla “Object Oriented Programming in C++”. Design a Class ‘Complex ‘ with data members for real and imaginary part. Lafore. Static member functions. • Operator overloading : 3. opening and closing a file.Height. Cengage learning. B. structures and files. Provide default and parameterized constructors.amount_rain and amount_snow. ISBN 0 – 201 – 32755 – 4. unformatted I/O. “The Waite Group’s Object oriented Programming in C++”. 999 for hightemp. 1997. “Object Oriented Programming with C++”.Weight.telephone number. syntax for exception handling code: try-catch-throw.friend class.default constructor. detecting end-of-file. 3.Write a program to perform arithmetic operations of two complex numbers using operator overloading (using either member functions or friend functions). Wiley India Edu. Balaguruswamy.Unit VII : (2 Hrs) Exception Handling: Introduction. streams.copy constructor. 35 . 3rd Edition. Write a program that creates a monthly report. Stroustrup.this pointer. R.static member functions. “Object Oriented Programming with C++”. “C++ Programming Language”. classes and files.-999 for low emp and 0 for amount_rain and amount_snow. 4. Joyce Farrell. Galgotia Publications. 2001.Blood group. India Edition. etc Construct the database with suitable member functions for initializing and destroying the data viz constructor.Date of Birth.inline code and dynamic memory allocation operators-new and delete. file pointer.driving licence no. Tata McGraw-Hill PublishingCompany Ltd. Saurav Sahay. Oxford. Destructor: 1.hightemp.Insurance Policy number. Include a function that prompts the user and sets values for each field so that you can override the default values. E. Multiple Exceptions.this pointer.friend class.lowtemp.destructor. 2. Suggested list of Assignments GROUP A: • Constructor. Exceptions with arguments. 3rd Edition. file modes. 2. Pearson Education. Develop an object oriented program in C++ to create a database of the personnel information system containing the following information: Name.Contact address.
Pie Charts.replace all the data member values with zero values. Line styles. 4. graphics drivers. initialization of graphics mode. >> To reverse a string vi. orientation and justification.date of birth. Write a menu driven program to carry out the following things: i) Build a master table ii) Display iii) Insert a new entry iv) Delete entry v) Edit vi) Search for a record Templates : 6. or if the price is negative or over $5000 then throw an integer. Color Palette. Write a program to implement algorithm for line and circle drawing.The derived class consists of the data members subject code .The derived class contains the data members telephone numbers and driving licence number. Function to determine whether a string is a palindrome To find occurrence of a sub-string. GROUP B: 1. switching between text and graphics mode. Use Operator Overloading Inheritance : 5. (a) Text and Graphics mode. 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 arithmetic operations on these matrices separately and display it. Write a program to implement algorithm for filling a polygon using scan-fill method. + Concatenation iv.Write a main() function that instantiates a television object. Design a base class consisting of the data members such as name of the student. size. filling a polygon. Histograms.if the screen size is smaller than 12 or greater than 70 inches.The program should have the facilities. Design a base class with name. Write a C++ program to perform String operations i. Text: fonts. Case study of any graphics tool.• • • • 4. error handling. Write a program to implement 2-D transformations.Design one more base class consisting of the insurance policy number and contact address. == String Copy iii. 36 .allows user to enter data and displays the data members . Circle. Assignments to understand functions available in graphics library such as. = Equality ii. i) Build a master table ii) List a table iii) Insert a new entry iv) Delete old entry v) Edit an entry vi) Search for a record Exception Handling : 8. << To display a string v. (b) Color. (d) Writing a Graphics Editor 2.Construct a virtual base class for the item name of the student and roll number. alignment.and the price.If more than four digits are entered for the model.If an exception is caught . 5. Aspect ratio. Line. Ellipse. 3. windowing. Bar graphs. (c) Graphics Primitives: Pixel.internal assessment and university examination marks. Polygons. Create a class named Television that has data members to hold the model number and the screen size in inches.roll number and subject.blood group and another base class consisting of the data members such as height and weight.Member functions include overloaded insertion and extraction operators. Virtual functions & files : 7.
Practical Examination will be based on the term work and questions will be asked to judge understanding of the assignments at the time of the examination • 37 . Instructors are expected to incorporate variations in above list.Instructor will frame assignments based on the suggested assignments as given above. • 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 listing with proper documentation and printout of the output.
This action might not be possible to undo. Are you sure you want to continue?
We've moved you to where you read on your other device.
Get the full title to continue listening from where you left off, or restart the preview.