Author Archives: Expert_Talk

Heaps are regular binary trees with two special characteristics. (i) Complete Tree (ii) Order Property Heaps must be Complete Binary Trees. With order property it means that every node must have more(less) or equal key values than its child nodes. Heap is a special data structures that are useful for specific use-cases such as sorting andContinue reading “Understanding Heap”

1.What is the average time complexity of Insertion sort a).O(1) b).O(n) c).O(n^2) d). depends on size of array 2. Representation of data structure in memory is known as: a). Recursion b). File Structure c). ADT d). asymptotic-notation 3.Using RAM model, in how many steps does the statement A[i] = B[i][j] + C will be executed?Continue reading “Practise Quiz – Computer Algorithms”

1. Representation of data structure in memory is known as: a). Recursion b). File Structure c). ADT d). asymptotic-notation 2.What is the time complexity of creating a new node of a linked list? a). O(1) b).O(n) c). O(n^2) d). depends on size of linked list 3.An ADT is defined to be a mathematical model ofContinue reading “Practise -Quiz Data Structures”

Linked List is a commonly used linear data structure which consists of group of nodes in a sequence. Each node consists of two fields which holds data and the address of the next node. This connection of nodes in a sequence makes a linked list. It is primarily used in trees and graphs based representations. A linked list isContinue reading “Fundamentals of Linked List”

Sorting is arranging the data in ascending or descending order.  There are number of sorting techniques available which differs in use of various data structure and its storage. Various sorting methods have been explored here. Various terms used with sorting are as follows: Lets develop good understanding on various sorting techniques. [Click the following linksContinue reading “Sorting Techniques”

Algorithm analysis is dealt with the execution or running time of various operations involved. Running time of an operation can be defined as number of computer instructions executed per operation. The time complexity of an algorithm is commonly expressed using asymptotic notations known as Big O – (O), Big Theta – (Θ), Big Omega (Ω) Space Complexity ofContinue reading “Analyzing Time and Space Complexity”

Use this page for sharing your knowledge on week -3 Topics

Algorithms are important  because they help programmers to create efficient and error free programs. In real life, there exist many different algorithms for the same problem. Therefore, to realize which algorithm will be best for our problem requires clear understanding of some founding concept of algorithms, which we will discuss here. Two important reasons that provide efficiency toContinue reading “Foundation of Computer Algorithms”

Searching is an operation which finds the location of a given element in a list. The search is said to be successful or unsuccessful depending on whether the element that is to be searched is found or not. Primarily we have two searching techniques named as Linear Search and Binary Search. Sorting refers to theContinue reading “Searching & Sorting Techniques”

 Data Structures are structures programmed to store ordered data, so that various operations can be performed on it easily. It represents the knowledge of data to be organized in memory. It should be designed and implemented in such a way that it reduces the complexity and increases the efficiency. We select these data structures basedContinue reading “Fundamental of Data Structures”