//For WindowsDataTypes like DWORD, BYTE etc.,
#include wdm.h //RtlBitMap
#include basetsd.h
#include stdio.h
#include conio.h
Any help would be appreciated.
Thanking You,
Viharri PLV.
--
You received this message because you are subscribed to the Google Groups
Algorithm Geeks group.
To view this discussion
hey for finding next multiple of a number x using bitwise : ( n + x -1 )
~(x-1) but not working for all numbers
Could some one please explain me.
--
You received this message because you are subscribed to the Google Groups
Algorithm Geeks group.
To view this discussion on the web visit
Let me give an example.
For 17 next multiple of number 5 is 20.
For 20 next multiple of number 5 is 25.
And give solution for this proeblem also:
For 17 next nearest multiple of number 5 is 20.
For 20 next nearest multiple of number 5 is 20.
*VIHARRI P L
Hi we need find a node in linked list in O(logn). You can change the list
as u like.
--
You received this message because you are subscribed to the Google Groups
Algorithm Geeks group.
To view this discussion on the web visit
https://groups.google.com/d/msg/algogeeks/-/vSoEXlaRTEIJ.
To post
Can anybody give an O(n) algorithm for the following problem.
Suppose if we have an array, I would like to construct an array with the
elements which specify their corresponding position in the sorted array.
For example if the array is { 0.87, 0.04, 0.95, 0.12, 0.36 } then the
sorted array
Yeah we cant use count sort, as we dont know the range of elements here...
--
You received this message because you are subscribed to the Google Groups Algorithm
Geeks group.
To post to this group, send email to algogeeks@googlegroups.com.
To unsubscribe from this group, send email to
to this group.
Thank You.
P L V VIHARRI.
Most of the Question asked were the same as that of previous years.
1. Adding two linked List of numbers.
2. Finding 2nd maximum of a binary tree.
3. Finding median of two sorted arrays.
4. Printing last K lines of a large file.
5. Given an array of numbers
For every number that has 3 in its units place has one multiple which
has all one's i.e. 111 is
such multiple and 13 has a multiple 11. Write a program to find
such multiple for any
number that has 3 at its units place.
--
You received this message because you are subscribed to the Google
1. Java uses stack for byte code in JVM - each instruction is of one
byte, so how many such instructions are possible in an operating
system.
2. Three processes p1, p2, p3, p4 - each have sizes 1GB, 1.2GB, 2GB,
1GB. And each processes is executed as a time sharing fashion. Will
they be executed
You are given a string (consisting of 0's, 1's or 2's) where 0
represents a blue ball, 1 a
red ball, and 2 a black ball. Using only swap operations (counting
sort not allowed)
rearrange the string such that all blue balls are together on one
side, followed by all red
balls, and then all black
hey i'm also thinking n + logn -2.. but couldnt able to figure out
how??? can you please explain the logic
--
You received this message because you are subscribed to the Google Groups
Algorithm Geeks group.
To post to this group, send email to algogeeks@googlegroups.com.
To unsubscribe from
1. Minimum no.of comparisons required to select the 2nd max element in
an array of N numbers.
2. What are the number of counting ties for four horses. ( example for
two horses A and B there are three cases - A wins, B wins, A B
ties ).
3. What are the minimum no.of tournaments needed to get the
I think the communication problem is just bcoz of longest prefix
match...
On Sep 3, 10:09 am, Vengadanathan fantastic.n...@gmail.com wrote:
ya both the subnet can exisit in the same network , but problem is
lack of communication between the two subnets ,because in routing
table of the router
@saurabh : The answer suggested by you is for not all together...
--
You received this message because you are subscribed to the Google Groups
Algorithm Geeks group.
To post to this group, send email to algogeeks@googlegroups.com.
To unsubscribe from this group, send email to
14 matches
Mail list logo
