Interested to Buy Any Domain ? << Click Here >> for more details...
There are 8 billiard balls, and one of them is slightly
heavier, but the only way to tell was by putting it on a
weighing scale against another. What's the fewest number of
times you'd have to use the scale to find the heavier ball?
- 5 Answers
- 8956 Views
- Microsoft, TCS, I also Faced
- E-Mail Answers
Answer Posted / mahesh t
first take 6 balls from 8 balls
from those 6 divide 3 and 3 check it in weighing scale if it
equals weight remaining 2 balls and you get the hevier
ball....of not equals take the 3 balls which is hevier from
those weighing with 6 balls then take 2 balls from those 3
balls and weight if equals the remaining one is hevier
and final you can know the hevier ball within 2 times
| Is This Answer Correct ? | 8 Yes | 0 No |
Post New Answer View All Answers
What is double pointer in c?
What is malloc and calloc?
What is an endless loop?
Discuss the function of conditional operator, size of operator and comma operator with examples.
How many main () function we can have in a project?
What are bitwise shift operators in c programming?
What are the features of c languages?
Describe wild pointers in c?
Why is it usually a bad idea to use gets()? Suggest a workaround.
In c programming typeing to occupy the variables in memory space. if not useing the variable the memory space is wasted.ok, how to avoid the situation..? (the variable is used & notused)
Which built-in library function can be used to match a patter from the string?
What is use of integral promotions in c?
Why are some ANSI/ISO Standard library routines showing up as undefined, even though I've got an ANSI compiler?
The OS is a program that uses various data structures. Like
all programs in execution, you can determine the
performance and other behavior of the OS by inspecting its
state - the values stored in its data structures. In this
part of the assignment, we study some aspects of the
organization and behavior of a Linux system by observing
values of kernel data structures exposed through the /proc
virtual file system.
The /proc virtual file system:
Linux uses the /proc file system to collect information
from kernel data structures. The /proc implementation
provided with Linux can read many different kernel data
structures. If you cd to /proc on a Linux machine, you will
see a number of files and directories at that location.
Files in this directory subtree each corresponds to some
kernel data structure. The subdirectories with numeric
names contain virtual files with information about the
process whose process ID is the same as the directory name.
Files in /proc can be read like ordinary ASCII files. You
can open each file and read it using library routines such
as fgets() or fscanf(). The proc (5) manual page explains
the virtual files and their content available through
the /proc file system.
Requirements in detail:
In this part, you are asked to write a program to report
the behavior of the Linux kernel. Your program should run
in two different versions. The default version should print
the following values on stdout:
• Processor type
• Kernel version
• The amount of memory configured into this computer
• Amount of time since the system was last booted
A second version of the program should run continuously and
print lists of the following dynamic values (each value in
the lists is the average over a specified interval):
• The percentage of time the processor(s) spend in
user mode, system mode, and the percentage of time the
processor(s) are idle
• The amount and percentage of available (or free)
memory
• The rate (number of sectors per second) of disk
read/write in the system
• The rate (number per second) of context switches in
the kernel
• The rate (number per second) of process creations
in the system
If your program (compiled executable) is called proc_parse,
running it without any parameter should print out
information required for the first version. Running it with
two parameters "proc_parse
How can I do peek and poke in c?
