CS-60: Question Paper - June 2010

BACHELOR IN COMPUTER APPLICATIONS

Term-End Examination

June, 2010

CS-60: FOUNDATION COURSE IN

MATHEMATICS IN COMPUTING

Time : 3 hours                                                               Maximum Marks : 75

Note: Question No. 1 is compulsory. Attempt any three questions from questions No. 2 to 6. Use of calculator is permitted.

1.      

(a)      Show that the function f (x) = 3x —1 ;                                 15x3=45

Is one-one and onto.

(b)     Tell for each whether the statement is true or false :

                                                          (i)      R, the set of Real Numbers, is closed under addition operation.

                                                       (ii)      In R, the operation of multiplication is not commutative

                                                     (iii)      The relation '>' of 'greater than in R is transitive.

(c)      The function:

Is one-one

(d)      Find

(e)      Evaluate

(f)       Prove that the points  and  are the vertices of an isosceles triangle.

(g)      Find the equation of a straight line which passes through the  points

(h)     Find the equation of a straight line which meets x-axis in (5,0) and y-axis in (0,-3).

(i)        Find the equation of the parabola whose focus is the point (3,4) and directrix is the straight line 2x-3y+5=0.

(j)        Find the equation of a circle with radius 5 units and centre as (2, -3).

(k)     Find the coordinates of the vertices and the foci and the length of the latus rectum of the hyperbola.

(l)        Solve the system of simultaneous equations:

 

(m)    If

Find  

(n)     Evaluate

(o)     Obtain

in the form of.

2.                  

(a)     Evaluate the integral                                                      3+4+3

(b)    Evaluate the integral

(c)     Find the area of the region bounded by the curve

 And lying above the x-axis.

3.                                                                                                                 4+3+3

(a)      Find the equation of the circle circumscribing the triangle with vertices

(b)      Find the equation of parabola with focus and directrix Find the equation of the axis.

(c)       Find the standard equation of the hyperbola with eccentricity

4.                                                                                                                4+3+3

(a)      Find the equation of the plane which is perpendicular to the plane and which is contains the line of intersection of the planes

(b)      Find the equation to the sphere through the circle

and the point .

(c)       Find the equation to the cone whose vertex is origin and which passes through the curve given by

5.                                                                                                                3+3+4

(a)       Prove that .

(b)       Solve the equation

(c)       Expand in terms of the cosines of multiples of.

6.                                                                                                                4+3+3

(a)       Find the maxima and minima of the following faction

(b)      Find the equations of the tangents and the normal to the following faction

(c)       Trace the curve.

Read More

CS-64: Introduction Computer Organisation June 2011 Question paper

BACHELOR IN COMPUTER APPLICATIONS

Term-End Examination

June, 2011

 CS-64: INTRODUCTION TO COMPUTER ORGANISATION 

Time : 3 Hours

Max. Marks : 75

---

Note : Question one is compulsory. Answer any three questions from the rest.

---

1. (a) List the basic key features of a von-Neuman machine. Also draw structure of von-Neuman machine.
(b) What is a combinational circuit? Draw a combinational circuit for Boolean expression

(c) Explain need of multiplexer. Also explain how a 4 X 1 multiplexer works.
(d) What is a bus? Explain the working of a shared bus system with an example.
(e) Explain the need of error detection and correction. What is a parity bit? How a parity bit can be used for the purpose of error detection?
(f) What is Addressing? List and explain any two addressing schemes with the help of an example of each.

2. (a) Simplify the following Boolean expression using K-Map

Also draw the logic circuit for the simplified Boolean expression.

(b) What is an interrupt? Explain U88 Of interrupt in assembly programming with an example.
(c) What is a hardwired control unit? Explain its advantages.

3. (a) Draw a combinational circuit for 3-bit odd parity generator. Also make truth table for it.
(b) What is random access memory (RAM)? Briefly explain working of RAM.
(c) Perform the following arithmetic operations on 8 bit numbers using 2's Complement notation. Indicate overflow/underflow, if any:
(i) 57–48
(ii) –82+41

4. (a) What are four types of segments in 8086 assembly programming ? Explain the use of ASSUME directive with an example.
(b) What are the four general purpose registers in 8086? Explain uses of each of them.
(c) What is redundant array of independent disk (RAID)? Explain three basic characteristics of RAID.

5. (a) Write an assembly program to add two 8 bit numbers.
(b) Differentiate between synchronous and asynchronous circuits. Also explain the need of a flip-flop in circuit design with the help of an example.
(c) Explain the following terms with the help of an example/ diagram/ illustrations, if needed.
(i) Assembler
(ii) Memory hierarchy.

Read More

CS-62: 'C' Programming & Data Structure June 2011 Question Paper

BACHELOR IN COMPUTER APPLICATIONS
Term-End Examination
June, 2011

CS-62: 'C' PROGRAMMING & DATA STRUCTURE

Time : 2 Hours

Max. Marks : 60

---

Note : Question number 1 is compulsory. Answer any three questions from the rest. All algorithms should be written nearer to 'C' language.

---

1. (a) What are Arrays? How are Two-dimensional arrays stored in memory? Write a program to multiply two 2-dimensional arrays.

(b) Write the algorithm for Binary search. Also apply this algorithm on the following data.
22, 44, 11, 88, 33, 55, 77, 66
Show all possible steps.

(c) Define the following terms using suitable examples.
(i) Degree of Tree
(ii) Height of Thee
(iii) Internal Node of a Tree
(iv) Strongly connected graph
(v) Adjacency Matrix

(d) Write an algorithm to convert any Infix expression to its corresponding Postfix notation. Using this algorithm convert the following expression to postfix:
(a + b) / (c – d)

2. (a) What is circular Linked List ? Write an algorithm to add a node at the end of a circular linked list.
(b) Write a program in ‘C’ to add a node to a queue.

3. (a). Define Inorder and Postorder traversals of a tree using suitable example. Construct a Binary tree using the following data.
INORDER: - BGDKHAEICJF
POSTORDER: - GKHDBEIJFCA

(b) ) What is a Heap? Define its types and properties using suitable examples.

4. (a) What is Heapsort? Apply heapsort on the given data.

Show the steps involved.

(b) Write a program in ‘C’ to count the number of Vowels present in a text file. Display the count of each vowel separately.

5. Write short notes on.
(a) Priority Queue
(b) Storage Pool
(c) Quick Sort
(d) Loops in ‘C’ programming
(e) BPS Algorithm

Read More

QUESTION PAPER » CS-06 DATA BASE MANAGEMENT SYSTEM Dec 1999

BACHELOR IN COMPUTER APPLICATIONS
Term-End Examination
December, 1999CS-06:DATABASE MANAGEMENT SYSTEM

Time : 3 Hours

Max. Marks : 75

---

Note : Question one is compulsory. Answer any three from the rest.

---

Q.1(a). Construct an E-R diagram for a car insurance company that has a set of customers, each of whom owns one or more cars. Each car has associated with it zero or any number of accidents.

(b)Consider the Relational database

Employee (empname, street, city)
Works (empname, companyname, salary)
Company (companyname, city)
Manages (empname, managerjname)
Give expressions in SQL for the following:

(i) Find the names of all employees who work for First Bank Corporation

(ii) Find all employees in the database who live in the same cities as the companies for which they work.

(iii) Find all employees in the database who earn more than every employee of small Bank Corporation.

(iv) Find the names, street address and cities of residence of all employees who work for First Bank Corporation and earn more $10000.

(v) Find all employees in the databases who live in the same cities and on the same street as do their managers.

(c) Define 2NF and 3NF. Produce 3NF table structures from the table below
Enrol No. Sname Dept. Year Block Name

1024 Mathews Physics 1 G
1126 John Chemistry 1 G
1016 Bill Mathematics 2 K
1420 James Botany 2 K
1503 Charles Geology 3 L
1001 Dickens Zoology 4 M

Second Normal Form (2NF)

Q.2(a). Is it possible in general to have two primary indices on the same relation for different search keys? Explain your answer.

(b)Explain the distinction between open and closed hashing. Discuss the relative merits of each technique in database applications.

Q3(a). Compare and contrast BCNF and 3NF. Show that if a relation scheme is BCNF, then it is also in

(b) List the three design goals of relational databases and explain why each desired

Q.4(a), Discuss the design issues related to distributed database through an example,

(b) Explain the trade offs in distributing the database

Q.5(a). What are the techniques available for the knowledge representation? Explain them briefly through an example.

(b) What is the difference between declarative and procedural knowledge?

Q.6(a). Describe various Relational operators that are used in Relational Algebra, perform Union, Difference, Intersection and Cartesian Product for the following relations.

(b)Write short notes on Client-Server approach.

Read More

Hall Ticket for Term-end Practical Examination, January 2009 (MCA/BCA/CIT Programmes)

Indira Gandhi National Open University (IGNOU) have announced January 2009 Term-End Practical Exam Hall Ticket. Student who did not receive the Hall Ticket in time, can Enter Nine Numerical Digit Enrolment Number into the following text box and can Downloaded, print their Online Practical Hall Ticket and produced along with valid IGNOU Identity Card at the Exam Centre.The batch allotted to you for each course is also mentioned. To know the batch timings and the address of the Examination Centre allotted to you, click here.

Enter Enrolment No for Delhi-1 Regional Center ::::::

Enter Enrolment No for Delhi-2 Regional Center ::::::

Enter Enrolment No for Pune Regional Center :::::::::

Read More

CIT, BCA and MCA Practical Date Sheet for Term-End Practical Examination June-2011

After the end of written examinations CIT, BCA and MCA etc. students are required to appear for their practical examination. Just like written examinations and assignment submission students need to successfully clear their practical examination to be eligible to get their degree. Therefore, IGNOU has announced CIT, BCA and MCA Practical Date Sheet for Term-End Practical Examination for June 2011. To download your Practical Date Sheet please click here >>>http://www.ignou.ac.in/upload/Announcement/bcamcadatesheet.doc

Read More

Secondary School Examination Board(Matric) 2011 - Annual Result

Secondary School Examination Board(Matric) 2011 - Annual Result
Roll Code
Roll Number
Note:- Please enter your five digit Roll Code & four digit Roll No in provided space above and press Enter Key to get your result.

Read More