You are on page 1of 23

AC 19/3/2012

Item No. 4.80

UNIVERSITY OF MUMBAI

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

Semester III
Courses

Theory Code

Practical Code

Logic and Discrete Mathematics

USIT301

USIT3P1

Computer Graphics

USIT302

USIT3P2

Advanced SQL

USIT303

USIT3P3

Object Oriented Programming with C++

USIT304

USIT3P4

Modern Operating Systems

USIT305

USIT3P5

CLASS: B. Sc (Information technology)
Theory Code : USIT301
Periods per week

Unit – I

Unit- II

Unit-III

Unit-IV

Unit -V

Unit-VI

Subject :

Semester – III

Logic and Discrete Mathematics

Lectures - 5

3 Credits

Set Theory: Fundamentals - Sets and subsets, Venn Diagrams,
Operations on sets, Laws of Set Theory, Power Sets and Products,
Partition of sets, The principle of Inclusion-Exclusion.
Logic: Propositions and Logical operations, Truth tables,
Equivalence, Implications,
Laws of Logic, Normal forms, Predicates and quantifiers,
Mathematical Induction
Relations, diagraphs and lattices: – Product sets and partitions,
relations and digraphs, paths in relations and digraphs, properties of
relations, equivalence and partially ordered relations, computer
representation of relations and digraphs, manipulation of relations,
Transitive closure and Warshall’s algorithm, Posets and Hasse
Diagrams, Lattice.
Functions and Pigeon Hole Principle: Definitions and types of
functions: injective, surjective and bijective, Composition, identity
and inverse, Pigeon hole principle.
Graphs and Trees: Graphs, Euler paths and circuits, Hamiltonian
paths and circuits, Planer graphs, coloring graphs, Isomorphism of
Graphs.
Trees: Trees, rooted trees and path length in rooted trees, Spanning
tree and Minimal Spanning tree, Isomorphism of trees, Weighted trees
and Prefix Codes.
Algebric Structures: Algebraic structures with one binary operation
– semi groups, monoids and groups, Product and quotient of algebraic
structures, Isomorphism, homomorphism, automorphism, Cyclic
groups, Normal sub group, codes and group codes, Algebraic
structures with two binary operations – rings, integral domains and
fields. Ring homomorphism and Isomorphism.
Generating Functions and Recurrence relations: Series and
Sequences, Generating Functions, Recurrence relations, Applications,
Solving difference equations, Fibonacci.

8
Lectures

8
Lectures

8
Lectures
8
Lectures

8
Lectures

8
Lectures

2D Transformations using Homogeneous Coordinates . Sc (Information technology) Theory Code : USIT302 Periods per week Unit – I Unit. Joe L. Homogeneous Coordinates. Rosen. Image Representation. Baker. Ltd. Rotation. Tutorial: At least three tutorials based on above syllabus must be conducted. Input Technology. TATAMCGRAW-HILL Practical Code : USIT3P1 Term Work: Should contain at least 6 assignments (one per unit) covering the syllabus. Applications of Computer Graphics. Epp. Two Dimensional Transformation: Introduction to transformations. Prentice-Hall of India Pvt. 8 Transformation Matrix.Mott. Reflection. Coordinate System Overview. Translation. Bresenham’s LineDrawing Algorithm. Marc Lipson. Discrete mathematical structures by RM somasundaram (PHI) EEE edition References: Discrete structures by Liu. Flat Panel Display. RasterScan Display. Combined Transformation. TATAMCGRAW-HILL Discrete Mathematics for computer scientists and Mathematicians.Kenneth H. S Ross PHI Pvt. Scan-Conversion of Circle and Ellipse (Bresenham’s Method of Circle Drawing. Shear Transformations. TATAMCGRAW-HILL Digital Logic John M Yarbrough Brooks/cole. Random-Scan Display. Discrete Mathematics With Applications.Books: Discrete mathematical structures by B Kolman RC Busby. Seymour Lipschutz. Types of Transformations in Two. Midpoint Circle Algorithm). Thompson Learning Discrete Mathematics and its Applications. Ltd. Display Devices.II Semester – III Subject : Computer Graphics Lectures . Susanna S. Books/Cole Publishing Company Discrete Mathematilcs. Bitmap and Vector-Based Graphics. Scan-Conversion of graphics primitives: Scan-Conversion of a Lines (Digital Differential Analyzer Algorithm. Scaling. Basic Lectures Graphics Pipeline.5 3 Credits Introduction Computer Graphics and Primitive Algorithms: 8 Introduction to Image and Objects. Schaum’s Outlines Series.Lectures Dimensional Graphics: Identity Transformation. Abraham Kandel Theodore P. Drawing Ellipses and Other Conics. Cathode Ray Tubes. CLASS: B. Rotation about an Arbitrary Point.

Introduction to Morphing. Projection. Light Modeling Techniques. Viewing and Solid Area Scan-Conversion: Introduction to viewing and clipping. Key-Frame Animation vs. Flat Shading. Halftoning. Three-Dimensional Viewing Transformations. Introduction to Clipping. Introduction to a Polygon Clipping. Key-Frame Animation. Quadric Surfaces. Scan Conversion of Character. Rotation. Z-Buffer Algorithm. Anti-Aliasing. Conic Curves. Ruled Surfaces. Transparency Effect. David F. Sweep Surfaces. World Coordinates and Viewing Coordinates. Shading. Translation. Gaurand Shading Model. Scan-Line Algorithm. Phong Shading. Constructive Solid Geometry. Fractals and its applications.Unit-III Unit-IV Unit –V Unit-VI Three-dimensional transformations. R. Piecewise Curve Design. Surface of Revolution. Bezier Curves. Alan Adams. BSpline Surfaces. Aliasing. Shear Transformations. Procedural Animation. Texture and Object Representation. Object Rendering: Introduction Object-Rendering. Motion Control Methods. Bezier Surfaces. Three-Dimensional Transformations: Scaling. John Wiley. Tata McGraw-Hill. Reflection. Point Clipping. Rogers. Floating Horizon Algorithm. Seed Fill Algorithm. J. Polygon Mesh Shading. Mathematical elements of Computer Graphics. Subdivision Surfaces Visible Surfaces: Introduction to visible and hidden surfaces. Two-Dimensional Clipping. Thresholding and Dithering Introduction to curves. Extents and Bounding Volumes. Viewing Transformation in Two Dimensions. Ray Tracing. Roberts Algorithm. Shadows. Three-Dimensional Morphing 8 Lectures 8 Lectures 8 Lectures 8 Lectures Books: Computer Graphics. Procedural Animation. Surface Design: Bilinear Surfaces. Maurya. Parametric Curve Design. Perspective Projection. Winding Number Method and Coherence Property. Back Face Culling. Parallel Projection. TATAMCGRAW-HILL Procedural elements of Computer Graphics. Color Models. Curve Continuity. Developable Surfaces. . Introduction to animation. Rogers. Text Clipping Introduction to Solid Area Scan-Conversion. Construction of an Animation Sequence. Polygon Filling. Spline Curve Representation. David F. Inside–Outside Test. Priority Algorithm. Painter’s Algorithm. B-Spline Curves. Coons Patch. Coherence for visibility. Illumination Model. Radiosity. Objects in Homogeneous Coordinates. Ray Casting. Viewing and Clipping in Three Dimensions. K. Line Clipping.

Sproull. Addision Wesley Practical Code : USIT3P2 Term Work: Should contain at least 6 assignments (one per unit) covering the syllabus. y2) against a window (xmin . Write a program to demonstrate 2D animation such as clock simulation or rising sun 12. 9. Donald Hearn and M. 6. ymax). TATAMCGRAW-HILL Introduction to Computer Graphics. 4. Phillips. 5. 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. Feiner and R. A. Translation. Steven Harrington.D. . Prentice Hall of India Computer Graphics. 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).D. ymin)(xmax .F. Pauline Baker. Write a program to implement polygon filling.K. Cantor set. Addision Wesley Principles of Interactive Computer Graphics. 1. Reflection c. Bresenham’s circle algorithm b. Some Sample practical are listed below. 7. Rotate through θ. tree etc). J. Write a program to implement a stretch band effect. Willaim M. 11. J. S.L.K. McGraw-Hill Computer Graphics Principles and Practice. A. (A user will click on the screen and drag the mouse/arrow keys over the screen coordinates. Write a program to implement the bouncing ball inside a defined rectangular window. b. The line should be updated like rubber-band and on the right-click gets fixed).y1)(x2. S. 8.L.Reference: Computer Graphics. Compare the lines for their values on the line. Feiner. Foley. 2. Foley. J. Van Dam. Write a program to generate a 2D/3D fractal figures (Sierpinski triangle. Write a program to draw Bezier and B-Spline Curves with interactive user inputs for control polygon defining the shape of the curve. Develop a program to clip a line using Cohen-Sutherland line clipping algorithm between (x1. Write program to perform the following 2D and 3D transformations on the given input figure a. Robert F. 10. Hughes and R. Write a program to demonstrate shear transformation in different directions on a unit square situated at the origin. Develop a program to generate a complete circle based on a. Suggested Practical: Should contain at least 10 programs development in C++. Midpoint Circle Algorithm 3. Newman. Scaling d. Phillips. Van Dam.

SQL Cursor Attributes to Obtain Feedback on DML. Sequences in PL/SQL Expressions. While Loop Statement. Data Manipulation in the Server using PL/SQL. Composite Data Types: PL/SQL Records. Trap Predefined and non-predefined Oracle Server Errors. Save and Discard Transactions. Explicit Cursors. 8 Lectures 8 Lectures 8 Lectures 8 Lectures . Creating and Managing Tables. Scalar Data Types. Propagate Exceptions. SQL Cursor concept. Hierarchical retrieval. Declare the Cursor. Aggregating Data using Group Functions.5 3 Credits Structured Query Language: Writing Basic SQL Select Statements. PL/SQL Block Syntax. RAISE_APPLICATION_ERROR Procedure. For Loop Statement. Including Constraints. Bind Variables. Nested Blocks. Handle Exceptions with PL/SQL. Invoke SELECT Statements in PL/SQL. Sc (Information technology) Theory Code : USIT303 Periods per week Unit – I Unit. Open the Cursor. Interaction with the Oracle Server. Control Structures: Conditional processing using IF Statements and CASE Statements. Cursor FOR loop. the Continue Statement. Fetch data from the Cursor. Scalar and correlated subqueries). Restricting and Sorting Data. Executable Statements. WITH Clause. DateTime Functions. Rollup and Grouping). Simple Anonymous Block. Using SET operators. The %ROWTYPE Attribute. Use INDEX BY Table of Records. Identifiers. Manipulating Data. Creating Views. INDEX BY Tables. Comment the Code. Single-Row Functions. types of PL/SQL blocks. Enhancements to Group by clause(cube. User-Defined Exceptions. Subqueries in FROM clause. Insert and Update with PL/SQL Records. Indexes and Synonyms) Advanced SQL: Controlling User Access. Loop Statement. Subqueries. PLSQL: Introduction. Advanced Subqueries (Multiple column subqueries. INDEX BY Table Methods. Convert Data Types. Deployment of SQL Functions in PL/SQL. Declarative Section. Operators. Exception Handling. The %NOTFOUND and %ROWCOUNT Attributes. Overview and benefits of PL/SQL. The %TYPE Attribute. Joins (Displaying Data from Multiple Tables). Close the Cursor.II Unit-III Unit-IV Semester – III Subject : Advanced SQL Lectures . the FOR UPDATE Clause and WHERE CURRENT Clause. Subprograms.CLASS: B. Creating Other Database Objects(Sequences. types of Identifiers. variables.

the steps to create a stored function.John Harper. Call. Use Forward Declarations. Test and Remove Triggers. Implement Package Functions in SQL and Restrictions. Overloading Subprograms in PL/SQL. Implement Procedures Parameters and Parameters Modes. differences between Lectures Anonymous Blocks and Subprograms. Create DML Triggers using the CREATE TRIGGER Statement and SQL Developer. View Procedure Information. Create. TATAMCGRAW-HILL . Create the Package Specification and Body using the SQL CREATE Statement and SQL Developer. components of a Package. Creating Compound. By: Michael McLaughlin. Invoke User-Defined Functions in SQL Statements. Packages. Persistent State of a Package Cursor. View the PL/SQL Source Code using the Data Dictionary. Create Triggers on DDL Statements. Configure Native Lectures Dynamic SQL to Compile PL/SQL Code. and Remove Stored Procedures. Stored Functions and Debugging Subprograms. Dynamically Executing a PL/SQL Block. Deploying Packages. Create Instead of and Disabled Triggers. Control side effects of PL/SQL Subprograms. Use the STANDARD Package. View Functions Information. Statement Level Triggers and Row Level Triggers. enable visibility of a Package’s Components. advantages of Packages.Unit – V Stored Procedures: Create a Modularized and Layered Subprogram 8 Design. Invoke the Package Constructs. Business Application Scenarios for Implementing Triggers. Manage. Implement DBMS_SQL with a Parameterized DML Statement. Restrictions when calling Functions. Body. Compound Trigger to Resolve the Mutating Table Error. Oracle Database 11g PL/SQL Programming Workbook. Comparison of Database Triggers and Stored Procedures. Persistent State of Packages. ISBN: 9780070702264. and Remove a Stored Function. Dynamic SQL Functional Completeness. System Privileges Required to Manage Triggers Books: Murach’s Oracle SQL and PLSQL by Joel Murach. Create. Develop a Package. DDL and Event Database Triggers. Compound Trigger Structure for Tables and Views. Identify the Trigger Event Types. Create Database-Event and SystemEvents Triggers. Triggers. invoke DBMS_SQL Package. advantages of using Stored Functions. the PL/SQL Execution Environment. Murach and Associates. Invoke PL/SQL Tables of Records in Packages Unit – VI Dynamic SQL: The Execution Flow of SQL. the Trigger Event Types and Body. Declare Cursor 8 Variables. debug Functions and Procedures. Call. and Firing (Timing). Control side effects when calling Functions.

c. Create exception handlers for specific situations. where and order by clause. Cursors with parameters to process a number of rows from multiple tables. Process a number of rows from a table and populate another table with the results using a cursor FOR loop. 6. c. cube and grouping sets. a. roll up. Querying data from multiple tables using all types of joins. PL/SQL Record and FOR loop. Practical 1: Select queries and joins a. Practical 3: Creating database objects. Exceptions and procedures issuing DML and query commands. c. c. Use the DBMS_LOB package to populate the table and manipulate the data. 9. Controlling user access and using set operators a. Sequences. . Practical 2: Subqueries. date-time functions. Create a one-time-only procedure within a package to populate a PL/SQL table. 3. Creating Views. 5. Fifth Edition By Steven Feuerstein. Create a table with both BLOB and CLOB columns. Some sample practicals are listed below. c. Granting and revoking privileges on user objects. INDEX BY tables. Create statement and row triggers. b. b. Re-create the source code for a procedure and a function. Multiple column subqueries. Scalar subqueries and correlated subqueries. create. b. b. Select queries on single table using aggregate functions and group by clause. DML and DDL a. Creating and invoking functions from SQL statements. b. c. 1. WITH Clause and hierarchical retrieval. Define.Michael McLaughlin. Creating and invoking stored procedures. Practical 6: Cursors. Manipulating data (Insert. Querying single and multiple tables using subqueries. Select queries on single table using alias. 8. subqueries in from clause. TATAMCGRAW-HILL Oracle database 11g: hands on SQL/PL SQL by Satish Asnani (PHI) EEE edition Practical Code : USIT3P3 Term Work: Should contain at least 6 assignments (one per unit) covering the syllabus. Practical 4: Working with advanced subqueries and WITH clause a. Using set operators. Bill Pribyl Oracle 11g: SQL Reference Oracle press Oracle 11g: PL/SQL Reference Oracle Press. Create procedures that issue DML and query commands. Create procedures that will be invoked from the triggers. update and delete) c. c. 4. Suggested Practical: Should contain at least 10 programs. 2. a. Indexes and synonyms. By: Ron Hardman. b. Expert Oracle PL/SQL. Practical 5: Basic PL/SQL. Practical 9: Working with Large Objects and triggers a. b.Reference: Oracle PL/SQL Programming. Create package specifications and package bodies. Practical 7: Functions and Stored Procedures a. Creating anonymous PL/SQL blocks. c. b. Practical 8: Working with packages a. and use INDEX BY tables and a PL/SQL record. 7. Invoke the constructs in the packages. Create a package containing an overloaded function. b. Creating simple tables and tables with constraints.

stream classes. reusability.II Unit-III Unit-IV Unit –V Unit-VI Semester – III Subject : Object Oriented Programming with C++ Lectures . the class destructor . static data members. container classes. access functions. constructors. ios format flags. packages.overloading the stream operators. Practical 10: Working with INSTEAD OF triggers. Implement a number of business rules. overloading the subscript operator Composition and Inheritance: inheritance. virtual functions and polymorphism. pointers to objects. functions. business rules and recompiling procedures. opening and closing a file.overloading the increment and decrement operators. classes . the standard template library 8 Lectures 8 Lectures 8 Lectures 8 Lectures 8 Lectures 8 Lectures . detecting end of file. the copy constructor. characteristics of OOPs – object . subclass templates. iterator classes Libraries: the standard C++ library. overloading arithmetic operators. inheritance. conversion operators . overriding and dominating inherited members. Templates and Iterators: function templates. protected class members . private member functions. virtual destructors. comparison of procedural and object oriented approach. the comparison operators. file modes. Create triggers for those rules that should be implemented as triggers. b. data hiding and abstraction. functions. the addition operator . stream manipulators. the copy constructor. access functions .constant objects. class templates. applications of OOPs Classes and Objects: Class declaration. Sc (Information technology) Theory Code : USIT304 Periods per week Unit – I Unit. sequential input and output operations. abstract base classes File Handling: Classes for file stream operations. stream operators.5 3 Credits Introduction to OOPs: Need object oriented programming. variables . constructor initialization lists. The triggers must execute procedures that that are placed in a package. c. proprietary libraries. random access. ios state . CLASS: B. contents of the standard c headers. structures. file operations error handling.10. unformatted input functions . a. file pointers and their manipulations. Create instead of triggers for views. string streams. private access verses protected access. the constructors and destructor . and views. Use the DEPTREE_FILL procedure and the IDEPTREE view to investigate dependencies in your schema. operators. passing template classes to template parameters.the istream and ostream classes. polymorphism. an append operator. Recompile invalid procedures. the ios class. overloading the arithmetic assignment. the this pointer. command line argument Strings and Streams: the string class interface. overloading the relational operators . static function members Operator Overloading: overloading the assignment operator. packages and views. unformatted output functions. file processing. the assignment operator.

Implement the following Design a class Complex for adding the two complex numbers and also show the use of constructor. Robert Lafore. 2nd Edition. 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. C++ for Beginners. isArmstrong() which will calculate the given number is armStrong or not. Harwani. 4 a. Write a friend function for adding the two matrix from two different classes and display its sum. Write a friend function for adding the two different distances and display its sum. b. Implement the following Overload the operator unary(-) for demonstrating operator overloading. 3rd Edition. Design a class StaticDemo to show the implementation of static variable and static function. E. Some sample practicals are listed below. Overload the + for concatenating the two strings.Books: SCHAUM’S OUTLINE OF THEORY AND PROBLEMS of PROGRAMMING WITH C++ JOHN R. Sarang 2nd Edition. b. reverseNo() will reverse the given number. . For e. Design a class Geometry containing the methods area() and volume() and also overload the area() function . Implement the following Design an employee class for reading and displaying the employee information. Object Oriented Programming with C++. Bjarne Stroustrup Mastering C++. b. Where getInfo() will be private method.Where readNo() will be private method. Design the class Demo which will contain the following methods: readNo() . X-Team Series. Implement the following Write a friend function for adding the two complex numbers. the getInfo() and displayInfo() methods will be used repectively. b. c. And also pass objects as an argument. Venugopalan. using a single class. Overload the operator + for adding the timings of two clocks.(PHI) EEE edition Reference: C++ programming . c. c.Balagurusamy. HUBBARD. M.Fourth Edition. 3 a. isPalindrome() will check the given number is palindrome. 2 a. TATAMCGRAW-HILL. Suggested Practical: Should contain at least 10 programs.Where getData() will be private method. TATAMCGRAW-HILL Object Oriented Programming with C++. Practical Code : USIT3P4 Term Work: Should contain at least 6 assignments (one per unit) covering the syllabus. 1 a.g “c” + “++” = c++ . TataMcgrawHill C++ Programming. P. by P. using two classes.factorial() for calculating the factorial of a number. c.

6. Classes of OS. Operating-System Generation. Operating-System Design and Implementation. . string comparison. string concatenation String operations for string reverse. Interprocess Communication. Compilers and Interpreters. Scheduling Criteria. b. distributed and modern operating systems. Assemblers. Threading Issues.5 3 Credits Introduction to Operating Systems: OS and Computer System. System Calls. b. Operations Lectures on Processes. User 8 Operating-System Interface. Handheld Systems. a. Communication in Client– Server Systems. b. Sc (Information technology) Theory Code : USIT305 Periods per week Unit – I Unit. a. Implement the following: Show the implementation of exception handling Show the implementation for exception handling for strings Show the implementation of exception handling for using the pointers. Linkers. Thread Scheduling. Peterson’s Solution. 7. Operating-System Structure. Design a class for multiple inheritance. Scheduling Algorithms. Process 8 Scheduling. 9. Design the template class library for concatenating two strings CLASS: B. Show the implementation for the following a. Desktop Systems. c. Design a class to handle multiple files and file operations c. Show the implementation of template class library for swap function. Multithreading Models. c. Lectures System Programs. 8 System performance. b. Show the implementation Design a class FileDemo open a file in read mode and display the total number of words and lines in the file. Design the template class library for sorting ascending to descending and vice-versa c. Implement the following String operations for string length . c. time-sharing. Console formatting functions. Implement the hierarchical inheritance. Show the use of virtual function Show the implementation of abstract class. Virtual Machines. The Critical-Section Problem. Processes and Process Synchronization: Process Concept. real time. Lectures multiprocessing. c. Batch processing. Operating-System Structures: Operating-System Services. Clustered Systems. Implement the following Design a class for single level inheritance using public and private type derivation. a.II Unit-III Semester – III Subject : Modern Operating Systems Lectures . System Boot. Implement the following Implement the concept of method overriding. b.5 a. b. Types of System Calls. a. Design a editor for appending and editing the files 10. Semaphores. 8.

segmentation File-System Interface and Implementation: File Concept. Lectures Modeling paging algorithms. Wiley publication Reference: Operating Systems. RAID Structure. Case Studies (Suggested): a) MS-DOS b) Windows NT c) Windows 2008 Server d) Windows 7 e) Unix f) Linux g) OS/2 h) MAC OS i) Symbian j) Chrome k) Android . Books: Modern Operating Systems. Page replacement algorithms. McGrawHill publications. Capability-Based Systems. Performance. McGrawHill publications Operating Systems. A. 8th Edition. Dhamdhere. Language-Based Protection. Operating Systems. Tutorial: At least three tutorials based on above syllabus must be conducted. The Security Problem.A concept based approach . Domain of Protection.M. Access Matrix. File8 System Mounting. avoidance and prevention I/O Systems: Application I/O Interface.Sumitra Devi and N. Implementing Security Defenses.Galvin. Design issues for paging systems. Swap-Space Management. SPD Operating System Concepts. Greg Gagne. Virtual Memory. File Sharing.Unit-IV Unit –V Unit-VI Memory Management: Memory management without swapping or 8 paging. Stable-Storage Implementation. Mass. D. Godbole and Kahate. NFS. Deadlocks .P Banashree.Lectures Storage Structure: Disk Structure. System and Network Threats. Abraham Silberschatz. Andrew Tanenbaum. Swapping. STREAMS. Disk Management. Free-SpaceManagement. 2nd Edition. Access Control. Transforming I/O Requests 8 to Hardware Operations. 3rd Edition . Deadlock detection and recovery. Practical Code : USIT3P5 Term Work: Should contain at least 6 assignments (one per unit) covering the syllabus. Lectures Protection and Security: Principles of Protection. K. 2nd Edition. Peter B.

Design Evolution User Interface Design : Need of UI design. User analysis. The Rational Unified Process. Emergent System Properties. Rapid Application Development.5 3 Credits An Introduction : To Software. Sc (Information technology) Theory Code : USIT401 Periods per week Unit – I Unit. Transaction Processing Systems. Software Engineering. people and computers. Management activities. Components of system such as organization. Socio-technical system : Essential characteristics of socio technical systems. Different software process models. Software Prototyping 8 Lectures 8 Lectures 8 Lectures 8 Lectures . Modular Decomposition Styles. A simple safety critical system. Architectural Design : Architectural Design Decisions. Behavioural Models. System Requirements. Dealing Legacy Systems. Dependability of a system. Context Models. CASE in detail. Critical system : Types of critical system. Control Styles. Reference Architectures Application Architectures : Data Processing Systems. Risk Management. Requirements Validations. User Requirements.II Unit-III Unit-IV Semester – IV Subject : Software Engineering Lectures . Interface Evaluation. Documentation of the software requirements Requirements Engineering Processes : Feasibility study. Data Models. Language Processing Systems Object Oriented Design : Objects and Object Classes. Requirements elicitation and anlaysis. Design issues. Structured Methods. Rapid Software Development : Agile Methods. System Organisation. Software Requirements: Functional and Non-functional requirements. An object Oriented Design Process. The UI design Process. Systems Engineering. Object Models. Event Processing Systems. Requirements Management. Software Process.Semester IV Courses Theory Code Practical Code Software Engineering USIT401 USIT4P1 Multimedia USIT402 USIT4P2 Java and Data Structures USIT403 USIT4P3 Quantitative Techniques USIT404 USIT4P4 Embedded Systems USIT405 USIT4P5 CLASS: B. Process Iteration and Activities. Project Planning. Project Management : Software Project Management. Safety and Security of Software systems Software processes : Fundamental activities of software process. System Models : Models and its types. Interface Specification. Project Scheduling. User Interface Prototyping. Software Engineering Methods. Availability and Reliability. Extreme Programming. CASE Tools. Attributes of good software.

Security Risk Management. Estimation Techniques. Process Classification.Budgen”. A practitioner’s approach. Pearson Education. Test Automation. 2nd edition. Lectures Verification and Validation : Planning Verification and Validation. Process Analysis and Modeling. Service Engineering. Software Development with Services Books: Software Engineering. PHI(2009) EEE edition Software Engineering principles and practice by WS Jawadekar TATAMCGRAW-HILL Practical Code : USIT4P1 Term Work: Should contain at least 6 assignments (one per unit) covering the syllabus. TATAMCGRAW-HILL. Object oriented Approach 3. Software Engineering. Software Lectures Measurement and Metrics Process Improvement : Process and product quality.Unit –V Unit-VI Component based Software Engineering : Components and 8 Component models. Security Engineering : Security Concepts. Software Inspections. Designing the database design 5. Service Oriented Software Engineering : Services as reusable components. Tutorial: At least three tutorials based on above syllabus must be conducted. Use of testing methodologies 7. Analyzing a system and specifying the requirements a. Component Testing. Verification and Formal Methods. Cost benefit Analysis . Software Engineering by KL James. Quality 8 assurance and Standards. Automated Static Analysis. System Survivability. Component Composition. Project Cost Estimation 4. Cost Estimation Techniques 8. Process Measurement. Test Case Design. “Ian Somerville”. Structured Approach b. Process Change. 8th edition. Pankaj Jalote. Pearson education. “D. Quality Planning. Software Testing : System Testing. Designing the User interface design 6. The CBSE Process. Algorithmic Cost Modelling. The CMMI Process Improvement Framework. Software Cost Estimation : Software Productivity. Project Initiation and scheduling. Case Studies (Suggested) 1. Narosa Publication Reference: Software Design. Quality Control. 2. Design for Security. Roger Pressman. Software engineering. Project Duration and Staffing Quality Management : Process and Product Quality.

multimedia production. Andleigh and Kiran Thakrar-PHI publication Multimedia systems by John F. multimedia authoring metaphor. Importance and drawback of digital representation. principle and working of scanner and digital camera. Digital representation: Introduction. Font. director. compression. Gamma and gamma correction. digital representation. JPEG. TATAMCGRAW-HILL Reference: Multimedia Systems Design by Prabhat K. additive and subtractive color mixing. pulse modulation. Raster scanning principles.File formats. Multimedia presentation and authoring: Overview. hardware and software requirements. 8 Lectures 8 Lectures 8 Lectures 8 Lectures 8 Lectures 8 Lectures Books: Principles of Multimedia by Ranjan Parekh. Mini Project: Develop a multimedia application . presentation and automatic authoring. colour models. Design paradigms and user interface. Fourier representation. Audio and Video technology: Fundamental characteristics of sound. multimedia database. insertion. Analog representation. Overview of Image and Video compression techniques.II Unit-III Unit-IV Unit –V Unit-VI Semester – IV Subject : Multimedia Lectures . Barriers to wide spread use. psycho-acoustics. waves. need for digital representation. flash and dreamweaver. Quantization error. relation between sampling rate and bit depth. PHI EEE edition. A to D conversion. Liquid crystal display (LCD).5 3 Credits Introduction: What is multimedia? Defining the scope of multimedia. Huffman’s coding. Text and Image: Introduction. Practical Code : USIT4P2 Term Work: Should contain at least 6 assignments (one per unit) covering the syllabus. Fundamentals of multimedia by Ze-Nian Li and MS Drew. Basic steps for image processing. Sc (Information technology) Theory Code : USIT402 Periods per week Unit – I Unit. Koegal Buford-Pearson Education. sensors for TV cameras. color fundamentals. overview of tools like adobe premier. Types of images. Types of compression. Tutorial: At least three tutorials based on above syllabus must be conducted. zip coding. file formats Compression and coding: What is compression? Need for compression. Types of text. Plasma Display Panel (PDP).CLASS: B. D to A conversion. Applications of multimedia.basic compression techniquesrun length.

method overriding. tree . Objects and Methods. Types of data structures. linked representations. Filtered Byte Streams. AVL trees . Directories. Classes. searching. FileOutputStream. sequential representation. 8 Lectures 8 Lectures 8 Lectures 8 Lectures 8 Lectures 8 Lectures Books: Core Java for Beginners. J Hubbard. FileInputStream. CharArrayWriter. Circular Queue – insertion . traversing. Operators. CharArrayReader. finalize methods. Exception Handling. BufferedReader. bubble. collision-resolution techniques Trees. sequential search algorithm. Stacks. String handling. Tata-McGrawhill . and Arrays. Tata-McGrawhill Data Structures with Java.Stack Operations. Tata-McGrawhill Data Structures. Packages and Interfaces. Hash table methods – hashing functions . Osborne . Buffered Byte Streams. deletion Linked Lists – representation of linked list. Jean-Paul Tremblay.CLASS: B. Queue . The Byte Streams. Constructor. Data Types. PrintStream. traversing binary tree. Multithreaded Programming The Java I/O Classes and Interfaces: File. PushbackReader. Creating Directories. InputStream. traversing algorithm using stacks. radix . FileReader . deletion and doubly linked list. P Sorenson. binary search algorithm. BufferedWriter. type-casting. B trees Heaps – insertion and deletion Sorting – selection.II Unit-III Unit-IV Unit –V Unit-VI Semester – IV Subject : Java and Data Structures Lectures . . Control Statements. Duplicating an Array. RandomAccessFile. The X Team SPD Java 2 Complete Reference. Derived concepts: Inheritance. Linked Implementation. merge. path matrix. 2nd edition. The Character Streams. PrintWriter Data Structures: Complexity and analysis of algorithms – algorithm.Queue Operations. Sharanam Shah and V Shah. The listFiles( ) Alternative. The Stream Classes. Warshall’s algorithm. traversing. second edition. Applications . indexed Implementation. JVM. operations. Applications.S Lipschutz. asymptotic notations. Writer.Binary Trees. ByteArrayOutputStream.5 3 Credits Core Java: Features of Java. insertion. header nodes. threads. Sc (Information technology) Theory Code : USIT403 Periods per week Unit – I Unit. SequenceInputStream. Using FilenameFilter. Arrays .Properties of Arrays. Tata-McGrawhill Reference: An introduction to data structures with applications. time and space complexity. Variables.recursion. 5th Edition . FileWriter. indexed Implementation. insertion Graphs – graph theory. adjacency matrix. ByteArrayInputStream. binary search trees ( insertion and deletion). OutputStream. Reader.

sorting. 2 Implement the following a. 5 a. ( insertion . c. exit) Design a class in java for implementing the operations of circular queue. Implement the following Design a class to implement the operations of singly link-list. Design a java class for performing all the file-operations. 3 a. b. b. Practical List: 1 Implement the following a. display) Design a class to implement the operations of doubly-linked list. b. Design a java class for performing all the matrix operations i. Design a java program for type casting different types of variables. 9. Show the implementation for the following Design a class in java for bubble and merge sort. transpose etc. Design a class in java for implementing selection and insertion sort. Design a class to create a tree and also implement the binary search tree. Design a java program for different types of inheritance. Implement the following Implement the concept of hashing technique and also show its collision avoidance. c. Design a java class for implementing the operations of stack. deletion.Practical Code : USIT4P3 Term Work: Should contain at least 6 assignments (one per unit) covering the syllabus. b. Design a java class performing string operations. b. 4 a. and implement all the methods required by calculator operations. 7. Design a Calculator class in java. a. b. b. Design a java class for the use of interface. Design a java class for operating the random access files using Implement the following Design a class for sorting the names or numbers in ascending and descending order. a.e addition. display. Design a class in java for implementing the graph . a. b. 8. b. Implement the following Design a class in java to add two complex numbers using constructors. a. 10. multiplication. Implement the following Design a class in java for implementing the operations of queue. c.( insert. 6. Show the implementation Design a class in java for creating the heap and also show heap sort for it. Implement the following Design a java class for implementing the concept of threading and multithreading. c. Design a java class for method overloading and method overriding. b. delete. a. Design a java class for implementing the packages.

Bisection Method. Formulation and Graphical solution. Test of Hypothesis. measures of skewness and kurtosis based on moments. Sc (Information technology) Theory Code : USIT404 Periods per week Unit – I Unit. Backward Difference. Probability distribution of random variables. Basic solution and Feasible solution.ans iv) difference in the sample proportions. Solutions of Algebraic and Transcendental Equations using . Euler’s Method. Lagrange’s Interpolation. Binomial. Interval Estimation of Population Parameters.II Unit-III Unit-IV Unit –V Unit-VI Semester – IV Subject : Quantitative Techniques Lectures . Modified Euler’s Method. One Tailed and Two Tailed Test . Numerical solution of 1st and 2nd order differential equations: . Expected value. (derivation of mean and variance only and state other properties and discuss their applications) Normal distribution state all the properties and its applications. exponential. Karl Pearson’s coefficient properties of correlation coefficient and derivation of the formula for Spearman’ s Rank. Correlation. Student’s ‘t’ Distribution and its applications. correlation coefficient. Runge-Kutta Method for 1st and 2nd Order Differential Equations. Data types of Data. Numerical Integration: Trapezoidal Rule. Solution of simultaneous algebraic equations (linear) using iterative methods: Gauss-Jordan Method. Newton’s Backward Difference Interpolation. Gauss-Seidel Method.CLASS: B. 8 Lectures 8 Lectures 8 Lectures 8 Lectures 8 Lectures 8 Lectures . Poisson. Interpolation: Interpolation: .Forward Difference. Fitting the straight line and parabolic curve. Simpson’s 1/3 rd and 3/8 th rules. Random variables: Discrete and Continuous random variables. Contingency Table. Test of Significance for large Samples. Continuous distributions: uniform distributions. Variance. Sampling distributions of i)sample mean ii) difference in the sample means iii) sample proportion. Bivariate data Covariance.5 3 Credits Errors. Fitting of curves: Least square method. NewtonRaphson Method. Central Limit theorem (statement only) and problems based on this theorem. Level of Significance. Probability density function. Newton’s Forward Difference Interpolation. Regression coefficients and derivation of equation for lines of regression. Moments Relation between Raw moments and Central moments. Mean. the Method of False Position.Taylor series. Distributions: Discrete distributions: Uniform. Test of the Goodness of Fit and Independence of Attributes. Chi-Square Distribution and its applications. Yates Correction Linear Programming: Linear optimization problem. Primal Simplex Method. Variance. Critical Region.

Computation of raw and central moments. Curve fitting by Principle of least squares. Program to solve differential equation using Euler’s method b.N.Kapoor Reference: Elements of Applied Mathematics. S. Program for fitting of Negative Binomial Distribution. b. Program to solve differential equation using modified Euler’s method. Program for fitting of Poisson Distribution.Schilling and Sandra L. ” . S. Practical 7: Moments. V.Books: Introductory Methods of Numerical Methods. Program for Lagrange’s interpolation. b. Program to solve algebraic and transcendental equation by Newton Raphson method. c. Vol-2. Practical List to be performed in Scilab: 1.Wartikar. P. V. 8. Practical 6: Random number generation and distributions a. Thomson Brooks/Cole Practical Code : USIT4P4 Term Work: Should contain at least 6 assignments (one per unit) covering the syllabus. A. Second degree curve) . Program for Newton’s forward interpolation. Program to solve algebraic and transcendental equation by bisection method.K. Program for numerical integration using Simpson’s 3/8th rule. Program for numerical integration using Simpson’s 1/3rd rule. Program for Newton’s backward interpolation. Practical 3: Solving linear system of equations by iterative methods: a. PHI Applied Numerical Methods for Engineers using SCILAB and C. b.C.Gupta. d. S. PHI Fundamentals of Mathematical Statistics.Harris.Shastri. Practical 2: Interpolation a. Program for fitting of Binomial Distribution. Program for solving linear system of equations using Gauss Seidel methods. Computation of correlation coefficient and Fitting of lines of Regression ( Raw and Frequency data ) c. c. Spearman’s rank correlation coefficient.Shastri. Correlation and Regression a. 5. Griha. 2. Robert J. 6. Program to solve differential equation using Runge-kutta 2nd order and 4th order methods.S. and measures of skewness and kurtosis.N. b. Pune Engineering Mathematics. 4. 3. c.Wartikar and J. Practical 8: Fitting of straight lines and second degree curves a. b. Practical 5: Solution of differential equations: a. 7. Program for numerical integration using Trapezoidal rule. Program for random number generation using various techniques. c. Program to solve algebraic and transcendental equation by false position method. ( Fitting of a straight line. Practical 4: Numerical Integration a. Program for solving linear system of equations using Gauss Jordan methods.S. Practical 1: Solution of algebraic and transcendental equations: a. b. Volume 1 and 2. Vol-2. c.

applications and purpose of embedded systems Core of embedded systems: microprocessors and microcontrollers. emulator and debugging . difference between proportions. memory – RAM . b. downloading and debugging Embedded Hardware: Memory map.) b. Model sampling from Binomial and Poisson Populations. COTS. simulator . difference between standard deviations. Application specific ICs. c. external peripherals. RISC and CISC controllers.Watchdog Timers. application specific embedded system – washing machine. Test based on Chi-square.automotive. classifications. domain specific . difference between means. CRC . Big endian and Little endian processors. PCB and passive components. Selection Process Design and Development: embedded system development environment – IDE. difference between means and paired ‘t’) 10. Embedded Operating System. Tests based on students ‘t-test’( Single mean. Chi-square test of independence of attributes. linking and locating. operational and non-operational quality attributes. Model sampling from Uniform. Sc (Information technology) Theory Code : USIT405 Periods per week Unit – I Unit. interrupt map. CLASS: B. compiling . Programming embedded systems: structure of embedded program. types of RAM and ROM.II Unit-III Unit-IV Unit –V Unit-VI Semester – IV Subject : Embedded Systems Lectures . Real-Time Characteristics. Practical 10: Chi-square test and LPP a. Normal and Exponential Populations. Practical 9: Sampling: a. Large sample tests-( Single mean. Solution of LPP by Simplex method. embedded product development life-cycle. embedded firmware.5 3 Credits Introduction: Embedded Systems and general purpose computer systems. other system components. goodness of Fit. Timer Driver. Characteristics and quality attributes of embedded systems: characteristics. Device Driver. trends in embedded industry. types of file generated on cross compilation. i/o map. communication interface. processor family. memory testing. history . infinite loop.Flash memory Peripherals: Control and Status Registers. disassembler/ decompiler. 8 Lectures 8 Lectures 8 Lectures 8 Lectures 8 Lectures 8 Lectures . Programmable logic devices.9.Distribution ( Test for variance. sensors and actuators. ROM. single proportion.) d. c.

2) Port I / O: Use one of the four ports of 8051 for O/P interfaced to eight LED’s. Tutorial: At least three tutorials based on above syllabus must be conducted. References: Embedded Systems. First Edition January. 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. TATAMCGRAW-HILL Practical Code : USIT4P5 Term Work: Should contain at least 6 assignments (one per unit) covering the syllabus. 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. 6) Using D/A converter generate sine wave on oscilloscope with the help of lookup table stored in data area of 8051. 9) Temperature controller. 10) Elevator control. 4) Interface 8051 with D/A converter and generate square wave of given frequency on oscilloscope. Signify end of message by carriage return. Shibu K V. 8) Generate traffic signal. Michael Barr . Rajkamal. TATAMCGRAW-HILL.Books: Programming Embedded Systems in C and C++. 5) Interface 8051 with D/A converter and generate triangular wave of given frequency on oscilloscope.O'Reilly Introduction to embedded systems. Practical List: 1) Configure timer control registers of 8051 and develop a program to generate given time delay. .

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. Credit of 3 of Theory and 1 of Practical for any course is to be awarded only if students clear. tutorial.Issues related to Term Work. Semester III Theory Course Internal Assessment (40 Marks) Assignment Tutorial USIT301 USIT302 USIT303 USIT304 USIT305 Practical Course USIT3P1 USIT3P2 USIT3P3 USIT3P4 USIT3P5 10 10 10 10 10 10 10 10 10 10 Class Test 20 20 20 20 20 Internal Assessment (20 Marks) Case Study Problem Solving Lab and Journal Lab and Journal Lab and Journal External Assessment (60 Marks) Theory Exam Total(100 Marks) 60 60 60 60 60 100 100 100 100 100 External Assessment (30 Marks) Case Study Problem Solving Practical Exam Practical Exam Practical Exam Total (50 Marks) 50 50 50 50 50 Semester IV Theory Course Internal Assessment (40 Marks) USIT401 USIT402 USIT403 USIT404 USIT405 Assignment Tutorial Class Test 10 10 20 10 10 20 10 10 20 10 10 20 10 10 20 Practical Course USIT4P1 USIT4P2 USIT4P3 USIT4P4 USIT4P5 External Assessment (60 Marks) Theory Exam 60 60 60 60 60 Internal Assessment (20 Marks) External Assessment (30 Marks) Lab and Journal Problem Solving Lab and Journal Lab and Journal Case Study Practical Exam Problem Solving Practical Exam Practical Exam Case Study Total(100 Marks) 100 100 100 100 100 Total (50 Marks) 50 50 50 50 50 .

……. ……. ……. 5 Q. 5 marks ii. 5 marks From Unit V Attempt any two of following i. 5 marks From Unit IV Attempt any two of following i. …….. 5 marks From Unit III Attempt any two of following i. 5 marks iii. 5 marks Note: Internal choice should be given.. …….. ……. 5 marks iii. 5 marks ii. 4 Q. ……. 5 marks iii. 2 Q.• • • • 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.. 5 marks From Unit II Attempt any two of following i.. Suggested Question Paper Format for END Semester Examination Duration : 2 hrs. 5 marks ii. …….. Class Test is to be conducted in the class room with due notice.. …….. Total Marks : 60 All Questions Compulsory: Q. ……. 5 marks iii. 1 Q. Question papers will be set by examiners appointed by Principals of the affiliated colleges. Test could be out of any sum total but is to be converted out of 20 for class test. ……. ……. 5 marks ii. …….... 5 marks iii.. 6 From Unit I Attempt any two of following i. 5 marks ii. ……....IV are college examinations. 5 marks From Unit VI Attempt any two of following i. Semester I. 5 marks ii. 5 marks ii. 3 Q. ……. 10 marks 10 marks 10 marks 10 marks 10 marks 10 marks . …….. …….II. ……...III.