BCA Third Semester || 2019 Year|| All Subject Question Paper || BCATU
BCA Third semester 2019 year question paper BCA TU its provide to for BCA third semester student for preparation an exam to score Goods marks and its provided from BCA Notes Nepal. if you ...
Don’t Care (X) Conditions in K-Maps
Don’t Care (X) Conditions in K-Maps
The “Don’t Care” conditions allow us to replace the empty cell of a K-Map to form a grouping of the variables. While forming groups of cells, we can consider a “Don’t...
BCA Third Semester Some Example of DFD Digram and Solution || SAD|| System analysis...
DFD Diagram
If you want to get a System Analysis and design Some example pdf file in your phone or laptop then scroll down and after you can see the comment box so click on...
Logic Simplification With Karnaugh Maps || BCA First Semester|| Digital Logic
The logic simplification examples that we have done so far could have been performed with Boolean algebra about as quickly. Real world logic simplification problems call for larger Karnaugh maps so that we may...
Larger 4-variable Karnaugh Maps ||BCA First Semester
Knowing how to generate Gray code should allow us to build larger maps. Actually, all we need to do is look at the left to right sequence across the top of the 3-variable map,...
Karnaugh Maps, Truth Tables, and Boolean Expressions || BCA First Semester
PDF File available in Last
Who Developed the Karnaugh Map?
Maurice Karnaugh, a telecommunications engineer, developed the Karnaugh map at Bell Labs in 1953 while designing digital logic based telephone switching circuits.
The Use of Karnaugh Map
Now...
BCA Third semester||Data Structure | Chapter 4 Linked List Notes
Linked List
BCA Third semester DSA Chapter four Notes . Its Note is Only available for Study Purpose not for Third Party. if you need More Notes of BCA Semester wise complete Please comment us...
SORTING USING SELECTION SORT
SORTING USING SELECTION SORT
SORTING USING SELECTION SORT
#include <stdio.h>
#include <conio.h>
int main()
{
int array, n, i, j, position, temp;
clrscr();
printf("Enter number of elements : n");
scanf("%d", &n);
printf("Enter %d integersn", n);
for (i= 0;i<n;i++)
scanf("%d", &array);
for (i=0;i<(n-1);i++)
{
position = i;
for (j=i+1;j<n;j++)
{
if ( array...
SORTING USING INSERTION SORT
SORTING USING INSERTION SORT
BCA Third Semester
Data Structure
#include <stdio.h>
#include <conio.h>
int main()
{
int n, array, c, d, t;
clrscr();
printf("Enter number of elements : ");
scanf("%d", &n);
printf("Enter %d integersn", n);
for (c = 0; c < n; c++) {
scanf("%d", &array);
}
for (c...
SORTING USING SHELL SORT
SORTING USING SHELL SORT
BCA third semester
data structure
#include<stdio.h>
#include<conio.h>
int array;
void ShellSort(int *array, int n)
{
int i,j,iter, jter, increment, temp;
for(increment = n/2;increment > 0; increment /= 2)
{
for(i = increment; i<n; i++)
{
temp = array;
for(j = i; j >= increment...