This action might not be possible to undo. Are you sure you want to continue?
Academic Year - 2009-10
Pattern - A
CS0142: Data Structures And Algorithms - I
Prerequisites : Computer fundamentals and Programming. Aim : The objective of the course is to introduce the concepts of abstract data types, data structures, graphs, algorithms and complexity. The data structures include linear data structures with application of divide and conquer, recursion and randomization algorithms. The course also focuses on sorting and searching algorithms. Objectives: 1. To understand use of efficient programming and documentation. 2. To introduce algorithmic analysis, fundamental data structures, problem solving paradigms 3. To study the representation, implementation and application of basic data structures. 4. To introduce algorithmic strategies and time complexity analysis of problems. Unit 1 : Linear data structures ( 7 Hrs )
Linear data structures using sequential organization: Single dimensional Arrays, Initialization, Memory representation, Use of 1D arrays, Strings: array of Characters, String functions using arrays and pointers, Multidimensional arrays, Storage representations (row major and column major), Magic Squares. Concept of ordered list and polynomial representation using arrays, operations on polynomials like add, multiply, evaluate. Matrix operations like add, multiply, transpose, etc. Representation of sparse matrix, algorithm for sparse matrix addition, simple and fast transpose. Time and space complexity analysis for simple and fast transpose of sparse matrix. Unit 2 : Linked Representation ( 9 Hrs )
Dynamic Memory allocation, Array representation using dynamic memory allocation, Concept of linked organization, singly linked list, doubly linked list, circular linked list, Insertion, Deletion and traversal on above data structures. Representation and manipulations of polynomials using linked lists. Generalized Linked List, operations on GLL like copy, Equality. Unit 3 : Stack ( 6 Hrs )
Fundamentals of stack, Representation and Implementation of stack using arrays and linked lists, Applications of stack: Decimal to Binary Conversion, reversing a string, Parsing: Wellform parenthesis, Different expression conversions and evaluation, representation of multiple stacks, Simulating recursion using stack. Unit 4 : Queues ( 5 Hrs )
Fundamentals of queue, Representation and Implementation of queue using arrays and linked list, Circular queue: representation and implementation, Applications of queue: Josephus
COMPUTER ENGINEERING Second Year Academic Year - 2009-10 Pattern - A
Problem, Job Scheduling, Queue Simulation, Categorizing Data, Double Ended Queue, representation of multiple queues, Priority queue. Unit 5 : Searching and sorting ( 8 Hrs ) ‘O’,’Ω’ and ‘Ө’ asymptotic notations, Average, Best and Worst case analysis of algorithms for Time and Space complexity Introduction to Searching techniques: Linear, Fibonacci and binary Search Techniques. Sorting: Sort Order, Bubble sort, insertion sort, selection sort, shell sort on numbers and character strings, bucket sort, External sort. Unit 6 : Divide and Conquer and Greedy strategies ( 7 Hrs )
Concept of Divide and Conquer strategy. (e.g. merge sort, quick sort, binary search and exponentiation) Greedy Algorithms (e.g. job scheduling with deadlines, knapsack, optimal storage on tapes). Outcomes: Upon Completion of the course, the students will be ale to: 1. Understand of how several fundamental algorithms work, particularly those concerned with sorting and searching 2. Understand of the fundamental data structures used in computer science 3. Analyze the space and time efficiency of most algorithms 4. Design new algorithms or modify existing ones for new applications and reason about the efficiency of the result Text Books: 1. Y. Langsam, M.J.Augenstein, A.M.Tenenbaum, ‘Data structures using C and C++’, Pearson Education, Second Edition, 2002. 2. E.Balaguruswamy,’ C and Data Structures’ TMH Publication, 2003 Reference Books : 1. E. Horwitz , S. Sahani, D. Mehta, ’Fundamentals of Data Structures in C++’, Galgotia book source, New Delhi, 1995. 2. M. Weiss, ‘Data structures and Algorithm Analysis in C++’, Pearson Education, 2nd Edition, 2002 3. J. Tremblay, P. soresan, ‘An Introduction to data Structures with applications’, TMH Publication, 2nd Edition, 1984. 4. A. Drozdek, ‘Data Structures in C++’, 2nd Edition, Thomson Brookes / COLE Books, 2002. 5. . E. Horwitz , S. Sahani, S.Rajasekaran, ’Fundamentals of Computer Algorithms’, Galgotia book source, New Delhi, 1998.
Academic Year - 2009-10
Pattern - A
Predictor-Corrector Methods. Singles step methods.CS0122: Numerical Methods and Simulation Prerequisites: Elementary knowledge of 1) Numbers 2) Differentiation and integration 4) Differential equations 5) Algebra 6) Probability Objectives: The course explains the importance and symbiosis between Mathematics and Engineering. Chi-Square. Unit-2. Finite Difference Methods. Difference Equations. . Unit-4. Maxwell. Ordinary Differential Equations: Initial value Problems (7 Hrs) Introduction. Normal. Log-Normal.Poisson. Central Difference.2009-10 Pattern . Multi Step Methods. Normal. Introduction to Numerical Computation (7 Hrs) Forward Difference. Delta. Weibull COMPUTER ENGINEERING Second Year Academic Year . Pascal. Uniform. Unit-1. Erlang. Bernoulli Trials . Rayleigh. This course module has helped to develop skills of numerical techniques. Random Processes. Unit-3. probability. Discrete and Continuous Probability distribution and density Function (7 Hrs) Random Variables.A Laplace. queuing models. Stability Analysis of Multi Step methods. Beta. Initial Value Problem Method (Shooting Method). Least square approximation. Backward Difference. Gamma. Ordinary Differential Equations: Boundary value Problems. Stability Analysis. Binomial . Curve-Fitting method. Relation between operators. Finite Element Methods. (7 Hrs) Introduction.Bi-variate. Interpolation (Lagrange’s / Newton’s/ Sterling). The objective of the course is to achieve fluency with Numerical tools which is an essential weapon in modern Graduate Engineer’s Armory and the balance between the development of understanding and mastering of numerical techniques. Cauchy. Numerical Methods. Exponential.
Queuing Theory. Sample mean. (7 Hrs) Queuing Models. Finite Element Ritz’s Method (Second Order Differential Equations only) 5. Joint Entropy. Sampling Distribution. 7. Euler’s Modify Method. Sample variance. Reservations and Polling. Entropy. M/M/1 Queuing System.A . Probabilistic Form of Little’s Theorem. Interpretation of Entropy. Sampling Distribution. Confidence Information Theory: Measuring Information. Conditional Entropy. Huffman Codes. Sample mean.Unit-5. Different Interpolation Methods and the curve fitting. Unit-6. Chi Square test. Entropy.2009-10 Pattern . OUTCOMES: By the end of this module students are expected to demonstrate the knowledge of 1. Finite Difference Method for Boundary Value Problem and Rayleigh Ritz’s method. Reservations and Polling. (7 Hrs) Sampling Theory. Markov Chain Formulation.Little’s Theorem. Deviation of the Stationary Distribution. AND Other Markov Systems. Sampling and Information Theory. Hypothesis Testing. Student’s t Test. M/M/∝. M/M/m/m. Runge Kutta’s Fourth Order Method and Adom Bashforth Method for First Order Differential Equations with their Stability Analysis 3. Occupancy Distribution upon Arrival. Euler’s Method. M/G/1 Queues with Vacations. Interval. Poisson Arrival Models. Galarkin Method. M/G/1 Queues with Vacations. Joint Entropy. The M/G/1 System. Interpretation of Entropy. Measuring Information. Conditional Entropy. Arrival Statistics. Markov Chain Formulation. 2. Little’s Theorem. 6. COMPUTER ENGINEERING Second Year Academic Year . Minimum and Maximum Entropy. Shooting Method for Initial Value Problem. Different Markov Systems. Huffman Codes. 4. The M/M/m. The M/G/1 System. Service Statistics. Occupancy Distribution upon Departure. Sample variance. Application of Little’s Theorem. Priority Queuing. Priority Queuing. Random Variables and Random Processes and various Probability Distributions. Difference operators. Poisson Arrival Model .
. 2004.O. ‘Probability models for computer science’. 4.1972. John Wiley and sons.R. ’Numerical Methods for scientific & engineering computations’.K. 1991. ‘Introduction to Queuing theory’. John Wiley & Sons. Cooper. Robert B. ‘Advanced Engineering Mathematics’.. S. Ross. A.. 1 st Indian Edition. 8th Edition. Ross. Gross D. 2nd Edition. ‘Information Theory’.…. Erwin Kreyszig. S. and Harris C. Inc. B. 2007 COMPUTER ENGINEERING Second Year Academic Year . Jain. 2nd edition. M. M. Ross‘.A . M.1981 5.. M. 6. K. ‘Simulation by S. 2003 7. McMillan. John Wiley & Sons . 2. 1985 REFERENCE BOOKS: 1. Allen.. Albert Leon-Gracia. Academic Press. 2006. New York. ‘Probability and Random Processes for electrical engineering’. Pearson Education. 2nd Edition. S. Statistics and Queuing theory’. R.TEXT BOOKS: 1. New Delhi. 3. University of Toronto. ‘Probability. New York.K Iyengar & R . Wiley Eastern Ltd. 1st South Asian Edition. Jain. ‘Fundamentals of Queuing Theory’. Dover Publications. Ash. 2.2009-10 Pattern . Academic Press. 2002. New York. ……. 3rd Edition. inc.
RDRAM. function and characteristics of computer systems and understand the design of its various functional units. Micro-program control.ROM. Design examples: Multiplier CU. High-Speed Memories: Cache Memory. Unit 2: Control Unit Design ( 6 Hrs ) Machines instructions and addressing modes(ws 381). Unit 4 : Memory Organization ( 8 Hrs ) Characteristics of memory systems. Instruction Set . Hardwired Control: Design methods. Booths Algorithm. Paging. Organization. Unit 1: Structure of a Computer System ( 6 Hrs ) Brief History of computers. EPROM. Division. CDROM.Instruction types. 2’s Complement multiplication. error correction. Virtual Memory: Main Memory allocation. Superscalar Processors. Single Bus CPU(). Register Organization.Overview. Restoring and Non Restoring algorithms.(ws 599) Unit 3: Processor Design ( 7 Hrs ) CPU Architecture. To understand the design principle of the various functional units of digital computers 3. DRAM. RISC and SUPERSCALAR Processors: RISC. Register File. Performance Characteristics. Interleaved and Associative Memories. Optical memory.A . PROM. Integer Arithmetic. Objectives: 1. To understand the structure. Motorola processors). Segmentation. Types of operands. Motorola processors). IEEE standards for Floating point representations(ws 283-313). SDRAM.Features. Applications of microprogramming. EEPROM. Internal and External Memory Main Memory. MESI protocol. Control Unit Operation: Instruction Sequencing. RAM: SRAM. Secondary Storage: Magnetic Disk.2009-10 Pattern . instruction formats (Intel. Hardware Implementation. DVD COMPUTER ENGINEERING Second Year Academic Year . Replacement Algorithms. Cache Coherence. organization and Mapping. function and characteristics of computer systems 2. Functional Units(20) Data Types and Computer Arithmetic: Fixed and Floating point numbers. To understand Parallel Processing concepts.CS0132 : Computer Organization Aim: To learn structure. Microinstruction-sequencing and execution. RAID. Von Neumann Architecture(ws 16). Micro-operations. RISC v/s CISC. Instruction cycles. Signed numbers. Instruction pipelining.(ws 575) Micro-programmed Control: Basic concepts. Addressing Modes (Intel. ALU design-ALU organization.
Outcomes: At the end of the course students will: 1. Desk-jet and Laser Printers Unit 6 : Multiprocessor Configurations (9 Hrs ) Multiprocessor Configurations: Closely coupled and loosely coupled multiprocessor architectures. ISBN 0 – 02 – 946297 – 5 2. 5.CISC and Superscalar processor 4. 2003. Instruction pipelining. Parallel computer structures. Text Books 1. Hwang and Bringgs – Computer Architecture and Parallel Processing-TMH. Parallelism in Uniprocessor systems. Hamacher. G. Motorola Processor’s addressing modes. Video Displays. Problems of bus contentions. Bus Arbitration.2009-10 Pattern . COMPUTER ENGINEERING Second Year Academic Year . Zaky. Asynchronous. Coprocessor and I/O Processor. overview of RISC. Maxwell Macmillan Editions. “Computer Organization and Architecture: Designing for performance”. PCI. “Computer Organization and Architecture: principles of structure and function”. SCSI. “Structured Computer Organization”. Coprocessor and I/O Processor. secondary memory devices. Hennesy. Architectural classification schemes. virtual & cache memory concepts. Performance Bus controller. “Computer Organization and Design: The Hardware Software Interface”. S. Tanenbaum. A. W. ISBN 81 – 203 – 2103 – 0. 5. Reference Books 1. USB Ports Peripherals: Keyboard. Understand multiprocessor configuration. Prentice Hall of India. D. 1990. 2nd Edition.1986 . George. Obtain Knowledge about the control unit design. Acquire the information about Intel. 3. Parallel. 4th Edition. Morgan Kauffman. 2002 2. 6. Prentice Hall of India. Serial.Unit 5 : I/O Organization ( 6 Hrs ) Input/Output Systems. I/O channels. algorithms for multiplication and division. Zvonko. Obtain knowledge of integer and floating point arithmetic. W. Inter-process Communications. Introduction to parallel processing: Trend towards parallel processing. 3. 4. 2000 ISBN 981 – 4033 – 588. Mouse. Paterson. Study the details of different input and output devices with their functions. “Computer Organization”. J. Programmed I/O. Stallings William. System Bus. Stallings. 1991. ISBN 81 – 203 – 1553 – 7 . McGraw Hill. Scanners. 2. 2nd Edition. Buses and standard Interfaces: Synchronous. 2nd Edition . Interrupt Driven I/O. Bus structures and Interconnection networks. “Computer Organization: Hardware and Software”. Parallel processing applications.A . Dot Matrix. 6th Edition. Prentice Hall of India. V. Understand memory types. and parallel processing concept. C.
state diagrams. state tables. Unit 1: Number system and Codes (6 Hrs ) Introduction.## Digital comparator: 7485 Unit 3 : Sequential logic circuits (9 Hrs ) Introduction of flip-flop (F. excitation table. Objectives: To understand combinational and sequential circuits and their applications and get introduced to programmable devices and their implementation in simple circuits. EC4992: Digital Electronics And Logic Design Prerequisites: Basic Electronics Engineering Aim: To Learn basics of digital electronics and its practical application. Don't care conditions Design examples.multiplexers : code converter. Design of 4 – bit UP-Down ripple counter using J-K flip-flop . “Computer Architecture and Organization”. implementation using flip-flops. Shift register (modes of operation). Minimization of SOP and POS forms using K. Moore/Mealy M/c's: representation techniques. application of shift registers (Ring counter. Hays. flip-flop truthtable. BCD code.74190. BCD adder and subtractor. Hexadecimal number System. Excess-3 code. 2's complement arithmetic.6. 2nd Edition 1988 ISBN 0 – 07 – 100479 – 3. Sequence generator.2009-10 Pattern . COMPUTER ENGINEERING Second Year Academic Year . mod-n counters (IC 7490. T and D F. flip-flop conversion.F). adder with look ahead carry. demultiplexers.. Code conversion. clocked S-R F. 4bit bi-directional universal shift register (using D or J-K FF).7493). Applications like sequence generator and detector. J-K F.F. Sign-Magnitude representation. Octal number System. state assignment. Gray code. Design of Synchronous 3 bit up/down counter.F race around condition. encoder: Priority encoders. decoders: 74138. SOP form. flip-flop characteristics. parity generator and checker. Johnson's counter).F.Map (K-maps up to 4 variables only). M/S J-K F. Half adder and subtractor.F. BCD-to-7-segment Decoder. One's and Two's complement representation. Boolean algebra: Basic theorems and properties Unit 2: Combinational logic circuits: (8 Hrs ) K-Map: Representation of truth-table. J. POS form. state reduction. Binary number System. 1 bit memory cell. Simplification of logical functions. ##ALU 74181. full adder and subtractor. Binary arithmetic. McGraw-Hill.A .
R. multiplexer controller method. Comparison of TTL and CMOS. AND. 3rd Edition . CMOS NAND and NOR. R. Invert/Non-Invert Matrix.555 -0 2. TTL Characteristics.7808 . Be Familiar with TTL and CMOS logical families with their characteristics. "Digital Logic: Applications and Design". Reference Books 1. Programming the PLA.4 bit counters. Yarbrough. ISBN 981 . CMOS Logic: CMOS Inverter. Be able to design simple combinational circuit: half adder and subtractor using VHDL language. "Modern Digital Electronics". "Digital Design". noise margin. 3rd Edition .2009-10 Pattern . Unconnected Inputs. CMOS characteristics. design of simple controller. “A VHDL Primer”. Get adequate knowledge of Number systems.352 . ISBN . Unconnected Inputs.3 COMPUTER ENGINEERING Second Year Academic Year . New Delhi). sequence detector 4. Get knowledge about 3-bit.049492 . RTL notations and implementation Introduction to VHDL: Modeling Digital systems. Englewood Cliffs. J. Text Books 1. modeling languages. Bignell. notations. sequence generator. Unit 6 : ASM. NJ: Prentice Hall. Power dissipation. operating temperature etc. ASM 6. CPLD . Boolean algebra and concept of code conversion 2. VHDL ( 6 Hrs ) ASM charts. 1995. Wired-AND. ISBN 0 .2002. Jain.1 3. FPGA.240 .Unit 4: Logic Families (7 Hrs) Characteristics of Digital ICs: Speed. M. J.81 . totem pole. Mano. Study of Data sheets of 7400 Series ICs: (Basic and Universal logic gates) Unit 5 : Programmable Logic Devices ( 6 Hrs ) Programmable Logic array: Input. 3. interfacing TTL to CMOS and vice versa. Pearson Education. 2001. TTL: Operation of TTL NAND gate. Standard TTL. current and voltage parameters. shift register. Tata McGraw-Hill. Wired-logic. 5.07 . Understand Programmable Logic array. open collector.4 2.2003. Output Buffers. 2002. Thomson Brooks/Cole (Vikas Publishing House.062 . inverters. ISBN 981 .240 . OR. "Digital Electronics". CPLD..P. Understand K-map Simplification and designing of different combinational circuit. Applications of PLAs to implement combinational and sequential logic circuits Introduction to :FPGA. 4th Edition. Active pull-up. tri-state logic: tri-state buffers. J.A . Donovan. Open-Drain Outputs. modeling concepts Outcomes: At the end of the course students will: 1. DELMAR Thomson Learning. fan-out. Bhaskar.
J. Differentiator. Op-Amp Parameters: Bias. Zener and their peculiarities and applications. CB. r. Bias. Biasing ( 9 Hrs ) Introduction to BJT.07 . Rectifier. Operation. D. Switching. Self Bias.Principles and Practices". Pearson Education. EC4982: Applied Electronics Aim : To study various electronic components and its applications. Derivation for Thermal Stability. Comparison of the bias circuits. "Digital Design . Unit 2: Transistor. Construction. Application of BJT: BJT as an amplifier. Precision Rectifier. FET. Working. Bridge rectifier and analyze these rectifiers w. Current to Voltage Circuits using Op-Amp Unit 4: Power Devices and Power Supplies COMPUTER ENGINEERING Second Year Academic Year . Malvino. Integrator. Objectives: To study the basic components like diode. Subtractor. Schmitt Trigger. Instrumentation Amplifier. types of diodes. Zero Crossing Detector..2009-10 (7Hrs) Pattern . ISBN 0 . Thermal run away. Op-Amps and their applications. Leach. A. Input output impendence concept. Power. Collector Base Bias. 2003. clipper and clamper circuits.A . and gain constant of an amplifier. Definition and derivation for Stability Factors S. 5th Edition.047258 – 05 5. Offset current. offset voltage. Need of and techniques for bias compensation. Full wave rectifier. Study the basic working of active components and their implementation in electronic circuits. BJT as a switch. Drain and Transfer Characteristics and Parameters Unit 3 : Operational Amplifiers (7Hrs) Block Diagram of an OP-Amp. Fixed Bias. CE. Voltage to Current. Signal. Direct Coupled Differential Amplifier Circuit. Waveform Generator (triangular). Level Shifter and the Output Stage. FET: Symbol. efficiency. Unit 1: Diodes ( 6 Hrs ) Overview of semiconductor theory. CMRR. "Digital Principles and Applications". Wakerly. BJT. t ripple factor. Tata McGraw Hill. Significance and Typical Values Op-Amp Applications –Adder. CC Characteristics Transistor Biasing Circuits: Overview of Biasing.Half wave rectifier. Diode Applications: Rectifier :. PSRR Definitions. slew rate. numerical for Self Bias Circuit only.4.
W. types of SMPS: Buck. Line interactive UPS Outcomes: At the conclusion of the course student would be able to 1. 3rd Edition. Boost. 2 Differentiate between biasing circuits and significance of self-bias circuit 3 Study Op-Amp features and its applications 4 Acquire knowledge about Power devices and their application. Pearson Education. C.2009-10 Pattern . “Op-Amp and Linear Integrated Circuits”. 1995. ISBN 81– 7808–355-8. ISBN 81 – 7808 – 590 – 9. 2nd Edition.Introduction to SMPS. Power supplies: . N. Acquire knowledge of types of diodes and their applications along with overview of semiconductor theory. “Microwave Devices and Circuits”. Liao. Robbins. 4th Edition. 2002. COMPUTER ENGINEERING Second Year Academic Year . 2. Prentice Hall of India. 1. 5th Edition. ISBN 9971 – 51 – 177 – 0.Power Devices: . Introduction to DIAC and TRIAC. 8th Edition 3. ISBN 81 – 203 – 2058 – 1. Nashelsky. 2nd Edition.A . Pearson Education. Millman. Mohan. John Wiley. T. get introduced to different types of SMPS Text Books : 1. 5. J. applications and design”. ISBN 0 – 07 – 016246 – 8. R. 2001. 1988. online UPS. G. “Integrated Circuits and Semiconductor Devices. McGraw Hill. T. “Electronic Devices”. converters. Gaikwad. R. ISBN 81 – 203 – 0699 – 6. 4. “Power Electronics. McGraw Hill. Prentice Hall of India. Deboo. Halkias. 1987. Reference Books : . 2002. Burrous. “Electronic Devices and Circuit Theory”.Characteristics and principle of Operation of SCR Applications: Half-wave and Full-wave Controlled rectifiers. Boylstad. Theory and Applications”. C. ISBN 0 – 07 – Y85493 –9 2. Undeland. Floyd. Buck-Boost SMPS. off line UPS. “Integrated Electronics Analog and Digital Circuits and Systems”. L.
2009-10 Pattern .Second Year Computer Engineering First Semester Practicals COMPUTER ENGINEERING Second Year Academic Year .A .
etc. Write a C Program to create a database (such as employee. difference. To study the representation. etc. To understand use of efficient programming and documentation. palindrome. problem solving paradigms 3. simple & fast transpose.union. data structures. The data structures include linear data structures with application of divide and conquer. compare etc. concat. List of Practicals 1. length. reverse. transpose. display etc. implementation and application of basic data structures.2009-10 Pattern . 8. 9. 2. COMPUTER ENGINEERING Second Year Academic Year . recursion and randomization algorithms. Write a C program to perform various String operations using pointers such as length. symmetric difference. The course also focuses on sorting and searching algorithms. insert. 3. To introduce algorithmic analysis. Write a C program to accept binary numbers in doubly linked list & perform addition of them and store the result in another list. Aim : The objective of the course is to introduce the concepts of data types. print reverse. 4. student) using single linked list with options like Create. multiplication. Write a C Program to implement Set operations using arrays. Write a C Program to find a factorial of a number using recursive and non recursive functions. To introduce algorithmic strategies and time complexity analysis of problems. Write a C Program to represent single variable polynomial using array and perform addition. Objectives: 1. fundamental data structures.I Prerequisites : Computer fundamentals and Programming. search. algorithms and complexity. Write a C program to perform various String operations using arrays such as copy. (without built in functions) 5. delete. modify.A . intersection. 7. substring. multiplication of them.CS5112 : Data Structures And Algorithms . 2. (without built in functions) 4. Write a C program to represent sparse matrix using array and perform sparse matrix addition. Write a C program to implement Matrix operations like addition. 6.
Weiss. Horwitz . P. Write a C Program to represent multivariable polynomial as a circular linked list and using menu perform addition. 2nd Edition. 15. Write a C program to implement Double Ended Queue using linked list. Galgotia book source. ‘Data Structures in C++’. Mehta. 2. 2002 2. copy and display functions on it.A . Write a C program to create a GLL and perform accept. and Merge these two lists into third list without creating a new linked list. Langsam. A. 1984. Write a C Program to implement Quick sort and Merge sort. Display results after every pass.10. 11. 2nd Edition. 20. Write a C program to implement Binary search method . selection sort. Write a C program to implement stack using array. ‘An Introduction to data Structures with applications’. Design new algorithms or modify existing ones for new applications and reason about the efficiency of the result Text Books: 1. Write a C Program to create two sorted singly linked lists. 1995. 2002. insertion. Second Edition. Thomson Brookes / COLE Books. ‘Data structures using C and C++’. Understand of how several fundamental algorithms work 6. 2nd Edition. TMH Publication. multiplication and evaluation. M. Write a C program to implement Circular Queue using array. Write a C program to implement Sorting methods. 3. Outcomes: Upon Completion of the course. 4. 13. Tremblay.J. Pearson Education. 2002. A. 2003 Reference Books : 1. J. Y. 16. 19.Tenenbaum. the students will be able to: 5. Drozdek. 18.M. Balaguruswamy. 14. 12. D. Understand of the fundamental data structures used in computer science 7. soresan.2009-10 Pattern . Pearson Education. ’fundamentals of Data Structures in C++’. linked list and perform add and delete operations on it. bucket. New Delhi. Analyze the space and time efficiency of most algorithms 8.with and without recursion. COMPUTER ENGINEERING Second Year Academic Year . S. 17. linked list and perform Push and Pop operations on it. Sahani. ‘Data structures and Algorithm Analysis in C++’. Write a C program to check the parenthesis validity of the given expression using stack. E.Augenstein. Write a C program to convert infix expression to postfix and evaluate it using stack.’ C and Data Structures’ TMH Publication.bubble. M.
The initial values x0. the final value xf and the step size are to be read. queuing models.2009-10 Pattern .CS5122: Numerical Methods and Simulation Objectives: The course explains the importance and symbiosis between Mathematics and Engineering. The objective of the course is to achieve fluency with Numerical tools which is an essential weapon in modern Graduate Engineer’s Armory and the balance between the development of understanding and mastering of numerical techniques. It requires two approximations of the slope of the solution curve at the starting point of integration. y0. 3) Program to solve an IVP . u. y(x0)=y0. This course module has helped to develop skills of numerical techniques. y0. dy/dx =f(x.A . du/dx) . u[b]=s2 by shooting method using the superposition principle. using Milne Simpson Method The initial values x0. 4) Program to solve the linear two point boundary value problem Un = p[x] (du/dx) + q[x]u+r[x] = G (x. dy/dx =f(x. 5) Write a program to generate Huffman variable length code. F(x. The second derivative at the end points are assumed as zeros (natural spline). List of Practicals 1) Program for Lagrange Interpolation Method 2) Program for Cubic Spline Interpolation for arbitrary set of points . probability. The initial value problem is solved by the fourth order Runge Kutta Method for 2x2 system. Starting values are calculated using classical fourth order Runge Kutta method. u[a]=s1. using Euler Method.y) is written as a function subprogram Program to solve an IVP .y). the final value xf and the step size h are to be read.y). COMPUTER ENGINEERING Second Year Academic Year . y(x0)=y0. The linear function G is given as a function subprogram. Adams-Bashforth method of third order is used as a predictor and Milne-Simpson method is iterated till abs(yold-ynew)<=err where err is error tolerance.
Interpretation of Entropy.2009-10 Pattern . New Delhi. New York.1991. Shooting Method for Initial Value Problem. Text Books 1. Jain.2nd Edition. The M/G/1 System. New York. OUTCOMES: By the end of this module students are expected to demonstrate the knowledge of 8. K. Runge Kutta’s Fourth Order Method and Adom Bashforth Method for First Order Differential Equations with their Stability Analysis 10. Euler’s Modify Method.’ Information Theory’. Inc. Also find coefficient of skewness. 11.R. 2007.’Numerical Methods for scientific & engineering computations’. Measuring Information. Chi Square test. Random Variables and Random Processes and various Probability Distributions. Dover Publications. Finite Difference Method for Boundary Value Problem and Rayleigh Ritz’s method. Euler’s Method.. Sample mean. Different Interpolation Methods and the curve fitting.K. Little’s Theorem. 9) Study of Pro-Model simulation software used for queuing problems. maximum entropy 2) Joint entropy 3) Conditional entropy for the given information 7) For given data find the measures of central tendency and dispersion. 10) Demonstrate any simulation software for queuing applications to explore the software capability. 1985 3. 14. 9. Finite Element Ritz’s Method (Second Order Differential Equations only) 12. Sampling Distribution. Different Markov Systems. Wiley Eastern Ltd.K Iyengar & R . Difference operators. Markov Chain Formulation. Student’s t Test.’ Fundamentals of queuing theory’. and Harris C. Galarkin Method. Huffman Codes. Jain . Poisson Arrival Models. Sample variance. Entropy. Ash. Priority Queuing. Reservations and Polling. Robert B. Joint Entropy. 2. 13. M.A . M/G/1 Queues with Vacations. Conditional Entropy.. COMPUTER ENGINEERING Second Year Academic Year . John Wiley & Sons.6) Write a program which will find the 1) minimum. Gross D. S. 8) Write a program to find the binomial and poison probabilities by receiving input data from the user.
sequence detector 10. e. 3. 1981. Implement 3-bit. 11. Academic Press.Academic Press. 4. Decoder – e.’Simulation ‘. 3 . M. Verification of Logical Gates and Boolean Algebra. 5 .Cooper.O. R. shift register.4 bit counters.A . 2002.B. Allen. 4. Academic Press. 2 .(universal shift register) 7. 2nd Edition. Implement code conversion 8. II Sequential Circuit Design (Any six) 1.g. 2. Ross . Text Books COMPUTER ENGINEERING Second Year Academic Year . Conversion of flip-flops. by Pearson Education.g.Reference Books 1. A. S. 2.’Probability and Random Processes for electrical engineering’. Statistics and Queuing theory”. 2 bit comparator (IC 74138). Multiplexer .Ross. 16:1 Mux using 4:1 Mux (IC 74153). New York. Be able to design simple combinational circuit: half adder and subs tractor using VHDL language. Sequence detector (Mealy ckt) using JK flip-flop III ASM (Any one) Simple ASM using multiplexer controller method using Simulator. Pseudo random number generator using 74194. Use K-map for Simplification and designing of different combinational circuit.g. 1972 (Introductory) EC9992: Digital Electronics And Logic Design Objectives: To build and verify simple combinational and sequential circuits. sequence generator.. Code converters. List of Practicals I Combinational Logic Design 1. 2. Ripple (asynchronous) mod –N counter using J-K F-F. Excess-3 to BCD and vice versa using logical gates. Ripple (asynchronous) mod –N counter using IC 7490 4. Design ASM using simulator. e. ‘Probability models for computer science’. BCD adder –using IC 7483. Albert Leon-Gracia. 3. University of Toronto. 5. 9. Sequence generator using JK flip-flop 6.T. 2006.2009-10 Pattern .’ Introduction to Queuing theory’. Design of simple combinational circuit: half adder and subs tractor using VHDL language Outcomes: At the end of the course students will: 7. 5.M. McMillan .e.g. S. 2004. “Probability. Synchronous 2 bit Up /down counter using JK flip-flop . JK to D. Sequence detector (Moore ckt) using JK flip-flop 8.
4th Edition. J.240 . Tata McGraw Hill. Thomson Brooks/Cole (Vikas Publishing House. Donovan.07 .2002. Bignell. New Delhi). ISBN . DELMAR Thomson Learning.81 . Reference Books 1. "Digital Design". J. Leach. R.2009-10 Pattern . "Digital Logic: Applications and Design".352 . Malvino. 3rd Edition . ISBN 981 . Pearson Education. "Digital Principles and Applications". Jain. Tata McGraw-Hill. Pearson Education.240 .1.Principles and Practices". "Digital Electronics". Mano. 2002.P. M.4 2. 3rd Edition .A . J. ISBN 981 .047258 – 0 Second Year Engineering Second Semester (Theory Subjects ) COMPUTER ENGINEERING Second Year Academic Year . 2003.3 4. Yarbrough. "Modern Digital Electronics".062 . A.555 -0 2. ISBN 0 . R. "Digital Design . D. ISBN 0 07 .1 3.049492 . 5th Edition.7808 .2003. 2001. Wakerly.
binary trees and its representation using sequential and linked organization.II Prerequisites: Data structures and algorithms – I Aim : This course addresses techniques for programming with collections of data. Heap sorting. creation of binary Search tree. and the data structures and algorithms that are needed to implement these collections. Objectives: 1. Threaded binary trees. pre-order and post-order threaded binary tree. To choose the appropriate data structure for modeling a given problem. Symbol table.CS0192: Data Structures and Algorithms . Indexing techniques. Deletion of a node from a binary search tree. Binary search tree.A . To compare the benefits of static and dynamic data structures.tree. 3. 2. To study the representation. B. Unit 2 : Tree Applications ( 9 Hrs ) Applications of binary trees: Gaming. Creation and traversal of in-order. COMPUTER ENGINEERING Second Year Academic Year . implementation & applications of data structures. equal etc. Expression tree. finding height and counting leaf nodes of a binary search tree (with and without recursion). AA trees. OBST and Huffman’s algorithm (Dynamic Programming Strategy). binary tree traversals (recursive and non recursive).2009-10 Pattern . To compare alternative implementations of data structures. The course emphasizes the practical application of techniques for writing and analyzing programs. printing a tree level wise and depth wise. Insertion and deletion of nodes in threaded binary tree. Finding mirror image of the binary search tree with and without recursion. 4. full and complete binary trees. B+tree. operations such as copy. Creation of a binary tree. Unit 1 : Basic Trees (9 Hrs ) Review of basic terminology. red-black tree.
Use principles for good program design. Connected components and spanning trees. Files: Definition and concepts. Chaining with and without replacement. A.g. Unit 5 : Files ( 4 Hrs ) External storage devices.Tenenbaum. . Second Edition. folding and Mid square methods. Explanation of previous problems: OBST. binary search trees. Unit 6 : Dynamic Programming Strategy ( 6 Hrs) Problems based on Dynamic Programming Strategy (e. Text Books: 1. Use major techniques for implementing the fundamental data types (linked lists. 2002. Comparison with Greedy Strategy. Index-sequential and direct files. M. Collusion Resolution Strategies: Linear Probing.M. backtracking. divide and conquer. heaps.Dijkstra’s algorithm. rehashing. Outcomes: Upon completion of the course.2009-10 Pattern . Huffman and TSP as algorithms according to Dynamic Programming Strategy. Algorithm for shortest path. COMPUTER ENGINEERING Second Year Academic Year . 5. Kruskal’s and Prim’s algorithms for minimum spanning tree (Greedy Strategy). heaps. especially the uses of data abstraction and modular program composition. adjacency list. Implement specific data structures such as binary trees.Unit 3 : Graphs ( 10 Hrs ) Review of basic terminology. Pearson Education. binary search trees. ‘Data structures using C and C++’. Graph applications : Multistage Graph Problem and Travelling Salesperson Problem (Dynamic Programming Strategy) Unit 4 : Hashing ( 5 Hrs ) Hash tables. Table Overflow. Hash functions: Division. 4. Open addressing and Chaining. Flow shop scheduling). Implement specific algorithm design methods such as the greedy method.J. dynamic programming.) 3. Y. Extendible hashing. Langsam.A . etc. change coin problem. Traversals: Depth First and Breadth First. Understand how the choice of data structures and algorithm design methods impacts the performance of programs.Augenstein. and graphs. File organizations. and branch and bound. the students will be able to: 1. hashing. Processing of sequential. 0-1 knapsack. 2. Representation of graphs using adjacency matrix.
E. Pearson Education. 2002 2. ‘Data Structures in C++’.2009-10 (8 Hrs ) Pattern . Galgotia book source. 2nd Edition. Drozdek. 8288. 8286. TMH Publication. Internal Architecture. Assembler Directives.Rajasekaran. soresan. J. Addressing Modes. New Delhi. Galgotia book source. signal and interface with memory and I/O devices. Tremblay. Instruction sets. ‘An Introduction to data Structures with applications’. M. Reference Books : 1. Timing Diagram Read Write Machine Cycles. Thomson Brookes / COLE Books. 2nd Edition. 3. Sahani. 2nd Edition. INTR .NMI . ‘Data structures and Algorithm Analysis in C++’. Priority if interrupts. 4. 8284. New Delhi. Interrupt service Routine. 1984. Interrupt Response. 2002. LED’s. P. Sahani. 1998. Weiss. D. Flip-flops. A. Min Max Mode. Mehta. Even-Odd Memory Banks and Accessing Memory and I/O ports. Hardware and Software Interrupts. Interrupt Vector Table. ’Fundamentals of Computer Algorithms’. Unit 2: Assembly language programming of 8086 ( 7 Hrs ) Address Decoding. Objectives: To explore internal architecture of microprocessor. Unit 1: Introduction to 8086 microprocessor ( 7 Hrs ) Introduction to32 bit 8086 microprocessor. Basic Electronics Transistors Diodes. 1995. E.. CS0172 : Microprocessor Interfacing Techniques Prerequisites: Understanding of Digital Logic Circuits: Buffers. Unit 4: Interfacing with 8086-I COMPUTER ENGINEERING Second Year Academic Year . Horwitz .2. Pin Diagram. S. Shifters. Programmer’s model.A . Horwitz . Aim: To acquire knowledge of Microprocessors fundamentals. S. study of 8086 supporting chips 8282. Gates. Far near Procedures Unit 3: Interrupt structure of 8086 ( 6 Hrs ) Interrupt Structure . S. ’Fundamentals of Data Structures in C++’.
. Intel data manual on microprocessors Vol.EXE. Loading. TSR Structure. “ Advanced MS DOS Programming”.2009-10 Pattern .programming & interfacing”. INT 10H. Pearson Education . DOS calls-INT 25H. control word & interfacing Programmable peripheral interface (8255)-block diagram. Tata McGraw-Hill.Priority interrupt controller (8259)-block diagram. Internals. stepper motor in mode 0 Unit 5: Interfacing with 8086-II ( 8 Hrs ) Keyboard display interface (8279)-Block Diagram . . interfacing ADC. Ray Duncan. Loading & Writing TSR’s Outcomes: At the end of the course student will be able to design microprocessor based systems. Peter Abel “ Assembly Language Programming” . 2003. Students have a scope to further enhance their abilities in learning subjects like embedded systems. BPB publications. A. II COMPUTER ENGINEERING Second Year Academic Year . 5th Edition. PSP. ”Advanced microprocessors and peripherals :Architecture . “Microprocessors and Interfacing”. Type –active. 2nd Edition.A . McGraw Hill. INTEL – Microprocessor and Peripheral Handbook VOL I 4. Interfacing & programming Asynchronous . BIOS Calls. Text Books: 1. Douglas Hall.2002 2. 2. POST sequence. Memory Map.2nd Edition. cascade connections of PIC’s Programmable interrupt timer/counter (8254)-block diagram.COM. Synchronous Communication.2004 3. DAC. ray. K. Programming Unit 6: DOS and TSR’s ( 6 Hrs ) DOS.4th edition. TSR’s. RS 232C Universal synchronous asynchronous receiver transmitter 8251-Block Diagram. encoded & decoded mode. Bhurchandi. control word.2001 Reference Books: 1. passive. Interfacing.
friend function. pointers and classes. To understand algorithms to draw various graphics primitives. Extensions to C: Variable declarations. inline member functions. member access control-private. Limitations of procedural programming. 'const'. To understand basic concepts of computer graphics. Scope Resolution Operator Memory Management Operators. destructors. To understand inheritance. modular. 5. array of objects. data members and methods. function with default arguments. messages. Concept and need. Unit 2 : Inheritance ( 7 Hrs ) Function overloading: Function overloading. object-oriented and generic programming techniques. 2.2009-10 Pattern . Objectives: 1. 3. class as ADTs. Manipulators. methods. Classes and Objects: Defining a class. 4. polymorphisms. data encapsulation. default parameters.CS0182 : Object Oriented Programming And Computer Graphics Aim : The aim of this Syllabus is to teach students the basic concepts of Object Oriented Programming (OOP) and also about fundamentals of Computer Graphics. Unit 1 : Introduction to Object Oriented Programming ( 7 Hrs ) Introduction to procedural. global scope. file handling. templates. default and constant arguments. base and derived classes. single inheritance. reference variables. inheritance. Need of object-oriented programming. To understand 2-D and 3-D transformations. Local classes. data members. polymorphism. comments.A . classes. To understand basic concepts of Object Oriented Programming. fundamentals of object-oriented programming: objects. static data COMPUTER ENGINEERING Second Year Academic Year . types of inheritance. overloading. default and constant arguments. data abstraction and information hiding. access specifiers. friend classes. public & protected. inline functions. constructors & types.
Rotation. member function templates and template arguments. y or z axis. rotation about any axis not parallel x.A .2009-10 Pattern . vector generation. streams. multiple inheritance. aliasing and antialiasing techniques in graphics Curves and Fractals : Introduction.translation. Generation of line using DDA algorithm and Bresenham's line drawing algorithm. Flood fill. Bezier curves. Generation of circle using Bresenham's algorithm. Introduction. file modes.Polygon filling: Seed fill scan line algorithm. constructors in derived classes. Window clipping: Line clipping using Cohen Sutherland algorithm. classes and files. line segments. abstract base class. virtual base class. Curve generation. Unit 4 : Managing Console I/O Operations ( 7 Hrs ) Introduction. and virtual destructors. Operator Overloading: Introduction. Implement a subclass of the existing class in order to extend the functionality of the base class in order to solve the stated problem. interpolating polygons. students should be able to successfully complete: 1. Function template and class template. overloading using friends. creation and manipulation of files. C++ streams. 3D Transformations: Introduction. COMPUTER ENGINEERING Second Year Academic Year . B-Spline and corners. stream classes. 2. pointer to function and objects. rules for operator overloading. unformatted I/O. pure virtual functions. Polygon Clipping using Sutherland-Hodgman algorithm. 'this' pointer. 3. pointers and memory Management. static class. Virtual functions: Void pointers. detecting end-of-file. Need of operator overloading. type conversions. Reflection and Shear. Unit 3 : Polymorphism ( 7 Hrs ) Introduction. Error handling . formatted I/O and I/O manipulators Files and Streams: Concept of a file. container classes. Fractals. including the appropriate use of public and private methods and data. lines. fractal lines and surfaces. pointers to derived classes. compile time & run time polymorphism. Command Line Arguments Unit 5 : Fundamentals of Graphics ( 7 Hrs ) Introduction to computer graphics. Boundary fill. vectors. Outcomes: Upon completion of the course. structures and files. DDA algorithm and Mid point algorithm. interpolating algorithms. Scaling. overloading the assignment.members. pixels and frame buffers. sequential file processing Updating a file-Random access. static member functions. Unit 6 : 2D & 3D Transformations ( 7 Hrs ) 2D Transformations: Translation. primitives . function templates. file pointer. Correctly implement a class in the target language. scaling. 3-D geometry.ambiguity. Interpolation. Design and implement a reusable collection class (templates). binary and unary operators. function overloading vs. Edge fill. opening and closing a file. file operations.
Feiner. 2nd Edition.4. ISBN 0 – 07 -100472. Rogers. 2nd Edition.201 – 327554. D.2002. 5.794 – 4 7.6. ISBN 0 . "C++ Programming Language". Tata McGraw-Hill Publication. clipping. 2nd Edition.038 – 9. Pearson Education. F. TMH 4. Pearson Education. Tata McGraw-Hill Publication. S. "The Waite Group's Object oriented Programming in C++". ISBN 81 . 2nd Edition. "Object Oriented Programming with C++". Hughes. "Computer Graphics Principles and Practice". J. ISBN 0 . Adams. 2nd Edition. Hearn. Pearson Education. 2003 ISBN 81 . . S.462038 . Harrington. Baker.2009-10 Pattern . V.C Version".047371 – 4. 3rd Edition . Implementation of graphics primitives such as line drawing. Hill. J. "Computer Graphics McGraw-Hill Publications.A . polygon filling. Herbert Schildt. Lafore.048677 – 8. "Mathematical Elements for Computer Graphics".7808 .. 2nd Edition. COMPUTER ENGINEERING Second Year Academic Year . B. ISBN 0 .297 – 0181 – 2. Stroustrup. Tata McGraw-Hill Publishing Company Ltd. Reference Books: 1.07 .07 . Galgotia Publications. 3.2003. ISBN 81 7808 . Foley. 6. 2.. "Computer Graphics .07 ... 3rd Edition. R.” C++ Complete Reference”.X. Text Books : 1. J. D. 5. M. ISBN 81-7515-269-9. 8. Pearson Education.2001. 1987. Implementation of 2D & 3D concepts in computer graphics. Dam. New Delhi ISBN 0 . "Computer Graphics: Using OpenGL". "Procedural Elements for Computer Graphics". D. 2002. E. Rogers. 2. Balaguruswamy. 2001.1997.
Chains and Anti chains. Linear Recurrence COMPUTER ENGINEERING Second Year Academic Year . Universal and Existential Quantifiers. Job scheduling Problem.III Prerequisites: Engineering Mathematics.Set.A . Combination of sets. Set Theory . Proof Techniques. Prepositional calculus. Equivalence Relations and partitions. Logic and Proofs (7 Hrs) Propositions. Range. Recurrence Relation. Discrete Numeric functions and Generating functions. Mathematical Induction. Principle of inclusion and exclusion Unit-2. domain. Partial ordering relations and lattices.2009-10 Pattern . Definitions. The objective of the course is to achieve a fluency with Mathematical tools which is an essential weapon in modern Graduate Engineer’s Armory and the balance between the development of understanding and mastering of solution techniques with emphasis being on the development of student’s ability to use Mathematics with understanding to solve Engineering problems by retaining the philosophy of “learning by doing”. Pigeonhole Principle. Un-countably infinite sets.ES0132 : ENGINEERING MATHEMATICS . Properties of Binary Relations.I and Engineering Mathematics . Inverse and Composition.II Objectives: The course explains the importance and symbiosis between Mathematics and Engineering. Logical Connectivity. Finite and Infinite sets. Relations and Functions (7 Hrs) Definitions. Unit-1. Conditional Propositions. One-toOne and On-To. Proofs.
Laplace Transform of Unit step function. Cauchy’s Integral Theorem and formula. Modular Exponentiation. Homogeneous Solutions. Solutions by undetermined coefficients and Variation of Parameters method. Residue Theorem and applications to Engineering Problems. Mathematical Statements and connectivities. Introduction to Laplace Transform and its properties.A . solutions by the method of generating functions Unit-3. Unit-4. OUTCOMES: By the end of this module students are expected to demonstrate the knowledge of 1.Relations With constant Coefficients. Operations in Zn. Field. Introduction to Z Transform. Inverse Laplace Transform and its evaluation. Principle of inclusion and exclusion COMPUTER ENGINEERING Second Year Academic Year . Euclid's Algorithm. Inverse Z-Transform. Linear Differential equations of higher order (7 Hrs) Homogeneous Linear Differential Equations of Second Order. Fermat and Euler Theorems. Quantifiers. Complex Variables and Z Transform (7 Hrs) Derivative.2009-10 Pattern . Application of Fourier transform and Laplace Transform to Engineering Problems. Complex Integration. Fourier and Laplace Transform (7 Hrs) Complex Fourier series and frequency spectrum. Unit-5. Fourier integrals. Multiplicative and Additive Inverses. Congruence. Euler – Cauchy Equation. Unit-6. Algebra and Number Theory (7 Hrs) Groups. Set Theory. Modulo Arithmetic: Modulo Operator. Ring. Fourier cosine and sine transforms. properties of Z-Transform. Set of Residues. Application of system of ordinary differential equations. Total solutions. Chinese Remainder Algorithm. Cauchy-Riemann equations. Higher Order Homogeneous & Non Homogeneous Linear Differential Equations with Constant Coefficients. GF Fields. application of Z-transform to difference equations. Analytical function. Un-countably infinite sets. Delta function and periodic function. Primitive roots. Fourier transforms.
Binary Relations & its Properties. and Finney. Erwin Kreyszig. inc. ‘Higher Engineering Mathematics’.S. Michael D. ‘Applied Mathematics for Engineers and Physicists’. Academic Press.1981 2. Dennis G. ‘Mathematical Techniques for Engineers & scientists’. Spiegel ‘Advanced Calculus’ by [Schaum’s out line series]. 2003.A . Different types of Relations.. G. Prentice Hall International. 3rd Ed. Euclid's Algorithm.Greenberg. transform techniques and numerical methods. partitions. 8th Edition. 7. Fourier transforms and its properties.2003. TEXT BOOKS: 1. 5. Solutions of difference equations by using Z-transforms.’Calculus and analytic Geometry. 6th Ed.. Elementary knowledge of Group theory. McGrawHill Book Company.. Thomas.. Partial ordering relations and lattices. Philips. 6. 1984. ‘Advanced Engineering Mathematics’.2. B. Ray Wylie. Contour Integration. Grewal. 4. 1st Ed. (2nd Edition). Zill and Michael R. Chinese Remainder Algorithm 4. Application to solve Engineering problem. New Delhi. 2000. Andrews & Ronald L. ‘Advanced Engineering Mathematics’. Murray R. Pigeonhole Principle. Cauchy-Riemann equations. 7. (second Edition). Delhi. CBS New Delhi. B. Linear differential equations for modeling of a linear systems and its solutions by classical. 8. Functions. REFERENCE BOOKS: 1. COMPUTER ENGINEERING Second Year Academic Year . Alan Jeffrey. 3. (6th Edition) 1985. Larry C. 2002. ‘Advanced Engineering Mathematics’. 5. John Wiley and sons. Pipes and Harvill. Khanna Publishers. Cullen. Ltd. 2. Laplace Transform and its properties. PHI Pvt. ‘Advanced Engineering Mathematics’. Indian reprint by SPIE. Louis C Barrett R. 6. Wesley/Narosa. 38th Edition. 1998. Complex Fourier series and frequency spectrum. Primitive roots. 2005. C. ‘Advanced Engineering Mathematics’. 3.2009-10 Pattern . McGraw-Hill Book Company. 2000. Discrete Numeric functions and Generating functions.
2009-10 Pattern . 2001 11. 2nd edition. David M. New York. ‘The Theory of Numbers’ John Wiley & Sons Inc. survey of communication applications. IFT and properties of Fourier transform. Bandwidth Introduction to Fourier Series. Application of the above mentioned concepts in the real world 4. ‘Discrete Mathematical Structures with applications to Computer Science’.2005. modulation 2. Tata Mcgraw-Hill. Tremblay and Manohar. Zuckerman and Hugh L. EC4882: Principles of Communication Engineering Aim : To gain proficiency in electronic communication concepts to be applied in advanced networking domains Objectives: 1. 10. Unit 2 : Modulation Techniques ( 7 Hrs) COMPUTER ENGINEERING Second Year Academic Year .1995. Introduction to Computer Networks Unit 1 : Introduction to Electronic Communication ( 7 Hrs) The importance of Communication. Montgomery. To understand the basics of signals .A . Elements of communication system. ‘Elementary Number Theory’.9. Fifth Edition. Ivan Niven.DFT. Burton. Types of electronics communication. 23rd Reprint. Mcgraw Hill Inc New York. Fourier Transform. Understand multiplexing techniques 3. Electromagnetic spectrum. Herbert S.
Delta modulation. sideband and modulation index. Kennedy. Intermediate frequency selection and Images. Pulse code modulation. AM transmitters and Receivers Frequency modulation principles. Phase modulation. ASK. Communication Electronics Principles and Applications. Principles of Communication Systems. Single sideband communication. Fibre Optic communication ( 7 Hrs) Outcomes: A student well equipped with the required knowledge and fundamentals to understand and gain insight into advanced computer network courses Text Books : 1. Unit 4 : Data Communication Digital Communication concepts. Principles of Communication 2. Unit 3 : Multiplexing and Telephony ( 7 Hrs) Introduction. McGraw Hill 3. Sampling theorem Transmission lines Telephone System. Paging System. Cellular Telephone System. Taub and Schilling. Frenzel. Checksum Introduction to Computer Networks : OSI model. ISB modulation. Spread Spectrum. PAM. Fascimile. Data and Computer Communication COMPUTER ENGINEERING Second Year Academic Year . CRC. Roddy Coolen. Behrouz Ferouzan. TDM. Modulation index and percentage of modulation. FSK Error detection and correction: LRC. PSK. TV receiver Receivers : Superheterodyne receiver. Electronic Communication Reference Books : 1. Hamming code.A . Third Edition. FM vs AM Examples : TV signal. 2. Null modems. Modems.2009-10 Pattern . VRC. AM power distribution.. Frequency conversion. Tata McGraw Hill Publication. FM with binary signals.Principles of Amplitude Modulation. FDM .
Second Year Engineering Second Semester (Practicals) COMPUTER ENGINEERING Second Year Academic Year .2009-10 Pattern .A .
7.A . To compare the benefits of static and dynamic data structures. The course emphasizes the practical application of techniques for writing and analyzing programs. COMPUTER ENGINEERING Second Year Academic Year . 6. To study the representation. To compare alternative implementations of data structures. To choose the appropriate data structure for modeling a given problem. both by recursion and non-recursion.CS5162 : Data Structures And Algorithms . Write a C program to create a binary tree and traverse it in preorder. 2. implementation & applications of data structures. List of Practicals 1. Objectives: 5. postorder and inorder way. and the data structures and algorithms that are needed to implement these collections. 8. Write a C program to create a binary search tree and perform insertion and deletion of a node in it.2009-10 Pattern .II Prerequisites : Data structures and algorithms – I Aim : This course addresses techniques for programming with collections of data.
Write a C program for implementation of direct access file – Insertion and deletion of a record from a direct access file chaining with or without replacement. 8. 9. 10. Use major techniques for implementing the fundamental data types (linked lists. hashing. 6. delete and modify operations on it. Text Books: COMPUTER ENGINEERING Second Year Academic Year . 14. Print original and mirror image level wise. Write a C program to create a binary search tree and find height & number of leaf nodes with and without recursion and print leaf nodes also. lines and white spaces and write these results into another text file. Find its mirror image. read it and compute frequency of vowels. Implement specific algorithm design methods such as the greedy method. Use command line arguments. Write a C program to implement Heap Sort. Write a C program to create a text file. 9. 12. the students will be able to: 6. delete and modify. Use principles for good program design. Write a C program to create an inorder threaded binary tree and perform all three traversals. Write a C program for implementation of simple index file and perform insertion of record. 11. 10. characters. Write a C program for implementation of sequential file and perform insertion of record. Write a C program to represent a given graph using adjacency array and find the shortest path using Dijkstra algorithms.3. 7. especially the uses of data abstraction and modular program composition.2009-10 Pattern . Write a C program to create a hash table and handle the collisions using linear probing with or without replacement. heaps. Write a C program to create a hash table and handle the collisions using chaining with or without replacement. etc. binary search trees. Write a C program to represent a given graph using adjacency list and generate a minimum spanning tree using Kruskal’s algorithm. Write a C program to implement Hufffman’s algorithm. and graphs. Write a C program to create a binary search tree. 16. Understand how the choice of data structures and algorithm design methods impacts the performance of programs. 4. 13. and branch and bound. Outcomes: Upon completion of the course. 15. Write a C program to represent a given graph using adjacency array and generate a minimum spanning tree using Prim’s algorithms. Write a C program to represent a given graph using adjacency list and perform DFS and BFS. 7.) 8. dynamic programming. heaps. Mini project which will make use of different data structures learnt in this subject. 17. divide and conquer. count words. binary search trees. 18. display. 5. search operations on it. display.A . Implement specific data structures such as binary trees. backtracking.
Basic Electronics Transistors Diodes. CS5172: Microprocessor Interfacing Laboratory Prerequisites: Understanding of Digital Logic Circuits: Buffers.M. 2nd Edition. Shifters. P. Weiss. 2002 2.Augenstein. 2nd Edition. D. A. soresan. Sahani. Use debugger to show execution of program. Y..1. Write 8086 Assembly language program to access marks of 5 subjects stored in array and find overall percentage and display grade according to it. 1984.Tenenbaum.( Any 6) 1. 3. Write 8086 ALP to perform block transfer operation.J. Drozdek. M. Second Edition. M. List of Practicals Group A:. ‘An Introduction to data Structures with applications’. Tremblay. Galgotia book source. 2. 2002. A. 3. COMPUTER ENGINEERING Second Year Academic Year . 2nd Edition. Horwitz . TMH Publication. Study of 8086 Architecture and Execution of sample programs. Flip-flops. LED’s Objectives: To study programming model of 8086 and assembly language programming. Pearson Education. J. ‘Data structures using C and C++’. Reference Books : 1. New Delhi. Mehta.. Gates. Thomson Brookes / COLE Books. Langsam.A .2009-10 Pattern . ’fundamentals of Data Structures in C++’. 2. Pearson Education. 2002.(Don’t use string operations) Data bytes in a block stored in one array transfer to another array. S. ‘Data structures and Algorithm Analysis in C++’. E. 4 Write 8086 ALP to find and count negative number from the array of signed number stored in memory. 1995. ‘Data Structures in C++’.
Write 8086 ALP to interface DAC & generate following waveforms on oscilloscope. buffers. 14. Write 8086 ALP to program 8253 in Mode 0 .Variable Duty Cycle & frequency. 3. Character in left entry mode 2. COMPUTER ENGINEERING Second Year Academic Year .A . Arrange in descending 6. Comment on types of DAC’s and write detailed specifications of the DAC used i) Square wave -. characters Group B:. 13. 8Kb Scratch Pad RAM 2. 1. Write 8086 ALP to convert an analog signal in the range of 0V to 5V to its corresponding digital signal using successive approximation ADC.5. power on RESET. 11. Assume that the first location in the array holds the number of elements in the array and successive memory location will have actual array elements. If user enters 1. . a.(Any 6) 10. I/O Devices: six 7 Segment Displays and Hex Key Pad through 8279. Rolling Display 3. a. Arrange in ascending b. Perform an experiment to establish communication between two USART’s Initialize USART-A in asynchronous transmitter mode and interface USART-B by initializing it in asynchronous receiver mode.2009-10 Pattern . system clock. latches. Write 8086 Alp to convert 2_digit HEX number into equivalent BCD number. Write 8086 ALP to rotate a stepper motor for a) one clockwise rotation b) one anti clockwise rotation Write routines to accelerate and de-accelerate the motor Modify your program to rotate stepper motor for given angle and given direction. 7. Memory:16Kb Monitor program in ROM. Write 8086 ALP to convert 2_digit BCD number into equivalent HEX number. Draw the entire system block diagram showing the details of memory decoding. Peripherals: 8255. Accept a key from the user. Concatenation of two strings b. Write 8086 Assembly language program (ALP) to arrange the numbers stored in the array in ascending as well as descending order. ii) Stair case wave iii) Triangular wave 12. 8. Find number of words. 16. If user enters 0. Write 8086 Assembly language program (ALP) for following operations on the string entered by the user. chip selection logic. Write 8086 ALP to initialize 8279 & to display characters in right entry mode. Write a separate subroutine to arrange the numbers in ascending and descending order. address data and Control lines. 8253. Consider 8086 based microprocessor system with following specifications: 1. Flashing Display 15. Provide also the facility to display “SECOMP”. Generate a square wave with a pulse of 10 mS.
18. Write TSR program in 8086 ALP to handle the “Divide by zero” interrupts. Test your program with a small code, which causes the divide by zero interrupt. 19 Write TSR program in 8086 ALP to implement Real Time Clock (RTC). Read the Real Time from CMOS chip by suitable INT & FUNCTION & display the RTC at the bottom right corner on the screen. Access the video RAM directly in your routine. Note: - Students should perform any 6 assignments from group A and any 6 assignments from group B
Outcomes: At the end of course, student should get well acquaint with assembly language programming and concepts of TSR‘s. Text books: 1 Douglas Hall,’Microprocessors and Interfacing’, McGraw Hill, 2nd Edition. 2 Ray Duncan, ‘Advanced MS DOS Programming’, Latest Edition. Reference Books: 1 Peter Abel, “Assembly Language Programming”, Pearson Education, 5th Edition. 2 INTEL – Microprocessor and Peripheral Handbook VOL I
CS5182 : Object Oriented Programming And Computer Graphics
Aim : The aim of this Syllabus is to teach students the basic concepts of Object Oriented Programming (OOP) and also about fundamentals of Computer Graphics. Objectives: 6. To understand basic concepts of Object Oriented Programming. 7. To understand inheritance, polymorphisms, templates, file handling. 8. To understand basic concepts of computer graphics. 9. To understand algorithms to draw various graphics primitives. 10. To understand 2-D and 3-D transformations. List of Practicals Group A 1. Write a program for implementation of constructors, destructors, new, delete operators.
COMPUTER ENGINEERING Second Year Academic Year - 2009-10 Pattern - A
2. Write a program for implementing function overloading and function with default argument. 3. Write a program to implement friend function, function overloading, function with default arguments, constructors etc. 4. Write a program to create a database of any information system and provide the facilities for Insertion, Deletion, Modification, Search and Display using multiple inheritance. 5. Write a program to implement hybrid inheritance. 6. Write a program to implement class for overloading ‘-(hyphen)’, ‘++’,’--‘, ‘+’, ‘-‘, ‘<<’,’=’,’==’ and ‘>>’ operators. 7. Write a program to implement virtual function. 8. Write a program to perform various operations by using Templates.
9. Declare class ‘STACK’ and ‘QUEUE’ and handle the run time anomalies .
10. Write a program to maintain the details of any system using files. Implement functions to add, delete, modify, search and display records. 11. Write a program for file handling by using virtual function. Group B 1. Write a program to draw any shape using Graphics Primitives such as Pixel, Line, Circle, Ellipse, Polygons, and Line styles. 2. Write a program to draw any shape using DDA & Bresenham’s line algorithm. 3. Write a program to draw any shape using DDA,Bresenham’s & Mid point circle algorithm.
4. Write a program to implement algorithm for filling a polygon using a) scan line method. b) Flood fill c) Edge fill d) Boundary fill 5. Write a program to implement Line clipping using Cohen Sutherland algorithm. 6. Write a program to implement Polygon clipping using Sutherland Hodgman algorithm.
COMPUTER ENGINEERING Second Year Academic Year - 2009-10 Pattern - A
7. Write a program to implement 2-D transformations such as translation, rotation, scaling shearing. 8. Write a program to implement 3-D transformations such as translation, rotation, scaling shearing.
Outcomes: Upon completion of the course, students should be able to successfully complete: 6. Correctly implement a class in the target language, including the appropriate use of public and private methods and data. 7. Implement a subclass of the existing class in order to extend the functionality of the base class in order to solve the stated problem. 8. Design and implement a reusable collection class (templates), creation and manipulation of files. 9. Implementation of graphics primitives such as line drawing, polygon filling, clipping. 5. Implementation of 2D & 3D concepts in computer graphics Text Books : 1.E. Balaguruswamy, "Object Oriented Programming with C++", Tata McGraw-Hill Publishing Company Ltd, New Delhi ISBN 0 - 07 - 462038 - X. 2. S. Harrington, "Computer Graphics McGraw-Hill Publications, 2nd Edition, 1987, ISBN 0 – 07 -100472- 6, Reference Books: 1. R. Lafore, "The Waite Group's Object oriented Programming in C++", Galgotia Publications, 3rd Edition ,2001, ISBN 81-7515-269-9. 2. B. Stroustrup, "C++ Programming Language", Pearson Education, , 3rd Edition.,1997, ISBN 0 - 201 – 327554. 3. Herbert Schildt,” C++ Complete Reference”, TMH 4. D. Rogers, "Procedural Elements for Computer Graphics", Tata McGraw-Hill Publication, 2nd Edition ,2001, ISBN 0 - 07 - 047371 – 4,. 5. J. Foley, V. Dam, S. Feiner, J. Hughes, "Computer Graphics Principles and Practice", Pearson Education, 2nd Edition.,2003, ISBN 81 - 7808 - 038 – 9. 6. F. Hill, "Computer Graphics: Using OpenGL", Pearson Education, 2nd Edition., 2003 ISBN 81 - 297 – 0181 – 2, 7. D. Hearn, M. Baker, "Computer Graphics - C Version", Pearson Education, 2nd Edition’ ,2002, ISBN 81 7808 - 794 – 4,
COMPUTER ENGINEERING Second Year Academic Year - 2009-10 Pattern - A
Rogers. D. ISBN 0 . Adams.048677 – 8.2009-10 Pattern . 9. Kanetkar. 2nd Edition..’ Let us C++ Department of Computer Engineering COMPUTER ENGINEERING Second Year Academic Year . "Mathematical Elements for Computer Graphics".07 .A . J.8. Tata McGrawHill Publication.2002.
2009-10 Pattern . and COMPUTER ENGINEERING Second Year Academic Year .A . Software application covered in this course includes Microsoft Word.Professional Development Subjects CS 775: Electronic Data Processing Aim : This course aim at develop student for professional handling of software applications. Microsoft Excel.
Using the Thesaurus. word count. Creating a Web Presentation. Introduction to MS Word .Develop and enhance presentations with PowerPoint 4. Working with a Presentation. Objectives: 1. keyboard shortcuts Working with single and multiple workbook . tables and charts. Worksheet basics and advance concepts. Unit 1:Word Processing (4 Hrs) MS Word : Introduction to Word Processing . Outlining Your Ideas. page break. Adobe Photoshop. goal seek. Unit 2: Spreadsheet (4 Hrs) MS Excel .Opening Multi document windows. Unit 4:Photoshop (4 Hrs) Basic Photo Corrections . Checking the grammar and spelling.2009-10 Pattern . Auto Complete and Auto Text. table of contents. Rich Text Format.Working with formulas & cell referencing. Using Auto Correct. Unit 3: Business Presentation (4 Hrs) PowerPoint: Creating a Presentation. Converting a word document into various formats like .. Multiple worksheets. conditional formatting . Presenting Information in Tables and Columns. Demonstrate the use of fundamental concepts of various software packages such as word processing. pivot chart report. Formatting of worksheet. Working with Charts. 2. This training program includes the main features of Adobe Photoshop. Database . Formatting via find and replace . Collaborating with Others.using wizards. what if analysis. Handling Graphics.creation. Layer Basics . bookmark. Autosum .creating and Using Macros. Applying and Modifying Design Templates. Viewing and Changing Presentation Colours. custom animation. 3. Mail merge.Microsoft PowerPoint. Adding and Modifying Slide Text. auto summarize. Teaching methodology includes a combination of lecture and hands-on instruction to facilitate active learning. Cultivate a deeper understanding of advanced uses of Microsoft Excel for complicated decision-making and information analysis scenarios.Text. Toolbars and Menus. Using Scenario Manager. Page setting. Basic Pen Tool Techniques . Build spreadsheets and charts with Excel .Editing a Document . WordPerfect. Advanced COMPUTER ENGINEERING Second Year Academic Year . multiple columns . Working with Selections . Functions . Printing a Presentation. hyperlink.headers and footers. Working with Graphics. various charts type. Painting and Editing . formula auditing. Inserting Information into PowerPoint. HTML etc. Creating a Multimedia Presentation. Masks and Channels . Hyphenating.rehearse timing. Photoshop is the defacto image-editing solution and its strength lies in the ability to take images from a wide variety of sources and adjust or manipulate these images at a pixel level to achieve desired results from simple tonal adjustments through to complex image montages. Formatting Documents . query & filtering a database . To experience the basics of word processing concepts application and practically learning ms-word and learn to obtain maximum benefit from it.concepts. Graphs and charts. mailing labels Wizards and Templates.A . Retouching and Repairing . Working with Documents on the Web. Setting Up and Delivering a Slide Show. Creating worksheet. sorting.
lighting. Prepare a short (8 -10 slides) presentation on a topic of your choice. Create invitation card using different styles and graphics using word. 3. Preparing Images for Two-Color Printing . Font type and size. 10. white space. use of graphics. Students are able to prepare business presentation effectively. User manual v.2009-10 Pattern . Work progress report 3. Create a powepoint presentation about any historical place using custom animation.photo composition. graphics. Students are able to create spreadsheet and charts very effectively. Student will submit one business document from the following i. Create documents using word standard wizard. 3. and so on). Creating Animated Images for the Web Electronic Data Processing(Lab) LIST OF PRACTICAL ASSIGNMENTS: (16 Sessions of 2 hours each) 1. Outcomes: Upon successfully completing this course the student will: 1. 6.Layer Techniques . Perform basic image manipulation using . 5. Optimizing Web Images and Image Maps . Create a document like news paper for printing any news. 2. Your presentation will be graded on how well it follows the “do’s” of a good presentation (e.A . use of bullets/numbers. 2. Photo processing using photoshop. Create a small magazine using word. 4. color. Create business letters (circular . Product brochure iii. templates and rules. COMPUTER ENGINEERING Second Year Academic Year . and animation where they apply to the topic). Creating Special Effects. and can be easily read. A representative official correspondence ii. transitions.photo composition. autofilter. 6. Good presentations are those that are interesting. 5. Create database for list of equipment of your lab and apply database query and sorting. 11. Literature survey on any one topic iv. 8. Create timetable for your course using excel.g.function and tools. Technical help 2. 9. Create report for result analysis of any course insert graph and worksheet in word document. Prepare charts (5 standard and 5 custom charts) of for sale of different cars product wise in India and comparison of car features based on standard specification. hold your audiences attention. Student will submit one technical document from the following: i. Project proposal ii.note) using word. function. Be able to generate professional reports using word processing techniques. with sound effects . setup show. 7. Minutes of meeting iii. use bullet points. 4. Create result analysis using formula.
Leon Techworld Pub. Reference Books: 1. (1999): Information Technology “O” level made simple. BPB Pub. Objectives: COMPUTER ENGINEERING Second Year Academic Year .McGraw Hill. O'Leary and Linda I. V.A .K. 2. and output images for print. Alexis Leon and Mathews Leon (1999):Fundamentals of information technology. web. 2. 5. adjust or manipulate these images at a pixel level to achieve desired results Text Books : 1. Jain.2009-10 Pattern .K.ISBN: 0-07-329452-7 CS 776: Code Tuning Techniques Aim : To create high quality software code and to do your work more quickly and with fewer mistakes.4. (2000): “O” Level Personal Computer Software. S. manipulate. and other digital media. O'Leary . 2008 . Microsoft Office 2007: Excel by Timothy J. Jain. BPB Pub. Understand and be able to use Adobe Photoshop to scan.
Power of Variable names. Self Documenting Code.A . defensive programming. Key construction decisions. Unit 5 : System Considerations (7 Hrs) How program size affects Construction. Unit 1: Laying the Foundation ( 9 Hrs ) Introduction. Code Tuning Techniques. Unit 3 : Statements (7 Hrs) Organizing Straight-Line code. Integration. Unit 6 : Software Craftmanship (7 Hrs) Layout and Style. Developer Testing. Outcome: At the conclusion of the course student would be able to Keep big projects under control and help maintain and modify software successfully as the demands of the project change. Analyzing various data types. Design in Code construction. Debugging. Managing Construction. Unusual control Structures. Using Conditionals. Unit 4 : Code Improvements (7 Hrs) Software Quality Landscape.1. Collaborative Construction. Programming Tools.2009-10 Pattern . high quality routines. Note : The laboratory work for this course will consist of viewing code written in other laboratories and finding out the improvements possible from the view point of this course. Text Books : COMPUTER ENGINEERING Second Year Academic Year . Upstream prerequisites. Themes in Software Craftmanship. Unit 2: Variables (4 Hrs) General issues in using variables. working classes. To give insight into why a programmer has had problems in the past and to show how to avoid problems in the future. General Control Issues. Personal Character. Table Driven methods. Code Tuning Strategies. Refactoring. Controlling Loops.
2006. Student should understand the importance of documentation. Steve McConnell . 2. “Code Complete”. Student should learn Latex. Microsoft Press. Objectives 1. COMPUTER ENGINEERING Second Year Academic Year .2009-10 Pattern . CS 777:Document Preparation System Theory : 1Hour Aim : Should use & understand document preparation system.1.A . 2nd Edition.
Unit 1. Unit 4 : Document formatting (4 Hrs) Lists. . Arrays & delimiters. maps. Working with special characters. 11. Creating slides. Is it necessary to use Latex for creating the letter ? Justify . Student should use latex for documentation. COMPUTER ENGINEERING Second Year Academic Year . Basic mathematics. Counters. Installation of any latex software (e. Defining new commands.. Alternative output formats like dvi. incorporating Images.Starting a new project.doc. 15.png.etc) 9. etc. etc. g Texnic. What is Documentation? Documentation Overview.g Texnic Center. Unit 3 : Commands Overview ( 4Hrs) Simple Font changing commands. Different tools available for documentation (MSWord).ps file for IEEE Paper presentation 14. Editors for Latex (e. Create a .pdf. Latexing & viewing document. Write any seminar report using . Creating new documents.pdf/ . Study of different latex softwares e. Components of Documentation (e.A . chart. . Page formatting commands. g Texnic.pdf file format.ps. Conditionals. graphs. Figures & tables. Create a MS-word document which includes image. table. Texmaker) 4. 6. Unit 2 : Introduction to Latex (3 Hrs) What is Laex? Pros & Cons of Latex.rtf. 7. graph. Create your own class file & use it in a document. . Create a pdf which contains a slide show (al least for 10 slides) 12.jpeg. Commands. Typing in the source code. 13.dvi. 2.ps. Introduction to documentation (3 Hrs) Need of the documentation. Environments. Create a pdf file which contains different mathematical oprations. Create a pdf which contains a Graph using GnuPlot. 10. Class files & sectioning commands.) Application areas for documentation. Tabulated material. List of Practical 1. Multiline Formulae. Cross Referencing. Writing packages & class files. .pdf. Texmaker) 3. Create your resume using pdf file format. Create a pdf which generates List of Tables (At least 3 tables in different format are expected) 8. pictures. Boxes & minipages. Create a simple official/formal letter using any documentation software. etc 5.g. Study of GnuPLot. TexMaker) Using Texnic Center : . Citation.3.2009-10 Pattern . Create a pdf which generates List of Figures (At least 3 figures in different format are expected-. Study of different document file formats like .
Objectives: COMPUTER ENGINEERING Second Year Academic Year .2009-10 Pattern .CS 778: Linux Operating System Prerequisites: Familiarity with Computer Operations Aim: To enhance the value of computer users by gaining an additional set of skill and qualification in the fastest growing Linux Operating System in the world.A .
A . script File & Directory manipulation under Linux: File Concepts.Changing File and Directory Permissions . top. who. Archiving utilities.Multitasking and Multi-user system . the GUI under Linux Unit 2 : Basic and Advanced commands ( 4 Hrs ) ( 2 Hrs ) Introduction and Installation: Unix and Linux History.2009-10 ( 3 Hrs ) Pattern ..Using Other Editors ( 3 Hrs ) Filter and Redirection:Concepts.Control structures: if.Role of Shell.head.Variables. copy. diff. jobs.Important concepts in a Linux environment –Login. Unit 1: Introduction to Linux and Opensource . Different types of shells . less. Login scripts and Profiles.etc. nice. date. Create. copy. changing & printing directory Working with Linux Permissions and process: Understanding Permissions .Positional Parameters. for. batch Unit 3 :Filter & Vi Editor Redirection Creating and Viewing Files :Using the vi Editor . Prepares the student for Linux administration. passwd. cal. remove.Process related commands: ps. who..tar. more. passwd. X window system.Changing Ownership and Group.Writing different shell scripts Unit 5 : AWK programming & Programming in Linux COMPUTER ENGINEERING Second Year Academic Year . uniq.File System / Directory Structure . tail. while . gzip/gunzip.Linux Installation Unix Architecture: Kernel. pr. cal. wc. cut. comm. bc uname. tee. fg. at. listing. Licensing. Teaches the fundamentals of Linux operating system. Why Linux?. cat. Shell and Applications -Role of Kernel . FSF/GNU Basic commands: Command Structure . rename. paste. kill. clear. cmp . less.man.ls. bc .1. delete and move file.Different Linux distributions . sort. tty. cat. bg. wc.Create.Process Basics. 2. tar. Pipe and i/o Unit 4 : Shell-Scripting ( 2 Hrs ) Introduction to shell scripts.uname. date.case. grep.
2009-10 Pattern .A . source package installation. groupdel . Shell Program to check file permissions b. Execution of advanced Linux commands.Boot loader management: Understanding the lilo and grub boot loader and its configuration files Linux Operating System LAB 1. Execution of advanced Linux commands. a.Java programming Unit 6 : Basic System Administration ( 2 Hrs ) root: The System Administration login.Managing Users and Groups: using command like adduser. IP address of the machine.Writing simple AWK Program.Basic Network Setup: Setting hostname. Shell program to display System date wise messages. 11.Getting Started with awk .Setting a dialup connection. 10. Shell Program for bubble sort Generate a student report using AWK programming Generate a employee report using AWK programming Managing Users and Groups and Basic Network Setup Installation and setup of Linux-java package and Java & C program execution.The Administration Privileges.BEGIN and END block. 4.Installing and removing packages:Using the RPM. groupadd. Shell Program to print number in reverse order 7. 2. userdel. 3. List of Practicals Installation of Linux Execution of basic Linux commands.Mounting and Unmounting File System. 8. COMPUTER ENGINEERING Second Year Academic Year . Shell Program to perform arithmetic operations using case statement 9. 6. 12. 5.Control Statements in Actions. 13.Variables. Shell Program to check string is palindrome or not. Working on vi editor a. b.Managing Partitions understanding the /etc/fstab .C programming.
Thomson Brooks cole. 1st edition. Telnet and WWW servers.A COMPUTER . 2003. CS 779:NETWORK ADMINISTRATION Objective 1. 4. Install and configure system software. Das Sumitabha. X. Australia.1996. 2. FTP.2009-10 Pattern . 2. Manage a TCP/IP Ethernet network. students will gain user level knowledge and hands on experience in the Linux operating system. Manage user accounts. Yashavant Kanetkar. 5. Tata McGraw Hill. 1st edition. 2.1st edition. Text Books: 1. Henry McGilton. 2003. Forouzan B A. “Introducing Unix System V”. “Unix Concepts and Applications”. “Unix Shell Programming”. Configure and manage DNS. Reference Books: 1.Outcomes: After attending the course. Mail.1987. Rachel Morgan. Understand Unix and Windows file systems.international edition. 3. Gilberg R F.. “Unix And Shell Programming”. BPB Publications. 3rd Edition. ENGINEERING Second Year Academic Year .
Booting Up and Shutting Down Creating a small network COMPUTER ENGINEERING Second Year Academic Year . WINS.Setting Password Requirements.Root.Patches . DHCP. Authenticity.DHCP and Bootp . Kerberos. Denial of Service (DOS).Setting Properties for User Accounts Using Groups to Organize User Accounts Introduction to Groups.Configuring and Managing Print Services • System and Network Security FireWalls .Using a virtual host to maintain a website . Worms.Privileges .A . IMAP. DNS.Viruses.6.the basics . Administrator.2009-10 Pattern .Configuring and Managing Windows Active Directory and Domains .Automatic IP assignment .Physical Security . Encryption. Buffer Overflows Implementing a LAN with Client and Server installation LINUX SERVER System Architectural Overview . Certificates. Telnet.Creating a Domain User Account . + .Implementing Groups Implementing Local Groups. Workgroups and Domains Configuring the Domain Controller • Setting Up User Accounts Introduction to User Accounts. Public Key. PGP.Privileged Users .Installing Linux .POP.Requirements for New User Accounts. other • Windows Active Directory. Create and Maintain Secure Systems. Trojan Horses. WWW.Cryptography.Implementing Group Strategies. e mail . WINDOWS SERVER • • Installing Windows 2000/2003 Server Operating System Managing Network Services FTP.Implementing Built-in Groups • Networking Intermediate Domain Name Registration .Configuring and Managing email .Configuring and Managing DNS .
Telnet. DHCP. IMAP services in Linux. DNS.Batch. Prepare for backing up data by identifying the folders to back up and the backup type and backup media to use. Workgroups and Domains Creating users. Telnet.I. Types of Processes System User. Restore entire volumes or a single file of data. Assign unique IP addresses and share C drive on each machine. Back up data at a computer and over a network. e mail .A . Windows Active Directory. Use protocol analyzer Software Installation of Windows 2000/2003/2007 Server Configuring FTP. Install LAN Cards and Crimp the connectors. students will be able to: Identify the purpose of backing up and restoring data and the permissions required for these tasks. Creating users.Priorities. DHCP. Test the network by using PING command. permissions in Linux Installing and configuring firewall in Windows and Linux Network Monitoring and analyzing traffic using Wireshark • • • COMPUTER ENGINEERING Second Year Academic Year . Definition B.2009-10 Pattern .POP. WWW. WINS. Managing Processes Outcome After completing this module. DNS.Scheduling C. e mail . permissions using active directory • • • • • Installation of Linux Server Operating System Configuring FTP. IMAP services.Real-time. Monitoring Processes D. Use Lan Card. policies. policies. LABORATORY ASSIGNMENTS • Set up a small network of 3 to 4 computers and Hub/Switch.POP. WINS. WWW. Processes/ Daemons A. UTP Cables and Connectors.
Capacitors and Inductors. Display devices: LED (Light Emitting Diode).A . Transistors. BCD To seven segment display. FET and Relays. Unit 2: Power supply COMPUTER ENGINEERING Second Year Academic Year . IC 555.CS780: PCB designing and circuit Building Aim: To get introduced to electronic components power supply requirements to build small electronic circuits Objectives: To study regulator or circuits using IC555.2009-10 Pattern . Introduction to Logical Gates and Integrated. LCD (Liquid Crystal Display). which the students would be able to use in robotics as a PD course Unit 1: Introduction of electronics components Introduction to Passive Devices: Registers. Introduction to Active Devices: Diodes.
Adapters. Rectifiers (Half wave Rectifier. Filter Design: Low pass.Transformer. shunt regulators). Transferring the Artwork. Outcomes: At the end of the course students will: i) Study basic electronics components ii) Get introduced to power supply iii) Study applications using Op amps iv) Study PCB design and implement circuits using simulator Text Books 1) Boylestad R & Nashelsky L: Electronic Devices And Circuits.3815 MIL 005084) Handbook on passive components CLR: Author Fagerholt Complete PCB Design Using Orcad Capture and Layout by Kraig Mitzner (Laboratory): Aim: To get introduced to electronic components. Multi Layer. Reference Books i) ii) iii) iv) Power Electronics. Gold plated. Op-Amps. Drilling. High Pass. Uninterruptible Power supply (UPS). Circuits. Bridge wave Rectifier. Subtractor ckt. Devices and Applications. Unit 4: Printed Circuits Board (PCB) Preparing a useful Schematic Diagram. Double sided laminated. Smoothing circuits. Unit 3: Active circuits RC Filters – Low Pass. Soldering Different methods of PCB Techniques (Conventional. 1976. Surface mount technology (SMT). Muhammad H Millman J & Halkias C C: Electronic Devices And Circuits. Regulators (Zener diode regulator. 0-07-Y85505-6 Rs. Unity. OP-AMP and Integrated Circuits PHI. New De.NJ: Pearson education.2003 Rashid. power supply requirements and build small electronic circuits Objectives: To build regulator or circuits using IC555. High Pass design. Full wave Rectifier. SMPS. Difference amplifiers. Etching. Chip on Board) Introduction to PCB Design Softwares.. Mcgraw Hill Book Co. series.. New York. 2) Ramakant Gaikwad. which the students COMPUTER ENGINEERING Second Year Academic Year . 1991.2009-10 Pattern . 3rd ed.10 --(621. Flexible PCB. Preparing for image transfer. Drawing the PCB Artwork.A . Adder.. IC 78XX. Prentice Hall Of India. Gain. Techniques for designing PCB Artwork. 243. Inverters.
New De.2009-10 Pattern . Soldering 13 Testing of PCB 14.CRO. 3rd ed. IC Tester. OP-AMP and Integrated Circuits PHI.10 --(621. LED.3815 MIL 005084) Handbook on passive components CLR: Author Fagerholt Complete PCB Design Using Orcad Capture and Layout by Kraig Mitzner COMPUTER ENGINEERING Second Year Academic Year . Circuits. relays. Preparing Schematic Diagram 7.would be able to use in robotics as a PD course List of Practicals 1 . Seven segment displays 3.Testing of components registers.. 243. transistors.. Reference Books i) ii) iii) iv) v) Power Electronics.. Devices and Applications. 0-07-Y85505-6 Rs.Project 16. Component placement 12. Text Books 1) Boylestad R & Nashelsky L: Electronic Devices And Circuits.2003 Rashid.A . Prentice Hall Of India. 2) Ramakant Gaikwad. Mcgraw Hill Book Co. Introduction of Simulator 5. bread board 6. Multimeter. Logical Probe 2. Etching 10.Project Outcomes: At the end of the course students will: i) Get introduced to working principle of various display and testing instruments ii) Implement basic circuits using simulator iii) Build circuit on bread Board iv) Design PCB and build circuits and test the same v) Implement a hobby circuit as part of project. Artwork 9.NJ: Pearson education. diode. New York.Project 15.Introduction of Simulator 4. Muhammad H Hand book on CRO Millman J & Halkias C C: Electronic Devices And Circuits. Layout 8. 1976. 1991.Introduction to digital trainer kit. Drilling 10.
4.A . Unique techniques to eliminate stress and negativity. overcoming inferiority etc COMPUTER ENGINEERING Second Year Academic Year .2009-10 Pattern . work and entertainment. How to achieve peace of mind to focus on duties properly. Learning team playing. 3. To bring balance between personal and professional life.CS781: Principle Centered Leadership Aim : Restoring balance and harnessing emotions for long enduring success Objectives: 1. 2. celebrating diversity.
Causes. `Not urgent but important’ • Center and Alternative centers • Becoming a Self Manager 3. Intellect. Overcoming reactive behaviour and learning proactive behaviour 7. Time and Self Management (9 Hours) 1.2009-10 . effects of Stress • How is Stress triggered? – The Mechanism • Type I and Type II managers : check your type • Learning to distinguish the Threat from Threat percept • Power of Thoughts. Changing attitude and outlook to life for converting distress to eustress. committed and responsible? • Work style and behavior • Learning new self-managing skills • Self awareness through introspection • Bringing about a change in thinking. Stress Management • How do I know whether I am under Stress? • Symptoms. Secret of Memory and Managing the Mind COMPUTER ENGINEERING Second Year and hearts ( 9 Hrs) Pattern . attitude and behavior • Learning to motivate and inspire people through self management • Provide individuals with techniques of meditation to manage one self • Realign and adjust with the changing environment with new attitudes Unit 2 : Power Of Habits. heads . 8. Mind and spirituality • Changing attitude and outlook to life for converting distress to eustress • A Meditation technique to go beyond depression and avoid hypertension • Secret of Happiness and improving performance 2. Product capability balance. Time Management • Understanding the basic elements of managing Time • Introduction and exercises • Three generations of Time management • Product vs. P/PC • Three kinds of assets • The Time Management Matrix • Practical application of Time management techniques • Avoiding Time wasters • Focusing on Quadrant II.5.A Academic Year . Unit 1: Stress. Simple tips to resolve inner conflicts and improve physical and mental health. effect of Mind on Body and managing the Mind • A 4-lane approach to tackling Stress – The Body. Art of Self Management • What is Self Management? • The Need of Self Management in everyday life as well as for a Leader • Management with hands.a comparison of Taylorist and Kaizen approach • How to make people self-motivated. Managing emotions for long enduring success 6.
Positive mental attitude • Understanding our Personality – personal SWOT analysis • Personality ethic and Character ethic • Factors that influence development of a Personality • Types of thoughts and Power of thoughts • Effect of Mind on Physical body • Conscious Mind and how we degrade to Negative thinking • Subconscious Mind • Practical tips to Boosting Will Power to excel 2.2009-10 Pattern . Power of Habits and role of Character in life • What are Habits? How are Habits Addictive? • What are the effects of Bad habits? • Why bad habits are bad. Secret of Memory and Concentration • What is memory? How can we develop memory power? • Obstacles to the creating of a good memory • Practical methods for developing memory • What makes concentration possible? • Role of will power in boosting memory and concentration • Developing will power through mantra meditation 3. although they feel good? • Understanding the Conscious & Subconscious Mind • How to say ‘NO’ to Bad Habits • Power of Good Habits • A simple Meditation technique to conquer bad habits • Character building 2. maturity.1. Managing the raging mind • Problems of modern age and the cause • How does your mind influence you? • The mechanism of body-mind-intelligence co-ordination • The tug-of-war between mind and intelligence • Uncontrolled mind : what it can do to you? • Can mind be our friend? • Mind management through a practical meditation technique • Practical tips for mind management Unit 3 : Positive Attitude. nonenvy • Need of a caring leader COMPUTER ENGINEERING Second Year Academic Year . Inferiority and Superiority Complexes (9 Hrs) 1. Team playing. Team playing and winning trust of others • Principles behind making a successful team • Stanford university research on American and Japanese companies • Difference between Group and Team • The Five types of leaders • Learning team playing from geese • The three pillars of trustworthy behaviour – integrity.A .
manage it? • Passive.A . Manager . Managing our Anger • Personal anger and interpersonal anger • What is your anger style – Lock it up. critical etc • Constructive criticism – how to give it ? • Constructive criticism – how to take it ? 2. Conflict Resolution • Six paradigms of human interaction – win/win.3. independence and interdependence .Dependence.All things are created twice • The Eight attitudes that enhance the effectiveness of a Leader 2.Efficient management and effective leadership . turn it lose. Constructive criticism – How to give it or take it? • Types of negative behaviour – moody. Independence and Interdependence • Healthy and unhealthy comparison • Identifying your unique potential • Right and wrong definitions of Success • Converting weaknesses into strengths • Situational leadership • Superiority complex and its ill effects • Difference between self esteem and unnecessary false pride • Difference between humility and inferiority complex Unit 4 : Constructive criticism and Conflict Resolution 1. irritable. Overcoming Inferiority and superiority complex • Dependence.What makes a leader different from a manager? . Eight Qualities of an Effective Leader • Leader vs.Three types of power . EQ and SQ in the life of a Modern Manager COMPUTER ENGINEERING Second Year Academic Year .2009-10 Pattern . assertive and aggressive behaviour • Capturing the constructiveness of anger Unit 6 Proactive Leadership ( 7 Hrs) (6 Hrs) • How to build a team effectively by overcoming obstacles in team cohesion • How to better manage the inner organization as a means for effective leadership of external organization • Role of IQ. win/lose etc • First seek to understand. then to be understood • A five step solution to handling conflicts (6 Hrs) Unit 5 : Qualities of a Leader and Managing Anger 1.
Leadership by Peter Burwash 3. clear and creative thinking by studying the psychophysical natures of different people • To take more personal responsibility for your ‘state of mind’ and emotions and stop blaming others or circumstances. Imbibe the Secret of Happiness and improving performance. EQ and Emotional Intelligence by Robert Cooper and Daniel Goleman 5. Leadership for an age of Higher consciousness. Essence of Bhagavad gita by Radheshyam das. 1 and 2 by B. You can win by Shiv Kaira 9. Note : The laboratory for this course will consist of group discussion based on the topics covered in theory and doing group exercises as given by the staff in-charge based on the above topics. Pustak mahal publications 7. Pustak mahal publications 6. 2. IIT Powai 10.Swami 4. Text and Reference Books : 1.• How to motivate and inspire people based on a holistic self-managing approach • Provide individuals with techniques of meditation to manage oneself • Realign and adjust with the changing environment with new attitudes. Stress Management by Manoj. To Develop calm.K.Gupta.2009-10 Pattern . • To learn how to communicate better with people Outcomes: At the end of the course the student will learn: 1. IIT Powai COMPUTER ENGINEERING Second Year Academic Year . work style and behavior • Learning Proactive behavior rather than reactive behaviour for calm. Discover Your Self by Radheshyam das.T. Seven Habits of Highly effective people by Stephen Covey 2. Mind Control by M. Fifty qualities of a ideal leader by Peter Burwash 8.A . clear and creative thinking.
A . To understand the concept of Interfaces. To understand the concept of Exception Handling and Multithreading 3. 2.CS 782: Core Java Aim : To enable the students to understand the core principles of the Java Language and use visual tools to produce well designed. effective applications and applets. Objectives: 1. To understand the concept of Applets and AWT. COMPUTER ENGINEERING Second Year Academic Year . Packages.2009-10 Pattern .
Java IO package. Flow layout. constructor. Different layout. variables.Multithreading concepts. Thread Life cycle. Grid layout. Event delegation Model . inheritance. Frames and Panels Layout Managers. Thread synchronization Unit 3 : Java Applet . Interfaces. constructor. text input. Multithreading . Packages Unit 2 : Exception Handling and Multithreading (5 Hrs) Exception Handling – Exception types. creating own exceptions. Java IO (3 Hrs) Applets specific methods & Related HTML references. operators. Displaying it using Web Browser with appletwiewer. Byte/Character Stream.Model view Controller design pattern.exe. try. Card layout AWT all components. Creating an Applet. Event categories. Creating multithreaded application. menus dialog boxes . Advantages and Disadvantages of Applet Vs Application Java Input Output . Display area and volume of different shapes( Use class. polymorphism. Buffered reader / writer. Display student marksheet ( Use package) 5. Write a program to illustrate following exceptions a) ArithmeticException b) ArrayIndexOutOfBoundsException b) NullPointerException d) IllegalAccessException COMPUTER ENGINEERING Second Year Academic Year . Containers.Border layout. throws. 2. Class and Object. Thread priorities. File reader / writer. File Sequential / Random Unit 4: AWT and Swing (4 Hrs) Abstract Windows Toolkit. Listeners. Anonymous classes Swing Libraries . catch. encapsulation. Print writer.2009-10 Pattern . Arrays Programs based on class. Swing controls Core Java lab 1. object.Unit 1 : Introduction to Java (4 Hrs) Object Oriented concepts with respect to Java-Data abstraction. Interfaces. finally. inheritance. Display bank account information( Use interface and inheritance) 4.overriding) 3.A . methods. Java Programming – Data types. control statements.Event source and handler. throw. Print prime numbers in between 1 to 500.Components and Graphics. overloading.
Write a program to create singly linked list in java. 6. A Primer COMPUTER ENGINEERING Second Year Academic Year . Write a java program for matrix multiplication. Write a java program to handle deadlock using multithreading.(use applet) 10. Write a program to illustrate card layout manager.A . Java 2 Complete Reference 2.II 3. Write a program in java to explain use of abstract class. Write a program to create GUI for joining form using frame in applet. 7.2. Ivor Horton . 4. SDK 1. Core Java 2 Volume . E. Cay S Horstmann.I 2. 13. Built Producer consumer problem using thread synchronization 5.2009-10 Pattern . Core Java 2 Volume . Write a program to create animation in java using multithreading.4 Edition. Write a program to create calculator.Balguruswami . Patric Naughton. Read content of one file and write it into other file 8. Fary Cornell. 9. layout managers and all possible controls) 11. Write a program to illustrate grid and border layout.Beginning Java 2. Outcomes Upon completion of this course students will be able to develop the Interactive GUI based application. Herbert Schildt . wrox books March 2002 Reference Books 1. Fary Cornell . Write a program in java to perform following string operations: a) append one string to another b) check whether string is palindrome or not c) Count number of vowels in string. 12. 3. Text Books 1. Programming with Java. Create one form to read student information( Use applet. 14. Cay S Horstmann.
Objective: 1. 3. To understand Database connectivity in java. To understand Networking features of java.) Academic Year .A . 2. 4.2009-10 Pattern . . To understand Distributed applications.CS 783: Advanced Java Aim : To enable the students to understand the advanced principles of the Java Language and distributed applications. To understand Client side and Server side programming. Unit 1: Networking with Java COMPUTER ENGINEERING Second Year (4 Hrs.
Herbert Schildt . References: 1.’Inside Servlets’ COMPUTER ENGINEERING Second Year Academic Year . JSP scripting elements. PreparedStatement and CallableStatement). Writing simple RMI application.’Complete Reference’.J2EE’. URL java. port. Types of JDBC drivers.Balguruswami . Generic Servlet. Dustine R Callway . A Primer ‘ 2. ResultSetMetadata.’Complete Reference. Reading user request Data.) Java database connectivity. Creating static content. Internet addressing. Types of statement objects( Statement. Proxy servers.Sockets. Servlet Vs CGI. Outcome: Upon completion of this course students will able to develop Web application in Java Text Books: 1) Jim Keogh . Servlet Life cycle. Types of resultset .) Servlets . Session tracking in servlets. Connection pooling Unit 4: Servlets. Inserting and updating records. Creating dynamic content. 2) Patric Naughton. Examples of JSP. E. Parameter passing in remote methods (marshalling and unmarshalling) .net – networking classes and interfaces. Writing first JDBC applications. Servlet and JDBC JSP – Life cycle of JSP.rmi classes and interfaces.Introduction & Architecture of RMI.) RMI . Writing and running Simple Servlet. Wrting threadsafe servlet. JSP directives.Introduction to CORBA Unit 3: JDBC (4 Hrs. HTTPServlet. Java. JSP and Struts (6 Hrs. Implementing TCP/IP based Server and Client Datagrams – Datagram packet. URL connections Unit 2: RMI and CORBA (2 Hrs. Writing Servlet to handle Get and Post methods. ServletContest. Servlet API Overview. JDBC and AWT.2009-10 Pattern . Datagram server and client.Introduction .’Programming with Java.Networking basics . Introduction to struts. ServletConfig.A .
and Struts’ wrox book Advanced Java lab 1. Java. 5. Herbert Schildt . Ben ‘Beginning Jsp 2. 6. 4) Patric Naughton.’Beginning Java Networking’ 5. Dustine R Callway . Chad Darby.J2EE’. Write a program for online joining report of student using JSP and servlet. multiply and divide two numbers. John Griffin & others .’Complete Reference.0: Build Web Applications Using Jsp. update.Developing Java Servlets ‘. Create servlet to access student information from database from client side. Outcome: Upon completion of this course students will able to develop Web application in Java Text Books: 3) Jim Keogh .2009-10 Pattern . (Take appropriate example) 10. James Goodwill ‘. delete and display student records use JDBC. 4. Ben ‘Beginning Jsp 2. E.project based on advance java technology. Write a java program to implant CORBA. and Struts’ wrox book COMPUTER ENGINEERING Second Year Academic Year . Create chatting application using TCP. Java. 8.A . Create RMI application to add. modify.0: Build Web Applications Using Jsp. Create chatting application using UDP. Implement MVC architecture using struts. Chad Darby.Developing Java Servlets ‘. 7. 2. A Primer ‘ 2.’Beginning Java Networking’ 5. 9.3. 4. Student will be assessed on the basis of presentation and demonstration.’Programming with Java.’Inside Servlets’ 3. 3. Write a program to read file of server machine from client side using RMI. subtract.Balguruswami . Create one form to add.’Complete Reference’. John Griffin & others . James Goodwill ‘. 4. Mini. References: 1.
0 Prerequisite: Awareness of computer programming Aim : To learn application development with Visual Basic 6. Supplying Controls with the toolbox. The Project Explorer window.2009-10 Pattern . Unit 1 : Introduction (4 Hrs) Introduction to VB: What is Visual Basic? The Visual Basic IDE: Using the menu bar and toolbar. Placing forms with the Layout window COMPUTER ENGINEERING Second Year Academic Year . Using the Form window. Using the Properties window.A .CS784: Visual Basic 6.0 Objective: The user should be able to Use the Visual Basic development environment to create an application.
Make use maximum controls (4 Hrs) Do loops: Do…While. Setting Properties. student). Greg Perry. PicturelistBox. Line & Shape Control Date picker. font etc. maxlength.datatypes. Understand basic application development technology. Coding Subroutines & Functions. Design an application to perform simple mathematical operations. Steven Holzner. Design an application to add and delete items from combo box / list box Design an application to sort entered data. Coding Arguments Built-in Functions: Built-in Functions.’ Visual Basic 6 in 21 Days’.literals and variables. Data Arrays Unit 2: VB Programming Language Working with Control Structures If Statement loop. Different operations on files Introduction to Database Processing.1998 Reference Books : 1. ImagelistBox.( with the help of command button. Coriolis Group Books 2. Writing VB code. Data & Formatting Functions. Using Data Control Outcomes: By the end of the course.Building VB Applications VB Applications and Projects. textbox and labels). Storing & Calculating Data. Sybex List of Practicals 1. Toolbars. Opening File from an application.g.’ Mastering Visual Basic 6’. it is expected that the students will: 1. 2. Do…Until. Design a simple registration form (e.’ Visual Basic 6 Black Book’. Animation Control. Text Books : 1.(use arrays. Naming objects. 5. Pictures & Images.2009-10 Pattern . 4. Filling in the menus. backcolor. While and set different properties e.1st edition. Be able to develop database handling. Evangelos Petroutsos. The VB Design Cycle. controls and code. Message & Input Boxes Unit 3: Working with more advanced controls (4 Hrs) Creating Menus. Introduction to Data control. File Handling. 2.g. Common Dialog Control Unit 4: Woking with database (4 Hrs) Managing Files: File Concepts. control structures) For assignment no 2 write functions / subroutines to perform operations COMPUTER ENGINEERING Second Year Academic Year . 3.A . For loops Customizing Functions & Procedures: Calling Procedures. Techmedia.
NET Framework class library . Design an application to perform file operations Design an application to perform database operations with the help of Data Control. Objectives: To learn simple application development with VB. 14.MSIL.(use timer control) Design a math calculator. 11. Design an application to accept student name and percentage with the help of input box and display his grade with message box. With the help of built in function perform data validation of registration form designed in assignment no1.(use control array) Design a simple graphics application using line and shape control.NET.NET Lectures : 1 Hrs/week Prerequisite: Basics of Computer Programming Language.NET Unit 1: Introduction to VB. Design a menu editor of notepad. .NET Framework. Running VB. CS 785:VB. 13. Design a MS-word toolbar with the help of toolbar and imagelistbox / Picturelistbox control. 10. The Just-InTime Compiler .(use case) 8.NETNET as better Programming Platform.2009-10 Pattern . applications COMPUTER ENGINEERING Second Year Academic Year . Design a simple clock to display system time.6. ASP. 7. (Use MS-Access Database). 12.A .NET (4 Hrs) . 9. introduction Building ProjectsCreating Applications .NETUsing simple components. Architecture.
McGraw hill /Osborne.Else.Microsoft press . Access modifiers : Public. Combo Boxes. 3. Picture . Built-in DialogsBoxes. Scrollbars.. Controls: Boxes. List Boxes.net application for addition deletion & sorting items in combo box / list box. String concatenation.NET (6 Hrs) Properties. Protected. Friend.NET Language Fundamentals (2 Hrs) Data types in VB.2009-10 Pattern .Unit 2: VB. Outcomes: By the end of the course. Design a simple VB. Progress bars. looping structures.NET. Status Bar and Menus.Class and Object. methods and events. Shapiro . Understand basic application development technology VB. Buttons.net application for string operations (e.) 3. Design a simple VB.net application for finding the class of a student for the given marks. variables. Unit 3: Windows Applications & Web Application (4 Hrs) TextWindows Forms.A . Design a simple VB. Dreamtech Press .net application for displaying “HELLO” 2. arrays.Net Black Book” . different kinds of operators. COMPUTER ENGINEERING Second Year Academic Year .Inheritance. 2. “Visual Basic . Overloading and Overriding Polymorphism. Becoming aware of the need of object oriented approach for application development.2006 2. Dreamtech Press.. Private.Interfaces .g. “Programming Microsoft Visual Basic.Net. Be able to develop windows and web application.2002 Lab Assignments 1. and Radio Buttons. Control statements If. Check Boxes. Text Books : 1. 4.. Francesco Balena . string comparison..Net ” . Jefrey R.Then. it is expected that the students will: 1..Net Black Book”. Design a simple VB. Unit 4: Object Oriented Programming in VB . etc. “The Complete Reference -Visual Basic . Method overloadingConstructors and Destructors. Toolbars.2006 Reference Books : 1. Labels. substring. “Asp. 2003 2. Steven Holzner. .Net ”.
To make students familiar with scripting languages. 3.5. To make students familiar with server side scripting. 4.net application for Font Dialog Box using different windows controls 7. 10. 3. Design a simple VB. 6. To provide knowledge of the characteristics of good web site design principles.A ENGINEERING Unit 1: HTML COMPUTER . To provide students with a deep. To learn and apply techniques that enhances a user’s web experience.net application for arithmetic operations. Design a simple web application using ASP. 9.net application for converting the given temperature into Celsius. To demonstrate how these technologies may be used on today's websites. critical and systematic understanding of the most significant technologies for developing web applications.net application for an admission form. To impart knowledge of available Web technologies to the students. [3 Hrs] Second Year Academic Year . 8. Objectives: 1. Design a simple VB. 5. 2. Design a simple VB. 2.net CS786: Web Designing Aims: 1.net application for notepad using menu editor.2009-10 Pattern . To enable students to design interactive web pages. Design a simple VB. Design a simple VB.
COMPUTER ENGINEERING Second Year Academic Year .2009-10 Pattern .A .
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 reading from where you left off, or restart the preview.