Tuesday, November 17, 2009

CG PROGRAMS

HERE's THE LINK FOR ALL THE FOLLOWING CG PROGRAM

if u find any error's or if u have a better version of the program please do mail me at jekintrivedi@gmail.com

http://www.turboupload.com/hdhldsv3oubd/CG_final.zip


Suggested Experiment List
1. Bresenham line drawing algorithm
2. 2D Transformation
3. 3D Transformation
4. Line Clipping Algorithm (Cohen - Sutherland & Liang - Barsky)
5. Polygon Clipping Algorithms
6. Projections
7. Polygon Filling Algorithms
8. Generation of 2D Curves
9. Fractals
10. Study of VR Architectures
11. Designing a Virtual Model (Geometric, Kinematics etc.)
12. VR Programming using toolkits


Here's is a super cool variation of fractal program called Sepenski gasket fractal given in Moorey thanks 2 anvith for mail it to me


#include iostream.h
#include conio.h
#include graphics.h

void create(int m1,int n1,int m2,int n2,int m3, int n3){
int p1,q1,p2,q2,p3,q3,u1,u2,u3,v1,v2,v3;
p1=(m1+m2)/2;p2=(m3+m2)/2;p3=(m1+m3)/2;
q1=(n1+n2)/2;q2=(n3+n2)/2;q3=(n1+n3)/2;
u1=m1;u2=m2;u3=m3;v1=n1;v2=n2;v3=n3;
line(p1,q1,p2,q2);line(p3,q3,p2,q2);line(p1,q1,p3,q3);
if((p1==p2 && p1==p3)||(q1==q2 && q1==q3))
return;
create(u1,v1,p1,q1,p3,q3);
create(p1,q1,u2,v2,p2,q2);
create(p3,q3,p2,q2,u3,v3);
}
void main(){
/* request auto detection */
int gdriver = DETECT, gmode, errorcode;
initgraph(&gdriver, &gmode, "");
int x1,x2,x3,y1,y2,y3;
x1=100,y1=100;x2=100;y2=400;y3=400;x3=400;
line(x1,y1,x2,y2);line(x2,y2,x3,y3);line(x3,y3,x1,y1);
create(x1,y1,x2,y2,x3,y3);
getch();
closegraph();
}

Tuesday, November 10, 2009

OOAD PROJECTS

I HAVE TRIED TO COLLECT ALL THE OOAD PROJECTS I CAN GET HOPE IT COMES USEFUL IN COMMING EXAM


PLEASE MAIL ME YOUR PROJECTS IT WILL BE A HELP TO OTHERS & ME
IF U DONT HAVE THE PROJECTS MAIL ME THE PHOTOS OF THE PRINTOUT
PLEASE SEND IT AS SOON AS U CAN


my email id : jekintrivedi@gmail.com

HERE IS A LINK WHICH HAS ALL THE DIAGRAMS IN A SINGLE ZIP FILE

http://www.turboupload.com/xvziyh0dvx3h/OOAD.zip.html
or
http://rapidshare.com/files/305362160/OOAD.zip

or IF U WANT TO SELECT INDIVIDUAL FILES


1) ABC DETECTIVE by RUJI & group

http://rapidshare.com/files/304942457/detective1.rar

2)NCIT thanks to sanyukta & froup

http://rapidshare.com/files/304943713/ncit.rar

3)Travel Agency thanks to Shweta & gaurav

http://rapidshare.com/files/304944492/ooad_travel_agency_.zip

4)NM thanks to Jekin & group

http://rapidshare.com/files/304944037/NM.zip

5)LIFT thanks to aditya & group

http://rapidshare.com/files/304965785/lift.rar

6)ESU thanks to meenakshi & group

http://rapidshare.com/files/304965357/ESU.zip

7)NET BANKING thanks to siddhart

http://rapidshare.com/files/304994325/via-net_banking_arun_hiral_vishwjit.rar

8)VENDING MACHINE thanks to aditi & group(INCOMPLETE)

http://rapidshare.com/files/304993698/vending_machine.rar

9)Hospital Management thanks to sonal & shraddha

http://rapidshare.com/files/305050831/fwdhospmngmtproject.zip

10)Rental thanks to bhavik & group

http://rapidshare.com/files/305050355/rental.rar

11) ONLINE SHOPPING CART thanks to rishi & group

http://rapidshare.com/files/305060201/online_shoppin_cart.zip

12)INVENTORY

is present in the main zip file above

13)AIRPLANE RESERVATION
is present in the main zip file above
13)IIT
is present in the main zip file above
14)Telephone
is present in the main zip file above
15)University
is present in the main zip file above
16)Banking
is present in the main zip file above
17)Library

Wednesday, November 4, 2009

Time table for University exam

Download the following pdf

http://www.mu.ac.in/tt/440.pdf

Thursday, October 29, 2009

CT EBOOK

Communication Networks Principles and Practice kasera



Tuesday, October 20, 2009

VIRTUAL REALITY EBOOK

VIRTUAL REALITY EBOOK cannot be downloaded ! !
if anyone knows how to download this ebook let me know 2 :)

USE THE SEARCH FEATURE BELOW TO FIND ANSWERS IN THE BOOK

Monday, August 31, 2009

OS FILE MANAGEMENT PROGRAM

follow the link to get the OS file management program :

http://rapidshare.com/files/273877441/filemngt.rar

use :

java FileStructureMngt

to run program

THESE PROGRAM IS JUST TO GIVE AN IDEA OF THE PROGRAM the implementation has to be done by individuals

Sunday, August 30, 2009

LINUX LIST OF PRACS 2

1 ] adduser uname
2 ] addgroup gname
3 ] adduser uname gname
4 ] su
5 ] uptime
6 ] chmod
7 ] umask
8 ] chowner
9 ] find
10 ] grep
11 ] wu
12 ] where is
13 ] who
14 ] ps
15 ] kill
16 ] pgroup
17 ] s


B5 batch

Bring write up for this & the first programs on 31/08/09

Saturday, August 22, 2009

OOAD ASSIGNMENT 1

reference : THE UML USER GUIDE

I HAVE ADDED THE WHOLE PARAGRAPH RELATING TO THE QUESTIONS SO U CAN CUT SHORT IT ACCORDING TO UR CHOICE & ALSO SORRY AS I WAS NOT ABLE 2 PUT THE DIAGRAM


Q1

Modeling is not just a part of the building industry. It would be inconceivable to deploy a new
aircraft or an automobile without first building models• from computer models to physical wind
tunnel models to full-scale prototypes. New electrical devices, from microprocessors to telephone
switching systems require some degree of modeling in order to better understand the system and
to communicate those ideas to others. In the motion picture industry, storyboarding, which is a
form of modeling, is central to any production. In the fields of sociology, economics, and business
management, we build models so that we can val idate our theories or try out new ones with
minimal risk and cost.
What, then, is a model? Simply put,
A model is a simplification of reality.
A model provides the blueprints of a system. Models may encompass detailed plans, as well as
more general plans that give a 30,000-foot view of the system under consideration. A good model
includes those elements that have broad effect and omits those minor elements that are not
relevant to the given level of abstraction. Every system may be described from different aspects
using different models, and each model is therefore a semantically closed abstraction of the
system. A model may be structural, emphasizing the organization of the system, or it may be
behavioral, emphasizing the dynamics of the system.
Why do we model? There is one fundamental reason.
We build models so that we can better understand the system we are
developing.
Through modeling, we achieve four aims. How the UML addresses these four things is discussed in Chapter 2.
1. Models help us to visualize a system as it is or as we want it to be.
2. Models permit us to specify the structure or behavior of a system.
3. Models give us a template that guides us in constructing a system.
4. Models document the decisions we have made.
Modeling is not just for big systems. Even the software equivalent of a dog house can benefit
from some modeling. However, it's definitely true that the larger and more complex the system,
the more important modeling becomes, for one very simple reason:
We build models of complex systems because we cannot comprehend such a
system in its entirety.
There are limits to the human ability to understand complexity. Through modeling, we narrow the
problem we are studying by focusing on only one aspect at a time. This is essentially the
approach of "divide-and-conquer" that Edsger Dijkstra spoke of years ago: Attack a hard problem
by dividing it into a series of smaller problems that you can solve. Furthermore, through model ing,
we amplify the human intellect. A model properly chosen can enable the modeler to work at
higher levels of abstraction.


Q 2
Relationships in the UML
There are 3 kinds of relationships
1. Dependency
2. Association
3. Generalization

These relationships are the basic relational building blocks of the UML. You use them to write
well-formed models. Dependencies are discussed in Chapters 5 and 10.
First, a dependency is a semantic relationship between two things in which a change to one thing
(the independent thing) may affect the semantics of the other thing (the dependent thing).
Graphically, a dependency is rendered as a dashed line, possibly directed, and occasionally
including a label, as in Figure 2-12.
Figure 2-12 Dependencies

Associations are discussed in Chapters 5 and 10.
Second, an association is a structural relationship that describes a set of links, a link being a
connection among objects. Aggregation is a special kind of association, representing a structural
relationship between a whole and its parts. Graphically, an association is rendered as a solid line,
possibly directed, occasionally including a label, and often containing other adornments, such as
multiplicity and role names, as in Figure 2-13.
Figure 2-13 Associations

Generalizations are discussed in Chapters 5 and 10.
Third, a generalization is a specialization/generalization relationship in which objects of the
specialized element (the child) are substitutable for objects of the generalized element (the
parent). In this way, the child shares the structure and the behavior of the parent. Graphically, a
generalization relationship is rendered as a solid line with a hollow arrowhead pointing to the
parent, as in Figure 2-14.
Figure 2-14 Generalizations

Q3

NOTES :

A note is simply a symbol for rendering constraints and
comments attached to an element or a collection of elements. Graphically, a note is rendered as
a rectangle with a dog-eared corner, together with a textual or graphical comment, as in Figure
2-11.
Figure 2-11 Notes

This element is the one basic annotational thing you may include in a UML model. You'll typically
use notes to adorn your diagrams with constraints or comments that are best expressed in
informal or formal text. There are also variations on this element, such as requirements (which
specify some desired behavior from the perspective of outside the model)


Streotypes

Name
An association can have a name, and you use that name to describe the nature of the
relationship. So that there is no ambiguity about its meaning, you can give a direction to the name
by providing a direction triangle that points in the direction you intend to read the name, as shown
in Figure 5-4.
Figure 5-4 Association Names

Note
Although an association may have a name, you typically don't need to include one if
you explicitly provide role names for the association, or if you have a model with many
associations and you need to refer to or distinguish among associations. This is
especially true when you have more than one association connecting the same
classes.

Roles are related to the semantics of interfaces, as discussed in Chapter 11.
Role
When a class participates in an association, it has a specific role that it plays in that relationship;
a role is just the face the class at the near end of the association presents to the class at the
other end of the association. You can explicitly name the role a class plays in an association. In
Figure 5-5, a Person playing the role of employee is associated with a Company playing the
role of employer.
Figure 5-5 Roles
Note
The same class can play the same or different roles in other associations.

An instance of an association is called a link, as discussed in Chapter 15.
Multiplicity
An association represents a structural relationship among objects. In many modeling situations,
it's important for you to state how many objects may be connected across an instance of an
association. This "how many" is called the multiplicity of an association's role, and is written as an
expression that evaluates to a range of values or an explicit value as in Figure 5-6. When you
state a multiplicity at one end of an association, you are specifying that, for each object of the
class at the opposite end, there must be that many objects at the near end. You can show a
multiplicity of exactly one (1), zero or one (0..1), many (0..*), or one or more (1..*). You can
even state an exact number (for example, 3).



Q4

Notes
A note that renders a comment has no semantic impact, meaning that its contents do not alter the
meaning of the model to which it is attached. This is why notes are used to specify things like
requirements, observations, reviews, and explanations, in addition to rendering constraints.
Notes may be attached to more than one element by usingdependencies, as discussed in
Chapter 5.
A note may contain any combination of text or graphics. If your implementation allows it, you can
put a live URL inside a note, or even link to or embed another document. In this way, you can use
the UML to organize all the artifacts you might generate or use during development, as Figure 6-
3 illustrates.

Extensibility Mechanisms
The UML provides a standard language for writing software blueprints, but it is not possible for
one closed language to ever be sufficient to express all possible nuances of all models across all
domains across all time. For this reason, the UML is opened-ended, making it possible for you to
extend the language in controlled ways. The UML's extensibility mechanisms include
· Stereotypes
· Tagged values
· Constraints
A stereotype extends the vocabulary of the UML, allowing you to create new kinds of building
blocks that are derived from existing ones but that are specific to your problem. For example, if
you are working in a programming language, such as Java or C++, you will often want to model
exceptions. In these languages, exceptions are just classes, although they are treated in very
special ways. Typically, you only want to allow them to be thrown and caught, nothing else. You
can make exceptions first class citizens in your models• meaning that they are treated like basic
building blocks• by marking them with an appropriate stereotype, as for the class Overflow in
Figure 2-19.
Figure 2-19 Extensibility Mechanisms
A tagged value extends the properties of a UML building block, allowing you to create new
information in that element's specification. For example, if you are working on a shrink-wrapped
product that undergoes many releases over time, you often want to track the version and author
of certain critical abstractions. Version and author are not primitive UML concepts. They can be
added to any building block, such as a class, by introducing new tagged values to that building
block. In Figure 2-19, for example, the class EventQueue is extended by marking its version
and author explicitly.
A constraint extends the semantics of a UML building block, allowing you to add new rules or
modify existing ones. For example, you might want to constrain the EventQueue class so that all
additions are done in order. As Figure 2-19 shows, you can add a constraint that explicitly
marks these for the operation add.
Collectively, these three extensibility mechanisms allow you to shape and grow the UML to your
project's needs. These mechanisms also let the UML adapt to new software technology, such as
the likely emergence of more powerful distributed programming languages. You can add new
building blocks, modify the specification of existing ones, and even change their semantics.
Naturally, it's important that you do so in controlled ways so that through these extensions, you
remain true to the UML's purpose• the communication of information.






Q 5

forward engineering is the process of transforming a model into code through a mapping to an
implementation language. Forward engineering results in a loss of information, because models
written in the UML are semantically richer than any current object-oriented programming
language. In fact, this is a major reason why you need models in addition to code. Structural
features, such as collaborations, and behavioral features, such as interactions, can be visualized
clearly in the UML, but not so clearly from raw code.


To forward engineer a class diagram,
· Identify the rules for mapping to your implementation language or languages of choice.
This is something you'll want to do for your project or your organization as a whole.
· Depending on the semantics of the languages you choose, you may have to constrain
your use of certain UML features. For example, the UML permits you to model multiple
inheritance, but Smalltalk permits only single inheritance. You can either choose to
prohibit developers from modeling with multiple inheritance (which makes your models
language-dependent) or develop idioms that transform these richer features into the
implementation language (which makes the mapping more complex).
· Use tagged values to specify your target language. You can do this at the level of
individual classes if you need precise control. You can also do so at a higher level, such
as with collaborations or packages.
· Use tools to forward engineer your models.



Reverse engineering is the process of transforming code into a model through a mapping from a
specific implementation language. Reverse engineering results in a flood of information, some of
which is at a lower level of detail than you'll need to build useful models. At the same time,
reverse engineering is incomplete. There is a loss of information when forward engineering
models into code, and so you can't completely recreate a model from code unless your tools
encode information in the source comments that goes beyond the semantics of the
implementation language.
Figure 3-3 was created by reverse engineering part of theJava class library.
To reverse engineer a class diagram,
· Identify the rules for mapping from your implementation language or languages of choice.
This is something you'll want to do for your project or your organization as a whole.
· Using a tool, point to the code you'd like to reverse engineer. Use your tool to generate a
new model or modify an existing one that was previously forward engineered. · Using your tool, create a class diagram by querying the model. For example, you might
start with one or more classes, then expand the diagram by following specific
relationships or other neighboring classes. Expose or hide details of the contents of this
class diagram as necessary to communicate your intent.

Sunday, August 2, 2009

2G , 3G & 4G Wireless Communication

2G

2G (or 2-G) is short for second-generation wireless telephone technology.

Second generation 2G cellular telecom networks were commercially launched on the GSM standard in Finland by in 1991.

Three primary benefits of 2G networks over their predecessors were that
1] Phone conversations were digitally encrypted,
2] 2G systems were significantly more efficient on the spectrum allowing for far greater mobile phone penetration levels;
3] And 2G introduced data services for mobile, starting with SMS text messages.

After 2G was launched, the previous mobile telephone systems were retrospectively dubbed 1G. While radio signals on 1G networks are analog, and on 2G networks are digital, both systems use digital signaling to connect the radio towers (which listen to the handsets) to the rest of the telephone system.

2G technologies can be divided into TDMA-based and CDMA-based standards depending on the type of multiplexing used. The main 2G standards are:

* GSM (TDMA-based), originally from Europe but used in almost all countries on all six inhabited continents. Today accounts for over 80% of all subscribers around the world.
* IS-95 aka cdmaOne, (CDMA-based, commonly referred as simply CDMA in the US), used in the Americas and parts of Asia. Today accounts for about 17% of all subscribers globally.
* PDC (TDMA-based), used exclusively in Japan
* iDEN (TDMA-based), proprietary network used by Nextel in the US and Telus Mobility in Canada
* IS-136 aka D-AMPS, TDMA-based, commonly referred as simply TDMA in the US

.

Advantages

Digital systems were embraced by consumers for several reasons.

* The lower powered radio signals require less battery power, so phones last much longer between charges, and batteries can be smaller.
* The digital voice encoding allowed digital error checking which could increase sound quality by increasing dynamic range and lowering the noise floor.
* The lower power emissions helped address health concerns.
* Going all-digital allowed for the introduction of digital data services, such as SMS and email.
* Greatly reduced fraud. With analog systems it was possible to have two or more "cloned" handsets that had the same phone number.
* Enhanced privacy. A key digital advantage not often mentioned is that digital cellular calls are much harder to eavesdrop on by use of radio scanners.
* Digital voice data can be compressed and multiplexed much more effectively than analog voice encodings through the use of various codecs, allowing more calls to be packed into the same amount of radio bandwidth.
* Equipments were less expensive & small in size

Disadvantages

The downsides of 2G systems, not often well publicized, are:

* In less populous areas, the weaker digital signal may not be sufficient to reach a cell tower.
* Analog has a smooth decay curve, digital a jagged steppy one. Under slightly worse conditions, digital will start to completely fail, by dropping calls or being unintelligible, while analog slowly gets worse, generally holding a call longer and allowing at least a few words to get through.
* While digital calls tend to be free of static and background noise, the lossy compression used by the codecs takes a toll; the range of sound that they convey is reduced.



3G :

International Mobile Telecommunications-2000 (IMT-2000), better known as 3G or 3rd Generation, is a family of standards for wireless communications defined by the International Telecommunication Union.

Services include wide-area wireless voice telephone, video calls, and wireless data, all in a mobile environment.

3G allows simultaneous use of speech and data services and higher data rates (up to 14.4 Mbit/s on the downlink and 5.8 Mbit/s on the uplink).
here are evolutionary standards that are backwards-compatible extensions to pre-existing 2G networks as well as revolutionary standards that require all-new networks and frequency allocations.
The first pre-commercial 3G network was launched by NTT DoCoMo in Japan branded FOMA, in May 2001 on a pre-release of W-CDMA technology.

3G comprises several cellular access technologies. The three most common ones as of 2005 are:

* CDMA2000 - based on 2G Code Division Multiple Access (see Cellular Access Technologies)
* WCDMA (UMTS) - Wideband Code Division Multiple Access
* TD-SCDMA - Time-division Synchronous Code-division Multiple Access

Although 3G was successfully introduced to users across the world, some issues are debated by 3G providers and users:

* Expensive input fees for the 3G service licenses in some jurisdictions
* Differences in licensing terms between states
* Level of debt incurred by some telecommunication companies, which makes investment in 3G difficult
* Lack of state support for financially troubled operators
* Cost of 3G phones
* Lack of coverage in some areas
* High prices for 3G in some countries
* Demand for high speed services in a hand-held device
* Battery life of 3G phones


4G :

International Mobile Telecommunications-Advanced (IMT Advanced), better known as 4G, 4th Generation or Beyond 3G, is the next technological strategy in the field of wireless communications.

A 4G system will upgrade existing communication networks and is expected to provide a comprehensive and secure IP based solution where facilities such as voice, data and streamed multimedia will be provided to users on an "Anytime, Anywhere" basis and at much higher data rates compared to previous generations.

The 4G working group has defined the following as objectives of the 4G wireless communication standard:

* A spectrally efficient system (in bits/s/Hz and bits/s/Hz/site),[1]
* High network capacity: more simultaneous users per cell,[2]
* A nominal data rate of 100 Mbit/s while the client physically moves at high speeds relative to the station, and 1 Gbit/s while client and station are in relatively fixed positions as defined by the ITU-R,[3]
* A data rate of at least 100 Mbit/s between any two points in the world,[3]
* Smooth handoff across heterogeneous networks,[4]
* Seamless connectivity and global roaming across multiple networks,[5]
* High quality of service for next generation multimedia support (real time audio, high speed data, HDTV video content, mobile TV, etc)[5]
* Interoperability with existing wireless standards,[6] and
* An all IP, packet switched network.[5]

Principal technologies

* Baseband techniques[9]
o OFDM: To exploit the frequency selective channel property
o MIMO: To attain ultra high spectral efficiency
o Turbo principle: To minimize the required SNR at the reception side
* Adaptive radio interface
* Modulation, spatial processing including multi-antenna and multi-user MIMO
* Relaying, including fixed relay networks (FRNs), and the cooperative relaying concept, known as multi-mode protocol

Components :

Access schemes :Recently, new access schemes like Orthogonal FDMA (OFDMA), Single Carrier FDMA (SC-FDMA), Interleaved FDMA and Multi-carrier code division multiple access (MC-CDMA) are gaining more importance for the next generation systems.

IPv6 support: By the time that 4G is deployed, the process of IPv4 address exhaustion is expected to be in its final stages. Therefore, in the context of 4G, IPv6 support is essential in order to support a large number of wireless-enabled devices.

Advanced Antenna Systems: One technology, spatial multiplexing, gained importance for its bandwidth conservation and power efficiency. Spatial multiplexing involves deploying multiple antennae at the transmitter and at the receiver.This is called MIMO (as a branch of intelligent antenna).

Software-Defined Radio (SDR)

SDR is one form of open wireless architecture (OWA). Since 4G is a collection of wireless standards, the final form of a 4G device will constitute various standards.

However 4G is still under developments & will take time till a application is seen.

Saturday, June 20, 2009

SYLLABUS FOR SEM VI & VII

Open Source Software Laboratory

CLASS T.E. ( INFORMATION TECHNOLOGY) SEMESTER V

HOURS PER WEEK

LECTURES

:

--

TUTORIALS

:

02

PRACTICALS

:

02


HOURS

MARKS

EVALUATION SYSTEM:

THEORY


--

--

PRACTICAL


--

25

ORAL


--

--

TERM WORK


--

25

1. Introduction To Linux

An Introduction to UNIX, Linux, and GNU What Is UNIX, What Is Linux, The GNU Project and the Free Software Foundation

2. Installation of Linux

Basic Installation, network based installation

3. Linux System Administration

Process Management with Linux, Memory Management, File System management, User Administration, Linux Startup and Shutdown, Software package Management

4. Shell Programming

Shells, Scripting Rationale Creating a bash Script, bash Startup Files, A Script’s Environment, Exporting Variables, Exit Status, Programming the Shell, Parameter Passing, Operators, looping, Input and Output ,Interrupts

5. Software Tools

C Language and Linux, MySQL Database, Network Simulator, SciLAB configuration, Multimedia, etc.

6. Kernel Configuration

Overview of the Linux Kernel, Configuring the Linux Kernel, Configuration Options, Building and Installing the Kernel, Building the Kernel, Installing a New Kernel, Configuring your Boot Manager

7. Network Administration

LAN Card configuration, DHCP, DNS, FTP, Telnet, SSH, NFS, Web Server, SQUID Proxy configuration

Text Books

1. Terry Collings, Kurt Wall, “Red Hat Linux Network and System Administration” 3rd edition Wiley.

2. Nemeth, “Linux Administration Handbook”, 2e, Pearson Education,

3. Neil Mathews, “Beginning Linux Programming” 4th edition, Wrox Press.

4. Best, “Linux Debugging and Performance Tuning : Tips and Techniques”, Pearson Education

5. Habraken, “ Novell Linux Desktop 9 User’s Handbook”, Pearson Education.

Term Work

Term work shall consist of at least 10 practical experiments covering all topics and one written test.

Marks

Distribution of marks for term work shall be as follows:

1. Attendance (Theory and Practical) 05 Marks

2. Laboratory work (Experiments and Journal) 10 Marks

3. Test (at least one) 10 Marks

The final certification and acceptance of Term Work ensures the satisfactory Performance of laboratory Work and Minimum Passing in the term work.

Suggested Experiment List

1. Linux OS Installation

2. System Accounting and Logging

3. File Systems

4. Shell Scripts

5. Logic Development

6. Command Line Argument Handling

7. Loops Using while and for statement

8. Arithmetic in shell scripting

9. File handling

10. Screen handling/echo command with escape sequence code

11. Background process implementation

12. User interface and functions in shell script

13. Application development using tools like network simulators, MySQL Databses.









ENVIRONMENTAL STUDIES

CLASS T.E. ( INFORMATION TECHNOLOGY) SEMESTER V

HOURS PER WEEK

LECTURES

:

02

TUTORIALS

:

01

PRACTICALS

:

--


HOURS

MARKS

EVALUATION SYSTEM:

THEORY


2

50

PRACTICAL


--

--

ORAL


--

--

TERM WORK


--

25

Module

Contents

Hours

1

The Multidisciplinary nature of environmental studies

Definition, scope and importance

Need for public awareness

1

2

Natural resources

Renewable and non-renewable resources

Natural resources & associated problem.

  1. Forest resources: Use and over-exploitation, deforestation, case studies. Timber extraction, mining, dams and teir effects on forests and tribal people.
  2. Water resources: Use and over-utilization of surface and ground water, floods, drought, conflicts over water, dams benefits and problems.
  3. Mineral resources: Use and exploitation, environmental effects of extracting and using mineral resources, case studies.
  4. Food resources: World food problems overgrazing, effects of modern agriculture, fertilizer-pesticide problems, water logging, salinity, case studies.
  5. Energy resources: Growing energy needs, renewable and non renewable energy sources, use of alternate energy sources. Case studies.
  6. Land resources: Land as a resource, land degradation, man induced landslides, soil erosion and desertification.

· Role of an individual in conservation of natural resources.

Equitable use of resources for sustainable lifestyles.

4

3

· Ecosystems

· Concepts of an ecosystem.

· Structure and function of an ecosystem.

· Producers, consumers and decomposers.

· Energy flow in the ecosystem.

· Ecological succession.

· Food chains, food webs and ecological pyramids.

· Introduction, types, characteristic features, structure and function of the following ecosystem:

    1. Forest ecosystem
    2. Grassland ecosystem
    3. Desert ecosystem
    4. Aquatic ecosystem (ponds, streams, lakes, rivers, oceans, estuaries)

3

4

Biodiversity and its conservation

· Introduction-Definition: genetic species and ecosystem diversity

· Bio-geographical classification of India

· Value of biodiversity : Consumptive use, productive use, social, ethical, aesthetic and option values

· Bio-diversity at global, national, local levels

· India as a mega diversity nation

· Hot spots of bio-diversity

· Threats to biodiversity: Habitat loss, poaching of wild life, man-wildlife conflicts

· Endangered and endemic species of India

· Conservation of biodiversity: In- situ and Ex-situ conservation of biodiversity

4

5

Environmental Pollution Definition –

· Causes, effects and control measures of:

a. Air pollution

b. Water pollution

c. Soil pollution

d. Marine pollution

e. Noise pollution

f. Thermal pollution

g. Nuclear Hazards

· Solid waste management: Causes, effect and control measures of urban and industrial wastes

· Role of an individual in prevention of pollution

· Pollution case studies

· Disaster management: floods, earthquake, cyclone and land slides

4

6

Social issues and environment

· From unsustainable to sustainable development

· Urban problems related to energy

· Water conservation, rain water harvesting, watershed management

· Re-settlement and rehabilitation of people: Its problems and concerns. Case studies.

· Environmental ethics: issues and possible solution

· Climate change, global warming, acid rain, ozone layer depletion, nuclear accidents and holocaust. Case studies.

· Wasteland reclamation

· Consumerism and waste products

· Environment protection act

· Air( Prevention and control of pollution ) act

· Water ( Prevention and control of pollution ) act

· Wildlife protection act

· Forest conservation act

· Issues involved in enforcement of environmental legislation

· Public awareness

4

7

Human population and the environment

· Population growth, variation among nations

· Population Explosion- family welfare program

· Environment and human health

· Human rights

· Value education

· HIV/AIDS

· Women and child welfare

· Role of information technology in environment and human health

· Case studies

4

Theory Examination:

1. Question paper will be comprising of total 7 questions, each of 10 marks.

2. Only 5 questions need to be solved.

3. Question number 1 will be compulsory and covering the all modules.

4. Remaining questions will be mixed in nature. (e.g.- suppose Q.2 has part (a) from, module 3 then part (b) will be from any module other than module 3.)

5. In question paper weightage of each module will be proportional to number of respective lecture hours as mentioned in the syllabus.

Term work:

Term work shall consist of minimum five projects (PROJECTS SHALL BE DESIGNED ON THE SAME GUIDE- LINE OF GIVEN TEXT BOOK) and a written test.

The distribution of marks for term work shall be as follows,

Laboratory work (Tutorial/Project and Journal) : 15 marks.

Test (at least one) : 10 marks.

The final certification and acceptance of term-work ensures the satisfactory performance of laboratory work and minimum passing in the term-work.

Recommended Books:

Text book

1. Erach Bharucha, text book of environmental studies, Universities Press/Orient Blackswan

Reference book

1 Jagdish Krishnaswami, R J Ranjit Daniels, ‘Environmental Studies”, Wiley India

Private Ltd. New delhi

2 Anindita Basak, ‘Environmental Studies”, Pearson

3 Deeksha Dave, “Text book of , ‘Environmental Studies”, Cengage learning,

Thomason India edition

4 Benny Joseph , ‘Environmental Studies”, Tata McGRAW HILL

5 D L Manjunath, , ‘Environmental Studies”,Pearson

6 R Rajgopalan, , ‘Environmental Studies”, Oxford

7 Alok Debi, ‘Environmental science and Engineering”, University press





OBJECT ORIENTED ANALYSIS AND DESIGN

CLASS T.E. ( INFORMATION TECHNOLOGY) SEMESTER V

HOURS PER WEEK

LECTURES

:

04

TUTORIALS

:

--

PRACTICALS

:

02

HOURS

MARKS

EVALUATION SYSTEM:

THEORY

3

100

PRACTICAL

--

25

ORAL

--

--

TERM WORK

--

25

1. Review of Object Orientation

Class and objects, effect of inheritance on polymorphism and variable declarations, concepts that define object orientation.

2. Requirements

Developing requirements, reviewing requirements, managing requirements, Difficulties and risks in domain and requirement analysis, requirement documents, Case studies and discussion on the above topics.

3. Unified Modeling Language

Visual modeling with UML, Use case model- use case, actor, and roles, Modeling with classes – association, multiplicity, generalization, process of creating class diagram – difficulties and risks in creating class diagram.

Modeling interaction and behavior – interaction diagrams, state diagram and activity diagram, implementing classes based on interaction and state diagram- difficulties and risks in modeling interactions and behavior.

4. Architecting and Designing Software

The process of design, design principles, architectural patterns, design document, difficulties and risks in design.

Frameworks: reusable subsystem. Design patterns – Singleton, observer, adapter, Façade, proxy with examples

5. Implementation

Mapping models to Code, Mapping Object Model to Database Schema

6. Usability, Testing and Quality

Usability Principles- user interface design evaluating user interfaces

Testing and Quality – strategies, defects, test cases and test plan, inspections, quality assurance.

Text Books

1. Timothy C. Lethbridge, Robert Laganiere “ Object-Oriented Software Engineering – A practical software development using UML and Java”, Tata McGraw-Hill, New Delhi.

2. Mike O’Docherty “Object-Oriented Analysis & design – understanding system development with UML 2.0”, John Wiley.

3. Bernd Bruegge, “Object oriented software engineering”, Second Edition, Pearson Education.

4. Stephan R. Schach, “Object oriented software engineering”, Tata McGraw Hill.

5. Booch, Jacobson, Rumbagh, “The UML user Guide”, Pearson Education.

6. Ali Bahrami, “Object Oriented System Development”, McGraw Hill.

7. David William Brown, “An Introduction to Object Oriented Analysis Objects and UML in Plain English”, 2nf Edition, Wiley.

Term Work

Term work shall consist of at least 10 assignments/programming assignments and one written test.

Marks

1. Attendance (Theory and Practical) 05 Marks

2. Laboratory work (Experiments and Journal) 10 Marks

3. Test (at least one) 10 Marks

The final certification and acceptance of TW ensures the satisfactory performance of laboratory Work and Minimum Passing in the term work.

Suggested Experiment List

1. At least one or two review assignments covering object oriented concepts.

2. A full-fledged mini project in which a student will design an application using OOAD case tool.

3. Assignments for the UML diagrams not used in the case study.

4. Hands on any one good Framework.




Manufacturing Processes, Planning And Systems - Information Technology (IT) Semester 6 and 7 Mumbai University Revised 2009 Syllabus









MANUFACTURING PROCESSES, PLANNING AND SYSTEMS

CLASS T.E. ( INFORMATION TECHNOLOGY) SEMESTER V

HOURS PER WEEK

LECTURES

:

04

TUTORIALS

:

02

PRACTICALS

:

--


HOURS

MARKS

EVALUATION SYSTEM:

THEORY


3

100

PRACTICAL


--

--

ORAL


--

25

TERM WORK


--

25

1. Introduction to Production and Operations Management

Products and services, the product/ process Continuum, the transformation process, product design, process design, automation

2. Manufacturing Processes

Elementary treatment on various manufacturing process like turning, milling, shaping and drilling- machine tolls, tooling and set up for each processes. Basic concepts on cold and hot working with metals – examples. Welding brazing and soldering: Differences, elementary treatment on important welding process, brazing and soldering techniques, soldering techniques for manufacturing/electrical/electronic components – cleaning. Solder, flux materials, process and preventions of dry soldering.

3. Polymeric Materials

Classification – examples, properties and application areas, processing of plastics – elementary treatment on compression/transfer moulding, injection moulding and extraction (film, pipes, sheets and cable/wire coursing)

4. Operations Planning

Business Objectives, Systems Analysis, Operations Sheet preparation, Information, Sequence of Operations, pinion operations Sheet, welded Steel Assembly operations Sheet, Trends.

5. Quality Systems

Definition of quality, TQM concept, SQC tools like bar and pie charts, scatter diagram, cause effect diagram, Pareto analysis, Quality systems and Process Improvement, Process Variation, Control Charts for Variable Data, Control charts for Attribute Data, Process Capability Analysis, Statistical Design of Experiments, reliability Theory

6. Computer Numerical Control Systems:

Types of CNC Systems, Evolution of CNC Machine tools, types of Controllers, CNC Operational Sequence, rectangular Coordinates, Program Formatting and Coding.

7. Process Automation

Simulation, Automation, Robots, Group technology, Flexible, Manufacturing Systems.

Other Production Systems, Economic Considerations, lean current and re-engineering, lean manufacturing.

8. Operator- Machine Systems

Operator-Machine Systems Structure, Ergonomics, Designing Ergonomic Tools, Redesigning Workstations, Job Analysis, Systems to measure Injury Frequency, Impact of Intelligent Systems.

9. Facility capacity and layout planning

Capacity planning, Decision tree analysis in Facility Capacity planning, facility layout planning, assignment model in layout planning, load-distance analysis in process layouts

10. Demand Management

The make –to –stock , the Assemble-to-order, make to order environment, sales and operations planning, master production scheduling , dealing with customers on a day –to-day basis, Information use in Demand Management make –to-knowledge data capture and monitoring customer relationship management, outbound product flow, CANBAN.

11. Materials requirement planning (MRP) & Just-in-time (JIT) practices

Material requirement planning in manufacturing, MRP-JIT production systems,Sales and operations planning, Enterprise Resource Planning, Forecasting for Strategic business planning, sales and operations planning, master production scheduling,

Text book

1. Phillip F. Ostwald and Jairo Munoz, “Manufacturing Processes and Systems” Wiley India Edition ISBN No: 978-8126-518937

2. Vollmaan , Berrt, Whybark, Jacobs “Manufacturing planning and control for supply chain Management” Tata McGraw Hill

Reference

1. Mikell P. Groover, “Fundamental of Modern Manufacturing” Wiley India Edition

2. Kanishka Bedi, “Production and operations management”, OXFORD university press

3. E. S. Buffa, “Modern Production and Operation Management”, Wiley.

4. H. G. Menon, “Total Quality Mnagament in Product Manufacturing”,

5. D. H. Bester Field, “ Total Quality Management”, PHI

6. Raghuvanshi, “Production Technology”.

7. Garmo, “Materials and Manufacturing Processes”.

Term Work

Term work shall consist of at least 10 assignments/ demonstration of workshop practice / documentation of industry visit and one written test.

Marks

1. Attendance (Theory and Practical) 05 Marks

2. Laboratory work (Experiments and Journal) 10 Marks

3. Test (at least one) 10 Marks

The final certification and acceptance of Term Work ensures the satisfactory Performance of laboratory Work and Minimum Passing in the term work.









CONVERGENCE OF TECHNOLOGIES AND NETWORKING IN COMMUNICATION

CLASS T.E. ( INFORMATION TECHNOLOGY) SEMESTER V

HOURS PER WEEK

LECTURES

:

04

TUTORIALS

:

--

PRACTICALS

:

02


HOURS

MARKS

EVALUATION SYSTEM:

THEORY


3

100

PRACTICAL


--

--

ORAL


--

25

TERM WORK


--

25

1. Introduction:

Communication model, Data Communication, Data representation transmission, modes of data transmission, synchronous and asynchronous communication, Network and services. Introduction to 2G, 3G and 4G Wireless communication system.

2. Convergence Technology

The blending or integration of voice, video, data and image into one flexible network, overview of network topology.

3. Modem

Digital modulation methods, ASK, PSK, FSK. Modem and standards, Data multiplexers, Multiplexing techniques, Comparison of data multiplexing techniques ADSL, RADSL, HDSL, SDSL.

4. Bandpass Modulation

Binary phase shift keying, Probability of error for Binary phase shift keying Differentally encoded phase shift keying, Probability of error for DEPSK , QPSK, M-ary PSK, Quadrature amplitude shift keying, Binary frequency Shift keying, M-ary FSK Minimum shift keying (MSK).Error performance for binary systems, Probability of error for coherently detected Binary orthogonal FSK, GMSK.

5. Network Services and Protocol Layering

Connection oriented & connectionless services, their comparison layered architecture, services Interface, primitives and service access points, Ad-hoc wireless networks, Handoff Algorithms, Bluetooth Technology and Infrared Technology.

6. Transmission and Multiple Accesses

Transfer Modes circuit switching, routing, virtual circuit switching comparison of transfer modes Asynchronous transfer mode. Multiple access concepts FDMA/TDMA in GSM networks, CDMA in UMTS Networks.

7. Data Transmission Functions

Probability of error for coherently detected BPSK, Data link control, Data link line configurations, data link layer functions, services offered to network Layer DLC protocol layering logical link control (LLC) Media access control (MAC), Flow control protocols Error detection and correction mechanisms e.g. HDLC Bridging Transparent source route bridging in ETHERNET LANS, switching components of typical switch performance measures in switch design switching, switching issues, switching architectures shared-memory architecture, shared-medium architectures space division architecture switching in ATM and its examples.

8. Communication Network Functions

Addressing techniques, classification of addressing techniques, addressing structure in INTERNET addressing structure in Telecom Networks, signaling complexity in Different Networks, Classification of signaling techniques signaling issues, Signaling models, point to multipoint signaling, ISDN signaling, Routing protocols/techniques, core routing concepts, core routing concepts.

9. Traffic Management

Concept of traffic, concept of service, Network capabilities, Types of traffic, Traffic Management, Traffic contract management, traffic policing, priority control, priority control Flow control versus congestion control, Traffic Management in ATM.

10. Network Management

Goals of Network Management, Functional Areas of Network Management Telecommunications management Network (TMN).

11. Security Management

Security Management, symmetric (secret key) Encryption Techniques, Asymmetric encryption techniques, Key management, Hash functions, Digital signatures and certificates, Firewalls, Security management in Third generation UMTS network.

12. Convergence Technologies for 3G Networks

Operation and integration of GSM, GPRS, EDGE, UMTS, CDMA2000, IP, and ATM, practical examples of 3G connection scenarios. Signaling flows and protocol stacks, IP and ATM as used in a 3G context, issues of QoS and real-time application support IP/SS7 internetworking and IP soft switching, the architecture of the IP Multimedia Subsystem (IMS) for UMTS

Text Books:

1. Sumit Kasera, Nishit Narang, Sumita Narang, “Communication Networks Principles and Practice” Tata McGraw-Hill Publishing company Limited New Delhi

2. Jeffrey Bannister, Paul Mather, Sebastian Coope “Convergence Technologies for 3G Networks: IP, UMTS, EGPRS and ATM”, Wily india

3. Skalar, “Digital communications”, Pearson education, 2001 2nd Edition.

4. William Stallings, “Data and Computer Communication”, Pearson Education, 6th Edition.

5. Lean Garcia, Widjaja, “Communication Networks”, Tata McGraw Hill, 2nd Edition.

6. T. S. Rappaport, “Wireless Communication”, Pearson Education, 2nd Edition.

Reference Books:

1. Forouzan, Data Communication & Networking, Tata Mcgraw Hill, 3rd Edition.

2. Andrew Tanenbaum, Computer Networks, Prentice Hall of India.

3. Raj Pandya, Mobile & Personal Communication system & services, Prentice Hall of India.

Term Work:

Term work shall consist of at least 10 practical experiments covering all topics and one written test.

Marks

Distribution of marks for term work shall be as follows:

1. Attendance (Theory and Practical) 05 Marks

2. Laboratory work (Experiments and Journal) 10 Marks

3. Test (at least one) 10 Marks

The final certification and acceptance of Term Work ensures the satisfactory Performance of laboratory Work and Minimum Passing in the term work.

Suggested Experiment List

1. To study PC to PC Communication.

2. To study ASK, PSK, FSK techniques.

3. To study Hand off algorithm for Ad-hoc wireless networks.

4. To study Belmann Ford Algorithm.

5. To study Dijkstra”s Algorithm.

6. To study OFDM (Orthogonal Frequency Davison Multiplexing) technique.

7. To study Static channel allocation scheme.

8. To study Dynamic channel allocation scheme.

9. To study various types of signaling techniques.

10. To study various types of Encryption techniques.

11. Simulation of routing protocols using Network Simulators like NS2, Nistnet etc.

12. Study of M/M/1 Queuing Model









COMPUTER GRAPHICS AND VIRTUAL REALITY SYSTEMS

CLASS T.E. ( INFORMATION TECHNOLOGY) SEMESTER V

HOURS PER WEEK

LECTURES

:

04

TUTORIALS

:

--

PRACTICALS

:

02


HOURS

MARKS

EVALUATION SYSTEM:

THEORY


3

100

PRACTICAL


--

25

ORAL


--

25

TERM WORK


--

25

1. Introduction to Computer graphics and Image Analysis

Introduction, Image and Object, Image Representation, The basic graphics pipeline, Bitmap vs Vector based Graphics, Applications of Computer Graphics, Various Display Devices and Input Technology Overview of Coordinate System. Scan Conversion algorithm: Scan Conversion of a point, Scan conversion of lines, Digital differential analyzer algorithm, Bresenhams line drawing algorithm

2. Two and Three Dimensional Transformations

Introduction, Transformation Matrix, Types of transformation, Translation, Rotation, Scaling, Reflection, Shear, Composite transformations, and Transformation function.

3. Viewing and Clipping

Introduction ,Viewing transformation in two-dimensions, Introduction to clipping, 2D clipping, Point clipping, Line clipping, Cohen Sutherland line clipping, Midpoint subdivision algorithm, Cyrus Beck line clipping, Liang Barsky line clipping, Introduction to Polygon clipping, Sutherland Hodgeman polygon clipping, Weller Atherton algorithm, Viewing and clipping in 3D,Viewing transformation, Text clipping, Projection, Parallel projection, Orthographic projection, Oblique projection, Perspective projection ,One point perspective, Two point perspective, Three point perspective.

4. Solid Area Scan Conversion

Introduction, Inside Outside test, Winding number method, Coherence, Polygon filling, Seed fill algorithm, Boundary fill algorithm, Flood fill algorithm, Scan line algorithm, Priority algorithm, Scan conversion of characters, Anti aliasing, Types of anti aliasing, Haftoning, thresholding and dithering

5. Curve Design :

Introduction, Curve continuity, Conic curves, Piecewise curve design, LeGrange interpolated curves, Spline curve representation, Bezier Curves, B Spline Curves, Non Uniform Rational B Spline curves, Introduction to fractal and introduction color models.

6. Computer Animation

Introduction, Key Frame Animation, Construction of an animation sequence, Motion control methods, Methods based on geometric and kinematics information, Methods based on physical information, Methods based on Behavioral Information, Procedural Animation, Introduction to Morphing, Intermediate Images, Mapping orders, Warping techniques, Mesh warping, Feature based image warping, Thin plate Spline, TPS based image warping, 3D morphing.

7. Introduction to Virtual Reality

A short history of early virtual reality, early commercial VR Technology, The five classical components of VR Systems, Design of Virtual reality systems, Important factors in VR systems, Types of VR systems, Advantages of virtual reality .

8. Input and Output Devices

Three Dimensional Position Trackers, Navigation and Manipulation Interfaces, Gesture Interfaces, Graphical Display, Sound displays, and Haptic Feedback.

9. Computing Architectures for Virtual Reality

The Rendering Pipeline: The graphical rendering pipeline, The haptics rendering pipeline, PC Graphics Architectures: Pc Graphics Accelerators, Graphics Benchmarks, Work Station Based Architectures: the Sun Blade 1000 Architecture, the SGI Infinite Reality Architecture, Distributed VR Architectures: Multipipeline Synchronization, Collocated rendering Pipelines, Distributed Virtual Environments.

10. Modeling

Geometric Modeling: Virtual Object Shape, Object Visual Appearance.

Kinematics Modeling: Homogeneous Transformation Matrices, Object Position, Transformation Invariants, Object Hierarchies, viewing the three dimensional words.

Physical Modeling: Collision Detection, Surface Deformation, Force Computation, Force Smoothing and Mapping, Haptic Texturing.

Behavior Modeling and Model Management: Level of Detail Management, Cell Segmentation.

11. Virtual Reality Programming

Toolkits and Scene Graphs.World Toolkit: Model Geometry and Appearance, the WTK Scene Graph, Sensors and Action Functions, WTK Networking,

JAVA 3D: Model Geometry and Appearance, Java 3D Scene graph, Sensors and Behaviors, Java 3D Networking, WTK and Java 3D Performance Comparison.

General Haptics Open Software Toolkit: GHOST Integration with the Graphics Pipeline, The GHOST Haptic Scene Graph, Collision Detection and response, Graphics and PHANToM Calibration.

12. Application areas of Virtual Reality

Medical, Education, Arts and Entertainment, Military, Manufacturing, Robotics, Information Visualization.

Text Books

1. R. K Maurya, “Computer Graphics”, Wiley India.

2. Donal Hearn and M. Pauline Baker, “Computer Graphics”, Pearson Education.

3. Newman and Sproll, “Principles of Interactive Computer Graphics”, McGraw Hill.

4. Harrington, “Computer Graphics”, McGraw Hill.

5. Rogers, “Procedural Elements of Computer Graphics”, Tata McGraw Hill.

6. Vince, “Virtual Reality Systems”, Pearson Education.

7. Grigore Burdea, Philippe Coiffet, “Virtual Reality Technology”, 2nd edition. Wiley.

Term Work

Term work shall consist of at least 10 practical experiments covering all topics and one written test.

Marks

Distribution of marks for term work shall be as follows:

1. Attendance (Theory and Practical) 05 Marks

2. Laboratory work (Experiments and Journal) 10 Marks

3. Test (at least one) 10 Marks

The final certification and acceptance of Term Work ensures the satisfactory Performance of laboratory Work and Minimum Passing in the term work.

Suggested Experiment List

1. Bresenham line drawing algorithm

2. 2D Transformation

3. 3D Transformation

4. Line Clipping Algorithm (Cohen - Sutherland & Liang - Barsky)

5. Polygon Clipping Algorithms

6. Projections

7. Polygon Filling Algorithms

8. Generation of 2D Curves

9. Fractals

10. Various Operations on Image such Morphing, Mapping, Warping etc.

11. Study of VR Architectures

12. Designing a Virtual Model (Geometric, Kinematics etc.)

13. VR Programming using toolkits











OPERATING SYSTEM FOR COMPUTATIONAL DEVICES

CLASS T.E. ( INFORMATION TECHNOLOGY) SEMESTER V

HOURS PER WEEK

LECTURES

:

04

TUTORIALS

:

--

PRACTICALS

:

02


HOURS

MARKS

EVALUATION SYSTEM:

THEORY


3

100

PRACTICAL


--

--

ORAL


--

25

TERM WORK


--

25

1. Introduction and Overview of OS

Operating systems: Definition, objective and function of OS, the history and evolution of OS, characteristics of modern OS, application scenarios, organization of a computer system, operational view of a computing system with resources like processor, memory, input and output, issues in resource management, a bare-bone operating system, introduction to the issues in communication with devices, kernel and shell of an operating system, processes, file and system calls, layered Vs monolithic OS. Kernel architecture: User and kernel mode of operation, System calls, process states, kernel operations, design of a scheduler.

2. File Systems and Management

File systems: What is a file, user view of files, file types and file operations, file types in Unix/Linux and Microsoft, file operation commands, file access rights, file storage management, Inode or FAT structure, file control blocks, root file system, directory and file paths, blocks, impact of block size selection, contiguous allocation, chained and indexed allocations, Impact of allocation policy on fragmentation, anatomy of disk address translation, mapping file blocks on the disk platter, cylinder, file related system services, disk access control and scheduling

3. Process Management

Process, threads, task, Implicit and explicit tasking, processor utilization, multi-processing and time sharing, response time., process relationship, process state, process state transitions, process scheduling, short-term and long term schedules, non-pre-emptive and pre-emptive scheduling policies, time slice, CPU scheduling policies like FCFS, SJF etc. Gantt charts and parameters to compare policy performance, context switching of process state information.

4. Memory Management

Motivation, when and where primary and secondary memory management is needed, compiled code and memory relocation, linking and loading, processes and primary memory management, static and dynamic partitioned using MFT and MVT algorithms, memory allocation policies, critique of various policies like first fit, best fit, internal and external fragmentation, secondary memory management, fixed and variable partitions, virtual memory concept, paging and page replacement policies, page faults, thrashing, hardware support for paging, segmentation, segmentation with paging

5. Input Output Management

Issues in human centric, device centric and computer centric IO management, input output modes, programmed IO, polling, interrupt mode of IO, various types of interrupts, interrupt servicing, priority interrupts, interrupt vectors, direct memory access (DMA) mode of transfer, setting up DMAs, device drivers, interrupt handling using device drivers, buffer management, device scheduling, disk scheduling algorithms and policies.

6. Resource Sharing and Management

Shared resources, resource allocation and scheduling, resource graph models, deadlocks, deadlock detection, deadlock recovery, deadlock avoidance, deadlock prevention algorithms, mutual exclusion, semaphores, wait and signal procedures.

7. Interprocess Communication

Spawning a new process, parent and child processes, assigning a task to child processes, need for communication between processes, modes of communication, pipes, shared files, shared memory, message based IPC, signals as IPC, the distributed computing environment.

8. Real Time Operating Systems

Introduction to Real time systems and Real Time Operating Systems, characteristics of real-time operating systems, classification of real time operating systems, services, goals, structure, features of RTOS, architectures of real-time operating systems, micro kernels and monolithic kernels, tasks in RTOS, performance measures, estimating program runtimes, task assignment, scheduling in RTOS, rate monotonic scheduling, priority inversion, task management, race condition, inter-task communication, applications of real time systems, overview and comparison of various RTOS – LIKE Vx works, QNX, RT Linux, Monta Vista, Nucleus Window CE, Symbian, Psos, Introduction to Mobile and Embedded Operating Systems, RTOS for hand-held devices.

9. Case Study

Comparative study of NOS and DOS

References

  1. Applied Operating System Concepts, 1st ed. Silberschatz, Galvin and Gagne, John Wiley Publishers.
  2. Operating System Concepts, 2nd Edition, Milenekovic, McGraw Hill.
  3. An introduction to Operating System, Dietel, Addision Wesley.
  4. Modern Operating Systems, Tanenbaum., PHI
  5. Operating System, 4th Edition, William Stallings, Pearson,
  6. Real Time Operating System, Barr M.
  7. Real-Time Systems, Jane Liu, Pearson Ed. Asia
  8. Real -Time Systems, Krishna and Shin, McGraw Hill International.

Term Work:

Term work shall consist of at least 10 experiments covering all topics and one written test.

Distribution of marks for term work shall be as follows:

  1. Attendance (Theory and Practical) 05 Marks
  2. Laboratory work (Experiments and Journal) 10 Marks
  3. Test (at least one) 10 Marks

The final certification and acceptance of TW ensures the satisfactory Performance of laboratory Work and Minimum Passing in the term work.

Suggested Experiment list

  1. System Calls
  2. CPU Scheduling Policies
  3. Page Replacement Algorithm
  4. IPC (Producer – Consumer)
  5. Multithreading
  6. Remote Procedure Calls
  7. Deadlock Avoidance
  8. Simulation using RTOS like Symbian/Vx works/ QNX/RT Linux/Monta Vista/Nucleus Window CE









T.E (Information Technology) Semester V and Semester VI revised syllabus starting from 2009-2010 Academic year

Click on subject names to get detailed syllabus of subjects.

Third Year -Semester V

Scheme of Instructions

Scheme of Examinations

Sr.

No

Subjects

Lect/

Week

Pract/

Week

Tut/

Week

Theory

T/W

Practical

Oral

Total

Hours

Marks

Marks

Marks

Marks

Marks

1

Operating System for Computational Devices

4

2

--

3

100

25

--

25

150

2

Computer Graphics and Virtual Reality Systems

4

2

--

3

100

25

25

25

175

3

Convergence of Technologies and Networking in Communication

4

2

--

3

100

25

--

25

150

4

Manufacturing processes, Planning and Systems

4

--

2

3

100

25

--

25

150

5

Object Oriented Analysis and Design

4

2

--

3

100

25

25

--

150

6

Environmental Studies

2

--

1

2

50

25

--

--

75

7

Open Source Software Laboratory

--

2

--

--

--

25

25

--

50


TOTAL

22

10

3

--

550

175

75

100

900

Third Year -Semester VI

Scheme of Instructions

Scheme of Examinations

Sr.

No

Subjects

Lect/

Week

Pract/

Week

Tut/

Week

Theory

T/W

Practical

Oral

Total

Hours

Marks

Marks

Marks

Marks

Marks

1

Information and Network Security

4

2

--

3

100

25

--

25

150

2

Middleware and Enterprise Integration Technologies

4

2

--

3

100

25

--

25

150

3

Software Engineering

4

2

--

3

100

25

--

25

150

4

Data Base Technologies

4

2

--

3

100

25

--

25

150

5

Programming for Mobile and Remote Computers

4

2

--

3

100

25

25

--

150

6

Information Technology for Management of Enterprise

4

-

1

3

100

25

--

25

150


TOTAL

24

10

1

--

600

150

25

125

900




JTSEARCH