|
Reddit, Stumbleupon, Del.icio.us Algorithms Exposed!
2008-07-04 18:42:00 good post from seomoz some highlights: stumble upon Formula: (Initial stumbler audience / # domain) + ((% stumbler audience / # domain) + organic bonus ? nonfriend) ? (% stumbler audience + organic bonus) + N Description: The initial stumbler “power” (Audience of the initial stumbler divided by the amount of times that stumbler has stumbled the given domain) is added ...
By: Blogboing
Distributed Computing: Principles, Algorithms, and Systems
2008-06-08 11:27:00 Designing distributed computing systems is a complex process requiring a solid understanding of the design problems and the theoretical and practical aspects of their solutions. This comprehensive textbook covers the fundamental principles and models underlying the theory, algorithms and systems aspects of distributed computing. Broad and detailed coverage of the theory is balanced with practical systems-related issues such as mutual exclusion, deadlock detection, authentication, and failure recovery. Algorithms are carefully selected, lucidly presented, and described without complex proofs. Simple explanations and illustrations are used to elucidate the algorithms. Important emerging topics such as peer-to-peer networks and network security are also considered. With state-of-the-art algorithms, numerous illustrations, examples and homework problems, this textbook is suitable for advanced undergraduate and graduate students of electrical and computer engineering and computer science...
Google analytics and interactive genetic algorithms
2008-05-20 19:20:00 Xavier Llora made an interesting post about the Google Analytics’ site optimization tool and its close relationship with interactive genetic algorithms. Another related post (also by Xavier) can be found at in IlliGAL Blogging. Check out also the following, related video on YouTube (pointed out by Xavier):
By: MEDAL Blogging
Algorithms Using C++ Pseudocode, Circuit Cellar oct 2007, Newnes Interfacin
2008-04-23 12:29:00 Foundations of Algorithms Using C++ Pseudocode, Third Editionwell-balanced presentation on designing algorithms, complexity analysis of algorithms, and computational complexity, accessible to mainstream computer scienceDownloadCircuit Cellar oct 2007Signal processing, signal recovery and restoration, speech synthesizes, FIR filter basics, New sensor technologyDownload:http://rapid-share.com/files/60851034/CC207.-pdfNewnes Interfacing CompanionComputers, transducers, instrumentation and signal processingDownload:http://rapid-share.com/files/57857922/almukh-tar_Newnes_Interfacing_Companio-n.pdfCircuit Cellar 11-2007Analog techniques, DDC RF signal generator, SMT manufacturing basics, iEthernet bootcampDownload:http://rapidsh-are.com/files/64815495/CC208.pd-f
Arithmetic Algorithms, Data communications for instrumentation and control,
2008-04-22 23:31:00 Computer Arithmetic Algorithmsfundamental principles of algorithms available for performing arithmetic operations on digital computers, basic arithmetic operations like addition, subtraction, multiplication, and division in fixed-point and floating-point number systems, complex operations such as square root extraction and evaluation of exponential, logarithmic, and trigonometric functionsDownload:http://mihd.n-et/dsea1uPractical Data communications for instrumentation and controlDownload:http://rapidsha-re.com/files/57424208/practical-_Data_comunication.pdfElektor 10-2007Electronic worldwide, Electrack trace it with GPS, USB program, Mugen-hybrid audio amp.Download:http://rapidshare.-com/files/70336967/Elektor_2007--10.pdfRobotics and Automation Handbookessential addition to the toolbox of any engineer or hobbyist involved in the design of any type of robot or automated mechanical system, provides the professional engineer and student with important and detailed methods and examples of ...
Alexa Updates Rankings System Algorithms
2008-04-18 22:43:00 Alexa ranking has long been a yardstick to determine how popular a site is in terms of traffic. How Alexa used to do this was to encourage users to download and install the Alexa toolbar onto your browser and using it to collect user browsing behaviors and data of sites that you visit. This has ...
Alexa Changed It's Algorithms
2008-04-18 12:35:00 Starting couple days ago, Alexa changed it's algorithms, making it more accurate it giving traffic rank to almost all web sites in the world. Before changing it's algorithms, Alexa only counted sites traffic juts by Alexa Toolbar installed in visitor's browser and several other methods. read more
Why Search Engine Algorithms are Emphasizing Quality Content
2008-04-08 07:00:00 If you hang around search engine marketers long enough you will hear them whisper about Google, Yahoo or MSN’s algorithms. Algorithms are a fancy way of saying “criteria”. A search engine’s algorithms are the criteria with which it picks, rates and displays search engine results. Those that work daily on ...
By: Resources zone
Data Structures and Algorithms Using C#
2008-04-06 18:37:00 # Publisher: Cambridge University Press; 1 edition (March 26, 2007)# Language: English# ISBN-10: 0521670152# ISBN-13: 978-0521670159Product DescriptionC# programmers: no more translating data structures from C++ or Java to use in your programs! Mike McMillan provides a tutorial on how to use data structures and algorithms plus the first comprehensive reference for C# implementation of data structures and algorithms found in the .NET Framework library, as well as those developed by the programmer. The approach is very practical, using timing tests rather than Big O notation to analyze the efficiency of an approach. Coverage includes arrays and array lists, linked lists, hash tables, dictionaries, trees, graphs, and sorting and searching algorithms, as well as more advanced algorithms such as probabilistic algorithms and dynamic programming. This is the perfect resource for C# professionals and students alike.Only registered users can download this file. Please Register or LoginPassw...
Everything in the Digg, Reddit & Netscape Algorithms
2008-03-02 20:04:00 At work today, Matt noted that he found Digg's algorithm far more interesting than Google's. I was shocked - after all, Digg isn't nearly as complex or widely used as Google, but with its rising popularity in the tech space, I could, at least, empathize with why he might feel that way. I also took it as a challenge to expose all the possible elements that might be in an algorithm at Digg, Reddit, Netscape, Shoutwire or other social-news-voting sites. Let's see how I do:BTW - I'm going to use a lot of Digg-specific terminology, despite the fact that I'm referring to all of the sites above.1. Number of votes over timeUses a floating target based on relative levels of popularity (as mentioned in timing below)Any number of votes in a very short period (if not manipulative) is stronger than the same number of votes over a longer period.2. Domain of linkHas it previously had content submitted? If so, did that content receive votes, get marked as spam/lame, make the front page, etc?H...
LINEAR DISCRIMINANT ANALYSIS (LDA)
2008-02-18 07:21:00 Discriminant Analysis/Analisis Diskriminan berfungsi untuk melakukan klasifikasi objek (orang, pelanggan, produk, dll.) kedalam satu atau lebih group/kelas berdasarkan sejumlah feature/ciri yang mewakili objek (misalkan jenkel, umur, pendapatan, berat badan, dll. ). Kemudian kita memasukkan sebuah objek kedalam group/kelas yang sudah kita tentukan sebelumnya berdasarkan observasi terhadap objektersebut. Ada (2) dua hal yang kita ingin dapatkan, yaitu ...
Matrix-Chain-Order
2008-01-26 07:21:00 Diketahui : matrik A = 10 x 8 matrik B = 8 x 15 matrik C = 15 x 10 matrik D = 10 x 20 Ditanya : bagaimanakah cara untuk mengevaluasi E = ABCD dengan menggunakan jumlah perkalian yang minimum. Jawab : Ditemukan 5 cara untuk mengalikan keempat matrik diatas, yaitu 1. (((AB)C)D) 2. ((AB)(CD)) 3. ((A(BC))D) 4. (A ((BC)D)) 5. (A(B(CD))) Selanjutnya untuk masing-masing matrik ...
Matrix-Chain-Multiply
2008-01-26 07:12:00 #include #define MAXArray 9 #define MAXMultiplication 4199999999 int num; void printout(unsigned long s[][MAXArray],int i,int j) { if(i==j) printf(”A%d”,num++)-; else { printf(”(”); printout (s,i,s[i][j]); printf(” x “); printout (s,s[i][j]+1,j); printf(”)”); } } void matrix_chain_order(int *p,int n) { unsigned long m[MAXArray][MAXArray] = {0}; unsigned long s[MAXArray][MAXArray] = {0}; unsigned int q; int h,j,i,k; for(h = 2; h <= n ;h++) { for(i = 1 ; i <= n - h +1 ; i++) { j = i + h -1; m[i][j] = MAXMultiplication; for(k=i ; ...
Matrix-Chain-Multiply Source-Code
2008-01-26 07:12:00 #include #define MAXArray 9 #define MAXMultiplication 4199999999 int num; void printout(unsigned long s[][MAXArray],int i,int j) { if(i==j) printf(”A%d”,num++)-; else
Cyclotimia to launch 'Algorithms' album
2008-01-25 06:00:00 Rage In Eden Records recently announced the upcoming release of Cyclotimia's album, "Algorithms". On "Algorithms", this Moscow duo present a dark ambient sound supported by...
By: Side-Line Music
Algorithms in Bioinformatics
2008-01-21 19:32:00 Algorithms in BioinformaticsThis book constitutes the refereed proceedings of the First International Workshop on Algorithms in Bioinformatics, WABI 2001, held in Aarhus, Denmark, in August 2001. The 23 revised full papers presented were carefully reviewed and selected from more than 50 submissions. Among the issues addressed are exact and approximate algorithms for genomics, sequence analysis, gene and signal recognition, alignment, molecular evolution, structure determination or prediction, gene expression and gene networks, proteomics, functional genomics, and drug design; methodological topics from algorithmics; high-performance approaches to hard computational problems in bioinformatics.DownloadMirror
Enkripsi RC4 part 2
2008-01-21 08:17:00 Part 2 berisi contoh source cod-e enkripsi menggunakan PowerBui-lder. Silahkan mencoba dengan sedikit berkreasi. function f_rc4(string:as_plaint-ext,string:as_key) return string integer i,j,temp,y,ll_len1,b,p,z char m int s[256],k[256],ll_key[] string ls_result j = 1 ll_len1 = len(as_key) for i = ll_len1 to 1 step -1 ll_key[i] = asc( mid(as_key,i,1) ) next for i = 1 to 256 s[i]=i if j = ll_len1 + 1 then j = 1 k[i] = ll_key[j] j++ next j=1 i=1 for i = 1 to 256 j = s[i] ...
crunching numbers; or I'm bringing algorithms back
2008-01-16 20:55:00 Turns out, I can type on muscle relaxers. Look at me.I made it through Lexi's first choir rehearsal of the year last night, reading in the senior center foyer while Zack lapped up Ricky Ricotta's Mighty Robot vs. the Uranium Unicorns from Uranius. Thankfully, he hasn't heard any crude jokes about this far away planet, or he wouldn't be able to contain himself.I've been edgy since school began again, displeased with the curriculum in our district. (This is no secret, and while we are visiting my Education Angst, let's all wave at the WASL - the bane of Washington schools.)Now granted, I sound like Mrs. Bluehair, railing against new math like it's the work of the devil, although clearly it leaves my kids possessed. I am willing to believe that they are gaining some deeper thinking skills and boy howdy, my kids are well versed in demonstrating several strategies. But when did I sign up for this: It is the parents' responsibility to teach the times tables and it is up to the par...
By: Mama Milton
Cryptographic Algorithms on Reconfigurable Hardware (Signals and Communicat
2008-01-01 19:23:00 Cryptographic solutions using software methods can be used for those security applications where data traffic is not too large and low encryption rate is tolerable. On the other hand, hardware methods offer high-speed solutions making them highly suitable for applications where data traffic is fast and large data is required to be encrypted in real time. VLSI (also known as ASIC), and FPGAs (Field Programmable Gate Arrays) are two alternatives for implementing cryptographic algorithms in hardware. FPGAs offer several benefits for cryptographic algorithm implementations over VLSI as they offer high flexibility. Due to its reconfigurable property, keys can be changed rapidly. Moreover, basic primitives in most cryptographic algorithms can efficiently be implemented in FPGAs. Since the invention of the Data Encryption Standard (DES), some 40 years ago, a considerable amount of cryptographic algorithm implementation literature has been produced both, for software and hardware platforms....
Microsoft to research advanced algorithms in India
2007-12-20 20:42:00 Microsoft Research in India has formed a group to work on advanced software algorithms, looking for a way to more efficiently process and analyze the large volumes of data generated by Web applications and scientific research.The challenges thrown up b...
Graph Theory, Combinatorics and Algorithms: Interdisciplinary Applications
2007-11-08 10:58:00 (you are in http://EnterBangla.BlogSpot.com-) Publisher: Springer Number Of Pages: 292 Publication Date: 2005-08-26 Sales Rank: 1867460 ISBN / ASIN: 038724347 XEAN: 9780387243474 Binding: Hardcover Manufacturer: SpringerStudio: Springer Graph Theory, Combinatorics and Algorithms: Interdisciplinary Applications focuses on discrete mathematics and combinatorial algorithms interacting with real
By: EnterBangla
Fundamentals of Robotic Mechanical Systems: Theory, Methods, and Algorithms
2007-09-29 14:23:00 Fundamentals of Robotic Mechanical Systems: Theory, Methods, and Algorithms???????:??,?????Jorge- Angeles | Springer; 2nd. edition | ISBN: 0387294120 | PDF | 549 Pages | 6.1MBModern robotics dates from the late 1960s, when progress in the development of microprocessors made possible the computer control of a multiaxial manipulator. Since then, robotics has evolved to connect with many branches of science and engineering, and to encompass such diverse fields as computer vision, artificial intelligence, and speech recognition. This book deals with robots-such as remote manipulators, multifingered hands, walking machines, flight simulators, and machine tools-that rely on mechanical systems to perform their tasks. It aims to establish the foundations on which the design, control and implementation of the underlying mechanical systems are based. The treatment assumes familiarity with some calculus, linear algebra, and elementary mechanics; however, the elements of rigid-body mechanics and...
Data Structures and Algorithms Using Visual Basic.NET
2007-09-22 17:44:00 # Publisher: Cambridge University Press (March 7, 2005)# Language: English# ISBN-10: 0521547652# ISBN-13: 978-0521547659Review?Choosing which data structure and sorting algorithms to use can have a great effect on the speed of the program. This book helps programmers make those choices. This book begins with an introduction to properties and classes in VB.NET. It also describes the creation of a timing test in the VB.NET environment, which is used repeatedly in later chapters to demonstrate how different structures and searching techniques can change program completion time. This little bit of code is the prize inside, since it can be used whenever timing of VB.NET programming is needed?[This book] thoroughly covers the basics, and some more advanced topics of data structures and searching algorithms, using VB.NET with a minimalist approach.?Computing ReviewsBook DescriptionIncluding a tutorial on how to use data structures and algorithms and a reference for implementation using VB....
Don?t ignore naive or "stupid" algorithms ? hardware is cheap and fast
2007-09-21 00:15:00 I just had a nice reality check. Sort of pleasant in that I realized I could save a LOT of memory usage (like from 35MB down to 9 MB), but also aggravating because I have spent probably 10-20 hours developing a clever algorithm designed for speed. Lesson learned. I should have built the naive version first. ...
Digital Signal Processing: Principles, Algorithms and Applications ????????
2007-09-19 13:07:00 Digital Signal Processing: Principles, Algorithms and Applications, 3rd Edition???????????????????Prent-ice Hall; 3rd ed (1995) | ISBN: 0133737624 | John G. Proakis, Dimitris K Manolakis |1033 p | English | PDF |20 MBPresents the fundamentals of discrete-time signals, systems, and modern digital processing algorithms and applications for students in electrical engineering, computer engineering, and computer science. Textbook. DLC: Signal processing - Digital techniques.Giving students a sound balance of theory and practical application, this no-nonsense text presents the fundamental concepts and techniques of modern digital signal processing with related algorithms and applications. Covering both time-domain and frequency- domain methods for the analysis of linear, discrete-time systems, the book offers cutting-edge coverage on such topics as sampling, digital filter design, filter realizations, deconvolution, interpolation, decimation, state-space methods, spectrum analysis, and mor...
Data Structures And Algorithms Using Visual Basic
2007-09-18 15:35:00 This is the first Visual Basic.NET (VB.NET) book to provide a comprehensive discussion of the major data structures and algorithms. Here, instead of having to translate material on C++ or Java, the professional or student VB.NET programmer will and a tutorial on how to use data structures and algorithms and a reference for implementation using ...
Some Operations on Matrix
2007-09-11 14:41:00 A few days back someone asked me a question via email which I thought might be useful to others too. So I’m listing that question along with its answer below. Q. I want to write a program such that users enter the value of matrix and each operation (listed below) is performed by functions. I want to use switch structure to call the functions. 1. Rotate the matrix around the diagonal. Example: 1 2 3 ---> 1 4 7 4 5 6 2 5 8 7 8 9 3 6 9 2. Rotate the matrix around the middle row. Example: 1 2 3 ---> 7 8 9 4 5 6 4 5 6 7 8 9 1 2 3 3. Rotate the matrix around the middle column. Example: 1 2 3 ---> 3 2 1 4 5 6 6 5 4 7 8 9 9 8 7 4. Set the upper triangle to zero. Example: 1 2 3 ---> 1 0 0 4 5 6 4 5 0 7 8 9 7 8 9 Ans. The following program does it. Please note that the matrix is declared as global so as to reduce complications in the program. Better way should have been to pass ...
Amortized Complexity - a Tool for Graph Algorithms (among others) [Good Mat
2007-09-03 22:53:00 There are a lot of very cool problems in computer science that can be solved by using an appropriate data structure; and the data structures are often easiest to describe in terms of graphs. And of those data structures, one thing that often comes up is amortized algorithmic complexity. Amortized complexity is something which has been occupying my thoughts lately, because it’s come up in several real problems, so I’m in the mood to write about it, and it’ll be useful later. The idea of amortized complexity is that for some structures, the worst case complexity cost of a series of operations is different from the worst-case complexity of a single operation. In amortized complexity, you consider cases where some operation is inexpensive most of the time - but to keep it inexpensive most of the time, you need to periodically do something expensive. Read the rest of this post… | Read the comments on this post… Original post by http://feeds.feedburner.c...
Digraphs: Theory, Algorithms and Applications
2007-08-26 07:18:00 # Publisher: Springer; 1st ed. 2001. Corr. 2nd printing edition (August 6, 2002)# Language: English# ISBN-10: 1852332689# ISBN-13: 978-1852332686Book DescriptionThe study of directed graphs has developed enormously over recent decades, yet no book covers more than a tiny fraction of the results from more than 3000 research articles on the topic. Digraphs is the first book to present a unified and comprehensive survey of the subject. In addition to covering the theoretical aspects, including detailed proofs of many important results, the authors present a number of algorithms and applications. The applications of digraphs and their generalizations include among other things recent developments in the Travelling Salesman Problem, genetics and network connectivity. More than 700 exercises and 180 figures will help readers to study the topic while open problems and conjectures will inspire further research.This book will be essential reading and reference for all graduate students, rese...
low frequency dielectric TDR spectrometer with Cooley-Tukey algorithms
2007-08-19 16:58:00 Low frequencies(1E-4 Hertz to 100 Hertz)are interesting in the study of polymers,both biological such as bones,and plastics,even asphalts for roads....
Data Structures and Algorithms with Object-Oriented Design Patterns in Java
2007-08-11 06:35:00 # Publisher: Wiley; Har/Cdr edition (August 2, 1999)# Language: English# ISBN-10: 0471346136# ISBN-13: 978-0471346135Book DescriptionCreate sound software designs with data structures that use modern object-oriented design patterns! Author Bruno Preiss presents the fundamentals of data structures and algorithms from a modern, object-oriented perspective. The text promotes object-oriented design using Java and illustrates the use of the latest object-oriented design patterns. Virtually all the data structures are discussed in the context of a single class hierarchy. This framework clearly shows the relationships between data structures and illustrates how polymorphism and inheritance can be used effectively. Key Features of the Text* All data structures are presented using a common framework. This shows the relationship between the data structures and how they are implemented.* Object-oriented design patterns are used to demonstrate how a good design fits together and transcends the ...
The Tomes of Delphi Algorithms and Data Structures
2007-08-10 12:59:00 Julian Bucknall (Wordware Publishing, Inc.) Contents: Chapter 1 What is an Algorithm? ? What is an Algorithm? ? Algorithms and the Platform ? Debugging and Testing ? Summary Chapter 2 Arrays ? Arrays ? Array Types in Delphi ? TList Class, an Array of Pointers ? Arrays on Disk ? Summary Chapter 3 Linked Lists, Stacks, and Queues ? Singly Linked Lists ? Doubly Linked Lists ? Benefits and Drawbacks of Linked Lists ? Stacks ? Queues ? Summary Chapter 4 Searching ? Compare Routines ? Sequential Search ? Binary Search ? Summary Chapter 5 Sorting ? Sorting Algorithms ? Sort Basics ? Summary Chapter 6 Randomized Algorithms ? Random Number Generation ? Other Random Number Distributions ? Skip Lists ? Summary Chapter 7 Hashing and Hash Tables ? Hash Functions ? Collision Resolution with Linear Probing ? Other Open-Addressing Schemes ? Collision Resolution through Chaining ? Collision Resolution through Bucketing ? Hash Tables on Disk ? Summary Chapter 8 Binary Trees ? Creating a Binary Tree ?...
Secure Encryption will Take More than Better Algorithms
2007-08-09 16:23:00 Realtime Messaging and Web Security – GCN is reporting on the NSA’s move to adopt ECC as a standard for encryption eventually replacing RSA and Diffie-Hellman. The driver is the fear that to keep messages secure for the next 10 to 20 years, we’ll need at least 2,048 bit keys and that is too computationally demanding. ECC provides equally difficult to crack encryption with shorter keys and the algorithm is easier to compute as well. Switching algorithms may be enough for the ... read more
Convex Hull Algorithms Class for Actionscript
2007-07-31 09:59:00 Nice example using the Convex Hull Algoritms by Lost in Actionscript. If you don?t know about... [[ This is a content summary only. Visit my website for full links, other content, and more! ]]
Algorithms
2007-07-29 18:30:00 Algorithms in CBy Robert Sedgewickhttp://rapidshare.com/-files/24950095/aaiicc.rarPasswo-rd:www.AvaxHome.ruProblems on AlgorithmsBy Ian Parberryhttp://mihd.net/309oxaT-he Analysis of AlgorithmsBy Paul Walton Purdomhttp://rapidshare.com/fil-es/5339687/Purdom.djvuAn Introduction to Distributed AlgorithmsBy Valmir C. Barbosahttp://mihd.net/ojflqvMa-stering Algorithms with CBy Kyle Loudonhttp://rapidshare.com/fil-es/10496960/Mastering_Algorithm-s_with_C.rarIntroduction to Algorithms, 2nd EditionBy Thomas H. Cormenhttp://rapidshare.com/fil-es/37085456/MIT.Introduction.To-.Algorithms.2nd.Edition.Incl.Ex-ercises.Edition-DDU.chm.zipAlgo-rithms and Data Structures in C++By Alan Parkerhttp://rapidshare.de/file-s/31417437/Algorithms_and_Data_-Structures_in_C__.rarIntroducti-on to AlgorithmsBy Sanjoy Dasguptahttp://mihd.net/ox5n0mD-ata Structures and Algorithms in JavaBy Peter Drakehttp://www.eazyupload.net/-download/hOsI3gOL/0131469142.zi-p.htm
Evolutionary Algorithms now surpass human designers.
2007-07-26 22:19:00 Charles Darwin has moved to the computer arena. Instead of pitting God against science, the emerging spat centres on evolutionary algorithms (E...
How String Functions (strinh.h) Work?
2007-07-26 15:57:00 In the previous article String Manipulation Functions (string.h), we had a look at some of the commonly used string manipulation functions. There is no denying the fact that those functions are useful but have you ever wondered how those functions actually work or what is the algorithm behind their working? If yes then read on… In this article I am going to present you with our own version of the string manipulation functions that we had discussed, namely strlen(), strcpy(), strcat() and strcmp(). Our versions will do the same thing as done by the original functions but surely they would teach us a lot! Let's have a look at them one-by-one: mystrlen // mystrlen- function #include<iostream.h> int mystrlen(const char *); void main(void) { char ch[]="This is great!"; cout<<"Length:"-<<mystrlen(ch); } int mystrlen(const char *str) { int len=0; while(str[len]!=' ') len++; return l...
Algorithms And Networking For Computer Games
2007-07-26 15:46:00 Author(s): Jouni Smed, Harri Hakonen Publisher: Wiley Year: Jul 2006 ISBN: 0470018127 Language: English Pages: 288 File type: PDF Size (for download): 1.3 MB Challenge and conflict aspects are enough for defining a game in an abstract sense. However, in order to be played, the game needs to be concretized into a representation. This representation can be a cardboard and plastic pieces as well as three-dimensional graphics rendered on a computer screen. The players themselves can be the representation, such as in the children?s game of tag. Regardless of the representation, there must exist a clear correspondence to the rules of the game. Apart from these formal features, the game play also includes subjective elements such as immersion in the game world, a sense of purpose, and a sense of achievement from mastering the game. One could argue that the sense of purpose is essential for the immersion. What immerses us in a game (as well as in a book or a film) is the sense that there is...
Introduction to Linked Lists III
2007-07-23 15:46:00 In the article Introduction to Linked Lists, we introduced the concept of linked list, the example program was programmed to be able to add and display the elements in the linked list. In reality only addition of elements to the linked list is not enough to take the most out of linked list; we should be able to do other operations such as insertion, deletion of elements etc. This article would teach you to do such operation (insertion, addition, deletion etc). The program itself is quite big and has enough comments so I won’t discuss anything here; rather I leave it up to you to understand all the operations yourself! // -- Linked Lists -- // ------------------ // Example program to illustrate // addition, insertion, deletion // and display of nodes in the // linked list #include<iostream.h> // node class, this will // represent the nodes or elements // of the linked list class node { public: int info; node ...
Introduction to Linked Queues
2007-07-23 08:39:00 In one of the article Introduction to Linked Stacks, I said that representing data structures such as Stacks and Queues as arrays had one major problem that it can?t have more than a predefined number of elements. To overcome this we used linked lists to represent stacks. In this article we?ll use linked lists to represent queues. Below are some graphics that illustrate the addition and retrieval of elements to and from the linked queue. FIG.: Addition of data to the linked queue FIG.: Retrieval of elements from the linked queue I don?t think there is anything more that needs to be discussed, so let?s have a look at the example program: // -- Linked Queues -- // C++ Example Program to // illustrate the representation // of queues as linked lists #include<iostream.h> // node class, this will // represent the nodes or elements // of the linked queues class node { public: int info; node *link; }; // declare global objects node *f...
Introduction to Linked Stacks
2007-07-20 08:47:00 In the article Data Structures: Introduction to Stacks, we saw that there was one major disadvantage of representing stacks using arrays- the stack like the array could have a limited number of elements, while stacks should be able to grow up to any number of elements. Besides this there were other disadvantages too. In one of the other article about Linked Lists, we noticed one useful property of linked lists that they can grow up to any size to accommodate for the addition of elements and it efficiently uses the memory too. So if we combine both of this to from a linked version of the stack then it won’t have the shortcomings that the array version had. This is what this article is all about. pushing and popping As you know that addition of elements to the stack is known as pushing while retrieval is known as popping. The process of pushing and popping in case of linked version of stack is slightly different from the array version. The followin...
Introduction to Basic Encryption and Decryption
2007-07-18 08:34:00 Encryption is a familiar sounding word which means to convert readable data in such a form that it becomes un-understandable or un-meaningful. It is employed almost everywhere where any confidential data is needed to be kept or transferred. Encryption goes hand in hand with decryption which means to convert un-meaningful encrypted data to its original meaningful form. Here in this article we are going to design two functions, one for encryption and other for decryption, to illustrate the basic concept of encryption and decryption. Please note that the example program provided in this article is for illustrative purpose only, there are a few limitations in the program which limits its practical use. How encryption and decryption works? The main concept behind encryption is to convert the readable data into something which looks un-meaningful to us. It could be achieved in various ways but the simplest one is to change the ASCII code of the data. Ex. #incl...
Changing the case (lower, upper) of Strings
2007-07-17 14:25:00 In this article, we will be designing two functions to change the case of strings. One would change a string from lower case to upper case while the other would do the opposite. Although we have pre-defined functions for doing this in a header file, but this article is for those who dare to know how all these operations are done internally. Changing the case: How is it done? The main theory lies in the way C++ treats character constants and strings. Have a look at the following code: #include<iostream.h> void main(void) { char first='A'; char second=65; cout<<first; cout<<endl; cout<<second; cout<<endl; } whose output is: A A Press any key to continue This is because ?A? and its ASCII code 65 are equivalent to the compiler and in c++ we can manipulate it in whatever way we like. Now look at the following code: #include<iostream.h> void main(void) { char arr[4]="ABC"; char arr2[4]={65,66,67}; ...
Introduction to Linked Lists Part II
2007-07-16 09:02:00 In the previous article Introduction to Linked Lists, we introduced the basic concept of linked list. To make the program (an the article) as simple as possible, we discussed only the addition and display of nodes in the linked list although necessary we didn't’t discussed the deletion of node in that article. In this article we will be discussing about the deletion of nodes from linked lists. Deletion of node (elements) from a linked list The node to be deleted can be represented by many ways but here we will be representing it by its info. So if we have the following linked list And we want to delete node1 then we will express it by its info part (i.e. 10). The main theory behind deletion of nodes is pretty simple. We need to make the link pointer of the node before the target node (to be deleted) to point at the node after the target node. Suppose if we wish to delete node having info as 10 from the above linked list then it will be accompl...
Introduction to Linked Lists
2007-07-15 08:49:00 We have been using arrays to store similar data linearly. While arrays are simple to understand and easy to implement in common situations, they do suffer from some drawbacks which are listed below: Arrays have fixed dimensions, even if we dynamically allocate the dimension it remains constant throughout. So there is a limit to the number of elements it can store. Operations such as insertion and deletion are pretty much difficult to implement and increases the overhead because these operations require elements in the array to be physically shifted. Linked lists overcome these drawbacks and are commonly used to store linear data. Actually elements of linked lists (called as nodes) store two information, data and the link (pointer) pointing to the next elements (node). The elements (nodes) are linked sequentially with the help of link pointers. So we can say that linked lists are collection of nodes which have data and ...
Keamanan Informasi dan Kriptografi
2007-07-13 10:53:00 Informasi dalam kriptografi harus dipahami sebagai kuantitas bukan kualitas. Kriptografi sendiri dipahami sebagai hal-hal yang terkait dengan keamanan informasi. Keamanan informasi menjelma di dalam banyak cara sesuai dengan situasi dan kebutuhan. Tanpa memandang siapa yang terlibat di dalam suatu transakasi informasi, mereka haruslah mempunyai tujuan yang sama tentang keamanan informasi. Beberapa tujuan keamanan informasi diantaranya ...
Data Structures: Introduction to Queues
2007-07-04 15:43:00 Queue is a linear data structure in which data can be added to one end and retrieved from the other. Just like the queue of the real world, the data that goes first into the queue is the first one to be retrieved. That is why queues are sometimes called as First-In-First-Out data structure. In case of queues, we saw that data is inserted both from one end but in case of Queues; data is added to one end (known as REAR) and retrieved from the other end (known as FRONT). The data first added is the first one to be retrieved while in case of queues the data last added is the first one to be retrieved. A few points regarding Queues: Queues: It is a linear data structure; linked lists and arrays can represent it. Although representing queues with arrays have its shortcomings but due to simplicity, we will be representing queues with arrays in this article. Rear: A variable stores the index number in the array at which the new data will be added (in the queue). Front: It is a variab...
Introduction to Algorithms, Second Edition
2007-07-02 06:00:00 Aimed at any serious programmer or computer science student, the new second edition of Introduction to Algorithms builds on the tradition of the original with a truly magisterial guide to the world of algorithms. Clearly presented, mathematically rigorous, and yet approachable even for the math-averse, this title sets a high standard for a textbook and reference to the best algorithms for solving a wide range of computing problems.With sample problems and mathematical proofs demonstrating the correctness of each algorithm, this book is ideal as a textbook for classroom study, but its reach doesn't end there. The authors do a fine job of explaining each algorithm. (Reference sections on basic mathematical notation will help readers bridge the gap, but it will help to have some math background to appreciate the full achievement of this handsome hardcover volume.) Every algorithm is presented in pseudo-code, which can be implemented in any computer language, including C/C++ and Java. ...
Insertion and Deletion of elements in a Sorted Array
2007-07-01 08:37:00 In the article Insertion and Deletion of elements in an Array, we saw how data is inserted and deleted in an unsorted array. In that case, we needed two information, the element as well as the position, for insertion while for deletion we needed the position. In the case of sorted arrays insertion and deletion takes pace in a slightly different way. The following example will clarify this: Suppose we have the following array: arr[5]={1,2,3,4,5} And, we need to insert the element 6, so where it should be inserted? We can?t insert it at any place because then the array might not remain sorted. Therefore, we let the program to automatically calculate the position suitable for the new element, so that the array remains sorted even after insertion. Now, arr[5]={1,2,3,4,6} Now, suppose we wish to delete the element 6, in this case we don?t use the position for deletion because we don?t know where the element was placed by the program, so rather than referencing the position for deletion, ... |
|
 |
|
 |
