Blog

Generations of Computer

Introduction of Generations of Computer The evolution of computers is studied with generations of computer and is started in the 16th century and resulted in today’s modern machines. The present-day computer, however, has also undergone rapid change over the years.  Each new generation of computers is not only superior from their predecessor in processing and capabilities but also differs in looks and sizes. Each generation phase is distinguished from others based on the type of …

Loading

Read more

History or Origin of Computer

Introduction of History or Origin of Computer Perhaps the Computer is the most powerful and versatile tool created by human beings till now that can be known by studying the history or origin of the computer. In today’s scenario, the computer plays a major role in almost every aspect of life and influences our lives in one way or the other. Today, we can hardly find any area which is not influenced by computers. The …

Loading

Read more

Linked List

Memory Allocation/Linked List Method’s Link        Introduction A linked list is also known as a ‘Self Referential Structure‘ because a member of the structure/node is declared as a pointer that points to the same (but another) structure/node in the list. The structure is the most appropriate data variable to represent the linked list. Like arrays, a Linked list is also a primitive data structure. A linked list overcomes the disadvantages of an array …

Loading

Read more

Interview Questions in C++

The topic-wise interview questions in C++ are – OOPS Ques. : What is OOPS? Ques. : What is C++? Ques. : What is Data Hiding? Ques. : What is Encapsulation? Ques. : What is Abstraction? C++ Fundamental Ques. : What is C++? Ques. : What are the Data type in C++? Ques. : What is Operator in C++? Ques. : What is ‘cin’ in C++? Ques. : What is ‘cout’ in C++? Ques. : What …

Loading

Read more

Fundamental of Data Structure

Click Here for Dynamic Memory Allocation/De-allocation Methods Click Here for Difference between Malloc() and Calloc() Introduction of Fundamental of Data Structure Data structures are used in almost every program/software system. It is a data storage format to store different types of computer data differently. Both data structure and algorithm work together. The term data structure is used to describe the way data is stored in the computer’s memory. Definition Data structure is a logical or …

Loading

Read more

Difference Between in DS

Array & Linked List Difference between in DS  Slno. Array Linked List 01. They are static, i.e. size of an array is fixed. They are dynamic, i.e. size of a list is not fixed. 02. Memory is allocated/formed in the form of a stack. Memory is allocated/formed in the form of a heap. 03. Random access is efficient. Random access is inefficient. 04. Element rearranging is difficult/inefficient. Element rearranging is easy/efficient. 05. It is necessary to …

Loading

Read more

Reference Books in DS

The popular Reference Books in DS(Data Structure) are : Slno. Book Names Publications Author/Writer 1. C & Data Structures S. Chand Publications N.B. Venkateswarlu & E.V. Prasad 2. Data Structures using C Oxford Publications Reema Thareja 3. Data Structures in C — Noel Kalicharan 4. Data Structures using C — Aaron M. Tenenbaum,  Yedidyah Langsam and Moshe J. Augenstein 5. Data structures and Algorithms made easy — Narsimha Karumanchi 6. Data structures through C — Mr. …

Loading

Read more

Interview Questions in DS

Topics wise Interview Questions in DS Introduction & Fundamentals of DS Ques. : What is Data Structure? Ques. : What is the use of Data Structure in computers? Ques. : What are the types of Data Structures? Ques. : What is Linear Data Structure? Ques. : What is Non-Linear Data Structure? Ques. : What is File Structure and Storage Structure? (File structure- data storage in secondary memory and Storage structure- in main memory) Ques. : …

Loading

Read more

Miscellaneous Topics in DS

Miscellaneous Topics in DS or Data Structure Terminology Abstract Data Type(ADT) Abstract Data Types are a fundamental concept in computer science that allows developers to think about data structures at a high level, focusing on what they can do rather than how they are implemented. This abstraction is crucial for building complex systems that are modular, maintainable, and efficient. An Abstract Data Type (ADT) is a mathematical model for data types, where a data type …

Loading

Read more

Sorting

Sorting Introduction of Sorting It puts items in a list into a specific order for further use. Definition of Sorting Sorting is the process/technique of re-arrangement of data items (stored inside the memory) in some specific order(such as either in ascending order or in descending order or in alphabetical order or any other user-defined order) so that retrieval of information becomes easier. Characteristics of Sorting Sorting algorithms can be characterized in the following two ways:- (i) …

Loading

Read more