Some assignment question and answer of digital logic of Saptagandaki college

  Digital logic question and answer    Download This Assignment Provided by Anuj Bhurtel Thank you so much for sharing. Its Checked from Saptagandaki college Teacher.   install our bcanotesnepal  application from playstore :  BCA Notes NepalDo not forget...

BCA First Semester||Society and Technology|| Four Chapter Complete Notes||

BCA First smester Chapter Four Complete 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 or...

BCA Second Semester Micro-Processor and computer Architecture Notes

We are sharing to you Micro-Processor and computer Architecture Notes complete notes of BCA Secondsemester to you for only Study Purpose not Third so we hope its notes give to  you more help with...

Numerical Method Unit one || Solution of NonLinear Equations|| BCA Fourth Semester

Numerical Method Unit one || Solution of NonLinear Equations Numerical Method complete Notes of unit one These Topics are included in Notes Introduction, Types of equation, Error in computing, The Bisection Method The method of false...

DB MS Lab report file Database management system BCA Fourth semester TU

DBMS Labreports file bca fourth semester bca tu Database management system  Special thanks to Sworup Khatri Database management system lab reports file 4th semester fourth semester dbms lab file, bca 4th sem dbbms lab file install our bcanotesnepal  application...

ADDITON OF TWO POLYNOMIAL

  BCA Third Semester ADDITON OF TWO POLYNOMIAL datastructure #include<stdio.h> #include<malloc.h> #include<conio.h> struct link{ int coeff; int pow; struct link *next; }; struct link *poly1=NULL,*poly2=NULL,*poly=NULL; void create(struct link *node) { char ch; do { // clrscr(); printf("n Enter coeff : "); scanf("%d",&node->coeff); printf(" Enter power : "); scanf("%d",&node->pow); node->next=(struct link*)malloc(sizeof(struct link)); node=node->next; node->next=NULL; printf("n Continue(y/n):"); ch=getch(); } while(ch=='y' || ch=='Y'); } void show(struct link *node) { while(node->next!=NULL) { printf("%dx^%d",node->coeff,node->pow); node=node->next; if(node->next!=NULL) printf("...

DBMS Concept tips and some notes for exam preparation BCA Fourth Semester

Database management system DBMS Concept tips and some notes for exam preparation BCA Fourth Semester database management system 2019 year question paper Solution some important question paper with solution Set 1 to 10 MCQ  DBMS...

Operating system2019 year Question and Answer with some Other Question and answer || BCA...

  operating system 2019 year question and answer  operating system    install our bcanotesnepal  application from playstore :  BCA Notes NepalDo not forget to like our facebook page : www.facebook.com/bcanotesnepal Facebook Groups  https://www.facebook.com/groups/bcanotesnepal Join In our Facebook Group...

Towers of Hanoi || BCA Third Semester || Data Structure

If you've gone through the tutorial on recursion, then you're ready to see another problem where recursing multiple times really helps. It's called the Towers of Hanoi. You are given a set of three pegs and nnn disks,...

Machine Learning Complete Notes BCA Eight Semester

Machine Learning Complete Notes BCA Eight Semester click here for Notes
error: sorry you can\\\\\\\\\\\\\\\'t copy this content!!