UGC NET June 2013 Computer Science and Applications Solved Paper

This post gives the question and answers for June 2013 Computer Science and Applications solved paper.

UGC NET JUNE 2013 PAPER - II COMPUTER SCIENCE AND APPLICATIONS

1. COCOMO stands for

(A) COmposite COst MOdel

(B) COnstructive COst MOdel

(C) COnstructive Composite MOdel

(D) COmprehensive Construction MOdel

2. Match the following :

a. Good quality i. Program does not fail for a specified time in a given environment

b. Correctness  ii. Meets the functional requirements

c. Predictable   iii. Meets both functional and non-functional requirements

d. Reliable       iv. Process is under statistical control

Codes:

a b c d

(A) iii ii iv i

(B) ii iii iv i

(C) i ii iv iii

(D) i ii iii iv

3. While estimating the cost of software, Lines Of Code (LOC) and Function Points (FP) are used tomeasure which one of the following ?

(A) Length of code

(B) Size of software

(C) Functionality of software

(D) None of the above

4. A good software design must have

(A) High module coupling, High module cohesion

(B) High module coupling, Low module cohesion

(C) Low module coupling, High module cohesion

(D) Low module coupling, Low module cohesion

5. Cyclometric complexity of a flow graph G with n vertices and e edges is

(A) V(G) = e+n–2

(B) V(G) = e–n+2

(C) V(G) = e+n+2

(D) V(G) = e–n–2

6. When the following code is executed what will be the value of x and y ?

int x = 1, y = 0;

y = x++;

(A) 2,1

(B) 2,2

(C) 1,1

(D) 1,2

7. How many values can be held by an array A(–1,m;1,m) ?

(A) m

(B) m2

(C) m(m+1)

(D) m(m+2)

8.What is the result of the expression (1&2)+(3/4) ?

(A) 1

(B) 2

(C) 3

(D) 0

9. How many times the word ‘print’shall be printed by the following program segment ?

for (i=1, i<2,i++)

for (j=1,j<2,j++)

for(k=1,k<2,k++)

printf("print/n")

(A) 1

(B) 3

(C) 6

(D) 8

10. Which of the following is not a type of Database Management System ?

(A) Hierarchical

(B) Network

(C) Relational

(D) Sequential

11. Manager’s salary details are to be hidden from Employee Table. This Technique is called as

(A) Conceptual level Datahiding

(B) Physical level Datahiding

(C) External level Datahiding

(D) Logical level Datahiding

12. A Network Schema

(A) restricts to one to many relationship

(B) permits many to many relationship

(C) stores Data in a Database

(D) stores Data in a Relation

13. Which normal form is considered as adequate for usual database design ?

(A) 2NF

(B) 3NF

(C) 4NF

(D) 5NF

14. If D1,D2, .. ..Dn are domains in a relational model, then the relation is a table, which is a subset of

(A) D1+D2+ … +Dn

(B) D1×D2× … ×Dn

(C) D1∪D2∪ … ∪Dn

(D) D1–D2– … –Dn

15. Which of the following addresses is used to deliver a message to the

correct application program running on a host ?

(A) Port

(B) IP

(C) Logical

(D) Physical

16. In ________ substitution, a character in the plaintext is always changed to the same character in the ciphertext, regardless of its position in the text.

(A) polyalphabetic

(B) monoalphabetic

(C) transpositional

(D) multialphabetic

17. In classful addressing, the IP address

190.255.254.254 belongs to

(A) Class A

(B) Class B

(C) Class C

(D) Class D

18.In hierarchical routing with 4800 routers, what region and cluster sizes should be chosen to minimize the size of the routing table for a three layer hierarchy ?

(A) 10 clusters, 24 regions and 20 routers

(B) 12 clusters, 20 regions and 20 routers

(C) 16 clusters, 12 regions and 25 routers

(D) 15 clusters, 16 regions and 20 routers

19. In IPv4 header, the ______ field is needed to allow the destination host to determine which datagram a newly arrived fragments belongs to.

(A) identification

(B) fragment offset

(C) time to live

(D) header checksum

20. Given L1=L(a*baa*) and L2=L(ab*). The regular expression corresponding to language L3 = L1/L2 (right quotient) is given by

(A) a*b

(B) a*baa*

(C) a*ba*

(D) None of the above

21. Given the production rules of a grammar G1 as

S1 → AB | aaB

A → a | Aa

B → b

and the production rules of a grammar G2 as S2 → aS2bS2 | bS2aS2 | λ

Which of the following is correct statement ?

(A) G1 is ambiguous and G2 is not ambiguous.

(B) G1 is ambiguous and G2 is ambiguous.

(C) G1 is not ambiguous and G2 is ambiguous.

(D) G1 is not ambiguous and G2 is not ambiguous.

22. Given a grammar : S1 → Sc, S → SA | A, A → aSb | ab, there is a rightmost derivation S1 ⇒ Sc ⇒ SAC ⇒ SaSbc Thus, SaSbc is a right sentential form, and its handle is

(A) SaS

(B) bc

(C) Sbc

(D) aSb

23. The equivalent production rules corresponding to the production rules S → Sα1 |Sα2 | β1 | β2 is

(A) S → β1 | β2, A → α1A | α2A | λ

(B) S → β1| β2| β1A | β2A, A → α1A | α2A

(C) S → β1 | β2, A → α1A | α2A

(D) S → β1 | β2 | β1A | β2A, A → α1A | α2A | λ

24. Given a Non-deterministic Finite Automation (NFA) with states p and r as initial and final states respectively and transition table as given below:

	A	B
P	-	Q
Q	R	S
R	R	S
S	R	S

The minimum number of states required in Deterministic Finite Automation (DFA) equivalent to NFA is

(A) 5

(B) 4

(C) 3

(D) 2

25. Which is the correct statement(s) for Non Recursive predictive parser ?

S1 : First(α) = {t| α ⇒

* tβ for some

string β} ⇒

*tβ

S2 : Follow(X)={ a| S⇒

*αXaβ for

some strings α and β}

(A) Both statements S1 and S2 are incorrect.

(B) S1 is incorrect and S2 is correct.

(C) S1 is correct and S2 is incorrect.

(D) Both statements S1 and S2 are correct.

26. Given an open address hash table with load factor α < 1, the expected number of probes in a successful search is

(A) Atmost 1 / α ln (1 – α / α)

(B) Atmost 1 / α ln (1  /1 – α)

(C) Atleast 1 / α ln (1 /1 – α)

(D) Atleast 1 / α ln (α /1 – α)

27. For a B-tree of height h and degree t, the total CPU time used to insert a node is

(A) O(h log t)

(B) O(t log h)

(C) O(t2h)

(D) O(th)

28. The time complexity to build a heap with a list of n numbers is

(A) O(log n)

(B) O(n)

(C) O(n logn)

(D) O(n2)

29. The value of postfix expression:

8 3 4 + – 3 8 2 / + * 2 $ 3 + is

(A) 17

(B) 131

(C) 64

(D) 52

30. Consider the following statements for priority queue :

S1 : It is a data structure in which the intrinsic ordering of the elements does determine the result of its basic operations.

S2 : The elements of a priority queue may be complex structures that are ordered on one or several fields.

Which of the following is correct ?

(A) Both S1 and S2 are incorrect.

(B) S1 is correct and S2 is incorrect.

(C) S1 is incorrect and S2 is correct.

(D) Both S1 and S2 are correct.

31. Repository of information gathered from multiple sources, storing under unified scheme at a single site is called as

(A) Data mining

(B) Meta data

(C) Data warehousing

(D) Database

32. The task of correcting and pre processing data is called as

(A) Data streaming

(B) Data cleaning

(C) Data mining

(D) Data storming

33. Using data p=3, q=11, n=pq, d=7 in RSA algorithm find the cipher text of the given plain text SUZANNE

(A) BUTAEEZ

(B) SUZANNE

(C) XYZABCD

(D) ABCDXYZ

34. The relation “divides” on a set of positive integers is ________.

(A) Symmetric and transitive

(B) Anti symmetric and transitive

(C) Symmetric only

(D) Transitive only

35. Give as good a big–O estimate as possible for the following functions :

(nlogn+n2)(n3+2) and (n!+2n) (n3+log(n2+1))

(A) O(n5+2n2) & O(n3*n!)

(B) O(n5) & O(n3*2n)

(C) O(n5) & O(n3* n!)

(D) O(n5+2n2) & O(n3*2n)

36. A test contains 100 true/false questions. How many different ways can a student answer the questions on the test, if the answer may be left blank also?

(A) 100P2

(B) 100C2

(C) 2100

(D) 3100

37. Which of the following connected simple graph has exactly one spanning tree ?

(A) Complete graph

(B) Hamiltonian graph

(C) Euler graph

(D) None of the above

38. How many edges must be removed to produce the spanning forest of a graph with N vertices, M edges and C connected components ?

(A) M+N–C

(B) M–N–C

(C) M–N+C

(D) M+N+C

39. Which of the following shall be a compound proposition involving the propositions p, q and r, that is true when exactly two of the p, q and r are true and is false otherwise?

(A) (p ∨ q ∧ ⎤ r) ∨ ( p ∧ q ∧ r) ∧ (⎤ p ∧ q ∨ r)

(B) (p ∧ q ∨ r) ∧ ( p ∧ q ∧ r) ∨ (⎤ q ∧ ⎤ p∧ ⎤ r)

(C) (p ∧ q ∧⎤ r) ∨ ( p ∧ ⎤ q ∧ r) ∨ (⎤ p ∧ q ∧ r)

(D) (p ∨ r ∧ q) ∨ ( p ∧ q ∧ r) ∨ (⎤ p ∧ q ∧ r)

40. The truth value of the statements : ∃!xP(x) → ∃xP(x) and ∃!x⎤ P(x) → ⎤∀xP(x), (where the notation ∃!xP(x) denotes the proposition “There exists a unique x such that P(x) is true”) are :

(A) True and False

(B) False and True

(C) False and False

(D) True and True

41. How many different Boolean functions of degree 4 are there ?

(A) 24

(B) 28

(C) 212

(D) 216

42. A Boolean operator s is defined as follows :

1 s 1 = 1, 1 s 0 = 0, 0 s 1 = 0 and

0 s 0 = 1

What will be the truth value of the expression (x s y) s z = x s (y s z) ?

(A) Always false

(B) Always true

(C) Sometimes true

(D) True when x, y, z are all true

43. Which one of the following is decimal value of a signed binary number 1101010, if it is in 2’s complement form ?

(A) – 42

(B) – 22

(C) – 21

(D) – 106

44. A set of processors P1, P2, ……, Pk can execute in parallel if Bernstein’s conditions are satisfied on a pairwise basis; that is

P1 || P2 || P3 || ….. || Pk if and only if :

(A) Pi || Pj for all i ≠ j

(B) Pi || Pj for all i = j+1

(C) Pi || Pj for all i < j

(D) Pi || Pj for all i > j

45. When a mobile telephone physically moves from one to another cell, the base station transfers ownership to the cell getting strongest signal. This process is known as _______.

(A) handoff

(B) mobile switching

(C) mobile routing

(D) cell switching

46. A virtual memory based memory management algorithm partially swaps out a process. This is an example of

(A) short term scheduling

(B) long term scheduling

(C) medium term scheduling

(D) mutual exclusion

47. Assuming that the disk head is located initially at 32, find the number of disk moves required with FCFS if the disk queue of I/O block requests are 98, 37, 14, 124, 65, 67 :

(A) 310

(B) 324

(C) 320

(D) 321

48. Let the page fault service time be 10 millisecond(ms) in a computer with

average memory access time being 20 nanosecond(ns). If one page fault is generated for every 106 memory accesses, what is the effective access time for memory ?

(A) 21 ns

(B) 23 ns

(C) 30 ns

(D) 35 ns

49. Consider the following UNIX command :

sort <in> temp; head – 30 <temp; rm temp

Which of the following functions shall be performed by this command ?

(A) Sort, taking the input from “temp”, prints 30 lines from temp and delete the file temp

(B) Sort the file “temp”, removes 30 lines from temp and delete the file temp

(C) Sort, taking the input from “in” And writing the output to “temp” then prints 30 lines from temp on terminal. Finally “temp” is removed.

(D) Sort, taking the input from “temp” and then prints 30 lines from “temp” on terminal. Finally “temp” is removed.

50. The mv command changes

(A) the inode

(B) the inode-number

(C) the directory entry

(D) both the directory entry and the Inode

Read More »

Add Comment

Labels: UGC Net Solved Paper Computer Science

Most Frequently Asked “C” Programs in Interviews

This blog find great resource for computer science student who have programmer and find job so this blog helpful to you so here are best collections of programs for fresher each of the questions have been answered with code. Most frequently asked programs in C language interviews.

List of “C” language Programs answered with code:

1. Write a program to find factorial of the given number.

Recursion: A function is called' recursive 'if a statement within the body of a function calls the same function. It is also called' circular definition '. Recursion is thus a process of defining something in terms of itself.

Program: To calculate the factorial value using recursion.

#include
int fact(int n);
int main(){
int x, i;
printf("En ter a value for x: \n");
scanf("%d" ,&x);
i = fact(x);
printf("\n Factorial of %d is %d", x, i);
return 0;
}int fact(int n){
/* n=0 indicates a terminatin g condition */
if (n
return (1);
}else{
/* function calling itself */
return (n * fact(n - 1));
/*n*fact(n -1) is a recursive expression */
}
}
Output:
Enter a value for x:
4
Factorial of 4 is 24
Explanatio n:
fact(n) = n * fact(n-1)
If n=4
fact(4) = 4 * fact(3) there is a call to fact(3)
fact(3) = 3 * fact(2)
fact(2) = 2 * fact(1)
fact(1) = 1 * fact(0)
fact(0) = 1
fact(1) = 1 * 1 = 1
fact(2) = 2 * 1 = 2
fact(3) = 3 * 2 = 6
Thus fact(4) = 4 * 6 = 24 Terminating condition( n infinite loop.

2. Write a program to check whether the given number is even or odd.
Program:
#include
int main(){
int a;
printf("En ter a: \n");
scanf("%d" ,&a);
/* logic */
if (a % 2 == 0){
printf("Th e given number is EVEN\n");
}
else{
printf("Th e given number is ODD\n");
}
return 0;
}
Output:
Enter a: 2
The given number is EVEN
Explanatio n with examples:
Example 1: If entered number is an even number
Let value of'a'entered is 4 if(a%2==0) then a is an even number, else odd.
i.e. if(4%2==0) then 4 is an even number, else odd.
To check whether 4 is even or odd, we need to calculate (4%2).
/* % (modulus) implies remainder value. */
/* Therefore if the remainder obtained when 4 is divided by 2 is 0, then 4 is even. */
4%2==0 is true
Thus 4 is an even number.
Example 2: If entered number is an odd number.
Let value of'a'entered is 7
if(a%2==0) then a is an even number, else odd.
i.e. if(7%2==0) then 4 is an even number, else odd.
To check whether 7 is even or odd, we need to calculate (7%2).
7%2==0 is false /* 7%2==1 condition fails and else part is executed */
Thus 7 is an odd number.

3. Write a program to swap two numbers using a temporary variable.
Swapping interchanges the values of two given variables.
Logic:
step1: temp=x;
step2: x=y;
step3: y=temp;
Example:
if x=5 and y=8, consider a temporary variable temp.
step1: temp=x=5;
step2: x=y=8;
step3: y=temp=5;
Thus the values of the variables x and y are interchanged.
Program:
#include
int main(){
int a, b, temp;
printf("En ter the value of a and b: \n");
scanf("%d %d",&a,&b);
printf("Be fore swapping a=%d, b=%d \n", a, b);
/*Swapping logic */
temp = a;
a = b;
b = temp;
printf("Af ter swapping a=%d, b=%d", a, b);
return 0;
}
Output:
Enter the values of a and b: 2 3
Before swapping a=2, b=3
After swapping a=3, b=2

4. Write a program to swap two numbers without using a temporary variable. Swapping interchanges the values of two given variables.
Logic:
step1: x=x+y;
step2: y=x-y;
step3: x=x-y;
Example:
if x=7 and y=4
step1: x=7+4=11;
step2: y=11-4=7;
step3: x=11-7=4;
Thus the values of the variables x and y are interchanged.
Program:
#include
int main(){
int a, b;
printf("En ter values of a and b: \n");
scanf("%d %d",&a,&b);
printf("Be fore swapping a=%d, b=%d\n", a,b);
/*Swapping logic */
a = a + b;
b = a - b;
a = a - b;
printf("Af ter swapping a=%d b=%d\n", a, b);
return 0;
}
Output:
Enter values of a and b: 2 3
Before swapping a=2, b=3
The values after swapping are a=3 b=2

5. Write a program to swap two numbers using bitwise operators.
Program:
#include
int main(){
int i = 65;
int k = 120;
printf("\n value of i=%d k=%d before swapping", i, k);
i = i ^ k;
k = i ^ k;
i = i ^ k;
printf("\n value of i=%d k=%d after swapping", i, k);
return 0;
}
Explanation:
i = 65; binary equivalent of 65 is 0100 0001
k = 120; binary equivalent of 120 is 0111 1000
i = i^k;
i...0100 0001
k...0111 1000
---------
val of i = 0011 1001
---------
k = i^k
i...0011 1001
k...0111 1000
---------
val of k = 0100 0001 binary equivalent of this is 65
---------( that is the initial value of i)
i = i^k
i...0011 1001
k...0100 0001
---------
val of i = 0111 1000 binary equivalent of this is 120
--------- (that is the initial value of k)

6. Write a program to find the greatest of three numbers.
Program:
#include
int main(){
int a, b, c;
printf("Enter a,b,c: \n");
scanf("%d %d %d",&a,&b,&c);
if (a>b&&a>c){
printf("a is Greater than b and c");
}
else if (b>a&&b>c){
printf("b is Greater than a and c");
}
else if (c>a&&c>b){
printf("c is Greater than a and b");
}
else{
printf("all are equal or any two values are equal");
}
return 0;
}
Output:
Enter a,b,c: 3 5 8
c is Greater than a and b
Explanation with examples:
Consider three numbers a=5,b=4,c= 8
if(a>b&&a>c) then a is greater than b and c
now check this condition for the three numbers 5,4,8 i.e.
if(5>4&&5>8) /* 5>4 is true but 5>8 fails */
so the control shifts to else if condition
else if(b>a&&b>c) then b is greater than a and c
now checking this condition for 5,4,8 i.e.
else if(4>5&&4>8) / * both the conditions fail */
now the control shifts to the next else if condition
else if(c>a&&c>b) then c is greater than a and b
now checking this condition for 5,4,8 i.e.
else if(8>5&&8>4) / * both conditions are satisfied */
Thus c is greater than a and b.

7. Write a program to find the greatest among ten numbers.
Program:
#include
int main(){
int a[10];
int i;
int greatest;
printf("Enter ten values:");
//Store 10 numbers in an array
for (i = 0; i<10; i++){
scanf("%d" ,&a[i]);
}
//Assume that a[0] is greatest
greatest = a[0];
for (i = 0; i<10; i++){
if (a[i]>greatest){
greatest = a[i];
}
}
printf("\n Greatest of ten numbers is %d", greatest);
return 0;
}
Output:
Enter ten values: 2 53 65 3 88 8 14 5 77 64 Greatest of ten numbers is 88
Explanation with example:
Entered values are 2, 53, 65, 3, 88, 8, 14, 5, 77, 64
They are stored in an array of size 10. let a[] be an array holding these values.

/* how the greatest among ten numbers is found */

Let us consider a variable'greatest' . At the beginning of the loop, variable'greatest' is assinged with the value of first element in the array greatest=a [0]. Here variable'greatest' is assigned 2 as a[0]=2.

Below loop is executed until end of the array'a[]';.

for(i=0; i
{
if(a[i]>gr eatest)
{
greatest= a[i];
}
}

For each value of'i', value of a[i] is compared with value of variable'greatest' . If any value greater than the value of'greatest' is encountered, it would be replaced by a[i]. After completion of'for'loop, the value of variable 'greatest' holds the greatest number in the array. In this case 88 is the greatest of all the numbers.

8. Write a program to check whether the given number is a prime.
A prime number is a natural number that has only one and itself as factors. Examples: 2, 3, 13 are prime
numbers.
Program:
#include
main(){
int n, i, c = 0;
printf("Enter any number n: \n");
scanf("%d" ,&n);
/*logic*/
for (i = 1; i
if (n % i == 0){
c++;
}
}
if (c == 2){
printf("n is a Prime number");
}
else{
printf("n is not a Prime number");
}
return 0;
}
Output:
Enter any number n: 7
n is Prime
Explanation with examples:
consider a number n=5
for(i=0;i
i.e. for(i=0;i
1st iteration: i=1;i
here i is incremented i.e. i value for next iteration is 2
now if(n%i==0) then c is incremented
i.e.if(5%1 ==0)then c is incremented, here 5%1=0 thus c is incremented.
now c=1;
2nd iteration: i=2;i
here i is incremente d i.e. i value for next iteration is 3
now if(n%i==0) then c is incremented
i.e.if(5%2 ==0) then c is incremented, but 5%2!=0 and so c is not incremented,  c remains 1
c=1;
3rd iteration: i=3;i
here i is incremented i.e. i value for next iteration is 4
now if(n%i==0) then c is incremented
i.e.if(5%3 ==0) then c is incremented, but 5%3!=0 and so c is not incremented, c remains 1
c=1;
4th iteration: i=4;i
here i is incremente d i.e. i value for next iteration is 5
now if(n%i==0) then c is incremented
i.e. if(5%4==0) then c is incremented, but 5%4!=0 and so c is not incremented, c remains 1
c=1;

5th iteration: i=5;i Here i is incremented i.e. i value for next iteration is 6 now if(n%i==0) then c is incremented i.e. if(5%5==0) then c is incremented, 5%5=0 and so c is incremented. i.e. c=2 6th iteration: i=6;i here i value is 6 and 6 now if(c==2) then n is a prime number we have c=2 from the 5th iteration and thus n=5 is a Prime number.

9. Write a program to check whether the given number is a palindromi c number.

If a number, which when read in both forward and backward way is same, then such a number is called a palindrome number.
Program:
#include
int main(){
int n, n1, rev = 0, rem;
printf("En ter any number: \n");
scanf("%d" ,&n);
n1 = n;
/* logic */
while (n>0){
rem = n % 10;
rev = rev * 10 + rem;
n = n / 10;
}
if (n1 == rev){
printf("Gi ven number is a palindromi c number");
}
else{
printf("Gi ven number is not a palindromi c number");
}
return 0;
}
Output:
Enter any number: 121
Given number is a palindrome
Explanatio n with an example:
Consider a number n=121, reverse=0, remainder;
number=121
now the while loop is executed /* the condition (n>0) is satisfied */
/* calculate remainder */
remainder of 121 divided by 10=(121%10 )=1;
now reverse=(r everse*10) +remainder
=(0*10)+1 / * we have initialized reverse=0 */
=1
number=num ber/10
=121/10
=12
now the number is 12, greater than 0. The above process is repeated for number=12.
remainder= 12%10=2;
reverse=(1 *10)+2=12;
number=12/ 10=1;
now the number is 1, greater than 0. The above process is repeated for number=1.
remainder= 1%10=1;
reverse=(1 2*10)+1=12 1;
number=1/ 10 / * the condition n>0 is not satisfied,co ntrol leaves the while loop */
Program stops here. The given number=121 equals the reverse of the number. Thus the given number is a palindrome number.

10.Write a program to check whether the given string is a palindrome.
Palindrome is a string, which when read in both forward and backward way is same.
Example: radar, madam, pop, lol, rubber, etc.,
Program:
#include
#include
int main(){
char string1[20 ];
int i, length;
int flag = 0;
printf("En ter a string: \n");
scanf("%s" , string1);
length = strlen(str ing1);
for(i=0;i<length ;i++){
if(string1 [i] != string1[le ngth-i-1]) {
flag = 1;
break;
}
}
if (flag){
printf("%s is not a palindrome \n", string1);
}
else{
printf("%s is a palindrome \n", string1);
}
return 0;
}
Output:
Enter a string: radar
"radar"is a palindrome Explanation with example:
To check if a string is a palindrome or not, a string needs to be compared with the reverse of itself. Consider a palindrome string:"radar",
---------- ---------- -------
index: 0 1 2 3 4
value: r a d a r
---------- ---------- -------
To compare it with the reverse of itself, the following logic is used:
0th character in the char array, string1 is same as 4th character in the same string.
1st character is same as 3rd character.
2nd character is same as 2nd character.
. . . .

ith character is same as'length-i- 1'th character.

If any one of the above condition fails, flag is set to true(1), which implies that the string is not a palindrome .

By default, the value of flag is false(0). Hence, if all the conditions are satisfied, the string is a palindrome .

11.Write a program to generate the Fibonacci series.
Fibonacci series: Any number in the series is obtained by adding the previous two numbers of the series.
Let f(n) be n'th term.
f(0)=0;
f(1)=1;
f(n)=f(n-1 )+f(n-2); (for n>=2)
Series is as follows
011
(1+0)
2 (1+1)
3 (1+2)
5 (2+3)
8 (3+5)
13 (5+8)
21 (8+13)
34 (13+21)
...and so on
Program: to generate Fibonacci Series(10 terms)
#include
int main(){
//array fib stores numbers of fibonacci series
int i, fib[25];
// initialized first element to 0
fib[0] = 0;
// initialized second element to 1
fib[1] = 1;
//loop to generate ten elements
for (i = 2; i<10; i++){
//i'th element of series is equal to the sum of i-1'th element and i-2'th element.
fib[i] = fib[i - 1] + fib[i - 2];
}
printf("Th e fibonacci series is as follows \n");
//print all numbers in the series
for (i = 0; i<10; i++){
printf("%d \n", fib[i]);
}
return 0;
}
Output:
The fibonacci series is as follows
01123581
3
21
34
Explanatio n:

The first two elements are initialize d to 0, 1 respectively. Other elements in the series are generated by looping and adding previous two numbers. These numbers are stored in an array and ten elements of the series are printed as output.

12.Write a program to print"Hello World"without using semicolon anywhere  in the code.

Generally when we use printf("") statement, we have to use a semicolon at the end. If printf is used inside an if Condition, semicolon can be avoided.

Program: Program to print something without using semicolon (;)

#include
int main(){
//printf returns the length of string being printed
if (printf("H ello World\n")) //prints Hello World and returns 11
{
//do nothing
}
return 0;
}
Output:
Hello World
Explanation:

The if statement checks for condition whether the return value of printf("He llo World") is greater than 0. printf function returns the length of the string printed. Hence the statement if (printf("H ello World")) prints the string

"Hello World".

13.Write a program to print a semicolon without using a semicolon anywhere in the code.

Generally when use printf("") statement we have to use semicolon at the end.

If we want to print a semicolon, we use the statement: printf(";" ); In above statement, we are using two semicolons. The task of printing a semicolon without using semicolon anywhere in the code can be accomplish ed by using the ascii value of';'which is equal to 59.

Program: Program to print a semicolon without using semicolon in the code.
#include
int main(void) {
//prints the character with ascii value 59, i.e., semicolon
if (printf("% c\n", 59)){
//prints semicolon
}
return 0;
}
Output:
;
Explanatio n:

If statement checks whether return value of printf function is greater than zero or not. The return value of function call printf("%c ",59) is 1. As printf returns the length of the string printed. printf("%c ",59) prints ascii value that

correspond s to 59, that is semicolon(.

14.Write a program to compare two strings without using strcmp() function.

strcmp() function compares two strings lexicograp hically. strcmp is declared in stdio.h
Case 1: when the strings are equal, it returns zero.
Case 2: when the strings are unequal, it returns the difference between ascii values of the characters that differ.
a) When string1 is greater than string2, it returns positive value.
b) When string1 is lesser than string2, it returns negative value.
Syntax:
int strcmp (const char *s1, const char *s2);
Program: to compare two strings.
#include
#include
int cmpstr(cha r s1[10], char s2[10]);
int main(){
char arr1[10] ="Nodalo";
char arr2[10] ="nodalo";
printf("%d", cmpstr(arr 1, arr2));
// cmpstr() is equivalent of strcmp()
return 0;
}/
/s1, s2 are strings to be compared
int cmpstr(cha r s1[10], char s2[10]){
//strlen function returns the length of argument string passed
int i = strlen(s1) ;
int k = strlen(s2) ;
int bigger;
if (i<k){
bigger = k;
}
else if (i>k){
bigger = i;
}
else{
bigger = i;
}
//loops'bigger'times
for (i = 0; i<bigger; i++){
// if ascii values of characters s1[i], s2[i] are equal do nothing
if (s1[i] == s2[i]){
}
//else return the ascii difference
else{
return (s1[i] - s2[i]);
}
}
//return 0 when both strings are same
//This statement is executed only when both strings are equal
return (0);
}

Output:

-32 Explanatio n:

cmpstr() is a function that illustrate s C standard function strcmp(). Strings to be compared are sent as arguments to cmpstr().

Each character in string1 is compared to its correspond ing character instring2. Once the loop encounters adiffering character in the strings, it would return the ascii difference of the differing characters and exit.

15.Write a program to concatenat e two strings without using strcat() function.

strcat(str ing1,strin g2) is a C standard function declared in the header file string.h
The strcat() function concatenat es string2, string1 and returns string1.
Program: Program to concatenat e two strings
#include
#include
char *strct(cha r *c1, char *c2);
char *strct(cha r *c1, char *c2){
//strlen function returns length of argument string
int i = strlen(c1) ;
int k = 0;
// loops until null is encountered and appends string c2 to c1
while (c2[k] !='\0'){
c1[i + k] = c2[k];
k++;
}
return c1;
}
int main(){
char string1[15 ] ="first";
char string2[15 ] ="second";
char *finalstr;
printf("Be fore concatenat ion:"
"\n string1 = %s \n string2 = %s", string1, string2);
// addresses of string1, string2 are passed to strct()
finalstr = strcat(str ing1, string2);
printf("\n After concatenat ion:");
//prints the contents of string whose address is in finalstr
printf("\n finalstr = %s", finalstr);
//prints the contents of string1
printf("\n string1 = %s", string1);
//prints the contents of string2
printf("\n string2 = %s", string2);
return 0;
}
Output:
Before concatenat ion:
string1 = first
string2 = second
After concatenat ion:
finalstr = firstsecon d
string1 = firstsecon d
string2 = second
Explanatio n:

string2 is appended at the end of string1 and contents of string2 are unchanged. In strct() function, using a for loop, all the characters of string'c2'are copied at the end of c1. return (c1) is equivalent to return&c1[0] and it returns the base address of'c1'.'finalstr' stores that address returned by the function strct().

16.Write a program to delete a specified line from a text file.

In this program, user is asked for a filename he needs to change. User is also asked for the line number that is to be deleted. The filename is stored in'filename'. The file is opened and all the data is transferre d to another file

except that one line the user specifies to delete.

Program: Program to delete a specific line.
#include
int main(){
FILE *fp1, *fp2;
// consider 40 character string to store filename
char filename[4 0];
char c;
int del_line, temp = 1;
//asks user for file name
printf("En ter file name:");
// receives file name from user and stores in'filename'
scanf("%s" , filename);
//open file in read mode
fp1 = fopen(file name,"r");
c = getc(fp1);
//until the last character of file is obtained
while (c != EOF)
{
printf("%c ", c);
//print current character and read next character
c = getc(fp1);
}
//rewind
rewind(fp1 );
printf("\n Enter line number of the line to be deleted:") ;
//accept number from user.
scanf("%d" ,&del_line) ;
//open new file in write mode
fp2 = fopen("cop y.c","w");
c = getc(fp1);
while (c != EOF){
c = getc(fp1);
if (c =='\n')
temp++;
//except the line to be deleted
if (temp != del_line)
{
//copy all lines in file copy.c
putc(c, fp2);
}
}
//close both the files.
fclose(fp1 );
fclose(fp2 );
//remove original file
remove(fil ename);
//rename the file copy.c to original name
rename("co py.c", filename);
printf("\n The contents of file after being modified are as follows:\n ");
fp1 = fopen(file name,"r");
c = getc(fp1);
while (c != EOF){
printf("%c ", c);
c = getc(fp1);
}
fclose(fp1 );
return 0;
}
Output:
Enter file name:abc.t xt
Hi.
Hello
how are you?
I am fine
hope the same
Enter line number of the line to be deleted:4
The contents of file after being modified are as follows:
Hi.
hello
how are you?
hope the same
Explanatio n:

In this program, user is asked for a filename that needs to be modified. Entered file name is stored in a char array'filename' . This file is opened in read mode using file pointer'fp1'. Character'c'is used to read characters from the file and print them to the output. User is asked for the line number in the file to be deleted. The file pointer is rewinded back and all the lines of the file except for the line to be deleted are copied into another file "copy.c". Now"copy.c"is renamed to the original filename. The original file is opened in read mode and the modified contents of the file are displayed on the screen.

17.Write a program to replace a specified line in a text file.
Program: Program to replace a specified line in a text file.
#include
int main(void) {
FILE *fp1, *fp2;
// 'filename'i s a 40 character string to store filename
char filename[4 0];
char c;
int del_line, temp = 1;
//asks user for file name
printf("En ter file name:");
// receives file name from user and stores in'filename'
scanf("%s" , filename);
fp1 = fopen(file name,"r");
//open file in read mode
c = getc(fp1);
//print the contents of file .
while (c != EOF){
printf("%c ", c);
c = getc(fp1);
}
//ask user for line number to be deleted.
printf("\n Enter line number to be deleted and replaced") ;
scanf("%d" ,&del_line) ;
//take fp1 to start point.
rewind(fp1 );
//open copy.c in write mode
fp2 = fopen("cop y.c","w");
c = getc(fp1);
while (c != EOF){
if (c =='\n'){
temp++;
}
// till the line to be deleted comes,copy the content from one file to other
if (temp != del_line){
putc(c, fp2);
}
else //when the line to be deleted comes
{
while ((c = getc(fp1)) !='\n'){
}
//read and skip the line ask for new text
printf("En ter new text");
//flush the input stream
fflush(std in);
putc('\n', fp2);
//put'\n'in new file
while ((c = getchar()) !='\n')
putc(c, fp2);
//take the data from user and place it in new file
fputs("\n" , fp2);
temp++;
}
// continue this till EOF is encountere d
c = getc(fp1);
}
//close both files
fclose(fp1 );
fclose(fp2 );
//remove original file
remove(fil ename);
//rename new file with old name opens the file in read mode
rename("co py.c", filename);
fp1 = fopen(file name,"r");
//reads the character from file
c = getc(fp1);
// until last character of file is encountered
while (c != EOF){
printf("%c ", c);
// all characters are printed
c = getc(fp1);
}
//close the file pointer
fclose(fp1 );
return 0;
}
Output:
Enter file name:abc.t xt
hi.
hello
how are you?
hope the same
Enter line number of the line to be deleted and replaced:4
Enter new text: sayonara see you soon
hi.
hello
how are you?
sayonara see you soon
Explanatio n:

In this program, the user is asked to type the name of the file. The File by name entered by user is opened in read mode. The line number of the line to be replaced is asked as input. Next the data to be replaced is asked. A new file is opened in write mode named"copy.c". Now the contents of original file are transferred d into new file and the line to be modified is deleted. New data is stored in its place and remaining lines of the original file are also transferred d. The copied file with modified contents is replaced with the original file's name. Both the file pointers are closed and the original file is again opened in read mode and the contents of the original file is printed as output.

18.Write a program to find the number of lines in a text file.

Number of lines in a file can be determined by counting the number of new line characters present.

Program: Program to count number of lines in a file.
#include
int main()
/* Ask for a filename and count number of lines in the file*/
{
//a pointer to a FILE structure
FILE *fp;
int no_lines = 0;
// consider 40 character string to store filename
char filename[4 0], sample_chr ;
//asks user for file name
printf("En ter file name:");
// receives file name from user and stores in a string named'filename'
scanf("%s" , filename);
//open file in read mode
fp = fopen(file name,"r");
//get character from file and store in sample_chr
sample_chr = getc(fp);
while (sample_ch r != EOF){
// Count whenever sample_chr is'\n'(new line) is encountere d
if (sample_ch r =='\n')
{
// increment variable'no_lines' by 1
no_lines=n o_lines+1;
}
//take next character from file.
sample_chr = getc(fp);
}
fclose(fp) ; //close file.
printf("Th ere are %d lines in %s \n", no_lines, filename);
return 0;
}
Output:
Enter file name:abc.t xt
There are 4 lines in abc.txt
Explanatio n:

In this program, name of the file to be read is taken as input. A file by the given name is opened in read-mode using a File pointer'fp'. Characters from the file are read into a char variable'sample_ch r'with the help of getc function. If a new line character( '\n') is encounter d, the integer variable'no_lines' is incremente d. If the character read into'sample_ch ar'is not a new line character, next character is read from the file. This process is

continued until the last character of the file(EOF) is encounter d. The file pointer is then closed and the total number of lines is shown as output.

19.Write a C program which asks the user for a number between 1 to 9 and shows the number. If the user inputs a number out of the specified range, the program should show an error and prompt the user for a valid input.

Program: Program for accepting a number in a given range.
#include
int getnumber( );
int main(){
int input = 0;
//call a function to input number from key board
input = getnumber( );
//when input is not in the range of 1 to 9,print error message
while (!((input = 1))){
printf("[E RROR] The number you entered is out of range");
//input another number
input = getnumber( );
}
//this function is repeated until a valid input is given by user.
printf("\n The number you entered is %d", input);
return 0;
}/
/this function returns the number given by user
int getnumber( ){
int number;
//asks user for a input in given range
printf("\n Enter a number between 1 to 9 \n");
scanf("%d" ,&number);
return (number);
}
Output:
Enter a number between 1 to 9
45
[ERROR] The number you entered is out of range
Enter a number between 1 to 9
4
The number you entered is 4
Explanation:

getfunction() function accepts input from user.'while'loop checks whether the number falls within range or not and accordingly either prints the number(If the number falls in desired range) or shows error message (number is out of range).

20.Write a program to display the multiplication table of a given number.
Program: Multiplication table of a given number
#include
int main(){
int num, i = 1;
printf("\n Enter any Number:");
scanf("%d" ,&num);
printf("Mu ltiplicati on table of %d: \n", num);
while (i
printf("\n %d x %d = %d", num, i, num * i);
i++;
}
return 0;
}
Output:
Enter any Number:5
5 x 1 = 5
5 x 2 = 10
5 x 3 = 15
5 x 4 = 20
5 x 5 = 25
5 x 6 = 30
5 x 7 = 35
5 x 8 = 40
5 x 9 = 45
5 x 10 = 50
Explanation:
We need to multiply the given number (i.e. the number for which we want the multiplication table) with value of'i'which increments from 1 to 10.

21. .WAP to check a string is Caliondrome or not. // Maventic question.
#include
#include
void main()
{
int i,j=0; char a[100];
clrscr();
printf("\n Enter the string to check for caliondrom e:\n");
gets(a);

if(strlen( a)%6)
{
printf("\n %s: is Not a caliondrom e..",a);
getch();
exit(0);
}
for (i=0;a[i]! ='\0'
{
if((a[i]== a[i+5])&&( a[i+1]==a[ i+4])&&(a[ i+2]==a[i+ 3]))
i=i+6;

else
{
j=1;
break;
}
}
if(j)
printf("\n %s: is Not a caliondrom e..",a);
else
printf("\n %s: is a caliondrom e..",a);
getch();
}

22.WAP to print DONE,witho ut using any loop. // asked to my frnd in any company.
#include
void main()
{
static int i=0;
printf("\n %d. DONE",i);
if(i++
main();
getch();
exit(0); / * I used exit(0) to terminate the program after 100 DONE,,i dunno why it was not terminating without using it,may be just at my system,try without it at ur sustem,it sud work */
}

23.WAP to print DONE,witho ut using any loop and any conditonal clause or operators.

/* This code is just in purpose to solve the above question,, but its not a good code in programmin g,as its terminatin g at divide error,,if anyone have a better code,let me know */

main()
{
static int i=100;
printf("%d . DONE\n",10 1-i);
main(1/ --i);
}

/* use"ctrl+f9",then"alt+f5"to see the result */

24. WAP to find out the longest word in a string.
#include
#include
#include
void main()
{
int i,max=0,co unt=0,j;
char str[100]; / * ={"INDIA IS DEMOCRATIC COUNTRY"}; u can use a string inside,in place of user input */

printf("\n Enter the string\n:" );
gets(str);

for(i=0;i
{
if(!(str[i ]==32))
{
count++;
}
else
{

if(max
{
j=i-count;
max=count;
}
count=0;
}
}
for(i=j;i
printf("%c ",str[i]);
getch();
}

25.Prog of WORLD MAP.
#include main(l ,a,n,d)cha r**a;{for(d=atoi (a[1])/ 10*80- atoi(a[2]) / 5-596;n="@N KA\CLCCGZA AQBEAADAFa ISADJABBA^ \SNLGAQABD AXIMBAACTB ATAHDBAN\Z cEMMCCCCAA hEIJFAEAAA BAfHJE\TBd FLDAANEfDN BPHdBcBBBE A_AL\ H E L L O, W O R L D!"[l++-3];)f or(;n-->64 putchar(!d +++33^ l&1);print f("\n\n\n\ n\t\tFound By:\n\t\t\ t Amit Aru");getc h();}

26.WAP to print the triangle of letters in increasing order of lines.

#include
#include
void main()
{
int i,j,k;
char ch;
printf("\n Enter the number of lines wants to make the triangle \n:");
scanf("%d" ,&i);
for(j=1;j
{
ch=65;
for(k=1;k
{
printf("%c ",ch++);
}
printf("\n ");
}
getch();
}

27.WAP to print'xay'in place of every'a'in a string.

#include
#include
void main()
{
int i=0;
char str[100],x ='x',y='y' ;
printf("En ter the string\n:");
gets(str);
while(str[ i]!='\0')
{
if(str[i]= ='a')
{
printf("%c ",x);
printf("%c ",str[i++] );
printf("%c ",y);
}
else
{
printf("%c ",str[i++] );
}
}
getch();
}

28.Count the Total Number of 7 comming between 1 to 100.

/* I made this code in a way that u can give Upper limit i.e. 100,Lower limit i.e. 1 and the specific number u wants to count in between i.e. 7 */

#include
#include
void main()
{
int i,j,U=100, L=1,count= 0,r=1,n;
clrscr();
printf("\n Enter the number u wants to count\n:");
scanf("%d" ,&n);
printf("\n Enter the lower limit\n:");
scanf("%d" ,&L);
printf("\n Enter the upper limit\n:");
scanf("%d" ,&U);

for (i=L;i
{
j=i;
while(j)
{
r=j%10;
if (r==n)
{
count++;
}
j=j/10;
}
}
if(n==0&&L ==0)
count++;
printf("\n Total Number of %d between %d and %d = %d",n,L,U, count);
getch();
}

29. Code for duplicate' s removal,by Amit Aru.
#include
#include
void main()
{
int i,j,k=0,co unt[300]={ 0};
char ch,str[100 0],str1[10 00];
clrscr();
printf("\n Enter the string to remove duplicasy\ n:");
gets(str);
for (i=0;str[i ]!='\0';i+ +)
{
ch=str[i];
count['']=0; / * U can use other delimiter inplace of space''here,just put that char inside'',for ex: count['A']=0 ; if u dnt want any delimiter, just remove this line.*/

if(count[c h])
continue;
else
{
str1[k++]= ch;
count[ch]= 1;
}
}
puts(str1) ;
getch();
}

30. WAP to find out if a given number is a power series of 2 or not, without any loop and without using % modulo operator.

#include
#include
int pow2(float );
void main()
{
int i,flag;
clrscr();
printf("En ter the number\n") ;
scanf("%d" ,&i);
flag=pow2( i);
if(flag)
printf("\n %d is power series of 2",i);
else
printf("\n %d is not a power series of 2",i);
getch();
}

int pow2(float j)
{
static float x;
x=j/2;
if(x==2)
return 1;
if(x
return 0;
x=pow2(x);

} 

Read More »

5 Comments

Labels: Interview