Search This Blog

Programming By Veer

Here Most Of The Program Which You Don't Find Easily On Other Website. Hadoop Tutorials http://hadooptospark.blogspot.in

Home
github

More…

Posts

Showing posts with the label powerOfTwo

Show All

Power Of Two Code using java

Get link
Facebook
X
Pinterest
Email
Other Apps

- November 03, 2019

Labels

270 degree
algorithm
amazon
array
b3
c langauge
c program
cpu scheduling program using c
data structure
Dynamic Programming

facebook
fb
google
image
interview
Kadane's Algorithm
Largest Sum Contiguous Subarray
linklist
merge linklist
metrix transpose
pointer
powerOfTwo
preemitive shortest job first scheduling program
program
rotate
Rotate a matrix 270 degree AntiClockWise
rotate metrix
sortest job first scheduling
Valid Parentheses
veer dhakad
void pointer
yahoo

Show more Show less

For Hadoop Tutorial Click Here #include<stdio.h> #include<string.h> void main(){ char frame[50][50],str[50][50]; char flag[10]; strcpy(flag,"flag"); char esc[10]; strcpy(esc,"esc"); int i,j,k=0,n; strcpy(frame[k++],"flag"); printf("Enter no.of String :\t"); scanf("%d",&n); printf("Enter String \n"); for(i=0;i<=n;i++) { gets(str[i]); } printf("You entered :\n"); for(i=0;i<=n;i++) { puts(str[i]); } printf("\n"); for(i=1;i<=n;i++) { if(strcmp(str[i],flag)!=0 && strcmp(str[i],esc)!=0) { strcpy(frame[k++],str[i]); } else { strcpy(frame[k++],"esc"); strcpy(frame[k++],str[i]); } } strcpy(frame[k++],"flag"); ...

Rotate a matrix 270 degree AntiClockWise

- July 29, 2017

#include<stdio.h> void printMt(int mat[][4]) { int i, j; for (i = 0; i < 4; i++) { for (j = 0; j < 4; j++) { printf("%d ", mat[i][j]); } printf("\n"); } } void AntiClock90(int mat[][4]) { int i, j, t; for (i = 0; i < 4 / 2; i++) { for (j = i; j < 4; j++) { t = mat[4 - i - 1][j]; mat[4 - i - 1][j] = mat[i][j]; mat[i][j] = t; } } printf("90 anticlock\n"); printMt(mat); } void Anti270(int mat1[][4]) { int i,j,t; for(i=0; i<4/2; i++) { ...

Find String Contains Valid Parentheses or Not

- November 03, 2019

boolean isValid(String str) { Stack<Character> st=new Stack<Character>(); for(char ch:str.toCharArray()) { if(ch=='['||ch=='('||ch=='{') { st.push(st); }else if(ch==')'&&!st.isEmpty()&&st.peek()=='('){ st.pop(): }else if(ch=='}'&&!st.isEmpty()&&st.peek()=='}'){ st.pop(): }else if(ch=='}'&&!st.isEmpty()&&st.peek()=='{'){ st.pop(): }else{ return false; } } return st.isEmpty(); }

Finding the length of connected cells of 1's (regions) in an matrix of 1's and 0's

- July 21, 2019

import java.io.*; class GFG { static int max = 0; static int count = 0; public static void traverse(int a[][], int r, int c, int i, int j) { if (i >= r || j >= c || i < 0 || j < 0) { return; } if (a[i][j] == 0) { return; } else { a[i][j] = 0; count++; traverse(a, r, c, i - 1, j); traverse(a, r, c, i, j - 1); traverse(a, r, c, i + 1, j); traverse(a, r, c, i, j + 1); traverse(a, r, c, i - 1, j - 1); traverse(a, r, c, i + 1, j + 1); traverse(a, r, c, i - 1, j + 1); traverse(a, r, c, i + 1, j - 1); } } public static void main(String[] args) { int R = 5; int C = 5; int a[][] = { { 0, 0, 0, 0, 0}, { 0, 1, 1, 0, 0}, { 0, 0, 1, 0, 1}, { 1, 0, 0, 0, 1}, { 0, 1, 0, 1, 1} }; for...

Cyclic redundancy check program using c

- March 01, 2017

#include<stdio.h> void main() { int Data[100],n,Div[20],d,i,j,t[20],t1,k; printf("\n enter how many bit in data and div"); scanf("%d %d",&n,&d); int p[20]; printf("\n enter data bit"); for(i=0;i<n;i++) { scanf("%d",&Data[i]); } printf("i==%d",i); for(j=i;j<n+d-1;j++) { Data[j]=0; } printf("\n enter div bit"); for(i=0;i<d;i++) { scanf("%d",&Div[i]); p[i]=0; } for(i=0;i<n+d-1;i++) { printf("\t %d",Data[i]); } t1=n+d-1; i=0; while(i<t1) { j=0; while(p[j]!=1&&j<d) { ...

CHECKSUM USING C

- March 01, 2017

#include<stdio.h> static int c; int Add(int a,int b) { if(a==0&&b==0&&c==1) { c=0; return 1; } if(a==0&&b==1&&c==1) { c=1; return 0; } if(a==0&&b==0&&c==0) { c=0; return 0; } if(a==1&&b==1&&c==1) { c=1; return 1; } if(a==1&&b==0&&c==0) { c=0; return 1; } if(a==1&&b==0&&c==1) { c=1; return 0; } if(a==0&&b==1&&c==0) { c=0; return 1; } if(a==1&&b==1&&c==0) { c=1;return 0; } } int main() { int d[32]={1,1,1,0,0,1,1,1,1,1,0,1,1,1,0,1,0,0,1,1,1,0,0,1,1,0,1,0,1,0,0,1},n=32,t; int d1=8,i,j; int carry[8]={0,0,0,0,0,0,0,0}; int checksum[8]={0}; for(i=0;i<n;i=i+d1) { for(j=7;j>=0;j--) { checksum[j]=Add(d[i+j],checksum[j]); } while(c!=0) { ...

EASIEST WAY FOR MERGE TWO LINKLIST

- July 06, 2017

/* Link list Node struct Node { int data; Node* next; }; */ Node* SortedMerge(Node* head1, Node* head2) { struct Node *head,*last; if(head1==NULL) { return head2; } if(head2==NULL) { return head1; } if(head1&&head2) { if(head1->data<head2->data) { last=head1; head1=last->next; } else { last=head2; head2=last->next; } } head=last; while(head1...

Power Of Two Code using java

- November 03, 2019

First Missing Positive

- September 10, 2021

class Solution { public int firstMissingPositive(int[] nums) { for(int i=0;i<nums.length;i++){ int correctPos=nums[i]-1; while(((1<=nums[i])&&(nums[i]<=nums.length))&&nums[i]!=nums[correctPos]) { int t=nums[i]; nums[i]=nums[correctPos]; nums[correctPos]=t; correctPos=nums[i]-1; ...

c program for find leap year using c

- May 30, 2017

#include<stdio.h> int main() { int year; printf("enter year"); scanf("%d",&year); if(year%100!=0) { if(year%4==0||year%400==0) { printf("leap year"); } else { printf("not leap year"); } } }

VISITORS COUNT