You are on page 1of 81

Academic Council 25/05/2011

Item No. 4.98


Syllabus for the F.Y.B.Sc.
Program: B.Sc.
Course : Information Technology
(Credit Based Semester and Grading System with
effect from the academic year 2011–2012)

Semester I

Theory Code

Practical Code

Professional Communication skills



Applied Mathematics – I



Fundamentals of Information
Electronics and Communication
Introduction to C++ programming







CLASS: B. Sc (Information technology)
SUBJECT: Professional Communication skills (USIT101)
Periods per week
Lectures - 5
Unit – I

Unit- II


Unit -V


Semester - I
3 Credits

The Seven Cs of Effective Communication
Completeness, Conciseness, Consideration, Concreteness, Clarity,
Courtesy, Correctness
Communication: Its interpretation
Basics, Nonverbal Communication, Barriers to Communication
Business Communication at Work Place:
Letter Components and Layout, Planning a letter, Process of Letter
writing, E-mail Communication, Memo and Memo reports,
Employment Communication, Notice agenda and Minutes of meeting,
Report Writing
Effective writing, types of business reports, structure of reports,
gathering information, organization of the material, writing abstracts
and summaries, writing definitions, visual aids, user instruction
Required Skills
Reading skills, listening skills, note-making, précis writing,
audiovisual aids, oral communication
Mechanics of Writing
Transitions, Spelling rules, hyphenation, transcribing numbers,
Abbreviating technical and non-technical terms, Proof reading.




Professional Communication by Aruna Koneru, McGrawHill
Effective Business Communication by Herta A Murphy, Herbert W Hildebrandt, Jane P
Thomas, McGrawHill
Business Communication, Lesikar and Petit, McGrawHill
Communication Skills Handbook, Summers, Wiley, India
Business Communication (Revised Edition), Rai and Rai, Himalaya Publishing House
Business Correspondence and Report Writing by R. C. Sharma and Krishna Mohan, TMH.

Term Work of USIT101: ( For Internal Assessment)

Assignments: Should contain at least 2 assignments covering the Syllabus.
Class Tests: One. Also Known as Unit Test or In-Semester Examinations
Tutorial : Minimum Three tutorials covering the syllabus

Practical USIT1P1:
Case Studies
3 Lectures per week ( 1 Credit)
List of Practical:
Case study on the 7 Cs of effective communication.
Case study on the body language.
Case study on different types of letters like Job application, Appointment letter,
Memos, formal and informal letters, minutes of the meeting, emails.
Case study on reports.
Case study on oral communication.
Case study on technical writing.

CLASS: B. Sc (Information technology)
SUBJECT: Applied Mathematics I (USIT102)
Periods per week
Lectures - 5

Semester – I
3 Credits

Unit – I

Minors and Cofactors, Adjoint of a square matrix, Inverse of a matrix. Lectures
Rank of a matrix, Solution of Homogeneous and non homogeneous
linear Equations using Matrix method.
Unit- II Eigen Values and Eigen Vectors:
Vectors, linear combination of vectors, Inner Product of two vectors, Lectures
characteristic equation, Eigen Vector, Cayley- Hamilton Theorem,
Similarity of Matrices, Derogatory and Non-derogatory matrices,
Complex Matrices: Hermitian, skew-Hermitian and Unitary matrices
and their properties.
Unit -III Vector Calculus:
Vector Differentiation: Vector Operator Del, Gradient, and Lectures
Geometrical Meaning of gradient, Divergence and Curl.
Unit - IV Differential Equations:
Differential Equations of 1st order and 1st degree and applications
Unit - V Linear Differential Equations:
Linear Differential equations with constant coefficient, Differential
equations of higher order and applications.
Unit -VI Successive differentiation, Mean Value theorems, Partial
differentiation, Euler’s Theorem, Approximation and errors, Maxima
and Minima
Text Books:
Engineering Mathematics A tutorial approach by R. R. Singh and Mukul Bhatt, TMH 2010
Text Book of Applied Mathematics Vol I and Vol II. P.N. Wartikar & J.N. Wartikar, Pune
Vidyarthi Griha Prakashan
Higher Engineering Mathematics by B. V. Ramana, McGrawHill
Differential Calculus by Shanti Narayan. S. Chand.
Higher Engineering Mathematics by B.S. Grewal, Khanna Publications
Vector Analysis by Murray Spiegel, McGrawHill
Matrices by Vashistha, S. Chand
Term Work for USIT102
Assignments: Should contain at least 2 assignments covering the Syllabus.
Class Tests: One. Also Known as Unit Test or In-Semester Examinations
Tutorial : Minimum Three tutorials covering the syllabus

Practical USIT1P2 Problem Solving 3 Lectures per week( 1 Credit) List of Problems i) Problem solving based on matrices ii) Problem solving based on Eigen Values and Eigen Vectors iii) Problem solving based on Vector Analysis iv) Problem solving based on Differential Equations v) Problem solving based on Linear Differential Equations vi) Problem solving based on Successive Differentiation vii) Problem solving based on Mean Value theorems viii) Problem solving based on Partial differentiation ix) Problem solving based on Euler’s Theorem x) Problem solving based on Approximation and errors xi) Problem solving based on Maxima and Minima .

V Unit -VI Semester – I 3 Credits Data and Information: Features of Digital Systems. Universal gates (NAND and NOR gates). full adder. XS-3. P. JK. Counters: Synchronous and Asynchronous counters. Hexadecimal & their inter conversions. Single user / Multi tasking. 8 Lect. McGraw Hill Term Work for USIT103 i) ii) iii) Assignments: Should contain at least 2 assignments covering the Syllabus. Binary. EEPROM. Number Systems: Decimal. Dixit. Also Known as Unit Test or In-Semester Examinations Tutorial : Minimum Three tutorials covering the syllabus . encoders. 8 Lect. Sc (Information technology) SUBJECT: Fundamentals of Digital Computing (USIT103) Periods per week Lectures . Counters. Codes : BCD. Quine McClusky method. Overview of desktop operating systems-Windows and LINUX. N. McGraw Hill Digital Design and Computer Organisation by Dr. 8 Lect. Clocked RS. 3rd Edition. De Morgan Laws. PROM. TMH References: Digital Principles and Applications by Malvino and Leach. Computers: Basic Organization.5 Unit – I Unit. University Science Press Linux Commands by Bryan Pfaffaenberger BPB Publications UNIX by Sumitabha Das. RAM. B. Text Books: Modern Digital Electronics by R. Fixed point representation and Floating point representation of numbers. I/O devices Operating Systems: Types (real Time. GUI based OS. 8 Lect. Multiplexers and demultiplexers. 8 Lect. Karnaugh maps: SOP and POS forms. Sequential Circuit Design: Flip flops (RS. combinational circuit design. Octal. D. other gates (XOR. Binary Arithmetic. Boolean identities. Gill and J. EPROM. Gray code. Combinational Circuits: Half adder. Combinational design using mux and demux. one’s complement & two’s complement. EBCDIC.II Unit -III Unit . Boolean Algebra: Basic gates (AND. McGrawHill Introduction to Computers by Peter Norton. Cache Memory. XNOR gates). UNICODE). Class Tests: One. OR.IV Unit. Secondary Memory: Hard Disk & optical Disk. Representation of Data: Signed Magnitude. T. Shift registers and their types. hamming code. code converters.CLASS: B. alphanumeric codes (ASCII. 8 Lect. Memory: ROM. Jain. JK Master Slave. Single User / Single Tasking. Multi user / Multi tasking. decoders. NOT gates). Error detecting and error correcting codes. S.

cat. 4. Implement SOP /POS forms using logic gates. 3 Lectures per week (1 Credit) Study of logic gates (basic and universal) Verify De Morgan’s theorems Design and implement Half adder and full adder using gates. cd. cal. tar. Design and implement binary to gray code converter and vice versa using XOR gates. echo. ifconfig. rmdir. mkdir. 7. mv. Implement 3-bit binary ripple counter using JK flip flops. Design & implement multiplier for two 2-bit binary numbers using minimum number of gates. Study of Linux Commands with all switches: ls. Implement logic gates using multiplexers. 5. whoami. 8.Practical USIT1P3: Journal Practical List of Practical 1. ping. 9. grep. telnet . Linux: 1. Reduce the given numeric form using K-map and implement using gates. finger. man. Implement expressions using multiplexers and demultiplexers 10. date. time. wc. Installation of Linux 2. pwd. 3. 6. chmod. 2. who. tty.

4th . FET).Negative Feedback and its advantage in Amplification. PHI. LASERS. 1999.Definition of PM. Av. ray model . Multiplexing: .Need for modulation system. 8 Lect. AM :. 8 Lect. Optical sources: LED.(Basics concepts) RC coupled. “An Introduction to Analog and Digital communications”. R. amplifier notations. Per-emphasis and De.Definition of AM. Multistage Amplifiers:. Insulator. PNP. Unit-VI Introduction to Digital Communication: PSK. PHI J.Definition of FM. Application of Transistor as amplifier and as a Switch. “Electronics Devices and Circuits”. DC amplifiers. PHI Boylstead and Neshelesky .Power requirement in comparison with AM. Tata McGraw Hill 1993. Unit. “Communication Systems”. companding. Radio receivers. Introduction to Transistor (BJT. PTM. television receiver. 8 Lect.emphasis. Advantages of SSB over AM.B Carlson.Propagation of light in optical fibre. Link Budget. Noise triangle. J. “Electronic Devices and Circuits”. Delta modulation. LC Oscillator. Semiconductor. Roody Collin. Television:. Switching Circuits Multivibrators : Monostable using IC 555 and Astable using IC 555 (including problems) Unit. Optical Detectors and optics links. “Electronics Communication”. Composite Video signal. Ai. PWM. 8 Lect. Introduction to fibre optics system:. PPM. References Allen Mottershead.5 3 Credits Unit – I Concept of Conductor. FSK.V FM: .CLASS: B. Bandwidth. Zener diode and its applications. 1994.FDM/TDM. SSB:. Difference between AM and FM. Pilot Carrier System. Power relation in AM. Unit-III Concept of Feedback:. Signal distortion: attenuation. “Digital Communications” Mc Graw Hill. Vestigial Sideband Transmission. Generation of SSB. NPN Transistors their Characteristic. PM: .Sampling Theorem. Television Transmitter. RC Phase Shift Oscillator. 8 Lect. Quantization noise. Positive Feedback :.Scanning. Zo). Generation and Demodulation of AM. Forward bias. differential PCM. Millman and A Grabel. Concept of Modulation. PCM system. pulse code modulation.II Concept of amplification. Reverse Bias. Sc (Information technology) Semester – I SUBJECT: Electronics and Communication Technology (USIT104) Periods per week Lectures . steps index. Proakis J. 8 Lect. Ap Zi. Darlington pair. Independent Side System. Simon Haykin. Frequency response of single stage Amplifier. Application of BJT as single stage Amplifier. John Wiley and Sons. ASK. Types of fibre : Single mode. Application of Diode as Rectifier.Oscillators. MacGraw Hill. Concept of Balanced Modulator. “Electrical Communication systems”. Semiconductor Diode. George Kennedy. Unit. Digital Communications by TAUB Schilling . dispersion.IV Introduction:. PAM. cascade. Graded index. “ Microelectronics” MacGraw Hill 1988. Modulation index. Pulse Modulation:.

Study of Amplitude Modulation 10. Astable multivibrator using IC 555 timer. Frequency Response of single stage transistor amplifier 9. Roy Blake Delmar.Electronic Communication Systems. Monostable multivibrator using IC 555 timer. 6. 4. Study of Transistor as a switch 5. Also Known as Unit Test or In-Semester Examinations Tutorial : Minimum Three tutorials covering the syllabus Practical (USIT1P4): Journal Practical List of Practical 3 Lectures per Week (1 Credit) 1. Anu A Gokhale. 7. Thompson Learning Introduction To telecommunications. Study of bridge rectifier. Study of Fibre Optic transmission 12. Study of Zener diode characteristics 2. Study of transistor DC Amplifier . Class Tests: One. Study of Half wave and full wave rectifiers 3. Delmar Thompson Learning Term Work for USIT104 i) ii) iii) Assignments: Should contain at least 2 assignments covering the Syllabus. Study of Frequency Modulation 11. Study of Pulse Amplitude Modulation 13. Study of Wien bridge oscillator 8.

include directives and Namespaces. Second Edition. 2-D arrays . Flow of Control : Compound statements.Hubbard. Function overloading. do while. Computer Science – A structured Approach using C++ by B. built in functions and user defined functions. setw. pointers in function. Forouzan. Increment and decrement operators. 8 Lect. variable declarations. Books: Problem Solving with C++ . Assignment Statements. Math Library Functions. Vector Basics.sizeof. 8 Lect. nested if else. E Balagurusamy . Pearson Education. J. Multidimensional arrays. Data types and expressions. pointers . “Let us C++” . Derived Data types ( Arrays . pitfall and programming tips. switch . identifiers. for. nested loops. Term Work for USIT105 i) ii) iii) Assignments: Should contain at least 2 assignments covering the Syllabus. Schaum’s outlines “Programming with C++”. Tata McGrawHill Y. escape sequences. 8 Lect. reference variable. Call by reference. functions) : Introduction to arrays. Testing and Debugging. Scope resolution operators Functions: Function Prototypes. Manipulators: endl . void pointers. Walter Savitch. pointer to constant and constant pointer. Pearson Education. arrays in functions. R.Kanetkar. Pure C++ programming . Loops: while. Call by value. seventh edition. Vectors and Structures : String functions: strcmp. Introduction to Structures. Flow-charts. Introduction to pointers. Amir Afzal. Cengage Publication. F. Program Design. Gilberg. Introduction to C++: Origin of C++. Third Edition . 8 Lect. const member functions. Indenting and Comments. generic pointer. Decision making: if – else. Inline Functions and recursive functions. break and continue. BPB publication Reference Books: Object Oriented programming with C++ . symbolic constant.P. strlen. strcpy . Input and Output: cin. cout. Sc (Information technology) SUBJECT: Introduction to C++ programming (USIT105) Periods per week Lectures – 5 Unit – I UnitII UnitIII UnitIV UnitV UnitVI Semester – I 3 Credits Programming Logic and techniques : Algorithms. A Sample C++ program. Sixth Edition.R. Also Known as Unit Test or In-Semester Examinations Tutorial : Minimum Three tutorials covering the syllabus . Arithmetic operators. Class Tests: One. Strings. strcat. 8 Lect. Tata McGraw Hill. 8 Lect.CLASS: B. Type compatibilities. Type Cast Operators. C++ concepts : Variables and Assignments: variables. Operator precedence.

Practical (USIT1P5): Journal Practical List of Practical 1) 2) 3) 4) 5) 6) 8) 9) 10) 11) 12) 13) 14) 15) 3 Lectures per Week (1 Credit) Write a C++ program for finding greatest of three number. (switch. Write a program for generating the report card. Write a program for implementing the concept of structures. Write your own function for string reverse . Write a C++ program for solving the quadratic equation. string palindrome . Write a program for finding the greatest and smallest number using vector. string comparision Write a program for sorting the number in ascending and descending order Write a program for Matrix addition and multiplication.break. Write a program for implementing the concept of call by value and call by reference. Write a C++ program for displaying the Fibonacci series. . Write a recursive function for factorial of given number. Write a C++ program for converting number to words. Write a C++ program to print all the prime numbers in a given range.continue) Write a C++ function for swapping two numbers without using third variable.

Adding a border. Adding a Caption. telnet. search engine. Action Buttons. Frames document. Aligning Entire Table. Reset. Drop down and list boxes. Nesting<FRAMESET> tag.II Semester – II 3 Credits Internet and WWW : What is Internet?. Grouping related fields. Applications. Using Hidden frames. Content Summary. Passing form data Style Sheets : What are style sheets?. Internet service providers. The <FRAMESET> tag. Alternative text for Imagemaps. Table tags. The <FORM> tag. Executable content tags Imagemaps : What are Imagemaps?. Forms and Scripting. proxy server. firefox. Introduction to internet and its applications. Tables : Introduction to HTML tables and their structure. Alignment within a row. Option. Setting the width. Select. Using Server-side and Client-side Imagemaps together. Elements that can be placed in a table. Forms : Creating Forms. File Upload. Labelling input files. List Tags. 8 lectures 8 lectures . Document Structure Tags. IIS. The table tags. Alignment. Submit. The <INPUT> tag.Semester II Courses Theory Code Practical Code Web Designing and Programming USIT201 USIT2P1 Applied Mathematics – II USIT202 USIT2P2 Microprocessor and microcontrollers USIT203 USIT2P3 Database Management Systems Data Communication and Networking Standards USIT204 USIT2P4 USIT205 USIT2P5 CLASS: B. Sc (Information technology) SUBJECT: Web Designing and Programming (USIT201) Periods per week Lectures – 5 Unit – I Unit. Spacing between the cells. netscape navigator. E-mail. Creating floating frames. Attributes. Alignment within a cell. Table Sections and column properties. Radio. Text. ebusiness. Text Level formatting. Spanning multiple rows or columns. Multiple lines text windows. Hyperlink tags. Tables as a design tool Frames : Introduction to Frames. Formatting Tags. internet address World Wide Web (WWW) : World Wide Web and its evolution. Disabled and read-only fields. Form Tags. video conferencing. HTTP protocol HTML and Graphics : HTML Tag Reference. domain name server. mozilla. FTP. Client-side Imagemaps. Event Handlers. Text Area. Background Color. uniform resource locator (URL). Checkbox. chrome. web saver – apache. Frame Tags. Password. Global Attributes. Why are style sheets valuable?. Targeting named frames. Serverside Imagemaps. Named Input fields. Spacing within a cell. browsers – internet explorer. e-commerce. opera. Hidden. Form field event handlers. Button. Block Level formatting. Image and Image maps. Placing content in frames with the <FRAME> tag.

onChange. onReset. Boolean. this. onClick. JavaScript 2. Comparison Operators. Inline style information Java Script : Introduction.Different approaches to style sheets. Second Edition by Thomas Powell and Fritz Schneider 4. event. Core JavaScript (Properties and Methods of Each) : Array. Server-Side Unit. if. labelled. export. Arrays and Array Functions. with. .else. JavaScript Security. Arithmetic Operators. for. onBlur. comment. Object. onUnload Unit – IV XML : Introduction to XML. Basic PHP errors/problems. Area. onMouseOver. onDblClick. var. String. Anchor. continue. Building Forms from queries. Web Design The Complete Reference. Adding PHP to HTML. Passing information between pages. Anatomy of an XML document. Numbers. Creating XML DTDs. import.III JavaScript. --(Decrement). Displaying queries in tables. Strings. Cookies and HTTP. Function. onDragDrop. Server-side web scripting. Applet. PHP: The Complete Reference By Steven Holzner. switch. Thomas Powell. onLoad. Syntax and Variables. ++(Increment).. Using Multiple approaches. onAbort.0: The Complete Reference.Setting up style information. Short-Circuit Evaluation. onKeyDown.. Tata McGrawHill Term Work for USIT201 i) ii) iii) Assignments: Should contain at least 2 assignments covering the Syllabus. function. return. Link. % (Modulus). Also Known as Unit Test or In-Semester Examinations Tutorial : Minimum Three tutorials covering the syllabus . Tata McGrawHill 3. new. Linking to style information in s separate file. (Comma operator). String and Regular Expressions. regExp Document and its associated objects : document. Image. onError. Embedded style information. delete. onMove. Installing PHP. void Statements : Break. Special Operators. Creating XML Documents. Type and Type Conversions... onFocus.. onMouseUp. String Operators. onMouseDown.while. Tata McGrawHill 2.. Sessions. XML Schemas. Thomas Powell. onMouseMove. onSubmit. Date. JavaScript for. delete. Math. onKeyPress. Class Tests: One. Layer Events and Event Handlers : General Information about Events. Client-Side JavaScript. E-Mail 8 lectures 8 lectures 8 lectures 8 lectures References : 1. Defining Event Handlers. XSL Unit – V PHP : Why PHP and MySQL?. onResize. Number. while. Logical Operators. onMouseOut. do. Using the <LINK> tag. ?: (Conditional operator). HTML and XHTML The Complete Reference. . Using <STYLE> tag. Unit – VI Advanced PHP and MySQL : PHP/MySQL Functions. onKeyUp. onSelect. -(Unary Negation). Operators : Assignment Operators.

Design a website using style sheets so that the pages have uniform style. 13. Design a webpage using frames. 8. 10. Design XML Schema and corresponding XML document. Design a webpage suing table so that the content appears well placed. 9. Design a web page with links to different pages and allow navigation between pages. Design a form and validate all the controls placed on the form using Java Script. . Design a web page using different text formatting tags. 3. Using Java Script design a web page that prints factorial / Fibonacci series / any given series. corresponding XML document and display it in browser using CSS. 6. Design a web page with different tables. Design a web page with Imagemaps. 11. 12. Using Java Script write a program whether the number entered in the text box is a prime number or not. 5.Practicals (USIT2P1): Journal Practical List of Practical 3 Lectures per Week (1 Credit) 1. 7. Design a web page with a form that uses all types of controls. Design an XML document and display it in browser using XSL. 4. 2. Design a form with a test box and a command button. Design a DTD.

Fourier Transform and Inverse Fourier Transform: Fourier transform of Even and Odd functions. Narosa Publishing House. Unit – Differentiation under Integral sign. Inverse Laplace Transform: Inverse Laplace Transform . Gupta. Beta and Gamma Functions. Class Tests: One. Term Work for USIT202 i) ii) iii) Assignments: Should contain at least 2 assignments covering the Syllabus. Fourier Transform of sine and cosine functions 8 Lect. Logarithms of Complex numbers 8 Lect. Half range expansions.K. S. Polar & Exponential form.CLASS: B. Unit – Fourier Series: V Fourier Series. Vasishta. Change of Interval. S. Unit – Laplace Transform: Introduction. Unit – Integral Calculus: Double Integral. References: Differential Calculus by Shanti Narayan. Singularities –Poles.R. R. Laplace transform of Periodic Functions. Advanced Engineering Mathematics: R. Heavyside Unit-step Function. Application of Inverse Laplace transform to solve differential equations. De-Moivre's I theorem. Dr. Also Known as Unit Test or In-Semester Examinations Tutorial : Minimum Three tutorials covering the syllabus . concept of Line Integral. R.K.Jain.K. Methods of obtaining Inverse Laplace transform. Grewal. Engineering Mathematics : T Veerajan. Tata McGraw-Hill Integral Transforms: A. Dirac-delta function (Unit Impulse Function). Hyperbolic functions. Definition. Laplace Transform of standard function. B. 8 Lect. UnitII 8 Lect. Riemann Integral. Krishna Prakashan Mandir. Sc (Information technology) Semester – II SUBJECT: Applied Mathematics – II (USIT202) Periods per week Lectures – 5 3 Credits Unit – Complex Numbers: Cartesian. Triple Integral. . Even and odd functions. “Higher Engineering Mathematics. Error Functions 8 Lect. Evaluation of Residues theorem. Volume VI 8 Lect. Area. Properties of Laplace III Transform. Conformal Mapping and Bilinear Mapping. Iyengar. Complex Variables : Cauchy Riemann Equations. IV Properties and Duplication Formula.

Practicals (USIT2P2): Problem Solving List of Problems 3 Lectures per Week (1 Credit) i) Problem solving based on Complex Numbers ii) Problem solving based on Complex Variables iii) Problem solving based on Laplace Transforms iv) Problem solving based on Inverse Laplace Transforms v) Problem solving based on Differentiation under the integral sign vi) Problem solving based on Beta and gamma functions vii) Problem solving based on error functions viii) Problem solving based on Fourier series ix) Problem solving based on Fourier transforms x) Problem solving based on double integrals and area xi) Problem solving based on triple integrals .

Thomas C Bartee. Mazidi and R. I Types of memories. A.Introduction to 8085 microprocessor: . Unit.PHI.CLASS: B. PRI (3rd Edition) Digital Computer Fundamentals. R. External Memory: RAID. Unit. Instruction III Format. Digital Computer Fundamentals. D. Malvino Microprocessor Architecture and Programming and Applications with the 8085. J. Why PCI bus is needed? Concept of PCI Arbitration. 8051 Assembly Language Programming. System Buses: .M. 8 Lect. 8 Lect. Andrew C. Tanenbaum. encoder. Mazidi. 8 Lect. Structure and function. Gaonkar. Sc (Information technology) Semester – II SUBJECT: Microprocessor and microcontrollers (USIT203) Periods per week Lectures – 5 3 Credits Unit – Logic Devices: Tristate devices. Internal Memory: . Unit. References William Stallings. Instruction Classification. 1998. buffers. 1998. chip enable.Organization of Microprocessor II based system. Morris Memo. John P Hayes. “Computer Architecture and Organisation” . memory organization.Introduction to Modern day Computer Systems: .The 8051 Microcontroller: V Introduction and overview of 8051 family. 8 Lect. “Structured Computer Organisation” (3rd Edition) -. G.McGraw Hill. PHI. concept of control lines such as read/write. PHI. Concept and need for Cache coherency. 8085 Instruction Set Unit. Methods of Cache Mapping. Address Decoding and Memory Interfacing. TMG The 8051 Microcontroller and Embedded systems by M. “Computer Organisation and Architecture” ( 4th Edition ) . 8 Lect.Computer Components. latches. Unit. 8085 µp Architecture. Computer function.S. Loops and call instructions.Organization and IV Architecture. McKinlay. Jumps. 1998. Addressing Modes. Pearson Education.Concept of Cache Memory. decoder. Computer System Architecture . Concept of Address line and Memory interfacing. . 8 Lect. Arithmetic and Logical VI instructions. PCI: Features of PCI bus.8051 I/O port programming.8085 Programming Model.

10. 3. 9. Sorting of numbers. 4. Find GCD and LCM of two numbers 10. Find the largest/smallest of the numbers stored at one location. Write a program to check if the accumulator is divisible by 8. Multiplication of signed numbers. 6. 2. To check whether a character string is a palindrome or not. To find y where y = x2 + 2x + 5 and x is between 0 and 9. Transfer a block of data from one location to another. 5. Multiplication of 8-bit and 16-bit numbers. Also Known as Unit Test or In-Semester Examinations Tutorial : Minimum Three tutorials covering the syllabus Practicals (USIT2P3): Journal Practical 3 Lectures per Week (1 Credit) 8085 programs for 1.Term Work for USIT203 i) ii) iii) Assignments: Should contain at least 2 assignments covering the Syllabus. 7. . To check the number is prime or not. 3. BCD addition 8. 7. Finding the average of signed numbers. The end of the data is indicated by 00. Addition of 10 numbers. To search a number from a given set of numbers. Division 9. 4. Swapping a block of data 8051 programs for: 1. Write a program to show the use of the BIT directive. Class Tests: One. 6. 5. Convert the BCD 0111 0101 number to two binary numbers and transfer this number to registers. Simple 8-bit and 16-bit addition and subtraction 2. Write a program to find the number of zeros in register R2 8.

ER-Model. Unit.Database Design. optimistic methods. BCNF). atomic domain and Normalization (1NF. database architecture. Calculus: Tuple relational calculus. ERD Issues. Unit. comparison between tables and views SQL: data definition. Views: Introduction to views. Unit. data independence. Unit.Data Models : The importance of data models. relational comparison.Relational Algebra and Calculus: Relational algebra: introduction. Relational Database design: features of good relational database design. serializability and concurrency control. 3NF. renaming. database recovery management. relational databases. set operations. transaction management.Constraints. II Business rules. Constraints. grouping and ungrouping. Basic building blocks. Deadlocks). ER-Diagram and Unified Modeling Language: III Database design and ER Model:overview. types of constrains. Introduction to UML Relational database model: Logical view of data. Joins. Views and SQL: What is constraints. updates on views. Degrees of data abstraction. computational capabilities. Relational Schemas. Unit. purpose of database system. nested sub queries. IV Selection and projection. Joined relations. syntax. weak entity sets. 8 Lect 8 Lect 8 Lect 8 Lect 8 Lect 8 Lect . Operators. V Integrity constraints. Sc (Information technology) SUBJECT: DBMS (USIT204) Periods per week Semester – II Lectures – 5 3 Credits Unit – Introduction to Databases and Transactions : I What is database system. The evolution of data models. aggregate function. Triggers. keys. calculus vs algebra. Lock based concurrency control (2PL.CLASS: B. Codd’s rules. Division. view of data. security. semantics. Domain relational Calculus. integrity rules.Transaction management and Concurrency control: Transaction VI management: ACID properties. ERDiagrams.Time stamping methods. 2NF. Null Values.

Coronel. 3 Lectures per Week (1 Credit) Design a Database and create required tables. Foreign key.AVG(). . Perform the following operation for demonstrating the insertion . NOT NULL to the tables. Seventh Edition. “Database System and Concepts”. Perform the queries for triggers 9. College Database Apply the constraints like Primary Key . Write the query to create the views 8. Bank. S Sudarshan. 3. Class Tests: One. 5. Rob. Write a sql statement for implementing ALTER. 2. Write the query to implement the concept of Intergrity constrains 7.COUNT() 6. H Korth. For e. Also Known as Unit Test or In-Semester Examinations Tutorial : Minimum Three tutorials covering the syllabus Practicals (USIT2P4): Journal Practical List of Practical: 1. Cengage Learning Term Work for USIT204 i) ii) iii) Assignments: Should contain at least 2 assignments covering the Syllabus. Write the query for creating the users and their role.Books: A Silberschatz.MIN().g.UPDATE and DELETE Write the queries to implement the joins Write the query for implementing the following functions: MAX(). fifth Edition McGrawHill . 4. updation and deletion using the referential integrity constraints 10. “Database Systems”.

Digital to digital. The data transmission rate and bandwidth. TMH Reference: W. Fourth Edition . hamming distance . Errors Detection and Correction Introduction. bandwidth of signal and a medium.Switching and routing algorithms Mesh. TMH Dr. Representing different symbols. Transmission impairment. cyclic redundancy check.CLASS: B. configuration via DHCP v6 .Data Communication and Networking Standards (USIT2P5) Periods per week Lectures . TCP/IP protocol suite . Network Models Layered Tasks. Analog to digital conversion .Sidnie Feit. Special addresses . hybrid. IPv6 addresses . IPv6 extension headers . Multimedia and Data compression. standards. The OSI reference model . signal propagation. Periodic analog signals. packet switching and Message switching .”Data and Computer Communications”. Terminology. Guided media and Unguided media Network topologies . analog and digital signals. Sc (Information technology) Semester .Second Edition. Performance. tree. routing algorithms IP version 6 Overview . Digital signals. switching basics . Addressing IPv4 Information Encoding . circuit switching. Minimizing errors . IP v 6 header formats. “TCP/IP” . “Data communications and Networks. Data rate limits. Class Tests: One. ring. Layers in the OSI reference model .Pearson Education Term Work for USIT205 i) ii) iii) Assignments: Should contain at least 2 assignments covering the Syllabus. Analog to analog conversion. Digital to analog conversion . redundancy. Fourier analysis and the concept of bandwidth of a signal. Media and Transmission modes Data and signals. Also Known as Unit Test or In-Semester Examinations Tutorial : Minimum Three tutorials covering the syllabus . star. Error classification. Protocol. detection versus correction . “Data communications and Networking”. IPv6 transition 8 Lect 8 Lect 8 Lect 8 Lect 8 Lect 8 Lect Books: Behrouz A Forouzan.5 (3 Credits) Unit-I Unit-II Unit-III Unit-IV Unit-V Unit-VI Introduction to data communications and networking Introduction. types of errors.Stallings. IPv6 autoconfiguration .II SUBJECT: . Transmission modes.Eight Edition. Fundamental concepts. Multimedia . bus. Mc-Graw Hill Achyut Godbole. standard organizations. Data communications.

Practical (USIT2P5): Case Studies List of Cases 3 Lectures Per Week ( 1 Credit) i) Case study on implementation of TCP/IP model in different OS ii) Case study on errors in data transmission iii) Case study on transmission media iv) Case study on static IP addressing v) Case study on dynamic IP addressing vi) Case study on network devices: Routers. Switches. Bridges vii) Case study on IPv6 .

Issues related to Term Work. . tutorial. • Class Test is to be conducted in the class room with due notice. Semester I Theory Course Internal Assessment (40 Marks) Assignment Tutorial USIT101 USIT102 USIT103 USIT104 USIT105 10 10 10 10 10 10 10 10 10 10 Class Test 20 20 20 20 20 External Assessment (60 Marks) Theory Exam Total(100 Marks) 60 60 60 60 60 100 100 100 100 100 Practical Course Internal Assessment (20 Marks) External Assessment (30 Marks) USIT1P1 USIT1P2 USIT1P3 USIT1P4 USIT1P5 Case Study Problem Solving Lab and Journal Lab and Journal Lab and Journal Case Study Problem Solving Practical Exam Practical Exam Practical Exam Total (50 Marks) 50 50 50 50 50 Semester II Theory Course Internal Assessment (40 Marks) USIT201 USIT202 USIT203 USIT204 USIT205 Assignment Tutorial Class Test 10 10 20 10 10 20 10 10 20 10 10 20 10 10 20 External Assessment (60 Marks) Theory Exam Total(100 Marks) 60 60 60 60 60 Practical Course Internal Assessment (20 Marks) External Assessment (30 Marks) USIT2P1 USIT2P2 USIT2P3 USIT2P4 USIT2P5 Lab and Journal Problem Solving Lab and Journal Lab and Journal Case Study Practical Exam Problem Solving Practical Exam Practical Exam Case Study 100 100 100 100 100 Total (50 Marks) 50 50 50 50 50 • Tutorials are theory /problems to be solved by the students in the class room at the end of practical / theory session • Assignments are theory / problems to be solved by the students at home. Credit of 3 of Theory and 1 of Practical for any course is to be awarded only if students clear both. Test could be out of any sum total but is to be converted out of 20 for class test. assignments and Practicals Following is the marks distribution for Theory and Practical. Minimum 16 marks out of 40 and 24 marks out of 60 for passing in Theory and 8 marks out of 20 and 12 marks out of 30 for passing in Practical.

. …….. 5 marks From Unit II Attempt any two of following i.. 10 marks 10 marks 10 marks 10 marks 10 marks 10 marks . ……. 5 marks ii. 5 marks ii..IV are college examinations..III. 5 marks ii.. ……. 5 marks From Unit II Attempt any two of following i. 1 Q. 5 marks From Unit IV Attempt any two of following i. 4 Q. 5 marks ii. ……. 6 From Unit I Attempt any two of following i.II. 5 marks From Unit II Attempt any two of following i. 5 marks iii. ……. 5 marks ii. 5 marks iii. ……. 5 marks From Unit III Attempt any two of following i. ……. …….. ……. ……. 5 marks Note: Internal choice should be given. …….. 5 marks iii. Question papers will be set by examiners appointed by Principals of the affiliated colleges.• Semester I. 5 marks ii. ……. Suggested Question Paper Format for END Semester Examination Duration : 2 hrs. ……. …….. …….. 5 marks ii. ……... 5 marks iii. ……... ……. 2 Q. 5 Q. 5 marks iii.... Total Marks : 60 All Questions Compulsory: Q. 3 Q..


B.Sc. in Information Technology (with effect from the academic year 2011–2012) 1    .99 UNIVERSITY OF MUMBAI Revised Syllabus for the S. 4.Y.Academic Council 25/05/2011 Item No.

Software Engineering P2.S Y BSc Information Technology Revised syllabus(2011-12) Semester III P1. Object Oriented Programming with C++ P5. Advanced SQL P4. Quantitative Techniques P5. Logic and Discrete Mathematics P2. Computer Graphics P3. Embedded Systems                                 2    . Multimedia P3. Java and Data Structures P4. Modern Operating Systems   Semester IV P1.

rooted trees and path length in rooted trees. Logic: Propositions and Logical operations. Power Sets and Products. relations and digraphs. Implications. properties of relations. Euler paths and circuits. equivalence and partially ordered relations. Posets and Hasse Diagrams. Operations on sets. Pigeon hole principle. Truth tables. Sc (Information technology) Semester – III COURSE: Logic and Discrete Mathematics Periods per week 1 Period is 50 minutes Evaluation System Lecture 5 TW/Tutorial/Practical 3 Hours Marks Theory Examination 3 100 TW/Tutorial/Practical -- 50   Unit-I Set Theory: Fundamentals . Partition of sets. diagraphs and lattices: – Product sets and partitions. The principle of Inclusion-Exclusion.Sets and subsets. Laws of Set Theory. Weighted trees and Prefix Codes. Unit-III Functions and Pigeon Hole Principle: Definitions and types of functions: injective. identity and inverse. Composition. Planer graphs. Transitive closure and Warshall’s algorithm. Equivalence. Hamiltonian paths and circuits. surjective and bijective. 3    . Trees: Trees. Predicates and quantifiers. Laws of Logic. Mathematical Induction Unit-II Relations.  CLASS: B. Normal forms. paths in relations and digraphs. Isomorphism of Graphs. coloring graphs. Venn Diagrams. manipulation of relations. Lattice. Isomorphism of trees. Unit-IV Graphs and Trees: Graphs. computer representation of relations and digraphs. Spanning tree and Minimal Spanning tree.

Cyclic groups. Applications.                 4    . Tutorial: At least three tutorials based on above syllabus must be conducted. Ltd. Discrete mathematical structures by RM Somasundaram (PHI) EEE edition References: Discrete structures by Liu. Tata McGraw‐Hill  Digital Logic John M Yarbrough Brooks/cole. Ltd. Books: Discrete mathematical structures by B Kolman RC Busby. codes and group codes. Normal sub group.Unit-V Algebraic Structures: Algebraic structures with one binary operation – semi groups. Tata McGraw‐Hill  Discrete Mathematics for computer scientists and Mathematicians. Seymour Lipschutz. homomorphism. monoids and groups. Schaum’s Outlines Series. Discrete Mathematics With Applications. Books/Cole Publishing Company Discrete Mathematilcs. automorphism. Marc Lipson. Joe L. Algebraic structures with two binary operations – rings. Product and quotient of algebraic structures. Tata  McGraw‐Hill Term Work: Assignment: Should contain at least 6 assignments (one per unit) covering the Syllabus.Kenneth H. Solving difference equations. Fibonacci. Unit-VI Generating Functions and Recurrence relations: Series and Sequences. Baker. Ring homomorphism and Isomorphism. Epp. integral domains and fields. S Ross PHI Pvt. Rosen. Generating Functions. Isomorphism. Recurrence relations. Prentice-Hall of India Pvt. Susanna S. Thompson Learning Discrete Mathematics and its Applications.Mott. Abraham Kandel Theodore P.

ThreeDimensional Transformations: Scaling. Bitmap and VectorBased Graphics. Raster-Scan Display. Image Representation. Bresenham’s Line-Drawing Algorithm. Shear Transformations. Line Clipping. TwoDimensional Clipping. Point Clipping. Midpoint Circle Algorithm). Translation. ScanConversion of Circle and Ellipse (Bresenham’s Method of Circle Drawing. Viewing and Clipping in Three Dimensions. Text Clipping Introduction to Solid Area Scan-Conversion. Viewing Transformation in Two Dimensions. Polygon Filling. Shear Transformations. Drawing Ellipses and Other Conics. Coordinate System Overview. Introduction to Clipping. Objects in Homogeneous Coordinates. Types of Transformations in Two-Dimensional Graphics: Identity Transformation. Unit-IV Viewing and Solid Area Scan-Conversion: Introduction to viewing and clipping. Translation. Scan- 5    . Inside–Outside Test. Reflection. Seed Fill Algorithm. Flat Panel Display. Rotation about an Arbitrary Point. 2D Transformations using Homogeneous Coordinates Unit-III Three-dimensional transformations. Perspective Projection. Sc (Information technology) Semester – III COURSE: Computer Graphics Periods per week 1 Period is 50 minutes Evaluation System Lecture 5 TW/Tutorial/Practical 3 Hours Marks Theory Examination 3 100 TW/Tutorial/Practical -- 50   Unit-I Introduction Computer Graphics and Primitive Algorithms: Introduction to Image and Objects. Rotation. World Coordinates and Viewing Coordinates. Reflection. Input Technology. Winding Number Method and Coherence Property. Scan-Conversion of graphics primitives: Scan-Conversion of a Lines (Digital Differential Analyzer Algorithm. Three-Dimensional Viewing Transformations. Unit-II Two Dimensional Transformation: Introduction to transformations. Transformation Matrix. Introduction to a Polygon Clipping. Rotation. Display Devices. Parallel Projection. Applications of Computer Graphics.CLASS: B. Projection. Cathode Ray Tubes. Basic Graphics Pipeline. Random-Scan Display. Homogeneous Coordinates. Combined Transformation. Scaling.

Spline Curve Representation. Mathematical elements of Computer Graphics.D. Newman. Motion Control Methods. Rogers. Addision Wesley.L. S. R. Radiosity. Flat Shading. Robert F. Coherence for visibility. Van Dam. Phillips. Curve Continuity. Subdivision Surfaces Visible Surfaces: Introduction to visible and hidden surfaces.   Term Work: 6    . Shading. Feiner. Tata McGraw-Hill. Phillips. Pauline Baker. Light Modeling Techniques. Illumination Model. Donald Hearn and M. Feiner and R. Three-Dimensional Morphing Books: Computer Graphics. K. Z-Buffer Algorithm. Introduction to Computer Graphics. John Wiley. J. Steven Harrington. Back Face Culling. Parametric Curve Design. B-Spline Surfaces. Conic Curves.K. Foley. McGraw-Hill. Gaurand Shading Model. Procedural Animation. Constructive Solid Geometry. David F. Texture and Object Representation. Roberts Algorithm. Fractals and its applications. Bezier Surfaces. Painter’s Algorithm. Surface Design: Bilinear Surfaces. B-Spline Curves. Priority Algorithm. Ruled Surfaces. Color Models. Ray Casting. Sproull. Procedural Animation. Rogers. Unit-VI Object Rendering: Introduction Object-Rendering. Prentice Hall of India. Alan Adams. Foley. J. Maurya. Hughes and R.D. Procedural elements of Computer Graphics. Addision Wesley. Halftoning. J. Extents and Bounding Volumes. S. Introduction to Morphing. Van Dam. AntiAliasing.F. Tata McGraw-Hill. Bezier Curves. Tata McGraw-Hill. Construction of an Animation Sequence. Principles of Interactive Computer Graphics.K. Thresholding and Dithering Unit-V Introduction to curves. A. Key-Frame Animation vs. Phong Shading. Transparency Effect. Willaim M.L. Scan Conversion of Character. J. Key-Frame Animation. David F. Surface of Revolution. Aliasing. Computer Graphics.Line Algorithm. Ray Tracing. A. Piecewise Curve Design. Introduction to animation. Sweep Surfaces. Polygon Mesh Shading. Computer Graphics Principles and Practice. Floating Horizon Algorithm. Developable Surfaces. Quadric Surfaces. Coons Patch. Shadows. Reference: Computer Graphics.

(A user will click on the screen and drag the mouse/arrow keys over the screen coordinates. Implement the Bresenham’s/DDA algorithm for drawing line (programmer is expected to shift the origin to the center of the screen and divide the screen into required quadrants). tree etc). Write a program to implement the bouncing ball inside a defined rectangular window. Write a program with menu option to input the line coordinates from the user to generate a line using Bresenham’s method and DDA algorithm. Midpoint Circle Algorithm 3. 8. Write a program to draw Bezier and B-Spline Curves with interactive user inputs for control polygon defining the shape of the curve. ymax). Some Sample practical are listed below. The line should be updated like rubberband and on the right-click gets fixed). Rotate through θ. y2) against a window (xmin . Reflection c.  CLASS: B. Write a program to implement a stretch band effect. 6. Develop a program to generate a complete circle based on a. Cantor set. 5. Develop a program to clip a line using Cohen-Sutherland line clipping algorithm between (x1. 11. Scaling d. Write a program to implement polygon filling. 7. Write program to perform the following 2D and 3D transformations on the given input figure a. 2. Write a program to demonstrate 2D animation such as clock simulation or rising sun 12. 9. b. Bresenham’s circle algorithm b. Translation. Write a program to generate a 2D/3D fractal figures (Sierpinski triangle. Practical(Suggested): Should contain at least 10 programs developed using C++. Sc (Information technology) Semester – III COURSE: Advanced SQL Periods per week 1 Period is 50 minutes Evaluation System Lecture 5 TW/Tutorial/Practical 3 Hours Marks Theory Examination 3 100 TW/Tutorial/Practical -- 50   7    . Write a program to demonstrate shear transformation in different directions on a unit square situated at the origin.Assignments: Should contain at least 6 assignments (one per unit) covering the syllabus. ymin)(xmax .   1.y1)(x2. 4. Compare the lines for their values on the line. 10.

Advanced Subqueries (Multiple column subqueries. Deployment of SQL Functions in PL/SQL. Rollup and Grouping). Unit-III PLSQL: Introduction. Implement Procedures Parameters and Parameters Modes. Bind Variables. Convert Data Types. advantages of using Stored Functions. Deploying Packages. The %NOTFOUND and %ROWCOUNT Attributes. Control side effects of PL/SQL Subprograms. Implement Package Functions in SQL and Restrictions. Creating and Managing Tables. Subqueries in FROM clause. Creating Views. Trap Predefined and non-predefined Oracle Server Errors. the PL/SQL Execution Environment. Overview and benefits of PL/SQL. the FOR UPDATE Clause and WHERE CURRENT Clause. Use INDEX BY Table of Records. Invoke User-Defined Functions in SQL Statements. Single-Row Functions. Joins (Displaying Data from Multiple Tables). components of a Package. Indexes and Synonyms) Unit-II Advanced SQL: Controlling User Access. Executable Statements. Composite Data Types: PL/SQL Records. For Loop Statement. View the PL/SQL Source Code using the Data Dictionary. Create. PL/SQL Block Syntax. Enhancements to Group by clause(cube. Call. INDEX BY Table Methods. Packages. SQL Cursor Attributes to Obtain Feedback on DML. enable visibility of a Package’s Components. Close the Cursor. Create the Package Specification and Body using the SQL CREATE Statement and SQL Developer. Exception Handling. The %TYPE Attribute. DateTime Functions. types of Identifiers. INDEX BY Tables. SQL Cursor concept. Hierarchical retrieval. Persistent State of a Package Cursor. Aggregating Data using Group Functions. Unit-IV Control Structures: Conditional processing using IF Statements and CASE Statements. Explicit Cursors. Scalar Data Types. Invoke the Package Constructs. Identifiers. Interaction with the Oracle Server. Call. Restricting and Sorting Data. Operators. types of PL/SQL blocks. Sequences in PL/SQL Expressions.Unit-I Structured Query Language: Writing Basic SQL Select Statements. Cursor FOR loop. Scalar and correlated subqueries). Use the STANDARD Package. Loop Statement. the Continue Statement. While Loop Statement. View Functions Information. and Remove Stored Procedures. Insert and Update with PL/SQL Records. Create. Develop a Package. Creating Other Database Objects(Sequences. RAISE_APPLICATION_ERROR Procedure. Subprograms. Restrictions when calling Functions. differences between Anonymous Blocks and Subprograms. Invoke PL/SQL Tables of Records in Packages 8    . Overloading Subprograms in PL/SQL. Data Manipulation in the Server using PL/SQL. Propagate Exceptions. Invoke SELECT Statements in PL/SQL. Stored Functions and Debugging Subprograms. Use Forward Declarations. Comment the Code. advantages of Packages. Persistent State of Packages. Using SET operators. Nested Blocks. Including Constraints. Declarative Section. variables. Fetch data from the Cursor. View Procedure Information. Unit-V Stored Procedures: Create a Modularized and Layered Subprogram Design. Manipulating Data. Open the Cursor. Simple Anonymous Block. debug Functions and Procedures. Handle Exceptions with PL/SQL. User-Defined Exceptions. Declare the Cursor. and Remove a Stored Function. Control side effects when calling Functions. The %ROWTYPE Attribute. WITH Clause. Save and Discard Transactions. the steps to create a stored function. Subqueries.

Statement Level Triggers and Row Level Triggers. Murach and Associates. Test and Remove Triggers. Expert Oracle PL/SQL. Practical 2: Subqueries. Practical (Suggested): Should contain at the least 10 programs. Compound Trigger to Resolve the Mutating Table Error.John Harper. b. Create Instead of and Disabled Triggers. where and order by clause. Select queries on single table using aggregate functions and group by clause. Triggers. Dynamic SQL Functional Completeness. Bill Pribyl Oracle 11g: SQL Reference Oracle press Oracle 11g: PL/SQL Reference Oracle Press. Fifth Edition By Steven Feuerstein. By: Ron Hardman.Dynamic SQL: The Execution Flow of SQL. Practical 1: Select queries and joins a.Michael McLaughlin. Comparison of Database Triggers and Stored Procedures. Select queries on single table using alias. Tata McGraw-Hill Oracle database 11g: hands on SQL/PL SQL by Satish Asnani (PHI) Term Work: Assignments: Should contain at least 6 assignments (one per unit) covering the syllabus. Create Triggers on DDL Statements. By: Michael McLaughlin. System Privileges Required to Manage Triggers Unit-VI Books: Murach’s Oracle SQL and PLSQL by Joel Murach. Creating Compound. Some sample practical are listed below. 1. Tata McGraw-Hill Reference: Oracle PL/SQL Programming. Querying data from multiple tables using all types of joins. Querying single and multiple tables using subqueries. Dynamically Executing a PL/SQL Block. DDL and Event Database Triggers. Configure Native Dynamic SQL to Compile PL/SQL Code. and Firing (Timing). Body. Oracle Database 11g PL/SQL Programming Workbook. Identify the Trigger Event Types. invoke DBMS_SQL Package. Create Database-Event and System-Events Triggers. Manage. Compound Trigger Structure for Tables and Views. 2. Business Application Scenarios for Implementing Triggers. Create DML Triggers using the CREATE TRIGGER Statement and SQL Developer. Declare Cursor Variables. ISBN: 9780070702264. c. the Trigger Event Types and Body. 9    EEE edition . Implement DBMS_SQL with a Parameterized DML Statement. DML and DDL a.

Process a number of rows from a table and populate another table with the results using a cursor FOR loop. Define. c. packages. Using set operators. Practical 7: Functions and Stored Procedures a. c. Cursors with parameters to process a number of rows from multiple tables. 4. c. b. a. Multiple column subqueries. 3. Practical 8: Working with packages a. Practical 10: Working with INSTEAD OF triggers. 5. c. cube and grouping sets. b. PL/SQL Record and FOR loop. packages and views. create. roll up. functions. The triggers must execute procedures that that are placed in a package. Create a table with both BLOB and CLOB columns. Practical 9: Working with Large Objects and triggers a. Use the DBMS_LOB package to populate the table and manipulate the data. Create exception handlers for specific situations. Creating and invoking functions from SQL statements. WITH Clause and hierarchical retrieval. 8. 7. c. Granting and revoking privileges on user objects. Create statement and row triggers. Create instead of triggers for views. Exceptions and procedures issuing DML and query commands. b. Create package specifications and package bodies. Indexes and synonyms.         10    . c. 9. Creating and invoking stored procedures. Recompile invalid procedures. b. Creating simple tables and tables with constraints. Practical 4: Working with advanced subqueries and WITH clause a. Sequences. Scalar subqueries and correlated subqueries. Create triggers for those rules that should be implemented as triggers. Create a one-time-only procedure within a package to populate a PL/SQL table. c. b. Creating anonymous PL/SQL blocks. Invoke the constructs in the packages. date-time functions. Manipulating data (Insert. Practical 5: Basic PL/SQL. a. 10. and use INDEX BY tables and a PL/SQL record. c. subqueries in from clause.b. Implement a number of business rules. a. Re-create the source code for a procedure and a function. INDEX BY tables. b. and views. b. Create procedures that will be invoked from the triggers. business rules and recompiling procedures. b. Controlling user access and using set operators a. Create a package containing an overloaded function. Practical 3: Creating database objects. Creating Views. Create procedures that issue DML and query commands. functions. update and delete) c. Use the DEPTREE_FILL procedure and the IDEPTREE view to investigate dependencies in your schema. Practical 6: Cursors. 6.

private access verses protected access. file operations error handling. overriding and dominating inherited members. pointers to objects. the assignment operator. the this pointer. virtual destructors. comparison of procedural and object oriented approach. overloading the arithmetic assignment. file modes. the constructors and destructor . random access. abstract base classes File Handling: Classes for file stream operations. opening and closing a file. the class destructor . overloading the relational operators . classes . detecting end of file. the copy constructor. polymorphism. command line argument Unit-V Strings and Streams:  the string class interface. structures. protected class members .overloading the stream operators. private member functions. Sc (Information technology) Semester – III COURSE: Object Oriented Programming with C++ Periods per week 1 Period is 50 minutes Evaluation System Lecture 5 TW/Tutorial/Practical 3 Hours Marks Theory Examination 3 100 TW/Tutorial/Practical -- 50   Unit-I Introduction to OOPs: Need object oriented programming. overloading arithmetic operators. characteristics of OOPs – object . static function members Unit-III Operator Overloading: overloading the assignment operator. stream operators.overloading the increment and decrement operators. access functions . overloading the subscript operator Unit-IV Composition and Inheritance: inheritance. conversion operators . constructor initialization lists. operators. the comparison operators. data hiding and abstraction. the copy constructor. an append operator. inheritance. static data members. file pointers and their manipulations. virtual functions and polymorphism. the addition operator .constant objects. constructors. applications of OOPs Unit-II Classes and Objects: Class declaration.CLASS: B. reusability. sequential input and output operations. 11    . access functions.

TataMcGraw-Hill Object Oriented Programming with C++. Sarang 2nd Edition. subclass templates. the standard template library Books: Schaum’s Outline of Theory and Problems of Programming with C++ John R. variables . Practical (Suggested): Should contain at the least 10 programs.(PHI) EEE edition Reference: C++ programming . ios state .Balagurusamy. proprietary libraries. passing template classes to template parameters. Venugopalan. Where getInfo() will be private method. by P. Design the class student containing getData() and displayData() as two of its methods which will be used for reading and displaying the student information respectively. isArmstrong() which will calculate 12    . isPalindrome() will check the given number is palindrome. 2nd Edition. class templates. Some sample practical are listed below. TataMcgrawHill C++ Programming. unformatted input functions . stream manipulators.the istream and ostream classes. ios format flags. P. X-Team Series. unformatted output functions. . M. Design the class Demo which will contain the following methods: readNo() . Term Work: Assignments : Should contain at least 6 assignments (one per unit) covering the syllabus. Hubbard. the ios class.   1 Implement the following a. contents of the standard c headers. container classes. Bjarne Stroustrup Mastering classes. E.factorial() for calculating the factorial of a number. iterator classes Unit-VI Libraries: the standard C++ library. Templates and Iterators: function templates. Robert Lafore.Where getData() will be private method. b. 3rd Edition. string streams. Design an employee class for reading and displaying the employee information. the getInfo() and displayInfo() methods will be used repectively.Fourth Edition. file processing. c. C++ for Beginners. reverseNo() will reverse the given number. Harwani. TataMcGraw-Hill Object Oriented Programming with C++.

2 Implement the following a. Overload the operator + for adding the timings of two clocks. Write a friend function for adding the two different distances and display its sum. Implement the hierarchical inheritance. c. Implement the following a. Show the use of virtual function c. 13    . string comparison. c.g “c” + “++” = c++ 5 Implement the following a. Implement the following a. Write a friend function for adding the two matrix from two different classes and display its sum. b. 4 Implement the following a. Design a class for single level inheritance using public and private type derivation. string concatenation b. Overload the operator unary(-) for demonstrating operator overloading. Design a class Complex for adding the two complex numbers and also show the use of constructor. Design a class Geometry containing the methods area() and volume() and also overload the area() function . Show the implementation of abstract class. c. 3 Implement the following a. using a single class. And also pass objects as an argument. b.the given number is armStrong or not. Design a class for multiple inheritance. using two classes. Implement the concept of method overriding. String operations for string reverse. Overload the + for concatenating the two strings. c. Design a class StaticDemo to show the implementation of static variable and static function. 7. b. 6. b. b.Where readNo() will be private method. For e. Write a friend function for adding the two complex numbers. String operations for string length .

Show the implementation for exception handling for strings c. Sc (Information technology) Semester – III COURSE: Modern Operating Systems Periods per week 1 Period is 50 minutes Evaluation System Lecture 5 TW/Tutorial/Practical 3 Hours Marks Theory Examination 3 100 TW/Tutorial/Practical -- 50           14    .c. Console formatting functions. Show the implementation for the following a. Show the implementation a. Design a editor for appending and editing the files 10. Design the template class library for sorting ascending to descending and vice-versa c. b. 9. Show the implementation of exception handling b. Implement the following: a. Design the template class library for concatenating two strings CLASS: B. Show the implementation of exception handling for using the pointers. Design a class to handle multiple files and file operations c. Show the implementation of template class library for swap function. 8. b. Design a class FileDemo open a file in read mode and display the total number of words and lines in the file.

Greg Gagne. time-sharing.A concept based approach . 8th Edition. STREAMS. Books: Modern Operating Systems. Swapping. real time. Interprocess Communication. System Boot. Mass-Storage Structure: Disk Structure. Thread Scheduling. avoidance and prevention Unit-VI I/O Systems: Application I/O Interface. User Operating-System Interface. File-System Mounting. Unit-III Processes and Process Synchronization: Process Concept. Dhamdhere. Semaphores. Unit-IV Memory Management: Memory management without swapping or paging. RAID Structure. D. Implementing Security Defenses. Types of System Calls.M. Capability-Based Systems. Virtual Memory. Operating-System Generation. Deadlocks . The Critical-Section Problem. Operating-System Structure.Sumitra Devi and N. Peterson’s Solution. System performance.Galvin. Compilers and Interpreters. Linkers. System Calls. Modeling paging algorithms. 2nd Edition. 2nd Edition. distributed and modern operating systems. Performance. McGrawHill publications 15    . System and Network Threats. Desktop Systems. SPD Operating System Concepts. Multithreading Models. Abraham Silberschatz. Transforming I/O Requests to Hardware Operations. Wiley publication Reference: Operating Systems. Language-Based Protection. NFS. Operating Systems. Process Scheduling. Protection and Security: Principles of Protection. multiprocessing. Clustered Systems. A. segmentation Unit-V File-System Interface and Implementation: File Concept. Access Matrix. Peter B. Communication in Client–Server Systems. Page replacement algorithms. Virtual Machines. Threading Issues. Domain of Protection.  Unit-I Introduction to Operating Systems: OS and Computer System. Access Control. StableStorage Implementation. Free-SpaceManagement. OperatingSystem Design and Implementation. K. File Sharing. Assemblers. Operations on Processes. Batch processing. Disk Management. System Programs. Handheld Systems. Design issues for paging systems. Andrew Tanenbaum. Swap-Space Management. Unit-II Operating-System Structures: Operating-System Services. The Security Problem. Classes of OS. Scheduling Criteria. Deadlock detection and recovery.P Banashree. Scheduling Algorithms.

Operating Systems. 3rd Edition .   Case Studies (Suggested): a) b) c) d) e) f) g) h) i) j) k) MS-DOS Windows NT Windows 2008 Server Windows 7 Unix Linux OS/2 MAC OS Symbian Chrome Android                           16    . Godbole and Kahate. Tutorial: At the least three tutorials based on above syllabus must be conducted. McGrawHill publications. Term Work: Assignment: Should contain at least 6 assignments (one per unit) covering the Syllabus.

CASE in detail. User Requirements. Project Planning. Architectural Design : Architectural Design Decisions. Language Processing Systems Object Oriented Design : Objects and Object Classes. Event Processing Systems. Structured Methods. The Rational Unified Process. Systems Engineering. Behavioural Models. CASE Tools. Requirements Validations. Context Models. Components of system such as organization. Requirements elicitation and anlaysis. Software Process. Software Engineering Methods. Availability and Reliability. An object Oriented Design 17    . people and computers. Dealing Legacy Systems. Attributes of good software. Transaction Processing Systems. Documentation of the software requirements Unit-III Requirements Engineering Processes : Feasibility study. Risk Management. Sc (Information technology) Semester – IV COURSE: Software Engineering Periods per week 1 Period is 50 minutes Evaluation System Lecture 5 TW/Tutorial/Practical 3 Hours Marks Theory Examination 3 100 TW/Tutorial/Practical -- 50   Unit-I An Introduction : To Software. Software Requirements: Functional and Non-functional requirements. Data Models. Project Management : Software Project Management. Modular Decomposition Styles. Critical system : Types of critical system. Process Iteration and Activities. Control Styles. Requirements Management. Different software process models. System Requirements. Project Scheduling. Software Engineering. Interface Specification.  CLASS: B. Reference Architectures Unit-IV Application Architectures : Data Processing Systems. Socio-technical system : Essential characteristics of socio technical systems. Dependability of a system. A simple safety critical system. Management activities. Emergent System Properties. Object Models. System Models : Models and its types. Safety and Security of Software systems Unit-II Software processes : Fundamental activities of software process. System Organisation.

Pankaj Jalote. Component Composition. Pearson Education. A practitioner’s approach. PHI(2009) EEE edition Software Engineering principles and practice by WS Jawadekar Tata McGraw-Hill Term Work: Assignments: Should contain at least 6 assignments (one per unit) covering the Syllabus. Algorithmic Cost Modeling. Software Development with Services Books: Software Engineering. “D. Extreme Programming. Test Automation. Design issues. Software Prototyping Unit-V Component based Software Engineering : Components and Component models. Quality Planning. Verification and Validation : Planning Verification and Validation. Software Testing : System Testing. Security Engineering : Security Concepts. Process Change. “Ian Somerville”. Estimation Techniques. 18    . Security Risk Management. System Survivability. Tutorial: At least three tutorials based on above syllabus must be conducted. Component Testing. Software Inspections. Quality Control. The UI design Process. Rapid Application Development.Process. Automated Static Analysis. The CMMI Process Improvement Framework. Pearson education. User analysis. Narosa Publication Reference: Software Design. Software Measurement and Metrics Process Improvement : Process and product quality. Service Engineering. Software engineering. Process Measurement. Verification and Formal Methods.Budgen”. Test Case Design. Tata McGraw-Hill Software Engineering by KL James. Process Analysis and Modeling. Quality assurance and Standards. Interface Evaluation Rapid Software Development : Agile Methods. Software Engineering. Design Evolution User Interface Design : Need of UI design. User Interface Prototyping. Project Duration and Staffing Unit-VI Quality Management : Process and Product Quality. Design for Security. Service Oriented Software Engineering : Services as reusable components. Process Classification. 2nd edition. The CBSE Process. Roger Pressman. 8th edition. Software Cost Estimation : Software Productivity.

Designing the database design 5. digital representation. psycho- 19    . insertion. Types of text.Case Studies (Suggested) 1. Unit-III Text and Image: Introduction. Analog representation. Quantization error. Sc (Information technology) Semester – IV COURSE: Multimedia Periods per week 1 Period is 50 minutes Evaluation System Lecture 5 TW/Tutorial/Practical 3 Hours Marks Theory Examination 3 100 TW/Tutorial/Practical -- 50   Unit-I Introduction: What is multimedia? Defining the scope of multimedia. Structured Approach b. compression. colour models. Object oriented Approach 3. Analyzing a system and specifying the requirements a. Basic steps for image processing. Gamma and gamma correction. Applications of multimedia. pulse modulation. hardware and software requirements. Designing the User interface design 6. Unit-IV Audio and Video technology: Fundamental characteristics of sound. Fourier representation. Types of images. Project Cost Estimation 4. Cost Estimation Techniques 8. Importance and drawback of digital representation. Use of testing methodologies 7. Font. Unit-II Digital representation: Introduction. A to D conversion. Cost benefit Analysis CLASS: B.File formats. D to A conversion. Project Initiation and scheduling. waves. principle and working of scanner and digital camera. need for digital representation. 2. relation between sampling rate and bit depth. multimedia database.

Types of compression. Unit-VI Multimedia presentation and authoring: Overview. additive and subtractive color mixing.   Mini Project: Develop a multimedia application             20    . Koegal Buford-Pearson Education. Raster scanning principles. zip coding. JPEG.basic compression techniques-run length. director. multimedia production. Design paradigms and user interface. Tutorial: At least three tutorials based on above syllabus must be conducted. color fundamentals. Barriers to wide spread use. Books: Principles of Multimedia by Ranjan Parekh. flash and dreamweaver. overview of tools like adobe premier. PHI EEE edition. Fundamentals of multimedia by Ze-Nian Li and MS Drew.acoustics. Liquid crystal display (LCD). Plasma Display Panel (PDP). Huffman’s coding. presentation and automatic authoring. multimedia authoring metaphor. file formats Unit-V Compression and coding: What is compression? Need for compression.   Term Work: Assignments: Should contain at least 6 assignments (one per unit) covering the Syllabus. Tata McGraw-Hill Reference: Multimedia Systems Design by Prabhat K. sensors for TV cameras. Andleigh and Kiran Thakrar-PHI publication Multimedia systems by John F. Overview of Image and Video compression techniques.

Properties of Arrays. traversing. Creating Directories. Linked Implementation. asymptotic notations. Applications. type-casting. RandomAccessFile.Queue Operations.Stack Operations. Unit-II Derived concepts: Inheritance. Operators. Buffered Byte Streams. OutputStream. Filtered Byte Streams. FileOutputStream. Directories. indexed Implementation. PrintStream. Variables. Objects and Methods. Packages and Interfaces. Reader. PushbackReader. The Stream Classes. String handling. FileWriter. time and space complexity. searching. deletion Unit-V Linked Lists – representation of linked list. CharArrayReader. Hash table methods – hashing functions . Stacks. binary search algorithm. method overriding.  CLASS: B. ByteArrayInputStream. InputStream. Arrays . Using FilenameFilter. BufferedReader. Exception Handling. Duplicating an Array. Circular Queue – insertion . Sc (Information technology) Semester – IV COURSE: Java and Data Structures Periods per week 1 Period is 50 minutes Evaluation System Lecture 5 TW/Tutorial/Practical 3 Hours Marks Theory Examination 3 100 TW/Tutorial/Practical -- 50   Unit-I Core Java: Features of Java. Data Types. The Character Streams. FileReader . Writer. SequenceInputStream. JVM. Multithreaded Programming Unit-III The Java I/O Classes and Interfaces: File. Control Statements. Constructor. finalize methods. collision-resolution techniques 21    . Types of data structures. The Byte Streams. Classes. Applications . CharArrayWriter. deletion and doubly linked list. sequential search algorithm. insertion. indexed Implementation. and Arrays. FileInputStream. BufferedWriter. Queue .recursion. . The listFiles( ) Alternative. ByteArrayOutputStream. PrintWriter Unit-IV Data Structures: Complexity and analysis of algorithms – algorithm.

Tata-McGrawhill Data Structures. The X Team SPD Java 2 Complete Reference. linked representations. merge. TataMcGrawhill Data Structures with Java. sequential representation. Tata-McGrawhill Reference: An introduction to data structures with applications. Jean-Paul Tremblay. 5th Edition . threads. 2 Implement the following a. 22    . bubble. P Sorenson. Design a Calculator class in java. Tata-McGrawhill   Term Work: Assignments: Should contain at least 6 assignments (one per unit) covering the Syllabus. Design a java program for different types of inheritance. adjacency matrix. radix . Design a java program for type casting different types of variables. Osborne . c. traversing. Books: Core Java for Beginners. Practical List: 1 Implement the following a. binary search trees ( insertion and deletion).S Lipschutz. path matrix. Sharanam Shah and V Shah. header nodes. and implement all the methods required by calculator operations.Trees. tree . traversing algorithm using stacks. traversing binary tree. AVL trees . b.Binary Trees. J Hubbard. 2nd edition. insertion Graphs – graph theory. B trees Heaps – insertion and deletion Unit-VI Sorting – selection. Warshall’s algorithm. operations. second edition. Design a java class for method overloading and method overriding.

3 Implement the following a. multiplication. Design a java class for performing all the matrix operations i. deletion. Design a class to implement the operations of doubly-linked list. Implement the following a.( insert. 4 Implement the following a. Design a class for sorting the names or numbers in ascending and descending order. Implement the following a. c. Design a class to implement the operations of singly link-list. b. Design a java class for performing all the file-operations. 8. Design a class in java to add two complex numbers using constructors.b. 9. transpose etc. exit) b. Design a class in java for implementing the operations of circular queue. b. Design a java class performing string operations. Show the implementation 23    . sorting. b. c. display) b. 6. Design a java class for implementing the concept of threading and multithreading. b. Design a java class for the use of interface.e addition. display. c. Design a java class for operating the random access files using 5 Implement the following a. Design a java class for implementing the packages. ( insertion . Design a class in java for implementing the operations of queue. 7. delete. Design a class to create a tree and also implement the binary search tree. Implement the concept of hashing technique and also show its collision avoidance. Implement the following a. Design a java class for implementing the operations of stack.

Design a class in java for bubble and merge sort. Lagrange’s Interpolation. Modified Euler’s Method. Runge-Kutta Method for 1st and 2nd Order Differential Equations.Forward Difference. Numerical Integration: Trapezoidal Rule. 10. Interpolation: Interpolation: . Gauss-Seidel Method.Taylor series. b.a. Design a class in java for creating the heap and also show heap sort for it. Unit-II Solution of simultaneous algebraic equations (linear) using iterative methods: Gauss-Jordan Method. Show the implementation for the following a. the Method of False Position. Simpson’s 1/3 rd and 3/8 th rules. Newton-Raphson Method. Solutions of Algebraic and Transcendental Equations using Bisection Method. Euler’s Method. Newton’s Forward Difference Interpolation. Backward Difference. Design a class in java for implementing selection and insertion sort. Sc (Information technology) Semester – IV COURSE: Quantitative Techniques Periods per week 1 Period is 50 minutes Evaluation System Lecture 5 TW/Tutorial/Practical 3 Hours Marks Theory Examination 3 100 TW/Tutorial/Practical -- 50   Unit-I Errors. 24    . Numerical solution of 1st and 2nd order differential equations: . b. Newton’s Backward Difference Interpolation. Design a class in java for implementing the graph   CLASS: B.

Level of Significance. A.Harris.Unit-III Random variables: Discrete and Continuous random variables. Student’s ‘t’ Distribution and its properties.C. Formulation and Graphical solution. Normal.S. Volume 1 and 2. Unit-VI Chi-Square Distribution and its properties. Pune Engineering Mathematics. Griha. Test of Significance for large Samples and small Samples. Probability density function. V.Shastri. Basic solution and Feasible solution. Contingency Table. PHI Applied Numerical Methods for Engineers using SCILAB and C. Karl Pearson’s coefficient and Spearman’ s Rank.K. Yates Correction Mathematical Programming: Linear optimization problem. Primal Simplex Method. ” . Correlation. S. Moments and moment generating functions: Relation between Raw moments and Central moments. One Tailed and Two Tailed Test.Kapoor Reference: Elements of Applied Mathematics.N. Books: Introductory Methods of Numerical Methods.Gupta. Vol-2. S. 25    . correlation coefficient.N.Wartikar and J. Regression coefficients and lines of regression. Thomson Brooks/Cole Term Work: Assignments: Should contain at least 6 assignments (one per unit) covering the Syllabus.S. Fitting the straight line and parabolic curve. Vol-2. Probability distribution of random variables. V. Expected value. P. Robert J. Critical Region. Variance. Test of the Goodness of Fit and Independence of Attributes.Schilling and Sandra L. PHI Fundamentals of Mathematical Statistics. Interval Estimation of Population Parameters. uniform distributions for detailed study.Wartikar. Central Limit theorem (statement only) and problems based on this theorem. Unit-V Sampling distribution: Test of Hypothesis. Poisson. Unit-IV Fitting of curves: Least square method. Distributions: Binomial.Shastri. S. exponential. Covariance.

Program to solve algebraic and transcendental equation by bisection method. Program for Lagrange’s interpolation. Normal and Exponential Populations. single proportion. Computation of correlation coefficient and Fitting of lines of Regression ( Raw and Frequency data ) c. Practical 10: Chi-square test and LPP a. b. Program to solve algebraic and transcendental equation by false position method. c. Practical 1: Solution of algebraic and transcendental equations: a. 3. 4. Practical 7: Moments. Practical 4: Numerical Integration a. b. Program for Newton’s backward interpolation. c. b. Large sample tests-( Single mean. Model sampling from Uniform. b. Practical 6: Random number generation and distributions a. difference between standard deviations. Solution of LPP by Simplex method. Program for Newton’s forward interpolation. b. Program to solve algebraic and transcendental equation by Newton Raphson method.) b. Program to solve differential equation using Runge-kutta 2nd order and 4th order methods.Distribution ( Test for variance. Program to solve differential equation using modified Euler’s method. goodness of Fit. Practical 3: Solving linear system of equations by iterative methods: a. c.Practical List to be performed in Scilab: 1. Program for random number generation using various techniques. Test based on Chi-square. 5. 2. ( Fitting of a straight line. Program for numerical integration using Trapezoidal rule. Program for fitting of Binomial Distribution. Program for fitting of Poisson Distribution. c. Practical 8: Fitting of straight lines and second degree curves a. b. Model sampling from Binomial and Poisson Populations. Practical 2: Interpolation a. Program for numerical integration using Simpson’s 1/3rd rule. and measures of skewness and kurtosis. Spearman’s rank correlation coefficient. Curve fitting by Principle of least squares. 7.               26    . b.) d. d. Program for fitting of Negative Binomial Distribution. Program to solve differential equation using Euler’s method b. Tests based on students ‘t-test’( Single mean. c. Correlation and Regression a. Chi-square test of independence of attributes. Computation of raw and central moments. Practical 5: Solution of differential equations: a. Second degree curve) 9. Program for solving linear system of equations using Gauss Seidel methods. Practical 9: Sampling: a. 8. Program for solving linear system of equations using Gauss Jordan methods. c. difference between means. difference between means and paired ‘t’) 10. difference between proportions. Program for numerical integration using Simpson’s 3/8th rule. 6. c.

CRC .Watchdog Timers. embedded firmware. Device Driver. Sc (Information technology) Semester – IV COURSE: Embedded Systems Periods per week 1 Period is 50 minutes Evaluation System Lecture 5 TW/Tutorial/Practical 3 Hours Marks Theory Examination 3 100 TW/Tutorial/Practical -- 50   Unit-I Introduction: Embedded Systems and general purpose computer systems. sensors and actuators.Flash memory Unit-V Peripherals: Control and Status Registers. Embedded Operating System.  CLASS: B. memory – RAM . infinite loop. ROM. Unit-III Programming embedded systems: structure of embedded program. Selection Process 27    . Application specific ICs. other system components. communication interface. Timer Driver. processor family. operational and non-operational quality attributes. Unit-II Characteristics and quality attributes of embedded systems: characteristics. Real-Time Characteristics. i/o map. COTS. application specific embedded system – washing machine. RISC and CISC controllers. applications and purpose of embedded systems Core of embedded systems: microprocessors and microcontrollers. Programmable logic devices. external peripherals. downloading and debugging Unit-IV Embedded Hardware: Memory map.automotive. Big endian and Little endian processors. types of RAM and ROM. PCB and passive components. history . memory testing. classifications. interrupt map. domain specific . compiling . linking and locating.

References: Embedded Systems.O'Reilly Introduction to embedded systems. 6) Using D/A converter generate sine wave on oscilloscope with the help of lookup table stored in data area of 8051. 4) Interface 8051 with D/A converter and generate square wave of given frequency on oscilloscope. 5) Interface 8051 with D/A converter and generate triangular wave of given frequency on oscilloscope. Signify end of message by carriage return. Michael Barr . Tutorial: At least three tutorials based on above syllabus must be conducted. 7) Interface stepper motor with 8051 and write a program to move the motor through a given angle in clock wise or counter clock wise direction. types of file generated on cross compilation. Unit-VI Books: Programming Embedded Systems in C and C++. disassembler/ decompiler. First Edition January. 2) Port I / O: Use one of the four ports of 8051 for O/P interfaced to eight LED’s. Rajkamal. Shibu K V TataMcGraw-Hill. emulator and debugging . 8) Generate traffic signal. ____________________________________________________________________      28    . simulator . Practical List: 1) Configure timer control registers of 8051 and develop a program to generate given time delay. TataMcGraw-Hill Term Work: Assignments: Should contain at least 6 assignments (one per unit) covering the Syllabus. Simulate binary counter (8 bit) on LED’s 3) Serial I / O: Configure 8051 serial port for asynchronous serial communication with serial port of PC exchange text messages to PC and display on PC screen. embedded product development life-cycle.Design and Development: embedded system development environment – IDE. trends in embedded industry. 10) Elevator control. 9) Temperature controller.

 TW/tutorial/practical total 50 marks  Minimum 40% marks out of 100 for passing in theory and 20 marks out of 50 for passing in  TW (tutorial/practical/case studies). Mini  Project and Practical for SYBSc:    • • • Marks  distribution  for  subjects  having  Practical  and  for  the  subjects  having  Tutorials  and  case studies.Sc –IT   1) Evaluation Pattern for Term work( Tutorial. Computer Graphics P3.  Theory 100 marks per paper.    University of Mumbai B. Object Oriented Programming with C++ P5. Advanced SQL P4. Assignments . Case Studies.Logic and Discrete Mathematics Yes No (100)  P2. Modern Operating Systems Yes  Practical  (100)  (25)  Yes  Practical  (100)  (25  Yes  Practical  (100  (25)  Yes  Case studies  (15)  (100)          29    Yes Yes Yes  (25)  (15)  (10)  No  Yes  Yes  (15)  (10)  Yes  Yes  (15)  (10)  Yes  Yes  (15)  (10)  Yes  Yes  Yes  (10)  (15)  (10)  No  No  100+50 100+50  100+50  100+50  100+50  .     Semester III    Term work(50) Subject  Theory  Practical /  (100)  Case studies  Total Tutorial Assignments  Class  tests  Total    P1.

IV are college examinations. 30    . II. Question papers will be set by the examiners appointed by the Principal/Heads of the affiliated colleges or University Departments. IV semesters the assessment will be done by the respective colleges. • Semesters I. Test could be out of any sum total but is to be converted out of 10. Embedded Systems Yes Case studies  Yes Yes Yes  (100)  (15)  (10)  (15)  (10)  Yes  Mini Project  Yes  Yes  Yes  (100)  (15)  (10)  (15)  (10)  Yes  Practical  No  Yes  Yes  (100)  (25)  (15)  (10)  Yes  Practical  Yes  Yes  (100  (25)  (15)  (10)  Yes  Practical  Yes  Yes  (100)  (25)  (15)  (10)  No  No  100+50 100+50  100+50  100+50  100+50  • Tutorials are theory/problems to be solved by the students in the classroom at the end of a practical/Theory session. Multimedia P3. Quantitative Techniques P5. Moderation and result preparation will be as per existing College / University rules in respect of other similar courses. III. • ATKT/Failures examination: After 15 to 20 days from the date of declaration of results of the semester in question. III. Java and Data Structures P4. • Test is conducted in the classroom with due notice. • Assignments are theory/problems to be solved by the students at home. • In respect of I. II.Semester IV      Subject  Term Work (50) Theory Practical / (100)  Case studies/ Tutorial Total Assignment Class tests  s    Total   Mini Project P1. Software Engineering P2. • The Principal/Head of the respective colleges is expected to appoint senior faculty as examiners in each subject.The Record of term work is to be maintained at least for the year after the declaration of the result.

Sc. V & VI Program: T. T Subject: Information Technology (with effect from the academic year 2012 2012–2013) 2013) . B. Sem.Sc.UNIVERSITY OF MUMBAI Syllabus for the T.Y.B.Y.

Security Mechanisms. Cryptanalysis of the Vigenere Cipher. MTI Key Agreement Protocols. DES Modes of Operation. The Station-to-station Protocol. The Digital Signature Standard. A Discrete Log Hash Function. The Substitution Cipher. Key Predistribution .509 Authentication Service. Huffman Encodings and Entropy. The RSA Cryptosystem. A Time-memory Trade-off. Radix-64 Conversion. Hash Functions from Cryptosystems. The Decryption Exponent. The Euclidean Algorithm. Security Attacks. Description of DES. Shannon’s Theory. The Rabin Cryptosystem. Cryptanalysis. The MD4 Hash Function. Electronic Mail Security. The Permutation Cipher. Fail-stop Signatures Hash Functions Signatures and Hash Functions. A Kerberos Encryption Techniques. S/MIME. Other Useful Facts. Key Terms. Entropy. The Vigenere Cipher. Extending Hash Functions. Spurious Keys and Unicity Distance The Data Encryption Standard. Key Agreement Using Self-certifying Keys. Kerberos. Introduction to Public-key Cryptography. Review Questions. Sc (Information technology) SUBJECT: Network Security Periods per week Lecture 1 Period is 50 minutes TW/Tutorial/Practical Evaluation System Unit-I Theory Examination TW/Tutorial/Practical Semester – V 5 3 Hours 2 -- Marks 60 40 Cryptography: Introduction: Some Simple Cryptosystems. Unit-III Security Trends. Cryptanalysis of the LFSR-based Stream Cipher. Public-Key Infrastructure. Undeniable Signatures. Blom’s Scheme. Diffie-Hellman Key Predistribution. An Attack on a 6-round DES. Stream Ciphers. The Chinese Remainder Theorem. Attacks On RSA. Key Terms.1 Method. PGP Random Number Generation . An Example of DES Encryption. Key Distribution and Key Agreement Introduction. Dixon’s Algorithm and the Quadratic Sieve. and Problems. Differential Cryptanalysis. Probabilistic Primality Testing. One-time Signatures. The p . Recommended Reading and Web Sites. The ElGamal Signature Scheme. DES in Practice. A Model for Network Security Unit-IV Authentication Applications: Kerberos. Partial Information Concerning Plaintext Bits.CLASS: B. Cryptanalysis of the Affine Cipher. A Data Compression Using Zip. Review Questions. The Hill Cipher. The Affine Cipher. Properties of Entropy. Collision-free Hash Functions The Birthday Attack. More Number Theory. The Shift Cipher. The OSI Security Architecture. Diffie-Hellman Key Exchange. Implementing RSA. Timestamping. and Problems. Security Services. The DES Controversy. Factoring Algorithms in Practice Unit-II Signature Schemes : Introduction. Cryptanalysis of the Substitution Cipher. An Attack on a 3-round DES. X. Factoring Algorithms. Perfect Secrecy. Pretty Good Privacy.

Fourth Edition. Common Criteria for Information Technology Security Evaluation. c Write a program to perform transposition ciphers to encrypt the plain text to cipher and to decrypt it back to plain text using Columnar with multiple rounds. Encryption. Books: Cryptography: Theory and Practice. b Write a program to perform substitution ciphers to encrypt the plain text to Modified Caesar cipher and to decrypt it back to plain text. Authentication Header. Key Management. Distributed Denial of Service Attacks. Key Terms. Malicious Software: Viruses and Related Threats. Vikas publication. Encapsulating Security Payload. b Write a program to perform transposition ciphers to encrypt the plain text to cipher and to decrypt it back to plain text using Simple Columnar technique. (Unit: III-VI) References: Information Security and cyber laws. Unit-VI Intruders: Intrusion Detection. Security. Ankit Fadia and J. Web Security: Web Security Considerations. Virus Countermeasures. Firewalls: Firewall Design Principles. CRC Press. CRC Press LLC (Unit I and II) Cryptography and Network Security Principles and Practices. Douglas Stinson. Saurabh Sharma. IP Security Architecture.Unit-V IP Security: IP Security Overview. . William Stallings. PHI(Pearson). Trusted Systems. d Write a program to perform substitution ciphers to encrypt the plain text to monoalphabetic cipher and to decrypt it back to plain text. Combining Security Associations. Write a program to perform substitution ciphers to encrypt the plain text to f polyalphabetic cipher and to decrypt it back to plain text. c Write a program to perform substitution ciphers to encrypt the plain text to homophonic cipher and to decrypt it back to plain text. 2 Transposition Ciphers a Write a program to perform transposition ciphers to encrypt the plain text to cipher and to decrypt it back to plain text using rail fence technique. Recommended Reading and Web Sites. Vikas publication Term Work: Assignments: Should contain at least 6 assignments (one per unit) covering the Syllabus. student series. Recommended Reading and Web Site. e Write a program to perform substitution ciphers to encrypt the plain text to homophonic cipher and to decrypt it back to plain text. Bhattacharjee. Secure Electronic Transaction. Practical List: 1 Substitution Techniques a Write a program to perform substitution ciphers to encrypt the plain text to Caesar cipher and to decrypt it back to plain text. Secure Socket Layer and Transport Layer. Password Management.

Variables and expressions. Write a program to generate assymmetric Keys for the following Cipher algorithms a) DSA (Digital Signature Algorithm). SDBMHash. debugging and error handling. Blowfish. Link Label. 10 Create a permission that controls access to pages of a book. Forms (Menus and ToolBars. HmacMD5 and HmacSHA1. Delegates and Events. List View. OOPs with C#. exporting and validating Digital Certificate. a colon. Defining classes and class members. BKDRHash. 9 Write a program for creating. CLASS: B. AES. Label .NET with C# Periods per week 1 Period is 50 minutes Lecture TW/Tutorial/Practical Evaluation System Theory Examination TW/Tutorial/Practical Unit-I Unit-II 5 3 Hours 2 -- Marks 60 40 Review of . Triple DES Write a program to encrypt input string by using SecretKey of the following algorithms. Radio Button. Garbage Collector. algorithms. Checked List Box. DSA Implement following HashFunctions: RSHash. Write a program to encrypt input string by using SecretKey of the following algorithms. Sc (Information technology) Semester – VI SUBJECT: ASP. Introduction to C#. AES c. . Private and Shared Assembly. Rich TextBox. Comparisons and Conversions. List Box. flow controls.D 3 4 5 6 7 Write a program to encrypt a plain text to a cipher text and decrypt it back to plain text using vernam cipher as the transposition technique Write a program to generate Symmetric Keys for the following Cipher algorithms DES. c) RSA. Tabbed ). JIT compiler. Windows programming: Controls(Button. Use the following algorithms for encryption and decryption: a. DES b. and then decrypt the encrypted string and compare the decrypted string with the input string. and then decrypt the encrypted string and compare the decrypted string with the input string.NET frameworks. b) DH (DiffieHellman). IDEA d. CheckBox. Namespaces Collections. functions. The permission name consists of a book id. SDI and MDI applications. RSA b. Text Box. TripleDES. DJBHash 8 Write a program to encrypt the given string by using RC4 . MD5. Building MDI applications. Assembly. and a set of allowable pages. BlowFish c. Components of Assembly. Use the following algorithms for encryption and decryption: a. JSHash.

NET Technology. J. D. Tata McGraw-Hill (Unit III to VI). Patel.ToDouble() command was used to convert the input from the console to a double.NET Security: Authentication. Using ASP. Reid. ASP.NET framework. LINQ: Operators. Microsoft Press (Dreamtech). Simple Programs with C#: a) Write a console application that obtains four int values from the user and displays the product. Kanjilal. JQuery syntax.D.NET provider model ASP.0 programming. C. data types and variables.NET CSS: Need of CSS.ADO. ASP.ToInt32(). ASP. Authorization.NET. TMH Advanced . retrieving and manipulating data with SQL. ASP.NET. Web. Vijay Nicoel. Wrox (Wiley) 2010.NET 4: Microsoft. modifying DOM with JQuery. ADO. Working with CSS with visual developer ASP. JQuery: Introduction to JQuery.H Padderson. Dreamtech. Impersonation. ASP.NET architecture. Practical: 1. Spanjaars.NET 4. Watson. J. Caching.NET web pages: Introduction.config and global. deploying the web site. K. . Term Work: Assignments: Should contain at least 6 assignments (one per unit) covering the Syllabus.asax files.Skinner. statements. Programming ASP. Beginning ASP.NET data control. LINQ to objects. (Unit I and II). organizing code.NET lifecycle.NET state management engine. Navigation: Using navigation controls. Unit-IV Unit-V Unit-VI Books: Beginning Visual C# 2010. Query Syntax ASP. Themes in ASP. programmatic redirection User Controls: Introduction to user controls Validating User Controls Databases: Introduction. the equivalent command to convert from a string to an int is Convert.NET. Master Pages.XML.NET server controls: Types of control. ASP.NET Ajax: Introducing AJAX.NET. Crystal reports. M.NET AJAX. Nagel.NET 4 in C# and VB. effects with JQuery. I. Web Services and Page methods in AJAX websites.Esposito. Reprint 2011. working with ADO. Introduction to CSS. J. Hint: you may recall that the Convert. Using SQL to work with database.NET Visual C#. data source control. Reprint 2011 (Unit III to VI).Unit-III Introduction to ASP. JQuery and extensibility. object oriented basics. implementations. References: Programming ASP.

Then display these values. vi. Programs securing web pages. Program with different features of C# Function Overloading Operator Overloading Inheritance (all types) Constructor overloading Interfaces Using Delegates and events Exception handling 3. Generate Fibonacci series. v.b) If you have two integers stored in variables var1 and var2. Generate prime numbers. 4. d) Write a console application that places double quotation marks around each word in a string e) Write an application that uses two command-line arguments to place values into a string and an integer variable. Use of foreach loop with arrays. 6. but rejects any input where both numbers are greater than 10 and asks for two new numbers. f) Write an application that receives the following information from a set of students: Student Id: Student Name: Course Name: Date of Birth: The application should also display the information of all the students once the data is entered.NET Server controls. Implement this using an Array of Structs. Generate various patterns (triangles. iv.NET and ADO. g) Write programs using conditional statements and loops: i. Test for prime numbers. iii. obtains two numbers from the user. 9. 5. respectively. Object oriented programs with C# a. . vii. and displays them. Test for vowels. b. Programs using AJAX. ii. Programs using CSS.NET 7. 2. diamond and other patterns) with numbers. Programs using different controls. Programs using ASP. what Boolean test can you perform to see if one or the other (but not both) is greater than 10? c) Write an application that includes the logic from Exercise 1. Programs using Language Integrated query. Database programs with ASP. Reverse a number and find sum of digits of a number. Programs using JQuery. 8. Program using classes. 10.

Cambridge University Press. Second Edition. Paul Ammann. Cambridge University Press. M. Unit-II Functional Testing: Boundary value Testing. Equivalence class testing. System Testing. Object Oriented Integration Testing. Managing the Testing Process: Practical Tools and Techniques for Managing Hardware and Software Testing. Term Work: Assignments: Should contain at least 6 assignments (one per unit) covering the Syllabus. Unit-III Structural Testing: Path Testing. Metrics and Reports. (Unit. Retrospection. software quality. Interaction Testing Unit-V Object Oriented Testing: Issues. Object Oriented System Testing Unit-VI Testing Process: Planning. Second Edition. Wiley. TMH.I and VI) Software Testing A Craftman’s Approach. Limaye. Sc (Information technology) Semester – V SUBJECT: Software Testing Periods per week 1 Period is 50 minutes Evaluation System Lecture TW/Tutorial/Practical Theory Examination TW/Tutorial/Practical 5 3 Hours 2 -- Marks 60 40 Unit-I Introduction to quality. Techniques and Tools. fundamentals of software testing. Data Flow Testing. Software testing by Sandeep Desai. Decision Table based testing. . Software Testing. (PHI) EEE edition. Rex Black.CLASS: B. 2012 Introduction to Software Testing. Abhishek Srivastava. Perry. Jeff Offutt.SAMS Software Testing.(Unit-II to V) References: Software testing by Yogesh Singh. CRC Press.G. Improvements. Class Testing. Integration Testing. Quantitative and Qualitative Analysis. Retrospection Unit-IV Levels of Testing. Wiley India.Ron Patton. VV model of testing. Paul C. Jorgensen. Books: Software Testing Principles.

Implement the process Object oriented testing 9. 2. coding and test plan. Performance Testing(use WAPT) 8. Cause-effect graphs 5. Path testing b.g winrunner. testdirect. . AUTOMATED TESTING for websites a. Functional Testing a. Blackbox Testing d. design. Regression Testing (use VTEST tool) using automated testing for website. Unit Testing e. Boundary value Testing b. Load Testing(use WAPT) b. Study of any one of the testing tools. Data-flow testing 6. For automated testing. Structural Testing a. 10. design the test plan and test cases for integration testing on the given case. 7. Prepare a small project and submit SRS. Equivalence class testing c. For automated testing. Whitebox Testing c.etc) 3. design the test plan for unit testing.Practical: 1. Decision Table based testing d. ( e. MANUAL TESTING for the project a. Walkthrough b. Integration Testing 4.

Executing SQL statement. Building a web services using JAX-WS. Accessing beans . getting started with struts. creating a java bean class. Writing the application. Adding the required library files. compiling and building the web application Unit-III JDBC: Design of JDBC. application development approach. Trees. Struts framework core components. JSF web applications (login form. JSP v/s Servlets. JSP elements. JSF configuration. adding a mapping resource. JSF as an application. Query Execution. creating JSPs. scope. JSP documents. ServletRequest and ServletResponse Interfaces. Working with servlets: organization of a web application. JAVAMAIL: Mail Protocols. JNDI. unified expression language. implicit objects. types of beans. Unit-V HIBERNATE: Introduction. JAVAMAIL API. Directory service. Servlet Lifecycle. JNDI: NAMING Service. HttpServletRequest and HttpServletResponse Interfaces. creating web applications. characterquoting conventions. metadata. Component Organizers Unit-II Introduction to servlets: Need for dynamic content. JSF lifecycle. Progress Indicators. components of JSF. why servlets? Servlet API and Lifecycle: servlet API. creating hibernate configuration and mapping file. HttpSession Interface. row sets.CLASS: B. Components of the Javamail API. creating a web application. building and running web application. JSF pages) EJB: Enterprise bean architecture.HttpServlet Class. Building web service. Text Components. Unit-VI WEB Services: SOAP. ServletInputStream And ServletOutputStream Classes. Unit-IV Java server Faces : Need of MVC . creating JSP file. Comments. . Transaction. JDBC configuration. creating web client. java servlet technology. what is JSF?. creating a web application(using netbeans) . Benefits of enterprise bean. servletConfig interface. JFrames. creating a servlet. JSP: Introduction. STRUTS: Introduction. Resources and JNDI.RequestDispatcher Interface. installing and setting up struts. Tables. GenericServlet Class. Action elements. packaging beans. Scrollable and updatable result sets. Lists . Sc (Information technology) Semester – VI SUBJECT: Advanced Java Periods per week 1 Period is 50 minutes Evaluation System Lecture TW/Tutorial/Practical Theory Examination TW/Tutorial/Practical 5 3 Hours 2 -- Marks 60 40 Unit-I Swing: Event Handling. disadvantages. Lifecycle of JSP. creating enterprise bean. creating database and tables in MySQL. Starting with API.

a. SPD (Unit II to VI) Core Java Vol. C Xavier. McGraw Hill Java Server Faces A practical Approach for beginners.TMH. Develop a JSP Application to accept Registration Details form user and Store it into the database table. Write a java program using Split pane to demonstrate a screen divided in two parts. c. Dreamtech. Develop Simple Servlet Question Answer Application to demonstrate use of HttpServletRequest and HttpServletResponse interfaces. Savaliya. Write a java program to present a set of choices for a user to select Stationary products and display the price of Product after Selection from the list. . Develop a JSP Application to Authenticate User Login as per the registration details. Term Work: Assignments: Should contain at least 6 assignments (one per unit) covering the Syllabus. Develop a simple “Hello World” Web Service with SOAP in Java. Develop a web application to add items in the inventory using JSF. When user selects the planet name form Left screen.Develop a simple Struts Application to Demonstrate E-mail Validator. JPA and struts 2 for beginners. Cay S. one part contains the names of Planets and another Displays the image of planet. Develop a Room Reservation System Application Using Enterprise Java Beans. Write a java program to demonstrate typical Editable Table.-.Books: Java EE 6 for Beginners. %) using ServletInputStream and ServletOutputStream. Practicals: 1. (Unit I) References: Java EE Project using EJB 3. Develop a Simple Web Service and Client with JAX-WS. Vaishali Shah. If login success the forward user to Index Page otherwise show login failure Message. Develop a Hibernate application to store Feedback of Website Visitor in MySQL Database. describing employee details for a software company. 5. 2.Develop a simple Struts Application to Demonstrate 3 page Website of Teaching Classes which passes values from every page to another. 6. b. a . 9. 3. Advanced Java Technology. II – Advanced Features. 11. Seventh Edition. Shah. 7. appropriate image of planet displayed in right screen. /. Eastern Economy Edition (PHI).*. Develop Servlet Application of Basic Calculator (+. 12. Eight Edition. B M Harwani. Develop an application to show searching the Directory using JNDI capabilities. 4. Herbert Schildt. Sharanam Shah. Pearson (Unit I and III) Java Complete Reference. 10. 8. Horstmans. SPD Java Programming A practical Approach. Gary Coronell. b.

Bootstrapping. Understanding Subnetting.rsh . Starting the Samba Server. sync. LILO. Configuring an NFS Server. Linux.rlogin. SSH. Installing and Configuring Application Software. Comparing xinetd and Standalone. Installing and Configuring Servers. rc scripts. The File System: Understanding the File System Structure. Sc (Information Technology) Semester – V SUBJECT: Linux Administration Periods per week 1 Period is 50 minutes Evaluation System Lecture TW/Tutorial/Practical Theory Examination TW/Tutorial/Practical 5 3 Hours 2 -- Marks 60 40 Unit-I Introduction: Introduction to UNIX. The Network File System: NFS Overview. Setting Up a Network Interface Card (NIC). Creating Samba Users 3. Providing a Caching Proxy Server. Configuring the Samba Server. Network Configuration Files.CLASS: B. Linux Machine as a Server. Working with LinuxSupported File Systems. Examining NFS Security Unit-III Connecting to Microsoft Networks: Installing Samba. Optimizing Network Services Internet Services: Secure Services. Editing Your Network Configuration TCP/IP Networking: Understanding Network Classes. Using Tools to Monitor Security Booting and shutting down: Boot loaders-GRUB. The Linux System Administrator. Configuring a Secure System. Init process. System Environmental Settings. sftp Less Secure Services (Telnet . Using Automount Services. . Configuring Linux Firewall and ntalk. Monitoring and Tuning Performance. Configuration Tool. Configuring the Network Using the Network. Backing Up and Restoring Files. Connecting from a Windows PC to the Samba Server Additional Network Services: Configuring a Time Server. Planning an NFS Installation. Connecting to a Samba Client. Linux Disk Management Network Configuration Files: Unit-II System Configuration Files: System wide Shell Configuration Scripts. Working with Gateways and Routers. scp. Configuring an NFS Client. Configuring the xinetd Server. Configuring Dynamic Host Configuration Protocol. Enabling and disabling services.FTP.finger. GNU and Linux distributions Duties of the System Administrator. Memory and Virtual File Systems. Managing the init Scripts. Creating and Maintaining User Accounts.

Partitioning drives b. Advanced FTP Server Configuration. Mail User Agent (MUA). S. Linux: Complete Reference. Serving Email with POP3 and IMAP.Unit-IV Unit-V Unit-VI Domain Name System: Understanding DNS. Configuring Apache. Tata McGraw-Hill. Beginning Linux by Neil Mathew 4th Edition 2. Examining Server Configuration Files. Optimizing DNS Services. Programming Shell scripts for Linux administration . Optimizing Mail Services. Using the Postfix Mail Server. Practical: 1. Implementing SSI. Enabling PHP. Optimizing Web Services System Administration: updating system. Tata McGraw-Hill Term Work: Assignments: Should contain at least 6 assignments (one per unit) covering the Syllabus. Optimizing Internet Services: Optimizing LDAP Services. Configuring Sendmail. Fifth Edition. Understanding Types of Domain Servers. Creating password and user accounts f. Richard Petersen. Introducing SMTP. UNIX: Concepts and techniques. Das. Configuring vsftpd. Tata McGraw-Hill 3. Administering Users and Groups Installing and Upgrading Software Packages Books: 1. Configuring a Secondary Master DNS Server. Red hat Linux Networking and System Administration by Terry Collings References: 1. Setting Up Web-Based Email. Adding Search Functionality. Optimizing FTP Services. Checking Configuration Configuring Mail Services: Tracing the Email Delivery Process. Enabling CGI. 6th Edition. Creating a Secure Server with SSL Providing Web Services: Creating Mailing Lists. Installation of Red HAT/Fedora Linux operating system. Configuring boot loader (GRUB/LILO) c. Linux Administration: A Beginner's Guide. Configuring a Caching DNS Server. 2. Configuring an RSS Feed. a. Network configuration d. Maintaining Email Security Configuring FTP Services: Introducing vsftpd. Configuring a Primary Master Server. Software selection and installation 3. Setting time zones e. upgrading and customizing kernel. Wale Soyinka. Shutting down 2. Using SFTP Configuring a Web Server: Introducing Apache.

change default desktop to KDE (or Gnome) d. Installing TrueType fonts from my MS Windows partition. Accessing X-window remotely. 11.up connection with the internet configuration wizard c. set up my video card. Implementing Socket programs. 10. Install KDE. Configuring TCP/IP e. Temporarily changing user identity with su command c. Programming using C. Connecting to the internet and configuring samba a. Display and Control a Remote Desktop using VNC. Linux system administration a. Adding windows computer’s to user LAN f. Becoming super user b. Setting up linux as a proxy server e. Configuring mozilla or firefox to use as a proxy 6. Server setup and configuration a. Setting up hardware devices including sound card and printers and others(USB devices etc). Securing linux with IP table firewalls c.4. Setting up proxy server 8. LAN equipment c. Launching PPP connection d. f. The Apache web server d. Setting up local area network a. Creating a dial. monitor and mouse for the X-server. c. Using graphical administrative tools d. Working with X-windows a. Configuring an IP table firewall d. Setting up dial-up PPP b. e. IP address classes 7. LINUX security checklist b. Securing Linux features 9. Setting up Samba file server c. Switching between text and graphical consoles b. Setting up FTP server e. Setting up NFS file server b. LAN topologies b. 12. . Networking with TCP/IP d. Administrative commands e. Understanding COMPUTER SECURITY: Firewall and security configurations a. Administrative configuration files 5.

Internet Control Message Protocol Version 4 (ICMPv4). Behrouz A. D. B. Fifth Edition.P. IPV 4 and IPV6 Addresses and Protocol Unit-II Address Resolution Protocol (ARP).Mobile IP. Volume III. PHI TCP/IP Illustrated.L. PHI Internetworking with TCP/IP.Siva Selvan. Stream Control Transmission Protocol (SCTP) Unit-IV Host Configuration: DHCP. Comer. Remote Login: TELNET and SSH. Stevens. Domain Name System (DNS). POP. Unicast Routing Protocols (RIP. Comer. Network Management: SNMP. Transmission Control Protocol (TCP). TCP/IP Protocol Suite. Eastern Economy Edition. PHI (Unit VI) References: Internetworking with TCP/IP. Iterative connectionless(TCP) and connection oriented servers(UDP. Forouzan. Multimedia Unit-VI Client Server Programming: Concurrent Connection Oriented (TCP) and Connectionless programming(UDP). Gopalan. Volume II. Stevens.CLASS: B. Volume I. Sc (Information technology) Semester – VI SUBJECT: Internet Technologies Periods per week 1 Period is 50 minutes Evaluation System Lecture TW/Tutorial/Practical Theory Examination TW/Tutorial/Practical 5 3 Hours 2 -- Marks 60 40 Unit-I Introduction: OSI Model. User Datagram Protocol (UDP). Electronic Mail: SMTP. IMAP and MIME.L.N. File Transfer: FTP and TFTP Unit-V World Wide Web and HTTP. Network Layer. Second Edition. Third Edition. PHI Term Work: Assignments: Should contain at least 6 assignments (one per unit) covering the Syllabus. OSPF and BGP) Unit-III Transport Layer. TMH (Unit I – V) Internetworking with TCP/IP. D. Douglas E. Douglas E. . Douglas E. Books: TCP/IP Protocol Suite. Comer. 4th Edition .

classification of signals. Parsevals identity for Fourier series. Sc (Information technology) Semester – VI SUBJECT: Digital Signals and Systems Periods per week 1 Period is 50 minutes Evaluation System Lecture TW/Tutorial/Practical Theory Examination TW/Tutorial/Practical 5 3 Hours 2 -- Marks 60 40 Unit-I Classification of Signals and systems: Introduction. analog to digital conversion of signals Fourier Analysis of Periodic and Aperiodic Continuous Time Signals and Systems: Introduction. Write aJAVA code to simulate the main module of TCP. Application of LT in analysing networks. Write a JAVA code to implement the routing algorithm for RIP. Table of Laplace transforms.Practical: 1. S-plane Poles and zeros. LT of periodic functions. Unit-II Applications of Laplace Transform to System Analysis Introduction. partial fraction expansions. 5. Complex or exponential form of Fourier series. convolution integral. Write a JAVA code that calculates the checksum of UDP datagram. region of convergence (ROC) LT of some important functions. Write a function in JAVA to simulate the cache control. network transfer function. classification of systems. Write a JAVA code to find the shortest path between two points in the network. 9. . Fourier transforms of power and energy signals. Write a JAVA client/server UDP code in which a client greets the server and the server send date and time to the client. simple manipulations of discrete time signals. CLASS: B. Initial and final value theorems. Fourier transform and its properties. Write a JAVA client/server TCP code to illustrate simple chat application. Write a JAVA client/server TCP code in which a client sends a number to server and server responds by returning its factorial. input and output modules of ARP. 2. 10 Write JAVA client/server UDP code where client send series of numbers to server and server returns greatest among them. 4. 6. amplitude and phase spectra. 7. Continuous Time and discrete time signals. Fourier transforms of some important signals. Power spectrum of a periodic function. definition. 8. Write a JAVA code for TCP echo Server application. trigonometric Fourier series. 3.

Books: Digital Signal Processing by S. frequency response of linear phase FIR filters. impulse response and frequency response. Hamid Nawab. Unit-IV Linear Time Invariant Systems: Introduction. Willsky with S. Third Edition. IIR filter design by impulse invariant method. . Gnanapriya Second Edition. Discrete time Fourier transform (DTFT). Mitra. IIR filter design by approximation of derivatives. discrete Fourier series. Correlation. Salivahanan. Chebyshev filters. Unit-VI Finite Impulse Response (FIR) Filters Introduction. Design techniques of FIR filters. Composite radix FFT. IIr filter design by the bilinear transformation. Fast Fourier transform (FFT). TMH References: Digital Signal Processing by Sanjit K. Wiley India. Discrete convolution. Butterworth filters. Infinite Impulse Response (IIR) Filters: Introduction. Second Edition. C. Second Edition. Term Work: Assignments: Should contain at least 6 assignments (one per unit) covering the Syllabus. TMH Signals and systems by A Anand Kumar (PHI) 2011 Signals and Systems by Alan V. Frequency domain representation of discrete time signals and systems. Fast (Sectioned) convolution. magnitude response and phase response of digital filters. properties of DSP system. definition of z-transform. Unit-V Discrete and Fast Fourier Transforms: Introduction.Unit-III Z Transform: Introduction. Oppenheim and Alan S. Computing an inverse DFT by doing direct DFT. design of optimal linear phase FIR filters. properties of z-transform. Difference equation and its relationship with system function. frequency transformation. PHI (EEE) Digital Signal Processing by Apte. evaluation of inverse z-transform. Elliptic filters. solution of linear constant coefficient difference equation.

Practical : ( To be conducted using Scilab / MATLAB)
1. Write a program to study and implement Discrete Time Signals and systems.
a. Unit Step Sequence
b. Unit Ramp Sequence
c. Exponential Sequence
d. Exponential Increasing Sequence
e. Exponential Decreasing Sequence
f. Even Signals
g. Odd Signals

Write a program to implement Z-Transforms.
a. Z-transform of Finite duration signals
b. Time shifting property of Z transform
3. Write a program to demonstrate convolution property.
4. Write a program to demonstrate correlation property.
5. Write a program to implement Frequency Response of First order Difference
6. Write program to
a. Determine N-Point DFT.
b. Find DFT and IDFT of the given sequence.
7. Write a program to implement circular convolution using DFT
8. Write a program to perform linear filtering (linear convolution using DFT.
9. Write a program to implement/Design of FIR Filter using Frequency Sampling
10. Write a program to implement low pass, high pass and band pass filters.

CLASS: B. Sc (Information technology)

Semester – VI

SUBJECT: Data warehousing
Periods per week
1 Period is 50 minutes


Evaluation System

Theory Examination




History of data warehousing: database management system, personal computers
and 4GL technology, spider web environment, evolution from business
perspective, data warehouse environment, what is datawarehouse? , integrating
data, volumes of data, different development approach, evolution to DW 2.0
environment, business impact of the data warehouse, components of
datawarehouse environment, evolution of data warehouse from the business
perspective, other notions about data warehouse, federated data warehouse, star
schema, data mart.

Introduction: Lifecycle of data warehouse, reasons for different sectors,
metadata, Access of data, structures data/ unstructured data, Textual analysis,
blather, issue of terminology, specific text, metadata – a major component, local
metadata, changing business requirements, flow of data within DW 2.0, volumes,
useful applications, DW 2.0 and referential integrity, reporting in DW 2.0
DW components: Interactive sector, integrated sector, Near Line sector, Archival

Metadata in DW: Reusability of data analysis, Metadata, Active/ passive
repository, enterprise metadata, metadata and the system record, Taxonomy,
Internal and external taxonomy, metadata in archival sector, maintaining
metadata, using metadata – an example, end user perspective.
Methodology and Approach for DW: Spiral model methodology, seven streams
approach, enterprise reference model, enterprise knowledge coordination stream,
information factory development stream, Data correction stream, infrastructure
stream, Total information quality management stream.
Statistical processing and DW: Two types of transaction, statistical analysis,
integrity of comparison, heuristic analysis, freezing data, exploration processing,
frequency of analysis, exploration facility, sources for exploration processing,
refreshing exploration data, project based data, Data marts and exploration
facility, A backflow of data, using exploration data internally, perspective of
business analyst.


Data models and DW: datamodel and business, scope of integration, making the
distinction between granular and summarized data, levels of the data model, data
models and interactive sector, corporate data model, transformation of models,
data models and unstructured data, perspective of business user.
Monitoring the DW environment: Monitoring DW environment, transaction
monitor, monitoring data quality, datawarehouse monitor, transaction monitor,
peak period processing, ETL data quality monitor, Dormant data.
DW and security: Protecting access to data, encryption, drawbacks, firewall,
moving data offline, limiting encryption, direct dump, datawarehouse monitor,
sensing an attack, security for near line data.


Time variant data: All data in DW, Time relativity in the interactive sector, data
relativity elsewhere in DW, Transactions in integrated sector, discrete data,
continuous time span data, a sequence of records, nonoverlapping records,
beginning and ending a sequence of records, continuity of data, Time-collapsed
data, time variance in the archival sector,
Flow of data in DW: flow of data throughout the architecture, entering the
interactive sector, role of ETL, data flow into integrated sector, near line, archival
sector, falling probability of data access, exception flow of data.
ETL processing and DW: changing states of data, Where ETL fits, application
data to corporate data, ETL in online mode and batch mode, source and target,
ETL mapping, more complex transformation, ETL and throughput, ETL and
metadata, ETL and an audit trail, ETL and data quality, creating ETL, code
creation or parametrically driven ETL, ETL and rejects, changed data capture,
ETL and rejects, Changed data capture, ELT


DW and granularity manager: granularity manager, raising the level of
granularity, filtering data, functions of the granularity manager, homegrown
versus third party granularity manager, parallelizing the granularity manager.
DW and performance: online response time, analytical response time, flow of
data, Queues, heuristic processing, analytical productivity and response time,
many facets to performance, indexing, removing dormant data, end user
education, monitoring the environment, capacity planning, metadata, batch
parallelization, parallelization for transaction processing, workload management,
data marts, exploration facilities, separation of transactions into classes, service
level agreements, protecting the interactive sector, partitioning data, choosing the
proper hardware, separating farmers and explorers, physically group data.
Migration: Migration in perfect world, adding components incrementally, adding
archival sector, creating enterprise metadata, building the metadata infrastructure,
swallowing source system, ETL as shock absorber, migration to the unstructured


Implementation And Maintenance: Physical design process, data warehouse
deployment, growth and maintenance.

DW2.0 The architecture for Next Generation of Datawarehousing W.H. Inmon, Derek
Strauss, Genia Neushloss, ELSEVIER. (Unit I to V)
Paulraj Ponnian, “Data Warehousing Fundamentals”, John Wiley. (Unit VI)
Building the data warehouse, W.H.Inmon, third Edition, Wiley.
Datawarehousing, S. Mohanty, TMH .
The Data Warehouse Lifecycle toolkit”, Ralph Kimball ,John Wiley.
Term Work:
Assignments: Should contain at least 6 assignments (one per unit) covering the

Practical List:
1. Create around 25 records and design the tabular view using Excel.
Create around 25 records and design the Chart view using Excel.
2. Extract the data from excel , access and sql and integrate it in SQL server.
3. Perform the same process using DTS package
4. Design the star schema and create a cube using OLAP services
5. Perform the cube analysis on MOLAP

Perform the cube analysis on ROLAP


Perform the cube analysis on HOLAP



Consider a data warehouse storing data about sales, where the total items sold are
stored, organised by customer order and product. Each customer order includes the
name of the customer and the date of the order; each product includes a description
of the product and its price.
i. Devise the relational schema (specifying the relations, the attributes, the
primary keys, and the foreign keys) of the above data warehouse using the
star schema.
ii. Write a SQL query to answer the following question: ”Which customer(s)
made an order containing at least five products with different descriptions?”
iii. Write a SQL query for the following report: ”Which customer(s) made
the largerst order (i.e., those that would result in the largest bill)?”
iv. Consider to add a new level product categories to the product dimension.
Devise the new relational star schema, and write a SQL query for the
following report: ”Select the total number of products sold per product
Design at least five queries for the created cube using MDX application.
Retrieve the cube data into the excel sheet and present the information in tabular
and graphical form.

Defences. TRIPs. Registration of domain names. Domain Name Protection-Objectives. Sc (Information technology) Semester – VI SUBJECT: IPR AND CYBER LAWS Periods per week 1 Period is 50 minutes Evaluation System Lecture TW/Tutorial/Practical Theory Examination TW/Tutorial/Practical 5 3 Hours 2 -- Marks 60 40 Unit-I Basic Principles and Acquisition of Intellectual Property Rights: Focus on the: Philosophical Aspects of Intellectual Property Laws. Rights. Subject-matter of Protection. Criteria. Protection of Semi-conductor Chips-Objectives Justification of protection. Database and Data Protection-Objective. Infringements. Defences in case of Infringement Copyright-Objectives. Enforcement. and International Perspective. Reproducing. Drafting of a Patent Specification. Defences. Copyright Protection. Need for Protection. International Background of Intellectual Property Unit II Information Technology Related Intellectual Property Rights Computer Software and Intellectual Property-Objective. Basic Principles of Design Rights. IPR and Cyber Laws 2. Patent Protection. Patent Application procedure. UK Data Protection Act. Rights. Assignments. Infringement. work of employment Infringement. Designs-Objectives. SCPA. Defences of Design Infringement . 1998. Basic Principles of Trade Mark. Assignments. Passing off. Project Management 3. WIPO Treaty. GIS CLASS: B. Understanding Copyright Law. domain name and Intellectual Property.US Safe Harbor Principle.Elective Subjects (ANY ONE) Semester – VI 1. Rights. Basic Principles of Patent Law. Protection of good will. Transfer of Copyright. disputes under Intellectual Property Rights. Defences for infringement Trademarks-Objectives. Jurisdictional Issues. Unit-III Patents (Ownership and Enforcement of Intellectual Property) Patents-Objectives. Rights.

. Practical Aspects of Licencing – Benefits .the Malaysian Approach. Cyber Jurisprudence Law of Digital Contracts : The Essence of Digital Contracts.) V. Unit-V Cyber Law: Basic Concepts of Technology and Law : Understanding the Technology of Internet. Cyber Crimes and Cyber Laws Unit-VI Information Technology Act 2000 : Information Technology Act-2000-1 (Sec 1 to 13). Information Technology Act-2000-3 (Sec 43 to 45 and Sec 65 to 78). Copyright in the Digital Media. International Scenario in Cyber Laws : Data Protection Laws in EU and 5. Information Technology Act2000-6 ( Sec 91-94) Amendments in 2008. Managing Intellectual Property: The Strategic Importance.Civil Remedies. Information Technology Act-2000-5 (Sec 79 to 90). Patents in the Cyber World. References: 1. www. Cyber Law Issues for Management : Cyber Law Issues in E-Business Management. licensing clauses. Ross “Enterprise Architecture As Strategy: Creating a Foundation for Business Execution” 3. E-Governance. Scope of Cyber Laws. V. Jeanne Ross “IT Governance: How Top Performers Manage IT Decision Rights for Superior Results” 2. Sopale ( PHI) Term Work: Assignments: Should contain at least 6 assignments (one per unit) covering the Syllabus. Leland.Unit-IV Enforcement of Intellectual Property Rights . IT Act 2000 with amendments in 2008 6. (2 ed. Criminal Remedies. Determinative factors. Sphinx Publishing 7. important clauses. Tutorial: At least three tutorials based on above syllabus must be conducted. Information Technology Act-2000-2 (Sec 14 to 42 and Certifying authority Rules).wipo. Cyber Law Compliancy Audit. Child Abuse Protection Laws in EU and USA. Licensing Art & Design by Caryn R. Cyber Laws . How To Register Your Own Copyright by Marx Warda. Rights of Netizens and E-Governance : Privacy and Freedom Issues in the Cyber World. The Role and Function of Certifying Authorities. Information Technology Act-2000-4(Sec 46 to Sec 64 and CRAT Rules). Major issues in Cyber Evidence Management. Allworth Press 8. Jeanne W. The System of Digital Signatures. Peter Weill “IT Savvy: What Top Executives Must Know to Go from Pain to Gain 4. Border Security measures. The Science of Cryptography Intellectual Property Issues in Cyber Space: Domain Names and Related issues. Peter Weill .

Tailoring the Process: Process discriminants. Elaboration. evolution of Organizations. Checkpoints of the process : Major mile stones. Pragmatic planning. conventional software Management performance. Unit-III Work Flows of the process : Software process workflows. Improving Software Economics : Reducing Software product size. Unit-V Project Control and Process instrumentation: The seven core Metrics. transitioning to an iterative process. life cycle expectations. Process Automation: Automation Building blocks. Management artifacts. construction.CLASS: B. Unit-VI Future Software Project Management: Modern Project Profiles. cost and schedule estimating. modern process transitions. programmatic artifacts. Periodic status assessments. Life cycle phases : Engineering and production stages. Metrics automation. improving automation. peer inspections. improving team effectiveness. Unit-II The old way and the new : The principles of conventional software Engineering. transition phases. Iteration workflows. . Iteration planning process. pragmatic Software Metrics. Achieving required quality. Project Organizations. planning guidelines. Sc (Information technology) Semester – VI SUBJECT: Project Management Periods per week 1 Period is 50 minutes Evaluation System Lecture TW/Tutorial/Practical Theory Examination TW/Tutorial/Practical 5 3 Hours 2 -- Marks 60 40 Unit-I Conventional Software Management : The waterfall model. quality indicators. Management indicators. pragmatic software cost estimation. Engineering artifacts. Next generation Software economics. principles of modern software management. Evolution of Software Economics : Software Economics. Model based software architectures : A Management perspective and technical perspective. Unit-IV Project Organizations and Responsibilities: Line-of-Business Organizations. inception. Artifacts of the process : The artifact sets. The Project Environment. improving software processes. Iterative Process Planning : Work breakdown structures. Minor Milestones.

A Guide to the Project Management Body of Knowledge (3rd Edition). Relational model. Manipulation of fields and attribute data. Term Work: Assignments: Should contain at least 6 assignments (one per unit) covering the Syllabus. PA. Creating new data. 2005. Project Management Core Textbook – Mantel Jr. Attribute data input and data display : Attribute data in GIS. Software Project Management. Meredith. Inc) 4. Geographic. Project Management Institute. scheduling and controlling Harold Kerzner (John Wiley & Sons. Map projections. RMS error and its interpretation. Project Management. cartographic symbolization. 2005. Metadata. (3rd ed.: a concise study. Data entry. Sc (Information Technology) Semester – VI SUBJECT: Geographic Information Systems Periods per week 1 Period is 50 minutes Evaluation System Unit I Unit II Unit III Lecture TW/Tutorial/Practical Theory Examination TW/Tutorial/Practical 5 3 Hours 2 -- Marks 60 40 Spatial Data Concepts: Introduction to GIS. Information Technology Project management (4th Edition) – Kathy Schwalbe (Centgage Learning – Indian Edition) Reference Books: 1. Sutton with Gopalan (Wiley India Edition) 2.Books: 1. Walker Royce: Pearson Education.A systems Approach to planning. map production . Geographically referenced data. map design. projected and planer coordinate system.. typography.) by S A Kelkar (PHI) 3. Shafer. Resampling of pixel values. Geometric transformation. Tutorial: At least three tutorials based on above syllabus must be conducted. Conversion of existing data. Vector data model. Plane coordinate systems. 2. CLASS: B. Information Technology project Management.Newtown Square. Raster data model Data Input and Geometric transformation: Existing GIS data. types of maps.

neighbourhood operations. Tutorial: At least three tutorials based on above syllabus must be conducted. procurement of hardware and/or software. attribute data query. Sc (Information Technology) Semester – VI SUBJECT: PROJECT Periods per week 1 Period is 50 minutes Evaluation System Lecture TW/Tutorial/Practical Final Examination Term Work 5 3 Hours 2 -- Marks 60 40 The project should be undertaken preferably individually or by the group of maximum 3 students who will jointly work and implement the project. zonal operations. raster data query. Global methods.Unit IV Unit V Unit VI Data exploration: Exploration. map Term Work: Assignments: Should contain at least 6 assignments (one per unit) covering the Syllabus. spatial data query. Distance measurement and map manipulation. Yeung http://www. Distance measure operations Spatial Interpolation: Elements. buffering. W.ncgia. The candidate/ group is expected to complete detailed system design. CLASS: B. The candidate/group will select a project with the approval of the Guide (staff member) and submit the name of the project with a synopsis of the proposed work of not more than 02 to 08 pages within one month of the starting of the semester. local operations. data flow design. . Kriging. analysis. local methods. Raster data analysis: Data analysis environment.ucsb. geographic visualization Vector data analysis: Introduction. Comparisons of different methods Text Book Introduction to Geographic Information Systems by Kang-Tsung Chang Published by Tata Mcgraw Hill Reference Books and websites Concepts and Techniques in Geographic Information Systems by Chor Pang Lo and Albert K.

Project work should be continually evaluated based on the contributions of the candidate/group members. The project report in the bound journal complete in all respect with the following : i) Problem specifications. originality of the work. b) The subjects not having practicals should be supported by tutorials/case studies to be discussed in a class. one on each unit is expected to be completed in a semester for each subject. the major part of the assessment will be based on the written material in the project report. but ultimately it’s the candidates own responsibility. The suggestive structure of a project report should be guided by your guide in selecting the most appropriate format for your project. vi) In case of object oriented approach – appropriate process be followed. ii) System definition – requirement analysis. The oral examination will be conducted by an internal and external examiner as appointed by the University. Note: 1. Although there will be an opportunity to present the work verbally. which includes presentations and demos of the work done. One can expect help and feedback from the project guide. The project report should contain a full and coherent account of your work.implementation of a few modules of the proposed work during the semester VI as a part of the term work submission in the form of a joint report. database design iv) System implementation – algorithm. Two mid-term evaluations should be done. innovations brought in. 2. etc. code documentation v) Test results and test report. research and developmental efforts. . and demonstrate the software. The term work assessment will be done jointly by teachers appointed by Head of the Institution. Candidate/group will submit the completed project work to the department at the end of semester VI as mentioned below. c) Extensive problem solving exercises should be given in order to improve the interest in the subject. iii) System design – dataflow diagrams. depth and applicability. General Instructions for all the courses in sem IV and V: a) Six assignments. 2. 1. The workable project.