Please Help Members By Posting Answers For Below Questions
what is the diffrenet bettwen HTTP and internet protocol
A float occupies 4 bytes in memory. How many bits are used
to store exponent part?
since we can have up to 38 number for exponent so 2 ki power
6 6, 6 bits will be used. If 6 bits are used why do not we
have up to 64 numbers in exponent?
hw can we delete an internal node of binary search tree the
internal node has child node..plz write progarm
write a program to find the given number is prime or not
can any one please explain, how can i access hard
it is possible by the use of far,near or huge pointer?
if yes then please explain......
what different between c and c++
struct stu s;
union uni u;
what is value of j and k.
What is pre-emptive data structure and explain it with example?
Write a client and server program in C language using UDP,
where client program interact with the Server as given
i) The client begins by sending a request to send a
string of 8 characters or series of 7 numbers, the server
sends back a characters or numbers as per the request of
ii) In case of series of 7 numbers: The client sends a
multiplication of numbers, to the server.
iii) In case of a string of 8 characters: The client sends
a reverse order of string to the server..
iv) Server will send an acknowledgment to the client after
receiving the correct answer
I was asked to write a program in c which when executed
displays how many no.of clients are connected to the server.
given post order,in order construct the corresponding binary
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)
• The rate (number of sectors per second) of disk
read/write in the system
• The rate (number per second) of context switches in
• 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 <read_rate> <printout_rate>"
should print out information required for the second
version. read_rate represents the time interval between two
consecutive reads on the /proc file system. printout_rate
indicates the time interval over which the average values
should be calculated. Both read_rate and printout_rate are
in seconds. For instance, proc_parse 2 60 should read
kernel data structures once every two seconds. It should
then print out averaged kernel statistics once a minute
(average of 30 samples). The second version of your program
doesn't need to terminate.
write a program to input 10 strings and compare without
using strcmp() function. If the character of one string
matches with the characters of another string , sort them
and make it a single string ???
example:- str1="Aakash" st2="Himanshu" str="Uday"
output:- Aakashimanshuday (please post the answer as quickly
At a shop of marbles, packs of marbles are prepared. Packets
are named A, B, C, D, E …….. All packets are kept in a
VERTICAL SHELF in random order. Any numbers of packets with
these names could be kept in that shelf as in this example:
bottom of shelf ---> [AAAJKRDFDEWAAYFYYKK]-----Top of shelf.
All these packets are to be loaded on cars. The cars are
lined in order, so that the packet could be loaded on them.
The cars are also named [A, B, C, D, E,………….]. Each Car
will load the packet with the same alphabet. So, for
example, car ‘A’ will load all the packets with name ‘A’.
Each particular car will come at the loading point only
once. The cars will come at the loading point in
alphabetical order. So, car ‘B’ will come and take all the
packets with name ‘B’ from the shelf, then car ‘C’ will
come. No matter how deep in the shelf any packet ‘B’ is,
all of the ‘B’ packets will be displaced before the ‘C’ car
arrives. For that purpose, some additional shelves are
provided. The packets which are after the packet B, are kept
in those shelves. Any one of these shelves contains only
packets, having the same name. For example, if any
particular shelf is used and if a packet with name X is in
it, then only the packets having names X will be kept in it.
That shelf will look like [XXXXXXX]. If any shelf is used
once, then it could be used again only if it is vacant.
Packets from the initial shelf could be unloaded from top
only. Write a program that finds the minimum total number
of shelves, including the initial one required for this