About Us

MKCE NOTES
Welcome you to the official page of MKCE NOTES. First of all thankyou for visiting our site😉.


MKCE NOTES is a programming notes sharing sites for solving creative problems.
In our site you can get free programming notes for C,JAVA,PYTHON languages. You can refer our site 
for examples of how to solve any problem using programming. Here you get many programming questions solved. Understand the concept and have fun with coding. Currently we only have notes for
C programming soon we are gonna add JAVA & PYTHON in our site, so stay connected. 


MISSION:
     
    To help the college students by providing them free programming notes for solving and understanding the programming problems given by their respective institutions.
    To help the coding geeks with tons of programming notes and problems.


VISION:

    To build a society with enriched coding knowledge irrespective of the field they work.
    
    


Comments

Post a Comment

Popular posts from this blog

Mukesh and Salima was looking to buy Organic Apples in the nearest fruits shop.But Shop Owner mixed the Hybrid apples in that Apple box. After sometimes Mukesh checking the box, he was confused among organic and hybrid apple. He started to count the hybrid apples. Please help to Mukesh Count the total number of hybrid apples in the box.

 #include <stdio.h> #include<string.h> int main() {int numofapples ,x,i,c=0; scanf("%d",&numofapples); int arr[100]={0}; for(i=0;i<numofapples;++i){     scanf("%d",&x);     arr[x]++; } for(i=0;i<100;++i){     if(arr[i]>1)c+=(arr[i]-1);     } printf("%d",c); return 0; }
Read more

On one beautiful Sunday Selvan went to Aaron's house for exam preparation. They have decided to study Mathematics subject because they have exams by coming Monday, Aaron is a master in Mathematics but Selvan is not so good in Mathematics so James trained with Selvan for getting a high score in the exam. After teaching some problems to Selvan.Aaron have given some tasks to Selvan to solve .The problem is to convert input float into a double. Can you help Selvan in finding the solution ?

 #include <stdio.h> int main() {float num1,num2; scanf("%f\n %f",&num1,&num2); double resnum1,resnum2; resnum1=num1; resnum2=num2; printf("%lf",resnum1); printf("\n%lf",resnum2);                return 0; }
Read more

Elavenil has a chessboard with N rows and M columns. In one step, he can choose two cells of the chessboard which share a common edge (that has not been cut yet) and cut this edge. Formally, the chessboard is split into two or more pieces if it is possible to partition its cells into two non-empty subsets S1 and S2 (S1∩S2=∅, |S1|+|S2|=NM) such that there is no pair of cells c1,c2 (c1∈S1,c2∈S2) which share a common edge that has not been cut.Elavenil does not want the board to split into two or more pieces. Compute the maximum number of steps he can perform while satisfying this condition.

 #include <stdio.h> int main() { int n,m; scanf("%d %d",&n,&m); printf("%d",(m-1)*(n-1)); return 0; }
Read more