hi guys i am a final year student of engineering and i am working on an
ONLINE EXAMINATION SYSTEM just like GATE, GRE usually used by prometrics.
now i am come across one problem, i want that during the exam the student
is not able to navigate(can't open anything else just work on test)
anywhere
This is not an algorithm question. I suggest announcing that any
student who uses any electronic device to do anything other than take
the test will fail the class. Have a TA or two sit in the back of the
room and watch.
Don
On Feb 24, 4:04 am, Jasveen Singh jasveen.sing...@gmail.com wrote:
hi
i agree it can be done but like in company training and GATE exam and even
certification exams when the test starts everything else gets disabled till
student either clicks QUIT TEST or time is over till then everything is
limited to that screen
a feature very common after 2006 to avoid
You're right. I needed
tail = tail-next;
Before the closing } of the while loop.
Good catch.
Don
On Feb 23, 10:25 pm, Ashish Goel ashg...@gmail.com wrote:
tails needs to be updated in while loop also
Best Regards
Ashish Goel
Think positive and find fuel in failure
+919985813081
Yes, that would be a good thing to have. It's still not an algorithm
question. It depends on the OS and the specific tools you are using.
If it provides a full screen mode, use it. Without knowing more
there's not much else we can tell you. And if someone has a smart
phone or even a basic cell
yes of course its in the instructions not to allow them to enter with
phones there in checking and cheating is prohibited i am making this to
give it to my college for free.
and thank you i will keep trying to look if i can do any change...search
for it...thank you for your help
On Fri, Feb 24,
// Assuming that the graph with n nodes is specified by an adjacency
matrix edges[n][n]
// where edges[i][j] is true if an edge exists from i to j
// Implements depth-first search with restriction that each
// node may only be visited once.
int longestPath(int from, int to, int depth=0)
{
//
minute error : tail should be *tail while initializing instead of tail.
now it will work fine.
On Fri, Feb 24, 2012 at 7:55 PM, Don dondod...@gmail.com wrote:
You're right. I needed
tail = tail-next;
Before the closing } of the while loop.
Good catch.
Don
On Feb 23, 10:25 pm, Ashish
It was pointed out to me by Dave, a very sharp frequent contributor to
this group, that a different definition of a cycle will produce
different results in some cases. If a cycle is defined as following
the same edge in the same direction more than once, rejecting cycles
of that type will often
Nice. The code is very clean.
It's worth noting in case anyone is intending to implement this that
it's easy find graphs where exhaustive DFS runs in exponential time.
One that's easy to envision is a chain of diamonds
S8o8o8o ... o8D where S is the source and D the destination
with all edges
Ah, this reminds me of a beautiful thing that a fine gentleman CB
Falconer posted once in comp.programmer. It was so elegant that my
normally bad memory still remembers it after some years.
You can simplify the merge by using a dummy node for the head of the
merged list rather than just a
Dont know whether this is perfect solution but could be a great approach
Assumptions: all numbers are unsigned as given in the link provided by Dipit
If u see a bit arrangement of unsingned numbers having n bits then u will
find that
numbers m ((2^n) - 1- m) (i.e numbers whos addition is 2^n
You have a circular track containing fuel pits at irregular intervals.
The total amount of fuel available from all the pits together is just
sufficient to travel round the track and finish where you started.
Given the the circuit perimeter, list of each fuel pit location and
the amount of fuel
13 matches
Mail list logo
