Download CUSTOMER_CODE SMUDE DIVISION_CODE SMUDE

CUSTOMER_CODE
SMUDE
DIVISION_CODE
SMUDE
EVENT_CODE
Jan2017
ASSESSMENT_CODE MIT102_Jan2017
QUESTION_TYPE
DESCRIPTIVE_QUESTION
QUESTION_ID
12139
QUESTION_TEXT
Explain the 2 types of magnetic disks. Discuss the way of
organizing data on magnetic disk.
SCHEME OF
EVALUATION
There are two types of disks: the hard disk & the floppy disk.
1.Hard Disk: Divided into 2 groups ,the disk & the fixed disks
-Disk pack contains………protective sulfaces
-Disk packs are easily ……….gigabytes
-Disk cartridges are …..standard disk packs.(1 mark each 1*3=3
marks))
-Fixed disks: (2 marks)
2.Floppy disks: They come in several sizes………density.
Organizing data on disk:
Before data ………sectors (1 mark)
Tracks: Concentric rings….consecutive number (2 marks)
Sectors: Each track ……..entire track. (2 marks)
QUESTION_TYPE
DESCRIPTIVE_QUESTION
QUESTION_ID
73331
QUESTION_TEXT
Give an account of types of mass storage devices
SCHEME OF
EVALUATION
Floppy disks: Relatively slow and have a small capacity, but they are
portable, inexpensive, and universal.
* Hard disks: Very fast and with more capacity than floppy disks, but
also more expensive. Some hard disk systems are portable (removable
cartridges), but most are not.
* Optical disks: Unlike floppy and hard disks, which use
electromagnetism to encode data, optical disk systems use a laser to
read and write data. Optical disks have very large storage capacity, but
they are not as fast as hard disks. In addition, the inexpensive optical
disk drives are read-only. Read/write varieties are expensive.
* Tapes: Relatively inexpensive and can have very large storage
capacities, but they do not permit random access of data.
QUESTION_TYPE
DESCRIPTIVE_QUESTION
QUESTION_ID
120231
QUESTION_TEXT
What is static hashing? Explain linear hashing.
SCHEME OF
EVALUATION
Static hashing
Static hashing is a simple form of hashing, where hashing is the technique use
mathematical functions to sort incoming data in a speedy and organized
fashion. Hashing involves a hashing function, which accepts a piece of
incoming data and assigns to that data a specific value; based on that value
the data is stored away in a table. Static hashing is a simple form of hashing
often used for a temporary solution, until a better form of hashing such as
linear hashing or extendible hashing can be used. Its advantage is its relative
simplicity compared to other types of hashing. Here hashing is called static
because the number of buckets is static, meaning that the number is
determined first and remains constant throughout the assembly and use of
hash.
A simple example of hash function is h(x)=xmod N. this means that the
remainder of x divided by N is what is returned. Once this hash value has been
determined, the whole piece of data is then sorted into a bucket with a
number of other data entries with the same hash value. These buckets usually
have a static size as well and they each have overflow buckets in case the first
bucket gets full.
To locate a particular item, the search information provided is passed through
the hash function again, so the search is quickly narrowed down to roughly
1/N of the total pieces of data that might otherwise be searched. The defect in
static hashing is the fact that the number of buckets remain static. This means
that if all the values tend to produce one particular hash value, all of the data
records will go to one bucket, not saving much time. Other methods of
hashing allow for the creation of new buckets on the fly, which can be
assigned more specific hash values to break down a clump of data. Static
hashing is good for speedy data. (5 marks)
Linear hashing
Linear Hashing is a dynamically updateable disk-based index structure
which implements a hashing scheme and which grows or shrinks one
bucket at a time. The index is used to support exact match queries, i.e.
find the record with a given key. Linear hashing does not use a bucket
directory, and when an overflow occurs it is not always the overflow
bucket that is split. The name linear hashing is used because the number
of buckets grows or shrinks in a linear fashion. Overflows are handled by
creating a chain of pages under the overflow bucket. The hashing
function changes dynamically and at any given instant there can be at
most two hashing functions used by the scheme. Some of the main points
that summarize linear hashing are; Full buckets are not necessarily split,
and buckets split are not necessarily full. Every bucket will be split
sooner or later and so all Overflows will be reclaimed and rehashed.
Split points s decides which bucket to split and s is independent to
overflowing bucket and at level i , s is between 0 and 2i. s will be
incremented at each point if it reaches end it will be reset to 0. (5 marks)
QUESTION_TYPE DESCRIPTIVE_QUESTION
QUESTION_ID
120233
QUESTION_TEXT Define linked list. Explain the types of linked lists.
Linked list is a linear collection of data elements called nodes. Each node is
divided into two parts: The first part is called data field where the data are
stored and the second part is called the link field or next field, contains the
address of the next node in the list. (2 Marks)
1.
Doubly linked list
In some situation we need to traverse both forward and backward of a linked
list (1 Mark)
He linked list with this property needs two link field one point to the next node
is called next link field and the another to point the previous node is called
previous link field (1 Mark)
Here first nodes previous link field and last nodes
Next link field are marked as null (1 Mark)
SCHEME OF
EVALUATION
The following fig. shows the structure of Doubly linked list (1 Marks)
2.
Circularly linked list
Circularly linked list is the one where the null pointer in the last node is
replaced with the address of the first node so that it forms a circle. (1 Marks)
The advantage to this circular linked list is easy accessibility of node is
accessible from a given node (1 Marks)
The following fig. shows a singly circular list where the link at the last node is
points to the first node (1 Marks)
The following fig. shows a Doubly circular list where the last nodes Next link
points to the first node and first node previous link point to the last node and
makes a circle (1 Marks)
QUESTION_TYPE DESCRIPTIVE_QUESTION
QUESTION_ID
120235
QUESTION_TEXT Explain Adjacency matrix and incidence matrix.
SCHEME OF
EVALUATION
Adjacency matrix
It is a two dimensional Boolean matrix to store the information about graph
nodes
(1 mark)
Here the rows and columns represent source and destination vertices and
entries between the vertices associated with that row and
column
(1 mark)
The values of matrix are either 0 or 1
(1 mark)
Suppose if a graph G consists of V1, V2, V3, V4, V5 vertices then the adjacency
matrix A=[aij] of the graph G is the n×n matrix and can be defined as aij=1 if Vi
in adjacent to Vj
Aij=0 if there is no edge between Vi and Vj
(2 marks)
Incidence matrix:
It is two-dimensional matrix, in which the rows represent the vertices and
columns represent the edges
(1 mark)
The entries in an array indicate if both are related to each other through
edges
(1 mark)
The value of the matrix are given as -1, 0 or 1
(1 mark)
If the Kth edge is (Vi Vj) then the kth column has a value in ith row, -1 in the jth
row and 0 elsewhere
(2 marks)
QUESTION_TYPE
DESCRIPTIVE_QUESTION
QUESTION_ID
120237
Define binary tree. Explain the different types of binary tree.
QUESTION_TEXT
SCHEME OF EVALUATION Define (1 mark)
Types
1.
2.
3.
Skewed binary tree (Explain 3)
Full binary tree (Explain 3)
Complete binary tree (Explain 3)