In the index allocation scheme of blocks to a file, the maximum possible size of the file depends on
-
Solution
Indexing. Indexing means pointing or referencing objects with sequential numbers.
e.g., In a library, books are arranged according to numbers,and they are referred to or sorted by numbers, this is called indxing.
Dynamic linking can cause security concerns because
-
Solution
In Dynamic linking security problem occur. To avoid security problem We use cryptographic because due to this data are error free.
Which of the following is true?
-
Solution
L is recursive means TM for L accepts all words in L and rejects all words not in L. So, just by changing the accept to reject and vice verse we get a TM for L'.Thus L' must also be recursive.
The smallest finite automaton which accepts the language{x | length of xis divisible by 3} has
-
Solution
A weight-balanced tree is a binary tree in which for each node, the number of nodes in the left sub tree is at least half and at most twice the number of nodes in the right subtree. The maximum possible height (number of nodes on the path from the root to the furthest leaf) of such a tree on n nodes is best described by which of the following?
-
Solution
Left subtree is at least half node of the right subtree* twice the number of nodes from the right subtree.or maximum possible height = log2 n
The running time of the following algorithm Procedure A(n) If n <= 2 return(1) else return \(\left ( \left \lceil \sqrt{n} \right \rceil \right )\) is best described by
The number of leaf nodes in a rooted tree of n nodes, with each node having 0 or 3 children is
-
Solution
Consider the following declaration of a two dimensional array in C:char a [ 100] [ 100];Assuming that the main memory is byte- addressable and that the array is stored starting from memory address 0,the address of a [40][50] is
-
Solution
a [40] [100] where [40] stands for row number.[50] stands for column, then address of a [40] [50] = 4050
0 - 39 - 40 × 100 = \(\overline{4000}\)
=0 – 49 → 50
4050
Horizontal micro programming
-
Solution
In horizontal microprogramming the instruction size is less as compared to vertical micro programming. So, there is no need for decoding.
But, one bit is used for all control signals to execute the micro instruction. If the bit is set to '1' the control signal field is activated. If the bit is set to '0' the control signal field is deactivated.
Thus, option (d) is correct.
A B+-tree index is to be built on the Name attribute of the relation STUDENT. Assume that all student names are of length 8 bytes, disk block are 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 BB+-tree
-
Solution