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

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
by

1 Answer

Answer :

(A) The number of blocks used for index, and the size of index
by

Related questions

In ............ allocation method for disk block allocation in a file system, insertion and deletion of blocks in a file is easy. (A) Index (B) Linked (C) Contiguous (D) Bit Map

Description : In ............ allocation method for disk block allocation in a file system, insertion and deletion of blocks in a file is easy. (A) Index (B) Linked (C) Contiguous (D) Bit Map

Last Answer : (B) Linked

Which of the following statements is not true about disk-arm scheduling algorithms ? (A) SSTF (shortest seek time first) algorithm increases performance of FCFS. (B) The number of requests for disk service are not influenced by file allocation method. (C) Caching the directories and index blocks in main memory can also help in reducing disk arm movements. (D) SCAN and C-SCAN algorithms are less likely to have a starvation problem.

Description : Which of the following statements is not true about disk-arm scheduling algorithms ? (A) SSTF (shortest seek time first) algorithm increases performance of FCFS. (B) The number of requests for disk ... arm movements. (D) SCAN and C-SCAN algorithms are less likely to have a starvation problem.

Last Answer : (B) The number of requests for disk service are not influenced by file allocation method.

Which of the following information about the UNIX file system is not correct? (A) Super block contains the number of i-nodes, the number of disk blocks, and the start of the list of free disk blocks. (B) An i-node contains accounting information as well as enough information to locate all the disk blocks that holds the file’s data. (C) Each i-node is 256-bytes long. (D) All the files and directories are stored in data blocks.

Description : Which of the following information about the UNIX file system is not correct? (A) Super block contains the number of i-nodes, the number of disk blocks, and the start of the list of free disk blocks. (B ... Each i-node is 256-bytes long. (D) All the files and directories are stored in data blocks. 

Last Answer : (C) Each i-node is 256-bytes long.

A unix file system has 1-KB blocks and 4-byte disk addresses. What is the maximum file size if i-nodes contain 10 direct entries and one single, double and triple indirect entry each? (A) 32 GB (B) 64 GB (C) 16 GB (D) 1 GB

Description : A unix file system has 1-KB blocks and 4-byte disk addresses. What is the maximum file size if i-nodes contain 10 direct entries and one single, double and triple indirect entry each? (A) 32 GB (B) 64 GB (C) 16 GB (D) 1 GB

Last Answer : (C) 16 GB

................. maintains the list of free disk blocks in the Unix file system. (A) I-node (B) Boot block (C) Super block (D) File allocation table

Description : ................. maintains the list of free disk blocks in the Unix file system. (A) I-node (B) Boot block (C) Super block (D) File allocation table

Last Answer : (C) Super block 

The advantage of ............... is that it can reference memory without paying the price of having a full memory address in the instruction. (A) Direct addressing (B) Indexed addressing (C) Register addressing (D) Register Indirect addressing

Description : The advantage of ............... is that it can reference memory without paying the price of having a full memory address in the instruction. (A) Direct addressing (B) Indexed addressing (C) Register addressing (D) Register Indirect addressing

Last Answer : (D) Register Indirect addressing

A UNIX file system has 1 KB block size and 4-byte disk addresses. What is the maximum file size if the inode contains ten direct block entries, one single indirect block entry, one double indirect block entry and one triple indirect block entry? (A) 30 GB (B) 64 GB (C) 16 GB (D) 1 GB

Description : A UNIX file system has 1 KB block size and 4-byte disk addresses. What is the maximum file size if the inode contains ten direct block entries, one single indirect block entry, one double indirect block entry and one triple indirect block entry? (A) 30 GB (B) 64 GB (C) 16 GB (D) 1 GB

Last Answer : (C) 16 GB

Which one of the following is not an addressing mode? (A) Register indirect (B) Auto increment (C) Relative indexed (D) Immediate operand

Description : Which one of the following is not an addressing mode? (A) Register indirect (B) Auto increment (C) Relative indexed (D) Immediate operand

Last Answer : (C) Relative indexed

The ............... addressing mode is similar to register indirect addressing mode, except that an offset is added to the contents of the register. The offset and register are specified in the instruction. (A) Base indexed (B) Base indexed plus displacement (C) Indexed (D) Displacement

Description : The ............... addressing mode is similar to register indirect addressing mode, except that an offset is added to the contents of the register. The offset and register are specified in the instruction. (A) Base indexed (B) Base indexed plus displacement (C) Indexed (D) Displacement

Last Answer : (D) Displacement

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

A virtual memory has a page size of 1K words. There are eight pages and four blocks. The associative memory page table contains the following entries: Image Which of the following list of virtual addresses (in decimal) will not cause any page fault if referenced by the CPU? (A) 1024, 3072, 4096, 6144 (B) 1234, 4012, 5000, 6200 (C) 1020, 3012, 6120, 8100 (D) 2021, 4050, 5112, 7100

Description : A virtual memory has a page size of 1K words. There are eight pages and four blocks. The associative memory page table contains the following entries:  Which of the following list of virtual addresses (in ... 1234, 4012, 5000, 6200 (C) 1020, 3012, 6120, 8100 (D) 2021, 4050, 5112, 7100

Last Answer : Answer: C Explanation: The pages which are not in main memory are: 1020 will not cause page fault (1024-2047) 3012 will not cause page fault (3072-4095) 6120 will not cause page fault (4096-5119) 8100 will not cause page fault (6144-7167)

On which factors do the size of block depends in classless addressing? a. Nature & size of an entity b. Number of addresses c. Availability of the address space d. All of the above

Description : On which factors do the size of block depends in classless addressing? a. Nature & size of an entity b. Number of addresses c. Availability of the address space d. All of the above

Last Answer : a. Nature & size of an entity

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

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 

What is Oracle Block? Can two Oracle Blocks have the same address?

Description : What is Oracle Block? Can two Oracle Blocks have the same address?

Last Answer : Oracle formats the database files into a number of Oracle blocks when they are first created-making it easier for the RDBMS software to manage the files and easier to read data into the memory areas ... at 1. Two blocks can have the same block address if they are in different database files.

The master list of an indexed file A. is sortedin ascending order B. containsonly a list of keys and record numbers C. has a number assigned toeach record D. both (b)and (c) E. None of the above

Description : The master list of an indexed file A. is sortedin ascending order B. containsonly a list of keys and record numbers C. has a number assigned toeach record D. both (b)and (c) E. None of the above

Last Answer : has a number assigned toeach record

The physical location of arecord isdetermined bya mathematical formula that transforms a file key into a record location in A. a tree file B. an indexed file C. a hashedfile D. a sequential file E. None of the above

Description : The physical location of arecord isdetermined bya mathematical formula that transforms a file key into a record location in A. a tree file B. an indexed file C. a hashedfile D. a sequential file E. None of the above

Last Answer : a hashedfile

If the Disk head is located initially at track 32, find the number of disk moves required with FCFS scheduling criteria if the disk queue of I/O blocks requests are: 98, 37, 14, 124, 65, 67 (A) 320 (B) 322 (C) 321 (D) 319

Description : If the Disk head is located initially at track 32, find the number of disk moves required with FCFS scheduling criteria if the disk queue of I/O blocks requests are: 98, 37, 14, 124, 65, 67 (A) 320 (B) 322 (C) 321 (D) 319

Last Answer : (C) 321

A memory management system has 64 pages with 512 bytes page size. Physical memory consists of 32 page frames. Number of bits required in logical and physical address are respectively: (1) 14 and 15 (2) 14 and 29 (3) 15 and 14 (4) 16 and 32

Description : A memory management system has 64 pages with 512 bytes page size. Physical memory consists of 32 page frames. Number of bits required in logical and physical address are respectively: (1) 14 and 15 (2) 14 and 29 (3) 15 and 14 (4) 16 and 32

Last Answer : (3) 15 and 14

Code blocks allow many algorithms to be implemented with the following parameters : (A) clarity, elegance, performance (B) clarity, elegance, efficiency (C) elegance, performance, execution (D) execution, clarity, performance

Description : Code blocks allow many algorithms to be implemented with the following parameters : (A) clarity, elegance, performance (B) clarity, elegance, efficiency (C) elegance, performance, execution (D) execution, clarity, performance

Last Answer : (B) clarity, elegance, efficiency

Consider the following statements : (a) Boolean expressions and logic networks correspond to labelled acyclic digraphs. (b) Optimal Boolean expressions may not correspond to simplest networks. (c) Choosing essential blocks first in a Karnaugh map and then greedily choosing the largest remaining blocks to cover may not give an optimal expression. Which of these statement(s) is/ are correct? (A) (a) only (B) (b) only (C) (a) and (b) (D) (a), (b) and (c)

Description : Consider the following statements : (a) Boolean expressions and logic networks correspond to labelled acyclic digraphs. (b) Optimal Boolean expressions may not correspond to simplest networks. (c) Choosing essential blocks first in a Karnaugh map ... (b) only (C) (a) and (b) (D) (a), (b) and (c)

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

Which of the following graphic primitives are considered as the basic building blocks of computer graphics ? (a) Points (b) Lines (c) Polylines (d) Polygons Codes : (A) (a) only (B) (a) and (b) (C) (a), (b) and (c) (D) (a), (b), (c) and (d)

Description : Which of the following graphic primitives are considered as the basic building blocks of computer graphics ? (a) Points (b) Lines (c) Polylines (d) Polygons Codes : (A) (a) only (B) (a) and (b) (C) (a), (b) and (c) (D) (a), (b), (c) and (d)

Last Answer : Answer: B

How much space will be required to store the bit map of a 1.3 GB disk with 512 bytes block size ? (A) 332.8 KB (B) 83.6 KB (C) 266.2 KB (D) 256.6 KB

Description : How much space will be required to store the bit map of a 1.3 GB disk with 512 bytes block size ? (A) 332.8 KB (B) 83.6 KB (C) 266.2 KB (D) 256.6 KB

Last Answer : (A) 332.8 KB

Which of the following statements is FALSE about weak entity set ? (A) Weak entities can be deleted automatically when their strong entity is deleted. (B) Weak entity set avoids the data duplication and consequent possible inconsistencies caused by duplicating the key of the strong entity. (C) A weak entity set has no primary keys unless attributes of the strong entity set on which it depends are included. (D) Tuples in a weak entity set are not partitioned according to their relationship with tuples in a strong entity set.

Description : Which of the following statements is FALSE about weak entity set ? (A) Weak entities can be deleted automatically when their strong entity is deleted. (B) Weak entity set avoids the data ... weak entity set are not partitioned according to their relationship with tuples in a strong entity set.

Last Answer : (D) Tuples in a weak entity set are not partitioned according to their relationship with tuples in a strong entity set.

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

Repository of information gathered from multiple sources, storing under unified scheme at a single site is called as (A) Data mining (B) Meta data (C) Data warehousing (D) Database

Description : Repository of information gathered from multiple sources, storing under unified scheme at a single site is called as (A) Data mining (B) Meta data (C) Data warehousing (D) Database

Last Answer : (C) Data warehousing

The Software Maturity Index (SMI) is defined as SMI = [Mf – (Fa + Fc + Fd)] / Mf Where Mf = the number of modules in the current release. Fa = the number of modules in the current release that have been added. Fc = the number of modules in the current release that have been changed. Fd = the number of modules in the current release that have been deleted. The product begins to stabilize when (A) SMI approaches 1 (B) SMI approaches 0 (C) SMI approaches -1 (D) None of the above

Description : The Software Maturity Index (SMI) is defined as SMI = [Mf - (Fa + Fc + Fd)] / Mf Where Mf = the number of modules in the current release. Fa = the number of modules in the current release that have ... (A) SMI approaches 1 (B) SMI approaches 0 (C) SMI approaches -1 (D) None of the above

Last Answer : (A) SMI approaches 1 

The refractive index of the material of a glass prism depends upon (a) The angle of the prism (b) The intensity of the incident light ray (c) The colour of the incident light ray (d) Size of the prism

Description : The refractive index of the material of a glass prism depends upon (a) The angle of the prism (b) The intensity of the incident light ray (c) The colour of the incident light ray (d) Size of the prism

Last Answer : Ans:(c)

Set of L-dimensional blocks called the _______of the vector quantizer. a. Group b. Codebook c. Coding d. Index

Description : Set of L-dimensional blocks called the _______of the vector quantizer. a. Group b. Codebook c. Coding d. Index

Last Answer : b. Codebook

The performance of data communications network depends on .............. A) Number of users B) The hardware and software C) The transmission D) All of the above

Description : The performance of data communications network depends on .............. A) Number of users B) The hardware and software C) The transmission D) All of the above

Last Answer : D) All of the above

If S1 is total number of modules defined in the program architecture, S3 is the number of modules whose correct function depends on prior processing then the number of modules not dependent on prior processing is: (A) 1 + S3/S1 (B) 1 - S3/S1 (C) 1 + S1/S3 (D) 1 - S1/S3

Description : If S1 is total number of modules defined in the program architecture, S3 is the number of modules whose correct function depends on prior processing then the number of modules not dependent on prior processing is: (A) 1 + S3/S1 (B) 1 - S3/S1 (C) 1 + S1/S3 (D) 1 - S1/S3

Last Answer : (B) 1 - S3/S1

Assuming that the disk head is located initially at 32, find the number of disk moves required with FCFS if the disk queue of I/O block requests are 98, 37, 14, 124, 65, 67: (A) 310 (B) 324 (C) 320 (D) 321

Description : Assuming that the disk head is located initially at 32, find the number of disk moves required with FCFS if the disk queue of I/O block requests are 98, 37, 14, 124, 65, 67: (A) 310 (B) 324 (C) 320 (D) 321

Last Answer : (D) 321

Consider a disk queue with request for input/output to block on cylinders 98, 183, 37, 122, 14, 124, 65, 67 in that order. Assume that disk head is initially positioned at cylinder 53 and moving towards cylinder number 0. The total number of head movements using Shortest Seek Time First (SSTF) and SCAN algorithms are respectively (A) 236 and 252 cylinders (B) 640 and 236 cylinders (C) 235 and 640 cylinders (D) 235 and 252 cylinders

Description : Consider a disk queue with request for input/output to block on cylinders  98, 183, 37, 122, 14, 124, 65, 67  in that order. Assume that disk head is initially positioned at cylinder 53 and moving ... and 252 cylinders (B) 640 and 236 cylinders (C) 235 and 640 cylinders (D) 235 and 252 cylinders

Last Answer : Answer: 236 and 208 cylinders Explanation: SSTF Initial head position =53 The closest queue to initial head position=65 head moves from 53 to 65=12 head moves from 65 to 67=2 head moves from 67 ... 122=24 head moves from 122 to 124=2 head moves from 124 to 183=59 Total head movement=208 

Which of the following conditions does not hold good for a solution to a critical section problem ? (A) No assumptions may be made about speeds or the number of CPUs. (B) No two processes may be simultaneously inside their critical sections. (C) Processes running outside its critical section may block other processes. (D) Processes do not wait forever to enter its critical section.

Description : Which of the following conditions does not hold good for a solution to a critical section problem ? (A) No assumptions may be made about speeds or the number of CPUs. (B) No two processes ... critical section may block other processes. (D) Processes do not wait forever to enter its critical section.

Last Answer : (C) Processes running outside its critical section may block other processes. 

Loop unrolling is a code optimization technique: (A) that avoids tests at every iteration of the loop (B) that improves performance by decreasing the number of instructions in a basic block. (C) that exchanges inner loops with outer loops (D) that reorders operations to allow multiple computations to happen in parallel.

Description : Loop unrolling is a code optimization technique: (A) that avoids tests at every iteration of the loop (B) that improves performance by decreasing the number of instructions in a basic block. ... loops with outer loops (D) that reorders operations to allow multiple computations to happen in parallel.

Last Answer : (A) that avoids tests at every iteration of the loop

Maximum font size in HTML is ........... A) 6 B) 7 C) 5 D) 8

Description : Maximum font size in HTML is ........... A) 6 B) 7 C) 5 D) 8

Last Answer : B) 7

Four bits are used for packed sequence numbering in a sliding window protocol used in a computer network. What is the maximum window size ? (A) 4 (B) 8 (C) 15 (D) 16

Description : Four bits are used for packed sequence numbering in a sliding window protocol used in a computer network. What is the maximum window size ?  (A) 4 (B) 8 (C) 15 (D) 16

Last Answer : (C) 15 

In a fast Ethernet cabling, 100 Base-TX uses ........... cable and maximum segment size is ............ (A) twisted pair, 100 metres (B) twisted pair, 200 metres (C) fibre optics, 1000 metres (D) fibre optics, 2000 metres

Description : In a fast Ethernet cabling, 100 Base-TX uses ........... cable and maximum segment size is ............ (A) twisted pair, 100 metres (B) twisted pair, 200 metres (C) fibre optics, 1000 metres (D) fibre optics, 2000 metres

Last Answer : (A) twisted pair, 100 metres

The maximum size of the data that the application layer can pass on to the TCP layer below is ......... (1) 216 bytes (2) 216 bytes + TCP header length (3) 216 bytes - TCP header length (4) 215 bytes

Description : The maximum size of the data that the application layer can pass on to the TCP layer below is ......... (1) 216 bytes (2) 216 bytes + TCP header length (3) 216 bytes - TCP header length (4) 215 bytes

Last Answer : Answer: Marks to all

What makes a universal kinfe block different from other knife blocks?

Description : What makes a universal kinfe block different from other knife blocks?

Last Answer : Unlike normal knfe blocks, universal knife blocks have no slots to hold the knives. Since the block has no slots it can hold several knives of different sizes and shapes.

A block P released from the top of a smooth inclined plane slides down the plane. Another block Q is dropped from the same point and falls vertically downwards. Which one of the following statements will be true if the friction offered by air is negligible? (a) Both blocks will reach the ground at the same time (b) Block P will reach the ground earlier than block Q (c) Both blocks will reach the ground with the same speed (d) Block Q will reach the ground with a higher speed than block P

Description : A block P released from the top of a smooth inclined plane slides down the plane. Another block Q is dropped from the same point and falls vertically downwards. Which one of the following statements will be ... with the same speed (d) Block Q will reach the ground with a higher speed than block P

Last Answer : Ans:(c)

The action ‘STACK(A, B)’ of a robot arm specify to _______________ a) Place block B on Block A b) Place blocks A, B on the table in that order c) Place blocks B, A on the table in that order d) Place block A on block B

Description : The action ‘STACK(A, B)’ of a robot arm specify to _______________ a) Place block B on Block A b) Place blocks A, B on the table in that order c) Place blocks B, A on the table in that order d) Place block A on block B

Last Answer : d) Place block A on block B

In _____coding, we divideour message into blocks, each of k bits, called ___. A) block; blockwords B) linear; datawords C) block; datawords D) none of the above

Description : In _____coding, we divideour message into blocks, each of k bits, called ___. A) block; blockwords B) linear; datawords C) block; datawords D) none of the above

Last Answer : block; datawords

We add r redundant bits to each block to make the length n = k + r. The resulting n-bit blocks are called _________ A. datawords B. blockwords C. codewords D. none of the above

Description : We add r redundant bits to each block to make the length n = k + r. The resulting n-bit blocks are called _________ A. datawords B. blockwords C. codewords D. none of the above

Last Answer : C. codewords

Pick up the incorrect statement from the following: In a dry dock block made of hard wood, (A) Spacing of the blocks is 1.35 m (B) The lowest block is 1.8 m long 40 cm × 40 cm in cross-section (C) The middle block is 1.6 m long 40 cm × 40 cm in cross-section (D) None of these

Description : Pick up the incorrect statement from the following: In a dry dock block made of hard wood, (A) Spacing of the blocks is 1.35 m (B) The lowest block is 1.8 m long 40 cm × 40 cm in cross-section (C) The middle block is 1.6 m long 40 cm × 40 cm in cross-section (D) None of these

Last Answer : (D) None of these

What is shielding in NMR? A. Using a curved piece of metal to block an opponent’s attack B. Putting metal around an Rf source C. When the magnetic moment of an atom blocks the full induced magnetic field from surrounding nuclei D. Blocking parts of a molecule from Rf radiation

Description : What is shielding in NMR? A. Using a curved piece of metal to block an opponent’s attack B. Putting metal around an Rf source C. When the magnetic moment of an atom blocks the full induced magnetic field from surrounding nuclei D. Blocking parts of a molecule from Rf radiation

Last Answer : When the magnetic moment of an atom blocks the full induced magnetic field from surrounding nuclei

A block of weight 20 kg slides with an initial velocity of 2 m sec down an inclined plane on to a spring of stiffness 10 kg/cm. If the co--efficient of friction is 0.2, angle ? = 30 the ratio of maximum compession of spring, neglecting friction to that while considering friction would be a.More than one b.One c.Less than one d.Depends on the stiffness of spring e.None of the above

Description : A block of weight 20 kg slides with an initial velocity of 2 m sec down an inclined plane on to a spring of stiffness 10 kg/cm. If the co--efficient of friction is 0.2, angle ? = 30 the ratio of ... be a.More than one b.One c.Less than one d.Depends on the stiffness of spring e.None of the above

Last Answer : a. More than one

……………….. contains information that defines valid values that are stored in a column or data type. A) View B) Rule C) Index D) Default

Description : ……………….. contains information that defines valid values that are stored in a column or data type. A) View B) Rule C) Index D) Default

Last Answer : C) Index