Showing posts with label B.tech 2nd year (cse). Show all posts
Showing posts with label B.tech 2nd year (cse). Show all posts

Tuesday, 2 July 2013

DISCRETE STRUCTURE

DISCRETE STRUCTURE
SEM-III, 2012-13
B.TECH EXAMINATION
UTTARAKHAND TECHNICAL UNIVERSITY
(UTU)

Time: 3 Hours
Total Marks: 100
Do any four Questions:
  1. Draw Venn Diagram for (A ∩ B) ⋃ C.
  2. If f: R→R is a function such that f(x) = 3x + 5 prove that f is one - one onto. Also find the inverse of f.
  3. Determine the number of integer solutions to the equation:
    x1 + x2 + x3 + x4 = 7
    where xi > =0 for all i = 1,2,3,4
  4. Confirm or disprove the following identities:
    (A ⋃ B) X (C ⋃ D) = (A X C) ⋃ (B X D)
  5. Let {A1, A2 ...Ak} be a partition of set A. We define a binary relation R on A such that an ordered pair (a, b) is in R if and only if a and b are in the same block of the partition. Show that R is an equivalence relation.
  6. Show that among n+1 positive integers less than or equal to 2n there are two of them that are relative prime.

Tuesday, 25 June 2013

COMPUTER BASED NUMERICAL TECHNIQUE (CBNST)

COMPUTER BASED NUMERICAL TECHNIQUE (CBNST)
SEM-III,2010-11
B.TECH EXAMINATION
UTTARAKHAND TECHNICAL UNIVERSITY
(UTU)

Time: 2 hours
Total Marks: 75
Attempt any three parts of the following:
  1. If X = 2.536, find the absolute error and relative error when
    (i) X is rounded and
    (ii) X is truncated to two decimal digits.
  2. Find a real root of cos x = 3x - 1, correct to three decimal places by iteration method.
  3. Using Regula-Falsi method, compute the smallest positive root of the equation x ex - 2 = 0, correct upto four decimal places.
  4. Find the root of the equation x3 - x -1 = 0 by using Muller's methods.

Tuesday, 11 June 2013

DISCRETE STRUCTURE

DISCRETE STRUCTURE
SEM-III, 2011-12
B.TECH EXAMINATION
UTTARAKHAND TECHNICAL UNIVERSITY
utu previous year question paper

Time: 3 Hours
Total Marks:100
Note: Attempt all questions. Be precise in your answer.

Attempt any four of the following:
  1. For any two sets A and B, prove that following:
    (i) (A ᴗ B)C = AC ᴖ BC
    (ii) (A ᴖ B)C = AC ᴗ BC
  2. Let A be the set {1, 2, 3}, define the following types of binary relation on A.
    (i) A relation that is both symmetric and antisymmetric
    (ii) A relation that is neither symmetric nor antisymmetric.
  3. Let f : A→ B and g : B→ C be two invertible mapping then prove
    (i) gof is invertible
    (ii) (gof)-1 = f -1og -1
  4. Prove by induction method that if n ≥ 10, then 2n > n3.
  5. Prove that contradiction that √5 is irrational.
  6. Prove that the intersection of two equivalence relation is also an equivalence relation, but the union of two equivalence relation may not be an equivalence relation.

Friday, 7 June 2013

COMPUTER ORNANIZATION

COMPUTER ORGANIZATION
SEM-IV, 2013
B.TECH EXAMINATION
UTTARAKHAND TECHNICAL UNIVERSITY
(UTU)

Time: 3 Hours
Total Marks: 100
Attempt any four:
4×5=20
  1. List the major component of computer organization and explain in detail.
  2. Explain the IEEE standard for floating point numbers with suitable examples.
  3. Explain the function of control unit and Instruction format in details.
  4. What is RISC? Draw and explain the Berkeley RISC I instruction format.
  5. Explain the importance of HOLD and HLDA pin data transfer through DMA.
  6. Draw the block diagram of multiprocessor and explain the role of cache coherence in processor.

Friday, 31 May 2013

MICROPROCESSOR

MICROPROCESSOR
SEM-IV, 2013
B.TECH EXAMINATION
UTTARAKHAND TECHNICAL UNIVERSITY
utu previous question paper

Time: 3 Hours
Total Marks: 100
Attempt any four questions 
4*5=20
  1. Explain the various types of microprocessor with its evolution period.
  2. Explain the difference between processor and microcontroller.
  3. Explain the interrupt structure of 8279.
  4. Explain the addressing mode of 8085 with suitable examples.
  5. Explain the importance of USB for data transfer.
  6. Draw the block diagram of 8255 and how it differs from 8251, explain.

Tuesday, 14 August 2012

MICROPROCESSOR

UTTARAKHAND TECHNICAL UNIVERSITY
B.TECH (SEM. IV) 
2012
SUB: Microprocessor


time : 3hr] 
Total marks :100
Note: Attempt all questions. Be precise in your answer.

SECTION A
Q1:- Attempt any four of the following :
4x5=20
  1. Explain the evaluation of microprocessor in brief.
  2. Draw the functional block diagram of Intel-8085.
  3. State the function of temporary register of the 8085 microprocessor.
  4. State the features of 8086. Also explain the difference between 8086 and 8085.
  5. Define the term interrupt, exception, fault, and trap.
  6. List the four major processing units in an 80826 microprocessor and describe the function of each.
SECTION B
Q2:- Attempt any two of the following :

Sunday, 12 August 2012

sub-computer organization b.tech 2nd year cse

Uttarakhand Technical University
(utu)
B.tech (2nd year)
2012 Examination
sub:- Computer Organization


time:- 3hr
total marks :100
Note : Attempt all the questions.

Q1:- Attempt any four parts of the following :
  1. What to you mean by inter-register transfer? Discuss Bus transfer.
  2. Design Arithmetic Logic Shift unit that will perform different arithmetic, logic an shift operation.
  3. Draw a diagram of bus system for four register of 4-bits each. The bus is to be constructed with multiplexers.
  4. Show the hardware implementation for the following statements. The registers are 4-bits in lengths :
    TO : A b.tech utu previous year question paperRO
    T1  : A b.tech utu previous year question paper R1
    T2  : A utu previous year question paper R2
    T3  : A utu previous year question paper R3
  5. Show the multiplication process using Booth's algorithm when the following binary numbers are multiplied : (12)*(-18)
  6. Represent the decimal number -0.654 into IEEE Floating point format.
Q2:- Attempt any Four parts of the following :
  1. Explain the Fetch and Execute cycle during execution of an instruction.
  2. Describe briefly a Hardwired Control.
  3. What is microinstruction? Describe the microinstruction format.
  4. What do you mean by the term Microprogram Sequence. Explain the role played by it.
  5. Discuss advantages and disadvantages of Micro-programmed Control.
  6. Explain wide-branch addressing and emulation.
Q3 Attempt any two parts of the following :
  1. Write a program to evaluate the arithmetic expression :
    X= (A+B*C)/(D+E*F/G+H) Using three, two, one and zero address Instructions.
  2. Design an efficient logic circuit shared by different branch condition derived form the combination or stand alone status of the Flag register bits S (sign), V(overflow), C(End carry), Z(all O's). Specific the conditional branch instruction which can b supported by the circuit you have designed.
  3. Describe DMA with suitable blocks diagram. Why does DMA have priority over the CPU when both request a memory transfer ? Explain,
Q4:- Attempt any two parts of the following :
  1. The access time of a cache memory is 100 ns and that of main memory 1000 ns. It is estimated that 80 percent, of the memory requests are for read and the remaining 20 % for write. The hit ratio for read accesses only is 0.9.
    (a) What is the average access time of the system considering only memory read cycles ?
    (b) What is the average access time of the system for both read and write requests ?
    (c) What is the hit ratio taking into consideration the write cycles ?
  2. A Block set associative cache consists of a total of 64 blocks divided into four block sets. The main memory containing 4096 blocks each consisting of 128 words.
    (a) How many bits are there in the main memory address ?
    (b) How many bits are there in each of TAG, SET and WORD field ?
  3. Discuss the concept and implementation of virtual memory. Also describe a suitable scheme for translation from logical address to physical address.
Q5:- Attempt any two parts of the following :
  1. Give various architectural classification schemes. Also discuss the Flynn's and Feng's Classification in detail.
  2. Discuss the various possible hazards between read and write operations in an instruction pipeline and state the mechanism to detect and avoid these hazards. Also discuss the dynamic instruction scheduling.
  3. Consider the execution of  a program of 15000 instructions by a linear pipeline processor with a clock rate of 25 MHz. Assume that the instruction pipeline has five stages and that one instruction and out of sequence executions are ignored.
    (a) Calculate the speedup factor in using this pipeline to execute the program as compared with the use of an equivalent nonpipelined processor with an equal amount of flow through delay.
-------------------
this question paper is only for Uttarakhand techinical university (UTU).Step4success is the only ultimate collection of question papers of UTU and HNB.
Best of luck guys :)

Tuesday, 7 August 2012

SOFTWARE ENGINEERING B.Tech previous year qus paper 2nd year (IV sem)


UTTARAKHAND TECHNICAL UNIVERSITY
B.TECH (SEM. iv) 
2011-2012
sub:software enginnering


time : 2hr] 
Total marks :50
Note: Attempt all questions. Be precise in your answer. 

SECTION A
Q1:- Attempt any three of the following :
4x3=12
  1. Define Software Engineering and how it is different from conventional engineering process?
  2. Should a development organization adapt a single process model for all its software development? Discuss the pros and cons?
  3. Write down major characteristics of software. Illustrate with a diagram that the software does not wear-out.
  4. Describe the various steps in software development life cycle? Explain the Spiral Model in details.

SECTION B

Monday, 6 August 2012

UNIX & SHELL PROGRAMMING B.Tech previous year qus paper 2nd year (IV sem)


UTTARAKHAND TECHNICAL UNIVERSITY
B.TECH (SEM. IV) 
2012
SUB: UNIX & SHELL PROGRAMMING


time : 3hr] 
Total marks :100
Note: Attempt all questions. Be precise in your answer.


SECTION A
Q1:- Attempt any four of the following :
4x5=20

  1. Describe how UNIX is more secured than other operating systems.
  2. How many types of editors we can use in UNIX operating system. What are the main functions of vi editors.
  3. Explain the purpose of include files in UNIX.
  4. Explain the role of file descriptors, file table and Incode table in Unix File System.
  5. Draw the block diagram of Unix system kernel. Explain various components.
SECTION B
Q2:- Attempt any four of the following :

Saturday, 4 August 2012

DATA BASE MANAGEMENT SYSTEM

DATA BASE MANAGEMENT SYSTEM
SEM-IV, 2012
B.TECH EXAMINATION
UTTARAKHAND TECHNICAL UNIVERSITY
(UTU)

time : 3hr]
Total marks :100
Note: Attempt all questions. Be precise in your answer.

SECTION A
Q1:- Attempt any four of the following :
4x5=20
  1. Define the following terms:
    (a) Data redundancy and consistency
    (b) Referential Integrity
    (c) Data atomicity
    (d) Domain Constraint
    (e) Data Models
  2. Explain the concept of keys in DBMS. Also describe the different types of keys in details.
  3. Draw an E-R diagram for a hospital with a set of patients and a set of medical doctors, with each patient a of the various conducted tests is also associated.
  4. Explain two-tier and three-tier architecture of DBMS in details.
  5. What do you mean database language and interfaces? What is the difference between DDL and DML? Explain.
  6. Discuss the candidate key, primary key, super key, composite key and alternate key.

Friday, 3 August 2012

Data structure (utu) b tech que paper 2nd year

UTTARAKHAND TECHNICAL UNIVERSITY
B.TECH (SEM. 3RD) 
2011-2012
Sub: Data structure


time : 3hr]
Total marks :100
Note: Attempt all questions. Be precise in your answer.

SECTION A
Q1:- Attempt any four of the following :
4x5=20
  1. Describe time and space complexity. Discuss best, average and worst case for finding a given number from an array of integers.
  2. Explain the difference types of data structure. What data structure will you use to store the information of students of your class? Why?
  3. Make a function in C which takes an array of names as input and return the number of palindromes in it.
  4. Write a complete program in C to implement stack using liked list.
  5. Write an algorithm to evaluate postfix expression. Convert the following infix expression into equivalent postfix expression.
    (a+b)  ͯ  c-d + e / (f-g) 
  6. What is recurssion? What is the significance of using recursive function to print Fibonacci number up to the given number.
Q2:- Attempt any four of the following :
4x5=20

SECTION B
  1. Write a function in C to reverse a given queue.
  2. What is priority queue? How it is implemented? Take an example to show your implementation.
  3. Devise function in C which check for Full and Empty for a circular queue. Also find out the number of elements in circular queue.
  4. Write a program in C to find the given item in a single linked list. Also analyze the running time of your program.
  5. Devise insertion and deletion function for doubly linked list.
  6. Explain Garbage Collection and Compaction.
 Q3:- Attempt any two of the following :
10X2=20 

SECTION C
  1. (a) Define a tree. Explain the difference type of binary tree. What is predecessor and successor         of node in a binary search tree?
    (b) Prove that the number of nodes n in a perfect binary tree can be found using this formula : 
    n=2h+1 - 1 where h is the height of the tree.
  2. (a) Discuss the usage of threaded binary tree.
    (b) Show the working of Huffman algorithm.
  3. Write a pseudo code for insertion and deletion in Binary Search Tree. Find out the running time of insertion and deletion in binary search Tree.
Q4:- Attempt any two of the following :
10X2=20 

SECTION D
  1. Can we use Binary search technique everywhere? Justify your answer. Analyze best, average and worst case behavior of binary search. Shoe the steps of binary search for finding 28 in the given list of numbers.
    2, 7, 12, 15, 18, 20, 22, 26, 28, 30, 33, 36, 39, 40, 45, 50
  2. What is Hash table? What is the purpose of using hash table is more beneficial as compared to its contemporary techniques.
  3. Write pseudo code for heap sort. Analyze its running time. Perform heap sort on following list of integers.
    21, 1, 34, 28, 6, 85, 23, 17, 22, 80, 11, 2, 7, 25
Q5:- Attempt any two of the following :
10x2=20 
 SECTION E
  1. How the files are organized on physical storage media? Explain in detail.
  2. (a) Explain the organization of sequential file.
    (b) What is B+ tree? Explain its usage.
  3. Write short notes on any two:
    (a) Indexing
    (b) Hashing
    (c) Indices.
--------------------utu previous year question papers of B.tech, Bba, B.com, B.sc and Mba old year question papers Uttarakhand technical University (UTU)-----------------------
Good luck !!!

Thursday, 2 August 2012

utu previous year question paper sub (object oriented programming)

Uttarakhand Technical University
(Sem III) Odd Sem Examination,
2011-2012
Sub:-Object Oriented Programming
time:- 3hrs}
total marks :- 100]
Note : Attempt all questions.Be precise in your answer.

Section A
Q1:- Attempt any four of the following :
4x5=20

  1. Prepare a class diagram from the instance diagram given below :
    Instance diagram for a porton of Europe.
  2. Differentiate between aggregation and generalization by taking a suitable example.
  3. What are constraints? Explain in context of object modelling.
  4. Write scenarios for the following activities :
    (a) An elevator ride to the top floor.
    (b) Getting ready to take a trip in your car.
    Assume an automatic transmission. Do not forget your seat belt and emergency brake.
  5. What is a state diagram? Prepare a state diagram for a programmable thermostat.
  6. Define the concept of candidate keys by taking a suitable example.
Section B
 Q2:- Attempt any four of the following :
4x5=20
  1. Prepare a data flow diagram for computing the volume and surface area of a cylinder. Input are the height and radius of the cylinder. Output are volume and surface area. Discuss several ways of implementing the data flow diagram.
  2. Differentiate between SA/SD and JSD methodologies.
  3. Describe OMT methodology in brief.
  4. This subject teaches you to use object oriented techniques to implement programs and databases. Briefly describe how these techniques can be applied in other areas like language design and hardware design.
  5. Write a short note on functional modelling.
  6. Prepare a data flow diagram for computing the mean of a sequence of input value. A separate control input is provided to reset the computation. Each time a new value is input, the mean of all values input since the last reset command should be output.
Section C

 Q3:- Attempt any two of the following :
10x2=20
  1. (a) Why is java called machine independent language?- Explain.
    (b) What is a JVM ? Explain their use.
  2. (a) What are wrapper classes? Explain their use.
    (b) Describe literal in Java language.
    (c) Explain the use of continue statement in Java by taking a suitable example.
    (d) Describe briefly constructors in Java language.
  3. (a) Differentiate between application and applets? Describe advantages of Java swings over Java applets.
    (b) Discuss the thread model in Java . Write a short program to demonstrate the creation of a new thread by extending the thread class.
Section D
 Q4:- Attempt any two of the following :
10x2=20
  1.  (a) What are string buffer? How does it differ from a string? Give the three ways of creating a string object.
    (b) Describe the various streams found in the Java. io package? Write a short programs to count the number of words in a file by using stream tokenizer.
  2. Describe briefly the function of some AWT classes. Write a short program to demonstrate how to create a frame window in an applet.
  3. Discuss the function of Layout Manager in Java by taking a suitable example.
Section E
 Q5:- Attempt any two of the following :
10x2=20
  1. Why the need for migrating from C++ to Java was felt in software development community?- Describe.
  2. (a) Describe Java Swing in brief.
    (b) Write a short note on application of Java.
  3. Discuss the major characteristics of JDBC. Write a program to demonstrate these steps. 
--------------------------------------
Utu (uttarakhand Technical University) previous year question paper only at step4success.com
The ultimate collection of previous year question papers.
Just do it..