Aggregation and composition are the types of Association. The primary difference between aggregation and composition is that aggregation implicit a relationship where the child can exist independently of the parent. On the other hand, composition insinuates a relationship where the child cannot exist independent of the parent. Object-Oriented programming is a common paradigm which is used in software development. The object is an instance of a class which are created by classes. The objects … [Read more...]

Tree and graph come under the category of non-linear data structure where tree offers a very useful way of representing a relationship between the nodes in a hierarchical structure and graph follows a network model. Tree and graph are differentiated by the fact that a tree structure must be connected and can never have loops while in the graph there are no such restrictions. A non-linear data structure consists of a collection of the elements that are distributed on a plane which means there … [Read more...]

C++ and Java are most commonly used programming languages. Java has a strong influence of C++ as it was developed after C++ and both support OOP (Object Oriented Programming) paradigms. The crucial difference which differentiates both of the programming languages is that C++ is platform dependent while Java is platform independent. Java source code is converted into bytecode when compiled. At runtime, the interpreter executes this bytecode and gives output. Mostly Java is an interpreted … [Read more...]

B-tree and Binary tree are the types of non-linear data structure. Although the terms seem to be similar but are different in all aspects. A binary tree is used when the records or data is stored in the RAM instead of disk as the accessing speed of RAM is much higher than the disk. On the other hand, B-tree is used when the data is stored in the disk it reduces the access time by reducing the height of the tree and increasing the branches in the node. Another difference between the B-tree and … [Read more...]

Sorting is one of the major task in computer programs in which the elements of an array are arranged in some particular order. Sorting makes searching easier. Bubble sort and Selection sort are the sorting algorithms which can be differentiated through the methods they use for sorting. Bubble sort essentially exchanges the elements whereas selection sort performs the sorting by selecting the element. Another considerable difference between the two is that bubble sort is stable algorithm while … [Read more...]

The major difference between BFS and DFS is that BFS proceeds level by level while DFS follows first a path form the starting to the ending node (vertex), then another path from the start to end, and so on until all nodes are visited. Furthermore, BFS uses the queue for storing the nodes whereas DFS uses the stack for traversal of the nodes. BFS and DFS are the traversing methods used in searching a graph. Graph traversal is the process of visiting all the nodes of the graph. A graph is a … [Read more...]

HTML and CSS are the core web scripting languages, the primary use of which is to create web pages and web application. The crucial difference between the two is that HTML is used for the creation of the webpages and CSS is used to control the styling and layout of web pages. In HTML, firstly you write words then add elements or tags to it, which thereafter appear on your page. Through this way, the browser gets to know the heading of the page, beginning and ending of the paragraph, and so … [Read more...]

The common difference between Applet and Application is that application starts its execution through main() method conversely an applet doesn't use method main() instead it initialize through init(). Applets are small programs generally written to be transmitted across the internet and automatically executed by java compatible web browser. And applications are stand-alone programs written for performing general operations by the user directly, and it doesn't need any JAVA enabled APIs' … [Read more...]

Linear search and binary search are the two methods which are used in arrays for searching the elements. Searching is a process of finding an element within the list of elements stored in any order or randomly. The major difference between linear search and binary search is that binary search takes less time to search an element from the sorted list of elements. So it is inferred that efficiency of binary search method is greater than linear search. Another difference between the two is … [Read more...]

The major difference between Array and Linked list regards to their structure. Arrays are index based data structure where each element associated with an index. On the other hand, Linked list relies on references where each node consists of the data and the references to the previous and next element. Basically, an array is a set of similar data objects stored in sequential memory locations under a common heading or a variable name. While a linked list is a data structure which contains a … [Read more...]