The document presents an upgraded ISC computer project for class 12 to help students save time for studying. It includes 15 programs with algorithms and Java code to perform tasks like arranging elements of a 2D array, checking if a 2D array is symmetric, finding the product of two matrices, and more. It also includes programs that use concepts like recursion, inheritance, linked lists, stacks, and queues. The programs are explained with pseudocode algorithms and descriptions of the variables used.
This document contains the details of a computer science project completed by Tirthanu Ghosh of class 12A. The project contains 30 programs on different topics written in the Java programming language using BlueJ. It includes programs to generate Pascal's triangle, display numbers in words, calculate an arithmetic progression series and sum, display a calendar for a given month and year, calculate factorials and Fibonacci series using recursion, and more. The document contains the algorithms, code solutions, variable descriptions and outputs for each program. It ends with acknowledgements from Tirthanu thanking those who helped with the project.
Library Management Project (computer science) class 12RithuJ
This project descibes the Library management system.This includes the code, its output and the applications. This software has main menu, admin menu that has provision to create student & book record, display student & book record, modify student & book record, delete student & book record .
Rithu
AECS Kudankulam
Permutations and Combinations(For Class 11)Anubhav Kumar
1) The document discusses permutations and combinations, which are techniques for counting the number of arrangements or selections of objects without listing them all.
2) Permutations refer to arrangements that consider order, while combinations refer to selections where order does not matter.
3) Formulas are provided for calculating the number of permutations and combinations in various scenarios, such as with or without repetition of objects.
4) Examples demonstrate applying the counting principles and formulas to problems involving selecting groups from a larger set.
Maths Class 12 Probability Project PresentationAaditya Pandey
The document discusses the concept of probability. It defines probability as the likelihood of an event occurring based on the number of possible outcomes. It provides an example of calculating the probability of picking a red ball from a basket containing balls of different colors. The document then discusses key terms related to probability like sample space, sample point, events, mutually exclusive events, and exhaustive events. It also explains the concepts of conditional probability and Bayes' theorem along with examples. It discusses the multiplication theorem of probability and the concept of independent events.
This document provides an introduction to semiconductors and discusses key concepts such as intrinsic and extrinsic semiconductors, n-type and p-type semiconductors, energy band diagrams, p-n junction diodes, and transistors. It describes how doping semiconductors with impurities can produce either excess electrons or holes, the functioning of p-n junction diodes including rectification, and special purpose diodes like Zener diodes. Transistors are discussed as devices that can function as switches or amplifiers based on controlling current flow using a third terminal.
CBSE Class 12 Computer practical Python Programs and MYSQL Rishabh-Rawat
This upload is my Computer Science Practical File for CBSE class 12 Board exam practical.
Some errors in the displaying of the content might have crept in as I prepared this file on my android. ;P
INVESTIGATORY PROJECT ON SEMICONDUCTOR by shivam jhade bhopal
This document appears to be a student project on semiconductors. It includes an acknowledgment section thanking teachers and parents for their support. The main body contains sections on the introduction, theory/definition, effects of temperature on conductivity, intrinsic/extrinsic semiconductors including n-type and p-type types. It also discusses electrical resistivity and how it relates to number density and mobility of electrons and holes. In total, it provides a concise overview of key concepts regarding semiconductors in about 10 sections for a school science fair project.
Chemistry investigatory project 2k18 (12th isc): Vitamins and hormones and th...Student
This document provides an introduction to vitamins and hormones. It begins by classifying vitamins as either water-soluble or fat-soluble. It then discusses each major vitamin in more detail, including its structure, functions in the body, dietary sources, and deficiency diseases. For each vitamin, the summary includes the key roles and recommended daily intake amounts. The document concludes by discussing the structures and functions of some common hormones.
This document contains the details of a computer science project completed by Tirthanu Ghosh of class 12A. The project contains 30 programs on different topics written in the Java programming language using BlueJ. It includes programs to generate Pascal's triangle, display numbers in words, calculate an arithmetic progression series and sum, display a calendar for a given month and year, calculate factorials and Fibonacci series using recursion, and more. The document contains the algorithms, code solutions, variable descriptions and outputs for each program. It ends with acknowledgements from Tirthanu thanking those who helped with the project.
Library Management Project (computer science) class 12RithuJ
This project descibes the Library management system.This includes the code, its output and the applications. This software has main menu, admin menu that has provision to create student & book record, display student & book record, modify student & book record, delete student & book record .
Rithu
AECS Kudankulam
Permutations and Combinations(For Class 11)Anubhav Kumar
1) The document discusses permutations and combinations, which are techniques for counting the number of arrangements or selections of objects without listing them all.
2) Permutations refer to arrangements that consider order, while combinations refer to selections where order does not matter.
3) Formulas are provided for calculating the number of permutations and combinations in various scenarios, such as with or without repetition of objects.
4) Examples demonstrate applying the counting principles and formulas to problems involving selecting groups from a larger set.
Maths Class 12 Probability Project PresentationAaditya Pandey
The document discusses the concept of probability. It defines probability as the likelihood of an event occurring based on the number of possible outcomes. It provides an example of calculating the probability of picking a red ball from a basket containing balls of different colors. The document then discusses key terms related to probability like sample space, sample point, events, mutually exclusive events, and exhaustive events. It also explains the concepts of conditional probability and Bayes' theorem along with examples. It discusses the multiplication theorem of probability and the concept of independent events.
This document provides an introduction to semiconductors and discusses key concepts such as intrinsic and extrinsic semiconductors, n-type and p-type semiconductors, energy band diagrams, p-n junction diodes, and transistors. It describes how doping semiconductors with impurities can produce either excess electrons or holes, the functioning of p-n junction diodes including rectification, and special purpose diodes like Zener diodes. Transistors are discussed as devices that can function as switches or amplifiers based on controlling current flow using a third terminal.
CBSE Class 12 Computer practical Python Programs and MYSQL Rishabh-Rawat
This upload is my Computer Science Practical File for CBSE class 12 Board exam practical.
Some errors in the displaying of the content might have crept in as I prepared this file on my android. ;P
INVESTIGATORY PROJECT ON SEMICONDUCTOR by shivam jhade bhopal
This document appears to be a student project on semiconductors. It includes an acknowledgment section thanking teachers and parents for their support. The main body contains sections on the introduction, theory/definition, effects of temperature on conductivity, intrinsic/extrinsic semiconductors including n-type and p-type types. It also discusses electrical resistivity and how it relates to number density and mobility of electrons and holes. In total, it provides a concise overview of key concepts regarding semiconductors in about 10 sections for a school science fair project.
Chemistry investigatory project 2k18 (12th isc): Vitamins and hormones and th...Student
This document provides an introduction to vitamins and hormones. It begins by classifying vitamins as either water-soluble or fat-soluble. It then discusses each major vitamin in more detail, including its structure, functions in the body, dietary sources, and deficiency diseases. For each vitamin, the summary includes the key roles and recommended daily intake amounts. The document concludes by discussing the structures and functions of some common hormones.
Computer Science Investigatory Project Class 12Self-employed
The document describes a project report submitted by Rahul Kushwaha on a railway ticket reservation system. It includes certificates from the guide and examiner approving the report. The report contains sections describing the header files used, files generated, the working of the program, the coding, output screens, and conclusion. It was submitted for a computer science class and thanks the guide, principal, parents and classmates for their support.
Informatics Practices/ Information Practices Project (IP Project Class 12)KushShah65
This document contains code for analyzing car sales data. It includes functions for reading a CSV file containing car sales data, providing a data analysis menu to view the data in different ways (e.g. columns, rows), adding or deleting records, and generating line graphs of sales data for different car models over time. The code allows users to select a car manufacturer, then a specific model to view a line graph comparing its sales figures across years.
Computer Project for class 12 CBSE on school managementRemaDeosiSundi
This project summarizes a school management system created by Rema Deosi Sundi for their class 12 computer science project. The system allows users to manage student and teacher data, attendance records, fee structures and the school library. It was developed using Python and stores data in MySQL tables. The system has functions for adding, removing, updating and displaying data for each module. While limited in online exam capabilities, the system provides a basis for automating core school administration tasks.
The document provides details about various optical instruments including the human eye, camera, microscope, telescope, and some famous space telescopes. It describes the basic workings of the eye, camera, and microscope. It explains that telescopes use lenses or mirrors to make distant objects appear nearer. Famous telescopes mentioned include Galileo's early refracting telescope, Newton's reflecting telescope, and the Hubble Space Telescope, which avoids issues with Earth's atmosphere.
Computer Science Investigatory Project Class XII CBSE(Latest Syllabus)(Python...ArkaSarkar23
This is a final project based on Programming Language Python.
It contains the whole computer science project for the exam AISSCE. It contains the code for Result analysis (GUI based) software. It contains modules like tkinter, os, openpyxl,numpy etc. This program will help to generate the analyzed redult for any class.
Computer Science Practical File class XIIYugenJarwal
This document contains 18 Python programming assignments completed by a student. Each assignment has the aim, code, and output displayed. The assignments cover topics like searching lists, passing lists/strings to functions, random number generation, file handling, and more. The code and outputs demonstrate the student's ability to write Python functions to complete tasks like searching, sorting, manipulating data structures, and reading/writing files.
This document describes a library management system project created by Darshit Rajeshbhai Vaghasiya. The project uses Python and MySQL to create tables for books, book issues, and returns. It allows adding, issuing, returning, and deleting books. Functions and source code are provided to perform these tasks. Sample outputs and tables demonstrate the functionality of the project.
computer science with python project for class 12 cbsemanishjain598
This document is a project report on employee management from Subodh Public School. It includes sections on importing files and functions used in Python, tables created in MySQL, coding for the project, output screens, limitations and enhancements, and bibliography. The project allows administrators to manage employee records across different departments and posts by performing functions like adding, viewing, searching, modifying and deleting records in the database tables.
Computer project final for class 12 StudentsShahban Ali
This document appears to be a project report submitted by Shahban Ali for a railway ticket reservation system. It includes a certificate signed by his teacher Mr. M.K. Singh certifying the project. It also includes declarations, acknowledgements and outlines the contents which are about header files used, files generated, working description, coding, output screens and conclusion.
Physics Practical File - with Readings | Class 12 CBSESaksham Mittal
The document appears to be a scanned collection of pages from a book or manual. It contains images of many pages with text and diagrams but no clear overall narrative or topic. As a scanned document, it provides visual copies of written content but no coherent summary can be extracted from the random assortment of pages.
The document provides information on electric current, including definitions of conventional current, drift velocity, current density, and Ohm's law. It discusses resistance, resistivity, conductance, and conductivity and how they relate to temperature, length, and other factors. The document also covers color codes for carbon resistors, and series and parallel combinations of resistors and cells. It defines emf and potential difference, and discusses the internal resistance of cells and how series and parallel connections of cells affect total emf, internal resistance, and current.
Set theory is the branch of mathematics that studies sets and their properties. A set is a collection of distinct objects, which can include numbers, points, or other sets. Some key concepts in set theory include:
- The membership relation, where an object is either a member or not a member of a given set.
- Subset and union operations on sets, such as combining elements that are members of either or both sets.
- Defining sets explicitly by listing elements or implicitly with properties that elements must satisfy.
- Distinguishing between finite sets with a defined number of elements and infinite sets without a defined number.
Project front page, index, certificate, and acknowledgementAnupam Narang
This document is a certificate from Mount Abu Public School certifying that a student completed a research project in physics for their class 12 examination under the guidance of their teacher, Mr. Anupam Narang. It includes an acknowledgement thanking various people who supported the student in completing the project, including their principal, teacher, parents and friends. It also provides an index of the contents and structure of the research project.
CLASS 12 ENGLISH PROJECT ON CHILD LABOURAryanNaglot
This document is a certificate certifying that Aryan Naglot, a student of class 12B, successfully completed a school project on "Child Labour" under the guidance of his teacher Mr. Kamla Prashad. The project covered key topics like definitions of child labour, common types of child labour in India, causes of rising child labour, impacts on social environment, relevant laws, and approaches to eliminate child labour. It included sections on defining child labour, categorizing it according to UNICEF, listing major types in India, and analyzing common causes like poverty, lack of education, social factors, cheap labour costs, and family traditions.
Group Theory and Its Application: Beamer Presentation (PPT)SIRAJAHMAD36
This document provides an overview of a seminar presentation on group theory and its applications. The presentation covers topics such as the definition of groups, order of groups and group elements, modular arithmetic, subgroups, Lagrange's theorem, and Sylow's theorems. It also discusses some examples of groups and applications of group theory in fields like algebraic topology, number theory, and physics. The presentation aims to introduce fundamental concepts in modern algebra through group theory.
This document provides an overview of key concepts in ray optics, including:
1. Refraction is defined as the change in direction and speed of light when passing from one medium to another. Snell's law describes the relationship between angles of incidence and refraction.
2. Total internal reflection occurs when light passes from an optically dense to rare medium at an angle greater than the critical angle, causing the light to reflect back into the dense medium.
3. Spherical lenses use thin lens equations and sign conventions to determine image location based on the object position, focal length, and refractive indices of the lens and surrounding media.
Download link ( copy link to download )
https://drive.google.com/file/d/1TOz6arCdt4Nhfm_2emBzQCmgGSTCVQHy/view?usp=sharing
to add this to net beans just do this
1) open netbeans
2) on the top left, click file.
3) then click import project, there select from zip
4) use my file which u downloaded
5) import and thats it
Enjoy Using my Project as a reference for your own Project.
I hope that this will help you to understand what to do in your own project.
Happy Coding Nerds!!
git hub link to download it to ur system
https://github.com/Yosh1kageK1ra/12th-Class-Project-CBSE.git
The document defines and discusses several key concepts relating to groups in abstract algebra:
- A group is defined as a non-empty set together with a binary operation that satisfies closure, associativity, identity, and inverse properties.
- An abelian (or commutative) group is one where the binary operation is commutative. Examples of abelian groups include integers under addition.
- The quaternion group is a non-abelian group of order 8 under multiplication.
- Theorems are presented regarding the uniqueness of identity and inverses in a group, as well as cancellation, reverse order, and inverse properties of groups.
Linear programming class 12 investigatory projectDivyans890
This document provides an introduction to linear programming, including its definition, characteristics, formulation, and uses. Linear programming is a technique for determining an optimal plan that maximizes or minimizes an objective function subject to constraints. It involves expressing a problem mathematically and using linear algebra to determine the optimal values for the decision variables. Common applications of linear programming include production planning, portfolio optimization, and transportation scheduling.
Computer science project on Online Banking System class 12OmRanjan2
This document summarizes a student's computer science project on developing an online banking system. It includes a certificate acknowledging the student's work, declarations by the student and teacher, and acknowledgements. It then provides overviews of the technologies used - Python programming language, MySQL database, and Tkinter graphical interface module. It outlines the project objectives, requirements, database structure, and includes Python code snippets.
The document is a computer programming laboratory manual for Malla Reddy College of Engineering & Technology. It contains instructions for students attending the lab and outlines 16 weeks of programming exercises for students to complete. The exercises include programs to calculate sums and averages, generate Fibonacci sequences, check for prime and Armstrong numbers, perform matrix operations, work with strings and files, and more. It provides the goals, algorithms, flowcharts and programs for students to write and test out for each week's assignments.
This document contains a C program to compute the roots of a quadratic equation. It begins by reading in the coefficients a, b, and c from the user. It then calculates the discriminant and determines if the roots are real, equal, or complex. Appropriate messages are printed. If the roots are real and distinct, it calculates and prints them. If equal, it prints the single root. If complex, it separates into real and imaginary parts and prints both roots. The program uses decision making and math functions to systematically solve the quadratic equation.
Computer Science Investigatory Project Class 12Self-employed
The document describes a project report submitted by Rahul Kushwaha on a railway ticket reservation system. It includes certificates from the guide and examiner approving the report. The report contains sections describing the header files used, files generated, the working of the program, the coding, output screens, and conclusion. It was submitted for a computer science class and thanks the guide, principal, parents and classmates for their support.
Informatics Practices/ Information Practices Project (IP Project Class 12)KushShah65
This document contains code for analyzing car sales data. It includes functions for reading a CSV file containing car sales data, providing a data analysis menu to view the data in different ways (e.g. columns, rows), adding or deleting records, and generating line graphs of sales data for different car models over time. The code allows users to select a car manufacturer, then a specific model to view a line graph comparing its sales figures across years.
Computer Project for class 12 CBSE on school managementRemaDeosiSundi
This project summarizes a school management system created by Rema Deosi Sundi for their class 12 computer science project. The system allows users to manage student and teacher data, attendance records, fee structures and the school library. It was developed using Python and stores data in MySQL tables. The system has functions for adding, removing, updating and displaying data for each module. While limited in online exam capabilities, the system provides a basis for automating core school administration tasks.
The document provides details about various optical instruments including the human eye, camera, microscope, telescope, and some famous space telescopes. It describes the basic workings of the eye, camera, and microscope. It explains that telescopes use lenses or mirrors to make distant objects appear nearer. Famous telescopes mentioned include Galileo's early refracting telescope, Newton's reflecting telescope, and the Hubble Space Telescope, which avoids issues with Earth's atmosphere.
Computer Science Investigatory Project Class XII CBSE(Latest Syllabus)(Python...ArkaSarkar23
This is a final project based on Programming Language Python.
It contains the whole computer science project for the exam AISSCE. It contains the code for Result analysis (GUI based) software. It contains modules like tkinter, os, openpyxl,numpy etc. This program will help to generate the analyzed redult for any class.
Computer Science Practical File class XIIYugenJarwal
This document contains 18 Python programming assignments completed by a student. Each assignment has the aim, code, and output displayed. The assignments cover topics like searching lists, passing lists/strings to functions, random number generation, file handling, and more. The code and outputs demonstrate the student's ability to write Python functions to complete tasks like searching, sorting, manipulating data structures, and reading/writing files.
This document describes a library management system project created by Darshit Rajeshbhai Vaghasiya. The project uses Python and MySQL to create tables for books, book issues, and returns. It allows adding, issuing, returning, and deleting books. Functions and source code are provided to perform these tasks. Sample outputs and tables demonstrate the functionality of the project.
computer science with python project for class 12 cbsemanishjain598
This document is a project report on employee management from Subodh Public School. It includes sections on importing files and functions used in Python, tables created in MySQL, coding for the project, output screens, limitations and enhancements, and bibliography. The project allows administrators to manage employee records across different departments and posts by performing functions like adding, viewing, searching, modifying and deleting records in the database tables.
Computer project final for class 12 StudentsShahban Ali
This document appears to be a project report submitted by Shahban Ali for a railway ticket reservation system. It includes a certificate signed by his teacher Mr. M.K. Singh certifying the project. It also includes declarations, acknowledgements and outlines the contents which are about header files used, files generated, working description, coding, output screens and conclusion.
Physics Practical File - with Readings | Class 12 CBSESaksham Mittal
The document appears to be a scanned collection of pages from a book or manual. It contains images of many pages with text and diagrams but no clear overall narrative or topic. As a scanned document, it provides visual copies of written content but no coherent summary can be extracted from the random assortment of pages.
The document provides information on electric current, including definitions of conventional current, drift velocity, current density, and Ohm's law. It discusses resistance, resistivity, conductance, and conductivity and how they relate to temperature, length, and other factors. The document also covers color codes for carbon resistors, and series and parallel combinations of resistors and cells. It defines emf and potential difference, and discusses the internal resistance of cells and how series and parallel connections of cells affect total emf, internal resistance, and current.
Set theory is the branch of mathematics that studies sets and their properties. A set is a collection of distinct objects, which can include numbers, points, or other sets. Some key concepts in set theory include:
- The membership relation, where an object is either a member or not a member of a given set.
- Subset and union operations on sets, such as combining elements that are members of either or both sets.
- Defining sets explicitly by listing elements or implicitly with properties that elements must satisfy.
- Distinguishing between finite sets with a defined number of elements and infinite sets without a defined number.
Project front page, index, certificate, and acknowledgementAnupam Narang
This document is a certificate from Mount Abu Public School certifying that a student completed a research project in physics for their class 12 examination under the guidance of their teacher, Mr. Anupam Narang. It includes an acknowledgement thanking various people who supported the student in completing the project, including their principal, teacher, parents and friends. It also provides an index of the contents and structure of the research project.
CLASS 12 ENGLISH PROJECT ON CHILD LABOURAryanNaglot
This document is a certificate certifying that Aryan Naglot, a student of class 12B, successfully completed a school project on "Child Labour" under the guidance of his teacher Mr. Kamla Prashad. The project covered key topics like definitions of child labour, common types of child labour in India, causes of rising child labour, impacts on social environment, relevant laws, and approaches to eliminate child labour. It included sections on defining child labour, categorizing it according to UNICEF, listing major types in India, and analyzing common causes like poverty, lack of education, social factors, cheap labour costs, and family traditions.
Group Theory and Its Application: Beamer Presentation (PPT)SIRAJAHMAD36
This document provides an overview of a seminar presentation on group theory and its applications. The presentation covers topics such as the definition of groups, order of groups and group elements, modular arithmetic, subgroups, Lagrange's theorem, and Sylow's theorems. It also discusses some examples of groups and applications of group theory in fields like algebraic topology, number theory, and physics. The presentation aims to introduce fundamental concepts in modern algebra through group theory.
This document provides an overview of key concepts in ray optics, including:
1. Refraction is defined as the change in direction and speed of light when passing from one medium to another. Snell's law describes the relationship between angles of incidence and refraction.
2. Total internal reflection occurs when light passes from an optically dense to rare medium at an angle greater than the critical angle, causing the light to reflect back into the dense medium.
3. Spherical lenses use thin lens equations and sign conventions to determine image location based on the object position, focal length, and refractive indices of the lens and surrounding media.
Download link ( copy link to download )
https://drive.google.com/file/d/1TOz6arCdt4Nhfm_2emBzQCmgGSTCVQHy/view?usp=sharing
to add this to net beans just do this
1) open netbeans
2) on the top left, click file.
3) then click import project, there select from zip
4) use my file which u downloaded
5) import and thats it
Enjoy Using my Project as a reference for your own Project.
I hope that this will help you to understand what to do in your own project.
Happy Coding Nerds!!
git hub link to download it to ur system
https://github.com/Yosh1kageK1ra/12th-Class-Project-CBSE.git
The document defines and discusses several key concepts relating to groups in abstract algebra:
- A group is defined as a non-empty set together with a binary operation that satisfies closure, associativity, identity, and inverse properties.
- An abelian (or commutative) group is one where the binary operation is commutative. Examples of abelian groups include integers under addition.
- The quaternion group is a non-abelian group of order 8 under multiplication.
- Theorems are presented regarding the uniqueness of identity and inverses in a group, as well as cancellation, reverse order, and inverse properties of groups.
Linear programming class 12 investigatory projectDivyans890
This document provides an introduction to linear programming, including its definition, characteristics, formulation, and uses. Linear programming is a technique for determining an optimal plan that maximizes or minimizes an objective function subject to constraints. It involves expressing a problem mathematically and using linear algebra to determine the optimal values for the decision variables. Common applications of linear programming include production planning, portfolio optimization, and transportation scheduling.
Computer science project on Online Banking System class 12OmRanjan2
This document summarizes a student's computer science project on developing an online banking system. It includes a certificate acknowledging the student's work, declarations by the student and teacher, and acknowledgements. It then provides overviews of the technologies used - Python programming language, MySQL database, and Tkinter graphical interface module. It outlines the project objectives, requirements, database structure, and includes Python code snippets.
The document is a computer programming laboratory manual for Malla Reddy College of Engineering & Technology. It contains instructions for students attending the lab and outlines 16 weeks of programming exercises for students to complete. The exercises include programs to calculate sums and averages, generate Fibonacci sequences, check for prime and Armstrong numbers, perform matrix operations, work with strings and files, and more. It provides the goals, algorithms, flowcharts and programs for students to write and test out for each week's assignments.
This document contains a C program to compute the roots of a quadratic equation. It begins by reading in the coefficients a, b, and c from the user. It then calculates the discriminant and determines if the roots are real, equal, or complex. Appropriate messages are printed. If the roots are real and distinct, it calculates and prints them. If equal, it prints the single root. If complex, it separates into real and imaginary parts and prints both roots. The program uses decision making and math functions to systematically solve the quadratic equation.
1. The document contains code for 8 programming experiments involving algorithms for calculating simple and compound interest, determining Armstrong and Fibonacci numbers, finding the roots of a quadratic equation, matrix operations, and sorting arrays.
2. The algorithms are presented step-by-step and the C code to implement each algorithm is included and commented.
3. Sample inputs and outputs are provided for each program to demonstrate its functionality.
The document describes the Radix Sort algorithm and provides a C program to implement it. Radix sort sorts data by grouping keys based on their individual digit values in each significant position. The program implements Radix Sort using counting sort as a subroutine to sort digits from least significant to most significant. It takes an input array, finds the largest number to determine number of passes, and calls counting sort repeatedly by increasing the exponent value to sort the array. The output of the sample run shows the sorted array.
TOPIC:-
SCIENTIFIC CALCULATOR
PURPOSE:-
To create scientific calculator class to perform the task related to scientific calculations. Which include finding square or cube etc.
The scientific calculator perform following task:-
1. Determine the square of the number.
2. Determine the square root of the number
3. Determine the first number power of the second number
4. Determine the factorial of a number
5. Determine the sin, cos and tan value of the number.
6. Determine the logarithm, natural logarithm and exponential of the number.
The document provides a lab manual for the course GE3171 - Problem Solving and Python Programming Laboratory. It includes the course objectives, list of experiments, syllabus, and programs for various experiments involving Python programming concepts like lists, tuples, conditionals, loops, functions etc. The experiments cover problems on real-life applications such as electricity billing, library management, vehicle components, building materials etc. The document demonstrates how to write Python programs to solve such problems and validate the output.
The document contains information about several programming experiments aimed at solving problems using C++. The first experiment involves writing a program to calculate the average marks of 5 subjects for a student by taking input from the user and using a for loop. The second experiment swaps the first and last digits of a number entered by the user using mathematical formulas. The third generates the Fibonacci series up to a user-specified limit and prints any missing numbers. Each experiment includes the aim, algorithm, code, explanation and sample output. Learning outcomes focus on computational problem-solving skills.
This document provides a lab manual for the course GE3171 - Problem Solving and Python Programming Laboratory (REG-2021). It contains details of various programming exercises to be completed as part of the course curriculum. The exercises cover topics like:
1. Developing flow charts and Python programs for real-life problems like electricity billing, retail shop billing, etc.
2. Python programming using simple statements, expressions, and calculations.
3. Scientific problems using conditionals and iterative loops to generate number series and patterns.
4. Implementing applications using lists, tuples to represent library items, car components, construction materials.
5. Implementing applications using sets and dictionaries for language analysis and car
This document provides an index and overview of programs related to data science concepts in R. The programs cover topics like arithmetic operations on vectors, matrix operations, graphs, loops, and functions. The index lists 8 programs from August to October 2021 covering these topics. For each program, there is a brief description of the concepts covered and examples of R code and output.
This document describes a C++ program for a calculator created by students as a micro-project. The program uses functions and switch-case statements to perform basic math operations like addition, subtraction, multiplication, division, square, and square root. It displays menus to select the operation and prompts the user to input values. The output shows the results of sample calculations for each operation type. The conclusion states that the project helped learn object-oriented programming in C++ by creating a simple calculator program.
Informatics Practice Practical for 12th classphultoosks876
The document provides the coding for a GUI application that retrieves data from the dept table of a MySQL database and displays it in a JTable. It includes code to connect to the database, retrieve the data, and populate the JTable. It has a button that when clicked calls the rtrBtnActionPerformed method, which executes a SQL query to select all records from the dept table and loads the results into the JTable for display.
The document provides details of an experiment conducted in the Problem Solving and Programming Laboratory course. It includes an algorithm, flowchart and C program that demonstrates different formatting options for input and output. The program takes input of two numbers and prints their sum, difference, product and quotient using different formatting options like printf, scanf and format specifiers. It then ends by returning 0.
This document summarizes an experiment on using pointers in C programming. The aim was to use pointers to print an array in reverse order along with the addresses of each element. The student defined two programs - Program A prints the reverse of an integer array using pointers, while Program B defines a function to return the pointer to the maximum of two integers. The student encountered no errors, explained the programs, and listed the learning outcomes regarding C language fundamentals and using pointers to manipulate memory.
DSA Lesson 2 - Algorithm and Flowcharting.pdfROWELL MARQUINA
An algorithm refers to a series of well-defined instructions on how to accomplish a task or solve a specific problem.
Giving directions on how to get to somebody’s house is an algorithm.
The steps on how to change a light bulb is an algorithm.
The steps to compute the for average is also an algorithm.
In creating an algorithm, it is very important to determine the exact goal or expected product first. The goal or expected product of the algorithm is called OUTPUT.
After determining the output, the next step is to identify the necessary materials or elements needed to accomplish the task. The elements needed for the program is called INPUT.
If the input and output are already identified, it is time to list the steps needed to accomplish the task. The steps needed to accomplish the task is referred to as the PROCESS.
This document describes a MATLAB GUI project to create a graphical user interface for various signal processing and control systems functions. The project includes modules for a basic calculator, plotting functions, convolution, impulse response, step response, and bode plots. It aims to allow users to access these functions through a simple GUI without needing to write MATLAB code. The document outlines the functions, algorithms, and testing used for each module. It concludes that the project was successful in creating a user-friendly interface but that further improvements could allow for more customization and user-defined inputs.
The document provides sample C programs and algorithms to practice implementing functions. It includes 10 programs with increasing complexity: (1) a function to check if a number is prime; (2) a function to validate a date; (3) a function to determine the relative position of a point to a circle; (4) a function to calculate the factorial of a number; (5) a function to calculate the nth Fibonacci number; (6) a function to check if a number is a Fibonacci element; (7) a function to calculate the sum of digits of a number; (8) a function to convert an integer and fraction to a double; (9) functions to calculate the greatest common divisor and least common
The document contains the syllabus for the course "Problem Solving and Python Programming" taught at Knowledge Institute of Technology. It includes 4 illustrative problems covered in the syllabus: finding the minimum in a list, inserting a card in a sorted list, guessing a number within a range, and solving the Tower of Hanoi puzzle. Algorithms and pseudocode are provided for each problem to demonstrate the problem-solving approach.
The document presents a generic architecture for an area-efficient 4-input binary coded decimal (BCD) adder implemented on an FPGA. It modifies a previously proposed area-efficient 3-input decimal adder to support a generic number of inputs. The proposed 4-input adder has four stages: 1) carry save addition and propagation/generation signal generation, 2) carry network, 3) correction stage, and 4) final addition. Simulation results on a Xilinx FPGA for different number of bits and inputs are presented, showing the adder has reduced delay and area compared to previous approaches. The generic approach can support addition of any number of inputs.
This document contains a midterm exam for an Elements of Programming course. It consists of 4 sections - multiple choice, fill in the blank, short answer, and programming questions. The multiple choice and fill in the blank sections contain 10 questions each worth 1 mark each. The short answer section contains 3 questions worth a total of 40 marks. The programming question is worth 25 marks and requires the student to create a C++ program to simulate a vending machine. The exam is worth a total of 100 marks and students are instructed to answer all questions and show all working.
Similar to Isc computer project final upload last (20)
The simplified electron and muon model, Oscillating Spacetime: The Foundation...RitikBhardwaj56
Discover the Simplified Electron and Muon Model: A New Wave-Based Approach to Understanding Particles delves into a groundbreaking theory that presents electrons and muons as rotating soliton waves within oscillating spacetime. Geared towards students, researchers, and science buffs, this book breaks down complex ideas into simple explanations. It covers topics such as electron waves, temporal dynamics, and the implications of this model on particle physics. With clear illustrations and easy-to-follow explanations, readers will gain a new outlook on the universe's fundamental nature.
ISO/IEC 27001, ISO/IEC 42001, and GDPR: Best Practices for Implementation and...PECB
Denis is a dynamic and results-driven Chief Information Officer (CIO) with a distinguished career spanning information systems analysis and technical project management. With a proven track record of spearheading the design and delivery of cutting-edge Information Management solutions, he has consistently elevated business operations, streamlined reporting functions, and maximized process efficiency.
Certified as an ISO/IEC 27001: Information Security Management Systems (ISMS) Lead Implementer, Data Protection Officer, and Cyber Risks Analyst, Denis brings a heightened focus on data security, privacy, and cyber resilience to every endeavor.
His expertise extends across a diverse spectrum of reporting, database, and web development applications, underpinned by an exceptional grasp of data storage and virtualization technologies. His proficiency in application testing, database administration, and data cleansing ensures seamless execution of complex projects.
What sets Denis apart is his comprehensive understanding of Business and Systems Analysis technologies, honed through involvement in all phases of the Software Development Lifecycle (SDLC). From meticulous requirements gathering to precise analysis, innovative design, rigorous development, thorough testing, and successful implementation, he has consistently delivered exceptional results.
Throughout his career, he has taken on multifaceted roles, from leading technical project management teams to owning solutions that drive operational excellence. His conscientious and proactive approach is unwavering, whether he is working independently or collaboratively within a team. His ability to connect with colleagues on a personal level underscores his commitment to fostering a harmonious and productive workplace environment.
Date: May 29, 2024
Tags: Information Security, ISO/IEC 27001, ISO/IEC 42001, Artificial Intelligence, GDPR
-------------------------------------------------------------------------------
Find out more about ISO training and certification services
Training: ISO/IEC 27001 Information Security Management System - EN | PECB
ISO/IEC 42001 Artificial Intelligence Management System - EN | PECB
General Data Protection Regulation (GDPR) - Training Courses - EN | PECB
Webinars: https://pecb.com/webinars
Article: https://pecb.com/article
-------------------------------------------------------------------------------
For more information about PECB:
Website: https://pecb.com/
LinkedIn: https://www.linkedin.com/company/pecb/
Facebook: https://www.facebook.com/PECBInternational/
Slideshare: http://www.slideshare.net/PECBCERTIFICATION
हिंदी वर्णमाला पीपीटी, hindi alphabet PPT presentation, hindi varnamala PPT, Hindi Varnamala pdf, हिंदी स्वर, हिंदी व्यंजन, sikhiye hindi varnmala, dr. mulla adam ali, hindi language and literature, hindi alphabet with drawing, hindi alphabet pdf, hindi varnamala for childrens, hindi language, hindi varnamala practice for kids, https://www.drmullaadamali.com
it describes the bony anatomy including the femoral head , acetabulum, labrum . also discusses the capsule , ligaments . muscle that act on the hip joint and the range of motion are outlined. factors affecting hip joint stability and weight transmission through the joint are summarized.
A review of the growth of the Israel Genealogy Research Association Database Collection for the last 12 months. Our collection is now passed the 3 million mark and still growing. See which archives have contributed the most. See the different types of records we have, and which years have had records added. You can also see what we have for the future.
1. PRESENTING THE NEW UPGRADED ISC COMPUTER PROJECT FOR CLASS XII FOR HELPING
STUDENTS SAVE THEIR TIME FOR STUDYING …..
HOPEFULLY YOU WILL LIKE THIS…………..
EXCLUSIVE FEATURES:->
1>ALL PROGRAM WITH SYNTAX EXECUTED ERROR FREE
2>ALGORITH AVAILABLE
NOTE:-
PLZ EDIT THE COVER
SHARE WITH FRIEND AS MUCH AS POSSIBLE
PAGE NUMBERS MAY VARY ACCORDINGLY.
3. ARUNAV RAY ISC COMPUTER PROJECT 2
ACKNOWLEDGEMENTS
First of all, I’d like to thank my parents
for helping me out with the project.
Secondly, I’d like to thank our Computer
teachers Archan Sir for helping us with
the programs.
Lastly, I’m really grateful to classmate
Anuj Modi & Nikhil Agarwal whose help was
imperative for myself making this project.
4. ARUNAV RAY ISC COMPUTER PROJECT 3
CONTENTS
SL NO. TOPIC PAGE NO.
1.
ARRANGE ELEMENTS OF EACH ROW OF A 2D ARRAY IN ASSENDING
ORDER USING BUBBLE SORT
2-3
2. CHECK IF A 2D ARRAY IS SYMMETRIC 4-5
3. PRODUCT OF 2 MATRIX 6-7
4.
ARRANGE ELEMENTS OF EACH ROW OF A 2D ARRAY IN ASSENDING
ORDER USING BUBBLE SORT
8-9
5. MAGIC NUMBER(using RECURSION) 10-11
6. Calculate HCF(using RECURSION) 12-13
7. Armstrong NUMBER (USING RECURSION) 14-15
8. DECIMAL TO BINARY CONVERSION (using RECURSION) 16-17
9. OUTPUT TO A FILE TO STORE 5 NAMES 18-19
10. INPUT NAMES FROM A TEXT FILE 20-21
11. STACK 22-23
12. CIRCULAR QUEUE 24-25
13. WORD PALINDROME 26-27
14. REPLACE VOWELS with the LETTER SUCCEEDING it 28-29
15. DELETE MULTIPLE CHARACTERS FROM A SENTENCE 30-31
5. ARUNAV RAY ISC COMPUTER PROJECT 4
CONTENTS (cont..)
SL NO. TOPIC PAGE NO.
16. TO FIND PAST DATE 32-33
17. TIME 34-35
18.
TO CALCULATE SUM OF TWO ANGLE USING OBJECT PASSING AND
OBJECT RETURNING TECHNIQUE
36-37
19.
SORTING OF COMMON ELEMENTS OF TWO ARRAY USING OBJECT
PASSING AND OBJECT RETURNING TECHNIQUE
38-39
20. AMECABLE NUMBER 40-41
21. CIRCULAR PRIME NUMBER 42-43
23. TO CALCULATE TELEPHONE BILL USING CONCEPT OF INHERITANCE 44-45
23. TO FIND RADIUS AND AREA OF A CIRCLE USING INHERITANCE 46-47
6. ARUNAV RAY ISC COMPUTER PROJECT 5
CONTENTS (cont...)
SL
NO.
TOPIC PAGE NO.
24. TO INSERT ELEMENT AT REAR END IN A LINKLIST 55-57
25. TO DELETE ELEMENT AT REAR END IN A LINKLIST 58-61
26. TO DISPLAY UPPER TRIANGULAR OF A SQUARE MATRIX 62-64
27.
ANAGRAMS
65-67
28. TO INCERT AND DELETE ELEMENTS IN DEQUEUE 68-70
29. SORT 2 ARRAYS USING INSERTION SORT. 71-72
30. DISPLAY THE CALENDAR OF A MONTH BY ACCEPTING THE FIRST DAY OF THE
MONTH.
73-76
7. ARUNAV RAY ISC COMPUTER PROJECT 6
PROGRAM 1: Arrange all the elements of row of n*n matrix in
ascending order.
ALGORITHM
STEP 1: START
STEP 2: Accept value of n
STEP 3: for i=0 to n, repeat STEP 4
STEP 4: for j=0 to n, repeat STEP 5
STEP 5: read a[i,j]
STEP 6: for i=0 to n, repeat STEP 7
STEP 7: for j=0 to n-1, repeat STEP 8
STEP 8: for k=0 to n-j-1, repeat STEP 9
STEP 9: if (a[i][k]>a[i][k+1]) is true switch the numbers
STEP 10: for i=0 to n, repeat STEP 11
STEP 11: for j=0 to n, repeat STEP 12
STEP 12: Display c[i,j]
STEP 13: END
SOLUTION
import java.util.*;
class Arrange_matrix
{ static void main()
{ Scanner sc = new Scanner(System.in);
System.out.println("Enter the size of array");
int n= sc.nextInt();//accepting size of array
int a[][]=new int[n][n];//declaring array
System.out.println("Enter array elements");
for(int i=0;i<n;i++)//accepting array
for(int j=0;j<n;j++)
a[i][j]=sc.nextInt();
for(int i=0;i<n;i++)//sorting array
{ for(int j=0;j<n-1;j++)
{ for(int k=0;k<n-j-1;k++)
if(a[i][k]>a[i][k+1])
{ int temp=a[i][k];
a[i][k]=a[i][k+1];
a[i][k+1]=temp;
}}}
for(int i=0;i<n;i++)//displaying array
{ for(int j=0;j<n;j++)
System.out.print(a[i][j]+"t");
System.out.println();
}}}
8. ARUNAV RAY ISC COMPUTER PROJECT 7
VARIABLE LISTING
SL NO. NAME TYPE METHOD DESCRIPTION
1 n int main() Store size of matrix
2 a int[][] main() Store numbers
3 temp int main() For calculation
4 i,j,k int main() counter
Output:
9. ARUNAV RAY ISC COMPUTER PROJECT 8
PROGRAM 2: To check if 2D array is symmetric or not
Algorithm
STEP 1: START
STEP 2: Accept value of n
STEP 3: for i=0 to n, repeat STEP 4
STEP 4: for j=0 to n, repeat STEP 5
STEP 5: read a[i,j]
STEP 6: for i=0 to n, repeat STEP 7
STEP 7: for j=0 to n-1, repeat STEP 8
STEP 8: if a[i,j] ≠a[j,i] is true, c=c+1
STEP 9: for i=0 to n, repeat STEP 10
STEP 10: for j=0 to n, repeat STEP 11
STEP 11: Display c[i,j]
STEP 12: if c=0 is true then display Array is symmetric otherwise display array is not symmetric
STEP 13: END
****************
Program: To check if 2D array is symmetric or not
10. ARUNAV RAY ISC COMPUTER PROJECT 9
Variable description:
Sl. no Variable Name Datatype Purpose
1 N int To store array size
2 a char[][] To store character
3 c,i,j int Counter
Output:
11. ARUNAV RAY ISC COMPUTER PROJECT 10
PROGRAM 3: To find product of two (n*n)matrix
Algorithm
STEP 1: START
STEP 2: Accept value of n
STEP 3: for i=0 to n, repeat STEP 4
STEP 4: for j=0 to n, repeat STEP 5
STEP 5: read a[i,j]
STEP 6: for i=0 to n, repeat STEP 7
STEP 7: for j=0 to n, repeat STEP 8
STEP 8: read b[i,j]
STEP 9: for i=0 to n, repeat STEP 10
STEP 10: for j=0 to n, repeat STEP 11
STEP 11: for k=0 to n, repeat STEP 12
STEP 12: c[i,j] = a[i,j]* b[i,j] + c[i,j]
STEP 13: for i=0 to n, repeat STEP 14
STEP 14: for j=0 to n, repeat STEP 15
STEP 15: Display c[i,j]
STEP 16: END
*****************
Program: To find product of two (n*n)matrix
12. ARUNAV RAY ISC COMPUTER PROJECT 11
Variable description:
Sl. no Variable Name Datatype Purpose
1 n int To store size of matrix
2 a,b,c int[][] To store number
3 i,j,k int Counter
Output:
13. ARUNAV RAY ISC COMPUTER PROJECT 12
PROGRAM 4: To arrange elements of each row in ascending
order using bubble sort
Algorithm
STEP 1: START
STEP 2: Accept value of n
STEP 3: for i=0 to n, repeat STEP 4
STEP 4: for j=0 to n, repeat STEP 5
STEP 5: read a[i,j]
STEP 6: for i=0 to n, repeat STEP 7
STEP 7: for j=0 to n-1, repeat STEP 8
STEP 8: for k=0 to n-j-1, repeat STEP 9
STEP 9: if (a[i][k]>a[i][k+1]) is true switch the numbers
STEP 10: for i=0 to n, repeat STEP 11
STEP 11: for j=0 to n, repeat STEP 12
STEP 12: Display c[i,j]
STEP 13: END
*****************
Program: To arrange elements of each row in ascending
order using bubble sort
14. ARUNAV RAY ISC COMPUTER PROJECT 13
Variable description:
Sl. no Variable Name Datatype Purpose
1 n int To store size of matrix
2 a int[][] To store number
3 temp int For calculation
4 i,j,k int Counter
Output:
15. ARUNAV RAY ISC COMPUTER PROJECT 14
PROGRAM 5: Magic number using recursion
Algorithm
main()
STEP 1: Accept number and store in variable a
STEP 2: Repeat STEP 3 until a>9
STEP 3: Calculate magic number
STEP 4: Check for magic number
STEP 5: If STEP 4 is true, display Magic number OTHERWISE display not a magic number
sum_digit(int n)
STEP 1: Extract digits from the number and store in variable r
STEP 2: if (n=0) is true then return 0
STEP 3: Otherwise return (r+sum_digit(n/10))
*****************
Program: Magic number using recursion
16. ARUNAV RAY ISC COMPUTER PROJECT 15
Variable description:
Sl. no Variable Name Datatype Purpose
1 a int Accept and store number
to check
2 n int Store number to find
sum of digit
3 r int Extract digit
Output:
17. ARUNAV RAY ISC COMPUTER PROJECT 16
PROGRAM 6: Finding HCF Using Recursion
Algorithm
main()
STEP 1: Accept first number
STEP 2: Accept second number
STEP 3: Calculate HCF
STEP 4: Display HCF
hcf(int a, int b)
STEP 1: If (a>b)is true then return (hcf(a-b,b))
STEP 2: Otherwise if (b>a) is true then return (hcf(a,b-a))
STEP 3: Otherwise return a
****************
Program: Finding HCF Using Recursion
18. ARUNAV RAY ISC COMPUTER PROJECT 17
Variable description:
Sl. No Variable Name Datatype Purpose
1 a int To get number
2 b int To get number
3 c int To store hcf
Output:
19. ARUNAV RAY ISC COMPUTER PROJECT 18
PROGRAM 7: Armstrong Number Using Recursion
(153 =>13+53+33=153)
Algorithm
main()
STEP 1: Accept number and store in variable a
STEP 2: Repeat STEP 3 until a>9
STEP 3: Calculate magic number
STEP 4: Check for magic number
STEP 5: If STEP 4 is true, display Magic number OTHERWISE display not a magic number
checknum(int n)
STEP 1: Receive actual parametric value in variable n
STEP 2: if (n=0) is true then return 0
STEP 3: Otherwise (int)Math.pow(n%10,3)+ checknum(n/10);
*****************
Program: Armstrong Number Using Recursion
20. ARUNAV RAY ISC COMPUTER PROJECT 19
Variable description:
Sl. no Variable Name Datatype Purpose
1 n int To get number
2 m int To store value of return
sum of digits
Output:
21. ARUNAV RAY ISC COMPUTER PROJECT 20
PROGRAM 8: Decimal To Binary Conversion Using Recursion
(10=>1010)
Algorithm
main()
STEP 1: Accept number
task(int n)
STEP 1: Proceed if n>2
STEP 2: store remainder in variable d when n is divided by 2
STEP 3: task(n/2)
STEP 4: Display d backwards in horizontal line
*****************
Program: Decimal To Binary Conversion Using Recursion
22. ARUNAV RAY ISC COMPUTER PROJECT 21
Variable description:
Sl. no Variable Name Datatype Purpose
1 a int To get number
2 d int Binary calculation
3 n int User iput
Output:
23. ARUNAV RAY ISC COMPUTER PROJECT 22
PROGRAM 9: Output to a file to store 5 Names
Algorithm
STEP 1:START
STEP 2: Create a FileWriter stream type object
STEP 3: Link the FileWriter object from STEP 1 with a BufferedWriter object
STEP 4: Link the BufferedWriter object from STEP 2 with a PrintWriter object
STEP 5: for i=0 to 4
STEP 6: Accept name from user
STEP 7: Now write names in the file using PrintWriter object
STEP 8: Close the stream chain by using close()
STEP 9: END
*****************
Program: Output to a file to store 5 Names
24. ARUNAV RAY ISC COMPUTER PROJECT 23
Variable description:
Sl. no Variable Name Datatype Purpose
1 i int Counter
2 name String Input name from user
Output:
25. ARUNAV RAY ISC COMPUTER PROJECT 24
PROGRAM 10: Input Names from a text file
Algorithm
STEP 1:START
STEP 2: Create a FileReader stream type object
STEP 3: Link the FileReader object from STEP 1 with a BufferedReader object
STEP 4: Repeat STEP 5 and STEP 6 until readLine() is null
STEP 5: Read text using readLine() from this BufferedReader object and store in a string object
STEP 6: Display the string object
STEP 7: Close the stream chain by using close()
STEP 8: END
*****************
Program: Input Names from a text file
26. ARUNAV RAY ISC COMPUTER PROJECT 25
Variable description:
Sl. no Variable Name Datatype Purpose
1 i int Counter
Output:
27. ARUNAV RAY ISC COMPUTER PROJECT 26
PROGRAM 11: Stack
Algorithm
STEP 1: START
/* stack – st[], stack pointer – top*/
Push()
STEP 1: Check for overflow
STEP 2: If STEP 1 is true display “Stack Overflow” otherwise proceed to STEP 3
STEP 3: Increase stack pointer by 1
STEP 4: Push the item
Pop()
STEP 1: Check for underflow
STEP 2: If STEP 1 is true display “Stack Underflow” otherwise proceed to STEP 3
STEP 3: Pop out the item and decrease stack pointer by 1
STEP 4: Display the popped out item
Display()
STEP 1: Check for underflow
STEP 2: If STEP 1 is true display “Stack Underflow” otherwise proceed to STEP 3
STEP 3: for i=top to 0
STEP 4: Display st[i]
*****************
Program: Stack
28. ARUNAV RAY ISC COMPUTER PROJECT 27
Variable description:
Sl. no Variable Name Datatype Purpose
1 top int Stack pointer
2 size int[][] Size of stack
3 st[][] int To store stack elements
4 n int To store items to be
inserted
5 i int Counter
Output:
29. ARUNAV RAY ISC COMPUTER PROJECT 28
PROGRAM 12: Circular Queue
Algorithm
STEP 1: START
/* Queue – ar[], pointer – rear,front*/
To insert item
STEP 1: Check for overflow
STEP 2: Set the pointers
STEP 3: Insert the item
To delete item
STEP 1: Check for underflow
STEP 2: Delete an item
STEP 3: Set the pointers
Display()
STEP 1: for i=0 to size-1
STEP 2: Display ar[i]
*****************
Program: Circular Queue
30. ARUNAV RAY ISC COMPUTER PROJECT 29
Variable description:
Sl. no Variable Name Datatype Purpose
1 front,rear int Queue pointer
2 size int[][] Size of the queue
3 ar[] int To store queue
elements
4 n int To store item to be
inserted
5 i int Counter
Output:
31. ARUNAV RAY ISC COMPUTER PROJECT 30
PROGRAM 13: Palindrome Word
Algorithm
STEP 1: START
STEP 2: Find length of the entered word and store in variable l
STEP 3: for i=l-1 to 0, repeat STEP 4
STEP 4: w=w+s.charAt(i)
STEP 5: If s=w, then display Palindrome otherwise display not palindrome
STEP 6: END
*****************
Program: Palindrome Word
32. ARUNAV RAY ISC COMPUTER PROJECT 31
Variable description:
Sl. no Variable Name Datatype Purpose
1 s String Store original word
2 w String Store reversed word
3 l int Store number of
character in s
4 i int Counter
Output:
33. ARUNAV RAY ISC COMPUTER PROJECT 32
PROGRAM 14: Replace all vowels of a sentence with succeeding
letter
Algorithm
STEP 1: START
STEP 2: Find length of the entered word and store in variable l
STEP 3: for i=0 to l-1, repeat STEP 4,5,6
STEP 4: Extract characters of the word and store in variable ch
STEP 5: if ch is a vowel, ch=ch+1
STEP 6: str= str+ch
STEP 7: Display the original word and the new word
STEP 8: END
*****************
Program: Replace all vowels of a sentence with succeeding
letter
34. ARUNAV RAY ISC COMPUTER PROJECT 33
Variable description:
Sl. no Variable Name Datatype Purpose
1 s String Store original word
2 str String Store the new word
3 l int Store number of
character in s
4 i int Counter
5 ch char Extract character
Output:
35. ARUNAV RAY ISC COMPUTER PROJECT 34
PROGRAM 15: Delete Multiple Character from a Sentence
Algorithm
STEP 1: START
STEP 2: Covert the string to UPPERCASE
STEP 3: str= the first character of the sentence
STEP 4: Find length of the entered word and store in variable l
STEP 5: for i=0 to l-1, repeat STEP 6-11
STEP 6: Extract characters of the word and store in variable ch
STEP 7: Find length of the entered word and store in variable l 1
STEP 8: for j=0 to l1, repeat STEP 9,10
STEP 9: Extract characters of the word and store in variable ch1
STEP 10: if ch=ch1, is true c=c+1
STEP 11: if c=0, then only add ch to str
STEP 12: Display the original word and the new word
STEP 13: END
*****************
Program: Delete Multiple Character from a Sentence
36. ARUNAV RAY ISC COMPUTER PROJECT 35
Variable description:
Sl. no Variable Name Datatype Purpose
1 s String Store original word
2 str String Store the new word
3 l,l1 int Store number of
character in string
4 i,j,c int Counter
5 ch,ch1 char Extract character
Output
37. ARUNAV RAY ISC COMPUTER PROJECT 36
PROGRAM 16: To Find Date on which project was given if
project submission date and number of days
allotted for the project are mentioned by the
user. (PAST DATE)
Example: - Example:-
Entered date 26/02/2000 Entered date 03/01/2000
Days before: - 10 Days before: - 5
Past date 16/02/2000 Past date 29/12/1999
Algorithm
STEP 1: Start
STEP 2: Separating date ,month and year from input
STEP 3: Checking for leap year
STEP 4: Checking for invalid date
STEP 5: Accepting day to calculate past date
STEP 6: Calculating past date
STEP 7: Displaying past date
STEP 8: End
38. ARUNAV RAY ISC COMPUTER PROJECT 37
Program: TO FIND PAST DATE
import java.util.Scanner;
class pastDate
{
public static void main(String args[])
{
Scanner sc=new Scanner(System.in);
int month[]={0,31,28,31,30,31,30,31,31,30,31,30,31};
System.out.print("Enter the Submission Date in (dd/mm/yyyy) format: ");
String date=sc.nextLine().trim();
int p,q,count=0;
p=date.indexOf("/");
int d=Integer.parseInt(date.substring(0,p));//EXTRACTING DAYS
q=date.lastIndexOf("/");
int m=Integer.parseInt(date.substring(p+1,q));
int y=Integer.parseInt(date.substring(q+1));
System.out.println("Entered Project Submission Date: "+date);
if((y%400==0) || ((y%100!=0)&&(y%4==0)))//CHECKING LEAP YEAR
month[2]=29;
else
month[2]=28;
if(m<0 || m>12 || d<0 || d>month[m] || y<0 || y>9999)//VALIDATION OF DATE
{
System.out.println("Invalid Date");
}
else
{
System.out.print("Enter number of days alloted for the project: ");
int days=Integer.parseInt(sc.nextLine());
while(count<days)//LOOP TO FIND PAST DATE
{
d--;
count++;
if(d<1)
{
d=month[m-1];//STORING PREVIOUS MONTH NUMBER OF DAYS
m--;
}
if(m<1)
{
y--;
m=12;
d=month[m];
if((y%400==0) || ((y%100!=0)&&(y%4==0))) //CHECKING FOR LEAP YEAR
month[2]=29;
else
month[2]=28;
}
}
System.out.println("Date on which project was given: +d+"/"+m+"/"+y);
}
}
}
39. ARUNAV RAY ISC COMPUTER PROJECT 38
Variable description:
Sl. no Variable Name Datatype Purpose
1 p,q int To store index number
2 count int Counter
3 i,j,k int Counter
4 month int[] Days of a month
5 d,m,y int To store day ,month ,year
respectively
Output:
40. ARUNAV RAY ISC COMPUTER PROJECT 39
PROGRAM 17: To Find Sum of two time
Two different time are added as follows:-
Time 1:6 hours 35 minutes
Time 2:3 hours 45 minutes
Sum of Time: 10 hour 20 minutes
Class Name Time
Data Members/Instance Variable
hrs,min Integer variable to store hours and minutes
Member Function/Methods
Time() Constructor to assign 0 to hrs and min
void gettime(int nh,int nm) To store nh in hrs and nm to min
void printTime() To print value of hours and minutes with proper
message
Time sumTime(Time t1,Time t2) To find sum of times from object T1 and T2 by using
above methods of adding time and return the sum of
times
Algorithm
STEP 1: Start
STEP 2: void gettime(int nh,int nm)
Initialization of data members nh to hrs and nm to min
STEP 3: Time sumoftime(Time t1,Time t2)
We take two object in method sum of time as t1 and t2
Create a new object c and declare it min and hrs as sum of min of both the object
t1 and t2.
STEP 4: Return the created object
STEP 5: void display()
Display the hrs and min of the new created object
STEP 6: void main(int hr1,int min1,int hr 2,int min 2 )
Declare object ob1 and ob2
Call Function gettime(hr1,min1) by ob1 and gettime(hr2,min2) by ob2
Call display function using ob1 as well as ob2
Use ob3 object as variable to call function sumoftime(ob1,ob2)
Lastly call display function using ob3
STEP 7: End
41. ARUNAV RAY ISC COMPUTER PROJECT 40
Program: TO FIND SUM OF TWO TIMES
import java.util.Scanner;
class Time
{
Scanner sc=new Scanner(System.in);
int hrs,min;
Time()
{
hrs=0;
min=0;
}
void gettime(int nh,int mn)
{
hrs=nh;
min=mn;
}
Time sumtime(Time t1,Time t2)
{
Time c=new Time();
c.min=t1.min+t2.min;
c.hrs=t1.hrs+t2.hrs;
c.hrs=c.hrs+(int)(c.min/60);
c.min=c.min%60;
return c;
}
void display()
{
System.out.println(hrs+" hours"+" "+min+" minutes");
}
void main(int h1,int m1,int h2,int m2)
{
Time ob1=new Time();
Time ob2=new Time();
ob1.gettime(h1,m1);
ob2.gettime(h2,m2);
ob1.display();
ob2.display();
Time ob3=sumtime(ob1,ob2);
ob3.display();
}
}
42. ARUNAV RAY ISC COMPUTER PROJECT 41
Variable description:
Sl. no Variable Name Datatype Purpose
1 hrs,min int To store hour and minute
2 nh,nm int Formal parameter
3 h1,min1,h2,min2 int Actual parameter
Output:
43. ARUNAV RAY ISC COMPUTER PROJECT 42
PROGRAM 18: To Find Sum of two angle
Two different are are added as follows:-
Let the first angle =20 degrees 45 minutes
Let the second angle = 12 degrees 40 minutes
Sum of Angle will be: 33 degrees 25 minutes (60 minutes=1 Degree)
Class Name Angle
Data Members/Instance Variable
deg,min Integer variable to store degree and minutes
Member Function/Methods
Angle() Constructor to assign 0 to deg and min
void inputangle() To store nh in hrs and nm to min
void displayangle() To print value of deg and minutes with proper
message
Angle sumofangle(Angle t1,Angle t2) To find sum of angles from object T1 and T2 by using
above methods of adding time and return the sum of
angles
Algorithm
STEP 1: Start
STEP 2: void inputangle()
Initialization of data members deg and min
STEP 3: Angle sumofangle (Angle t1,Angle t2)
We take two object in method sum of angle as t1 and t2
Create a new object c and declare its deg & min and hrs as sum of deg&min of
both the object t1 and t2.
STEP 4: Return the created object
STEP 5: void display()
Display the deg and min of the new created object
STEP 6: void main()
Declare object ob1 and ob2
STEP 7: Call Function inputangle()by ob1 and inputangle()by ob2
Call display function using ob1 as well as ob2
Use ob3 object as variable to call function sumofangle(ob1,ob2)
Lastly call display function using ob3
STEP 8: End
45. ARUNAV RAY ISC COMPUTER PROJECT 44
Variable description:
Sl. no Variable Name Datatype Purpose
1 deg,min int To store degree and
minute
Output:
46. ARUNAV RAY ISC COMPUTER PROJECT 45
PROGRAM 19: To Sort Common Elements Of Two Array
Class name Collection
Data members
arr[] integer array
len length of the array
Member functions
Collection() default constructor
Collection(int) Parameterized constructor to assign the length of the
array.
void inparr() To accept the array elements.
Collection common(Collection) Returns a Collection containing the common
elements of current Collection object and the
Collection object passed as a parameter.
void arrange() Sort the array elements of the object containing
common elements in ascending order using any
sorting technique.
void display() Displays the array elements.
Algorithm
STEP 1: Start
STEP 2: collection()
Initialization of data members len=0
STEP 3: collection(int a)
STEP 4: Initialization of data members len=a
And declare array of size a
STEP 5: void inparr()
to enter array elements
STEP 6: Collection common (Collection a)
We take object in method common as a
Create a new object b and declare and add the common elemnts of that array and
current array in the new array of the new object
Change the length of the new object accordingly
Return the created object
STEP 7: void arrange()
To sort the common elements in assending order using bubble sort
STEP 8: void display()
Display the sorted array
STEP 9: void main(int l1,int l2)
Declare object ob1 of length l1 and ob2 of length l2 respectively.
STEP 10: Call Function inparr()by ob1 and inparr()by ob2
Use ob3 object as variable to call function common(ob1) using ob2
Lastly call display function using ob3
STEP 11: End
48. ARUNAV RAY ISC COMPUTER PROJECT 47
Variable description:
Sl. no Variable Name Datatype Purpose
1 arr[] int Integer array
2 len int To store length of array
3 i,j int For loop
4 k int Counter
Output:
49. ARUNAV RAY ISC COMPUTER PROJECT 48
PROGRAM 20:Amicable Number
A pair of numbers, each of which is the sum of the factors of the other (e.g. 220 and 284).They
are amicable because the proper divisors of 220 are 1, 2, 4, 5, 10, 11, 20, 22, 44, 55 and 110, of
which the sum is 284; and the proper divisors of 284 are 1, 2, 4, 71 and 142, of which the sum is
220.
Other examples are: - (220, 284), (1184, 1210), (2620, 2924), (5020, 5564)
Algorithm
STEP 1: Start
STEP 2: Take a and b as parameterized input
STEP 3: Declare I,j,c,and d
STEP 4: Run loop i to a and add all factor in c
STEP 5: Run loop j to b and add all factor in d
STEP 6: Check if c is equal to b and d is equal to a
STEP 7: If true then amecable else not
STEP 8: End
Program: AMICABLE NUMBER
50. ARUNAV RAY ISC COMPUTER PROJECT 49
Variable description:
Sl. no Variable Name Datatype Purpose
1 a,b int Parameterized input
2 c,d int To store sum of factors
3 i,j int For loop
Output:
51. ARUNAV RAY ISC COMPUTER PROJECT 50
PROGRAM 21: Circular Prime Number
A Circular Prime is a prime number that remains prime under cyclic shifts of its digits.
When the leftmost digit is removed and replaced at the end of the remaining string of
digits, the generated number is still prime. The process is repeated until the original
number is reached again.
A number is said to be prime if it has only two factors I and itself.
Example:
131
311
113
Hence, 131 is a circular prime.
Algorithm
STEP 1: Start
STEP 2: Take a and b as parameterized input
STEP 3: Declare I,j,c,and d
STEP 4: Run loop i to a and add all factor in c
STEP 5: Run loop j to b and add all factor in d
STEP 6: Check if c is equal to b and d is equal to a
STEP 7: If true then amecable else not
STEP 8: End
52. ARUNAV RAY ISC COMPUTER PROJECT 51
Program: CIRCULAR PRIME NUMBER
import java.util.*;
class CircularPrimeNumber
{
boolean isPrime(int n)
{
int c = 0;
for(int i = 1; i<=n; i++)
{
if(n%i == 0)
c++;
}
if(c == 2)
return true;
else
return false;
}
int circulate(int n)
{
String s = Integer.toString(n);
String p = s.substring(1)+s.charAt(0);
int a = Integer.parseInt(p);
return a;
}
void isCircularPrime(int n)
{
int f = 0,a = n;
do
{
System.out.println(a);
if(isPrime(a)==false)
{
f = 1;
}
a = circulate(a);
}while(a!=n);
if(f==1)
System.out.println(n+" IS NOT A CIRCULAR PRIME");
else
System.out.println(n+" IS A CIRCULAR PRIME");
}
public static void main(String args[])
{
CircularPrimeNumber ob = new CircularPrimeNumber();
Scanner sc = new Scanner(System.in);
System.out.print("Enter a number : ");
int n = sc.nextInt();
ob.isCircularPrime(n);
}
}
53. ARUNAV RAY ISC COMPUTER PROJECT 52
Variable description:
Sl. no Variable Name Datatype Purpose
1 n int Parameterized input
2 c int Counter
3 i int For loop
4 s,p String To store string and
modify it
5 f int Checking condition
6 a int Acting as temporary
variable
Output:
54. ARUNAV RAY ISC COMPUTER PROJECT 53
PROGRAM 22: TO CALCULATE TELEPHONE BILL USING CONCEPT OF
INHERITANCE
A super class Detail has been defined to store the details of a customer. Define a subclass Bill to
compute the monthly telephone charge of the customer as per the chart given below:
Number Of Calls Rate
1 – 100 Only Rental charge
101 – 200 60 paisa per call + rental charge
201 – 300 80 paisa per call + rental charge
Above 300 1 rupee per call + rental charge
The details of both the classes are given below:
Class Name : Detail
Data members / Instance variables:
name : to store the name of the customer.
address : to store the address of the customer.
telno : to store the phone number of the customer.
rent : to store the monthly rental charge
Member functions:
Detail(…) : parameterized constructor to assign values to data members.
void show() : to display the detail of the customer.
Class Name : Bill
Data members / Instance variables:
n : to store the number of calls.
amt : to store the amount to be paid by the customer.
Member functions:
Bill(…) : parameterized constructor to assign values to data members of both classes and to
initialize amt = 0.0.
void cal() : calculates the monthly telephone charge as per the charge given above.
void show() : to display the detail of the customer and amount to be paid.
Specify the class Detail giving details of the constructor( ) and void show(). Using the concept
of inheritance, specify the class Bill giving details of the constructor( ), void cal() and void show().
Algorithm
SUPER CLASS
STEP 1: Start
STEP 2: Accept personal details
STEP 3: Print them in display
STEP 4: End
BASE CLASS
STEP 1: Start
STEP 2: Assign value to super class variable using super keyword
STEP 3: Calculating amount to be paid as per number of calls
STEP 4: Printing details
STEP 5: End
55. ARUNAV RAY ISC COMPUTER PROJECT 54
Program: TO CALCULATE TELEPHONE BILL USING CONCEPT OF
INHERITANCE
import java.io.*;
class Detail //superclass
{
String name, address;
long telno;
double rent;
Detail(String n1, String a1, long t1, double r1)
{
name = n1;
address = a1;
telno = t1;
rent = r1;
}
void show()
{
System.out.println("Name of customer = "+name);
System.out.println("Address = "+address);
System.out.println("Telephone Number = "+telno);
System.out.println("Monthly Rental = Rs. "+rent);
}
} //end of superclass Detail
class Bill extends Detail //subclass
{ int n;
double amt;
Bill(String n1, String a1, long t1, double r1, int c)
{
super(n1,a1,t1,r1); //initializing data members of superclass by
calling its constructor
n = c;
amt = 0.0;
}
void cal()
{
if(n>=1 && n<=100)
amt = rent;
else if(n>=101 && n<=200)
amt = 0.6*n + rent;
else if(n>=201 && n<=300)
amt = 0.8*n + rent;
else
amt = 1*n + rent;
}
void show()
{
super.show(); //calling the superclass function show()
System.out.println("No. of calls = "+n);
System.out.println("Amount to be paid = Rs. "+amt);
}
} //end of subclass Bill
56. ARUNAV RAY ISC COMPUTER PROJECT 55
Variable description:
Sl. no Variable
Name
Class Datatype Purpose
1 n1,a1 detail String Parameterized input name and address
2 t1 detail long Telephone number
3 r1 detail double rent
4 n bill int Number of calls made
5 amt bill double For calculating payable amount
6 a bill int Acting as temporary variable
Output:
57. ARUNAV RAY ISC COMPUTER PROJECT 56
PROGRAM 23: TO FIND RADIUS OF A CIRCLE USING INHERITANCE
Class Name Circle
Data Members:
r Stores the radius
Member Functions:
Circle(…) To assign values to data
void calDistance() Calculates the distance between the
coordinates and stores in r
void display() displaying the radius along with points.
Specify the class Point, giving details of the constructor and void display(). Using the
concept of inheritance. specify a class Circle giving details of the constructor, void
calDistance() and void display().Do not write main() function.
Algorithm
SUPER CLASS
STEP 1: Start
STEP 2: Parameterized constructor to initialize the point coordinates
STEP 3: Displaying the points
STEP 4: End
BASE CLASS
STEP 1: Start
STEP 2: Parameterized constructor to initialize the variables by invoking the constructor of
the parent class
STEP 3: CalDistance function to calculate the distance between two points and storing in r
STEP 4: Calling the display func of parent class and displaying the radius
STEP 5: End
Class Name Point
Data Members:
x1,x2 stores x- coordinate
y1,y2 stores y- coordinate
Member Functions:
Point(…) To assign values to data members.
void display() Displays the coordinates.
58. ARUNAV RAY ISC COMPUTER PROJECT 57
Program: TO FIND RADIUS OF A CIRCLE USING INHERITANCE
class Point
{
int x1,x2,y1,y2;
Point(int a,int b,int c,int d)
{
x1=a;
x2=b;
y1=c;
y2=d;
}
void display()
{
System.out.println("The coordinates are - ("+x1+","+y1+") and
("+x2+","+y2+")");
}
}
public class circle extends Point
{
double r;
circle(int a,int b,int c,int d)
{
super(a,b,c,d);
r=0.0;
}
public void calDistance()
{
r=Math.sqrt(Math.pow(x2-x1,2)+Math.pow(y2-y1,2));
}
void display()
{
super.display();
System.out.println("The length of the radius = "+r+" units");
}}
59. ARUNAV RAY ISC COMPUTER PROJECT 58
Variable description:
Sl. no Variable
Name
Class Datatype Purpose
1 x1,x2,y1,y2 Point int Storing coordinates
2 a,b,c,d Point int For calculation
3 r Circle double To store Radius
Output:
60. ARUNAV RAY ISC COMPUTER PROJECT 59
PROGRAM 24: TO INSERT ELEMENT AT REAR END IN A LINKLIST
Algorithm
STEP 1 : START
STEP 2 : [Create the first list of the structure]
Accept(start->temp)
start->link=NULL
STEP 3 : [Initialize the temporary objects]
ptr=start
STEP 4 : [Input number of nodes to be created]
Accept(“Numbers of nodes-”,n)
count=0
STEP 5 : [Create other nodes of the linked list structure and connect them]
Repeat through steps 6 and 7 while(c<n)
STEP 6 : [Create a temporary node]
Accept(temp->data)
temp->link=NULL
STEP 7 : [Connect the temporary list in existing linked list]
ptr->link=temp
ptr=ptr->link
c=c+1
temp=NULL
ar[rear]=n
STEP 8 : [Withdraw temporary pointer ptr]
ptr=NULL
STEP 9 : [Create a single list]
Accept(temp->data)
STEP 10 : [Initialize ptr object to refer first list]
ptr=start
STEP 11 : [Locate the last link of the linked list structure]
while(ptr->link!=NULL)
ptr=ptr->link
endwhile
STEP 13 : [Insert the list]
ptr->link=temp
STEP 14 : END
61. ARUNAV RAY ISC COMPUTER PROJECT 60
Program: TO INSERT ELEMENT AT REAR END IN A LINKLIST
import java.util.*;
class node
{ int data;
node link;
void create()//creating a linked list
{ Scanner OB= new Scanner(System.in);
System.out.println("Enter the first data-");
this.data= OB.nextInt();
System.out.println("Enter number of nodes to be
created-");
int n=OB.nextInt();
node temp;
node ptr=this;
for(int i=1; i<n;i++)
{ temp= new node();
System.out.println("Enter next data");
temp.data= OB.nextInt();
temp.link= null;
ptr.link= temp;
temp=null;
ptr=ptr.link; }}
void insertend(node start, int x)//inserting a list
{ node temp= new node();
temp.data=x;
node ptr=start;
while(ptr.link!=null)
{ ptr=ptr.link; }
ptr.link=temp; }
void display()//displaying the elements
{ System.out.println("Linked list-");
node ptr=this;
while(ptr!=null)
{ System.out.println(ptr.data);
ptr=ptr.link; }}
static void main()
{ Scanner OB = new Scanner(System.in);
System.out.println("Enter the no. to be inserted");
int k = OB.nextInt();
node first = new node();
first.create();
first.insertend(first,k);
first.display(); }}//end of class
62. ARUNAV RAY ISC COMPUTER PROJECT 61
Variable description:
Sl. no Variable Name Datatype Purpose
1 data int Accepting value
2 n int Accepting value
3 i int Counter
4 x int To store value
5 k int Accepting values
Output:
63. ARUNAV RAY ISC COMPUTER PROJECT 62
PROGRAM 25: TO DELETE ELEMENT AT REAR END IN A LINKLIST
Algorithm
STEP 1 : START
STEP 2 : [Create the first list of the structure]
Accept(start->temp)
start->link=NULL
STEP 3 : [Initialize the temporary objects]
ptr=start
STEP 4 : [Input number of nodes to be created]
Accept(“Numbers of nodes-”,n)
count=0
STEP 5 : [Create other nodes of the linked list structure and connect them]
Repeat through steps 6 and 7 while(c<n)
STEP 6 : [Create a temporary node]
Accept(temp->data)
temp->link=NULL
STEP 7 : [Connect the temporary list in existing linked list]
ptr->link=temp
ptr=ptr->link
c=c+1
temp=NULL
ar[rear]=n
STEP 8 : [Withdraw temporary pointer ptr]
ptr=NULL
STEP 9 : [Initialize Ptr and ptr1 objects referring Start]
Ptr=Start
Ptr1=Start
STEP 10 : [Initialize the counter]
Count=0
STEP 11 : [Locate nth node to be deleted]
Repeat while (Count<n)
Ptr1=Ptr
Ptr=Ptr->link
Count=Count+1
Endwhile
STEP 12 : [Delete the list]
Ptr1->link=Ptr->link
Ptr->link=NULL
STEP 13 : [Withdraw the temporary pointers]
Ptr=NULL
Ptr1=NULL
STEP 14 : return
STEP 15 : END
64. ARUNAV RAY ISC COMPUTER PROJECT 63
Program: TO DELETE ELEMENT AT REAR END IN A LINKLIST
import java.util.*;
class nodal
{ int data;
nodal link;
public nodal()
{
data=0;
link=null; }
public static void main()
{
Scanner sc= new Scanner(System.in);
nodal ob=new nodal();
int ch,n,k,e,s=1;
do {
System.out.println("Enter 1 to create List");
System.out.println("Enter 2 to delete element");
System.out.println("Enter 3 to to display List");
System.out.println("Enter your choice");
ch=sc.nextInt();
switch(ch)
{
case 1:ob.create();
break;
case 2:System.out.println("Enter the node number you want to delete");
n=sc.nextInt();
ob.delete(ob,n);
break;
case 3:ob.display();
break;
default : System.out.println("Wrong choice");
}
System.out.println("Do you want to continue?(1/0)");
s=sc.nextInt();
}
while(s!=0);
}
void create()//creating a linked list
{ Scanner sc= new Scanner(System.in);
System.out.println("Enter the first data-");
this.data= sc.nextInt();
System.out.println("Enter number of nodes to be created-");
65. ARUNAV RAY ISC COMPUTER PROJECT 64
int n=sc.nextInt();
nodal temp;
nodal ptr=this;
for(int i=1; i<n;i++)
{ temp= new nodal();
System.out.println("Enter next data");
temp.data= sc.nextInt();
temp.link= null;
ptr.link= temp;
temp=null;
ptr=ptr.link;
}
}
public void delete(nodal start, int n)//inserting a list
{ nodal ptr= start;
nodal ptr1= ptr;
int c=0;
while(c<=n)
{
ptr1=ptr;
ptr=ptr.link;
c++;
}
ptr1.link=ptr.link;
ptr.link=null;
ptr=ptr1=null;
}
void display()//displaying the elements
{
System.out.println("Linked list-");
nodal ptr=this;
while(ptr!=null)
{ System.out.println(ptr.data);
ptr=ptr.link;
}
}
}//end of class
66. ARUNAV RAY ISC COMPUTER PROJECT 65
Variable description:
Sl. no Variable Name Datatype Purpose
1 data int Accepting value
2 n int Accepting value
3 i int Counter
4 Ptr,Ptr1 int To store value
5 link int To link cells of linklist
6 ch int Switch variable
7 s int checker
Output:
67. ARUNAV RAY ISC COMPUTER PROJECT 66
PROGRAM 26: TO DISPLAY UPPER TRIANGULAR OF A SQUARE MATRIX
Algorithm
STEP 1 : START
STEP 2 : Define array a
STEP 3 : Accept row and coloumn from user and check if square matrix or not
STEP 4 : Repeat i from 0 to n an j from 0 to n and take input in array
STEP 5 : Repeat i from 0 to n an j from 0 to n and display the inputted array
STEP 6 : Repeat i from 0 to n an j from 0 to n and check condition if i<=j true or not
if true print else leave free space
STEP 7 : If row number and coloumn number is different then print suitable
message
STEP 8 : END
Variable description:
Sl. no Variable Name Datatype Purpose
1 a[] int Integer array
2 n,m int Accepting value
3 i,j int Counter
68. ARUNAV RAY ISC COMPUTER PROJECT 67
Program: TO INSERT ELEMENT AT REAR END IN A LINKLIST
import java.util.Scanner;
public class Upper_Triangular
{ public static void main(String args[])
{ int a[][];
System.out.println("Enter the order of your Matrics ");
System.out.println("Enter the rows:");
Scanner sc = new Scanner(System.in);
int n = sc.nextInt();
System.out.println("Enter the columns:");
Scanner s = new Scanner(System.in);
int m = s.nextInt();
a=new int[n][m];
if(n == m)
{ System.out.println("Enter your elements:");
for(int i = 0; i < n; i++)
{
for(int j = 0; j < n; j++)
{
Scanner ss = new Scanner(System.in);
a[i][j] = ss.nextInt();
System.out.print(" "); }
}
System.out.println("You have entered:");
for(int i = 0; i < n; i++)
{
for(int j = 0; j < n; j++)
{
System.out.print(a[i][j] + " ");
}
System.out.println("");
}
System.out.println("The Upper Triangular Matrices is:");
for(int i = 0; i < n; i++)
{
for(int j = 0; j < n; j++)
{
if(i <= j)
{
System.out.print(a[i][j] +" ");
}
else
{
System.out.print("0"+" ");
} }
System.out.println(""); } }
else
{
System.out.println("you have entered improper order");
} }
}
70. ARUNAV RAY ISC COMPUTER PROJECT 69
PROGRAM 27: ANAGRAMS
Algorithm
STEP 1 : START
STEP 2 : Accept the word from the user
STEP 3 : Send the entered word along with a blank space to STEP 4
STEP 4 : If the length of the entered word is 1 display the same word otherwise
gotoSTEP 5
STEP 5 : run a loop i from 0 to length
STEP 6 : break the word into 3 parts and send 1 string and 2 strings together to
STEP3.
STEP 7 : END
Variable description:
Sl. no Variable Name Datatype Purpose
1 c int Counter
2 s String Accepting value
3 s1,s2 String Parameterized input
4 x,y,z String To form anagram String editing
71. ARUNAV RAY ISC COMPUTER PROJECT 70
Program: ANAGRAMS
import java.util.*;
class Anagrams
{ int c = 0;
void input()throws Exception
{ Scanner sc = new Scanner(System.in);
System.out.print("Enter a word : ");
String s = sc.next();
System.out.println("The Anagrams are : ");
display("",s);
System.out.println("Total Number of Anagrams =
"+c);
}
void display(String s1, String s2)
{
if(s2.length()<=1)
{
c++;
System.out.println(s1+s2);
}
else
{
for(int i=0; i<s2.length(); i++)
{
String x = s2.substring(i, i+1);
String y = s2.substring(0, i);
String z = s2.substring(i+1);
display(s1+x, y+z); }
}
}
public static void main(String args[])throws
Exception
{
Anagrams ob=new Anagrams();
ob.input();
}
}
73. ARUNAV RAY ISC COMPUTER PROJECT 72
PROGRAM 28: TO INCERT AND DELETE ELEMENTS IN DEQUEUE
Algorithm
STEP 1 : START
STEP 2 : [Check for the underflow]
if(front=NULL and rear=NULL)
Display(“Queue Underflow”)
STEP 3 : [Delete an element at the front end]
Display(“Deleted-”, ar[front])
if(front =rear)
front=NULL and rear= NULL
else
front++
STEP 4 : [Delete an element at the rear end]
Display(“Deleted-”, ar[rear])
if(front =rear)
front=NULL and rear= NULL
else
rear--
STEP 5 : [Set the pointer if Underflow]
if(front =NULL and rear= NULL)
front=0 and rear=0
[insert the first element]
ar[front]=n
STEP 6 : [Insert the element in the Dqueue at rear end]
if(rear=size-1)
Display(“Queue overflow at rear end”)
else
rear++
ar[rear]=n
STEP 7 : [Insert the element in the Dqueue at front end]
if(front=0)
Display(“Queue overflow at front end”)
else
--front
ar[front]=n
STEP 8 : Display the elements form front to rear
STEP 9 : END
74. ARUNAV RAY ISC COMPUTER PROJECT 73
Program: TO INCERT AND DELETE ELEMENTS IN DEQUEUE
import java.util.*;
class DeQueue
{ int size=5,front=-1,rear=-1;
int ar[]= new int[size];
void front_delete()//delete element function
{ if(front==-1 && rear==-1)//checking if queue is empty
System.out.println("Queue Underflow");
else
{ System.out.println("nDeleted- |"+ar[front]+"| ");
if(front==rear)
front=rear=-1;
else
front++; }}
void rear_delete()//delete element function
{ if(front==-1 && rear==-1)//checking if queue is empty
System.out.println("Queue Underflow");
else
{ System.out.println("nDeleted- |"+ar[rear]+"| ");
if(front==rear)
front=rear=-1;
else
rear--; }}
void rear_insert(int n)//insert element function
{ if(rear==size-1)
System.out.println("Queue overflow at rear end");
else
{ if(front==-1 && rear==-1)
front=rear=0;
else
rear++;
ar[rear]=n; }}
void front_insert(int n)//insert element function
{ if(front==0)
System.out.println("Queue overflow at front end");
else
{ if(front==-1 && rear==-1)
front=rear=0;
else
--front;
ar[front]=n; }}
void display()//display queue function
{ if(front==-1&&rear==-1)
System.out.println("Dequeue empty");
else
{
for(int i=front;i<=rear;i++)
System.out.print("|"+ar[i]+"| "); }}}
75. ARUNAV RAY ISC COMPUTER PROJECT 74
Variable description:
Sl. no Variable Name Datatype Purpose
1 front int Queue pointer
2 rear int Queue pointer
3 size int Store Value
4 ar[] int Store Values
5 n int Accepting value
6 i int Counter
Output:
Entering values in rear 5,4,3,2 & calling display function
Removing value from front (5) & calling display function
Entering value at front (6) & calling display function
Removing value from rear(2) & calling display function
76. ARUNAV RAY ISC COMPUTER PROJECT 75
PROGRAM 29: SORT 2 ARRAYS USING INSERTION SORT.
Algorithm
Step 1- START
Step 2- store a highly negative number in the initial cell
Step 3-Sort the elements. Repeat Step 6 for (i=1,2,3…….n)
Step 4- initialize temporary variables
Step 5- Compare the elements backwards.
Step 6- insert the element entered by the user
Step 7- END.
Variable description:
Sl. no Variable Name Datatype Purpose
1 l1 int Store size of array
2 a int[] Store elements
3 i Int Counter
4 temp,ptr int For Calculation
77. ARUNAV RAY ISC COMPUTER PROJECT 76
Program: SORT 2 ARRAYS USING INSERTION SORT.
import java.util.*;
class Insertion_sort
{ static void main()//main function
{ Scanner sc = new Scanner(System.in);
System.out.println("Enter the size of the array");
int l1=sc.nextInt(),temp=0,ptr=0;
int a[]=new int[l1+1];//declaring array
a[0]=-999;//Highly negative number in initial cell
System.out.println("Enter array elements");
for(int i=1;i<=l1;i++)//accepting array
a[i]=sc.nextInt();
//sorting of array
for(int i=1;i<=l1;i++)
{
temp=a[i];
ptr=i-1;
while(a[ptr]>temp)
{
a[ptr+1]=a[ptr];
ptr--;
}
a[ptr+1]=temp;
}
for(int i=1;i<=l1;i++)//displaying array
System.out.print(a[i]+" ");
}
}
Output:
78. ARUNAV RAY ISC COMPUTER PROJECT 77
PROGRAM 30: DISPLAY THE CALENDAR OF A MONTH
BY ACCEPTING THE FIRST DAY OF THE MONTH.
Algorithm
STEP 1: START
STEP 2: Declare an array to store the names of the month, days, dates and calendar
respectively
STEP 3: Accept year, month and days
STEP 4: if leap year adjust the days of February
STEP 5: Find the day and month entered by the user to make the calendar
STEP 6: for i=0 to 4,
STEP 7: for j=0 to 6,
STEP 8: Enter the date in a[i,j]
STEP 9: if the date entered reached the number of days in a month, r=1 and goto
STEP 11 otherwise increase date by 1 and goto step 7 with j=j+1
STEP 10: if dates cannot be added further i=-1 and goto step 6 with i=i+1
STEP 11: Display the array a
STEP 12: END
79. ARUNAV RAY ISC COMPUTER PROJECT 78
Program: DISPLAY THE CALENDAR OF A MONTH
BY ACCEPTING THE FIRST DAY OF THE MONTH.
import java.util.*;
class Calendar_Print
{
static void main()
{
String
days[]={"SUNDAY","MONDAY","TUESDAY","WEDNESDAY","THURSDAY","FRID
AY","SATURDAY"};
String
months[]={"JANUARY","FEBRUARY","MARCH","APRIL","MAY","JUNE","JUL
Y","AUGUST","SEPTEMBER","OCTOBER","NOVEMBER","DECEMBER",};
int dates[]={31,28,31,30,31,30,31,31,30,31,30,31};
int a[][]= new int[5][7];
Scanner sc = new Scanner(System.in);
System.out.println("Enter the year,month and the first
day of the month");
int y=sc.nextInt();//accepting year
String m= sc.next(),d=sc.next();//accepting month and
1st day
if(y%4==0)//checking for leap year
dates[1]++;
int c=0,r=0,s=0,date=1;
for(int i=0;i<12;i++)
{
if(m.equalsIgnoreCase(months[i]))//finding the month
entered
s=i;
}
for(int i=0;i<7;i++)
{
if(d.equalsIgnoreCase(days[i]))//finding the day
entered
c=i;
}
for(int i=0;i<5;i++)
{
int p=0;
for(int j=c;j<7;j++)
{
a[i][j]=date;
if(date<dates[s])//finding if more dates to
enter
{
p++;
date++;
80. ARUNAV RAY ISC COMPUTER PROJECT 79
}
else//calender full
{ r++;
break;
}
}
c=0;
if(i==4 && p==7 && r==0)//if last row is reached but
more dates to display
i=-1;
if(r==1)//calender full
break;
}
//displaying calender
System.out.println("ttt"+m+" "+y);
for(int i=0;i<7;i++)
System.out.print(days[i]+" ");
System.out.println();
for(int i=0;i<5;i++)
{
for(int j=0;j<7;j++)
{
c=a[i][j];
if(c!=0)
System.out.print(" "+c+"t");
else
System.out.print(" t");
}
System.out.println();
}
}
}
81. ARUNAV RAY ISC COMPUTER PROJECT 80
Variable description:
Sl. no Variable Name Datatype Purpose
1 days String[] Store name of days
2 months String[] Store name of months
3 dates int[] Store number of days
4 a int[][] Store the calendar
5 y int Accept the year
6 m String Accept the month
7 d String Accepts the first day of the month
8 c,r,s,p int For calculation
9 date,i,j int Counter
Output: