All About Key-loggers You Must Know

What are this keyloggers? what should we do if your system got infected by keyloggers? Is it keyloggers are good things or bad things? How to remove keyloggers from your system? Is there any different kinds of keyloggers out there? why keyloggers invented? These are all questions in my mind about keyloggers i studied and did some research about keyloggers for a long time now iam...

Read more »

DISCRETE MATHEMATICAL STRUCTURES MCA 1.1.1

2005 Andhra University M.C.A DISCRETE MATHEMATICAL STRUCTURES :::: First Question is Compulsory                                                            Time: 3 Hrs.Max.Answer any four from the remaining                                                    Marks: 100Answer all parts of any Question at one place.  ...

Read more »

DIGITAL LOGIC AND COMPUTER SYSTEMS ORGANIZATION (JNTU) 1SEM

2010 MCA 1 SEM QUESTION PAPER(JNTUK REGULAR) Time: 3 Hours Max Marks: 60Answer any FIVE questions All questions carry EQUAL marks1. a) Represent the number (+ 46.5) as a floating point binary number with 24 bits. Thenormalized fraction mantissa has 16 bits and exponent has 8 bits.b) Simplify the Boolean function F together with the don’t care condition d in product ofsums formF (w,x,y,z) = (0,1,2,3,7,8,10)d (w,x,y,z) = (5,6,11,15)2. a) What is full adder ? Design a full adder circuit by constructing truth table.b) What is excitation table .Explain about JK flip flop with its excitation...

Read more »

C PROGRAMMING AND DATA STRUCTURES 1SEM

JAN 2010 MCA 1 SEM QUESTION PAPER(JNTUK-REGULAR)Time: 3 Hours Max Marks: 60Answer any FIVE questions All questions carry EQUAL marks1.a)Write the various steps involved in executing a C program and illustrate it with a help offlowchart.b)Explain various data types defined in C2 a) Describe various loops defined in Cb) How are initial values written in a one-dimensional array definition? Must the entirearray be initialized? What value is automatically assigned to those array elements notexplicitly initialized?3 a) Describe different types of user defined functionsb)Write a function which takes...

Read more »

DISCRETE MATHEMATICS & GRAPH THEORY 1sem

JAN 2010 MCA i SEM QUESTION PAPER(JNTUK-REG)Time: 3 Hours Max Marks: 60Answer any FIVE questions All questions carry EQUAL marks1. a) Find the conjunctive normal form and disjunctive normal forms fori) p (p¢Úq¢)ii) (pÚq¢)® qb) Determine the contra positive of the each statementi) If john is a poet, then he is poor.ii) Only if Marc studies well he pass the test2. a) Express the...

Read more »

ENGLISH LANGUAGE COMMUNICATION SKILLS 1sem

JAN 2010 MCA 1 SEM QUESTION PAPER(JNTUK-REGULAR)Time: 3 Hours Max Marks: 60Answer any FIVE questions All questions carry EQUAL marksI(a) correct the following sentences.i. Neither of the sisters are good at singing.ii. He ordered for three cups of coffee.iii. Look at the flock of bees around the hive.iv. Of all the children, Suma is closer to her father.(b) Write two sentences each making use of these patternsi. Subject + Verb + Complementii. Subject + Verb + I.O + D.O(c) Fill in the blanks with the correct verb formsi. Most snakes ________(lay) eggs, but the python ________(give) with to youngones.ii....

Read more »

ACCOUNTING AND FINANCIAL MANAGEMENT -I sem

JAN 2010 MCA I SEM QUESTION PAPERS(JNTUK-REGULAR)Time: 3 Hours Max Marks: 60Answer any Five Questions All questions carry EQUAL marks 1. What are the basic Accounting Concepts? Explain the debit and credit principles.2. Is it necessary to prepare the Trail Balance before preparing the Financial Statements?Why the trail balance will not agree? Explain the reasons.3. What is leverage ratio? How do you understand financial leverage through debt-equityratio?4. The credit purchase of a company is Rs. 2, 00,000. The amount payable to the creditorsat the beginning and end of the year is Rs.42, 500 and...

Read more »

PROBABILITY AND STATISTICAL APPLICATIONS

JAN 2010 MCA I-SEM QUESTION PAPERS(JNTUK-REGULAR)Time: 3 Hours Max Marks: 60Answer any FIVE questions All questions carry EQUAL marks1. (a) State and Prove the Bayes Theorem.(b) A and B enter into a bet according to which ‘A’ will get Rs.200 if it rains on that dayand will lose Rs.100 if it does not rain. The probability of raining on that day is 0.7.What is mathematical expectation...

Read more »

DISCRETE STRUCTURES AND GRAPH THEORY

JAN 2010-MCA I SEM QUESTION PAPER(JNTUK)Time: 3 Hours Max Marks: 60Answer any FIVE questions All questions carry EQUAL marks1. a) Find the conjunctive normal form and disjunctive normal forms fori) p (p¢Úq¢)ii) (pÚq¢)® qb) Determine the contra positive of the each statementi) If john is a poet, then he is poor.ii) Only if Marc studies well he pass the test2. a) Express the following statements using quantifiers. Then construct thenegation of the statementi) Every bird can flyii) Some birds can talkb) Prove that if n is an integer and n3+5 is odd then n is even.3. Let R be a binary relation on...

Read more »

DIGITAL LOGIC AND COMPUTER SYSTEMS ORGANIZATION

JAN 2010-JNTUK-MCA I SEMESTER QUESTION PAPERTime: 3 Hours Max Marks: 60Answer any FIVE questions All questions carry EQUAL marks1. a) Briefly discuss about Error detecting and Error correcting codes.b) Compare Veitch Karnaugh Map method and four variable Karnaugh mapmethod.2. a) Briefly discuss Open drain and Tri state gates.b) Explain synthesis of binary counters.3. a) Explain about floating point division.b) Explain about combinatorial circuit for multiplication.4. a) Explain in detail about instruction set and instruction format.b) Explain different addressing modes.5. a) Explain the format...

Read more »

PROBABILITY, STATISTICS & QUEUEING THEORY MCA 1.1.4

2004-05  PROBABILITY, STATISTICS & QUEUEING THEORYFirst Question is CompulsoryAnswer any four from the remainingAnswer all parts of any Question at one place.Time: 3 Hrs.Max. Marks: 100a) State the axioms of probability.b) Explain confident intervals in estimation.c) Explain the method of least squares.d) Explain Principle of least square.e) Explain Type I and II errors.2. a) State and prove Baye’s formula on conditional probability.b) We are given three urns as follows:Urn A contains 3 red and 5 white marblesUrn B contains 2 red and 1 white marbleUrn C contains 2 red and 2 white marbles.An...

Read more »

PROBLEM SOLVING AND PROGRAMMING USING C-MCA 1.1.3

2008 Andhra University M.C.A PROBLEM SOLVING AND PROGRAMMING UNING ‘C’ (Effective from the admitted batch of 2004 – 2005).Time: 3 Hrs. Max. Marks: 1001. Explain the following brieflya) Efficiency of algorithmsb) Program testingc) Rules for defining variablesD) Scanfe) go to statementf) break statementg) pointer in arraysh) Recursioni) malloc ()j) Hash searching2. a) Develop an algorithm to compute the sum of the first n terms ofthe seriesS = 1 - 3 + 5 - 7 + 9 .......................Describe all intermediate stepsb) Design an algorithm that reads in a set of n single digits andconverts them...

Read more »