aashish.raina

Shanuka; You need to mention ur intersts,,,Coz computer science is more like a sea... Any ways i have a project for you.Try implement TCP IP stack.It is chalanging and very interestng. You need to study from some netrwork book what TCP IP is If u dont know,, get the theoritical …

Hi All How should i go about finding the complexity of a finding a minimal spanning tree in a Graph...

As far as Lambda Calclus is concerned it is a mathematical way to write computer programs and that too recursive programms. To give u a taste :: let y = lambda y:f(x)->x+1 this is a lambda statement that says f is a function that takes an argument and add 1 …

Hi There are 2 ways for Data bases as i know ,, 1: Is writing queries ...... 2: Knowing the actual details of implementation in terms of Data Structures.. Refer Any Data structure book and study B+,B2,B-hash,Tree ,,,all these data structures... After that writer a programs that embed these techniques …

Hi All of you existing members.I read abt this site and was so exited to see how this site has been managed by the moderators and ofcourse that is not possible without all of your support (members).. Currently i am in to C++ ,,started learning.. I am an IT Professional..I …

Hi I am not that good in Math,,but having a first look at the options i think N>1 it will be the case.. as if N==0 lhs will be 0 and cat be greater than the LHS correct me if i am wrong

Hi I read what u have said,,,What i could make out was u need to see how the peocedure works. 1:Do a dry run on some input let say n=4 2 pow 4 -1 = 15 steps will be taken Plz handle the base cases i am a bit lazy …