[Tutorial]Links to tutorials

[someone]

Here are some links to various languages tutorials(You dont need to learn all of them, just chose what you like):

==============================Web Development==============================

HTML
2
Tools Win32:2, Dreamweaver
Tools Linux:Geany, Bluefish, Amaya, SeaMonkey etc

CSS
2
Tools Win32:2, Dreamweaver
Tools Linux:Geany, Bluefish, Amaya, SeaMonkey etc

PHP
2
Tools Win32:2, Dreamweaver
Tools Linux:Geany, Bluefish, Amaya, SeaMonkey etc

Javascript
2
Tools Win32:2, Dreamweaver
Tools Linux:Geany, Bluefish, Amaya, SeaMonkey etc

AJAX
2

==============================Compiled Languages==============================

C/C++
C: 2
C++: 2
Tools Win32:2, 2, 2, Borland C++, Turbo C
Tools Linux:Geany, CodeBlocks, Kwrite, gedit, emacs

C#
2
Tools Win32:2
Tools Linux:Mono

Java
2
Tools Win32: Eclipse, Netbeans, Notepad++
Tools Linux:Eclipse, Netbeans

Visual Basic
Old VB: 2
.Net VB: 2
Tools Win32: Visual Basic

==============================Scripting Languages==============================

Perl
2
Tools Win32:Notepad++
Tools Linux:Genie, gedit, kwrite

Python
2
Tools Win32:Notepad++
Tools Linux:Genie, gedit, kwrite

Haskell
2
Tools Win32:Notepad++
Tools Linux:Genie, gedit, kwrite

==============================Other Usefull Stuff==============================

XML
2
2
Tools Win32:Notepad++, Eclipse(Has a guy version), Netbeans, Visual Studio
Tools Linux:Genie, gedit, kwrite, Eclipse(Has a guy version), Netbeans

ASM
To learn Assembly I suggestThis Book:
Read this 16bit Edition:
2

On linux AT&T sintax:
2

Linux NASM(same as MASM):
2

Hooking Interrupts(used to hook your app to Bios, DOS, Linux Kernel, etc):
2
2 (int 21h)
2 (int 80h)
2 (int 80h)
2

Tools Win32:2, RadASM(good Asm IDE), OllyDBG(for debugging asm)
Tools Linux: Any text editor, 2, GDB(Good Linux Debugger, AT&T sintax), GCC

A very good Tutorial(All languages even those that are not posted in this thread):
2

 

Feel free to look over this Cheat sheet too:

2

If you want to add/remove a link please Reply into this Thread

[someone]

C/C++ Guides Extension

Recursion

Its not a C/C++ thing. Recursion can be implemented in "any language". Recursion is simply defined as having a function that calls itself inside of the function.

 

void badRecursion()
{
printf("This will eventually crash\n");
badRecursion();
}

 

The Function in the code above will call itself at an infinite number of times, until the application will crash.

A good example of recursion is the factorial number

int factorial(int number)
{
// If the number is 1 will return 1
if(number == 1)
return 1;
else
return num * factorial(num - 1); // Otherwise it will return number * factorial (number - 1)
}

 

 

Linked Lists

 

I know this is something that it is already implemented in C++/STL library, but Im only gonna show you the concepts of a linked list.

 

A linked list is a group of nodes that are linked together(the first node is linked to the second node, the second node is linked to the third node, till it reaches the last node.

2

 

Implementing a Linked LIst:

A linked list(simple linked list) contains a node that contains data, a tag, and a pointer to the next node structure:

C/C++

struct node{
int tag;
type Data;
node * next;
};

 

c++(Class method)

class node{
private:
int tag;
type data;
node *next;

public:
//public methods get/set
int getTag();
void setTag(int tag);
type getData();
void setData(type data);
node *getNextNode();
void setNextNode(Node *Next);
};
class LinkedList{
private:
int length;
node *first;
public:
void insertAfter(node * element);
void insertBeginning();
void removeAfter(node * element);
void removeBeginning();
int getLength();
};

 

Double linked lists are the same, but there is another member in the node structure, the previous node.

 

Queue

A queue is a Simple linked list that that works by the FIFO(first in first out) principle, the data is added at the beginning of the list(Queue), and its taken out at the End of the list(Queue).

2

 

A queue has a Head(last element) and a tail(first element);

 

class Queue{
private:
int length;
node *head;
node *tail;
public:
void addBefore(node * element);
void removeAfter();
int getLength();
};

 

Stack

A stack is the opposed of a queue, works with the by LIFO(last in first out) principle, the data is added at the end of the stack and its taken out at the beginning of the stack.

2

 

A stack has as elements 2 elements BP(base pointer), and SP(stack pointer, I have used BP and SP because for representation have put the x86 model).

 

class Stack{
private:
int length;
node *BP;
node *SP;
public:
void addAfter(node * element);
void removeAfter();
int getLength();
};

 

Heap

A heap is like a family tree, very node in heap has a parents, and childs, the root node does not have a parent.

2

 

struct node{
int tag;
type data;
node *Left, *Right, *parent;
};

class heap{
private:
node*root, *last, *first;
public:
void Insert(type data);
void remove(node root)

}.;

[someone]

C# Guides Extension

[someone]

Java Guides Extension

[someone]

Python Guides Extension

[dethunter12]

what easiest way learn c# id like to learn it to produce  tools for com  is it this link or another 2

?

[Rosario]

Hey Guys/Gals! Thanks a lot! These are Great as Im trying to learn as much as I Possibly can!  

[spadge88]

Thanks these tutorials are great