Get fully solved assignment. Buy
online from website
online store
or
plz drop a mail with your sub
code
we will revert you within 2-3
hour or immediate
Charges rs 125/subject
if urgent then call us on 08791490301, 08273413412
ASSIGNMENT DRIVE - SPRING
2018
PROGRAM - Master of Science
in Information Technology (MSc IT)
SEMESTER - 2
SUBJECT CODE & NAME - MIT206
– OPERATING SYSTEM
Assignment
Set - 1 Questions
Q1 Discuss in detail the process control
block.
Answer:
While creating a
process the operating system performs several operations. To identify these
process, it must identify each process, hence it assigns a process
identification number (PID) to each process. As the operating system supports
multi-programming, it needs to keep track of the all the processes. For this
task, the process control block (PCB) is used to track the process’s execution
status.
Q2
Explain the priority CPU scheduling algorithm with example. Write the
disadvantages associated with this algorithm
Answer:
Priority Based Scheduling
·
Priority
·
Q3 Discuss Interprocess Communication. 10
Answer:-
Communication of
co-operating processes’ shared-memory environment requires that these processes
share a common buffer pool, and that the code for implementing the buffer be
explicitly written by the application programmer. Another way to achieve the
same effect is for the operating system to provide the means for co-operating
Assignment
Set - 2 Questions
Q1 Explain the following page replacement
algorithm:
(a) Optimal
(b) LRU 5+5 10
Answer:-
a)
§
Optimal Page replacement –
In this algorithm, pages are replaced which are not used for the longest duration of time in the future.
In this algorithm, pages are replaced which are not used for the longest duration of time in the future.
Let us consider
page reference string 7 0 1 2 0 3 0 4 2 3 0 3 2 and 4 page slots.
Initially all
Q2 Compare Daisy chain bus arbitration
and Priority encoded bus arbitration. 5+5 10
Answer:-
Daisy chain arbitration:
Here, the
requesting device or devices assert the signal bus_request. The bus arbiter
returns the bus_grant signal, which passes through each of the devices which
can have access to the bus, as shown in figure below. Here, the
Q3 List and explain different types of
multiprocessor operating systems. 1+9 10
Answer:-
Three basic types of multiprocessor
operating systems are:
ü
Separate supervisors
ü
Master / slave
ü
Symmetric
Separate supervisors
In separate
Get fully solved assignment. Buy
online from website
online store
or
plz drop a mail with your sub
code
we will revert you within 2-3
hour or immediate
Charges rs 125/subject
if urgent then call us on 08791490301, 08273413412
Get fully solved assignment. Buy
online from website
online store
or
plz drop a mail with your sub
code
we will revert you within 2-3
hour or immediate
Charges rs 125/subject
if urgent then call us on 08791490301, 08273413412
DRIVE
SPRING
2018
PROGRAM
Master
of Science in Information Technology(MSc IT)
SEMESTER
2
SUBJECT
CODE & NAME
MIT207–
Data Base Management System(DBMS)
Assignment
Set - 1
1
Describe various types of attribute with reference to E-R model with suitable
example.
Answer: The entity-relationship (E-R) data
model based on a perception of real world that consists of a set of basic
objects called entities, and of relationships among these objects. It was
developed to facilitate database design by allowing the specification of an
enterprise schema, which represents the
2
What is database manager? Mention and describe the important responsibilities
of database manager
Answer: A database manager is a program module
which provides the interface between the low level data stored in the database
and the application programs and queries submitted to the system. It is
responsible for interfacing with file system. One of the functions of database
manager is to convert user's
3
Define catalog. What information is stored in the system catalogs?
Answer: A fundamental property of a database
system is that it maintains a description of all the data that it contains. A
relational DBMS maintains information about every relation and index that it
contains. The DBMS also maintains information about views, for which no tuples
are stored explicitly; rather, a definition of the view is stored and used to
compute the tuples that belong in the view when the
Assignment
Set - 2
1
Explain the following normal forms:
(a)
2 NF
(b)
3 NF
Answer:
Normalization is a database design
technique which organizes tables in a manner that reduces redundancy and
dependency of data.
It divides
2
List and explain the basic operations of Relational algebra.
Answer:
These are basic operator of relational algebra:
·
Union
(È)
·
Difference
( - )
·
Intersection
(Ç)
·
Cartesian
Product (x)
Union (È)
If we assume that P and Q
are two union-compatible relations, then the union of P and Q is set-theoretic
union of P and Q.
The resultant relation, R =
P U Q, has tuples drawn from P and Q such that
R = { t |Î
P v t Î Q }
3
Describe data distribution on the basis of benefits and drawbacks.
Answer: Benefits
of Data Distribution
Data
sharing and Distributed Control: If
a number of different sites are connected to each other, then a user at one site
may be able to access data that is available at another site. For example, in
the distributed banking system, it is possible for a user in one branch to
access data in another branch. Without this
Get fully solved assignment. Buy
online from website
online store
or
plz drop a mail with your sub
code
we will revert you within 2-3
hour or immediate
Charges rs 125/subject
if urgent then call us on 08791490301, 08273413412
Get fully solved assignment. Buy
online from website
online store
or
plz drop a mail with your sub
code
we will revert you within 2-3
hour or immediate
Charges rs 125/subject
if urgent then call us on 08791490301, 08273413412
DRIVE
SPRING
2018
PROGRAM
Master
of Science in Information Technology(MSc IT)
SEMESTER
2
SUBJECT
CODE & NAME
MIT208-
ANALYSIS AND DESIGN OF ALGORITHMS
Assignment
Set - 1
1
Define and explain recursive algorithm with suitable example.
Answer:
A recursive algorithm is
an algorithm which calls itself with "smaller (or simpler)" input
values, and which obtains the result for the current input by applying simple
operations to the returned value for the smaller (or simpler) input. More
generally if a problem can be solved utilizing solutions to smaller versions of
the same problem, and the smaller versions reduce to easily solvable cases,
then one can use a recursive algorithm to solve that problem
2
Explain the various types of basic efficiency classes with suitable examples.
Answer: Even though the efficiency analysis
framework puts together all the functions whose orders of growth differ by a
constant multiple, there are still infinitely many such classes. (For example,
the exponential functions an have different orders of growth for different
values of base a.)
3
Describe the procedure to perform Mergesort using suitable example.
Answer: Merge sort is a sorting technique based
on divide and conquers technique. With worst-case time complexity being Ο(n log
n), it is one of the most respected algorithms. While comparing two sublists
for merging, the first element of both lists is taken into consideration. While
sorting in ascending order, the
Assignment
Set - 2
1
What is meant by AVL tree? Discuss the four rotations in an AVL tree.
Answer: AVL tree is a self balanced binary
search tree. That means, an AVL tree is also a binary search tree but it is a
balanced tree. A binary tree is said to be balanced, if the difference between
the hieghts of left and right subtrees of every node in the tree is either -1,
0 or +1. In other words, a binary tree is said to be balanced
2
Describe Principle of Optimality. Explain the Knapsack problem with example.
Answer: The principle of optimality states that
an optimal sequence of decisions has the property that whatever the initial
state and decision are, the remaining decisions must constitute an optimal
decision sequence with regard to the state resulting from the first decision.
3
For NP – Hard problems explain an approximation algorithm.
Answer: Combinatorial optimization problems lie
within a finite but huge feasible region. In this section, we focus on finding
approximation algorithms for optimization problems that are NP-Hard.
Underlying
principles
An NP-Hard
Get fully solved assignment. Buy online
from website
online store
or
plz drop a mail with your sub
code
we will revert you within 2-3
hour or immediate
Charges rs 125/subject
if urgent then call us on 08791490301, 08273413412
Get fully solved assignment. Buy
online from website
online store
or
plz drop a mail with your sub
code
we will revert you within 2-3
hour or immediate
Charges rs 125/subject
if urgent then call us on 08791490301, 08273413412
DRIVE
SPRING
2018
PROGRAM
Master
of Science in Information Technology(MSc IT)
SEMESTER
2
SUBJECT
CODE & NAME
MIT209–
Data Communication and Networking
Assignment
Set - 1
1
What is meant by security in internet? Describe the four categories of network security
problems.
Answer:
Network security consists of the policies and practices adopted to prevent and monitor unauthorized access, misuse, modification, or denial of a computer network and network-accessible resources. Network security involves the authorization of access to data in a network
2
Explain the following:
a)
Character stuffing
b)
bit stuffing
Answer: a) Character
stuffing
This method gets around the
problem of synchronization after an error by having each frame start and end
with special bytes. This method operates on bytes. The special bytes are
reserved characters to
3
Explain the CSMA/CD protocol with suitable diagrams.
Answer: CSMA/CD
Protocol
In computer networking,
Carrier Sense Multiple Access with Collision Detection (CSMA/CD) is a network
control protocol in which a carrier sensing scheme is used. A transmitting data
station that detects another signal while transmitting a frame, stops
transmitting that frame, transmits a jam signal, and then waits for
Assignment
Set - 2
1
Explain the following routing algorithm:
(a)
Multidestination
(b)
Flooding
Answer: a. Routing is the process of selecting
a path for traffic in a network, or between or across multiple networks.
Routing is performed for many types of networks, including circuit-switched
networks, such as the public switched telephone network (PSTN), computer
networks, such as the Internet, as well as in networks used in public and
private transportation, such as the system of streets, roads, and
2
With the help of suitable diagram describe TCP protocol.
Answer: The TCP IP protocol suit can be considered
as a major step stone for communication network. Standards supported,
flexibility and application supported,
services provided for various application from user end .The Transmission
Control Protocol/Internet Protocol (TCP/IP) suite Uses standard
3
Mention and explain the different operations and responses with reference to Telnet
protocol.
Answer: There
are four modes of operation for most Telnet clients and servers.
1. Half-duplex: This is the default mode,
but rarely used today . The default NVT is a half duplex device that requires a
GO AHEAD (GA) from the server before accepting user input. The user input is
echoed locally from the Get fully solved assignment. Buy
online from website
online store
or
plz drop a mail with your sub
code
we will revert you within 2-3
hour or immediate
Charges rs 125/subject
if urgent then call us on 08791490301, 08273413412
acting dumb when you are really smart…lol.. we call that playing the fool to catch the wise
ReplyDeleteisc888
Thank you for allowing us to comment on this page.
ReplyDeleteufabet