exam pattern,question paper,notification

Wednesday, April 10, 2013

B.E. 2nd SEMENSTER (COMMON TO ALL BRANCHES) Examination - B.E, May, 2012 FUNDAMENATAL OF COMPUTER & PROGRAMMING IN C

B.E. 2^nd SEMENSTER (COMMON TO ALL BRANCHES)

Examination - B.E, May, 2012

FUNDAMENATAL OF COMPUTER & PROGRAMMING IN C

Paper : CSE-101-F

Note : Attempt any five questions. Question No. 1 is compulsory and select one question from each section. All question carry equal marks.

1. (a) Differentiate between SRAM and DRAM. 2.5

(b) What is an operating system ? Why is called Resource Manager? 2.5

(d) What is the difference between assembler and complier ? 2.5

(e) Explain switch statement with the help of example. 2.5

(f) explain strcpy() function with the help of example. 2.5

(g) What are storage classes in ‘C’ 2.5

(h) Explain the malloc and calloc functions. 2.5

Section – A

2. (a)Differentiate between single user and multiuser operating system. 10

(b) Explain the concept of timesharing operating system. 10

3. (a) What are various types of RAM? 8

(b) Explain working of scanner. 6

Section – B

4. (a) Explain the various language translators. 10

(b) What is DNS ? why it is used? 10

5. Explain the TCP/IP reference model in detail. 20

Section – C

6. (a) Write a program in ‘C’ to check if a given number is a palindrome or not. 10

(b) Write a program in ‘C’ to find the transpose of a matrix of order m x n. 10

7. (a) WAP in ‘C’ to reverse a string using recursion. 10

(b) Explain the methods by which values of a structure can be transformed from one function to another. 10

Section – D

8. (a) Explain the command line argument with example. 10

(b) Write a program to open a file named “file 1” and write a line of text in it by reducing the text from the keyboard. 10

9. Write short notes on the following :

(a) Realloc() and free functions.

(b) Meaning of LVALUE and RVALUE of a variable

(d) Passing an entire array to a function. 20

B.E. 2st SEMENSTER (COMMON TO ALL BRANCHES) Examination - B.E, May, 2011 FUNDAMENATAL OF COMPUTER & PROGRAMMING IN C

B.E. 2^st SEMENSTER (COMMON TO ALL BRANCHES)

Examination - B.E, May, 2011

FUNDAMENATAL OF COMPUTER & PROGRAMMING IN C

Paper : CSE-101-F

Note : Attempt any five questions. Question No. 1 is compulsory and select one question from each section. All question carry equal marks.

1. Define the following terms :

(a) Micro processor

(b) Operating system

(d) Graphic user interface

(e) DNS

(f) Data type

(g) Array

(h) Pointer

(i) Operating

(j) Computer network

2. (a)What are the different component of a computer ? Explain each of them. 10

(b) What is meant by an I/O device ? Describe different categories of input devices. 10

3. (a) Explain function of operating system in detail. 10

(b) Differentiate between DOS, UNIX and windows operating system. 10

4. (a) Explain briefly categorization of High level languages. 10

(b) Differentiate between compiler and interpreter. 5

5. (a) What do you mean by network topology ? Describe various network topologies in detail. 10

(b) Explain briefly the layers of OSI model. 10

6. (a) What do you mean by operator ? Explain different types of operators used in C. 10

(b)What is an array ? How Array and string are related to each other? Explain with example. 10

7. (a) Write a program to swap two numbers using functions 10

(b)Differentiate between structure and unions with examples 10

8. Differentiate between Array of pointer and pointer to an array with example. 20

9. (a) What are the functions related to the file handling to the ‘C’. 10

(b)What do you mean by dynamic memory allocation ? Explain. 10

B.E. 1st SEMENSTER (COMMON TO ALL BRANCHES) Examination - B.E, December, 2010 FUNDAMENATAL OF COMPUTER & PROGRAMMING IN C

B.E. 1^st SEMENSTER (COMMON TO ALL BRANCHES)

Examination - B.E, December, 2010

FUNDAMENATAL OF COMPUTER & PROGRAMMING IN C

Paper : CSE-101-F

Note : Attempt any five questions. Question No. 1 is compulsory and select one question from each section. All question carry equal marks.

1. Describe the following terms :

(a) Port

(b) Program

(d) Loader

(e) LAN

(f) Protocol

(g) Operator

(h) Function

(i) Pointer

(j) Operating system 20

2. (a) What do you mean by computer ? Discuss briefly various characteristics of computer. 10

(b) Differentiate between impact and non impact printer ? 5

3. (a)Briefly explain different types of operating system ? 10

(b) Explain core component of Unix ? 10

4. (a) What do you understand by programming languages ? what are the good characteristics of good programming language ? 10

(b) what is difference between low level and high level language of programming ? 10

5. (a) Explain the layers of TCP/IP model using a diagram. 10

(b) Explain the term DNS ? Why is it used ? 10

6. Explain various control statements used in ‘C’ with example ? 20

7. (a) Write a program for the matrix multiplication. 10

(b) Differentiate between call by value and call by reference with example ? 10

8. (a) Describe the concept of pointers with the help of an example. 10

(b) Explain the use of pointer as function argument with example. 10

9. (a) Write a programme to copy the content of one file to another. 10

(b) What do you mean by command line argument explain with example? 10

B.E. 4^th SEMENSTER (CSE)

Examination - May , 2012

DATABASE MANAGEMENT SYSTEMS

Paper : CSE-202-F

Note : Attempt any five questions in all. Questions No. 1 is compulsory and attempt at least one Question from each section.

1. (a) What functionality does the recovery manager of a DBNS provide ?

What does transaction manager do? 4

(b) What are the advantages and disadvantages of relational data model? 4

(d) What are the steps involved in the design of a data warehouse? 4

(e) What is meant by functional dependency, full functional dependency and trival dependency. 4

Section-A

2. (a) Discuss the main categories of data models. 10

(b)What is the difference between procedural and nonprocedural

DML. 4

3. (a) What is meant by a recursive relationship type? Give example. 7

(b) Discuss the conventions for displaying an ER scheme as an ER diagram. 6

(c)What is weak entity? What is a primary key? 7

Section-B

4. (a) List the operations of relational algebra and the purpose of each. 12

(b) In what sense does relational calculus differ from relational algebra. 8

5. (a)Discuss the technique for allowing a hash file to expand and shrink dynamically. What are the advantage and disadvantage of each? 10

(b) What is a search tree? What is a B-tree? What is the structure of a B-tree node? 10 1

Section-C

6. (a) List the data types that allowed for SQL attributes. 7

(b) How does SQL allow implementation of general integrity

constraints. 7

(c)What is view in SQL, and how is it defined ? 6

7. (a) Discuss attribute semantics as an informal measure of goodness for a relational schema. 7

(b) Why should null in a relation be avoided as far as possible? Discuss the problem of spurious tuples and how we present it. 7

Section-D

8. (a) What semi-join operation for query processing in distributed database? 8

(b) Write a short note on data mining and data warehousing. 12

9. (a) Describe the life cycle of a transaction. 7

(b) Describe shadow paging technique for recovery. 7

B.E. 4^th SEMENSTER (CSE)

Examination - May , 2011

DATABASE MANAGEMENT SYSTEMS

Paper : CSE-202-F

Note : Attempt any five questions in all. Questions No. 1 is compulsory and attempt at least one Question from each section.

1. (a) Differentiate between logical and physical data independence. 4

(b) Why is the concept of a weak entity used in data modeling ? 4

(c)How does multilevel indexing improve the efficiency of searching an index file ? 4

(d) Define BCNF . How does it differ from 3NF? 4

(e) Elaborate ACID properties of a transaction. 4

Section-A

2. (a) Elaborate the responsibilities of DBA. 10

(b) Discuss the role of high- level data model in the database design process. 10

3. (a) What is the difference between the two-tier and three-tier client/server architecture? 10

(b) Discuss the naming conventions used for ER diagrams. 10

Section-B

4. (a) Discuss the various types of inner join operations. Why is theta join erquired ? 8

(b) Discuss the entity integrity and referential integrity constraints. Why is each considered important ? 8

(c)What is meant by union compatibility? 4

5. (a) What is the order P of a B-Tree? Describe the structure of B-tree nodes. 10

(b) What is partitioned hashing? How does it work? What are its limitations? 10

Section-C

6. (a) What is a SQL trigger ? How is it different from a stored procedure ? 7

(b) Sate Armstrong’s axioms. Why are they considered as sound and complete ? 7

7. (a) What is a multi-valued dependency ? What type of constraint does it specify? When does it arise ? 10

(b) What is the dependency preservation property of a decomposition? Why is it important? 5

Section-D

8. (a)Write about network data model and hierarchal data modal. 15

(b) What are parallel database? 5

9. Write short notes on the following :

(a) Locking techniques for concurrency control.

(b) Database recovery. 20

B.E. 4^th SEMENSTER (CSE)

Examination - May, 2010

DATABASE MANAGEMENT SYSTEMS

Paper : CSE-202-E

Note : Attempt any five questions. All questions carry equal marks.

1. (a) What is responsibility of DBA ? 8

(b) Differentiate between 12

(i) DDL and DML.

(ii) procedural nonprocedural DML.

(iii) Logical and physical data independence.

2. (a) What are the difference between a week and strong entity set ? What is the significance of weak entity ? How can these both be represented in an ER diagram? 10

(b) With the help of an example describe the process of reduction of an ER scheme to tables. 10

3. (a) Write about various hashing techniques. 10

(b) Differentiate between 10

(i) Primary index and secondary index.

(ii) Sequential files and index sequential files.

4. (a) Explain the following operators of relation algebra giving examples:

Join , division, difference, rename 10

(b)Let the following relation scheme be given : 10

R = (A, B, C)

S = (D, E, F)

Let relation _r(R) and _s(S) be given. Give expression in the tuple relational calculates then equivalent to each of the following :

(i) .π_A(r)

(ii) .σ_B ₌ ₁₇(r)

(iii) R X S.

5. (a) Suppose that we decompose the scheme F=(A, B, C, D) into (A, B, C) and (A, D, E). Show that this decomposition is a lossless join decomposition if the following set F of functional dependencies holds :

A -> BC

CD -> E

B -> D

E -> A 10

(b) Differentiate between 3NF and BCNF, Which is a stronger normal form ? 10

6. (a) What are distributed database ? Describe their advantage and disadvantages ? 10

(b) What are parallel database ? What their various types? 10

7. (a) Elaborate ACID properties of a transaction. 10

(b) What steps are required to be taken for recovery of a database system in the event of failure ? Discuss. 10

8. Write short notes on :

(a) Network and hierarchical data modal

(b) Client – server architecture