A B+ tree index is to be built on the
Name attribute of the relation
STUDENT. Assume that all students
Names are of length 8 bytes, disk block
Are of size 512 bytes and index
Pointers are of size 4 bytes. Given this
Scenario what would be the best choice
Of the degree (i.e. the number of
Pointers per node) of the B+ tree ?

Dude... really? That's just a copy and paste. You know better, we're not going to give you the answer here. What have you gotten from your textbook and your notes? Show us how far you've gotten and we'll go from there. We're not going to do your work for you. IT is a disservice to you and your education.

The branch logic that provides making
Capabilities in the control unit is known
As
(A) Controlled transfer
(B) Conditional transfer
(C) Unconditional transfer
(D) None of the above

What is the number of colours required to
properly colour the vertices of every
planar graph ?

To be very precise, decryption and encryption of data are
the responsibility of which layer of ISO-OSI model ?

In which Routing Method do all the routers have a common database ?

Let me google that for you (http://lmgtfy.com/?q=+ISO-OSI+model)

Phase Shift Keying (PSK) Method is used to modulate digital signal at 9600 bps using 16 levels. Find the line signals and speed (i.e. modulation rate).

Which of the following metric does not depend on the programming language used ?

(A) Lines of code
(B) Function count
(C) Member of token
(D) All of the above

Check sum used along with each packet computes the sum of the data, where data is treated as a sequence of

(A) Integer
(B) Character
(C) Real numbers
(D) Bits

To reiterate my previous comments on your questions.

What do YOU think ?
While we're happy to HELP we wont do all the work for you.
Show us what you have done and where you are having problems..