Latest Post

Blogger Templates In Free Download Tech News Blogger Template is a premium flat, clean, super flexible and fully responsive blogger theme, best suited for Technology, News or Blog Websites. Tech News Blogger Template comes with modern design, speed and ads optimization. We put a lot of effort and research in making this Blogger Theme the best one you can find out …

Pharmaceutical Chemistry-1 MCQ Questions With Answers Pharmaceutical chemistry is the study of drugs, and it involves drug development. This includes drug discovery, delivery, absorption, metabolism, and more. Chemical Formula Of Potassium Permanganate is (A) KMnO4 (B) K2MnO4 (C) KIO3 (D) K2ZnO2 Ans – A Which is also known as dry ice (A) Potassium hydroxide (B) Carbon dioxide (C) Calcium Carbonate …

Programs for printing Pyramid patterns – TechWorld4U09 Programs for printing Pyramid patterns in C #include <stdio.h> int main() { int i, j, rows; printf("Enter the number of rows: "); scanf("%d", &rows); for (i = 1; i <= rows; ++i) { for (j = 1; j <= i; ++j) { printf("* "); } printf("\n"); } return 0; } Output 1 1 …

Write a Java Program for Selection Sort The selection sort algorithm sorts an array by repeatedly finding the minimum element (considering ascending order) from unsorted part and putting it at the beginning. class SelectionSort { void sort(int arr[]) { int n = arr.length; for (int i = 0; i < n-1; i++) { int min_idx = i; for (int j …

Write a Java Program for HeapSort Heap sort is a comparison-based sorting technique based on BinaryHeap data structure. It is similar to Selection sort where we first find the minimum element and place the minimum element at the beginning. We repeat the same process for the remaining elements. public class HeapSort { public void sort(int arr[]) { int n = …

Data Structure MCQ (Multiple Choice Questions) – A data structure is a particular way of organizing data in a computer so that it can be used effectively. For example, we can store a list of items having the same data-type using the array data structure. This page contains detailed tutorials on different data structures (DS) with topic-wise problems. Also Read:-VueJs …

Sum of Two Numbers in Java In Java, finding the sum of two or more numbers is very easy. First, declare and initialize two variables to be added. Another variable to store the sum of numbers. Apply mathematical operator (+) between the declared variable and store the result. The following program calculates and prints the sum of two numbers. public …

D Pharmacy Biochemistry And Clinical Pathology MCQ Questions And Answers D-pharmacy Students in this article we have provided Biochemistry and clinical pathology mcq with answers. biochemistry and clinical pathology mcq questions is ideal for students who are in first year of D-pharmacy course.In this biochemistry and clinical pathology d pharmacy mcq with the help of biochemistry and clinical pathology mcq …

How to Implement traverse a Binary tree in Preorder in Java using Recursion Steps on Preorder Traversal Algorithm visit the nodevisit the left subtreevisit the right subtree import java.util.Stack; class Node { int data; Node left, right; public Node(int key) { data = key; left = right = null; } } class Main { public static void preorderIterative(Node root) { …

Program in C to Find in PreOrder,PostOrder and InOrder Tree Traversals Write A Program to find PreOrder, PostOrder and InOrder Tree Traversals in C language #include <stdio.h> #include <stdlib.h> struct node { int data; struct node* left; struct node* right; }; struct node* newNode(int data) { struct node* node = (struct node*)malloc(sizeof(struct node)); node->data = data; node->left = NULL; node->right …

Selection Sort C Program The selection sort algorithm sorts an array by repeatedly finding the minimum element from unsorted part and putting it at the beginning. #include <stdio.h> void swap(int *xp, int *yp) { int temp = *xp; *xp = *yp; *yp = temp; } void selectionSort(int arr[], int n) { int i, j, min_idx; for (i = 0; i …

Merge Sort Program in C Write a C Program to find Merge Sort . Merge short is a sorting technique based on divide and conquer technique. #include <stdio.h> #define max 10 int a[11] = { 10, 14, 19, 26, 27, 31, 33, 35, 42, 44, 0 }; int b[10]; void merging(int low, int mid, int high) { int l1, l2, …