Download CUSTOMER_CODE SMUDE DIVISION_CODE SMUDE

CUSTOMER_CODE
SMUDE
DIVISION_CODE
SMUDE
EVENT_CODE
APR2016
ASSESSMENT_CODE MCA2050_APR2016
QUESTION_TYPE
DESCRIPTIVE_QUESTION
QUESTION_ID
17526
QUESTION_TEXT
Explain First generation to Fifth generation computer.
SCHEME OF
EVALUATION
1. First generation computer: The first generation of computer ( 19461954) was marked by the use of vacuum tubes or values as their basic
electronic component. They were very large in size. They consumed too
much power and generated too much heat, when used for even short
duration of time. Some example of first generation computers are
ENIAC, EDVAC, EDSAC, UNIVAC-I
2. Second Generation computers: The second generation of computers
(1953-64) was marked by the use of transistors in place of vacuum tubes.
The second – generation computers were smaller in size and generated
less heat than first generation computers. Although they were slightly
faster and more reliable than earlier computer. They also had many
disadvantages. They had limited storage capacity, consumed more power
and were also relatively slow in performance. Some examples of second
generation computers are IBM 701, and IBM 650.
3. Third Generation Computer: The third generation of computer
(1964-1978) was marked by use of Integrated Circuits(IC) in place of
transistors. As hundred of transistors could be put on a single small
circuit, so IC were more compact than transistors. The third generation
computers were even smaller in size, very less heat generated and
required very less power as compared to earlier two generation of
computers. These computers required less human labour at the assembly
stage. Some examples of third generation computers are IBM 360, PDP8, Cray -1 and VAX.
4. Fourth Generation Computers: The fourth generation of
computers(1978-till date) was marked by use of large-scale Integrated
(LSI) circuits in place of ICs. LSI circuits are still more compact than
ICs. In 1978, it was found that millions of components could be packed
onto a single circuit, known as Very Large Scale Integration(VLSI).
VLSI is the latest technology of computer that led to the development of
the popular Personal Computer(PCs) also called as
Microcomputers.Example of fourth generation computers are IBM PC,
IBM PC/AT, 386, 486, Pentium and CRAY-2
5. Fifth Generation Computer: The fifth generation computers are still
under research and development stage. These computers would have
artificial intelligence. They will use USLI chips in place of VLSI chips.
One USLI chip contains millions of components on a single IC. Robots
have some features of fifth generation computers.
QUESTION_TYPE
DESCRIPTIVE_QUESTION
QUESTION_ID
17527
QUESTION_TEXT
What is embedded system? Give one example for embedded system.
Explain characteristics of embedded computers.
An embedded computer is a computer system designed to perform a
particular unction or task. It is embedded as component of a bigger
complete device. Embedded system contain microcontroller dedicated to
complete device.
Microwave, washing machines, air conditioners, printers are examples of
embedded systems.
SCHEME OF
EVALUATION
Characteristics of embedded computers:
1. Real-time performance: The performance requisite in a embedded
application is real – time execution. Speed though in varying degrees, is
an important factor in all architectures. The ability to assure real-time
performance acts as a constraint on the speed needs of the system. Realtime performance means that the agent is assured to perform within
certain time restraints as specified by the task and the environment.
2. Soft real – time: In a number of applications, a more advanced
requisite exists: the standard time for a particular job is constrained and
the number of occurrences when the maximum time is exceeded. Such
techniques are occasionally called soft real – time and they occur when it
is possible to sometimes miss the time limitation on an incident,
provided that not plenty of them are missed.
3. Need to minimize memory size: Memory can be a considerable
element of the system cost. Thus, it is vital to limit the memory size
according to the requirement.
4. Need to minimize memory power: Larger memory also means high
power need. Emphasis on low power is made by the use of batteries.
Unnecessary usage of power needs to be avoided to keep the power need
low.
QUESTION_TYPE
DESCRIPTIVE_QUESTION
QUESTION_ID
73362
QUESTION_TEXT
What is multithreading? Give three examples of Multithreading
supported operating system. What are the tasks and benefits of
multithreading system?
Multithreading is the capability of a processor to do multiple things at
one time. And it is a type of multitasking.
SCHEME OF
EVALUATION
Examples of Multithreading supported operating system are:
1.
Windows XP
2.
Solaris
3.
Linux
4.
OS/2
Tasks of multithreading system:
a.
Manage inputs from many windows and devices
b.
Distinguish tasks of varying priority
c.
Allow the user interface to remain responsive all the
time
d.
Allocate time to the background tasks
Benefits of Multithreading system:
a.
Threads advance the communication between different execution
traces as the same user address space is shared
b.
In an existing process, creating a new thread is much
less
time-consuming than creating a brand-new
process
c.
Termination of thread also takes less time
d.
Control switching among two threads within a same
process
takes less time than switching between two processes.
QUESTION_TYPE
DESCRIPTIVE_QUESTION
QUESTION_ID
125202
QUESTION_TEXT
What you mean by RAID? Explain different RAID levels RAID 1,
RAID 3, RAID 5.
RAID is the acronym for ‘redundant array of inexpensive disks’. There
are several approaches to redundancy that have different overhead and
performance. The Patterson, Gibson, and Katz 1987 paper introduced
the term RAID. (1 mark)
RAID 1
SCHEME OF
EVALUATION
Mirroring or shadowing is the traditional solution to disk failure. It uses
twice as many disks. Data is simultaneously written on two disks, one
non-redundant and one redundant disk so that there are two copies of
the data. The system goes to the mirror disk in case one disk fails to get
the required information. This technique is the most expensive
solution…. (3 marks)
RAID 3
Bit-Interleaved parity is an error detection technique where character
bit patterns are forced into parity so the total number of one(1) bit is
always odd or even. This is done by adding a “1” or “0” bit to each byte
as the character/byte is transmitted. At the other end of the
transmission the parity is checked for accuracy. BIP is also a method
used at the physical layer (high speed transmission of binary data) level
to monitor errors…… (3 marks)
RAID 5
This level uses the same ratio of disks (data disks and check disks) as
RAID 3, but data is accessed differently. In the prior organisation every
access went to all disks. Some applications would prefer to do smaller
accesses, allowing independent accesses to occur in parallel. That is the
purpose of this next RAID level…..
(3 marks)
QUESTION_TYPE
DESCRIPTIVE_QUESTION
QUESTION_ID
125203
QUESTION_TEXT
Explain Flynn classification of the computer system.
1.
Single instruction Single Data.
2.
Single instruction Multiple Data.
SCHEME OF EVALUATION 3.
Multiple instruction Single Data.
4.
Multiple instruction Multiple Data
(2.5 marks for each)
QUESTION_TYPE
DESCRIPTIVE_QUESTION
QUESTION_ID
125205
QUESTION_TEXT
Explain the features of Fine-Grained SIMD Architecture. How MPP algorithm
operates?
SCHEME OF
EVALUATION
The features of fine-grained architecture:
Complexity is minimal and the degree of autonomy is lowest feasible in
each Processing Element (PE).
Economic constraints are applicable on the maximum number of PEs
provided.
It is assumed by the programming model that there is equivalence
between the number of PEs and the number of data items, and hides
any mismatch as far as possible.
The 4-connected nearest neighbour mesh is used as the basic
interconnection method.
A simple extension of a sequential language with parallel-data additions
is the usual programming language
(5 Marks)
The MPP algorithm operates as follows:
For each pixel in one of the images (the reference image) a local
neighbourhood area is defined. This is correlated with the similar area
surrounding each of the candidate match pixels in the second image.
The measure applied is the normalised mean and variance cross
correlation function. The candidate yielding the highest correlation is
considered to be the best match, and the locations of the pixels in the
two images are compared to produce the disparity value at that point
of the reference image.
The algorithm is iterative. It begins at low resolution, that is, with large
areas of correlation around each of a few pixels. When the first pass is
complete, the test image is geometrically warped according to the
disparity map.
The process is then repeated with a higher resolution (usually reducing
the correlation area. and increasing the number of computed matches,
by a factor of two), a new disparity map is calculated and a new
warping applied, and so on.
The procedure is continued either for a predetermined number of
passes or until some quality criterion is exceeded.
(5 Marks)