Showing posts with label IV SEMESTER. Show all posts
Showing posts with label IV SEMESTER. Show all posts

Oct 27, 2012

Download CS-66 (Multimedia) Solved Previous Question Paper

Dear all IGNOU BCA student now its time to get revised all you studied yet and go for crash course to get fast prepare for TTE exam held in Dec 2012.
Here Download CS -66 Multimedia solved question paper of previous session from Dec 2008 to June 2012.

Mar 25, 2012

Download IGNOU BCA CS 67 RDBMS Lab Solved Assignment 2012

Fourth semester students of IGNOU BCA(IV) course can now download CS 67 RDBMS Lab Solved Assignment of 2012 session. Many students commented here that they wanted CS-67 solved assignment like

Mar 23, 2012

Download IGNOU BCA CS 64 Solved Assignment 2012


Dear students of IGNOU BCA 4th semester, you can now download CS-64: "Introduction to Computer Organisation" solved assignment of 2012. Thanks to Swami Vardhan to solve assignment for IGNOU BCA and MCA.

Mar 19, 2012

Download BCA (4th sem) CS 06 Solved Assignment 2012

Download IGNOU BCA 4th semester solved assignment of CS 06: Introduction to Database Management System. Thanks to Swami Vardhan for solving this assignment.



Course Code : CS – 06

Course Name : Introduction to Database Management System

Assignment No : BCA (4) – 06/Assignment 2012

Maximum Marks : 100

Last Date of Submission : 30th April, 2012/ 30th October, 2012




Dwonload CS 65 solved assignment of 2012

Download CS-65: Windows Programming solved assignment of 2012. Thanks to Swami Vardhan for solving this assignment. You can download other subjects solved assignment here too.



Course Code : CS-65

Course Title : Windows Programming

Assignment Number : BCA (4)-65/Assignment/2012

Maximum Marks : 25

Last Date of Submission : 30th April, 2012/ 30th October, 2012




Mar 7, 2012

Download IGNOU BCA solved assignment 2012

Dear IGNOU BCA students

You can now download IGNOU BCA solved assignment of 2012 session. Below is the table of solved assignment that are available to download free of cost. Many subjects are still not solved, they will be posted here soon, therefore press Ctrl+D to bookmark this page and keep visiting for latest solved assignments of IGNOU BCA course.

Feb 28, 2012

Download IGNOU BCA Assignment 2012


Download All semester BCA Assignment Question 2012



BCA
I Semester         
(.PDF/.DOC)
II Semester
(.PDF/.DOC)
III Semester
(.PDF/.DOC)
IV Semester
(.PDF/.DOC)
V Semester
(.PDF/.DOC)
VI Semester
(.PDF/.DOC)
BCA Revised 2st Sem
CS-76 Project Guideline




Feb 27, 2012

Download Solved Assignment of (CS-66) Multimedia for 2012

IGNOU BCA Fourth Semester Students can now download (CS-66) Multimedia Solved Assignment of 2012. Thanks to Pradeep Kumar Rana who solved and send this assignment to us. You can contact him for more information via facebook.

Aug 17, 2011

June, 2001: CS-64: Question Paper >>> Introduction to Computer Organisation

BACHELOR IN COMPUTER APPLICATIONS

Term-End Examination

June, 2001

CS-64: INTRODUCTION TO COMPUTER ORGANISATION



Time : 3 Hours

Max. Marks : 75




Note : There are six questions in this paper. Question one is compulsory and carries 30 marks. Answer any three questions from the rest.




1. (a) Perform the following arithmetic operations using 8 bit registers. Use binary signed 1's complement notation. Indicate overflow/underflow, if any.
(i) 29 + (— 49)
(ii) 27 — 101
(iii) — 28 + (—1OO)
(iv) 68 + (—75)


(b) Simplify the following Boolean function in sum-of-product from using tour variable Karnaughs map. Draw the resulting logic diagram.
F (A. B. C, D) = ∑(0, 5, 6, 7, 8, 9, 10, 11, 12, 15)
Please note that the symbol ∑ signifies the minterms whose decimal equivalent is listed in the parentheses. Produce a value 1 in the K map for the function.


(c) Describe the need of a multiplexer in a system. How is a multiplexer different from a decoder? Draw the logic diagram of a 2 x 1 multiplexer and 2 x 4 decoder.


(d) Write a program in 8086 assembly language to find whether a tour digit packed BCD number is divisible by either 3 or 5.


(e) How can you input integers, characters and strings through keyboard for an assembly language (8086 assembly language) program? Explain with an example.


(f) What is a micro-operation? Is it related to a micro-instruction? What is a horizontal micro-instruction? What are the advantages of horizontal micro-instruction over vertical micro-instruction? Describe the term micro-program.


2. (a) “ROM although is permanent memory, yet is a combinational circuit." Justify the above statement by giving example of 2 word — 4 bit ROM. How is a cell of ROM different than that of RAM?


(b) Write a program in 8086 assembly language to find frequency of capital alphabets in a long string. Make suitable assumptions, if any.


(c) What is a zero address instruction? How can such instructions be executed? Describe a machine organisation which can have most of its instructions as zero address instructions.


3. (a) What is the need of an Input/output processor? Suggest a method by which an Input/output processor can be connected to slow devices. Can an Input/output processor be replaced by a DMA module? Justify your answer.


(b) Design a combinational circuit for a decision function, which takes four input bit values and generates a value 1 if two or more bit values are 1; otherwise the function outputs a zero value. Draw the resulting logic diagram.


(c) What are the displacement addressing modes? Explain with the help of an example each. Suggest the addressing modes that can be used in 8086 to handle arrays efficiently. Explain by giving an example.


4. (a) Draw the logic circuit for one stage of full adder: Draw the block diagram for adding two tour bit numbers.


(b) Write a program in 8086 assembly language to add two four digit unpacked BCD numbers.


(c) Design a floating point number format for the following requirements;
Base: 2
Mantissa: Normalized, should be large enough to hold 4 significant decimal digits.
Exponent: Biased exponent in the range of 1- 25
Precision: Single
Make suitable assumptions if any.


5. (a) What is parity bit ? How is it used in Single Error Correction Code? How do you determine the size of SEC code for a giver bit of data?


(b) Compare and contrast the following.
(i) Associative memories versus interleaved memories.
(ii) 2D chip organisation versus 2% D chip organisation.
(iii) DRAM versus SRAM.


(c) What is arbitration? Describe the method of polling arbitration. Compare and contrast Polling arbitration mechanism to that of Daisy chaining and Independent requesting.


6. Write short notes on the following:
(a) Mapping of Cache blocks
(b) Wilkes control
(c) Selective set, Selective clear and Mask operations
(d) Fetch cycle of an instruction
(e) Peripheral processors and Co-processors

Jul 6, 2011

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.

Jul 3, 2011

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.