Recent content by zak100

Sorry, I don't have any clue for the image. I don't know who did that. I have to change my password. I don't use such numbers for images. Hope you would now provide me the link. Zulfi.

Hi, Okay I would know about the link, once I get any reply. Zulfi.

Hi, Please provide the link where you have moved the question. Zulfi.

Mod note: Initially posted in a non-HW forum section, so missing the template Summary:: Hi, I am trying to find CPU utilization What is the CPU utilization if there are 5 processes running at the same time, and on average the CPU spends 30% of its time waiting on I/O completion? The formula...

I am trying to understand the term ##min_k## ##T_k ## in the following algorithm. At other place they said that it represents min load on any machine but I can’t understand the usage of variable ‘k’ which is not assigned any value. Some body please guide me ,what value is assigned to k in the...

Hi, Thanks for your response. You mean its not multiplying j with ##t_j## ##\sum_j t_j ## Thanks. God bless you. Zulfi.

I can’t understand the term Summation of (j tj). Are we multiplying j and tj. But the text is not talking about multiplying, it says”Total processing time Somebody please guide me. Zulfi.

Hi, Thanks, I am able to understand now. I did the following calculation: a ==0.00795 == 1/7+0.00795=0.15075*6 = 0.9045 (1 bin) ½ +0.00795=0.50795= (6 bins) 1/3+.00795 = 0.3333+.00795= 0.34125 (2 can fit in one bin) and 6 will require 3 bin . Therefore 1 + 6 +3= 10bins

Hi, The quotation is not displaying some text. Zulfi.

Hi, If we would consider epsilon as 0.001 then ##6 * 1/2 + 0.001## would be greater than 3. So by this optimal should not require 6 bins. It should be more than 6. So first we have to find why optimal requires 6 bins? ZUlfi.

Hi, I am having problem in understanding the following text of the book: My solution: If m = 1 then its possible to have 6 bins. All1/7 elements would go into 1 bin. All 6*1/3 items would go into 2 bins All 6 *1/2 items would go into 3 bins. Total = 6 bins It further says: Why First Fit...

Hi, Thanks for your answers. Priority queue example clearly explains why the running time is O(nlog n). However, I am using Allen Weiss and that book does not have pseudocode of FF. Segment tree is a difficult concept. I would try to understand it at some other time. Zulfi.

Hi, I am now discussing the improved version: I found the improved version here: First Fit Tree Version (Improved Running time) Q.What is a segment tree above? I can't understand the running time of this tree version. In case of tree version, searching should take O(log n) and insertion...

Hi, I am trying to understand the running time of FF both the original and improved version. For the original version book says: What I understand from this that before placing the items, FF traverses all the bins from beginning to end i.e. n bins. Now each bin can have n items, because of...

Paper link is: MPCircuits: Optimized Circuit Generation for Secure Multi-Party Computation I have a question: What is the reason for using priority encode? The circuit diagram is given. I want to give some text from book: From the above text I want to understand why its a multi-party? It is...