Given an open address hash table with load factor a < 1, the expected number of probes in a successful search is (A) Atmost 1/α ln (1-α/α) (B) Atmost 1/α ln (1/1-α) (C) Atleast 1/α ln (1/1-α) (D) Atleast 1/α ln (α/1-α)

Given an open address hash table with load factor a < 1, the expected number of probes in a successful search is

(A) Atmost 1/α ln (1-α/α)

(B) Atmost 1/α ln (1/1-α)

(C) Atleast 1/α ln (1/1-α)

(D) Atleast 1/α ln (α/1-α)
by

1 Answer

Answer :

(B) Atmost 1/α ln (1/1-α)
by

Related questions

If h is chosen from a universal collection of hash functions and is used to hash n keys into a table of size m, where n ≤ m, the expected number of collisions involving a particular key K is (A) less than 1 (B) less than lg n (C) greater than 1 (D) greater than lg n

Description : If h is chosen from a universal collection of hash functions and is used to hash n keys into a table of size m, where n ≤ m, the expected number of collisions involving a particular key K is (A) less than 1 (B) less than lg n (C) greater than 1 (D) greater than lg n

Last Answer : (A) less than 1

If h is chosen from a universal collection of hash functions and is used to hash n keys into a table of size m, where n≤m, the expected number of collisions involving a particular key x is less than ................... (1) 1 (2) 1/n (3) 1/m (4) n/m

Description : If h is chosen from a universal collection of hash functions and is used to hash n keys into a table of size m, where n≤m, the expected number of collisions involving a particular key x is less than ................... (1) 1 (2) 1/n (3) 1/m (4) n/m

Last Answer : Answer: 1

Consider the following database table : Create table test( one integer, two integer, primary key(one), unique(two), check(one≥1 and ≤10), check(two≥1 and ≤5) ); How many data records/tuples atmost can this table contain ? (A) 5 (B) 10 (C) 15 (D) 50

Description : Consider the following database table : Create table test( one integer, two integer, primary key(one), unique(two), check(one≥1 and ≤10), check(two≥1 and ≤5) ); How many data records/tuples atmost can this table contain ?  (A) 5 (B) 10 (C) 15 (D) 50

Last Answer : (A) 5 

In ……………, search start at the beginning of the list and check every element in the list. A) Linear search B) Binary search C) Hash Search D) Binary Tree search

Description : In ……………, search start at the beginning of the list and check every element in the list. A) Linear search B) Binary search C) Hash Search D) Binary Tree search

Last Answer : A) Linear search

Consider a hash table of size m=100 and the hash function h(k) = floor(m(kA mod 1)) for A = (√5 − 1)/2 = 0.618033. Compute the location to which the key k = 123456 is placed in hash table. (A) 77 (B) 82 (C) 88 (D) 89

Description : Consider a hash table of size m=100 and the hash function h(k) = floor(m(kA mod 1)) for A = (√5 − 1)/2 = 0.618033. Compute the location to which the key k = 123456 is placed in hash table. (A) 77 (B) 82 (C) 88 (D) 89

Last Answer : (C) 88

What is called as transposition table? a) Hash table of next seen positions b) Hash table of previously seen positions c) Next value in the search d) None of the mentioned

Description : What is called as transposition table? a) Hash table of next seen positions b) Hash table of previously seen positions c) Next value in the search d) None of the mentioned

Last Answer : b) Hash table of previously seen positions

For any B-tree of minimum degree t ≥2, every node other than the root must have atleast ............... keys and every node can have at most .............. keys. (A) t-1, 2t+1 (B) t+1, 2t+1 (C) t-1, 2t-1 (D) t+1, 2t-1

Description : For any B-tree of minimum degree t ≥2, every node other than the root must have atleast ............... keys and every node can have at most .............. keys. (A) t-1, 2t+1 (B) t+1, 2t+1 (C) t-1, 2t-1 (D) t+1, 2t-1

Last Answer : (C) t-1, 2t-1 

Division operation is ideally suited to handle queries of the type : (A) customers who have no account in any of the branches in Delhi. (B) customers who have an account at all branches in Delhi. (C) customers who have an account in atleast one branch in Delhi. (D) customers who have only joint account in any one branch in Delhi

Description : Division operation is ideally suited to handle queries of the type : (A) customers who have no account in any of the branches in Delhi. (B) customers who have an account at all branches in Delhi. ( ... atleast one branch in Delhi. (D) customers who have only joint account in any one branch in Delhi

Last Answer : (B) customers who have an account at all branches in Delhi. 

A computer program selects an integer in the set {k : 1 ≤ k ≤ 10,00,000} at random and prints out the result. This process is repeated 1 million times. What is the probability that the value k = 1 appears in the printout atleast once ? (A) 0.5 (B) 0.704 (C) 0.632121 (D) 0.68

Description : A computer program selects an integer in the set {k : 1 ≤ k ≤ 10,00,000} at random and prints out the result. This process is repeated 1 million times. What is the probability that the value k = 1 appears in the printout atleast once ? (A) 0.5 (B) 0.704 (C) 0.632121 (D) 0.68

Last Answer : (C) 0.632121

Which of the following is used to make an Abstract class ? (A) Making atleast one member function as pure virtual function (B) Making atleast one member function as virtual function (C) Declaring as Abstract class using virtual keyword (D) Declaring as Abstract class using static keyword

Description : Which of the following is used to make an Abstract class ? (A) Making atleast one member function as pure virtual function (B) Making atleast one member function as virtual function (C) Declaring as Abstract class using virtual keyword (D) Declaring as Abstract class using static keyword

Last Answer : (A) Making atleast one member function as pure virtual function

The hash function used in double hashing is of the form: (A) h(k, i)=(h1(k)+h2(k)+i)mod m (B) h(k, i)=(h1(k)+h2(k)-i)mod m (C) h(k, i)=(h1(k)+ih2(k))mod m (D) h(k, i)=(h1(k)-ih2(k))mod m

Description : The hash function used in double hashing is of the form: (A) h(k, i)=(h1(k)+h2(k)+i)mod m (B) h(k, i)=(h1(k)+h2(k)-i)mod m (C) h(k, i)=(h1(k)+ih2(k))mod m (D) h(k, i)=(h1(k)-ih2(k))mod m

Last Answer : Answer: C

For every context free grammar (G) there exists an algorithm that passes any w ∈ L(G) in number of steps proportional to (A) ln|w| (B) |w| (C) |w|2 (D) |w|3

Description : For every context free grammar (G) there exists an algorithm that passes any w ∈ L(G) in number of steps proportional to (A) ln|w| (B) |w| (C) |w|2 (D) |w|3

Last Answer : (D) |w|3

…………….. is the complex search criteria in the where clause. A) Substring B) Drop Table C) Predict D) Predicate

Description : …………….. is the complex search criteria in the where clause. A) Substring B) Drop Table C) Predict D) Predicate

Last Answer : D) Predicate

The virtual address generated by a CPU is 32 bits. The Translation Lookaside Buffer (TLB) can hold total 64 page table entries and a 4-way set associative (i.e. with 4- cache lines in the set). The page size is 4 KB. The minimum size of TLB tag is (A) 12 bits (B) 15 bits (C) 16 bits (D) 20 bits

Description : The virtual address generated by a CPU is 32 bits. The Translation Lookaside Buffer (TLB) can hold total 64 page table entries and a 4-way set associative (i.e. with 4- cache lines in the set). The page size is 4 KB. The minimum size of TLB tag is (A) 12 bits (B) 15 bits (C) 16 bits (D) 20 bits

Last Answer : (C) 16 bits Explanation: VirtualAddress = 32 bits PageSize = 4KB = 12 bits therefore : VPNTag = 20 bits, OffsetTag = 12 bits TLBEntryLength = VPNTag = 20 bits TotalTLBEntries = 64, 4-way implies ... therefore : TLBIndex = 4 bits TLBTag = TLBEntryLength - TLBIndex = 20 - 4 = 16 bits

A ______________ is diagram that depicts the flow of a program. a) Algorithm b) Hash Table c) Graph d) Flowchart

Description : A ______________ is diagram that depicts the flow of a program. a) Algorithm b) Hash Table c) Graph d) Flowchart

Last Answer : Answer: d Explanation: A flowchart is a diagram that helps us determine the flow of the program. Other options are irrelevant

Q.What is the major advantage of a hash table?

Description : Q.What is the major advantage of a hash table?

Last Answer : The major advantage of a hash table is its speed. Because the hash function is to take a range of key values and transform them into index values in such a way that the key values are distributed randomly across all the indices of a hash table.

A fuzzy set A on R is ................. iff A(λx1 + (1 – λ)x2) ≥ min [A(x1), A(x2)] for all x1, x2 ∈ R and all λ ∈ [0, 1], where min denotes the minimum operator. (A) Support (B) α-cut (C) Convex (D) Concave

Description : A fuzzy set A on R is ................. iff A(λx1 + (1 – λ)x2) ≥ min [A(x1), A(x2)] for all x1, x2 ∈ R and all λ ∈ [0, 1], where min denotes the minimum operator. (A) Support (B) α-cut (C) Convex (D) Concave 

Last Answer : (C) Convex 

Which is the correct statement(s) for Non Recursive predictive parser? S1: First(α) = {t | α => * t β for some string β } => *tβ S2: Follow(X) = { a | S => * αXa β for some strings α and β } (A) Both statements S1 and S2 are incorrect. (B) S1 is incorrect and S2 is correct. (C) S1 is correct and S2 is incorrect. (D) Both statements S1 and S2 are correct.

Description : Which is the correct statement(s) for Non Recursive predictive parser? S1: First(α) = {t | α => * t β for some string β } => *tβ S2: Follow(X) = { a | S => * αXa β for some strings ... and S2 is correct. (C) S1 is correct and S2 is incorrect. (D) Both statements S1 and S2 are correct. 

Last Answer : (D) Both statements S1 and S2 are correct.

Consider the following statements: (a) Depth - first search is used to traverse a rooted tree. (b) Pre - order, Post-order and Inorder are used to list the vertices of an ordered rooted tree. (c) Huffman's algorithm is used to find an optimal binary tree with given weights. (d) Topological sorting provides a labelling such that the parents have larger labels than their children. Which of the above statements are true ? (A) (a) and (b) (B) (c) and (d) (C) (a) , (b) and (c) (D) (a), (b) , (c) and (d)

Description : Consider the following statements: (a) Depth - first search is used to traverse a rooted tree. (b) Pre - order, Post-order and Inorder are used to list the vertices of an ordered rooted tree. (c) Huffman's algorithm is used to find an optimal ... (d) (C) (a) , (b) and (c) (D) (a), (b) , (c) and (d)

Last Answer : (D) (a), (b) , (c) and (d)

Which of the following statements is false? (A) Optimal binary search tree construction can be performed efficiently using dynamic programming. (B) Breadth-first search cannot be used to find connected components of a graph. (C) Given the prefix and postfix walks of a binary tree, the tree cannot be reconstructed uniquely. (D) Depth-first-search can be used to find the components of a graph. (1) A (2) B (3) C (4) D

Description : Which of the following statements is false? (A) Optimal binary search tree construction can be performed efficiently using dynamic programming. (B) Breadth-first search cannot be used to find connected components of a graph. (C) ... used to find the components of a graph. (1) A (2) B (3) C (4) D 

Last Answer : Answer: 2

Given a Non-deterministic Finite Automation (NFA) with states p and r as initial and final states respectively transition table as given below Image The minimum number of states required in Deterministic Finite Automation (DFA) equivalent to NFA is (A) 5 (B) 4 (C) 3 (D) 2

Description : Given a Non-deterministic Finite Automation (NFA) with states p and r as initial and final states respectively transition table as given below  The minimum number of states required in Deterministic Finite Automation (DFA) equivalent to NFA is (A) 5 (B) 4 (C) 3 (D) 2

Last Answer : (C) 3 

Five jobs A, B, C, D and E are waiting in Ready Queue. Their expected runtimes are 9, 6, 3, 5 and x respectively. All jobs entered in Ready queue at time zero. They must run in ............. order to minimize average response time if 3 < x < 5. (A) B, A, D, E, C (B) C, E, D, B, A (C) E, D, C, B, A (D) C, B, A, E, D

Description : Five jobs A, B, C, D and E are waiting in Ready Queue. Their expected runtimes are 9, 6, 3, 5 and x respectively. All jobs entered in Ready queue at time zero. They must run in ............. order to minimize average response time if 3 < ... , C (B) C, E, D, B, A (C) E, D, C, B, A (D) C, B, A, E, D

Last Answer : (B) C, E, D, B, A

I have three envelopes, into one of them I put a $20 note. I lay the envelopes out on a table in front of me and allow you to pick one envelope. You hold but do not open this envelope. I then take one of the envelopes from the table, demonstrate to you that it was empty, screw it up and throw it away. The question is would you rather stick with the envelope you have selected or exchange it for the one on the table. Why? What would be the expected value to you of the exchange? -Riddles

Description : I have three envelopes, into one of them I put a $20 note. I lay the envelopes out on a table in front of me and allow you to pick one envelope. You hold but do not open this envelope. I then ... it for the one on the table. Why? What would be the expected value to you of the exchange? -Riddles

Last Answer : The answer might seem a little counter intuitive at first but we'll see... The short answer is that it is in your advantage to exchange. But why? Well initially there was a 1/3 chance that you were holding ... /3 of $20 and afterwards you will have 2/3 of $20, ie the advantage to you is about $6.66

The given maximization assignment problem can be converted into a minimization problem by (A) subtracting each entry in a column from the maximum value in that column. (B) subtracting each entry in the table from the maximum value in that table. (C) adding each entry in a column from the maximum value in that column. (D) adding maximum value of the table to each entry in the table.

Description : The given maximization assignment problem can be converted into a minimization problem by (A) subtracting each entry in a column from the maximum value in that column. (B) subtracting each entry in the table ... value in that column. (D) adding maximum value of the table to each entry in the table.

Last Answer : (B) subtracting each entry in the table from the maximum value in that table.

For the implementation of a paging scheme, suppose the average process size be x bytes, the page size be y bytes, and each page entry requires z bytes. The optimum page size that minimizes the total overhead due to the page table and the internal fragmentation loss is given by (A) x/2 (B) xz/2 (C) √2xz (D) (√xz)/2

Description : For the implementation of a paging scheme, suppose the average process size be x bytes, the page size be y bytes, and each page entry requires z bytes. The optimum page size that minimizes the total overhead due to the page ... fragmentation loss is given by (A) x/2 (B) xz/2 (C) √2xz (D) (√xz)/2

Last Answer : (C) √2xz 

The number of comparisons done by sequential search is ……………… A) (N/2)+1 B) (N+1)/2 C) (N-1)/2 D) (N+2)/2

Description : The number of comparisons done by sequential search is ……………… A) (N/2)+1 B) (N+1)/2 C) (N-1)/2 D) (N+2)/2

Last Answer : B) (N+1)/2

................ is used in game trees to reduce the number of branches of the search tree to be traversed without affecting the solution. (A) Best first search (B) Goal stack planning (C) Alpha-beta pruning procedure (D) Min-max search

Description : ................ is used in game trees to reduce the number of branches of the search tree to be traversed without affecting the solution. (A) Best first search (B) Goal stack planning (C) Alpha-beta pruning procedure (D) Min-max search

Last Answer : (C) Alpha-beta pruning procedure

What does the following command do? grep −vn “abc” x (A) It will print all of the lines in the file x that match the search string “abc” (B) It will print all of the lines in file x that do not match the search string “abc” (C) It will print total number of lines in the file x that match the search string “abc” (D) It will print the specific line numbers of the file x in which there is a match for string “abc”

Description : What does the following command do? grep −vn abc x (A) It will print all of the lines in the file x that match the search string abc (B) It will print all of the lines in file x that do not ... (D) It will print the specific line numbers of the file x in which there is a match for string abc

Last Answer : (A) It will print all of the lines in the file x that match the search string “abc”

The number of disk pages access in B-tree search, where h is height, n is the number of keys, and t is the minimum degree, is: (A) θ(logn h*t) (B) θ(logt n*h) (C) θ(logh n) (D) θ(logt n)

Description : The number of disk pages access in B-tree search, where h is height, n is the number of keys, and t is the minimum degree, is: (A) θ(logn h*t) (B) θ(logt n*h) (C) θ(logh n) (D) θ(logt n)

Last Answer : Answer: D

Suppose that we have numbers between 1 and 1000 in a binary search tree and want to search for the number 364. Which of the following sequences could not be the sequence of nodes examined? (A) 925, 221, 912, 245, 899, 259, 363, 364 (B) 3, 400, 388, 220, 267, 383, 382, 279, 364 (C) 926, 203, 912, 241, 913, 246, 364 (D) 3, 253, 402, 399, 331, 345, 398, 364

Description : Suppose that we have numbers between 1 and 1000 in a binary search tree and want to search for the number 364. Which of the following sequences could not be the sequence of nodes examined? (A) 925, 221, 912, 245, 899, ... 926, 203, 912, 241, 913, 246, 364 (D) 3, 253, 402, 399, 331, 345, 398, 364 

Last Answer : (C) 926, 203, 912, 241, 913, 246, 364

The order of a leaf node in a B+ tree is the maximum number of children it can have. Suppose that block size is 1 kilobytes, the child pointer takes 7 bytes long and search field value takes 14 bytes long. The order of the leaf node is ............ (1) 16 (2) 63 (3) 64 (4) 65

Description : The order of a leaf node in a B+ tree is the maximum number of children it can have. Suppose that block size is 1 kilobytes, the child pointer takes 7 bytes long and search field value takes 14 bytes long. The order of the leaf node is ............ (1) 16 (2) 63 (3) 64 (4) 65

Last Answer : Answer: All

In the given figure, YZ is parallel to MN, XY is parallel is LM and XZ is parallel to LN. Then MY is -Maths 9th

Description : In the given figure, YZ is parallel to MN, XY is parallel is LM and XZ is parallel to LN. Then MY is -Maths 9th

Last Answer : answer:

The inductance of a coaxial cable with inner radius a and outer radius b, from a distance d, is given by a) L = μd ln(b/a)/2π b) L = 2π μd ln(b/a) c) L = πd/ln(b/a) d) L = 0

Description : The inductance of a coaxial cable with inner radius a and outer radius b, from a distance d, is given by a) L = μd ln(b/a)/2π b) L = 2π μd ln(b/a) c) L = πd/ln(b/a) d) L = 0

Last Answer : a) L = μd ln(b/a)/2π

The potential of a uniformly charged line with density λ is given by, λ/(2πε) ln(b/a). State True/False. a) True b) False

Description : The potential of a uniformly charged line with density λ is given by, λ/(2πε) ln(b/a). State True/False. a) True b) False

Last Answer : a) True

Concentration of the limiting reactant (with initial concentration of a moles/litre) after time t is (a-x). Then 't' for a first order reaction is given by (A) k. t = ln a/(a - x) (B) k. t = x/a (a - x) (C) k. t = ln (a - x)/a (D) k. t = ln a (a - x)/x

Description : Concentration of the limiting reactant (with initial concentration of a moles/litre) after time t is (a-x). Then 't' for a first order reaction is given by (A) k. t = ln a/(a - x) (B) k. t = x/a (a - x) (C) k. t = ln (a - x)/a (D) k. t = ln a (a - x)/x

Last Answer : (A) k. t = ln a/(a - x)

For an ideal gas, the chemical potential is given by (A) RT d ln P (B) R d ln P (C) R d ln f (D) None of these

Description : For an ideal gas, the chemical potential is given by (A) RT d ln P (B) R d ln P (C) R d ln f (D) None of these

Last Answer : (A) RT d ln P

For a real gas, the chemical potential is given by (A) RT d ln P (B) RT d ln f (C) R d ln f (D) None of these

Description : For a real gas, the chemical potential is given by (A) RT d ln P (B) RT d ln f (C) R d ln f (D) None of these

Last Answer : (B) RT d ln f

The free energy change for a chemical reaction is given by (where, K = equilibrium constant) (A) RT ln K (B) -RT ln K (C) -R ln K (D) T ln K

Description : The free energy change for a chemical reaction is given by (where, K = equilibrium constant) (A) RT ln K (B) -RT ln K (C) -R ln K (D) T ln K

Last Answer : (B) -RT ln K

The expression for entropy change given by, ΔS = - nR ln (P2/P1), holds good for (A) Expansion of a real gas (B) Reversible isothermal volume change (C) Heating of an ideal gas (D) Cooling of a real gas

Description : The expression for entropy change given by, ΔS = - nR ln (P2/P1), holds good for (A) Expansion of a real gas (B) Reversible isothermal volume change (C) Heating of an ideal gas (D) Cooling of a real gas

Last Answer : (B) Reversible isothermal volume change

At equilibrium condition, the chemical potential of a material in different phases in contact with each other is equal. The chemical potential for a real gas (μ) is given by (where, μ = standard chemical potential at unit fugacity (f° = 1 atm.) and the gas behaves ideally.) (A) μ° + RT ln f (B) μ°+ R ln f (C) μ° + T ln f (D) μ° + R/T ln f

Description : At equilibrium condition, the chemical potential of a material in different phases in contact with each other is equal. The chemical potential for a real gas (μ) is given by (where, μ = standard chemical potential at unit fugacity (f° = 1 atm. ... (B) μ°+ R ln f (C) μ° + T ln f (D) μ° + R/T ln f

Last Answer : (A) μ° + RT ln f

The expression for entropy change given by, ΔS = nR ln (V2/V1) + nCvln (T2/T1) is valid for (A) Reversible isothermal volume change (B) Heating of a substance (C) Cooling of a substance (D) Simultaneous heating and expansion of an ideal gas

Description : The expression for entropy change given by, ΔS = nR ln (V2/V1) + nCvln (T2/T1) is valid for (A) Reversible isothermal volume change (B) Heating of a substance (C) Cooling of a substance (D) Simultaneous heating and expansion of an ideal gas

Last Answer : (D) Simultaneous heating and expansion of an ideal gas

The molar excess Gibbs free energy, gE, for a binary liquid mixture at T and P is given by, (gE/RT) = A . x1. x2, where A is a constant. The corresponding equation for ln y1, where y1is the activity co-efficient of component 1, is (A) A . x22 (B) Ax1 (C) Ax2 (D) Ax12

Description : The molar excess Gibbs free energy, gE, for a binary liquid mixture at T and P is given by, (gE/RT) = A . x1. x2, where A is a constant. The corresponding equation for ln y1, where y1is the activity co-efficient of component 1, is (A) A . x22 (B) Ax1 (C) Ax2 (D) Ax12

Last Answer : (A) A . x22

The thickness of oxide film is y at time t. If K1, K2 and K3 are the temperature dependent constants, the parabolic law of oxidation is given by (A) y2 = 2k1t + k2 (B) y = k1 ln (k2t + k3) (C) y = k1 t + k2 (D) y = k1t3 + k2

Description : The thickness of oxide film is y at time t. If K1, K2 and K3 are the temperature dependent constants, the parabolic law of oxidation is given by (A) y2 = 2k1t + k2 (B) y = k1 ln (k2t + k3) (C) y = k1 t + k2 (D) y = k1t3 + k2

Last Answer : Option A

A pointer can hold A) Single address at a time B) Two addresses at a time C) Number of addresses at a time D) No address

Description : A pointer can hold A) Single address at a time B) Two addresses at a time C) Number of addresses at a time D) No address

Last Answer : A) Single address at a time

The combination of ……………. And ………….. is often termed the local address of the local portion of the IP address. A) Network number and host number B) Network number and subnet number C) Subnet number and host number D) All of the above

Description : The combination of ……………. And ………….. is often termed the local address of the local portion of the IP address. A) Network number and host number B) Network number and subnet number C) Subnet number and host number D) All of the above

Last Answer : C) Subnet number and host number

The combination of ........... and ............ is often termed the local address or the local portion of the IP Address. A) Network number and host number B) Network number and subnet number C) Subnet number and host number.

Description : The combination of ........... and ............ is often termed the local address or the local portion of the IP Address. A) Network number and host number B) Network number and subnet number C) Subnet number and host number.

Last Answer : C) Subnet number and host number.

IPv4 and IPv6 are addresses used to identify computers on the internet. Find the correct statement out of the following: (A) Number of bits required for IPv4 address is more than number of bits required for IPv6 address. (B) Number of bits required for IPv4 address is same as number of bits required for IPv6 address. (C) Number of bits required for IPv4 address is less than number of bits required for IPv6 address. (D) Number of bits required for IPv4 address is 64.

Description : IPv4 and IPv6 are addresses used to identify computers on the internet. Find the correct statement out of the following: (A) Number of bits required for IPv4 address is more than number of bits required for ... of bits required for IPv6 address. (D) Number of bits required for IPv4 address is 64. 

Last Answer : (C) Number of bits required for IPv4 address is less than number of bits required for IPv6 address.

In the indexed scheme of blocks to a file, the maximum possible size of the file depends on: (A) The number of blocks used for index, and the size of index (B) Size of Blocks and size of Address (C) Size of Index (D) Size of Block

Description : In the indexed scheme of blocks to a file, the maximum possible size of the file depends on: (A) The number of blocks used for index, and the size of index (B) Size of Blocks and size of Address (C) Size of Index (D) Size of Block

Last Answer : (A) The number of blocks used for index, and the size of index

Which of the following is/are restriction(s) in classless addressing ? (A) The number of addresses needs to be a power of 2. (B) The mask needs to be included in the address to define the block. (C) The starting address must be divisible by the number of addresses in the block. (D) All of the above

Description : Which of the following is/are restriction(s) in classless addressing ? (A) The number of addresses needs to be a power of 2. (B) The mask needs to be included in the address to define the block. (C) The starting address must be divisible by the number of addresses in the block. (D) All of the above

Last Answer : (D) All of the above

The combination of an IP address and a port number is known as ................... (A) network number (B) socket address (C) subnet mask number (D) MAC address

Description : The combination of an IP address and a port number is known as ................... (A) network number (B) socket address (C) subnet mask number (D) MAC address

Last Answer : (B) socket address