Introduction to Robotics
Introduction to Robotics Robotics is a branch of engineering and science that includes electronics engineering, mechanical engineering and computer science and so on. This branch deals with the design, construction, use to control robots, sensory feedback and information processing. These are some technologies which will replace humans and human activities in coming years. What is […]
Corporate Culture and Technological Skills
Corporate Culture and Technological Skills Corporate culture and technological skills are crucial aspects of success in today’s business world. Understanding the importance of a strong corporate culture and the technological skills required for various industries is essential for both employees and organizations. This lecture note aims to provide students with an understanding of these key […]
C Programming Entire Topics Practice
C Programming Entire Topics Practice Topics-01: Overview of C Problem – 01 Printing “Hello World!”. #include <stdio.h> int main() { printf(“Hello World!”); return 0; } Problem – 02 Printing two sentences on two different lines. (Using of \n) #include <stdio.h> int main() { printf(“Hello\nWorld!”); return 0; } Problem – 03 Print a line in a […]
Probability Math Basic Concept
Probability Math Basic Concept Random Experiment: An experiment in which all possible outcomes are known and the exact output cannot be predicted in advance is called a randomexperiment. Sample Space When we perform an experiment, then the set S of all possible outcomes is called the sample space. If we through a dice, the sample […]
Complex Engineering Problem
Complex Engineering Problem A Complex Engineering Problem (CEP) refers to a challenge or task in engineering that is characterized by the following features: 1. Complexity of Scope 2. Uncertainty 3. High Level of Technical Knowledge 4. Interdisciplinary Nature 5. Impact on Society and Environment 6. Resource Constraints 7. Need for Innovation 8. Global Context Examples […]
Selection Sort Algorithms
Selection Sort Algorithm Selection Sort is a comparison-based sorting algorithm. It sorts an array by repeatedly selecting the smallest (or largest) element from the unsorted portion and swapping it with the first unsorted element. This process continues until the entire array is sorted.
Quick Sort Algorithms
Quick Sort Algorithm QuickSort is a sorting algorithm based on the Divide and Conquer that picks an element as a pivot and partitions the given array around the picked pivot by placing the pivot in its correct position in the sorted array. How does QuickSort Algorithm work? QuickSort works on the principle of divide and conquer, breaking down the […]
Radix Sort Algorithms
Radix Sort Algorithm Radix Sort is a linear sorting algorithm that sorts elements by processing them digit by digit. It is an efficient sorting algorithm for integers or strings with fixed-size keys. Rather than comparing elements directly, Radix Sort distributes the elements into buckets based on each digit’s value. By repeatedly sorting the elements by their […]
Insertion Sort Algorithms
Insertion Sort Algorithm Insertion sort is a simple sorting algorithm that works by iteratively inserting each element of an unsorted list into its correct position in a sorted portion of the list. It is like sorting playing cards in your hands. You split the cards into two groups: the sorted cards and the unsorted cards. Then, […]
Merge Sort Algorithms
Merge Sort – Data Structure and Algorithms Tutorials Merge sort is a sorting algorithm that follows the divide-and-conquer approach. It works by recursively dividing the input array into smaller subarrays and sorting those subarrays then merging them back together to obtain the sorted array. In simple terms, we can say that the process of merge sort is to divide the […]