Google C++ Style Guide - 5 views
-
Google C++ Style Guide
Networking Tutorial
Contents contributed and discussions participated by Ahmed Mansour
Netwokring Introduction - 0 views
JAVA Developer's Guide Book - 2 views
-
JAVA Developer's Guide
-
really great reference for who want to learn Java ... (Y)
CRC Cards Tutorial - 0 views
-
Object Oriented Analysis and Design using CRC Cards
-
A CRC cards is an index card that is use to represent the responsibilities of classes and the interaction between the classes. CRC cards are an informal approach to object oriented modeling. The cards are created through scenarios, based on the system requirements, that model the behavior of the system. The name CRC comes from Class, Responsibilities, and Collaborators which the creators found to be the essential dimensions of object oriented modeling.
-
One of the most popular methods for identifying and categorizing classes is to use class-responsibility-collaboration cards (CRC). Each CRC card represents a single class's data attributes, responsibilities, and collaborations. source : Thought Process Book..
-
You need to create three sections on each card: - The name of the class - The responsibilities of the class - The collaborations of the class
-
-
Why uses CRC cards?
- ...4 more annotations...
-
This is great tutorial for CRC cards ( sort of object oriented modeling approach) \ni think it was useful for me ... hoping to be useful for all of us : ) ..
The Object-Oriented Thought Process - 0 views
-
in this articles "The Object-Oriented Thought Process"book is discussed ..i think it's a web copy if the book... anyway it's just for who haven't this book :D ..
XHTML Frequently Answered Questions - 0 views
-
i think this is great article to know the differences between html and xhtml ..!
XML Syntax - 0 views
-
XML Stores New Line as LF In Windows applications, a new line is normally stored as a pair of characters: carriage return (CR) and line feed (LF). The character pair bears some resemblance to the typewriter actions of setting a new line. In Unix applications, a new line is normally stored as a LF character. Macintosh applications use only a CR character to store a new line.
-
msh fahem el 7eta deh ... 7d yeshra7ha :L
-
The F# Programming Language - 0 views
-
thanks one :D ... great article
-
What is F# programming language?
What's in an HTTP request? - 0 views
-
Authorisation Username:not present If you have "logged in" to a web site, your username appears here. Note that this only applies to web sites which use proper HTTP authentication - typically, a "login" window pops up and you get three chances to enter your username and password, otherwise you see a page which says "Authentication Required" or similar. It doesn't apply to web sites where the "login" is a separate page. It's also possible to supply the username and password in the URL you tell your browser to visit - for example, http://user:password@www.example.com/. In that case, the username would appear here too.
-
msh fahem el goz2 dah 2wey !! .. 7d yewad7ely please ...
-
-
really very important and useful article ... thanks tecno very match :P
Beginner To Advanced PHP Programming Tutorials - 0 views
-
I think it's only advanced .. not beginner :D
More Advanced PHP tutorials - 0 views
-
it's more advanced php tutorials
PHP video tutorials .. - 0 views
-
PHP tutorials
-
i think it's nice tutorials
Introduction to Design Patterns - 0 views
-
learn what a design pattern is
-
link to download Design Patterns: Elements of Reusable Object-oriented Software book : http://rs638.rapidshare.com/files/242614498/Design_Patterns_Elements_Of_Reusable_Object_Oriented_Software.pdf
-
u:153278 p:1131905 اخر اخبار التكنولوجيا d:05-05-2009 t:08:24 PM داماس - 0 views
-
IT News
Design and Analysis of Computer Algorithms - 0 views
-
recommended !! :D Mathematics for Algorithmic Sets Functions and Relations Vectors and Matrices Linear Inequalities and Linear Equations Greedy Algorithms Knapsack Problem o O-I Knapsack o Fractional Knapsack * Activity Selection Problem * Huffman's Codes * Minimum Spanning Tree * Kruskal's Algorithm * Prim's Algorithm * Dijkstra's Algorithm Divide & Conquer Algorithms Dynamic Programming Algorithms * Knapsack Problem DP Solution * Activity Selection Problem DP Solution Amortized Analysis * Aggregate Method * Accounting Method * Potential Method * Dynamic Table Hash Table Binary Search Tree Graph Algorithms * Breadth First Search (BFS) * Depth First Search (DFS) * Topological Sort * Strongly Connected Components * Euler Tour * Generic Minimum Spanning Tree * Kruskal's Algorithm * Prim's Algorithm * Single Source Shortest Path o Dijkstra's Algorithm o Bellman-Ford Algorithm String Matching * Naïve String Matching * Knuth-Morris-Pratt Algorithm * Boyer-Moore Algorithm Sorting * Bubble Sort * Insertion Sort * Selection Sort * Shell Sort * Heap Sort * Merge Sort * Quick Sort Linear-Time Sorting * Counting Sort * Radix Sort * Bucket Sort Computational Geometry Computational Complexity * Information-Theoretic Argument * Adversary Argument * NP-Completeness And Reduction Approximate Algorithms * Vertex Cover * The Traveling Salesman Problem Linear Programming Appendix 1. Parabola 2. Tangent Codes References hoping to discuss these algorithms with each other !
-
this web page contain a lot of algorithms discussed with simple ways !! i think these maybe useful Tutorials !! hoping to discuss these algorithms with each other !
Common Mistakes in Online and Real-time Contests - 0 views
-
Dynamic programming problems are to be solved with tabular methods
-
Dynamic programming, like the divide-and-conquer method, solves problems by combining the solutions to subproblems. ("Programming" in this context refers to a tabular method, not to writing computer code) y3ney 3bara 3n 2nene bn2sem el problem el kbirr le shwit probelsm so3'ira .. we ne solve el problems deh we ngma el yab2a dh 7l lel problem el kbira :D;d see introduction to algorithms book . chapter 15
-
-
breadth-first search
-
In graph theory, breadth-first search (BFS) is a graph search algorithm that begins at the root node and explores all the neighboring nodes. Then for each of those nearest nodes, it explores their unexplored neighbor nodes, and so on, until it finds the goal. ya3ney be el 3arby keda lw ana 3ndy tree maslan we el tree dh bettkwen mn shwit levels 3ady gedan.. lama hagey 23mel search 3la node mo3ina fi el tree deh hamsk el tree mn el root bet3ha ely hwa level 0 we habda2 2mshy level by level y3ney hanzl 3la el level 1 we hakaz le 3'it mal2y el node bet3ty ,,,, see this ,, it's a tutorial show how BFS algorithm is work!! http://www.personal.kent.edu/~rmuhamma/Algorithms/MyAlgorithms/GraphAlgor/breadthSearch.htm
-
-
for bignner acmers hoping to be useful !
-
in this article the author discuss the common problems that faced teams in ACM contests .. and how to avoid it !
List of network protocols - Wikipedia, the free encyclopedia - 0 views
What is Domain Name Resolution - 0 views
-
What is Domain Name Resolution Introduction When using the Internet most people connect to web sites, ftp servers or other Internet servers by connecting to a domain name, as in www.bleepingcomputer.com. Internet applications, though, do not communicate via domain names, but rather using IP addresses, such as 192.168.1.1. Therefore when you type a domain name in your program that you wish to connect to, your application must first convert it to an IP address that it will use to connect to. The way these hostnames are resolved to their mapped IP address is called Domain Name Resolution. On almost all operating systems whether they be Apple, Linux, Unix, Netware, or Windows the majority of resolutions from domain names to IP addresses are done through a procedure called DNS.
-
i think it's great artical !!
-
1 - 19 of 19
Showing 20▼ items per page
Ahmed Mansour