كل مايخص الحاسوب والبرامج (كمبيوتر -اندرويد) برمجة وغيرها – Telegram
كل مايخص الحاسوب والبرامج (كمبيوتر -اندرويد) برمجة وغيرها
1.26K subscribers
243 photos
4 videos
765 files
177 links
لكل ما يخص الحاسوب
Download Telegram
In ordered Files Record insertion is quite efficient
Anonymous Quiz
51%
T
49%
F
مرفق لكم سوال الصح والخطاء في نموذج الاختبار النصفي للاستاذه سعاد عثمان

☝️☝️☝️☝️
⭕️⭕️⭕️⭕️
various overflow locations are kept, usually by extending the array with a number of overflow positions:
Anonymous Quiz
26%
Open addressing
57%
Chaining
16%
Multiple hashing
distributes data transparently over multiple disks to make them appear as a single large, fast disk.
Anonymous Quiz
36%
Data distributed
43%
Data striping
21%
Data collection
If record size R=2 bytes

block size B=4096 bytes r=12288 records, The number of file blocks is
Anonymous Quiz
53%
6
43%
6144
5%
1000
مرفق لكم اسئلة الاختيارات الموجوده في نموذج الامتحان النصفي للاستاذه سعاد عثمان


بالتوفيق لكم جميعا
⭕️⭕️⭕️⭕️

جميع اوراق الامتحان تبعكم عندي الذي يريد يتاكد من حله وليش نقص في مادة الاستاذه سعاد يعمل لي رساله اصورها له ويوم الامتحان بجيب الاوراق معي واسلمها لكم

⭕️⭕️⭕️⭕️
A disk pack contains several magnetic disks connected to a rotating spindle
Anonymous Quiz
90%
T
10%
F
In ordered Files Record Insertion is quite efficient
Anonymous Quiz
35%
T
65%
F
In linear hashing the directory is a binary tree
Anonymous Quiz
37%
T
63%
F
Linear hashing does require an overflow area but does not use a directory
Anonymous Quiz
74%
T
26%
F
A dense index has index entries for only some of the search values
Anonymous Quiz
38%
T
62%
F
In a B+tree, all pointers to data records exists at the leaf-level nodes
Anonymous Quiz
71%
T
29%
F
Reading or writing a disk block is time consuming because of the seek time
Anonymous Quiz
87%
T
13%
F
Collisions occur when a new record hashes to a bucket that is already fuill
Anonymous Quiz
78%
T
22%
F