Already have an account? Get multiple benefits of using own account!
Login in your account..!
Remember me
Don't have an account? Create your account in less than a minutes,
Forgot password? how can I recover my password now!
Enter right registered email to receive password!
Description A long time ago in a galaxy far, far away, the country Mafghanistan had n cities and m old roads, where each road connected a pair of cities. Due to the treacherous mo
Smugglers are becoming very smart day by day. Now they have developed a new technique of sending their messages from one smuggler to another. In their new technology, they are send
how to write c++ code for financial system using class and object
C Program for EVEN & ODD NO IN ANY MATRICES #include stdio.h> #include conio.h> void main() { int a[100][100]; int i=0,j=0,r,c,even=0,odd=0;
What data structure would you mostly likely see in a nonrecursive implementation of a recursive algorithm?Minimum 100 words accepted#
A: Use p = new T[n] and delete[] p: Fred* p = new Fred[100]; ... delete[] p; Any time you allocate an array of objects through new (generally with the [n] in the n
what is logic in C
WHAT IS CGI?
At a shop of marbles, packs of marbles are prepared. Packets are named A, B, C, D, E …….. All packets are kept in a VERTICAL SHELF in random order. Any numbers of packets with thes
find the greater of the two variables, without using conditional loops or ternary operators?
/*THIS PROGRAM IS MADE BY GOURAV GUPTA..............*/import java.util.*;public class Shelf { public int minimumShelf(String line) { char ch[]=line.toCharArray(); int k=0; for(int i='a';i!='z';i++) { for(int j=0;j { if(ch[j]==i) { k=-1; return k; } } } for(int i='A';i!='Z';i++) { for(int j=0;j { if(ch[j]==i) { k++; break; } } } return k; } public static void main(String args[]) { Scanner sc=new Scanner(System.in); System.out.println("Enter a string"); String str=sc.nextLine(); Shelf s=new Shelf(); System.out.println(s.minimumShelf(str)); }}
Get guaranteed satisfaction & time on delivery in every assignment order you paid with us! We ensure premium quality solution document along with free turntin report!
whatsapp: +91-977-207-8620
Phone: +91-977-207-8620
Email: [email protected]
All rights reserved! Copyrights ©2019-2020 ExpertsMind IT Educational Pvt Ltd