rayat shikshan sanstha’s karmaveer bhaurao patil …...b. write a program using pointers to...

Rayat Shikshan Sanstha’s

Karmaveer Bhaurao Patil College Vashi, Navi MumbaiAutonomous College

[University of Mumbai]

Syllabus for Approval

Sr.Heading ParticularsNo.

1 Title of CourseF.Y.B.Sc. InformationTechnology

2Eligibility for

12th MathsAdmission

3 Passing Marks 40%

4Ordinances/Regulations(if any)

5 No. of Years/Semesters One year/Two semester

6 Level U.G.

7 Pattern Semester

8 Status Revised

9To be implemented

2018-2019from Academic year

AC- 2.23 01/09/ 2018

Item No-

Rayat Shikshan Sanstha’sKARMAVEER BHAURAO PATIL COLLEGE, VASHI.

NAVI MUMBAI(AUTONOMOUS COLLEGE)

Sector-15- A, Vashi, Navi Mumbai - 400 703

Syllabus for F.Y.B.Sc. Information Technology

Program: B.Sc. Information Technology

Course: F.Y.B.Sc. Information Technology

(Choice Based Credit, Grading and Semester System with effect from the academic year 2018‐2019)

Preamble of the Syllabus:

The B.Sc. Information Technology programme was started in 2001 with an aim to make the

students employable and impart industry oriented training. The main objectives of the

course are:

To think analytically, creatively and critically in developing robust, extensible and highly

maintainable technological solutions to simple and complex problems.

To apply their knowledge and skills to be employed and excel in IT professional careers

and/or to continue their education in IT and/or related post graduate programmes.

To be capable of managing complex IT projects with consideration of the human, financial

and environmental factors.

To work effectively as a part of a team to achieve a common stated goal.

To adhere to the highest standards of ethics, including relevant industry and organizational

codes of conduct.

To communicate effectively with a range of audiences both technical and non-technical.

To develop an aptitude to engage in continuing professional development. The new

syllabus is aimed to achieve the objectives. The syllabus spanning three years covers the

industry relevant courses. The students will be ready for the jobs available in different fields

like:

Software Development (Programming)

Website Development

Mobile app development

Embedded Systems Development & Programming

Software Testing

Networking

Database Administration

System Administration

Cyber Law Consultant

GIS (Geographic Information Systems)

IT Service Desk

Security

And many others

The students will also be trained in communication skills and green computing

Syllabus for F.Y.B.Sc. Information Technology

Objectives of the Course:

• To acquaint students with the fundamental of computer hardware and software in

information technology

• To develop analytical skills and critical thinking through application of theory knowledge

into practical course

• To construct and apply knowledge of programming, and appreciate the relationship

between several programming languages and other disciplines

• To enable students to understand IT and its industrial and social context

Course Outcome:

By the end of the course, a student should develop the ability:

• To understand, coherently and effectively about various basic components of computers.

• To develop the understanding and interest in the field of IT

• To develop basic skills in practical of Information Technology and its industrial

applications.

Scheme of examination for Each Semester:

Continuous Internal Evaluation: 40 Marks (Common Test-20 Marks & 20 Marks for-Assignment, Projects, Group discussion, Open book test, online test etc.)Semester End Examination: 60 Marks will be as follows -

Theory: The Semester End Examination for theory course work will be conducted asper the following scheme.Each theory paper shall be of two and half hour duration.

I.All questions are compulsory and will have internal options.Q – I From Unit – I (having internal options.) 10 MQ – II From Unit – II (having internal options.) 10 MQ – III From Unit – III (having internal options.) 10 MQ – IV From Unit – IV (having internal options.) 10 MQ-V From Unit – V (having internal options.) 10 MQ-VI From Unit – VI (having internal options.) 10 M

PracticalThe Semester End Examination for practical course work will be

II. conducted as per the following scheme.

Sr.Marks%

No. Particulars of Semester End Practical Examination

1 Laboratory Work 40

2 Journal 05

3 Viva 05

TOTAL 50

Semester – I

Course Code Course Type Course Title CreditsUGIT101 Core Subject Imperative Programming 2UGIT102 Core Subject Digital Electronics 2UGIT103 Core Subject Operating Systems 2

UGIT104 Core Subject Discrete Mathematics 2Ability Enhancement Skill

UGIT105 Course Communication Skills 2UGIT1P1 Core Subject Practical Imperative Programming 2

PracticalUGIT1P2 Core Subject Practical Digital Electronics Practical 2UGIT1P3 Core Subject Practical Operating Systems Practical 2UGIT1P4 Core Subject Practical Discrete Mathematics Practical 2

Ability Enhancement SkillUGIT1P5 Course Practical Communication Skills Practical 2

Total Credits 20

Semester – IICourse Code Course Type Course Title CreditsUGIT201 Core Subject Object oriented Programming 2UGIT202 Core Subject Microprocessor Architecture 2UGIT203 Core Subject Web Programming 2UGIT204 Core Subject Numerical and Statistical 2

MethodsUGIT205 Core Subject Course Green Computing 2UGIT2P1 Core Subject Practical Object Oriented Programming 2

PracticalUGIT2P2 Core Subject Practical Microprocessor Architecture 2

PracticalUGIT2P3 Core Subject Practical Web Programming Practical 2UGIT2P4 Core Subject Practical Numerical and Statistical 2

Methods PracticalUGIT2P5 Ability Enhancement Skill Green Computing Project 2

Course PracticalTotal Credits 20

Semester – I

B. Sc (Information Technology) Semester – ICourse Name: Imperative Programming Course Code: UGIT101Periods per week (1 Period is 50 minutes) 5Credits 2

Hours MarksEvaluation System Theory Examination 2 60

Internal -- 40

Unit Details Lectures

I Introduction: Types of Programming languages, , features andApplication. program development cycle, Programming modelAlgorithm and flowchart symbols, desirable program characteristics.

Structure of C program: Header and body, use of comments.Compilation and Execution of a Program.

10

Fundamentals:Character Set, identifiers and keywords, data types, constants,declaring variables, scope of the variables according to block,expressions, statements, symbolic constant, #define and #include

II Operators and Expressions:Arithmetic operators, unary operators, relational and logical operators,Assignment operators, the conditional operator, comma operators,operator’s precedence. Bitwise operator.

10Data Input and output:Single character input and output, entering input data, scanf function,Character I/O format: getch(), getchar(), gets(), putchar(), puts().

III Conditional Statements and Loops: Decision Making Within AProgram: (i) Branching: If Statement, If-Else Statement, SwitchStatement (ii) Looping: while loop, do. While, for loop (iii) Jump

10statements: break, continue and goto. Nested Loops, Infinite Loops,

Program structure:Storage classes, automatic, register, external, static.

Function:Overview, defining a function, accessing a function, functionprototypes, specifying argument data types, passing arguments to a

IV function: call by reference; call by value, block structure, recursive10functions. Directives and Macros

String:String ,declaring and initializing string, string functions, libraryfunctions

Array:10V Definition, processing, passing arrays to functions, 1D array,

Multidimensional array.Pointers:Fundamentals, declarations, Pointers Address Operators, Pointer TypeDeclaration, Pointer Assignment, Pointer Initialization, PointerArithmetic, Functions and Pointers, Arrays AndPointers,

Structure & Unions:10VI Structure Variables, Initialization, Structure Assignment,

Nested Structure, Structures and Functions, Structures andArrays: Arrays of Structures, Structures Containing Arrays,Unions, Structures and pointers

Books and References:

Sr. No. Title Author/s Publisher Edition Year1. Programming with C Byron Gottfried Tata 2nd 1996

McGraw-Hill

2 Programming in ANSI C BalagurUGamy TMH 3rd

3. “C” Programming” Brian W. Kernighan & PHI 2ndDenis M. Ritchie.

4. Let UG C Yashwant P. Kanetkar, BPB publication

5. C for beginners MadhUGudan Mothe X-Team Series 1 st 2008

6. 21st

Century C Ben Klemens OReilly 1st 2012

B. Sc (Information Technology) Semester – ICourse Name: Imperative Programming Practical Course Code: UGIT1P1Periods per week (1 Period is 50 minutes) 3Credits 2

Hours MarksEvaluation System Practical Examination 2½ 50

Internal -- --

List of Practical: (Can be done in any imperative language)1. Basic Programs:a. Write a program to display the message HELLO WORLD.b. Write a program to declare some variables of type int, float and double. Assign

some values to these variables and display these values.c. Write a program to find the addition, subtraction, multiplication and division of

two numbers.

2. Programs on variables:a. Write a program to swap two numbers without using third variable.b. Write a program to find the area of rectangle, square and circle.c. Write a program to find the volume of a cube, sphere, and cylinder.

3. Conditional statements and loops(basic)a. Write a program to enter a number from the user and display the month name. If

number >13 then display invalid input using switch case.b. Write a program to check whether the number is even or odd.c. Write a program to check whether the number is positive, negative or zero.d. Write a program to find the factorial of a number.e. Write a program to check whether the entered number is prime or not.f. Write a program to find the largest of three numbers.

4. Conditional statements and loops(advanced)a. Write a program to find the sum of squares of digits of a number.b. Write a program to reverse the digits of an integer.c. Write a program to find the sum of numbers from 1 to 100.d. Write a programs to print the Fibonacci series.e. Write a program to find the reverse of a number.f. Write a program to find whether a given number is palindrome or not.g. Write a program that solve the quadratic equation

h. Write a program to check whether the entered number is Armstrong or not.i. Write a program to count the digit in a number

5. Programs on patterns:a. Programs on different patterns.

6. Functions:a. Programs on Functions.

7. Recursive functionsa. Write a program to find the factorial of a number using recursive function.b. Write a program to find the sum of natural number using recursive function.

8. Arraysa. Write a program to find the largest value that is stored in the array.b. Write a program using pointers to compute the sum of all elements stored in an

array.c. Write a program to arrange the ‘n’ numbers stored in the array in ascending and

descending order.d. Write a program that performs addition and subtraction of matrices.e. Write a program that performs multiplication of matrices.

9. Pointersa. Write a program to demonstrate the use of pointers.b. Write a program to perform addition and subtraction of two pointer variables.

10. Structures and Unionsa. Programs on structures.b. Programs on unions.

B. Sc (Information Technology) Semester ICourse Name: Digital Electronics Course Code: UGIT102Periods per week (1 Period is 50 minutes) 5Credits 2


Internal -- 40

Unit Details LecturesNumber System:Analog System, digital system, numbering system, binary numbersystem, octal number system, hexadecimal number system, conversionfrom one number system to another, floating point numbers, weightedcodes binary coded decimal, non-weighted codes Excess – 3 code,Graycode, Alphanumeric codes – ASCII Code, EBCDIC, Hollerith

ICode,

10Error detection and correction, Code conversion.

Binary Arithmetic:Binary addition, Binary subtraction, Negative number representation,Subtraction using 1’s complement and 2’s complement, Binarymultiplication and division, Arithmetic in octal number system,Arithmetic in hexadecimal number system, BCD and Excess – 3arithmeticBoolean Algebra and Logic Gates:IC Technology, Levels of IC Complexity, Introduction to Logic, Logic(AND OR NOT), Boolean theorems, BooleanLaws, De Morgan’s Theorem, Perfect Induction, Reduction of Logicexpression using Boolean Algebra, Deriving Boolean expression fromgiven circuit, exclusive OR and Exclusive NOR gates, Universal Logicgates, Implementation of other gates using universal gates, Input

IIbubbled logic, Assertion level.

10Minterm, Maxterm and Karnaugh Maps:Introduction, minterms and sum of minterm form, maxterm andProductof maxterm form, Reduction technique using Karnaugh maps –2/3/4/5/6 variable K-maps, Grouping of variables in K-maps, K-mapsfor product of sum form, minimize Boolean expression using K-mapand obtain K-map from Boolean expression, Quine Mc CluskeyMethod.

Combinational Logic Circuits:Introduction, Multi-input, multi-output Combinational circuits, Code

IIIconverters design and implementations

10Arithmetic Circuits:Introduction, Adder, BCD Adder, Excess – 3 Adder, BinarySubtractor, BCD Subtractor, Multiplier, Comparator.

Multiplexer, Demultiplexers, ALU, Encoder and Decoder:Introduction, Multiplexer, Demultiplexers, Decoder, ALU, Encoders.

IV Sequential Circuits: Flip-Flop: 10

Introduction, Terminologies used, S-R flip-flop, D flip-fop, JK flip-flop, Race-around condition, Master – slave JK flip-flop, T flip-flop,

conversion from one type of flip-flop to another.Counters:Introduction, Asynchronous counter, Terms related to counters, IC

V7493 (4-bit binary counter), Synchronous counter, Bushing, Type T

10Design, Type JK Design, Presettable counter, IC 7490, IC 7492,Synchronous counter ICs.

Shift Register:Introduction, parallel and shift registers, serial shifting, serial–in

VIserial–

10out, serial–in parallel–out , parallel–in parallel–out, Ring counterJohnson counter, IC7495, Seven segment displays, analysis of shiftcounters.

References and Text Book:Sr. No Title Author/s Publisher Edition Year

Dr. S. B. Kishor, Published

by DAS 4th Ed.,1. Digital Electronics S. Dasarwar, S. 2018

KasarlaGANU

Prakashan.

2.Digital Electronics and

N. G. Palan TechnovaLogic Design

3. Make Electronics Charles Platt O’Reilly 1st 2010

Tata4. Modern Digital Electronics R. P. Jain McGraw 3rd

Hill

Digital Principles and Malvino andTata

5. McGrawApplications Leech HillDigital Electronics:

6. Principles, Devices and Anil K. Maini Wiley 2007Applications,

Introduction to SystemNew Age

International 2nd Ed.7. Design UGing Integrated B. S. Sonde

Circuits(P) Limited,

Publishers

B. Sc (Information Technology) Semester ICourse Name: Digital Electronics Practical Course Code: UGIT1P2Periods per week (1 Period is 50 minutes) 3Credits 2


Internal -- --

List of Practicals

1. Study of Logic gates and their ICs and universal gates:a. Study of AND, OR, NOT, XOR, XNOR, NAND and NOR gatesb. IC 7400, 7402, 7404, 7408, 7432, 7486, 74266c. Implement AND, OR, NOT, XOR, XNOR using NAND gates.d. Implement AND, OR, NOT, XOR, XNOR using NOR gates.

2. Implement the given Boolean expressions using minimum number of gates.a. Verifying De Morgan’s laws.b. Implement other given expressions using minimum number of gates.c. Implement other given expressions using minimum number of ICs

3. Implement combinational circuits.a. Design and implement combinational circuit based on the problem given and

minimizing using K-maps.

4. Implement code converters.a. Design and implement Binary – to – Gray code converter.b. Design and implement Gray – to – Binary code converter.c. Design and implement Binary – to – BCD code converterd. Design and implement Binary – to – XS-3 code converter

5. Implement Adder and Subtractor Arithmetic circuits.a. Design and implement Half adder and Full adder.b. Design and implement BCD adder.c. Design and implement XS – 3 adder.d. Design and implement binary subtractor.e. Design and implement BCD subtractor.f. Design and implement XS – 3 subtractor.

6. Implement Arithmetic circuits.a. Design and implement a 2-bit by 2-bit multiplier.b. Design and implement a 2-bit comparator.

7. Implement Encode and Decoder and Multiplexer and Demultiplexers.a. Design and implement 8:3 encoder.b. Design and implement 3:8 decoder.c. Design and implement 4:1 multiplexer. Study of IC 74153, 74157d. Design and implement 1:4 demultiplexer. Study of IC 74139e. Implement the given expression using IC 74151 8:1 multiplexer.f. Implement the given expression using IC 74138 3:8 decoder.8. Study of flip-flops and counters.a. Study of IC 7473.b. Study of IC 7474.

c. Study of IC 7476.d. Conversion of Flip-flops.e. Design of 3-bit synchronous counter using 7473 and required gates.f. Design of 3-bit ripple counter UGing IC 7473.

9. Study of counter ICs and designing Mod-N counters.a. Study of IC 7490, 7492, 7493 and designing mod-n counters using these.b. Designing mod-n counters using IC 7473 and 7400 (NAND gates)

10. Design of shift registers and shift register counters.a. Design serial – in serial – out, serial – in parallel – out, parallel – in serial – out,

parallel – in parallel – out and bidirectional shift registers using IC 7474.b. Study of ID 7495.c. Implementation of digits using seven segment displays.

B. Sc (Information Technology) Semester – I

Course Name: Operating Systems Course Code: UGIT103

Periods per week 1 Period is 50 minutes 5

Credits 2

Hours Marks

Evaluation System Theory Examination 2 60

Internal -- 40

Unit Details Lectures

Unit I Introduction:What is an operating system? History of operating system, OS andComputer System, System Performance, Classes of OS, Batch

10processing, time-sharing, multiprocessing, real-time, distributed andmodern operating systems, Desktop Systems, Handheld Systems,Clustered Systems, Assemblers, Compilers and Interpreters, Linkers.

Unit-II Operating-System Structures: Karnel Architecture, BootingProcess(POWER ON ,BIOS-POST,MBR,kernel loading ,bootingfunctions terminals) ,Operating-System Services, user Operating-

10System Interface, ,Layered Approach, ,Micro Kernels, VirtualMachines, System Calls, Types of System Calls, System Programs,Operating-System Design and Implementation, Operating-SystemStructure, Virtual Machines, Operating-System Generation,.

Unit III Processes and Process Synchronization: Process Concept, ProcessScheduling, Scheduling Criteria, Scheduling Algorithms, Operationson Processes, , Multithreading Models, Threading Issues, Thread 10Scheduling, Communication in Client–Server Systems, The Critical-Section Problem, Peterson’s Solution, Semaphores

Unit IV Memory Management: 10No memory abstraction, memory abstraction: address spaces, virtualmemory, page replacement algorithms, design issues for pagingsystems, implementation issues and segmentation.

Unit V File Systems: 10Files, directories, file system implementation, file-systemmanagement and optimization, MS-DOS file system, UNIX V7 filesystem, CD ROM file system. RAID Structure , Partition and filesystems (ext3,ext4,xfs,cifs) ,I-nodes, blocks and Super Blocks, Blockstructure analysis,Hard-disk geometry

Unit VI Input-Output: 10Principles of I/O hardware, Principles of I/O software, I/O softwarelayers, disks, clocks, UGer interfaces: keyboard, mouse, monitor,thin clients, power management,Deadlocks:Resources, introduction to deadlocks, the ostrich algorithm, deadlockdetection and recovery, deadlock avoidance, deadlock prevention,issues.


Sr. No. Title Author/s Publisher Edition Year1. Modern Operating Systems Andrew S. Pearson 4th 2014

Tanenbaum,Herbert Bos

2. Operating Systems – Willaim Pearson 8th 2009Internals and Design StallingsPrinciples

3. Operating System Concepts Abraham Wiley 8thSilberschatz,Peter B.Galvineg Gagne

4. Operating Systems Godbole and McGraw 3rdKahate Hill

5 Operating System Ashwini Somnathe Sheth 1sth

Abhijit Somnathe

B. Sc (Information Technology) Semester – I

Course Name: Operating Systems Practical Course Code: UGIT1P3

Periods per week (1 Period is 50 minutes) 3

Credits 2

Hours Marks

Evaluation System Practical Examination 2½ 50

Internal -- --

List of PracticalsPart I: Windows Operating System

1. Introduction and Installation of the Windows Operating System in virtual machine

2. Windows (DOS) Commands – 1

a. Date, time, prompt, md, cd, rd, path.

b. Chkdsk, copy, xcopy, format, fidsk, cls, defrag, del, mov

3. Windows (DOS) Commands – 2

a. Diskcomp, diskcopy, diskpart, doskey, echob. Edit, fc, find, rename, set, type, ver

Part II : Linux

4. Linux commands: Working with Directories:a. pwd, cd, absolute and relative paths, ls, mkdir, rmdir,b. file, touch, rm, cp. mv, rename, head, tail, cat, tac, more, less, strings, chmod

5. Linux commands: Working with files:a. ps, top, kill, pkill, bg, fg,b. grep, locate, find, locate.c. date, cal, uptime, w, whoami, finger, uname, man, df, du, free, whereis, which.d. Compression: tar, gzip.

6. Working with Linux Desktop and utilitiesa. The vi editor.b. Graphicsc. Terminal

7. Write a script to find out duplicate file.

8. Write a script to check partitions size.

9. Write a script to in out interactive and non-interactive users.

10. Write a script to take backup of tar ile from server to another remote server.

B. Sc. (Information Technology)Semester – I

Course Name: Discrete Mathematics Course Code: UGIT104Periods per week (1 Period is 50 minutes) 5Credits 2


Internal -- 40

Unit Details LecturesI Introduction: Variables, The Language of Sets, The Language of 10

Relations and FunctionSet Theory: Definitions and the Element Method of Proof, Propertiesof Sets, Disproofs, Algebraic Proofs, Boolean Algebras, Russell’sParadox and the Halting Problem.The Logic of Compound Statements: Logical Form and LogicalEquivalence, Conditional Statements, Valid and Invalid Arguments

II Quantified Statements: Predicates and Quantified Statements, 10Statements with Multiple Quantifiers, Arguments with QuantifiedStatementsElementary Number Theory and Methods of Proof: Introduction toDirect Proofs, Rational Numbers, Divisibility, Division into Cases andthe Quotient-Remainder Theorem, Floor and Ceiling, IndirectArgument: Contradiction and Contraposition, Two Classical Theorems,Applications in algorithms.

III Sequences, Mathematical Induction, and Recursion: Sequences, 10Mathematical Induction, Strong Mathematical Induction and the Well-Ordering Principle for the Integers, Correctness of algorithms, definingsequences recursively, solving recurrence relations by iteration, Secondorder linear homogenous recurrence relations with constant

coefficients. general recursive definitions and structural induction.IV Functions: Functions Defined on General Sets, One-to-One and Onto, 10

Inverse Functions, Composition of Functions, Cardinality withApplications to ComputabilityRelations: Relations on Sets, Reflexivity, Symmetry, and Transitivity,Equivalence Relations, Partial Order Relations

V Graphs and Trees: Definitions and Basic Properties, Trails, Paths, and 10Circuits, Matrix Representations of Graphs, Isomorphism’s of Graphs,Trees, Rooted Trees, Isomorphism’s of Graphs, Spanning trees andshortest paths.

VI Counting and Probability: Introduction, Possibility Trees and the 10Multiplication Rule, Possibility Trees and the Multiplication Rule,Counting Elements of Disjoint Sets: The Addition Rule, ThePigeonhole Principle, Counting Subsets of a Set: Combinations, r-Combinations with Repetition Allowed, Probability Axioms andExpected Value, Conditional Probability, Bayes’ Formula, andIndependent Events.

References and Text Books:

Sr. No. Title Author/s Publisher Edition Year

1. Discrete Mathematics with SUGsana S. Epp Cengage 4th 2010Applications Learning

Discrete Mathematics,Seymour Tata

2. Lipschutz, Marc MCGraw 2007Schaum’s Outlines Series

Lipson Hill

Discrete Mathematics and Tata3. Kenneth H. Rosen MCGraw

its Applications Hill

4.Discrete mathematical B Kolman RC

PHIstructures Busby, S RossTata

5. Discrete structures Liu MCGrawHill

6. Discrete Mathematics Dr. S. B. Kishor, Dr. DAS GANU 2nd Ed., 2014M. Singh Prakashan

B. Sc. (Information Technology)Semester – I

Course Name: Discrete Mathematics Practical Course Code: UGIT1P4Periods per week (1 Period is 50 minutes) 3Credits 2


Internal -- --

List of Practical: Write the programs for the following using SCILAB1. Set Theorya. InclUGion ExclUGion principle.b. Power Setsc. Mathematical Induction

2. Functions and Algorithmsa. Recursively defined functionsb. Cardinalityc. Polynomial evaluationd. Greatest Common Divisor

3. Countinga. Sum rule principleb. Product rule principlec. Factoriald. Binomial coefficientse. Permutationsf. Permutations with repetitionsg. Combinationsh. Combinations with repetitionsi. Ordered partitions

4. Probability Theorya. Sample space and eventsb. Finite probability spacesc. Equiprobable spacesd. Addition Principlee. Conditional Probabilityf. Multiplication theorem for conditional probabilityg. Independent eventsh. Repeated trials with two outcomes4. Probability Theory

5. Graph Theorya. Paths and connectivityb. Minimum spanning tree

6. Directed Graphsa. Adjacency matrix

b. Path matrix

7. Properties of integersa. Division algorithmb. Primesc. Euclidean algorithmd. Fundamental theorem of arithmetice. Congruence relationf. Linear congruence equation

8. Algebraic Systemsa. Properties of operationsb. Roots of polynomials

9. Boolean Algebraa. Basic definitions in Boolean Algebrab. Boolean algebra as lattices

10. Recurrence relationsa. Linear homogeneous recurrence relations with constant coefficientsb. Solving linear homogeneous recurrence relations with constant coefficientsc. Solving general homogeneous linear recurrence relations

B. Sc (Information Technology) Semester – ICourse Name: Communication Skills Course Code: UGIT105Periods per week (1 Period is 50 minutes) 5Credits 2


Internal -- 40Unit Details Lectures

The Seven Cs of Effective Communication:Completeness, Conciseness, Consideration, Concreteness,

I Clarity, Courtesy, CorrectnessUnderstanding Business Communication: 10Nature and Scope of Communication, Non-verbalCommunication, Cross-cultural communication, Technology-enabled Business Communication

Writing Business Messages and Documents:

IIBusiness writing, Business Correspondence, InstructionsBusiness Reports and Proposals, Career building and Resumewriting, email writing 10Campus to corporate programWhat is CTC?, Challenges of CTC program, Benefits of CTCprogram

IIIDeveloping Oral Communication Skills for usGiness:Effective Listening, Public Speaking, Conversations,Interviews, phone etiquette

10Developing Oral Communication Skills for Business:Meetings and Conferences, Group Discussions and Team

IV Presentations, Team Briefing,Understanding Specific Communication Needs: 10Communication across Functional AreasUnderstanding Specific Communication Needs:Corporate Communication, Persuasive Strategies in Business

V Communication, Ethics in Business Communication, Business 10Communication Aids

Presentation Process: Planning the presentations, executingthe presentations, Impressing the audience by performing,

VI Planning stage: Brainstorming, mind maps / concept maps, 10executing stage: chunking theory, creating outlines, use oftemplates. Adding graphics to your presentation: Visualcommunication, Impress stage: use of font, colour, layout,Importance of practice and performance

Books and References:Sr. Title Author/s Publisher Edition YearNo.1 BUGiness Edited by Oxford Second

Communication Meenakshi UniversityRaman and PressPrakash Singh

2 Professional Aruna Koneru TataCommunication McGraw

Hill3 Strategies for improving Prof. M. S. Rao Shroff 2016

your bUGiness publisherscommunication and

distributors4 BUGiness Dr. Rishipal and SPD 2014

Communication Dr. Jyoti5. Graphics for Learning: Ruth C. Clark, Pfeiffer, 2011

Proven Guidelines for Chopeta Lyons WileyPlanning, Designing, andEvaluating Visuals inTraining Materials

6 Basic BUGiness Lesikar Tata 10th 2005Communication: Skills Raymond V and McGraw-for Marie E. Flatley HillEmpowering the InternetGeneration

7 Nonverbal Ruesh, Jurgen University 1966Communication: Notes and Weldon ofon Kees Californiathe Visual Perception of PressHuman Relatio

8 BUGiness Bovee, Pearson 2015Communication Courtland EducationToday L.; Thill, John V. Ltd.

9 Communication Skills Dr. Nageshwar HimalayaRao Dr. PublishingRajendra P. Das HoUGe

B. Sc (Information Technology) Semester – ICourse Name: Communication Skills Practical Course Code: UGIT1P5Periods per week (1 Period is 50 minutes) 3Credits 2


Internal -- --

List of Practical1. Communication Origami, Guessing Game, Guessing the emotion2. Body Language, Follow All Instructions, Effective Feedback Skills3. The Name Game, Square Talk (Effective Communication), Room 101

(Influential and persuasive skills)4. Back to Back Communication, Paper Shapes (Importance of two-way

communication), Memory Test(Presentation Skills)5. Exercises on Communication Principles6. Exercises on communication icebreakers7. Communication exercises.

For the following practicals, Microsoft Office, Open Office, Libre Office orany other software suite can be used.

8. use of word processing tools for communication9. use of spreadsheet tools for communication10. use of presentation tools for communication

Semester – II

B. Sc. (Information Technology) Semester – IICourse Name: Object Oriented Programming Course Code: UGIT201Periods per week (1 Period is 50 minutes) 5Credits 2


Internal -- 40

Unit Details LecturesObject Oriented Methodology: Introduction, Advantages andDisadvantages of Procedure Oriented Languages, what is ObjectOriented? What is Object Oriented Development? Benefits and

I Application of OOPS. 10Principles of OOPS: Basic Concepts of OOPS: Objects, Classes,Data Abstraction and Data Encapsulation, Inheritance,Polymorphism, Dynamic Binding, Message PassingClasses and Objects: Simple classes (Class specification, classmembers accessing: public ,private ,protected), Defining memberfunctions, Writing function definition outside the class ,Makingoutside function inline, Array of objects, passing object as an

II argument, Returning object from functions, friend classes, Pointer 10to object, Array of pointer to object , Static Functions, Static datamember.Constructors and Destructors: Introduction, Default Constructor,Parameterized Constructor and examples ,Multiple constructor inclass, constructor with default arguments, copy constructor,DestructorsPolymorphism: Concept of function overloading, overloadedoperators, overloading unary and binary operators with member

III and friend function, overloading comparison operator, overloadingarithmetic assignment operator, Data Conversion between objectsand basic types 10Program development Using Inheritance: Introduction,understanding inheritance, Advantages provided by inheritance,

IV choosing the access specifier, Derived class declaration, derivedclass constructors, multiple inheritance, multilevel inheritance,hierarchical inheritance, virtual base classes, Abstract classes,containership, hybrid inheritance.Virtual Functions: Introduction and need, this pointer, Pointer toderived classes, Pure Virtual Functions, this Pointer, virtual

V destructors. 10Exception Handling: Introduction, Exception HandlingMechanism, Concept of throw & catch with example , MultipleCatchTemplates: Introduction, Function Template and examples, Class

VI Template and examples. 10Working with Files: Introduction, File Operations, Various FileModes, File Pointer and their Manipulation

Books and References:Sr. No. Title Author/s Publisher Edition Year

1. Object E. Tata 4thOriented BalagurUGamy McGrawProgramming Hillwith C++

2. The C+ + BjarneProgramming StroUGtrupLanguage

3. C++ for B. M. Hirwani SPD 2013beginners

4. Mastering K R Venugopal, Tata 2nd 2011C++ Rajkumar McGraw

Buyya, T HillRavishankar

5. Effective Scott Meyers SPDModern C++

6. Object Dr. S. B. Kishor DAS 2016Oriented GANUProgramming Prakashanwith C++,

B. Sc. (Information Technology) Semester – IICourse Name: Object Oriented Programming Practical Course Code: UGIT2P1Periods per week (1 Period is 50 minutes) 3Credits 2


Internal -- --

List of Practical: To be implemented using object oriented language1. Classes and methodsa. Design an employee class for reading and displaying the employee information, the

getInfo() and displayInfo() methods will be used repectively. Where getInfo() willbe private method

b. Design the class student containing getData() and displayData() as two of itsmethods which will be used for reading and displaying the student informationrespectively.Where getData() will be private method.

c. Design the class Demo which will contain the following methods: readNo(),factorial() for calculating the factorial of a number, reverseNo() will reverse thegiven number, isPalindrome() will check the given number is palindrome,isArmstrong() which will calculate the given number is armStrong or not.WherereadNo() will be private method.

d. Write a program to demonstrate function definition outside class and accessingclass members in function definition.

2. Using friend functions.a. Write a friend function for adding the two complex numbers, using a single classb. Write a friend function for adding the two different distances and display its sum,

Using two classes.c. Write a friend function for adding the two matrix from two different classes and

display its sum.3. Constructors and method overloading.a. Design a class Complex for adding the two complex numbers and also show the

Use of constructor.b. Design a class Geometry containing the methods area() and volume() and also

overload the area() function .c. Design a class StaticDemo to show the implementation of static variable and static

function.4. Operator Overloadinga. Overload the operator unary(-) for demonstrating operator overloading.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 “Py” + “thon” = Python5. Inheritancea. Design a class for single level inheritance Using public and private type derivation.b. Design a class for multiple inheritance.c. Implement the hierarchical inheritance.6. Virtual functions and abstract classesa. Implement the concept of method overriding.b. Show the use of virtual functionc. Show the implementation of abstract class.7. String handlinga. String operations for string length , string concatenationb. String operations for string reverse, string comparison,c. Console formatting functions.8. Exception handlinga. Show the implementation of exception handling

b. Show the implementation for exception handling for stringsc. Show the implementation of exception handling for using the pointers.9. File handlinga. Design a class File Demo open a file in read mode and display the total number of

words and lines in the file.b. Design a class to handle multiple files and file operationsc. Design a editor for appending and editing the files10. Templatesa. Show the implementation of template class library for swap function.b. Design the template class library for sorting ascending to descending and vice-

versa

B. Sc (Information Technology) Semester IICourse Name: Microprocessor Architecture Course Code: UGIT202Periods per week (1 Period is 50 minutes) 5Credits 2


Internal -- 40

Unit Details LecturesMicroprocessor, microcomputers, and Assembly Language:Microprocessor, Microprocessor Instruction Set and ComputerLanguages, From Large Computers to Single-Chip Microcontrollers,Applications.

Microprocessor Architecture and Microcomputer System:Microprocessor Architecture and its operation’s, Memory, I/O

IDevices, Microcomputer System, Logic Devices and

10Interfacing, Microprocessor-Based System Application.

8085 Microprocessor Architecture and Memory Interface:Introduction, 8085 Microprocessor unit, 8085-Based Microcomputer,Memory Interfacing, Interfacing the 8155 Memory Segment,Illustrative Example: Designing Memory for the MCTS Project,Testing and Troubleshooting Memory Interfacing Circuit, 8085-Based Single-Board microcomputer.Interfacing of I/O DevicesBasic Interfacing concepts, Interfacing Output Displays, InterfacingInput Devices, Memory Mapped I/O, Testing and TroubleshootingI/O Interfacing Circuits.

Introduction to 8085 Assembly Language Programming:The 8085 Programming Model, Instruction Classification,

II Instruction,Data and Storage, Writing assembling and Execution 10of a simple program, Overview of 8085 Instruction Set, Writing andAssembling Program.

Introduction to 8085 Instructions:Data Transfer Operations, Arithmetic Operations, Logic Operation,Branch Operation, Writing Assembly Languages Programs,Debugging a Program.Programming Techniques With Additional Instructions:Programming Techniques: Looping, Counting and Indexing,Additional Data Transfer and 16-Bit Arithmetic Instructions,Arithmetic Instruction Related to Memory, Logic Operations: Rotate,Logics Operations: Compare, Dynamic Debugging.

III Counters and Time Delays: 10

Counters and Time Delays, Illustrative Program: HexadecimalCounter, Illustrative Program: zero-to-nine (Modulo Ten) Counter,Generating Pulse Waveforms, Debugging Counter and Time-DelayPrograms.

IVStacks and Sub-Routines:

10Stack, Subroutine, Restart, Conditional Call, Return Instructions,

Advanced Subroutine concepts.

Code Conversion, BCD Arithmetic, and 16-Bit Data Operations:BCD-to-Binary Conversion, Binary-to-BCD Conversion, BCD-to-Seven-Segment-LED Code Conversion, Binary-to-ASCII and ASCII-to-Binary Code Conversion, BCD Addition, BCD Subtraction,Introduction To Advanced Instructions and Applications,Multiplication, Subtraction With Carry.Software Development System and Assemblers:Microprocessors-Based Software Development system, Operating

VSystem and Programming Tools, Assemblers and Cross-Assemblers,

10Writing Program Using Cross Assemblers.Interrupts:The 8085 Interrupt, 8085 Vectored Interrupts, Restart as S/WInstructions, Additional I/O Concepts and processes.

The Pentium and Pentium Pro microprocessors: Introduction,Special Pentium registers, Memory management, Pentiuminstructions,Pentium Pro microprocessor, Special Pentium

VIProfeatures.

10Core 2 and later Microprocessors: Introduction, Pentium IIsoftware changes, Pentium IV and Core 2, i3, i5 and i7.SUN SPARC Microprocessor: Architecture, Register file, datatypes and instruction format

Books and References:Sr. No Title Author/s Publisher Edition Year

Microprocessors

1.Architecture, Programmingand Applications with the Ramesh8085. Gaonkar PENRAM Fifth 2012

2.Computer System

M. Morris Mano PHI 1998Architecture

3.Structured Computer Andrew C.Organization Tanenbaum PHI

B. Sc (Information Technology) Semester IICourse Name: Microprocessor Architecture Practical Course Code: UGIT2P2Periods per week (1 Period is 50 minutes) 3Credits 2

Hours Marks

Evaluation System Practical Examination 2½50

Internal ----

B.Sc.(Information Technology) Semester-IICourse Name: Web Programming Course Code: UGIT203Periods per week(1 periods is 50 minutes) 5Credits 2

Hours MarksEvaluation System Theory 2 60

Internal --- 40

UNIT DETAILS LecturesS

HTML5: Introduction, Why HTML5? Formatting text by using tags, 10using lists and backgrounds, Creating hyperlinks and anchors.HTML5 Page layout and navigation:Creating navigational aids: planning site organization, creating text

Ibased navigation bar, creating graphics based navigation bar, creatinggraphical navigation bar, creating image map, redirecting to anotherURL.Creating division based layouts: creating image map, HTML5semantic tags, creating divisions, creating HTML5 semantic layout,positioning and formatting divisions.HTML5 Tables, Forms and Media: 10Tables : creating simple table, specifying the size of the table,specifying the width of the column, merging table cells, Using tablesfor page layout, formatting tables: applying table borders, applyingbackground and foreground fills, changing cell padding, spacing and

II alignment.Forms: creating basic form, Using check boxes and option buttons,creating lists, additional input types in HTML5.Media:Audio and video in HTML5, HTML multimedia basics, embeddingvideo clips, incorporating audio on web page.Style Sheets: What are style sheets?, Why are style sheets valuable?, 10Different approaches to style sheets, Linking to style information inseparate file, Setting up style information, Using the <LINK> tag,Embedded style information, Using <STYLE> tag, Inline styleinformation.CSS formatting text Using style sheets, formatting paragraphs Usingstyle sheets.

IIIJava Script: Introduction, Client-Side JavaScript, Server-SideJavaScript, JavaScript Objects, JavaScript Security.Operators: Assignment Operators, Comparison Operators, ArithmeticOperators, % (Modulus), ++(Increment), --(Decrement), -(UnaryNegation), Logical Operators, Short-Circuit Evaluation, StringOperators, Special Operators, ?: (Conditional operator), , (Commaoperator), delete, new, this, void Statements: Break, comment,continue, delete, do...while, export, for, for...in, function, if...else,import, labelled, return, switch, var, while, with.Core JavaScript (Properties and Methods of Each) : Array, 10Boolean, Date, Function, Math, Number, Object, String, regExp.Document and its associated objects: document, Link, Area,Anchor, Image, Applet.

IVLayer Events and Event Handlers : General Information about

Events, 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.PHP: Why PHP and MySQL? Server-side scripting, PHP syntax and 10variables, comments, types, control structures, branching, looping,

Vtermination, functions, passing information with PHP, GET, POST,formatting form variables, superglobal arrays, strings and stringfunctions, regular expressions, arrays, number handling, basic PHPerrors/problems.Advanced PHP and MySQL: PHP/MySQL Functions, Integrating 10

VIweb forms and databases, Displaying queries in tables, Building Formsfrom queries, String and Regular Expressions, Sessions, Cookies andHTTP, E-Mail.


Sr. Title Author/s Publisher Edition YearNo.

1. Web Design The Complete Thomas Powell Tata -Reference McGrawHill

2. HTML5 Step by Step Faithe Wempen Microsoft 2011Press

3. PHP 5.1 for Beginners Ivan Bayross Sharanam SPD 2013Shah,

4. PHP Project for Beginners SharanamShah, SPD 2015Vaishali Shah

5. PHP 6 and MySQL Bible Steve Suehring, Tim Wiley 2009Converse, Joyce Park

7. Head First HTML 5 Eric Freeman O’Reilly 2013programming

8. JavaScript 2.0: The Complete Thomas Powell and Tata 2ndReference Fritz Schneider McGraw

Hill

B.Sc.(Information Technology) Semester-IICourse Name: Web Programming Practical Course Code: UGIT203Periods per week(1 periods is 50 minutes) 5Credits 2

Hours MarksEvaluation System Theory 2½ 50

Internal --- --

List of Practical1 Group A: Website Design (HTML5, CSS)a. using HTML5 layout tags develop informative page with sections which

include various images, links to other pages for navigation, make use of all possible formatting (for example font, color etc.).

b. Design a web page with Imagemaps.c. Apply CSS properties Border, margins, Padding, Navigation, dropdown list to

page created in first assignment.

2 Website GUI Validation (JavaScript, PHP)a. Design a web page with different tables. Design a webpages using table so that the

content appears well placed.b. Design a web page embedding with multimedia features.c. Create form in HTML with all form elements apply form validations (e.g. Email,

mobile, Pin code, Password).d. Design a PHP page for authenticating a user.e. Validate URL, Email, Required using functions empty, preg_match, filter_var in

PHP.3 Website Development (Mini-Project)

a. Develop website using any CMS tool which falls into one of the categories blog, social networking, News updates, Wikipedia, E-commerce store. Website must include home page, and at least 3 forms (with Validation), use at list HTML5, PHP, CSS/Bootstrap, JavaScript web technologies. No database support is needed.Deploy website on live webserver and access through URL. Write a complete report of web development stages for the chosen topic and attach printout of the same with screen shots of web pages.

b. Guidelines for Mini project1. Project group of maximum 2 students should be formed.2. Every group member should participate in every stage of the web development.

B. Sc. (Information Technology) Semester – IICourse Name: Numerical and Statistical Methods Course Code: UGIT204Periods per week (1 Period is 50 minutes) 5Credits 2


Internal -- 40

Unit Details LecturesI Mathematical Modeling and Engineering Problem Solving: A 10

Simple Mathematical Model, Conservation Laws and EngineeringProblemsApproximations and Round-Off Errors: Significant Figures,Accuracy and Precision, Error Definitions, Round-Off ErrorsTruncation Errors and the Taylor Series:The Taylor Series, Error Propagation, Total Numerical Errors,Formulation Errors and Data Uncertainty

II Solutions of Algebraic and Transcendental Equations: The 10Bisection Method, The Newton-Raphson Method, The Regula-falsimethod, The Secant Method.Interpolation: Forward Difference, Backward Difference, Newton’sForward Difference Interpolation, Newton’s Backward DifferenceInterpolation, Lagrange’s Interpolation.

III Solution of simultaneous algebraic equations (linear) using 10iterative methods: Gauss-Jordan Method, Gauss-Seidel Method.Numerical differentiation and Integration: Numbericaldifferentiation, Numerical integration using Trapezoidal Rule,Simpson’s 1/3rd and 3/8th rules.

IV Numerical solution of 1st and 2nd order differential equations: 10Taylor series, Euler’s Method, Modified Euler’s Method, Runge-KuttaMethod for 1st and 2nd Order Differential Equations.

V Least-Squares Regression: 10Linear Regression, Polynomial Regression, Multiple LinearRegression, General Linear Least Squares, Nonlinear RegressionLinear Programming: Linear optimization problem, Formulation andGraphical solution, Basic solution and Feasible solution.

VI Random variables: Discrete and Continuous random variables, 10Probability density function, Probability distribution of randomvariables, Expected value, Variance.Distributions: Discrete distributions: Uniform, Binomial, Poisson,Bernoulli, Continuous distributions: uniform distributions, exponential,(derivation of mean and variance only and state other properties anddiscuss their applications) Normal distribution state all the propertiesand its applications.

Books and References:Sr. No. Title Author/s Publisher Edition Year

1.Introductory Methods of

S. S. Shastri PHI Vol – 2Numerical Methods

Numerical Methods forSteven C. Chapra,

Tata Mc2. Raymond P. 6th 2010Engineers Graw Hill

CanaleRichard L.

Cengage3. Numerical Analysis Burden, J. 9th 2011Learning

Douglas Faires

4.Fundamentals of S. C. Gupta, V. K.Mathematical Statistics Kapoor

Elements of Applied P.N.Wartikar and A. V. Volume5. Griha,

Mathematics J.N.Wartikar 1 and 2Pune

6. Numerical MethodsDr. S. B. Kishor, B. DAS GANU

2nd Ed. 2012Vaidya Prakashan

B. Sc. (Information Technology) Semester – IICourse Name: Numerical and Statistical Methods Course Code: UGIT2P4PracticalPeriods per week (1 Period is 50 minutes) 3Credits 2


Internal -- --

List of Practical1. Iterative Calculationa. Program for iterative calculation.b. Program to calculate the roots of a quadratic equation using the formula.c. Program to evaluate ex using infinite series.

2. Solution of algebraic and transcendental equations:a. Program to solve algebraic and transcendental equation by bisection method.b. Program to solve algebraic and transcendental equation by false position method.c. Program to solve algebraic and transcendental equation by Secant method.d. Program to solve algebraic and transcendental equation by Newton Raphson

method.

3. Interpolationa. Program for Newton’s forward interpolation.b. Program for Newton’s backward interpolation.c. Program for Lagrange’s interpolation.

4. Solving linear system of equations by iterative methodsa. Program for solving linear system of equations using Gauss Jordan method.b. Program for solving linear system of equations using Gauss Seidel method.

5. Numerical Differentiationa. Programing to obtain derivatives numerically.

6. Numerical Integrationa. Program for numerical integration using Trapezoidal rule.b. Program for numerical integration using Simpson’s 1/3rd rule.c. Program for numerical integration using Simpson’s 3/8th rule.

7. Solution of differential equationsa. Program to solve differential equation using Euler’s methodb. Program to solve differential equation using modified Euler’s method.c. Program to solve differential equation using Runge-kutta 2nd order and 4th order

methods.

8. Regressiona. Program for Linear regression.b. Program for Polynomial Regression.c. Program for multiple linear regression.d. Program for non-linear regression.

9. Random variables and distributionsa. Program to generate random variables.b. Program to fit binomial distribution.c. Program to fit Poisson distribution.

10. Distributionsa. Program for Uniform distribution.b. Program for Bernoulli distributionc. Program for Negative binomial distribution.

B. Sc (Information Technology) Semester IICourse Name: Green Computing Course Code: UGIT205Periods per week (1 Period is 50 minutes) 5Credits 2


Internal -- 40

Unit Details LecturesProblems: Toxins, Power Consumption, EquipmentDisposal,Company’s Carbon Footprint: Measuring, Details, reasons tobother,Plan for the Future, Cost Savings: Hardware, Power.

I Global Initiatives: United Nations, Basel Action Network, Basel 10

Convention, North America: The United States, Canada, Australia,Europe, WEEE Directive, RoHS, National Adoption, Asia: Japan,China, Korea.Minimizing Power usage: Power Problems, Monitoring Power usage,Servers, Low-Cost Options, Reducing Power use, Data De-

IIDuplication, Virtualization, management, Bigger Drives, Involving the

10Utility Company, Low-Power Computers, PCs, Linux, Components,Servers, Computer Settings, Storage, Monitors, Power Supplies,Wireless Devices, Software.Cooling: Cooling Costs, Power Cost, Causes of Cost, CalculatingCooling Needs, Reducing Cooling Costs, Economizers, On-DemandCooling, HP’s Solution, Optimizing Airflow, Hot Aisle/Cold Aisle,

IIIRaised Floors, Cable Management, Vapour Seal, Prevent Recirculation

10of Equipment Exhaust, Supply Air Directly to Heat Sources, Fans,Humidity, Adding Cooling, Fluid Considerations, System Design,Datacentre Design, Centralized Control, Design for Your Needs, PutEverything Together.Changing the Way of Work :Old Behaviours, starting at the Top,Process Reengineering with Green in Mind, Analysing the GlobalImpact of Local Actions, Steps: Water, Recycling, Energy, Pollutants,Teleworkers and Outsourcing, Telecommuting, Outsourcing, how toOutsource.

IVPaper Problems, The Environment, Costs: Paper and

10Office,Practicality, Storage, Destruction, Goingpaperless,OrganizationalRealities, Changing Over, Paperless Billing,Handheld Computersvs. the Clipboard, Unified Communications, Intranets, What toInclude,Building an Intranet, Microsoft Office SharePoint Server2007,Electronic Data Interchange (EDI), Nuts and Bolts, ValueAddedNetworks, Advantages, ObstaclesRecycling Hardware : Problems, China, Africa, Materials, Means ofDisposal, Recycling,Refurbishing, Make the Decision, Life Cycle, frombeginning to end, Life, Cost, Green Design, Recycling Companies,

VFinding the Best One,Checklist, Certifications, Hard Drive Recycling,

10Consequences,cleaning a Hard Drive, Pros and cons of each method,CDs and DVDs,good and bad about CD and DVDs disposal, Changethe mind-set,David vs. America Online

Considerations: Certification Programs, EPEAT, RoHS, Energy Star,Computers, Monitors, Printers, Scanners, All-in-Ones, Thin Clients,Servers, Blade Servers, Consolidation, Products, Hardwareconsiderations, Planned Obsolescence, Packaging, Toxins, OtherFactors, Remote Desktop, using Remote Desktop, Establishing aConnection, In PracticeGreening Your Information Systems: Initial ImprovementCalculations, Selecting Metrics, Tracking Progress, Change BusinessProcesses, Customer Interaction, PaperReduction, Green Supply Chain, Improve Technology Infrastructure,Reduce PCs and Servers, Shared Services, Hardware Costs, Cooling.

VI 10Staying Green: Organizational Check-ups, Chief Green Officer, Evolution, Sell the CEO, SMART Goals, Equipment Check-ups, Gather Data, Tracking the data, Baseline Data, Benchmarking, Analyse Data, Conduct Audits, Certifications, Benefits, Realities,Helpful Organizations

Books and References:Sr. No Title Author/s Publisher Edition Year

Toby Velte,1. Anthony Velte,

Green ITRobert McGrawElsenpeter Hill 2008Alvin Galea, Shroff

2. Green Data Center: StepsMichael PublishersSchaefer, Mike and

for the Journey Ebbers Distributors 2011

3.Green Computing andGreen IT Best Practice Jason Harris EnereoGreen Computing tools and

4.Techniques for SavingEnergy, Money andResources Bud. E. Smith CRC Press 2014

B. Sc (Information Technology) Semester IICourse Name: Green Computing Practical Course Code: UGIT2P5Periods per week (1 Period is 50 minutes) 3Credits 2


Internal -- --