Testbook Logo
Exams SuperCoaching Test Series Skill Academy
More

Question

Download Solution PDF

Suppose there are six files F1, F2, F3, F4, F5, F6 with corresponding sizes 150 KB, 225 KB, 75 KB, 60 KB, 275 KB and 65 KB respectively. The files are to be stored on a sequential device in such a way that optimizes access time. In what order should the files be stored?

This question was previously asked in
UGC NET Computer Science (Paper 2) Nov 2017 Official Paper
Attempt Online
View all UGC NET Papers >
  1. F5, F2, F1, F3, F6, F4
  2. F4, F6, F3, F1, F2, F5
  3. F1, F2, F3, F4, F5, F6
  4. F6, F5, F4, F3, F2, F1

Answer (Detailed Solution Below)

Option 2 : F4, F6, F3, F1, F2, F5
Free Tests
View all Free tests >
Free
UGC NET Paper 1: Held on 21st August 2024 Shift 1
10.9 K Users
50 Questions 100 Marks 60 Mins
Start Now

Detailed Solution

Download Solution PDF

The correct answer is option 2.

Key Points

Six files are stored in a sequential device. It is like an optimal merge pattern. To get optimum access time, first, sort all the files according to their sizes. For sorting it will take worst case O(N log N) but will give the optimal result. Select the two files which are minimal in size.

Merging files required m + n - 1 comparisons.

Merge

F1 Raju Shraddha 07.04.2020 D14 1

Total number of comparisons 125 + 200 + 300 + 400 + 500 = 1525 and the order is F4, F6, F3, F1, F2, F5.

∴ Hence the correct answer is F4, F6, F3, F1, F2, F5.

Shortcut Trick

Sort the files based on size in ascending order

Download Solution PDF
Latest UGC NET Updates

Last updated on Jun 12, 2025

-> The UGC NET June 2025 exam will be conducted from 25th to 29th June 2025.

-> The UGC-NET exam takes place for 85 subjects, to determine the eligibility for 'Junior Research Fellowship’ and ‘Assistant Professor’ posts, as well as for PhD. admissions.

-> The exam is conducted bi-annually - in June and December cycles.

-> The exam comprises two papers - Paper I and Paper II. Paper I consists of 50 questions and Paper II consists of 100 questions. 

-> The candidates who are preparing for the exam can check the UGC NET Previous Year Papers and UGC NET Test Series to boost their preparations.

More Greedy Algorithms Questions

Q1.Which among the following statement(s) is(are) FALSE? A. Greedy best‐first search is not optimal but is often efficient. B. A* is complete and optimal provided h(n) is admissible or consistent. C. Recursive best‐first search is efficient in terms of time complexity but poor in terms of space complexity. D. h(n) = 0 is an admissible heuristic for the 8‐puzzle.
Q2.Given below are some famous algorithms and some algorithm design paradigms Algorithms Design Paradigm  1. Dijkstra's shortest path algorithms  (a) Greedy design  2. Floyd-Warshall's all-pair-shortest path algorithms  (b) Divide and conquer  3. Kruskal's minimum spanning tree algorithm  (c) Dynamic programming  4. Merge Sort algorithm     Which of the following correspondence is correct?
Q3.The Prim's algorithm for finding the minimum spanning tree is based on _______ approach.
Q4.Let in a file the frequency of letters i, n, d, e, x are 16, 7, 17, 25, 20 respectively. Which of the following is the Huffman's code of the letter 'x'?
Q5.If b is the branching factor and m is the maximum depth of the search tree, what is the space complexity of greedy search ?  
Q6.A text is made up of the characters a, b, c, d, e each occurring with the probability 0.11, 0.40, 0.16, 0.09 and 0.24 respectively. The optimal Huffman coding technique will have the average length of :
Q7.Suppose there are six files F1, F2, F3, F4, F5, F6 with corresponding sizes 150 KB, 225 KB, 75 KB, 60 KB, 275 KB and 65 KB respectively. The files are to be stored on a sequential device in such a way that optimizes access time. In what order should the files be stored?
Q8.Six files F1, F2, F3, F4, F5 and F6 have 100, 200, 50, 80, 120, 150 records respectively. In what order should they be stored so as to optimize act. Assume each file is accessed with the same frequency 
Q9.Which of the following compression algorithms is used to generate a .png file?
Q10.Consider the string abbccddeee. Each letter in the string must be assigned a binary code satisfying the following properties: 1. For any two letters, the code assigned to one letter must not be a prefix of the code assigned to the other letter. 2. For any two letters of the same frequency, the letter which occurs earlier in the dictionary order is assigned a code whose length is at most the length of the code assigned to the other letter. Among the set of all binary code assignments which satisfy the above two properties, what is the minimum length of the encoded string? 

More Algorithm Design Techniques Questions

Q1.Which one of the diagrams is used to start / stop in a flowchart?
Q2.Which of the following is/are NOT CORRECT statement? (A) The first record in each block of the data file is known as actor record. (B) Dense index has index entries for every search key value in the data file. (C) Searching is harder in the B+ tree than B- tree as the all external nodes linked to each other. (D) In extendible hashing the size of directory is just an array of 2d-1, where d is global depth. Choose the correct answer from the options given below:
Q3.Which of the following is not a palindromic subsequence of the string “ababcdabba” ? 
Q4.2-3-4 trees are B - trees of order 4. They are isometric of _____ trees.
Q5.A. If some NP-complete problem P is in ℙ that ℙ = ℕℙ B. TSP is in ℕℙ C. SAT is in ℕℙ D. Hamilton circuit problem is not NP-complete Choose the correct answer from the options given below: 
Q6.A B-tree used as an index for a large database table has four levels including the root node. If a new key is inserted in this index, then maximum number of nodes that could be newly created in the process is
Q7.The total cost of retrieving records in sorted order using an unclustered B+ tree is (P-Average number of records per data page N-Data pages F-Ratio of the size of a data entry to the size of a data record) 
Q8.Match List I with List II LIST - I LIST - II A. Dijkstra's Algorithm I. Calculates path matrix B. Prim's Algorithm II. Stores minimum cost edge C. Warshall's Algorithm III. Stores the total cost from a source node to the current node D. Kruskal's algorithm IV. Finds Minimum Spanning Tree Choose the correct answer from the options given below: 
Q9.Circuit satisfiability problem: Given a Boolean combinatorial circuit composed of AND, OR and NOT gates, is it satisfiable? A one output Boolean combinatorial circuit is satisfiable means for the given inputs the output will be 1. A. The circuit satisfiability problem belongs to class NP B. The circuit satisfiability problem is at least as hard as any language in NP C. The circuit satisfiability is NP - Complete D. The size of the circuit is Θ(K2 + 1) E. If P ≠ NP, this situation would contradict the NP - Completeness of the problem. Choose the correct answer from the options given below:
Q10.The A* algorithm is optimal when, 
Crack CUET PG with
India's Super Teachers
Explore Supercoaching For FREE
Suggested Exams
Exam-Logo
UGC NET

UGC NET Important Links

More Algorithms Questions

Q1.______ is a pictorial representation of solving a problem
Q2.Which one of the diagrams is used to start / stop in a flowchart?
Q3.Match the following: List I List II 1. Dijkstra's algorithm i. Backtracking 2. Merge sort ii. Dynamic programming 3. Traveling Salesman Problem (approximate) iii. Greedy algorithm 4. N-Queens Problem iv. Divide and conquer
Q4.Match the following Question: List I List II A. Insertion sort I. T(n) = 2T(n/2) + O(n) B. Heap sort II. T(n) = T(n/2) + k C. Merge sort III. T(n) = T(n − 1) + log2(n) D. Binary search IV. T(n) = T(n-1) + n
Q5.Adjacent elements are compared and swapped in ________ sorting technique.
Q6.Which of the following is/are NOT CORRECT statement? (A) The first record in each block of the data file is known as actor record. (B) Dense index has index entries for every search key value in the data file. (C) Searching is harder in the B+ tree than B- tree as the all external nodes linked to each other. (D) In extendible hashing the size of directory is just an array of 2d-1, where d is global depth. Choose the correct answer from the options given below:
Q7.Which of the following is TRUE ? 
Q8.Which of the following is not a palindromic subsequence of the string “ababcdabba” ? 
Q9.Which collision resolution technique involves maintaining a linked list of collided keys ? 
Q10.2-3-4 trees are B - trees of order 4. They are isometric of _____ trees.
Super Coaching
UGC NET Test Series
UGC NET Previous Year Papers
UGC NET Syllabus
UGC NET Books
Testbook Edu Solutions Pvt. Ltd.
1st & 2nd Floor, Zion Building,
Plot No. 273, Sector 10, Kharghar,
Navi Mumbai - 410210
[email protected]
Toll Free:1800 833 0800
Office Hours: 10 AM to 7 PM (all 7 days)
Company
About usCareers We are hiringTeach Online on TestbookPartnersMediaSitemap
Products
Test SeriesTestbook PassOnline CoursesOnline VideosPracticeBlogRefer & EarnBooks
Our Apps
Follow us on
Copyright © 2014-2022 Testbook Edu Solutions Pvt. Ltd.: All rights reserved
User PolicyTermsPrivacy
Get Free Access Now
Hot Links： teen patti club teen patti master game teen patti apk