Today we'll deal with isc computer applications sample papers.
This is a program on Queue. Maximum 5 printing jobs can be kept on pending here. Execution of printing will be in First in First out order.
import java.io.*;
class print
{
int job[];
int newjob;
int capacity;
int front;
int rear;
print()
{
capacity=5;
front=rear=-1;
createjob();
}
void createjob()
{
job=new int[capacity];
}
void addjob(int j)
{
if(rear==capacity)
System.out.println("printjob is full,cant add any more printing job");
else
{
job[++rear]=j;
}
if(front==-1)
front=0;
}
void removejob()
{
if(front==rear && front==-1)
System.out.println("no print job");
else if(front==rear)
{
System.out.println("last print job is executed"+job[front]);
front=-1;rear=-1;
}
else
System.out.println("print job is executed"+job[front++]);
}
}
class printjob
{
public static void main(String args[])throws IOException
{
print obj=new print();
int i=0;
BufferedReader r=new BufferedReader(new InputStreamReader(System.in));
for(int i=0;i< 10;i++)
{
int x;
System.out.println("press 1 for assignment of job and 2 for execution of job");
x=Integer.parseInt(r.readLine());
if(x==1)
obj.addjob(i);
if(x==2)
obj.removejob();
}
}
}
About the program on printer queue
This is a program on implementation of array as a queue. We know that queue is the data structure here insertions are done at the rear end and deletions takes place from the front end. In this program, there is a limit of insertion and we can not more elements than the size of the array. Deletions from a queue has always a limit. So far elements are in the queue, we can delete elements.
In this program, printing job request is insertion and printing job execution is deletion from the queue. Size of the array is 5, so maximum 5 printing job request can be stored at a time in the array. On execution of the printing job, element will be deleted from the queue.
Dynamic deletion of elements from array is not possible in java. So we have to do some manipulation here. Two variables ‘front’ and ‘rear’of ‘int’ type with initial value -1 are used in this program. Printing requests are stored in the queue using the ‘rear’ variable and printing job execution, for deletion from the queue variable ‘front’ is used.
Within function ‘void addjob(int j)’ of the above program, printing jobs are assigned. Before assigning any job the value of ‘rear’ is checked with the size of the array to see whether insertion is possible. Another checking point within the function is to set 0 on the variable ‘front’ if its value is -1 at that time.
The other function in this program is ‘void removejob()’. This function is used to eliminate elements from the queue. If there is no printing job in the queue then the values of ‘front’ and ‘rear’ will be equal to -1. This is the first checking point in the function. If both the variable have the same value but not equal to -1, it means that last printing job is within the queue. The element is removed and both the variables are reset to -1.
User will enter the total number of days starting from 1st January of the current year and the year. Program will display it in Long date format.
Also Read: Computer Teacher in Burdwan
Also Read: Computer Teacher in Burdwan
import java.io.*;
class year
{
public static void main(String args[])throws IOException
{
BufferedReader r=new BufferedReader(new InputStreamReader(System.in));
int year;int b=0;
System.out.println("Enter the year");
year=Integer.parseInt(r.readLine());
int n;
System.out.println("Enter the number of days");
n=Integer.parseInt(r.readLine());
int a[]={31,28,31,30,31,30,31,31,30,31,30,31};
int flag=0;
if(year%100==0 && year%400==0)
flag=1;
else if(year%100!=0 && year %4==0)
flag=1;
int i=0;
for(;;)
{
b=b+a[i];
if(b >n)
break;
i=i+1;
if(i >11)
{
year++;
i=0;
}
}
b=b-a[i];
n=n-b;
i=i+1;
System.out.print(n+",");
switch(i)
{
case 1:
System.out.print("January");
break;
case 2:
System.out.print("February");
break;
case 3:
System.out.print("March");
break;
case 4:
System.out.print("April");
break;
case 5:
System.out.print("May");
break;
case 6:
System.out.print("June");
break;
case 7:
System.out.print("July");
break;
case 8:
System.out.print("August");
break;
case 9:
System.out.print("September");
break;
case 10:
System.out.print("October");
break;
case 11:
System.out.print("November");
break;
case 12:
System.out.print("December");
break;
}
System.out.println(" "+year);
}
}
Enter the Year
2010
Enter the number of days
34
3, February 2010
About the above program on numeric array
A numeric array is the pivot of this program. Firstly all the number of days of the 12 months are stored in the array. An infinite for loop is used here to add the days of each month and is checked with the total number of days entered by the user. During addition of days, 29 days for the month of February is considered in case of leap year. Year is also incremented with the complete of one year (when the month number becomes greater than 11). At one point, the sum of the number of days calculated days would be more than the number of days entered by user and at this point the infinite loop is terminated.
From this point date is displayed by calculating the difference. Month name is displayed using a switch statement and year is displayed.
This program will take a string from user and will display the unique words in ths sentence.
import java.io.*;
class wordunique
{
public static void main(String args[])throws IOException
{
BufferedReader r=new BufferedReader(new InputStreamReader(System.in));
int x=0;int i,j;
String temp="";
String s;
System.out.println("Enter a sentence");
s=r.readLine();
String word[]=new String[10];
StringTokenizer st=new StringTokenizer(s);
while(st.hasMoreTokens())
{
temp=st.nextToken();
for(j=0;j< 10;j++)
{
if(temp.compareTo(word[j])==0)
break;
}
if(j==x)
word[x++]=temp;
}
for(i=0;i< x;i++)
System.out.println(word[i]);
}
}
Sample Output:
Enter a sentence:This is is burdwan
This is burdwan
In this program enter any sentence and the words of the sentence will be sorted in ascending order.
import java.util.*;
import java.io.*;
class wordsort
{
public static void main(String args[])throws IOException
{
BufferedReader r=new BufferedReader(new InputStreamReader(System.in));
int x=0;int i,j;
String temp="";
String s;
System.out.println("Enter a sentence");
s=r.readLine();
String word[]=new String[10];
StringTokenizer st=new StringTokenizer(s);
while(st.hasMoreTokens())
{
word[x++]=st.nextToken();
}
for(i=0;i< x-1;i++)
{
for(j=i+1;j< x;j++)
{
if(word[i].compareTo(word[j]) > 0)
{
temp=word[i];
word[i]=word[j];
word[j]=temp;
}
}
}
for(i=0;i< x;i++)
System.out.print(word[i]+" ");
}
}
Enter a sentence this is burdwan
Output will be: burdwan is this
About this program on String array
This is a program on String array and searching. The sentence is broken into tokens using the StringTokenizer class of java.util package. Each tokens contains single word. Then using linear searching, it is checked whether the word is present in the string array. If the word is unique then it is added in the string array. Ultimately the words from the string are concatenated to display the result.
Program on Stack
import java.io.*;
class array
{
int arr[]=new int[10];
int index;
BufferedReader r=new BufferedReader(new InputStreamReader(System.in));
array()
{
index=-1;
}
boolean push()throws IOException
{
if(index==9)
{
System.out.println("stack full");
return false;
}
else
{
System.out.println("Enter the element to be pushed");
arr[++index]=Integer.parseInt(r.readLine());
return true;
}
}
void display()
{
for(int i=index;i >=0;i--)
System.out.println(arr[i]);
}
boolean pop()
{
if(index==-1)
{
System.out.println("Stack is empty");
return false;
}
else
{
System.out.println("Deleted element"+arr[index--]);
return true;
}
}
}
class test
{
public static void main(String args[])throws IOException
{
array ob=new array();
boolean bool;
bool=ob.push();
if(bool==true)
ob.display();
bool=ob.push();
if(bool==true)
ob.display();
bool=ob.pop();
if(bool==true)
ob.display();
}
}
This page is on isc sample papers. If you have any doubt in any program, pl. feel free to put your comments. I am here to clear your doubts.
About the program on Stack
This is a program on implementation of array as a stack. Unlike queue, stack works from one end only – the front end. Again in this program like queue, insertions have a limit as this is basically an array. Deletion from stack as usual is not possible when there is no element in the stack.
hello.i need help w/ this program:
ReplyDeletean array contains less than 50 elements.we have to put the largest element in the middle of the array,the second largest to the right of the middle and 3rd largest to the left of the middle.this goes on:placing decreasing nos. alternatively to the right and left of the middle.
eg: input: 7 3 1 6 4 2 5
output: 1 3 5 7 6 4 2
Solution of the program using BlueJ array
ReplyDeleteimport java.io.*;
class Middle1
{
BufferedReader br=new BufferedReader(new InputStreamReader(System.in));
int ori[],re[];int flag;int temp;
int mid,l,r;
public void take()throws IOException
{
int i,j,n;
System.out.print("How many elements you want to store:");
n=Integer.parseInt(br.readLine());
ori=new int[n];
re=new int[n];
for (i=0;i<n;i++)
{
System.out.print("Enter a number:");
ori[i]=Integer.parseInt(br.readLine());
}
System.out.println("The original numbers are:");
for(i=0;i<n;i++)
{
System.out.print(ori[i]+" ");
}
for (i=0;i<n;i++)
{
flag=0;
for(j=0;j<n-i-1;j++)
{
if(ori[j]<ori[j+1])
{
flag=1;
temp=ori[j];
ori[j]=ori[j+1];
ori[j+1]=temp;
}
}
if(flag==0)
break;
}
System.out.println("The sorted numbers are:");
for(i=0;i<n;i++)
{
System.out.print(ori[i]+" ");
}
mid=(n-1)/2;
l=mid-1;
r=mid+1;
re[mid]=ori[0];
for(j=1;j<n;j++)
{
if (j%2!=0)
re[r++]=ori[j];
else
re[l--]=ori[j];
}
System.out.println("The modified numbers are:");
ori=re;
for(i=0;i<n;i++)
{
System.out.print(ori[i]+" ");
}
}
public static void main(String args[])throws IOException
{
Middle1 ob=new Middle1();
ob.take();
}
}
I want a program which would work in the latest Bluej 3.0 and Java 6 update 14.
ReplyDeleteAccept a sentence and find out the longest word.
Here is the BlueJ program
ReplyDeleteimport java.util.*;
import java.io.*;
class Str1
{
String max=" ",s1,s2;
int pos;
BufferedReader r=new BufferedReader(new InputStreamReader(System.in));
void take() throws IOException
{
System.out.print("Enter the sentence:");
s1=r.readLine();
while(true)
{
pos=s1.indexOf(" ");
if(pos==-1)
break;
s2=s1.substring(0,pos-1).trim();
s1=s1.substring(pos).trim();
if(s2.length()>max.length())
max=s2;
}
System.out.println("Word with maximum length="+max);
System.out.println("And it's length ="+max.length());
}
public static void main(String args[]) throws IOException
{
Str1 ob=new Str1();
ob.take();
}
}
i want a prog. to print the following series 1,-2,3,-4,5,-6.......n
ReplyDeletei want a prog. to print the following series 1,-2,3,-4,5,-6......n
ReplyDeleteNikita, here is your program
ReplyDeleteclass PatBlueJ
{
public void show(int n)
{
for(int i=1;i<=n;i++)
{
if(i%2!=0)
System.out.print(i);
else
System.out.print("-"+i);
if(i!=n)
System.out.print(",");
}
}
}
how do i write an algorithm for fibonacci series using recursives
ReplyDeletePlease see the post on October 14, 2010
ReplyDeleteSir, this is a program regarding recursion:
ReplyDeleteClass name: words
Data Members/instance variables:
text: to store string
w=integer variable to store total words
Member functions/methods:
words() constructor to store blank to string and to integer data
void Accept(): to read a sentence in text. Note that the sentence may contain more than one blank spaces between words
int FindWords(int): to count total number of words present in text using Reccursive technique and store in 'w' and return.
void result():to display original string. Print total nmber of words atored in 'w' by invoking the recursive function.
Here is the BlueJ program as per your requirements
ReplyDeleteimport java.io.*;
class Words
{
int w;
BufferedReader br;
String text;
public static void main(String args[])throws IOException
{
Words ob=new Words();
ob.accept();
ob.result();
}
Words()
{
br=new BufferedReader(new InputStreamReader(System.in));
text="";
w=0;
}
public void accept()throws IOException
{
System.out.println("Enter the Sentence:");
text=br.readLine().trim();
w= findWords(0);
}
private int findWords(int x)
{
String str;
int i;
if(x<0)
return w;
for( i=x;i<text.length();i++)
{
if(text.charAt(i)==' ' && text.charAt(i-1)!=' ')
break;
}
w++;
if(i==text.length())
findWords(-1);
else
findWords(i+1);
return w;
}
public void result()
{
System.out.println("String="+text);
System.out.println("Number of words="+w);
}
}
As you have 'w' as object member to count the number of words and you are using recursive function, the recursive function could have been void type.
See the modified program as given below
import java.io.*;
class Words1
{
int w;
BufferedReader br;
String text;
public static void main(String args[])throws IOException
{
Words1 ob=new Words1();
ob.accept();
ob.result();
}
Words1()
{
br=new BufferedReader(new InputStreamReader(System.in));
text="";
w=0;
}
public void accept()throws IOException
{
System.out.println("Enter the Sentence:");
text=br.readLine().trim();
findWords(0);
}
private void findWords(int x)
{
String str;
int i;
for( i=x;i<text.length();i++)
{
if(text.charAt(i)==' ' && text.charAt(i-1)!=' ')
break;
}
w++;
if(i==text.length())
return;
findWords(i+1);
}
public void result()
{
System.out.println("String="+text);
System.out.println("Number of words="+w);
}
}
15. An encoded text can be decoded by finding actual character for
ReplyDeletethe given ACII code in the encoded message.
Write a program to input an encoded text having only
sequence of ACSII values without any spaces.Any code or
value which is not in the range(65-90 or 97-122 or 32 for space)
will be ignored and should not appear in the output message.Decode
the encoded text and print in the form of sentence.The first alphabet
of each word must be in capitals and rest alphabets will be in lower case
only. Any consecutive sets of code 32 will be taken as only one blank space.
The output shouls be exactly in the following format:
Input (coded text) : 10665771011153266797868
Output(decoded text) : James Bond
Input (coded text) : 78487367421013232321006589
Output(decoded text) : Nice Day
Interesting program! I have posted it today ( January 23, 2011. Please check it.
ReplyDelete1
ReplyDelete2 3 2
3 4 5 4 3
4 5 6 7 6 5 4
5 6 7 8 7 6 5 4 3
import java.io.*;
ReplyDeleteclass smith
{
int i,j,k,x;
public void show()
{
for(i=0;i<5;i++)
{
x=i+1;
for(j=0;j<=i;j++)
{
System.out.print(x+" ");
if(x==8)
x--;
else
x++;
}
x=x-2;
for(k=0;k<i;k++)
{
System.out.print(x+" ");
x--;
}
System.out.println();
}
}
public static void main(String args[])throws IOException
{
smith ob=new smith();
ob.show();
}
}
can you please provide me the solution for finding the inverse of a n*n matrix in blueJ
ReplyDeleteHere is the program
ReplyDeleteimport java.io.*;
class Spiral
{
int i,j,n;
int a[][];
void show()throws IOException
{
BufferedReader br=new BufferedReader(new InputStreamReader(System.in));
System.out.println("enter the size (either row or column):");
n=Integer.parseInt(br.readLine());
a=new int[n][n];
for(i=0;i<n;i++)
{
for(j=0;j<n;j++)
{
System.out.println("enter value:");
a[i][j]=Integer.parseInt(br.readLine());
}
}
System.out.println("\nEntered values are\n");
for(i=0;i<n;i++)
{
for(j=0;j<m;j++)
{
System.out.print(" "+a[i][j]);
}
System.out.println();
}
System.out.println("\n\n");
System.out.println("\nEntered values are\n");
for(i=0;i<n;i++)
{
for(j=0;j<m;j++)
{
System.out.print(" "+a[j][i]);
}
System.out.println();
}
}
public static void main(String args[])throws Exception
{
Spiral ob=new Spiral();
ob.show();
}
}
i want a program on how to print a spiral array
ReplyDeleteThis program has been posted earlier in my blog.
ReplyDeletesir help to wap to accept asentence and then print total no of words in sentence also print lngest word using string tokenizer
ReplyDeleteCheck my today's post
ReplyDeletei need a program for encoded message to decoded message...
ReplyDeleteencoded message
231279862310199501872379231018117927
decoded message
Have A Nice Day
first letter should be in capital letters
Search my blog, this type of program has been posted
ReplyDeletehow to rectify the error "unclosed character literal"
ReplyDeleteThis means your string is not closed. The string value should be within " ".
ReplyDeletesir can you please explain me a program on inheritance(a easy one).
ReplyDeletePlease follow the page http://schooljava.blogspot.com/2009/12/inheritance.html
ReplyDeleteand here is a simple program on inheritance
class A
{
int a,b;
void set (int x, int y)
{
a=x;
b=y;
}
void show()
{
System.out.println(" Values are="+ a+ ","+ b);
}
}
class B extends A
{
void showMax()
{
if(a>b)
System.out.println(" Maximum value is:"+ a);
else if(b>a)
System.out.println(" Maximum value is:"+ b);
else
System.out.println(" Both are same");
}
}
Here 'A' is the super class and 'B' is the sub class. Any object 'A' class will have two data members ( int a and int b) and the objects will get access of two functions. One function will set values on the data members and the other function will display the individual values. No other jobs can be performed on any objects of class 'A'.
Now by inheritance, class 'B' acquires all the properties of class 'A', means without writing a line of code, 'B' class object can perform all the works that the objects of class 'A' was entitled to perform and it defines another function to display the status of the data members.
Inheritance means re use of codes. What class 'A' has defined, class 'B' acquires it through inheritance and class 'B' can add new features to its objects.
i want few sample programs on single inheritance...please help..
ReplyDeletei have to write 10 programs on linear data structures.... but i have only got 5 basic programs.... can you help me with some unique programs on data structures?
ReplyDeletePlease check my another blog site 'ds4you.blogspot.com'
ReplyDeleteVery soon I will post some programs on inheritance.
ReplyDeleteMr. chakraborty this is a nice effort by you for the students:
ReplyDeleteI think if you write the solve of the following program then it is more easy for the students:
Q: To print the following series 1,-2,3,-4,5,-6......n (posted by nikita)
Ans:-
class sereis
{int m=1,s;
public void result(int n)
{
for(int i=1;i<=n;i++)
{
s=i*m;
System.out.print(s+",");
m=m*(-1);
}
}
}
Thanks. This type of interaction is necessary and welcome for helping the students.
ReplyDeletesir in ur program of Queue when u r adding elements then first u hv written that if(rear==capacity)but here it must be capacity-1
ReplyDeleteHave you tested the program or gone through each statements properly? Size of the array is stored in 'capacity' so the last index of the array is 'capacity-1'. Using the variable 'rear' elements are pushed in the array and if value of rear and capacity becomes same that means the situation like 'queue overflowing' occurs. You can put elements in the 'capacity-1' index but not in capacity. I am waiting for your response.
ReplyDeleteSir, this of great help to students. Please can you help me with DQueue ?
ReplyDeleteNormally Queue means where elements are inserted at rear end and deletion of elements are done from the front end.
ReplyDeleteA deque or double ended queue is a linear list where elements can be added or removed from any end of the queue.There are two types of deque :-
1. Input restricted deque
2. Output restricted deque.
In Input restricted deque , input or insertion is possible only at one end while deletion is possible from both the ends.
In Output restricted deque , output or deletion is restricted – possible on only one end while insertion from both the ends is possible.
Hi Sir
ReplyDeletePlease help me with the program for counting the frequency of each word in a String for example
I live in my city in kolkata
I 1 time
live 1 time
in 2 tile
Please check my post on 26 October 2011.
ReplyDeleteplz write a prog to check whether a no is smith no or not...
ReplyDeleteProgram on Smith Number
ReplyDeleteis already posted in this blog.
sir,
ReplyDeletewill u check my program for smith no.
import java.io.*;
import java.lang.*;
public class skywalker_smith
{
public static boolean prime_check(int n)
{
int i,c=0;
for(i=1;i<=n;i++)
{
if(n%i==0)
c++;
}
if(c==2)
return true;
else
return false;
}
public static int sum_digit(int n)
{
int sum=0;
while(n!=0)
{
sum+=(n%10);
n=n/10;
}
return sum;
}
public static void smith_check(int n)
{
int k=n,sum=0,i=1;
while(k!=1)
{
if(k%i==0&&prime_check(i)==true)
{
sum+=sum_digit(i);
k=k/i;
}
else
i++;
}
if(sum_digit(n)==sum)
System.out.println(n+" is a smith no.");
else
System.out.println(n+" is not a smith no.");
}
}
What's the problem with this program? Problem in Output?
ReplyDeleteThe two import statements are not required as lang package comes automatically and not a single class of io package is used in this program.
The loop used for checking for prime number is not technically correct. Suppose you are checking 1000 for prime or not prime, your loop will execute for 1000 times and then you will get the result that the number is not prime. In case of 1000, after the first iteration of the loop the decision can be taken that the number is not prime. What's the wrong in using break statement in loop? Read 'use of break statement'.
SIR ,IS IT NECESSARY TO STUDY THE ALGORITHMS OF DATA STRUCTURES FOR ISC 2012?IF POSSIBLE,WILL YOU PLEASE SEND SOME SIMPLIFIED ALGORITHMS
ReplyDeleteShort notes on linked list, stack, queue etc are sufficient for ISC examination. I have never seen questions on algorithm of data structure.
Deleteis there a simplified way of writing a dequeue program instead of following the one as written in the book?
ReplyDeletePlease try yourself and if any problem, I will help you.
Delete@DC Sir--> Sir can u plzz tell wat are the most probable questions to be set in 2012 CS theory from the chapter DATA STRUCTURE(both simple and recursive)... plzz be in detail.. reply at ur earliest leisure sir.. I await ur response.
ReplyDelete(^_^)
Please go through traversal of tree, definition of linked list, stack and queue.
DeleteSir could you please suggest a few important programs for the ISC 2012 paper?
ReplyDeleteAlready posted, search in this site for expected programs in ISC 2012.
Deletesir can you suggest some programs for isc computer project
ReplyDeletesome programs for recurssion , object passing , classes and object etc
Please search in my site. All the above topics are covered in this blog.
DeleteSir,can you please explain me the code below???
ReplyDeleteexplain me how the program works.
void output1()
{
for(int j=0;j<10;j++)
{
System.out.print(j+" ");
if(j%2==0)
continue;
System.out.println(" ");
}
}
The output will be:
Delete0 1
2 3
4 5
6 7
8 9
The continue statement sends the control to reinitialization statement (here j++), skipping the last statement of the loop body. So after printing every even number the 'System.out.println()' will not execute but after the odd number the line breaks.
Hello sir, plz tell some isc programs which i must study for the practical 2013.. I m too weak in this subject, so plz help me sir.. hope u'll rply soon..
ReplyDeletePlease go through 'last minute suggestion for ISC 2013'.
Deletehello,
ReplyDeleteI want a program on Single Linked List:
creation, deletion(middle, beginning or end) and insertion (middle beginning or end), Display.
Do you want this program in Java?
DeleteThank you I have got that program. can you please write the following program in java instead....
ReplyDeleteCLASS:FileOP
Assuming that a text file, named FIRST.txt contains some text written into it, write a functon named Vowelwords() that reads the file FIRST.txt and creates a new fle named SECOND.txt to contain only those words rom the file FIRST.txt which start with a vowel.
Thankyou