JAVA Programs

Q. WAP to find area of Circle.

import java.io.*;
import java.lang.*;
class CircleDemo
{
public static void main(String arg[])
{
double r,ar;
DataInputStream br=new DataInputStream(System.in);
try
{
System.out.print("Enter radius : ");
r=Integer.parseInt(br.readLine());
ar=3.14*r*r;
System.out.println("Area of Circle : "+ar);
}
catch(Exception ex)
{}
}
}

_________________________________________________________________________________

Q.WAP to find roots of Quadratic equations.


import java.io.*;
import java.lang.*;
class Quad
{
public static void main(String arg[])
{
double x,b,a,c,y,d;
DataInputStream br=new DataInputStream(System.in);
try
{
System.out.print("Enter b :");
b=Double.parseDouble(br.readLine());
System.out.print("Enter a :");
a=Double.parseDouble(br.readLine());
System.out.print("Enter c :");
c=Double.parseDouble(br.readLine());
d=(b*b-4*a*c);
if(d==0)
{
System.out.println("Determinant is Zero");
x=-(b+(Math.sqrt(d)));
System.out.println("Only 1 real root possible : "+x);
}
else if(d<0)
{
System.out.println("Determinant is negative");
System.out.println("No real root Possible");
}
else if(d>0)
{
System.out.println("Determinant is Positive");
x=-(b+(Math.sqrt(d)));
y=-(b-(Math.sqrt(d)));
System.out.println("Two real root are possible : "+x+" and "+y);

}
}
catch(Exception ex)
{}
}
}

_________________________________________________________________________________

Q.WAP to find area of non-equilateral triangle.


import java.io.*;
import java.lang.*;
class TriangleDemo
{
public static void main(String arg[])
{
int s,a,b,c;
double t;
DataInputStream br=new DataInputStream(System.in);
try
{
System.out.println("Enter 3 sides of triangle : ");
a=Integer.parseInt(br.readLine());
b=Integer.parseInt(br.readLine());
c=Integer.parseInt(br.readLine());
s=(a+b+c)/2;
t=Math.sqrt((s*(s-a)*(s-b)*(s-c)));
System.out.println("Area="+t);
}
catch(Exception ex)
{}
}
}

_________________________________________________________________________________

Q.WAP to calculate Simple Interest.

import java.io.*;

import java.lang.*;

class SiDemo

{

public static void main(String arg[])

{

double p,r,t,si;

DataInputStream br=new DataInputStream(System.in);

try

{

System.out.print("Enter Principle: ");

p=Double.parseDouble(br.readLine());

System.out.print("Enter Rate: ");

r=Integer.parseInt(br.readLine());

System.out.print("Enter Time: ");

t=Integer.parseInt(br.readLine());

si=(p*r*t)/100;

System.out.println("Simple Interest : "+si);

}

catch(Exception ex)

{}

}

}

About MCA Entrance

Syllabus for JNU MCA Test
Mathematics

• Calculus and analytical geometry
• Differential equations
• Numerical analysis
• Modern Algebra and Matrix Theory
• Real series analysis
• Statistics and probability
• Theory of Equation
• Trigonometry etc.

General aptitude

• Current affairs
• General Science
• History of India etc.

Computer science

• Venn diagrams
• Truth tables
• Structure of instructions in CPU
• Representation of characters
• Organization of a computer
• Integers and fractions
• Input/output devices
• Fundamentals of Computer
• Floating point representation of numbers
• Data structures
• Computer Organisation
• Computer memory
• Central Processing Unit (CPU)
• C Language
• Boolean algebra
• Binary arithmetic

Read more here: http://entrance-exam.net/jnu-2009-mca/#ixzz1dy4w8DhQ

JNU MCA Entrance Exam Syllabus
The questions in the entrance examination for admission to the MCA programme may cover the following areas of study as well as their applications:

• Trigonometry
• Modern Algebra and Matrix Theory
• Theory of Equation
• Calculus and Analytical Geometry
• Real Analysis
• Differential Equations
• Statistics & Probability
• Elementary Numerical Analysis
• Logical Ability
• Fundamentals of Computer
• Elements of Data Structures
• Computer Organisation
• C Language

Jamia Hamdard University MCA Entrance Exam Syllabus
The admission to MCA programme will be on the basis of the merit determined by the performance of the candidates in the written Entrance Test only. The Entrance Test Paper will be based on questions from subjects of BCA of Jamia Hamdard.Syllabus of BCA is given below:

• Mathematics

Differentiation and partial differentiation, derivative of sum, dot product and cross product of two vectors, gradient, divergence and curl;. System of circles, standard equations and properties of parabola and Ellipse; General equation of second degree in two variables, tracing of conic sections, sphere; Successive differentiation, Libneitz theorem, partial differentiation, curvature, asymptotes, singular points, concavity, points of inflexion and tracing of Cartesian curves; Differential equation of first order; Matrix Algebra including rank, inverse, linear system of equations, Eigen value & Caley Hamilton Theorem; team working and management.Sets and related operations, Relations and their properties, matrix of relations, functions and its properties, Introduction to graph theory, Significance of graph theory for computer science, matrix representation of graphs, Path Matrix, Shortest path algorithm, Introduction to recurrence relation, Formulation of recurrence relations, Characteristic equation and Characteristic roots of recurrence relation, Solution of recurrence relations, Introduction to prepositional calculus, logical operations, Truth tables of logical identities, Equivalence of logical identities, Introduction to Boolean Algebra.Numerical methods versus numerical analysis, Errors and Measure of Errors.Non-linear Equations, Iterative solutions, multiple rocks and other difficulties, interpolation methods of BI-section, false position methods, Newton Raphson-Methods. Simultaneous Solutions of Equations, Gases Elimination Methods Gaues Jordan methods Gaues seedily methods. Interpolation and curve fitting, Lagrangian polynomials, Newton’s methods: Forward Difference methods, Backward Difference methods Divided difference methods. Numerical Integration and Different Trapezoidal Rule, Simpson 1/3 Rule Simpson’s 3/8 Rule. Numerical differentiation by polynomial Fit.

• Statistical Techniques

Measure of Central Tendency, Preparing frequency distribution table, Mean Arithmetic mean harmonic, mean medial mode. Measure of dispersion, skewness and kurtosis Ranges, Mean deviation. Standard deviation, co-efficiency of variation, Moments skew ness kurtosis. Correlation. Regression linear; Regression. Least square fit liner trend, Non-linear trend.

• Introduction to Computer and IT

Computer Organisation: Block Diagram, Basic Architecture etc. Evolution and Different Types of Computer and then Characterizing features; Functional unit of computers, primary and secondary memory. Number System: Decimal, octal, binary and hexadecimal.Representation of Integers, fixed and floating point, character representation schemeIntroduction to operating system: DOS & Windows Elements of IT: Introduction to Range of Info Technologies; Audio, video, multimedia, Internet and Intranets.Introduction to Intelligent systems. Expert systems, Virtual Reality System Development life cycles : Waterfall methods, prototyping, JAD, RAD, etc.

• Programming in C

Programming Fundamentals, algorithm development, techniques of problem solving, flowcharting, stepwise refinement; Programming in C including features of ‘C’, C tokens, data type, operators, expressions, Branching Constructs: if-else, switch, conditional operator & goto statements; Looping Constructs: while, do-while, for and Jumping statements; Arrays, string processing, Functions: categories of functions, recursion; Pointers: operations on pointers, pointers & structures; Structures and Unions; File Management: Defining & opening a file, closing a file, input/output operations. Development of efficient programs; Debugging, verification and testing of programs.

• Organizational Behavior

Psychological dimensions and relevance in the emerging society; Learning : styles and principles; Skinner, Thorndike and Piaget theories; Conditions of learning; Organizational behavior: essential attributes; Memory: short term and long term; Efficient and effective ways in respect of thinking, problem solving and decision making ; Stress management; models of personality, factors and desirable features of a healthy personality; Basic Needs and their hierarchy: Mallow model and self actualizing personalities.

• Communication Skills

Review of English Grammar; Written and Spoken Language; Common Errors in language; Punctuation (purpose, role, importance and use); Effective use of dictionary, thesaurus, encyclopedia, OED; Figures of speech; Language Skills (Listening, Speaking, Reading, Writing); Meaning what you mean; Listening: Effective and efficient listening in various situations (discussions, lectures, news, seminars, speech, telephone calls etc.);Speaking: Phonetics, intonation, accent, usage; strategies for a good rhetoric; Reading: Purpose; Comprehension; Tactics and strategies for good reading; Writing: Guidelines for good writing; various writing styles (General and Technical writing styles);Communication (purpose, role, importance, elements); Effective and efficient communication; Role of content, context and language; Spoken and written communication; Presentation and delivery; Role of speaker and audience; Style and body language; Planning, organization, presentation, participation, conduction and feedback of discussions, meetings, seminars etc; Effective and efficient presentation and discussion skills; Discussion and Presentation skills of conferences, meetings, seminars etc; General and Technical documents (correspondence (applications, letters, resumes, CV), drafts, essays, memos; minutes; notes, proposals, precis, reports, summary, synopsis,), appendices, references, table of contents, acknowledgements, prologue, epilogue, revision; Use of Audio-Visual Aids: OHP, Slides, Charts, Computers etc.

• Introduction to Data Structures

Representation of data , Data Types, ADT and Data Structures, Arrays : single and multidimensional arrays , Structures , Static and Dynamic implementations of data structures, Stacks and it’s applications ,infix, prefix and postfix notations and conversions ,Recursion, queues other general lists and applications; Linked Lists: dynamic memory allocation & pointers, linked stacks & queues. Trees : Binary Trees, Tree search ,tree traversals , threaded binary tree, Height Balancing- AVL trees; graphs – BFS and DFS ; B-trees, b+ trees , searching and sorting techniques and their analysis of algorithms , searching : linear search, binary search, tree search. Sorting : bubble sort, quick sort, insertion sort, heap sort, shell sort , merge sort and radix sort .

• Computer Organization

Number System, complements, binary arithmetic, and logic gates. Boolean functions. Dual of a Boolean function. Inverse of a Boolean function. Boolean function representation: canonical form, standard form. Boolean function Simplification: Algebraic method, Karnaugh Map method. Boolean function implementation: NAND implementation, NOR implementation. Binary codes: BCD, EBCDIC, ASCII, Excess-3, gray code. Combinational circuits: adder, subtractor, decoder, and encoder, MUX/DEMUX etc. Sequential circuits: Flip-flops, registers and Counters.

• Business Data Processing and File Systems

Data Processing: Concept, relevance and cycle; Organisation and attributes of business data processing; Computing environments; Programming methodologies: structured, object oriented etc.; Programming Principles: style, coding, testing and refinements; Input and output devices: an overview; Business Systems; Business computing: characteristics, significance and distinguishing features; Physical storage devise and their characteristics, File : fields, records, fixed and variable length records, primary and secondary keys; File operations, Basic file system operations; File organisations: Sequential, indexed Sequential, Direct, relative etc; Data processing using COBOL/FoxPro , Introduction to database design.

• Computer Based Financial Accounting and Management

Conceptual Framework, Nature and Scope of accounting information; Identifying and recording accounting transactions using traditional and accounting equations approach; Generally accepted accounting principles; Accounting standards in India; Bases of accounting-cash and accrual; Capital and revenue items. Fundamentals of computerized accounting system: concept of grouping the accounting heads; Schemes of assigning the codes to accounting heads, maintaining the hierarchy of ledger accounts for preparing control accounts; Case Study and use of a software tool.

• Fundamental Concepts of Operating Systems

Operating systems overview: Computer System Structure, operating systems structure, OS functions, facilities; Processes: introduction, concurrency, inter process communication, classical problems, process scheduling, Memory management: swapping, virtual memory, segmentation. File systems: files, directories, file system implementation, security, and protection mechanism. Input / output: principles of input / output hardware and software, disks, clocks, terminals. Deadlocks: introduction, detection, recovery, and prevention; Coordinated Case Study of Unix and Windows.

• Introduction to Object Oriented Programming using C++

OOP : Programming methodologies: concepts of structured and object oriented programming; advantage of OOP methodologies, characteristics of OOP languages: objects, classes, Data Abstraction , Encapsulation ,inheritance, reusability, polymorphism and operator overloading, function overloading;Programming in C++ :data types, constants, expressions and statements, Arrays Strings, function overloading, functions, friend functions , in line functions constructors and destructors, derived classes, friend classes , operator overloading , support for data abstraction, derived class, base class, pointers and arrays, pointers and functions, support for OOP.

• System Programming concepts & Compiler Design

Mathematical preliminaries, sets, relations and functions, graphs and trees, strings, theory of automata, DFA, NFA, acceptability of a string by finite automata, minimization of finite automata, applications of finite automata –lexical analysis, text editors etc. Introduction to formal languages- regular grammars , context free grammar, context sensitive grammar. Evolution of the Components of a Programming System,compilers, Assemblers, Loaders Absolute loader, relocating loader,Direct linkage loader, Linkers,Macros, Variety of software tools, Text editors, Interpreters and program generators Debug Monitor. Compilers : Basic concepts, compilers and interpreters, pass of a compilers, phases-lexical phase, syntax phase, semantic analysis phase, parser, top down, bottom up parsing, translation schemes, type analysis and type checking, code generation phase and optimization. Symbol table management, error handling.

• Systems Analysis and Design

System : definition and concept; Real time and distributed systems; Data information and related attributes; System analysis and analyst; System development life cycle: study, analysis, design, development and implementation; System planning; data & fact finding techniques; System design and modeling: logical and physical design representation, data flow diagram, ERD, structure charts; forms design : classification, user interface; standards; control and validation checks; user interface guidelines modular and structured design; System implementation & maintenance; Project management techniques; use of an available tool to implement a case study.

• Software Engineering , testing and Quality Assurance

Introduction to S/W engineering; software product and process: Generic Phases, software development models; Project Scheduling and Tracking; Software architecture and design: prominent design methodologies; Verification, validation and performance evaluation;; SW Configuration Management and maintenance; SW measurement-Size, Process and Project Metrics; LOC , FP metrics; Testing and the related concepts : Testability and features of Test Cases; Software Testing techniques: WBT,BBT, Software Testing Strategies: Approach, Issues; integration, System, alpha , Beta testing etc; Quality Factors, framework , Quality assurance: concepts, Activities ect. . SW Reliability, SQA Plan, Quality models: ISO 9000 and SEI-CMM and their relevance. Functions of CASE tools and their use with practical examples of special CASE tools, such as Turbo Analyst.

• Introduction to DBMS and Oracle

Concept of Database and its evaluation, Data abstraction and data integration; the three level architecture of a DBMS, components of a DBMS; Data models and their implementations : relational. Network, Hierarchical; Relational data manipulations : relational algebra, relational calculus, SQL; Relational database design: functional dependencies, finding keys, 1st to 3rd Normal Forms, BCNF, lossless join and Dependency preserving decomposition, computing closures of set FD’s, finding keys. Introduction to Oracle – Data types, SQL *PLUS, PL/SQL: Function, Procedure, Cursor, Exceptions, Triggers etc.

• Management Information System

Introduction to the concept of Decision Support system: Component of DSS ialogue management; data management and Model management for DSS ;example of different types of DSS ;system Analysis & Design for DSS ;Model in the context of DSS ;Algorithm & Heuristics; DSS application in different functions ;Design for interfaces in DSS, An overview of DSS generators, Group discussion in Support system ( GDSS) . And decision conferencing. Introduction of Expert System . Expert system in management; case study on expert system. introduction to GIS ;MIS based on GIS; case studies ;Executive Information system( EIS).

• Introduction to Unix and Windows NT

Introduction to UNIX, UNIX files and directories Commonly used commands in UNIX pipes and processes editor, basic shell programming awk utility UNIX file system. WIN NT: The windows NT environment installing window NT file system disk partitions and fault tolerance setting up and administering user and group accounts, securing resources running applications configuring the windows NT environment, Windows NT services, printing from Windows NT, trouble shooting Windows NT.

• Data Communication & Computers Networks

Data Communication System: Purpose, Components : Source, transmitter, transmission System, receiver, and destination. Data transmission: Frequency, Spectrum and Bandwidth. Time-domain and frequency dominion Concepts. Relationship between data-rate and Bandwidth. Analog and digital data transmission. Data and signal. Analog and digital Signaling of analog and digital data. Modem, Modulation techniques,CODEC, Digital Transmitter etc. Transmission impairments : Attenuation and attenuation distortion, delay distortion, noise. Introduction to Network, OSI reference model, TCP/IP reference model. Transmission Media: Magnetic Media, Twisted-Pair cables, Baseband & Broadband Coaxial cables, Fiber Optics.Wireless Transmission: Radio Transmission, Microwave Transmission.ISDN; ATM; Data Link Layer: Services, Framing, Error Control, Error-detecting & Correcting Codes.Data Link Protocols: Stop-and-Wait Protocol, Sliding Window Protocol.HDLC; Static & Dynamic Channel allocation in LANs & MANs.Multiple Access Protocols: ALOHA, CSMA/CD; IEEE standards 802.3 and Ethernet, 802.4: Token Bus; 802.5: TokenRing. Bridges, Routers, Gateways, Routing Algos, Congestion control Algos, Internetworking, The TCP/IP Protocol, IP Addressing, Subnets.

• Computer Graphics

Basics of Graphics Systems Applications, Display Devices : Video Displays, Raster-Scan Displays, Rondom Scan Displays, DVST, Flat-panel Displays. Input devices : Keyboards, Mouse, Trackball and Spaceball, Joysticks, Digitizers, Image Scanner, Touch panel, light pens, Voice Systems etc. Line drawing algorithms: DDA Algorithm, Bresenham’s line Algorithm.Bresenham’s Circle drawing algorithm, Mid-Point Circle Algorithm, Scan-line Polygen Fill Algorithm, Inside-Outside test, Boundery Fill algorithm, Flood-Fill algorithm. Pixel, Pixel addressing, Antialiasing.Clipping : Cehen-Sutharland line clipping algorithm, Line clipping using nonrectangular clip windows, Polygon clipping. Text clipping. Two-dimensional geometric transformation : Translation, Rotation, Scaling, Reflection, Shear, Matrix representation and Homogeneous coordinates.Composite transformation: Translations, Rotations, Scalings.General Pivot-Point Rotation and Scaling

• Visual Language Programming

Generic Concept of procedure & event oriented languages; Low and high level visual languages; Visual architecture: methods, statements and properties; Basic concepts of visual program design and comparison with non-visuals; Visual programming environment and development of visual programs: project window, forms, code, properties & event procedures; Program design including case solution, run time properties; Programming using Visual Basic/VC++; implementation of a case study.

• Internet Technology and Applications & e-commerce

Introduction of Internet, understanding the Internet, A tower of the Internet Hardware requirement to connect to the Internet, S/W requirement and Internet service products Internet Addressing Mall using mail from shell account understanding the web, using the web, Introduction to usenet file types used on the Internet Mailing list Telnet Talk facts: using talk from a shell a/c IRC Basics of TCP/IP, Introduction to Internet Programming with JAVA/Perl: creating applets, applications, security.Introduction to E-Business, Electronic Fund Transfer (EFT), Value-chain, internet Business strategy, Functional Architecture, implementation Strategies; Building Blocks of E-commerce, System design, creating and managing content etc; Cryptography and security management; Payment systems; Auxiliary system; transaction Processing; Building e-commerce system, system architecture, secure links etc;Present and future Trend; Impact of e-commerce; A case Study on development of e-commerce system.

• Object Oriented Methodology and UML

Object modelling bject and classes ;links and association, generalisation and inheritance; Grouping construct, Aggregation, generalisation as extension and restriction .Multiple inheritance; Meta data, candidate Keys .Dynamic Modelling :Events and states nesting Concurrency .Functional modelling : Analysis bject modelling ,functional modelling adding operations, Iteration; System design : Subsystem , concurrency .Allocation to Processors and tasks. Management of data stores. Control implementation. Boundary condition. Architectural Framework . object design ptimization , Implementation of control . Adjustment of inheritance. Design of associations, Documentation ,Comparison of methodologies.; Implementation : Using a programming language , a data base system . Programming styles , reusability , extensibility , robustness . programming –in – the- large , case study; Overview of UML: Terminology, Methology; Application of UML with a system example.

• Network Programming

Inter Process Communication: Pipes, FIFOs, message queues, Semaphores. Communication protocols: TCP/IP, XNS, SNA, NetBIOS, UUCP. Berkley Sockets. System V Transport Layer Interface. Security. Winsock programming using the Windows sockets and blocking I/O. Other Windows Extensions. Network dependent DLLs. Sending and receiving data over connections. Terminations; Novel IPX/SPX: Novel’s windows driver. Network interface for windows. IPX/SPX procedure. Datagram Communication. Connection oriented communication with SPX. IPX/SPX implementation of DLLs. Programming application: Time and Date routines. Ping, Trivial File Transfer Protocol, Remote Login, RPC.

• Advance DBMS

Review of database management systems; Design and knowledge database; Review of different database models; Concept of data bases and storage structures ;Query Optimization , Integrity of databases : need for concurrency control, locking, deadlock avoidance etc. database recovery; Coding: representation of knowledge, classification and compression; Object relational databases, Object oriented databases, Distributed databases: advantages, techniques and related concepts ; Management of Distributed transactions, Heterogeneous Database, Client server Databases technologies ,temporal and spatial databases , Internet databases . Case Study – ORACLE as RDBMS, ORDBMS, OODBMS capabilities.

• Parallel Processing

Concept of parallelism, Mechanism for uniprocessor systems; Parallel computer architecture; Pipelining and vector processing; Instruction and arithmetic pipelining; parallel algorithms for array processors; SIMD computers and performance enhancements; Microprocessor Architecture and Programming: Functional Structure, interconnection networks, multiprocessors; Parallel Algorithms for multiprocessors; Data driven computing and languages.

• Artificial Intelligence

Scope of AI : Games ,the ROM proving ,natural language processing , vision and speech processing , robotics expert system, AI technique search knowledge, abstraction ;Problem Solving : State space search : production system. Search space control: depth first ,breadth first search, heuristic search –hill climbing ,best first search , branch and bound . Minimax search , Alpha –Beta cut offs. Solemnizing queries , Unification .Modus pones . Resolution , dependency directed backtracking, forward reasoning : Conflict resolution, Logic Programming in PROLOG.

Syllabus for Orrisa MCA :

• MATHEMATICS

1. Logic: Statement, Negation, Implication, Converse, Contra positives, Conjuction, Disjunction, Truth Table.
2. Algebra of Sets: Set operations, Union, Intersection, Difference, Symmetric Difference, Complement, Venn Diagram, Cartesian products of sets, Relation and Function, Composite Function, Inverse of a Function , Equivalence Relation, Kinds of Function.
3. Number Systems: Real numbers (algebraic and other properties, rational and irrational numbers), Complex numbers, Algebra of complex numbers, Conjugate and square root of a complex number, cube roots of unity, De-Moivre’s Theorem with simple application. Permutation and combinations and their simple applications, Mathematical induction, Binomial Theorem. Determinants upto third order, Minors and Cofactors, Properties of determinants. Matrices upto third order, Types of Matrices. Algebra of matrices, Adjoint and Inverse of a matrix. Application of determinants and matrices to the solution of linear equations (in three unknowns).
4. Trigonometry: Compound angles, multiple and Sub-multiple angles, solution of trigonometric equations, Properties of triangles, Inverse circular function.
5. Co-ordinate Geometry of Two Dimensions: Straight lines, Pairs of straight lines, Circles, Equations of tangents and normals to a circle. Equations of Parabola, Ellipse and Hyperbola, Ellipse and hyperbola in simple forms and their tangents (Focus, directix, eccentricity and latus rectum in all cases).
6. Co-ordinate Geometry of Three Dimensions: Distance and division formulae, Direction cosines and direction ratios. Projections, Angles between two planes, Angle between a line and a plane, Distance of a point from a line and plane. Equations of a sphere-general equation.
7. Vectors: Fundamentals, Dot and Cross product of two vectors, Scalar triple product, Simple Applications (to geometry, work and moment).
8. Differential Calculus: (Concept of limit, Continuity, Derivation of standard functions, successive differentiation (simple cases, Leibnitz Theorem, Partial differentiation (Simple cases, derivatives as rate measure, Maxima and minima indeterminate forms, Geometrical applications such as tangents and normals to plane curves.
9. Probability and Statistics: Averages (Mean, Median and Mode), Dispersion (standard deviation and variance). Definition of probability, Mutually exclusive events. Independent events, Addition theorem.
10. Intergal Calculus: Standard methods of integration (substitution, by parts, by partial fractions etc.). Definite integrals and properties of Definite Integrals, Areas under plane curves, Differential Equations ( only simple cases.).

I. dy/dx = f (x)

II. dy/dx = f (x) .g(y)

III. d2y/dx2= f (x) and applications to motions in a straight line with constant acceleration.

• COMPUTER AWARENESS

1. Introduction to Computer: Brief history of Computers, Components of a Computer, Computer related general knowledge, Application of Computers, Classification of Computers, Simple DOS Commands.
2. Computer Arithmetic: Number System with general base, Number base conversion, Elementary arithmetic operation.
3. Basic Language Programming: Flow Charts, Algorithms, Constants, Variables, Arithmetic and logical expression, Elementary BASIC statements, Writing simple programs (using sequence, repetition and control structures), subscripted Variables, Matrix operations Function and Subroutines, Concept of Files.

Presentation:-webtecnologys

Web-Technology

Parity checking

Parity checking

  

In communications, parity checking refers to the use of parity bits to check that data has been transmitted accurately. The parity bit is added to every data unit (typically seven or eight bits ) that are transmitted. The parity bit for each unit is set so that all bytes have either an odd number or an even number of set bits.

Assume, for example, that two devices are communicating with even parity (the most common form of parity checking). As the transmitting device sends data, it counts the number of set bits in each group of seven bits. If the number of set bits is even, it sets the parity bit to 0; if the number of set bits is odd, it sets the parity bit to 1. In this way, every byte has an even number of set bits. On the receiving side, the device checks each byte to make sure that it has an even number of set bits. If it finds an odd number of set bits, the receiver knows there was an error during transmission.

The sender and receiver must both agree to use parity checking and to agree on whether parity is to be odd or even. If the two sides are not configured with the same parity sense, communication will be impossible.

Parity checking is the most basic form of error detection in communications. Although it detects many errors, it is not foolproof, because it cannot detect situations in which an even number of bits in the same data unit are changed due to electrical noise. There are many other more sophisticated protocols for ensuring transmission accuracy, such as MNP and CCITT V.42.

Parity checking is used not only in communications but also to test memory storage devices. Many PCs, for example, perform a parity check on memory every time a byte of data is read.

parity

In computers, parity (from the Latin paritas: equal or equivalent) refers to a technique of checking whether data has been lost or written over when it's moved from one place in storage to another or when transmitted between computers.

Here's how it works: An additional binary digit, the parity bit, is added to a group of bits that are moved together. This bit is used only for the purpose of identifying whether the bits being moved arrived successfully. Before the bits are sent, they are counted and if the total number of data bits is even, the parity bit is set to one so that the total number of bits transmitted will form an odd number. If the total number of data bits is already an odd number, the parity bit remains or is set to 0. At the receiving end, each group of incoming bits is checked to see if the group totals to an odd number. If the total is even, a transmission error has occurred and either the transmission is retried or the system halts and an error message is sent to the user.

The description above describes how parity checking works within a computer. Specifically, the Peripheral Component Interconnect bus and the I/O bus controller use the odd parity method of error checking. Parity bit checking is not an infallible error-checking method since it's possible that two bits could be in error in a transmission, offsetting each other. For transmissions within a personal computer, this possibility is considered extremely remote. In some large computer systems where data integrity is seen as extremely important, three bits are allocated for parity checking.

Parity checking is also used in communication between modems. Here, parity checking can be selected to be even (a successful transmission will form an even number) or odd. Users may also select no parity , meaning that the modems will not transmit or check a parity bit. When no parity is selected (or defaulted), it's assumed that there are other forms of checking that will detect any errors in transmission. No parity also usually means that the parity bit can be used for data, speeding up transmission. In modem-to-modem communication, the type of parity is coordinated by the sending and receiving modems before the transmission takes place.

Intoduction to OOPS

OOPS stands for Object Oriented Programming. it is is a programming paradigm that uses "objects" and their interactions to design applications and computer programs. Programming techniques may include features such as information hiding, data abstraction, encapsulation, modularity, polymorphism, and inheritance. Many modern programming languages now support OOP.

In Object Oriented Programming both the data type of a data structure and the types of operations (functions) that can be applied to the data structure are defined . In this way, the data structure becomes an object that includes both data and functions. In addition, programmers can create relationships between one object and another

One of the principal advantages of object-oriented programming techniques over procedural programming techniques is that they enable programmers to create modules that do not need to be changed when a new type of object is added. A programmer can simply create a new object that inherits many of its features from existing objects. This makes object-oriented programs easier to modify.

Inheritance, Abstraction, Polymorphism, Event Handling and Encapsulation are thesignificant concepts within object-oriented programming languages and are explained in this online tutorial describing the functionality of each concept in detail.

OOPS Concepts

Object-oriented programming (OOP) is a computer science term used to characterize a programming language that began development in the 1960’s. The term ‘object-oriented programming’ was originally coined by Xerox PARC to designate a computer application that describes the methodology of using objects as the foundation for computation. By the 1980’s, OOP rose to prominence as the programming language of choice, exemplified by the success of C++. Currently, OOPs such as Java, J2EE, C++, C#, Visual Basic.NET, Python and JavaScript are popular OOP programming languages that any career-oriented Software Engineer or developer should be familiar with.

OOP is widely accepted as being far more flexible than other computer programming languages. OOPs use three basic concepts as the fundamentals for the programming language: classes, objects and methods. Additionally, Inheritance, Abstraction, Polymorphism, Event Handling and Encapsulation are also significant concepts within object-oriented programming languages that are explained in online tutorials describing the functionality of each concept in detail.

High-end jobs with well-paid salaries are offered around the world for experts in software development using object-oriented programming languages. The OOPs concepts described and explained in easy to use, step-by-step, practical tutorials will familiarize you with all aspects of OOPs.