[algogeeks] Can't Be able to run Program in Visual Studio (2012)
:\program files (x86)\windows kits\8.0\include\um\winnt.h(7895) : see previous definition of 'ReadULongRaw' 1c:\program files (x86)\windows kits\8.0\include\km\wdm.h(4347): error C3861: 'ReadRaw': identifier not found 1c:\program files (x86)\windows kits\8.0\include\km\wdm.h(4357): error C2084: function 'void WriteULongRelease(volatile DWORD *,DWORD)' already has a body 1 c:\program files (x86)\windows kits\8.0\include\um\winnt.h(7906) : see previous definition of 'WriteULongRelease' 1c:\program files (x86)\windows kits\8.0\include\km\wdm.h(4359): error C3861: 'WriteRelease': identifier not found 1c:\program files (x86)\windows kits\8.0\include\km\wdm.h(4370): error C2084: function 'void WriteULongNoFence(volatile DWORD *,DWORD)' already has a body 1 c:\program files (x86)\windows kits\8.0\include\um\winnt.h(7919) : see previous definition of 'WriteULongNoFence' 1c:\program files (x86)\windows kits\8.0\include\km\wdm.h(4372): error C3861: 'WriteNoFence': identifier not found 1c:\program files (x86)\windows kits\8.0\include\km\wdm.h(4383): error C2084: function 'void WriteULongRaw(volatile DWORD *,DWORD)' already has a body 1 c:\program files (x86)\windows kits\8.0\include\um\winnt.h(7932) : see previous definition of 'WriteULongRaw' 1c:\program files (x86)\windows kits\8.0\include\km\wdm.h(4385): error C3861: 'WriteRaw': identifier not found 1c:\program files (x86)\windows kits\8.0\include\km\wdm.h(4395): error C2084: function 'DWORD64 ReadULong64Acquire(volatile const DWORD64 *)' already has a body 1 c:\program files (x86)\windows kits\8.0\include\um\winnt.h(7945) : see previous definition of 'ReadULong64Acquire' 1c:\program files (x86)\windows kits\8.0\include\km\wdm.h(4397): error C3861: 'ReadAcquire64': identifier not found 1c:\program files (x86)\windows kits\8.0\include\km\wdm.h(4406): error C2084: function 'DWORD64 ReadULong64NoFence(volatile const DWORD64 *)' already has a body 1 c:\program files (x86)\windows kits\8.0\include\um\winnt.h(7956) : see previous definition of 'ReadULong64NoFence' 1c:\program files (x86)\windows kits\8.0\include\km\wdm.h(4408): error C3861: 'ReadNoFence64': identifier not found 1c:\program files (x86)\windows kits\8.0\include\km\wdm.h(4417): error C2084: function 'DWORD64 ReadULong64Raw(volatile const DWORD64 *)' already has a body 1 c:\program files (x86)\windows kits\8.0\include\um\winnt.h(7967) : see previous definition of 'ReadULong64Raw' 1c:\program files (x86)\windows kits\8.0\include\km\wdm.h(4419): error C3861: 'ReadRaw64': identifier not found 1c:\program files (x86)\windows kits\8.0\include\km\wdm.h(4429): error C2084: function 'void WriteULong64Release(volatile DWORD64 *,DWORD64)' already has a body 1 c:\program files (x86)\windows kits\8.0\include\um\winnt.h(7978) : see previous definition of 'WriteULong64Release' 1c:\program files (x86)\windows kits\8.0\include\km\wdm.h(4431): error C3861: 'WriteRelease64': identifier not found 1c:\program files (x86)\windows kits\8.0\include\km\wdm.h(4442): error C2084: function 'void WriteULong64NoFence(volatile DWORD64 *,DWORD64)' already has a body 1 c:\program files (x86)\windows kits\8.0\include\um\winnt.h(7991) : see previous definition of 'WriteULong64NoFence' 1c:\program files (x86)\windows kits\8.0\include\km\wdm.h(4442): fatal error C1003: error count exceeds 100; stopping compilation 1 Generating Code... == Build: 0 succeeded, 1 failed, 0 up-to-date, 0 skipped == == Deploy: 0 succeeded, 0 failed, 0 skipped == I have included header files in the following order : #include windows.h //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 on the web visit https://groups.google.com/d/msg/algogeeks/-/jVcYKlKIO3QJ. To post to this group, send email to algogeeks@googlegroups.com. To unsubscribe from this group, send email to algogeeks+unsubscr...@googlegroups.com. For more options, visit this group at http://groups.google.com/group/algogeeks?hl=en.
[algogeeks] BitWise Operations - For finding next multiple
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 https://groups.google.com/d/msg/algogeeks/-/7C_Nw4RoxmEJ. To post to this group, send email to algogeeks@googlegroups.com. To unsubscribe from this group, send email to algogeeks+unsubscr...@googlegroups.com. For more options, visit this group at http://groups.google.com/group/algogeeks?hl=en.
Re: [algogeeks] BitWise Operations - For finding next multiple
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 V* On Thu, Sep 13, 2012 at 7:09 PM, bharat b bagana.bharatku...@gmail.comwrote: @vihari: what is n? On Thu, Sep 13, 2012 at 6:32 PM, VIHARRI viharri@gmail.com wrote: 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 https://groups.google.com/d/msg/algogeeks/-/7C_Nw4RoxmEJ. To post to this group, send email to algogeeks@googlegroups.com. To unsubscribe from this group, send email to algogeeks+unsubscr...@googlegroups.com. For more options, visit this group at http://groups.google.com/group/algogeeks?hl=en. -- 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 algogeeks+unsubscr...@googlegroups.com. For more options, visit this group at http://groups.google.com/group/algogeeks?hl=en. -- 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 algogeeks+unsubscr...@googlegroups.com. For more options, visit this group at http://groups.google.com/group/algogeeks?hl=en.
[algogeeks] LINKED LIST QUESTION
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 to this group, send email to algogeeks@googlegroups.com. To unsubscribe from this group, send email to algogeeks+unsubscr...@googlegroups.com. For more options, visit this group at http://groups.google.com/group/algogeeks?hl=en.
[algogeeks] Required O(n) Algorithm
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 would be { 0.04, 0.12, 0.36, 0.87, 0.95 }.
Then output array would be {3, 0, 4, 1, 2 }.
Hope I'm clear...
--
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/-/NH1P0aIguFEJ.
To post to this group, send email to algogeeks@googlegroups.com.
To unsubscribe from this group, send email to
algogeeks+unsubscr...@googlegroups.com.
For more options, visit this group at
http://groups.google.com/group/algogeeks?hl=en.
Re: Re: [algogeeks] Required O(n) Algorithm
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 algogeeks+unsubscr...@googlegroups.com. For more options, visit this group at http://groups.google.com/group/algogeeks?hl=en.
[algogeeks] Thanks To aLgOgEeKs
Hi, I got selected in Microsoft yesterday. Thanks to all the geeks and the group, especially to managers!!! My concept regarding the logic for Algorithms and how the tackle a new problem have been improved after seeing many post and solutions from different people, so that credit goes 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 positive and negative, find all subsets whose sum is equal to given number. 6. Aeroplane puzzle, where we have 100 persons and have to find the probability of second person sitting in his seat. 7. We have an object with the characteristic of color in an array. Now we need to sort them based on the color ( we have blue and red ). -- 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 algogeeks+unsubscr...@googlegroups.com. For more options, visit this group at http://groups.google.com/group/algogeeks?hl=en.
[algogeeks] How to Solve This
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 Groups Algorithm Geeks group. To post to this group, send email to algogeeks@googlegroups.com. To unsubscribe from this group, send email to algogeeks+unsubscr...@googlegroups.com. For more options, visit this group at http://groups.google.com/group/algogeeks?hl=en.
[algogeeks] Adobe Written Test - 25 SEPT 2010
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 on an operating system. 3. write a recursive program for reversing the linked list. 4. write a program for checking the given number is a palindrome. ( dont use string / array for converting number ). 5. write a recursive program for multiplying two numbers a and b, with additions. The program should take care of doing min # additions as that of which ever number is lower between a and b. 6. There are two sets A and B with n integers, write a program to check the whether there exists two numbers a in A and b in B such that a+b = val ( val is given ); 7. write a program to return the row number which has max no of one's in an array of NxN matrix where all 1's occur before any 0's starts. 8. 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. 9. what are the maximum no of edges that can be connected in a graph of n vertices and 0 edges such that after adding edges given graph is still disconnected. 10. One Question on critical section. For Analytical Test - Prepare the Questions in the barrons book of sample paper - 2 ( they have give two passages ) -- 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 algogeeks+unsubscr...@googlegroups.com. For more options, visit this group at http://groups.google.com/group/algogeeks?hl=en.
[algogeeks] Amazon Interview Question
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 balls. You can iterate through the string only once. Eg 102112011 should produce 00122 -- 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 algogeeks+unsubscr...@googlegroups.com. For more options, visit this group at http://groups.google.com/group/algogeeks?hl=en.
[algogeeks] Re: Directi Questions - needed answers
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 this group, send email to algogeeks+unsubscr...@googlegroups.com. For more options, visit this group at http://groups.google.com/group/algogeeks?hl=en.
[algogeeks] Directi Questions - needed answers
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 winner. A
player is out when he loses two matches. Total players are 51.
( Badminton ).
4. while(true)
{
sleep 1sencond;
if( getpid() % 2 == 0 )
{
fork();
}
}
How many no.of processes are created by the end of 12th second, if
time starts from 0th second? Process id's start from 0.
5. Which of the following are thread safe?
a) Atomic operations
b) Mutual exclusion
c) Re-entrant
d) Queuing
6. When a dice is rolled the outcome of the face is summed up each
time, and rolling is stopped when the sum becomes greater than 100.
Which of the following have more probability to become sum.
a) 103
b) 102
c) 100
d) all have equal probability
e) 101
7. A man moves 1km east, 2km north, 3km west, 4km south, 5km east, 6km
north, 7km west and so on until he travels total of 300km so what
will be the distance from origin?
8. Alam bought 5pens, 7 pencils, 4 erasers. Ashok bought 6 pens, 8
erasers, 14 pencils and paid half more the amount Alam paid. What is
the percentage of amount did Alam spent on buying pens?
9. Time complexity to get min elements from MAX heap.
--
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
algogeeks+unsubscr...@googlegroups.com.
For more options, visit this group at
http://groups.google.com/group/algogeeks?hl=en.
[algogeeks] Re: Network Question
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 the record for 10.0.1.0/26 will be first then record for 10.0.1.0/24 will be , so 10.0.1.0/26 will be given first preference , so subnet 10.0.1.0/26 cannot communicate with 10.0.1.0/24 having same ip node more over packet sent within 10.0.1.0/24 will reach 10.0.1.0/26 not to the nodes on the same network .. so 10.0.1.0/24 can communicate with 10.0.1.0/26 but cannot communicate within itself .. On Sep 3, 9:38 am, bharatkumar bagana bagana.bharatku...@gmail.com wrote: all the addresses which come under second addr will also come under first Can those 2 be exist in same LAN ? If yes , how can router decides to which subnet it has to pass through the incoming packet .. On Fri, Sep 2, 2011 at 6:36 PM, aditya kumar aditya.kumar130...@gmail.comwrote: their wont be any conflict in ip address . coz within dhcp assigns ip adsress from the pool of available address and within the n/w (LAN) we need to have unique ip address bt across the n/w (LAN) we can use same ip from the pool of ip addresses . On Sat, Sep 3, 2011 at 1:56 AM, sagar pareek sagarpar...@gmail.comwrote: It is urgent to get the answer thats why i m posting network question here... searching on net is not working HI !! I stuck on a question related to VLSM Suppose we have two subnets as 10.0.1.0/24 valid ip address can be 10.0.1.2 and 10.0.1.0/26 here also valid ip address can be 10.0.1.2 now suppose we are using these two subnets in a LAN and having this ip (10.0.1.2) in both the subnets then is there any IP conflict will happen or not? -- **Regards SAGAR PAREEK COMPUTER SCIENCE AND ENGINEERING NIT ALLAHABAD -- 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 algogeeks+unsubscr...@googlegroups.com. For more options, visit this group at http://groups.google.com/group/algogeeks?hl=en. -- 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 algogeeks+unsubscr...@googlegroups.com. For more options, visit this group at http://groups.google.com/group/algogeeks?hl=en. -- **Please do not print this e-mail until urgent requirement. Go Green!! Save Papers = Save Trees *BharatKumar Bagana* **http://www.google.com/profiles/bagana.bharatkumarhttp://www.google.com/profiles/bagana.bharatkumar * Mobile +91 8056127652* bagana.bharatku...@gmail.com -- 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 algogeeks+unsubscr...@googlegroups.com. For more options, visit this group at http://groups.google.com/group/algogeeks?hl=en.
[algogeeks] Re: spoj problem chairs
@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 algogeeks+unsubscr...@googlegroups.com. For more options, visit this group at http://groups.google.com/group/algogeeks?hl=en.
