You can find out by using 2 pointers. One of them goes 2 nodes each time. The second one goes at 1 nodes each time. If there is a cycle, the one that goes 2 nodes each time will eventually meet the one that goes slower. If that is the… Continue reading
You can find out by using 2 pointers. One of them goes 2 nodes each time. The second one goes at 1 nodes each time. If there is a cycle, the one that goes 2 nodes each time will eventually meet the one that goes slower. If that is the… Continue reading
Properties is a very specialized class that’s designed to hold configuration and/or resources that are usually stored in some file. Properties has several features that Hashtable doesn’t have (and shouldn’t have): It supports reading and writing its content to a well-defined plain-text format (using load()/store()) It supports reading and writing… Continue reading
The phrase native code is used in two contexts. Many people use it as a synonym for unmanaged code: code built with an older tool, or deliberately chosen in Visual C++, that does not run in the runtime, but instead runs natively on the machine. This might be a complete… Continue reading
Unmanaged code is what you use to make before Visual Studio .NET 2002 was released. Visual Basic 6, Visual C++ 6, heck, even that 15-year old C compiler you may still have kicking around on your hard drive all produced unmanaged code. It compiled directly to machine code that ran… Continue reading
Stack: Value type allocates the values in Stack. Function parameters are allocated on the stack Local variables that are declared on the stack are not automatically initialized by the system so they usually have garbage in them until you set them Variables on the stack disappear when the function exits… Continue reading
A pointer is a programming tool that allows a value to be referenced. All data is allocated in memory and has a certain address attached to them. When you use a pointer, you are taking a value from an address called the reference. The original data is called the reference,… Continue reading
A tree with at most two children for each node. OR A binary tree either is empty (no nodes), or has a root node, a left binary tree, and a right binary tree.
Avl tree is self binary tree in which balancing factor lie between the -1 to 1.It is also known as self balancing tree. So BF=h(T(left sub tree))-h(T(right sub tree));
Hashing is a way retrieving records from memory in faster way. Record is inserted into memory by using hash function (division, midsqure, folding, digit analysis) and also records are retrieved using same hash function.