Posts

Showing posts with the label C theory

ACP Unit-4 Programs

ACP----Unit 4 Programs Note: 7 programs done..............! 1. Write a program to display contents of file on the screen. The program should ask for file name. Display the contents in capital case. ANS #include<stdio.h> #include<conio.h> void main() { FILE *fp; char letter,file_name[100]; clrscr(); printf("Enter file name(with extention) = "); gets(file_name); fp=fopen(file_name,"r"); if(fp == NULL) { printf("\nFile doesn't exits...!"); getch(); exit(0); } printf("\n"); while(!feof(fp)) { letter=getc(fp); if(letter>='a' && letter<='z') { printf("%c",letter-32); } else { printf("%c",letter); } } fclose(fp); getch(); } 2. Write a program to find size of the file. ANS #include<stdio.h> #include<conio.h> void main() { FILE *fp; ...

IPLC objective question answer

IPLC exam objective types question and answer  click to preview 

IPLC Most important questions

Explain Machine, Assembly and high level language with their limitations and features. Type casting. Basic structure of c.  Recursive function. Explain Operators. Explain function printf, scanf, getch, getchar, putchar. Explain switch case statments with all its limitation. call by value and call by refernce. Explain statements : continue go to break strlen() strcmp() Explain Array. types of array. how to intialized array. Differnce between :  Machin langauage and high level language Do..while loop and While loop  break and continue statements Precedence and Associativity For Answer Click here  

IPLC university old question papers

Image
IPLC OLD Question papers.. No answer availible....for Important question answer click here Images :

IPLC Theory Exam Question & Answers

Image
2 question answer are coming soon  :  1. Explain Machine level language with all its limitations. ANS) Machine Language : Machine Language is the only language that is directly understood by the computer. It does not needs any translator program.  When this sequence of codes is fed to the computer, it recognizes the codes and converts it in to electrical signals needed to run it. We also call it machine code and it is written as strings of 1's (one) and 0’s (zero). For example, a program instruction may look like this: 1011000111101 It is considered to the first generation language. It is efficient for the computer but very inefficient for programmers. It is not an easy language for programmer to learn because of its difficult to understand. It is also difficult to debug the program written in this language. The only advantage is that program of machine language run very fast because no translation program is required for the CPU. Disadvantag...

Important Algorithm For CPRG Theory Exam

Most important Algorithms for IPLC theory exam : 1. Write an algorithm to input a number and display factorial of that number. ANS) //Algorithm to calculate the factorial of a number step 1. Start step 2. Read the number n step 3. declare              i=1, fact=1 step 4. Repeat step 4 through 6 until i=n step 5. fact=fact*i step 6. i=i+1 step 7. Print fact step 8. Stop 2. Write an algorithm to Generate Fibonacci series. ANS) Step 1: Start Step 2: Declare variables n, n1, n2, n3, i. Step 3: Accept value of N from user. Step 4: if N < 2, display message “Enter num greter than 2” and go to step 9. Step 5: Initialize variables n1 = 0, n2 = 1, i = 0 Step 6: Display n1, n2   Step 7: Compute n3 = n1 + n2 Step 8: Repeat following statements until i < N         Display N3         N1 = N2         N2 = N3       ...