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

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