7/25/2019 Bsc It Syllabus Mumbai University
1/81
Academic Council 25/05/2011
Item No. 4.98
UNIVERSITY OF MUMBAI
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 20112012)
7/25/2019 Bsc It Syllabus Mumbai University
2/81
Semester I
Courses Theory Code Practical Code
Professional Communication skills USIT101 USIT1P1
Applied Mathematics I USIT102 USIT1P2
Fundamentals of Information
Technology
USIT103 USIT1P3
Electronics and Communicationtechnology
USIT104 USIT1P4
Introduction to C++ programming USIT105 USIT1P5
CLASS: B. Sc (Information technology) Semester - I
SUBJECT: Professional Communication skills (USIT101)
Periods per weekLectures - 5 3 Credits
Unit I The Seven Cs of Effective CommunicationCompleteness,Conciseness, Consideration, Concreteness, Clarity,Courtesy,Correctness
8Lectures
Unit- II Communication: Its interpretationBasics, NonverbalCommunication, Barriers to Communication
8
Lectures
Unit-III Business Communication at Work Place:
Letter Components and Layout, Planning a letter, Process ofLetter
writing, E-mail Communication, Memo and Memo reports,EmploymentCommunication, Notice agenda and Minutes of meeting,
Brochures
8
Lectures
Unit-IV Report WritingEffective writing, types of businessreports, structure of reports,
gathering information, organization of the material, writingabstracts
and summaries, writing definitions, visual aids, userinstructionmanual.
8
Lectures
Unit -V Required SkillsReading skills, listening skills,note-making, prcis writing,audiovisual aids, oral communication
8
Lectures
Unit-VI Mechanics of WritingTransitions, Spelling rules,hyphenation, transcribing numbers,
Abbreviating technical and non-technical terms, Proofreading.
8
Lectures
Books:
Professional Communication by Aruna Koneru, McGrawHillEffectiveBusiness Communication by Herta A Murphy, Herbert W Hildebrandt,Jane PThomas, McGrawHill
References:
Business Communication, Lesikar and Petit, McGrawHill
Communication Skills Handbook, Summers, Wiley, IndiaBusinessCommunication (Revised Edition), Rai and Rai, Himalaya PublishingHouse
Business Correspondence and Report Writing by R. C. Sharma andKrishna Mohan, TMH.
7/25/2019 Bsc It Syllabus Mumbai University
3/81
Term Work of USIT101: ( For Internal Assessment)
i)
Assignments: Should contain at least 2 assignments covering theSyllabus.
ii) Class Tests: One. Also Known as Unit Test or In-SemesterExaminationsiii)
Tutorial : Minimum Three tutorials covering the syllabus
Practical USIT1P1:
Case Studies 3 Lectures per week ( 1 Credit)
List of Practical:
i) Case study on the 7 Cs of effective communication.
ii) Case study on the body language.
iii) Case study on different types of letters like Jobapplication, Appointment letter,Memos, formal and informal letters,minutes of the meeting, emails.
iv) Case study on reports.v) Case study on oralcommunication.
vi) Case study on technical writing.
7/25/2019 Bsc It Syllabus Mumbai University
4/81
CLASS: B. Sc (Information technology) Semester I
SUBJECT: Applied Mathematics I (USIT102)
Periods per week Lectures - 5 3 Credits
Unit I Matrices:
Minors and Cofactors, Adjoint of a square matrix, Inverse of amatrix.
Rank of a matrix, Solution of hom*ogeneous and nonhom*ogeneous
linear Equations using Matrix method.
8
Lectures
Unit- II Eigen Values and Eigen Vectors:Vectors, linearcombination of vectors, Inner Product of two vectors,characteristicequation, Eigen Vector, Cayley- Hamilton Theorem,
Similarity of Matrices, Derogatory and Non-derogatorymatrices,
Complex Matrices: Hermitian, skew-Hermitian and Unitarymatrices
and their properties.
8
Lectures
Unit -III Vector Calculus:Vector Differentiation: VectorOperator Del, Gradient, and
Geometrical Meaning of gradient, Divergence and Curl.
8
Lectures
Unit - IV Differential Equations:
Differential Equations of 1st order and 1st degree andapplications
8
Lectures
Unit - V Linear Differential Equations:Linear Differentialequations with constant coefficient, Differential
equations of higher order and applications.
8
Lectures
Unit -VI Successive differentiation, Mean Value theorems,Partial
differentiation, Eulers Theorem, Approximation and errors,Maximaand Minima
8
Lectures
Text Books:
Engineering Mathematics A tutorial approach by R. R. Singh andMukul Bhatt, TMH 2010
Text Book of Applied Mathematics Vol I and Vol II. P.N. Wartikar& J.N. Wartikar, Pune
Vidyarthi Griha Prakashan
References:
Higher Engineering Mathematics by B. V. Ramana, McGrawHill
Differential Calculus by Shanti Narayan. S. Chand.
Higher Engineering Mathematics by B.S. Grewal, KhannaPublicationsVector Analysis by Murray Spiegel, McGrawHill
Matrices by Vashistha, S. Chand
Term Work for USIT102
i) Assignments: Should contain at least 2 assignments coveringthe Syllabus.
ii)
Class Tests: One. Also Known as Unit Test or In-SemesterExaminationsiii)
Tutorial : Minimum Three tutorials covering the syllabus
7/25/2019 Bsc It Syllabus Mumbai University
5/81
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 Equationsvi)Problemsolving based on Successive Differentiationvii)
Problem solving based on Mean Value theorems
viii) Problem solving based on Partial differentiationix)
Problem solving based on Eulers Theorem
x) Problem solving based on Approximation and errorsxi)
Problem solving based on Maxima and Minima
7/25/2019 Bsc It Syllabus Mumbai University
6/81
CLASS: B. Sc (Information technology) Semester I
SUBJECT: Fundamentals of Digital Computing (USIT103)
Periods per week Lectures - 5 3 Credits
Unit I Data and Information: Features of Digital Systems, NumberSystems:
Decimal, Binary, Octal, Hexadecimal & their interconversions,
Representation of Data: Signed Magnitude, ones complement &twoscomplement, Binary Arithmetic, Fixed point representation andFloating
point representation of numbers.
Codes : BCD, XS-3, Gray code, hamming code, alphanumericcodes
(ASCII, EBCDIC, UNICODE), Error detecting and error correctingcodes.
8 Lect.
Unit- II Boolean Algebra: Basic gates (AND, OR, NOT gates),Universal gates
(NAND and NOR gates), other gates (XOR, XNOR gates). Booleanidentities,
De Morgan Laws.
Karnaugh maps: SOP and POS forms, Quine McClusky method.
8 Lect.
Unit -III Combinational Circuits:
Half adder, full adder, code converters, combinational circuitdesign,
Multiplexers and demultiplexers, encoders, decoders,Combinationaldesign using mux and demux.
8 Lect.
Unit - IV Sequential Circuit Design:
Flip flops (RS, Clocked RS, D, JK, JK Master Slave, T, Counters,Shift
registers and their types, Counters: Synchronous andAsynchronous
counters.
8 Lect.
Unit- V Computers: Basic Organization, Memory: ROM, RAM, PROM,EPROM,
EEPROM, Secondary Memory: Hard Disk & optical Disk, CacheMemory,
I/O devices
8 Lect.
Unit -VI Operating Systems:
Types (real Time, Single User / Single Tasking, Single user /Multi
tasking, Multi user / Multi tasking, GUI based OS. Overview ofdesktopoperating systems-Windows and LINUX.
8 Lect.
Text Books: Modern Digital Electronics by R. P. Jain, 3rd
Edition, McGraw Hill
Digital Design and Computer Organisation by Dr. N. S. Gill andJ. B. Dixit,University Science Press
Linux Commands by Bryan Pfaffaenberger BPB Publications
UNIX by Sumitabha Das, TMHReferences: Digital Principles andApplications by Malvino and Leach, McGrawHill
Introduction to Computers by Peter Norton, McGraw Hill
Term Work for USIT103
i) Assignments: Should contain at least 2 assignments coveringthe Syllabus.ii)
Class Tests: One. Also Known as Unit Test or In-SemesterExaminations
iii) Tutorial : Minimum Three tutorials covering thesyllabus
7/25/2019 Bsc It Syllabus Mumbai University
7/81
Practical USIT1P3:
Journal Practical 3 Lectures per week (1 Credit)
List of Practical
1. Study of logic gates (basic and universal)
2. Verify De Morgans theorems3.
Design and implement Half adder and full adder using gates.
4.
Design and implement binary to gray code converter and viceversa using XOR gates.5.
Design & implement multiplier for two 2-bit binary numbersusing minimum number of
gates.
6. Reduce the given numeric form using K-map and implement usinggates.7.
Implement SOP /POS forms using logic gates.
8. Implement logic gates using multiplexers.9. Implementexpressions using multiplexers and demultiplexers
10.Implement 3-bit binary ripple counter using JK flipflops.Linux: 1. Installation of Linux
2. Study of Linux Commands with all switches: ls, mkdir, cd,rmdir, wc, cat, mv,chmod, date, time, grep, tty, who, whoami,finger, pwd, man, cal, echo, ping,
ifconfig, tar, telnet
7/25/2019 Bsc It Syllabus Mumbai University
8/81
CLASS: B. Sc (Information technology) Semester I
SUBJECT: Electronics and Communication Technology (USIT104)
Periods per week Lectures - 5 3 Credits
Unit I Concept of Conductor, Semiconductor, Insulator.Semiconductor
Diode, Forward bias, Reverse Bias, Application of Diode asRectifier,
Zener diode and its applications, Introduction to Transistor(BJT,FET), PNP, NPN Transistors their Characteristic. ApplicationofTransistor as amplifier and as a Switch.
8 Lect.
Unit- II Concept of amplification, amplifier notations, Av, Ai,Ap Zi, Zo),
Application of BJT as single stage Amplifier, Frequency responseof
single stage Amplifier. Multistage Amplifiers:- (Basicsconcepts) RC
coupled, cascade, Darlington pair, DC amplifiers.
8 Lect.
Unit-III Concept of Feedback:- Negative Feedback and itsadvantage inAmplification, Positive Feedback :- Oscillators, RCPhase Shift
Oscillator, LC Oscillator. Switching Circuits Multivibrators :-
Monostable using IC 555 and Astable using IC 555(includingproblems)
8 Lect.
Unit- IV Introduction:- Need for modulation system, Concept ofModulation.
AM :- Definition of AM, Modulation index, Power relation inAM,Generation and Demodulation of AM. SSB:- Power requirementin
comparison with AM, Advantages of SSB over AM, Concept of
Balanced Modulator, Generation of SSB, Pilot CarrierSystem,Independent Side System, Vestigial SidebandTransmission.
8 Lect.
Unit- V FM: - Definition of FM, Bandwidth, Noise triangle,Per-emphasis andDe- emphasis. PM: - Definition of PM. Differencebetween AM and
FM. Radio receivers. Pulse Modulation:- Sampling Theorem,PAM,
PTM, PWM, PPM, pulse code modulation, Quantizationnoise,companding, PCM system, differential PCM, Deltamodulation.
Multiplexing: - FDM/TDM. Television:- Scanning, CompositeVideosignal, Television Transmitter, television receiver.
8 Lect.
Unit-VI Introduction to Digital Communication: PSK, ASK,FSK.Introduction to fibre optics system:- Propagation of light inopticalfibre; ray model . Types of fibre : Single mode, stepsindex. Graded
index. Signal distortion: attenuation, dispersion. Opticalsources: LED,
LASERS. Optical Detectors and optics links. Link Budget.
8 Lect.
References
Allen Mottershead, Electronic Devices and Circuits, PHIBoylsteadand Neshelesky , Electronics Devices and Circuits, 4
th, PHI, 1999.
Simon Haykin, An Introduction to Analog and Digitalcommunications, John Wiley andSons, 1994.
R.B Carlson, Communication Systems, MacGraw Hill.
George Kennedy, Electrical Communication systems, Tata McGrawHill 1993.Roody Collin, Electronics Communication, PHI
J. Millman and A Grabel, Microelectronics MacGraw Hill1988.Proakis J. J, Digital Communications Mc Graw Hill.
Digital Communications by TAUB Schilling
7/25/2019 Bsc It Syllabus Mumbai University
9/81
Electronic Communication Systems, Roy Blake Delmar, ThompsonLearning
Introduction To telecommunications, Anu A Gokhale, DelmarThompson Learning
Term Work for USIT104
i)
Assignments: Should contain at least 2 assignments covering theSyllabus.
ii)
Class Tests: One. Also Known as Unit Test or In-SemesterExaminations
iii) Tutorial : Minimum Three tutorials covering thesyllabus
Practical (USIT1P4):
Journal Practical 3 Lectures per Week (1 Credit)
List of Practical
1. Study of Zener diode characteristics
2. Study of Half wave and full wave rectifiers3. Study of bridgerectifier.
4. Study of Transistor as a switch5.
Monostable multivibrator using IC 555 timer.
6.
Astable multivibrator using IC 555 timer.7. Study of Wien bridgeoscillator
8. Frequency Response of single stage transistor amplifier9.
Study of Amplitude Modulation
10.Study of Frequency Modulation11.Study of Fibre Optictransmission
12.Study of Pulse Amplitude Modulation
13.Study of transistor DC Amplifier
7/25/2019 Bsc It Syllabus Mumbai University
10/81
CLASS: B. Sc (Information technology) Semester I
SUBJECT: Introduction to C++ programming (USIT105)
Periods per week Lectures 5 3 Credits
Unit
I
Programming Logic and techniques : Algorithms, Flow-charts,Program
Design, Introduction to C++: Origin of C++, A Sample C++program, pitfalland programming tips. Testing and Debugging.
8
Lect.
Unit-II
C++ concepts : Variables and Assignments: variables,identifiers, variabledeclarations, Assignment Statements, referencevariable, symbolic constant,
Input and Output: cin, cout, escape sequences, includedirectives and
Namespaces, Indenting and Comments, Operator precedence, Datatypes andexpressions, Arithmetic operators, Typecompatibilities.
8
Lect.
Unit-
III
Flow of Control : Compound statements, Loops: while, for, dowhile, nested
loops, Decision making: if else, nested if else, switch , breakand continue,
Manipulators: endl , setw,sizeof, Increment and decrementoperators, TypeCast Operators, Scope resolution operators
8
Lect.
Unit-
IV
Functions: Function Prototypes, built in functions and userdefined functions,
Function overloading, Call by reference, Call by value, constmember functions.Inline Functions and recursive functions, MathLibrary Functions.
8
Lect.
Unit-
V
Derived Data types ( Arrays , pointers , functions) :Introduction to arrays,
arrays in functions, 2-D arrays , Multidimensional arrays,Introduction topointers, void pointers, pointers in function,pointer to constant and constantpointer, generic pointer.
8
Lect.
Unit-VI
Strings, Vectors and Structures : String functions: strcmp,strcat, strlen,strcpy . Vector Basics. Introduction toStructures.
8
Lect.
Books: Problem Solving with C++ , Walter Savitch, Sixth Edition,Pearson Education.J.R.Hubbard, Schaums outlines Programming withC++, Second Edition, Tata McGrawHill
Y.P.Kanetkar, Let us C++ , seventh edition, BPBpublicationReference Books: Object Oriented programming with C++ ,E Balagurusamy , Third Edition ,
Tata McGraw Hill.Pure C++ programming , Amir Afzal, PearsonEducation.
Computer Science A structured Approach using C++ by B. Forouzan,R. F. Gilberg,
Cengage Publication.
Term Work for USIT105
i)
Assignments: Should contain at least 2 assignments covering theSyllabus.ii)
Class Tests: One. Also Known as Unit Test or In-SemesterExaminations
iii)
Tutorial : Minimum Three tutorials covering the syllabus
7/25/2019 Bsc It Syllabus Mumbai University
11/81
Practical (USIT1P5):
Journal Practical 3 Lectures per Week (1 Credit)
List of Practical
1)
Write a C++ program for finding greatest of three number.
2) Write a C++ program for solving the quadratic equation.
3) Write a C++ program to print all the prime numbers in a givenrange.
4)
Write a C++ program for displaying the Fibonacci series.
5)
Write a C++ program for converting number to words.(switch,break,continue)
6)
Write a C++ function for swapping two numbers without usingthird variable.
8) Write a recursive function for factorial of given number.
9) Write your own function for string reverse , stringpalindrome , string comparision
10) Write a program for sorting the number in ascending anddescending order
11) Write a program for Matrix addition and multiplication.
12) Write a program for implementing the concept ofstructures.
13) Write a program for finding the greatest and smallest numberusing vector.
14) Write a program for implementing the concept of call byvalue and call by reference.
15) Write a program for generating the report card.
7/25/2019 Bsc It Syllabus Mumbai University
12/81
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 USIT204 USIT2P4
Data Communication and Networking
StandardsUSIT205 USIT2P5
CLASS: B. Sc (Information technology) Semester II
SUBJECT: Web Designing and Programming (USIT201)
Periods per week Lectures 5 3 Credits
Unit I Internet and WWW : What is Internet?, Introduction tointernet and itsapplications, E-mail, telnet, FTP, e-commerce,video conferencing, e-
business. Internet service providers, domain name server,internet address
World Wide Web (WWW) : World Wide Web and its evolution,uniform
resource locator (URL), browsers internet explorer, netscapenavigator,
opera, firefox, chrome, mozilla. search engine, web saverapache, IIS,
proxy server, HTTP protocol
8
lectures
Unit- II HTML and Graphics : HTML Tag Reference, GlobalAttributes,
Event Handlers, Document Structure Tags, Formatting Tags,TextLevel formatting, Block Level formatting, List Tags, Hyperlinktags,
Image and Image maps, Table tags, Form Tags, FrameTags,Executable content tags
Imagemaps : What are Imagemaps?, Client-side Imagemaps,Server-side Imagemaps, Using Server-side and Client-sideImagemapstogether, Alternative text for Imagemaps,
Tables : Introduction to HTML tables and their structure, Thetable
tags, Alignment, Aligning Entire Table, Alignment within arow,
Alignment within a cell, Attributes, Content Summary,BackgroundColor, Adding a Caption, Setting the width, Adding aborder, Spacing
within a cell, Spacing between the cells, Spanning multiple rowsorcolumns, Elements that can be placed in a table, Table Sectionsand
column properties, Tables as a design tool
Frames : Introduction to Frames, Applications, Framesdocument,
The tag, Nesting tag, Placing contentin frames with the tag,Targeting named frames, Creating
floating frames, Using Hidden frames,Forms : Creating Forms, Thetag, Named Input fields, The
tag, Multiple lines text windows, Drop down and listboxes,Hidden, Text, Text Area, Password, File Upload, Button,Submit,
Reset, Radio, Checkbox, Select, Option, Forms and Scripting,Action
Buttons, Labelling input files, Grouping related fields,Disabled and
read-only fields, Form field event handlers, Passing formdataStyle Sheets : What are style sheets?, Why are style sheetsvaluable?,
8
lectures
7/25/2019 Bsc It Syllabus Mumbai University
13/81
Different approaches to style sheets, Using Multipleapproaches,Linking to style information in s separate file,,Setting up style
information, Using the tag, Embedded style information,Usingtag, Inline style information
Unit- III Java Script : Introduction, Client-Side JavaScript,Server-SideJavaScript, JavaScript Objects, JavaScript Security,
Operators : Assignment Operators, Comparison Operators,Arithmetic
Operators, % (Modulus), ++(Increment), --(Decrement),-(Unary
Negation), Logical Operators, Short-Circuit Evaluation, StringOperators,
Special Operators, ?: (Conditional operator), , (Commaoperator), delete,
new, this, void
Statements : Break, comment, continue, delete, do...while,export, for,
See AlsoBest Mattress for Heavy PeopleCritical Degrees Astrology Calculator - TheReadingTubDelhi govt moves SC for more water from Himachal, Haryanafor...in, function, if...else, import, labelled, return, switch,var, while,
with,
Core JavaScript (Properties and Methods of Each) : Array,Boolean,
Date, Function, Math, Number, Object, String, regExp
Document and its associated objects : document, Link, Area,Anchor,
Image, Applet, Layer
Events and Event Handlers : General Information aboutEvents,
Defining Event Handlers, event, onAbort, onBlur, onChange,onClick,
onDblClick, onDragDrop, onError, onFocus, onKeyDown,onKeyPress,onKeyUp, onLoad, onMouseDown, onMouseMove,onMouseOut,
onMouseOver, onMouseUp, onMove, onReset, onResize, onSelect,
onSubmit, onUnload
8
lectures
Unit IV XML : Introduction to XML, Anatomy of an XMLdocument,
Creating XML Documents, Creating XML DTDs, XML Schemas,XSL
8
lectures
Unit V PHP : Why PHP and MySQL?, Server-side web scripting,Installing
PHP, Adding PHP to HTML, Syntax and Variables,Passinginformation between pages, Strings, Arrays and ArrayFunctions,
Numbers, Basic PHP errors/problems.
8
lectures
Unit VI Advanced PHP and MySQL : PHP/MySQL Functions,Displaying
queries in tables, Building Forms from queries, String andRegular
Expressions, Sessions, Cookies and HTTP, Type andTypeConversions, E-Mail
8
lectures
References :
1.
Web Design The Complete Reference, Thomas Powell, TataMcGrawHill
2.
HTML and XHTML The Complete Reference, Thomas Powell, TataMcGrawHill
3. JavaScript 2.0: The Complete Reference, Second Edition byThomas Powell and Fritz Schneider4. PHP: The Complete Reference BySteven Holzner, Tata McGrawHill
Term Work for USIT201
i) Assignments: Should contain at least 2 assignments coveringthe Syllabus.ii)
Class Tests: One. Also Known as Unit Test or In-SemesterExaminations
iii) Tutorial : Minimum Three tutorials covering thesyllabus
7/25/2019 Bsc It Syllabus Mumbai University
14/81
Practicals (USIT2P1):
Journal Practical 3 Lectures per Week (1 Credit)
List of Practical
1.
Design a web page using different text formatting tags.2. Designa web page with links to different pages and allow navigationbetween pages.3.
Design a web page with Imagemaps.
4. Design a web page with different tables. Design a webpagesuing table so that the
content appears well placed.
5. Design a webpage using frames.6. Design a web page with aform that uses all types of controls.
7. Design a website using style sheets so that the pages haveuniform style.8.
Using Java Script design a web page that prints factorial /Fibonacci series / any given series.
9. Design a form with a test box and a command button. UsingJava Script write aprogram whether the number entered in the textbox is a prime number or not.
10.
Design a form and validate all the controls placed on the formusing Java Script.11.Design a DTD, corresponding XML document anddisplay it in browser using CSS.
12.Design an XML document and display it in browser usingXSL.13.
Design XML Schema and corresponding XML document.
7/25/2019 Bsc It Syllabus Mumbai University
15/81
CLASS: B. Sc (Information technology) Semester II
SUBJECT: Applied Mathematics II (USIT202)
Periods per weekLectures 5 3 Credits
Unit I
Complex Numbers: Cartesian, Polar & Exponential form,De-Moivre'stheorem, Hyperbolic functions, Logarithms of Complexnumbers
8 Lect.
Unit-II
Complex Variables : Cauchy Riemann Equations, , ConformalMappingand Bilinear Mapping, concept of Line Integral, RiemannIntegral,
Singularities Poles, Evaluation of Residues theorem.
8 Lect.
Unit III
Laplace Transform: Introduction, Definition, Properties ofLaplaceTransform, Laplace Transform of standard function.
Inverse Laplace Transform:
Inverse Laplace Transform , Methods of obtaining InverseLaplace
transform, Laplace transform of Periodic Functions, HeavysideUnit-stepFunction, Dirac-delta function (Unit Impulse Function),Application ofInverse Laplace transform to solve differentialequations.
8 Lect.
Unit
IV
Differentiation under Integral sign, Beta and GammaFunctions,
Properties and Duplication Formula, Error Functions
8 Lect.
Unit V
Fourier Series:
Fourier Series, Change of Interval, Even and odd functions, Halfrangeexpansions.
Fourier Transform and Inverse Fourier Transform:
Fourier transform of Even and Odd functions, Fourier Transformof sineand cosine functions
8 Lect.
Unit VI
Integral Calculus: Double Integral, Area, Triple Integral,Volume 8 Lect.
References:
Differential Calculus by Shanti Narayan.B. S. Grewal, HigherEngineering Mathematics.
Advanced Engineering Mathematics: R.K.Jain, S.R.K. Iyengar,Narosa Publishing House.
Engineering Mathematics : T Veerajan, Tata McGraw-HillIntegralTransforms: A. R. Vasishta, Dr. R.K. Gupta, Krishna PrakashanMandir.
Term Work for USIT202
i) Assignments: Should contain at least 2 assignments coveringthe Syllabus.ii)
Class Tests: One. Also Known as Unit Test or In-SemesterExaminations
iii) Tutorial : Minimum Three tutorials covering thesyllabus
7/25/2019 Bsc It Syllabus Mumbai University
16/81
Practicals (USIT2P2):
Problem Solving 3 Lectures per Week (1 Credit)
List of Problems
i) Problem solving based on Complex Numbersii)
Problem solving based on Complex Variables
iii)
Problem solving based on Laplace Transformsiv)Problem solvingbased on Inverse Laplace Transformsv)
Problem solving based on Differentiation under the integralsign
vi)Problem solving based on Beta and gamma functions
vii) Problem solving based on error functions
viii)Problem solving based on Fourier seriesix)Problem solvingbased on Fourier transforms
x) Problem solving based on double integrals and areaxi)Problemsolving based on triple integrals
7/25/2019 Bsc It Syllabus Mumbai University
17/81
CLASS: B. Sc (Information technology) Semester II
SUBJECT: Microprocessor and microcontrollers (USIT203)
Periods per week Lectures 5 3 Credits
Unit I
Logic Devices: Tristate devices, buffers, encoder, decoder,latches.Types of memories, memory organization, concept of controllines such
as read/write, chip enable.
8 Lect.
Unit-
II
Introduction to 8085 microprocessor: - Organization ofMicroprocessor
based system, 8085 p Architecture, Concept of Address lineand
Memory interfacing, Address Decoding and Memory Interfacing,
8 Lect.
Unit-
III
8085 Programming Model, Instruction Classification,Instruction
Format, 8085 Instruction Set
8 Lect.
Unit-
IV
Introduction to Modern day Computer Systems: - Organizationand
Architecture, Structure and function.System Buses: - ComputerComponents, Computer function, PCI: -
Features of PCI bus, Why PCI bus is needed? Concept of PCI
Arbitration.
Internal Memory: - Concept of Cache Memory, Methods of Cache
Mapping, Concept and need for Cache coherency. External Memory:-
RAID.
8 Lect.
Unit-
V
The 8051 Microcontroller:
Introduction and overview of 8051 family, 8051 AssemblyLanguage
Programming, Jumps, Loops and call instructions.
8 Lect.
Unit-
VI
8051 I/O port programming, Addressing Modes, Arithmetic andLogical
instructions.
8 Lect.
References
William Stallings, Computer Organisation and Architecture (4th
Edition ) - PHI, 1998.
Andrew C. Tanenbaum, Structured Computer Organisation (3rdEdition) -, PHI.Computer System Architecture - M. Morris Memo, PHI,1998.
John P Hayes, Computer Architecture and Organisation - McGrawHill, 1998.
Digital Computer Fundamentals, MalvinoMicroprocessorArchitecture and Programming and Applications with the 8085, R.S.Gaonkar,
PRI (3rdEdition)Digital Computer Fundamentals, Thomas C Bartee,TMG
The 8051 Microcontroller and Embedded systems by M. A. Mazidi,J. G. Mazidi and R. D.
McKinlay, Pearson Education.
7/25/2019 Bsc It Syllabus Mumbai University
18/81
Term Work for USIT203
i)
Assignments: Should contain at least 2 assignments covering theSyllabus.
ii)
Class Tests: One. Also Known as Unit Test or In-SemesterExaminations
iii) Tutorial : Minimum Three tutorials covering thesyllabus
Practicals (USIT2P3):
Journal Practical 3 Lectures per Week (1 Credit)
8085 programs for
1.
Simple 8-bit and 16-bit addition and subtraction
2.
Transfer a block of data from one location to another.
3. Find the largest/smallest of the numbers stored at onelocation.
4. Addition of 10 numbers.
5. Multiplication of 8-bit and 16-bit numbers.
6. Sorting of numbers.
7.
BCD addition8.
Division
9. Find GCD and LCM of two numbers
10.Swapping a block of data
8051 programs for:
1.
To search a number from a given set of numbers. The end of thedata is indicated by 00.
2.
Finding the average of signed numbers.
3. Multiplication of signed numbers.
4.
Convert the BCD 0111 0101 number to two binary numbers andtransfer this number to registers.
5.
To find y where y = x2 + 2x + 5 and x is between 0 and 9.
6. Write a program to show the use of the BIT directive.
7. Write a program to find the number of zeros in registerR2
8. Write a program to check if the accumulator is divisible by8.
9. To check whether a character string is a palindrome ornot.
10.To check the number is prime or not.
7/25/2019 Bsc It Syllabus Mumbai University
19/81
CLASS: B. Sc (Information technology) Semester II
SUBJECT: DBMS (USIT204)
Periods per week Lectures 5 3 Credits
Unit
IIntroduction to Databases and Transactions :
What is database system, purpose of database system, view ofdata,
relational databases, database architecture, transactionmanagement,
8
Lect
Unit-
II
Data Models : The importance of data models, Basic buildingblocks,
Business rules, The evolution of data models, Degrees of dataabstraction.
8
Lect
Unit-
IIIDatabase Design, ER-Diagram and Unified ModelingLanguage:
Database design and ER Model:overview, ER-Model, Constraints,ER-
Diagrams, ERD Issues, weak entity sets, Codds rules,RelationalSchemas, Introduction to UML
Relational database model: Logical view of data, keys, integrityrules.
Relational Database design: features of good relational databasedesign,
atomic domain and Normalization (1NF, 2NF, 3NF, BCNF).
8
Lect
Unit-IV Relational Algebra and Calculus: Relational algebra:introduction,Selection and projection, set operations, renaming,Joins, Division, syntax,
semantics. Operators, grouping and ungrouping, relationalcomparison.Calculus: Tuple relational calculus, Domain relationalCalculus, calculus
vs algebra, computational capabilities.
8Lect
Unit-
V
Constraints, Views and SQL: What is constraints, types ofconstrains,
Integrity constraints, Views: Introduction to views, dataindependence,security, updates on views, comparison between tablesand views
SQL: data definition, aggregate function, Null Values, nestedsub queries,
Joined relations. Triggers.
8
Lect
Unit-
VI
Transaction management and Concurrency control: Transaction
management: ACID properties, serializability and concurrencycontrol,Lock based concurrency control (2PL, Deadlocks),Timestamping
methods, optimistic methods, database recovery management.
8
Lect
7/25/2019 Bsc It Syllabus Mumbai University
20/81
Books:
A Silberschatz, H Korth, S Sudarshan, Database System andConcepts,fifth EditionMcGraw-Hill ,Rob, Coronel, Database Systems,Seventh Edition, Cengage Learning
Term Work for USIT204
i)
Assignments: Should contain at least 2 assignments covering theSyllabus.
ii)
Class Tests: One. Also Known as Unit Test or In-SemesterExaminations
iii) Tutorial : Minimum Three tutorials covering thesyllabus
Practicals (USIT2P4):
Journal Practical 3 Lectures per Week (1 Credit)
List of Practical:
1. Design a Database and create required tables. For e.g. Bank,College Database
2.
Apply the constraints like Primary Key , Foreign key, NOT NULLto the tables.3. Write a sql statement for implementingALTER,UPDATE and DELETE4.
Write the queries to implement the joins
5. Write the query for implementing the followingfunctions:MAX(),MIN(),AVG(),COUNT()
6.
Write the query to implement the concept of Intergrityconstrains
7. Write the query to create the views
8. Perform the queries for triggers9. Perform the followingoperation for demonstrating the insertion , updation and
deletion using the referential integrity constraints10.
Write the query for creating the users and their role.
7/25/2019 Bsc It Syllabus Mumbai University
21/81
CLASS: B. Sc (Information technology) Semester - II
SUBJECT: - Data Communication and Networking Standards(USIT2P5)
Periods per weekLectures - 5 (3 Credits)
Unit-I Introduction to data communications and networking
Introduction, Fundamental concepts, Data communications,Protocol,standards, standard organizations, signal propagation,analog and digital
signals, bandwidth of signal and a medium, Fourier analysis andtheconcept of bandwidth of a signal, The data transmission rate andbandwidth.
8 Lect
Unit-II Network Models
Layered Tasks, The OSI reference model , Layers in the OSIreference
model , TCP/IP protocol suite , Addressing IPv4
8 Lect
Unit-III Information Encoding , Errors Detection andCorrectionIntroduction, Representing different symbols, Minimizingerrors ,
Multimedia , Multimedia and Data compression. Errorclassification, types
of errors, redundancy, detection versus correction , hammingdistance ,
cyclic redundancy check.
8 Lect
Unit-IV Media and Transmission modesData and signals, Periodicanalog signals, Digital signals, Transmissionimpairment, Data ratelimits, Performance, Digital to digital, Analog to
digital conversion , Transmission modes, Digital to analogconversion ,
Analog to analog conversion, Guided media and Unguided media
8 Lect
Unit-V Network topologies ,Switching and routing algorithmsMesh,star, tree, ring, bus, hybrid, switching basics , circuitswitching,
packet switching and Message switching , routing algorithms
8 Lect
Unit-VI IP version 6
Overview , Terminology, IPv6 addresses , Special addresses , IPv 6 headerformats, IPv6 extension headers , IPv6 autoconfiguration, configuration via
DHCP v6 , IPv6 transition
8 Lect
Books:
Behrouz A Forouzan, Data communications and Networking, FourthEdition , Mc-Graw
Hill
Achyut Godbole, Data communications and Networks, TMH
Dr.Sidnie Feit, TCP/IP ,Second Edition,TMHReference:W.Stallings,Data and Computer Communications,EightEdition,Pearson Education
Term Work for USIT205
i)
Assignments: Should contain at least 2 assignments covering theSyllabus.
ii)
Class Tests: One. Also Known as Unit Test or In-SemesterExaminations
iii) Tutorial : Minimum Three tutorials covering thesyllabus
7/25/2019 Bsc It Syllabus Mumbai University
22/81
Practical (USIT2P5):
Case Studies 3 Lectures Per Week ( 1 Credit)
List of Cases
i) Case study on implementation of TCP/IP model in differentOSii)
Case study on errors in data transmission
iii)
Case study on transmission mediaiv)Case study on static IPaddressingv)
Case study on dynamic IP addressing
vi)Case study on network devices: Routers, Switches, Bridges
vii) Case study on IPv6
7/25/2019 Bsc It Syllabus Mumbai University
23/81
Issues related to Term Work, tutorial, assignments andPracticalsFollowing is the marks distribution for Theory andPractical. Minimum 16 marks out of 40 and
24 marks out of 60 for passing in Theory and 8 marks out of 20and 12 marks out of 30 for
passing in Practical.
Credit of 3 of Theory and 1 of Practical for any course is to beawarded only if students clear
both.
Semester I
Theory
Course Internal Assessment (40 Marks) External Assessment(60Marks)
Total(100 Marks)
Assignment Tutorial Class
Test
Theory Exam
USIT101 10 10 20 60 100
USIT102 10 10 20 60 100
USIT103 10 10 20 60 100
USIT104 10 10 20 60 100
USIT105 10 10 20 60 100
Practical
Course Internal Assessment (20 Marks) External Assessment (30Marks) Total
(50 Marks)
USIT1P1 Case Study Case Study 50
USIT1P2 Problem Solving Problem Solving 50
USIT1P3 Lab and Journal Practical Exam 50
USIT1P4 Lab and Journal Practical Exam 50
USIT1P5 Lab and Journal Practical Exam 50
Semester II
Theory
Course Internal Assessment (40 Marks) External Assessment(60
Marks)
Total(100 Marks)
Assignment Tutorial ClassTest
Theory Exam
USIT201 10 10 20 60 100
USIT202 10 10 20 60 100
USIT203 10 10 20 60 100
USIT204 10 10 20 60 100
USIT205 10 10 20 60 100
Practical
Course Internal Assessment (20 Marks) External Assessment (30Marks) Total
(50 Marks)
USIT2P1 Lab and Journal Practical Exam 50
USIT2P2 Problem Solving Problem Solving 50
USIT2P3 Lab and Journal Practical Exam 50
USIT2P4 Lab and Journal Practical Exam 50
USIT2P5 Case Study Case Study 50
Tutorials are theory /problems to be solved by the students inthe class room at the end of practical / theory
session
Assignments are theory / problems to be solved by the studentsat home.
Class Test is to be conducted in the class room with due notice.Test could be out of any sum total but is to be
converted out of 20 for class test.
7/25/2019 Bsc It Syllabus Mumbai University
24/81
Semester I,II,III,IV are college examinations. Question paperswill be set by examiners appointed by Principals
of the affiliated colleges.
Suggested Question Paper Format for END Semester Examination
Duration : 2 hrs. Total Marks : 60
All Questions Compulsory:
Q. 1 From Unit I
Attempt any two of followingi. .. 5 marks
ii. .. 5 marksiii. .. 5 marks
10 marks
Q. 2 From Unit II
Attempt any two of following
i. .. 5 marksii.
.. 5 marks
iii. .. 5 marks
10 marks
Q. 3 From Unit IIIAttempt any two of following
i. .. 5 marksii. .. 5 marksiii.
.. 5 marks
10 marks
Q. 4 From Unit IVAttempt any two of following
i. .. 5 marks
ii. .. 5 marksii.
.. 5 marks
10 marks
Q. 5 From Unit IIAttempt any two of following
i. .. 5 marksii. .. 5 marks
iii. .. 5 marks
10 marks
Q. 6 From Unit II
Attempt any two of followingi.
.. 5 marks
ii. .. 5 marks
iii. .. 5 marks
10 marks
Note: Internal choice should be given.
7/25/2019 Bsc It Syllabus Mumbai University
25/81
7/25/2019 Bsc It Syllabus Mumbai University
26/81
1
Academic Council 25/05/2011
Item No. 4.99
UNIVERSITY OF MUMBAI
Revised Syllabus for the S.Y.B.Sc.
in
Information Technology
(with effect from the academic year 20112012)
7/25/2019 Bsc It Syllabus Mumbai University
27/81
2
S Y BSc Information Technology Revised syllabus(2011-12)
Semester III
P1. Logic and Discrete Mathematics
P2. Computer Graphics
P3. Advanced SQL
P4. Object Oriented Programming with C++
P5. Modern Operating Systems
Semester IV
P1. Software Engineering
P2. Multimedia
P3. Java and Data Structures
P4. Quantitative Techniques
P5. Embedded Systems
7/25/2019 Bsc It Syllabus Mumbai University
28/81
3
CLASS: B. Sc (Information techno logy) Semester III
COURSE: Logic and Discrete Mathematics
Periods per week
1 Period is 50 minutes
Lecture 5
TW/Tutorial/Practical 3
Hours Marks
Evaluation System Theory Examination 3 100
TW/Tutorial /Practical -- 50
Unit-I Set Theory:Fundamentals - Sets and subsets, VennDiagrams, 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
Unit-II Relations, diagraphs and lattices: Product sets andpartitions, relations and
digraphs, paths in relations and digraphs, properties ofrelations, equivalence andpartially ordered relations, computerrepresentation of relations and digraphs,
manipulation of relations, Transitive closure and Warshallsalgorithm, Posets and
Hasse Diagrams, Lattice.
Unit-III Functions and Pigeon Hole Principle: Definitions andtypes of functions:
injective, surjective and bijective, Composition, identity andinverse, Pigeon
hole principle.
Unit-IV 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 treesand Prefix
Codes.
7/25/2019 Bsc It Syllabus Mumbai University
29/81
4
Unit-V Algebraic Structures: Algebraic structures with onebinary operation semi groups,
monoids and groups, Product and quotient of algebraicstructures, Isomorphism,
hom*omorphism, automorphism, Cyclic groups, Normal sub group,codes and group
codes, Algebraic structures with two binary operations rings,integral domains and
fields. Ring hom*omorphism and Isomorphism.
Unit-VI Generating Functions and Recurrence relations: Seriesand Sequences,
Generating Functions, Recurrence relations, Applications,Solving differenceequations, Fibonacci.
Books:
Discrete mathematical structuresby B Kolman RC Busby, S Ross PHIPvt. Ltd.
Discrete mathematical structuresby RM Somasundaram (PHI) EEEedition
References:
Discrete structuresby Liu, TataMcGrawHill
Digital LogicJohn M Yarbrough Brooks/cole, Thompson Learning
Discrete Mathematics and its Applications,Kenneth H. Rosen,TataMcGrawHill
Discrete Mathematics for computer scientists and Mathematicians,Joe L.Mott, Abraham Kandel
Theodore P. Baker, Prentice-Hall of India Pvt. Ltd.
Discrete MathematicsWith Applications, Susanna S. Epp,Books/Cole Publishing Company
Discrete Mathematilcs, Schaums Outlines Series, SeymourLipschutz, Marc Lipson, Tata
McGrawHill
Term Work:
Assignment: Shouldcontain at least 6 assignments (one per unit)covering the
Syllabus.
Tutorial:At leastthree tutorials based on above syllabus must beconducted.
7/25/2019 Bsc It Syllabus Mumbai University
30/81
5
CLASS: B. Sc (Information technology) Semester III
COURSE: Computer Graphics
Periods per week
1 Period is 50 minutes
Lecture 5
TW/Tutorial/Practical 3
Hours Marks
Evaluation System Theory Examination 3 100
TW/Tutorial /Practical -- 50
Unit-I Introduction Computer Graphics and PrimitiveAlgorithms:Introduction to Image
and Objects, Image Representation, Basic Graphics Pipeline,Bitmap and Vector-
Based Graphics, Applications of Computer Graphics, DisplayDevices, Cathode Ray
Tubes, Raster-Scan Display, Random-Scan Display, Flat PanelDisplay, Input
Technology, Coordinate System Overview,
Scan-Conversion of graphics primitives: Scan-Conversion of aLines (Digital
Differential Analyzer Algorithm, Bresenhams Line-DrawingAlgorithm, Scan-
Conversion of Circle and Ellipse (Bresenhams Method of CircleDrawing, Midpoint
Circle Algorithm), Drawing Ellipses and Other Conics.
Unit-II Two Dimensional Transformation: Introduction totransformations, Transformation
Matrix, Types of Transformations in Two-Dimensional Graphics:Identity
Transformation, Scaling, Reflection, Shear Transformations,Rotation, Translation,
Rotation about an Arbitrary Point, Combined Transformation,hom*ogeneous
Coordinates, 2D Transformations using hom*ogeneousCoordinates
Unit-III Three-dimensional transformations, Objects inhom*ogeneous Coordinates, Three-
Dimensional Transformations: Scaling, Translation, Rotation,Shear Transformations,
Reflection, World Coordinates and Viewing Coordinates,Projection, Parallel
Projection, Perspective Projection.
Unit-IV Viewing and Solid Area Scan-Conversion: Introduction toviewing and clipping,
Viewing Transformation in Two Dimensions, Introduction toClipping, Two-
Dimensional Clipping, Point Clipping, Line Clipping,Introduction to a Polygon
Clipping, Viewing and Clipping in Three Dimensions,Three-Dimensional Viewing
Transformations, Text Clipping
Introduction to Solid Area Scan-Conversion , InsideOutside Test,Winding
Number Method and Coherence Property, Polygon Filling, Seed FillAlgorithm, Scan-
7/25/2019 Bsc It Syllabus Mumbai University
31/81
6
Line Algorithm, Priority Algorithm, Scan Conversion ofCharacter, Aliasing, Anti-
Aliasing, Halftoning, Thresholding and Dithering
Unit-V Introduction to curves, Curve Continuity, Conic Curves,Piecewise Curve Design,
Parametric Curve Design, Spline Curve Representation, BezierCurves, B-Spline
Curves, Fractals and its applications.
Surface Design: Bilinear Surfaces, Ruled Surfaces, DevelopableSurfaces, CoonsPatch, Sweep Surfaces, Surface of Revolution,Quadric Surfaces, Constructive Solid
Geometry, Bezier Surfaces, B-Spline Surfaces, SubdivisionSurfaces
Visible Surfaces: Introduction to visible and hidden surfaces,Coherence for visibility,
Extents and Bounding Volumes, Back Face Culling, PaintersAlgorithm, Z-Buffer
Algorithm, Floating Horizon Algorithm, Roberts Algorithm.
Unit-VI Object Rendering: Introduction Object-Rendering, LightModeling Techniques,
Illumination Model, Shading, Flat Shading, Polygon Mesh Shading,Gaurand Shading
Model, Phong Shading, Transparency Effect, Shadows, Texture andObject
Representation, Ray Tracing, Ray Casting, Radiosity, ColorModels.
Introduction to animation, Key-Frame Animation, Construction ofan Animation
Sequence, Motion Control Methods, Procedural Animation,Key-Frame Animation vs.
Procedural Animation, Introduction to Morphing,Three-Dimensional Morphing
Books:
Computer Graphics, R. K. Maurya, John Wiley.
Mathematical elements of Computer Graphics, David F. Rogers, J.Alan Adams, Tata
McGraw-Hill.
Proceduralelements of Computer Graphics, David F. Rogers, TataMcGraw-Hill.
Reference:
Computer Graphics, Donald Hearn and M. Pauline Baker, PrenticeHall of India.
Computer Graphics, Steven Harrington, McGraw-Hill.
Computer Graphics Principles and Practice, J.D. Foley, A. VanDam, S.K. Feiner and
R.L. Phillips, Addision Wesley.
Principles of Interactive Computer Graphics, Willaim M. Newman,Robert F. Sproull,
Tata McGraw-Hill.
Introduction to Computer Graphics, J.D. Foley, A. Van Dam, S.K.Feiner, J.F. Hughes
and R.L. Phillips, Addision Wesley.
Term Work:
7/25/2019 Bsc It Syllabus Mumbai University
32/81
7
Assignments: Should contain at least 6 assignments (one perunit) covering the
syllabus.
Practical(Suggested):
Should contain at least 10 programs developed using C++. SomeSample practical are listed below.
1. Write a program with menu option to input the linecoordinates from the user to generate a lineusing Bresenhams methodand DDA algorithm. Compare the lines for their values on theline.
2. Develop a program to generate a complete circle based ona.Bresenhams circle algorithm b. Midpoint Circle Algorithm
3. Implement the Bresenhams/DDA algorithm for drawing line(programmer is expected to shiftthe origin to the center of thescreen and divide the screen into required quadrants).
4. Write a program to implement a stretch band effect. (A userwill click on the screen and dragthe mouse/arrow keys over thescreen coordinates. The line should be updated like rubber-band andon the right-click gets fixed).
5. Write program to perform the following 2D and 3Dtransformations on the given input figure
a. Rotate through.b. Reflection
c. Scalingd. Translation.
6. Write a program to demonstrate shear transformation indifferent directions on a unit squaresituated at the origin.
7. Develop a program to clip a line using Cohen-Sutherland lineclipping algorithm between(x1,y1)(x2, y2) against a window (xmin,ymin)(xmax, ymax).
8. Write a program to implement polygon filling.9. Write aprogram to generate a 2D/3D fractal figures (Sierpinski triangle,Cantor set, tree etc).10. Write a program to draw Bezier andB-Spline Curves with interactive user inputs for control
polygon defining the shape of the curve.11. Write a program todemonstrate 2D animation such as clock simulation or rising sun12.Write a program to implement the bouncing ball inside a definedrectangular window.
CLASS: B. Sc (Information technology) Semester III
COURSE: Advanced SQL
Periods per week
1 Period is 50 minutes
Lecture 5
TW/Tutorial/Practical 3
Hours Marks
Evaluation System Theory Examination 3 100
TW/Tutorial /Practical -- 50
7/25/2019 Bsc It Syllabus Mumbai University
33/81
8
Unit-I Structured Query Language: Writing Basic SQL SelectStatements, Restricting and
Sorting Data, Single-Row Functions, Joins (Displaying Data fromMultiple Tables),
Aggregating Data using Group Functions, Subqueries, ManipulatingData, Creating and
Managing Tables, Including Constraints, Creating Views, CreatingOther Database
Objects(Sequences, Indexes and Synonyms)
Unit-II Advanced SQL: Controlling User Access, Using SEToperators, DateTime
Functions, Enhancements to Group by clause(cube, Rollup andGrouping),Advanced Subqueries (Multiple column subqueries,Subqueries in FROM clause,
Scalar and correlated subqueries), WITH Clause, Hierarchicalretrieval,
Unit-III PLSQL: Introduction, Overview and benefits of PL/SQL,Subprograms, types of
PL/SQL blocks, Simple Anonymous Block, Identifiers, types ofIdentifiers, Declarative
Section, variables, Scalar Data Types, The %TYPE Attribute, BindVariables,
Sequences in PL/SQL Expressions, Executable Statements, PL/SQLBlock Syntax,
Comment the Code, Deployment of SQL Functions in PL/SQL, ConvertData Types,
Nested Blocks, Operators. Interaction with the Oracle Server,Invoke SELECT
Statements in PL/SQL, SQL Cursor concept, Data Manipulation inthe Server using
PL/SQL, SQL Cursor Attributes to Obtain Feedback on DML, Saveand DiscardTransactions.
Unit-IV Control Structures: Conditional processing using IFStatements and CASE
Statements, Loop Statement, While Loop Statement, For LoopStatement, the
Continue Statement, Composite Data Types:PL/SQL Records, The%ROWTYPE
Attribute, Insert and Update with PL/SQL Records, INDEX BYTables, INDEX BY
Table Methods, Use INDEX BY Table of Records, Explicit Cursors,Declare the
Cursor, Open the Cursor, Fetch data from the Cursor, Close theCursor, Cursor FOR
loop, The %NOTFOUND and %ROWCOUNT Attributes, the FOR UPDATEClause
and WHERE CURRENT Clause, Exception Handling, Handle Exceptionswith
PL/SQL, Trap Predefined and non-predefined Oracle Server Errors,User-Defined
Exceptions, Propagate Exceptions, RAISE_APPLICATION_ERRORProcedure,
Unit-V Stored Procedures: Create a Modularized and LayeredSubprogram Design, the
PL/SQL Execution Environment, differences between AnonymousBlocks and
Subprograms, Create, Call, and Remove Stored Procedures,Implement Procedures
Parameters and Parameters Modes, View Procedure Information,Stored Functions
and Debugging Subprograms, Create, Call, and Remove a StoredFunction,
advantages of using Stored Functions, the steps to create astored function, Invoke
User-Defined Functions in SQL Statements, Restrictions whencalling Functions,
Control side effects when calling Functions, View FunctionsInformation, debug
Functions and Procedures, Packages,advantages of Packages,components of a
Package, Develop a Package, enable visibility of a PackagesComponents, Create
the Package Specification and Body using the SQL CREATEStatement and SQL
Developer, Invoke the Package Constructs, View the PL/SQL SourceCode using the
Data Dictionary, Deploying Packages, Overloading Subprograms inPL/SQL, Use the
STANDARD Package, Use Forward Declarations, Implement PackageFunctions in
SQL and Restrictions, Persistent State of Packages, PersistentState of a Package
Cursor, Control side effects of PL/SQL Subprograms, InvokePL/SQL Tables of
Records in Packages
7/25/2019 Bsc It Syllabus Mumbai University
34/81
9
Unit-VI Dynamic SQL: The Execution Flow of SQL, Declare CursorVariables, Dynamically
Executing a PL/SQL Block, Configure Native Dynamic SQL toCompile PL/SQL
Code, invoke DBMS_SQL Package, Implement DBMS_SQL with aParameterized
DML Statement, Dynamic SQL Functional Completeness, Triggers,the Trigger
Event Types and Body, Business Application Scenarios forImplementing Triggers,
Create DML Triggers using the CREATE TRIGGER Statement and SQLDeveloper,
Identify the Trigger Event Types, Body, and Firing (Timing),Statement Level
Triggers and Row Level Triggers, Create Instead of and DisabledTriggers, Manage,
Test and Remove Triggers. Creating Compound, DDL and EventDatabase Triggers,
Compound Trigger Structure for Tables and Views, CompoundTrigger to Resolve
the Mutating Table Error, Comparison of Database Triggers andStored Procedures,
Create Triggers on DDL Statements, Create Database-Event andSystem-Events
Triggers, System Privileges Required to Manage Triggers
Books:
Murachs Oracle SQL and PLSQLby Joel Murach, Murach andAssociates.
Oracle Database 11g PL/SQL Programming Workbook, ISBN:9780070702264, By: Michael
McLaughlin,John Harper, Tata McGraw-Hill
Reference:
Oracle PL/SQL Programming, Fifth Edition By Steven Feuerstein,Bill Pribyl
Oracle 11g: SQL Reference Oracle press
Oracle 11g: PL/SQL Reference Oracle Press.
Expert Oracle PL/SQL, By: Ron Hardman,Michael McLaughlin, TataMcGraw-Hill
Oracle database 11g: hands on SQL/PL SQL by Satish Asnani (PHI)EEE edition
Term Work:
Assignments: Should contain at least 6 assignments (one perunit) covering the
syllabus.
Practical (Suggested):
Should contain at the least 10 programs. Some sample practicalare listed below.
1. Practical 1: Select queries and joinsa. Select queries onsingle table using alias, where and order by clause.b. Selectqueries on single table using aggregate functions and group byclause.c. Querying data from multiple tables using all types ofjoins.
2. Practical 2: Subqueries, DML and DDLa. Querying single andmultiple tables using subqueries.
7/25/2019 Bsc It Syllabus Mumbai University
35/81
10
b. Manipulating data (Insert, update and delete)c. Creatingsimple tables and tables with constraints.
3. Practical 3: Creating database objects, Controll ing useraccess and using set operatorsa. Creating Views, Sequences, Indexesand synonyms.b. Granting and revoking privileges on user objects.c.Using set operators, date-time functions, roll up, cube andgrouping sets.
4. Practical 4: Working with advanced subqueries and WITHclausea. Multiple column subqueries, subqueries in from clause,b.Scalar subqueries and correlated subqueries,c. WITH Clause andhierarchical retrieval.
5. Practical 5: Basic PL/SQL, INDEX BY tables, PL/SQL Record andFOR loop.a. Creating anonymous PL/SQL blocks.b. Define, create, anduse INDEX BY tables and a PL/SQL record.c. Process a number of rowsfrom a table and populate another table with the results usinga
cursor FOR loop.
6. Practical 6: Cursors, Exceptions and procedures issuing DMLand query commands.
a. Cursors with parameters to process a number of rows frommultiple tables.b. Create exception handlers for specificsituations.c. Create procedures that issue DML and querycommands.
7. Practical 7: Functions and Stored Proceduresa. Creating andinvoking functions from SQL statements.b. Creating and invokingstored procedures.c. Re-create the source code for a procedure anda function.
8. Practical 8: Working with packagesa. Create packagespecifications and package bodies. Invoke the constructs in thepackages.b. Create a package containing an overloaded function.c.Create a one-time-only procedure within a package to populate aPL/SQL table.
9. Practical 9: Working with Large Objects and triggersa. Createa table with both BLOB and CLOB columns. Use the DBMS_LOB packageto populate
the table and manipulate the data.b. Create statement and rowtriggers.c. Create procedures that will be invoked from thetriggers.
10. Practical 10: Working with INSTEAD OF triggers, businessrules and recompiling procedures,functions, packages and views.
a. Create instead of triggers for views.b. Implement a number ofbusiness rules. Create triggers for those rules that should be
implemented as triggers. The triggers must execute proceduresthat that are placed in apackage.
c. Use the DEPTREE_FILL procedure and the IDEPTREE view toinvestigate dependencies inyour schema. Recompile invalidprocedures, functions, packages, and views.
7/25/2019 Bsc It Syllabus Mumbai University
36/81
11
CLASS: B. Sc (Information technology) Semester III
COURSE: Object Oriented Programming with C++
Periods per week
1 Period is 50 minutes
Lecture 5
TW/Tutorial/Practical 3
Hours Marks
Evaluation System Theory Examination 3 100
TW/Tutorial /Practical -- 50
Unit-I Introduction to OOPs:Need object oriented programming,comparison of procedural
and object oriented approach, characteristics of OOPs object ,classes ,
polymorphism, inheritance, reusability, data hiding andabstraction, applications of
OOPs
Unit-II Classes and Objects: Class declaration, constructors,constructor initialization lists,
access functions, private member functions, the copyconstructor, the class destructor
,constant objects, structures, pointers to objects, static datamembers, static function
members
Unit-III Operator Overloading: overloading the assignmentoperator, the this pointer,
overloading arithmetic operators, overloading the arithmeticassignment, operators,
overloading the relational operators ,overloading the streamoperators, conversion
operators ,overloading the increment and decrement operators,overloading the
subscript operator
Unit-IV Composition and Inheritance:inheritance, protected classmembers , overriding and
dominating inherited members, private access verses protectedaccess, virtual
functions and polymorphism, virtual destructors, abstract baseclasses
File Handling: Classes for file stream operations, opening andclosing a file, detecting
end of file, file modes, file pointers and their manipulations,sequential input and
output operations, random access, file operations errorhandling, command line
argument
Unit-V Strings and Streams:the string class interface, theconstructors and destructor , the
copy constructor, the assignment operator, the addition operator, an append
operator, access functions , the comparison operators, streamoperators,
7/25/2019 Bsc It Syllabus Mumbai University
37/81
12
stream classes, the ios class, ios format flags, ios state ,variables ,the istream and
ostream classes, unformatted input functions , unformattedoutput functions, stream
manipulators.
Unit-VI Templates and Iterators: function templates, classtemplates, container classes,
subclass templates, passing template classes to templateparameters, iterator classes
Libraries: the standard C++ library, proprietary libraries,contents of the standard cheaders, string streams, file processing,the standard template library
Books:
Schaums Outline of Theory and Problems of Programming with C++John R. Hubbard,
TataMcGraw-Hill
Object Oriented Programming with C++,E.Balagurusamy,FourthEdition, TataMcGraw-Hill
Object Oriented Programming with C++,by P. Sarang 2nd
Edition,(PHI) EEE edition
Reference:
C++ programming, 3rd
Edition, Bjarne Stroustrup
Mastering C++, 2nd
Edition, Venugopalan, TataMcgrawHill
C++ Programming, , Robert Lafore,
C++ for Beginners, P. M. Harwani, X-Team Series,
Term Work:
Assignments : Should contain at least 6 assignments (one perunit) covering the
syllabus.
Practical (Suggested):
Should contain at the least 10 programs. Some sample practicalare listed below.
1 Implement the following
a. Design an employee class for reading and displaying theemployee information, the
getInfo() and displayInfo() methods will be used repectively.Where getInfo() will be private
method.
b. Design the class student containing getData() anddisplayData() as two of its methods
which will be used for reading and displaying the studentinformation respectively.Where
getData() will be private method.
c. Design the class Demo which will contain the followingmethods: readNo() ,factorial() for
calculating the factorial of a number, reverseNo() will reversethe given number,
isPalindrome() will check the given number is palindrome,isArmstrong() which will calculate
7/25/2019 Bsc It Syllabus Mumbai University
38/81
13
the given number is armStrong or not.Where readNo() will beprivate method.
2 Implement the following
a. Write a friend function for adding the two complex numbers,using a single class.
b. Write a friend function for adding the two differentdistances and display its sum, using two
classes.
c. Write a friend function for adding the two matrix from twodifferent classes and display its
sum.
3 Implement the following
a. Design a class Complex for adding the two complex numbers andalso show the use of
constructor.
b. Design a class Geometry containing the methods area() andvolume() and also overload the
area() function .
c. Design a class StaticDemo to show the implementation ofstatic variable and static function.
4 Implement the following
a. Overload the operator unary(-) for demonstrating operatoroverloading.
b. Overload the operator + for adding the timings of two clocks,And also pass objects as an
argument.
c. Overload the + for concatenating the two strings. For e.g c +++ = c++
5 Implement the following
a. Design a class for single level inheritance using public andprivate type derivation.
b. Design a class for multiple inheritance.
c. Implement the hierarchical inheritance.
6. Implement the following
a. Implement the concept of method overriding.
b. Show the use of virtual function
c. Show the implementation of abstract class.
7. Implement the following
a. String operations for string length , stringconcatenation
b. String operations for string reverse, string comparison,
7/25/2019 Bsc It Syllabus Mumbai University
39/81
14
c. Console formatting functions.
8. Implement the following:
a. Show the implementation of exception handling
b. Show the implementation for exception handling forstrings
c. Show the implementation of exception handling for using thepointers.
9. Show the implementation
a. Design a class FileDemo open a file in read mode and displaythe total number of words
and lines in the file.
b. Design a class to handle multiple files and fileoperations
c. Design a editor for appending and editing the files
10. Show the implementation for the following
a. Show the implementation of template class library for swapfunction.
b. Design the template class library for sorting ascending todescending and vice-versa
c. Design the template class library for concatenating twostrings
CLASS: B. Sc (Information techno logy) Semester III
COURSE: Modern Operating Systems
Periods per week
1 Period is 50 minutes
Lecture 5
TW/Tutorial/Practical 3
Hours Marks
Evaluation System Theory Examination 3 100
TW/Tutorial /Practical -- 50
7/25/2019 Bsc It Syllabus Mumbai University
40/81
15
Unit-I Introduction to Operating Systems: OS and ComputerSystem, System
performance, Classes of OS, Batch processing, time-sharing,multiprocessing, real
time, distributed and modern operating systems, Desktop Systems,Handheld
Systems, Clustered Systems, Assemblers, Compilers andInterpreters, Linkers.
Unit-II Operating-System Structures: Operating-System Services,User Operating-System
Interface, System Calls, Types of System Calls, System Programs,Operating-System Design and Implementation, Operating-SystemStructure, Virtual Machines,
Operating-System Generation, System Boot.
Unit-III Processes and Process Synchronization: Process Concept,Process Scheduling,
Scheduling Criteria, Scheduling Algorithms, Operations onProcesses, Interprocess
Communication, Multithreading Models, Threading Issues, ThreadScheduling,
Communication in ClientServer Systems, The Critical-SectionProblem, Petersons
Solution, Semaphores.
Unit-IV Memory Management: Memory management without swapping orpaging;
Swapping, Virtual Memory, Page replacement algorithms, Modelingpaging
algorithms, Design issues for paging systems, segmentation
Unit-V File-System Interface and Implementation: File Concept,File-System Mounting,
Free-SpaceManagement, File Sharing, NFS. Mass-Storage Structure:Disk
Structure, Disk Management, Swap-Space Management, RAIDStructure, Stable-
Storage Implementation. Deadlocks , Deadlock detection andrecovery, avoidance
and prevention
Unit-VI I/O Systems: Application I/O Interface, Transforming I/ORequests to HardwareOperations, STREAMS, Performance.
Protection and Security: Principles of Protection, Domain ofProtection, Access
Matrix, Access Control, Capability-Based Systems, Language-BasedProtection, The
Security Problem, System and Network Threats, ImplementingSecurity Defenses.
Books:
Modern Operating Systems, Andrew Tanenbaum,
Operating Systems, 2nd
Edition, K. A.Sumitra Devi and N.P Banashree, SPD
Operating System Concepts, 8thEdition, Abraham Silberschatz,Peter B.Galvin, Greg Gagne,
Wiley publication
Reference:
Operating Systems- A concept based approach, 2nd
Edition, D.M. Dhamdhere, McGrawHill
publications
7/25/2019 Bsc It Syllabus Mumbai University
41/81
16
Operating Systems, 3rd
Edition , Godbole and Kahate, McGrawHill publications.
Term Work:
Assignment: Should contain at least 6 assignments (one per unit)covering the
Syllabus.
Tutorial:At the leastthree tutorials based on above syllabusmust be conducted.
Case Studies (Suggested):
a) MS-DOSb) Windows NTc) Windows 2008 Serverd) Windows 7e)Unixf) Linuxg) OS/2h) MAC OSi) Symbianj) Chromek) Android
7/25/2019 Bsc It Syllabus Mumbai University
42/81
17
CLASS: B. Sc (Information techno logy) Semester IV
COURSE: Software Engineering
Periods per week
1 Period is 50 minutes
Lecture 5
TW/Tutorial/Practical 3
Hours Marks
Evaluation System Theory Examination 3 100
TW/Tutorial /Practical -- 50
Unit-I An Int roduct ion: To Software, Software Engineering,Software Process, Software
Engineering Methods; CASE Tools, Attributes of good software.Socio-technical
system : Essential characteristics of socio technical systems,Emergent System
Properties, Systems Engineering, Components of system such asorganization,
people and computers, Dealing Legacy Systems. Critical system:Types of critical
system, A simple safety critical system, Dependability of asystem, Availability and
Reliability, Safety and Security of Software systems
Unit-II Software processes : Fundamental activities of softwareprocess, Different softwareprocess models, Process Iteration andActivities, The Rational Unified Process,
CASE in detail. Project Management : Software ProjectManagement, Management
activities, Project Planning, Project Scheduling, RiskManagement. Software
Requirements: Functional and Non-functional requirements, UserRequirements,
System Requirements, Interface Specification, Documentation ofthe software
requirements
Unit-III Requirements Engineering Processes: Feasibility study,Requirements elicitation
and anlaysis, Requirements Validations, Requirements Management.System
Models: Models and its types, Context Models, BehaviouralModels, Data Models,
Object Models, Structured Methods.
Architectural Design : Architectural Design Decisions, SystemOrganisation,
Modular Decomposition Styles, Control Styles, ReferenceArchitectures
Unit-IV Appl ication Architectures : Data Processing Systems,Transaction Processing
Systems, Event Processing Systems, Language ProcessingSystems
Object Oriented Design : Objects and Object Classes, An objectOriented Design
7/25/2019 Bsc It Syllabus Mumbai University
43/81
18
Process, Design Evolution
User Interface Design: Need of UI design, Design issues, The UIdesign Process,
User analysis, User Interface Prototyping, InterfaceEvaluation
Rapid Software Development : Agile Methods, Extreme Programming,Rapid
Application Development, Software Prototyping
Unit-V Component based Software Engineering : Components andComponent models,
The CBSE Process, Component Composition. Verification andValidation :Planning Verification and Validation, SoftwareInspections, Automated Static
Analysis, Verification and Formal Methods. Software Testing :System Testing,
Component Testing, Test Case Design, Test Automation. SoftwareCost
Estimation : Software Productivity, Estimation Techniques,Algorithmic Cost
Modeling, Project Duration and Staffing
Unit-VI Quality Management : Process and Product Quality,Quality assurance and
Standards, Quality Planning, Quality Control, SoftwareMeasurement and Metrics
Process Improvement : Process and product quality, ProcessClassification,
Process Measurement, Process Analysis and Modeling, ProcessChange, The CMMI
Process Improvement Framework. Security Engineering : SecurityConcepts,
Security Risk Management, Design for Security, SystemSurvivability. ServiceOriented Software Engineering : Services asreusable components, Service
Engineering, Software Development with Services
Books:
Software Engineering, Ian Somerville, 8thedition, PearsonEducation.
Software Engineering, Pankaj Jalote, Narosa Publication
Reference:
Software Design, D.Budgen, 2nd edition, Pearson education.
Software engineering, A practitioners approach, Roger Pressman,Tata McGraw-Hill
Software Engineering by KL James, PHI(2009) EEE edition
Software Engineering principles and practiceby WS Jawadekar TataMcGraw-Hill
Term Work:
Assignments: Should contain at least 6 assignments (one perunit) covering the
Syllabus.
Tutorial:At leastthree tutorials based on above syllabus must beconducted.
7/25/2019 Bsc It Syllabus Mumbai University
44/81
19
Case Studies (Suggested)
1. Project Initiation and scheduling.
2. Analyzing a system and specifying the requirements
a. Structured Approach
b. Object oriented Approach
3. Project Cost Estimation
4. Designing the database design
5. Designing the User interface design
6. Use of testing methodologies
7. Cost Estimation Techniques
8. Cost benefit Analysis
CLASS: B. Sc (Information techno logy) Semester IV
COURSE: Multimedia
Periods per week
1 Period is 50 minutes
Lecture 5
TW/Tutorial/Practical 3
Hours Marks
Evaluation System Theory Examination 3 100
TW/Tutorial /Practical -- 50
Unit-I Introduction: What is multimedia? Defining the scope ofmultimedia. Applications of
multimedia, hardware and software requirements, multimediadatabase.
Unit-II Digital representation: Introduction, Analogrepresentation, waves, digital
representation, need for digital representation, A to Dconversion, D to A conversion,
relation between sampling rate and bit depth, Quantizationerror, Fourier
representation, pulse modulation. Importance and drawback ofdigital representation.
Unit-III Text and Image: Introduction, Types of text, Font,insertion, compression,File
formats. Types of images, colour models, Basic steps for imageprocessing,
principle and working of scanner and digital camera, Gamma andgamma correction.
Unit-IV Audio and Video technology: Fundamental characteristicsof sound, psycho-
7/25/2019 Bsc It Syllabus Mumbai University
45/81
20
acoustics, Raster scanning principles, sensors for TV cameras,color fundamentals,
additive and subtractive color mixing, Liquid crystal display(LCD), Plasma Display
Panel (PDP), file formats
Unit-V Compression and cod ing: What is compression? Need forcompression, Types of
compression- basic compression techniques-run length, Huffmanscoding, JPEG,
zip coding. Overview of Image and Video compressiontechniques.
Unit-VI Multimedia presentation and authoring: Overview,multimedia authoring
metaphor, multimedia production, presentation and automaticauthoring, Design
paradigms and user interface, overview of tools like adobepremier, director, flash
and dreamweaver. Barriers to wide spread use.
Books:
Principles of Multimediaby Ranjan Parekh. Tata McGraw-Hill
Reference:
Multimedia Systems Designby Prabhat K. Andleigh and KiranThakrar-PHI publication
Multimedia systemsby John F. Koegal Buford-PearsonEducation.
Fundamentals of multimedia by Ze-Nian Li and MS Drew. PHI EEEedition.
Term Work:
Assignments: Should contain at least 6 assignments (one perunit) covering the
Syllabus.
Tutorial:At leastthree tutorials based on above syllabus must beconducted.
Mini Project:Develop a multimedia application
7/25/2019 Bsc It Syllabus Mumbai University
46/81
21
CLASS: B. Sc (Information techno logy) Semester IV
COURSE: Java and Data Structu res
Periods per week
1 Period is 50 minutes
Lecture 5
TW/Tutorial/Practical 3
Hours Marks
Evaluation System Theory Examination 3 100
TW/Tutorial /Practical -- 50
Unit-I Core Java:Features of Java, JVM, Data Types, Variables,and Arrays, Operators,
Control Statements, type-casting, Classes, Objects and Methods,Constructor,
method overriding, finalize methods.
Unit-II Derived concepts: Inheritance, Packages and Interfaces,Exception Handling,
String handling, Multithreaded Programming
Unit-III The Java I/O Classes and Interfaces:File, Directories,Using FilenameFilter, The
listFiles( ) Alternative, Creating Directories, The StreamClasses, The Byte Streams,
InputStream, OutputStream, FileInputStream,FileOutputStream,
ByteArrayInputStream, ByteArrayOutputStream, Filtered ByteStreams, Buffered
Byte Streams, SequenceInputStream, PrintStream,RandomAccessFile, The
Character Streams, Reader, Writer, FileReader , FileWriter,CharArrayReader,
CharArrayWriter, BufferedReader, BufferedWriter, PushbackReader,PrintWriter
Unit-IV Data Structures: Complexity and analysis of algorithmsalgorithm, time and space
complexity, asymptotic notations, Types of data structures,Arrays - Properties of
Arrays, Duplicating an Array, sequential search algorithm,binary search algorithm,Stacks- Stack Operations, indexedImplementation, Linked Implementation, ,
Applications - recursion, Queue - Queue Operations, indexedImplementation,
Applications, Circular Queue insertion , deletion
Unit-V Linked Lists representation of linked list, traversing,searching, insertion, deletion
and doubly linked list.
Hash table methods hashing functions , collision-resolutiontechniques
7/25/2019 Bsc It Syllabus Mumbai University
47/81
22
Trees- Binary Trees, traversing binary tree, traversingalgorithm using stacks,
header nodes, threads, binary search trees ( insertion anddeletion), AVL trees , B
trees
Unit-VI Heaps insertion and deletion
Sorting selection, bubble, merge, tree , radix , insertion
Graphs graph theory, sequential representation, adjacencymatrix, path matrix,
Warshalls algorithm, linked representations, operations,traversing.
Books:
Core Java for Beginners, Sharanam Shah and V Shah, The X TeamSPD
Java 2 Complete Reference, 5thEdition , Osborne ,Tata-McGrawhill
Data Structures,S Lipschutz, Tata-McGrawhill
Reference:
An introduction to data structures with applications, secondedition, Jean-Paul Tremblay, P Sorenson, Tata-
McGrawhill
Data Structures with Java, 2nd
edition, J Hubbard, Tata-McGrawhill
Term Work:
Assignments: Should contain at least 6 assignments (one perunit) covering the
Syllabus.
Practical List:
1 Implement the following
a. Design a java program for type casting different types ofvariables.
b. Design a Calculator class in java, and implement all themethods required by calculator
operations.
c. Design a java class for method overloading and methodoverriding.
2 Implement the following
a. Design a java program for different types of inheritance.
7/25/2019 Bsc It Syllabus Mumbai University
48/81
23
b. Design a java class for the use of interface.
c. Design a java class performing string operations.
3 Implement the following
a. Design a class in java to add two complex numbers usingconstructors.
b. Design a java class for performing all the matrix operationsi.e addition, multiplication,transpose etc.
c. Design a java class for implementing the packages.
4 Implement the following
a. Design a java class for implementing the concept of threadingand multithreading.
b. Design a java class for performing all thefile-operations.
c. Design a java class for operating the random access filesusing
5 Implement the following
a. Design a class for sorting the names or numbers in ascendingand descending order.
b. Design a java class for implementing the operations ofstack.
6. Implement the following
a. Design a class in java for implementing the operations ofqueue.( insert, delete, display,
exit)
b. Design a class in java for implementing the operations ofcircular queue.
7. Implement the following
a. Design a class to implement the operations of singlylink-list. ( insertion , deletion, sorting,
display)
b. Design a class to implement the operations of doubly-linkedlist.
8. Implement the following
a. Implement the concept of hashing technique and also show itscollision avoidance.
b. Design a class to create a tree and also implement the binarysearch tree.
9. Show the implementation
7/25/2019 Bsc It Syllabus Mumbai University
49/81
24
a. Design a class in java for creating the heap and also showheap sort for it.
b. Design a class in java for implementing selection andinsertion sort.
10. Show the implementation for the following
a. Design a class in java for bubble and merge sort.
b. Design a class in java for implementing the graph
CLASS: B. Sc (Information techno logy) Semester IV
COURSE: Quantitative Techniques
Periods per week
1 Period is 50 minutes
Lecture 5
TW/Tutorial/Practical 3
Hours Marks
Evaluation System Theory Examination 3 100
TW/Tutorial /Practical -- 50
Unit-I Errors, Solutions of Algebraic and TranscendentalEquations using -
Bisection Method, the Method of False Position, Newton-RaphsonMethod.
Interpolation: Interpolation: - Forward Difference, BackwardDifference,
Newtons Forward Difference Interpolation, Newtons BackwardDifference
Interpolation, Lagranges Interpolation.
Unit-II Solution of simultaneous algebraic equations (linear)using iterative
methods: Gauss-Jordan Method, Gauss-Seidel Method. Numerical
Integration:Trapezoidal Rule, Simpsons 1/3 rd and 3/8 th rules.Numerical
solution of 1stand 2ndorder differential equations: - Taylorseries, Eulers
Method, Modified Eulers Method, Runge-Kutta Method for 1stand2ndOrder
Differential Equations.
7/25/2019 Bsc It Syllabus Mumbai University
50/81
25
Unit-III Random variables: Discrete and Continuous randomvariables, Probability
density function, Probability distribution of random variables,Expected
value, Variance.
Moments and moment generating functions: Relation betweenRaw
moments and Central moments.
Distributions:Binomial, Poisson, Normal, exponential, uniformdistributions
for detailed study, Central Limit theorem (statement only) andproblemsbased on this theorem.
Unit-IV Fitting of curves: Least square method, Fitting thestraight line and
parabolic curve, Correlation, Covariance, Karl Pearsonscoefficient and
Spearman s Rank, correlation coefficient, Regressioncoefficients and lines
of regression.
Unit-V Sampling distribution:Test of Hypothesis, Level ofSignificance, Critical Region,
One Tailed and Two Tailed Test, Interval Estimation ofPopulation Parameters, Testof Significance for large Samples andsmall Samples, Students t Distribution and its
properties.
Unit-VI Chi-Square Distribution and its properties, Test of theGoodness of Fit and
Independence of Attributes, Contingency Table, YatesCorrection
Mathematical Programming: Linear optimization problem,Formulation and
Graphical solution, Basic solution and Feasible solution, PrimalSimplex Method.
Books:
Introductory Methods of Numerical Methods, Vol-2, S.S.Shastri,PHIFundamentals of Mathematical Statistics,S.C.Gupta,V.K.Kapoor
Reference: Elements of Applied Mathematics, Volume 1 and 2,P.N.Wartikar and J.N.Wartikar, A. V. Griha,PuneEngineeringMathematics,Vol-2, S.S.Shastri, PHIApplied Numerical Methods forEngineersusing SCILAB and C, Robert J.Schilling and Sandra
L.Harris, , Thomson Brooks/Cole
Term Work:
Assignments: Should contain at least 6 assignments (one perunit) covering the
Syllabus.
7/25/2019 Bsc It Syllabus Mumbai University
51/81
26
Practical List to be performed in Scilab:
1. Practical 1: Solution of algebraic and transcendentalequations:a. Program to solve algebraic and transcendental equationby bisection method.b. Program to solve algebraic andtranscendental equation by false position method.c. Program tosolve algebraic and transcendental equation by Newton Raphsonmethod.
2. Practical 2: Interpolationa. Program for Newtons forwardinterpolation.b. Program for Newtons backward interpolation.c.Program for Lagranges interpolation.
3. Practical 3: Solving linear system of equations by iterativemethods:a. Program for solving linear system of equations usingGauss Jordan methods.b. Program for solving linear system ofequations using Gauss Seidel methods.
4. Practical 4: Numerical Integrationa. Program for numericalintegration using Trapezoidal rule.b. Program for numericalintegration using Simpsons 1/3
rdrule.
c. Program for numerical integration using Simpsons3/8thrule.
5. Practical 5: Solution of differential equations:a. Program tosolve differential equation using Eulers methodb. Program to solvedifferential equation using modified Eulers method.
c. Program to solve differential equation using Runge-kutta2ndorder and 4thorder methods.6. Practical 6: Random numbergeneration and dist ributions
a. Program for random number generation using varioustechniques.b. Program for fitting of Binomial Distribution.c.Program for fitting of Poisson Distribution.d. Program for fittingof Negative Binomial Distribution.
7. Practical 7: Moments, Correlation and Regressiona.Computation of raw and central moments, and measures of skewnessand kurtosis.b. Computation of correlation coefficient and Fittingof lines of Regression ( Raw and Frequency
data )c. Spearmans rank correlatio
![Bsc It Syllabus Mumbai University - [PDF Document] (2024)](data:image/png;base64,iVBORw0KGgoAAAANSUhEUgAAAAEAAAABCAQAAAC1HAwCAAAAC0lEQVR42mP8/h8AAvMB+NzmkbcAAAAASUVORK5CYII=)