eduguru 
IGNOU CIT-003 Web Based technology and Multimedia applications 2019-2020 pdf Question Paper Download Course Code Course Title Download CIT-003 Web Based technology and Multimedia applications IGNOU CIT-003 Web Based technology and Multimedia applications 2019-2020 pdf Question Paper Download
IGNOU CIT-002 Introduction to Information Technology 2019-2020 pdf Question Paper Download Course Code Course Title Download CIT-002 Introduction to Information Technology IGNOU CIT-002 Introduction to Information Technology 2019-2020 pdf Question Paper Download
CIT-001 Fundamentals of Computer System 2019-2020 Question Download Course Code Course Title Download CIT-001 Fundamentals of Computer System IGNOU CIT CIT-001 Fundamentals of Computer System 2019-2020 pdf Question Paper Download
Functions C Human is an intelligent species, but still cannot perform all of life’s tasks all alone. He has to rely on others. You may call a mechanic to fix up your bike, hire a gardener to mow your lawn, or rely on a store to supply you groceries every month. A computer program (except … Read more
C program to convert time in Hours:Minutes:Seconds to seconds /* C program to convert time in hours:minutes:seconds to seconds */ #include <stdio.h> int main() { int hour, minute, second, timeinsec; printf(“Enter the value for hour:”); /* get hour value from user*/ scanf(“%d”, &hour); printf(“Enter the value for minute:”); /* get minute value from user */ … Read more
Selection Sort Algorithm Selection sort is an algorithm that selects the smallest element from an unsorted list in each iteration and places that element at the beginning of the unsorted list. The Selection sort algorithm is based on the idea of finding the minimum or maximum element in an unsorted array and then putting it … Read more
Heap sort algorithm Heap sort was invented by John Williams. Heap is a complete binary tree in which every parent node be either greater or lesser than its child nodes. Heap sort is a comparison based sorting technique based on Binary Heap data structure. It is similar to selection sort where we first find the maximum element … Read more
Why new year start from 1st January 1 जनवरी से ही नए साल की शुरुआत क्यों? 1 जनवरी, यानी नए साल की शुरुआत। 1 जनवरी को कई देशों में नया साल मनाया जाता है। लेकिन बहुत से लोगों को यह पता नहीं है कि सदियों तक 1 जनवरी को नया साल नहीं होता था। कभी … Read more
Quick Sort Algorithm There are may versions of Quick sort, which is one of the most popular sorting methods due to its speed (O(N lgN) average, but O(N^2) worst case). Here’s the steps to follow: Pick a “pivot” item Partition the other items by adding them to a “less than pivot” sublist, or “greater than … Read more
Merge Sort Algorithm Merge Sort is a Divide and Conquer algorithm. It divides input array in two halves, calls itself for the two halves and then merges the two sorted halves. The merge() function is used for merging two halves. The merge(arr, l, m, r) is key process that assumes that arr[l..m] and arr[m+1..r] are sorted and merges … Read more