Write a program that finds the minimum total number of
shelves, including the initial one required for this loading
process.
Answer / raveathul farzaana.m.y
#include<stdio.h>
#include<conio.h>
void main()
{
char packet[25];
int
n,counta=0,countb=0,countc=0,countd=0,counte=0,countf=0,countg=0,counth=0,counti=0,countj=0,countk=0,countl=0,countm=0,countn=0,counto=0,countp=0,countq=0,countr=0,counts=0,countt=0,countu=0,countv=0,countw=0,countx=0,county=0,countz=0;
int shelves=0;
printf("Enter the number of packets:");
scanf("%d",&n);
printf("Enter the packets one by one:");
for(i=0;i<n;i++)
{
scanf("%c",&packet[i]);
}
for(i=0;i<n;i++)
{
if(a[i]==A)
counta++;
if(a[i]==B)
countb++;
if(a[i]==C)
countc++;
if(a[i]==D)
countd++;
if(a[i]==E)
counte++;
else if(a[i]==F)
if(a[i]==G)
countg++;
countif(a[i]==H)
counth++;
if(a[i]==I)
counti++;
if(a[i]==J)
countj++;
if(a[i]==K)
countk++;
if(a[i]==L)
countl++;
if(a[i]==M)
countm++;
if(a[i]==N)
countn++;
if(a[i]==O)
counto++;
if(a[i]==P)
countp++;
if(a[i]==Q)
countq++;
if(a[i]==R)
countr++;
if(a[i]==S)
counts++;
if(a[i]==T)
countt++;
if(a[i]==U)
countu++;
if(a[i]==V)
countv++;
if(a[i]==W)
countw++;
if(a[i]==X)
countx++;
if(a[i]==Y)
county++;
if(a[i]==Z)
countz++;
}
if(n>0)
{
if(counta>0)
shelves++;
if(countb>0)
shelves++;
if(countc>0)
shelves++;
if(countd>0)
shelves++;
if(counte>0)
shelves++;
if(countf>0)
shelves++;
if(countg>0)
shelves++;
if(counth>0)
shelves++;
if(counti>0)
shelves++;
if(countj>0)
shelves++;
if(countk>0)
shelves++;
if(countl>0)
shelves++;
if(countm>0)
shelves++;
if(countn>0)
shelves++;
if(counto>0)
shelves++;
if(countp>0)
shelves++;
if(countq>0)
shelves++;
if(countr>0)
shelves++;
if(counts>0)
shelves++;
if(countt>0)
shelves++;
if(countu>0)
shelves++;
if(countv>0)
shelves++;
if(countw>0)
shelves++;
if(countx>0)
shelves++;
if(county>0)
shelves++;
if(countz>0)
shelves++;
printf(shelves)
}
else
{
printf("-1");
cont... after this
| Is This Answer Correct ? | 17 Yes | 3 No |
DIRECTIONS for questions 8 and 9: Refer to the data below and answer the questions that follow. There are seven chapters in a mathematics book - A, B, C, D, E, F, and G. The instructor has to follow certain rules while teaching them. i. E cannot be taught before B and C. ii. D should be taught before C and G. iii. B cannot be taught before G. iv. F cannot be taught before C, D, and G. v. A should be taught before B is taught and the two should not be taught consecutively. Q8. If only four chapters are taught, which of the following has to be necessarily false? a) The instructor can get away without teaching F. b) The instructor can avoid teaching E. c) The instructor can avoid teaching C. d) The instructor can avoid teaching G. Q9. If only four chapters are to be taught, which of the following is necessarily true? a) A has to be taught. b) D has to be taught. c) B has to be taught. d) C has to be taught. Q8. If only four chapters are taught, which of the following has to be necessarily false? a) The instructor can get away without teaching F. b) The instructor can avoid teaching E. c) The instructor can avoid teaching C. d) The instructor can avoid teaching G. Q9. If only four chapters are to be taught, which of the following is necessarily true? a) A has to be taught. b) D has to be taught. c) B has to be taught. d) C has to be taught.
What are the different types of testing? What is SDLC? Manual of automated?How to choose among these two?
Hai friends this is Dara s. solanki, i done in B.Sc.(IT) i have an 2.3 years of exp in Manufacturing company in MIS giving support in SAP , 1 year back i did Sap course In MM Module. am trying from the day one to enter into the sap field but i was not.i kindly requesting all, please suggest me how to enter in to the SAP field. Looking for a job . i please help me and having any thing please let me know . i am in bangalore. my mail id is Dara.solanki@gmail.com. 8431455753
difference between multi relational OLAP & multidimensional OLAP
10. Write a program in āCā language that will perform the following operation on double link list. Each node of this list contains the address of previous as well as next node. The previous pointer of first node & next pointer of last node should contain null. 1. Creation of list with as many records as user want 2. Search a node in the list 3. Deletion at last position 4. Display 5. Exit Create separate functions for each operation. The create () will be used to create the list. It should accept no argument & return the address of the starting node. Search() will search a node in the list. It receives rollno as argument & return that node if found otherwise return null. The delete () function will delete the last node. It does not receive any argument & return structure type value at last position. The starting node of the double list must be declared as external pointer variable. Each element of double link list will contain the following information Roll No, Std Name, Course. Use do-while loop & switch case for generating the above menu. The format of the output should is given below: S.No. Roll No. Student Name Course 1 cse01 Anil Singh B.Tech
the controller valve fisher error: travel ??? not output input ok
THERE iS ANY DEFAULT CONNECTION STRING FOR WINDOWS APPLICATION IN VB.NET2005 FROM WHICH AFTER CHANGING PROJECT DIRECTORY TO OTHER PLACE AND WE DID NOT CHANGE DATABASE PATH INB SQL CONNECTION ?????
Can have i call constructor in interface?
Explain work?
What is the definition of gain?
Q1.What do you mean by static routing and dyanamic routing? Q2.What do you mean by template in c++? Explain. Q3.What do you mean by VSAT in data communication?
What does balanced amplifier consist of?
Civil Engineering (5086)
Mechanical Engineering (4456)
Electrical Engineering (16639)
Electronics Communications (3918)
Chemical Engineering (1095)
Aeronautical Engineering (239)
Bio Engineering (96)
Metallurgy (361)
Industrial Engineering (259)
Instrumentation (3014)
Automobile Engineering (332)
Mechatronics Engineering (97)
Marine Engineering (124)
Power Plant Engineering (172)
Textile Engineering (575)
Production Engineering (25)
Satellite Systems Engineering (106)
Engineering AllOther (1379)