MPI 2013 previous year questions

B.Tech CS 2013 (MPI) Microprocessor & Interface previous year questions

 

 

Q. 1. Draw the block diagram and pin description of USTART 8251 and briefly explain formats of its mode, command and status words.

 

Q.2 Explain the various programming mode of 8279 keywords and Display controller. Also draw a block diagram showing its interfacing with microprocessor 8085.

 

View ALL

Software Engineering previous year questions

B.Tech CS 2013 Software Engineering previous year questions

Q.1 What is quantifying program quality ? With the help your own Hypothetical example, explain a method of quantifying programming quality.

 

Q.2  Explain the difference between structural and Object oriented (OO) analysis with the help of suitable example.

 View ALL

B.tech 2013 3rd sem DSA previous year questions

B.Tech CS Data structures and Algorithms (DSA) previous year questions 

Q.1 What do you mean by graph data structure ? Explain the sequential and linked list implementation of graph data structure.

Q.2 Insert the following list of element in an AVL tree ?

3, 5, 11, 8, 4, 1, 12, 7, 2, 6, 10 


View ALL 

B.Tech previous year questions

B.Tech previous year questions

Write the decision algorithm with an example. Also write divisibility properties.

B.Tech 
Discrete Mathematical Structures 
2013 

---

Define the Proof by contradiction with example.

B.Tech 
Discrete Mathematical Structures 
2013


View All

2014 DMS previous year questions (Discrete Mathematical Structures)

B.Tech CS (DMS) Discrete Mathematical Structures previous year questions - MinMarks

 

Q.1 Over the universe of animals, let

     P(x) : x is a whale ; Q(x):x is a fish.
     R(x) : x lives in water.
     Translate the following into English
$\; \exists x(~R(x\left)\right)$
$\; \exists x\left(Q\right(x)\wedge ~P(x\left)\right)$
$\; \forall x\left(P\right(x)\wedge R(x\left)\right) \to Q\left(x\right)$

$Q.2$ Let there is a tree with n-vertices of degree 1, 2 vertices of degree 2, 4 vertices of degree 3 and 3 vertices of degree 4. Obtain the value of n.$$$$

$<a\; href="https://www.maxmarks.in/discrete-mathematical-structures-previous-year-questions"\; target="\_blank"><span\; style="font-size:\; x-large;">View\; All</span></a>$

2014 FLP previous year questions (Fundamentlas of linux shell programming) - MinMarks

B.Tech (CS) 2014 Fundamentals of Linux shell programming previous year questions.

 

 

Q.1 Write command for Open X-terminal with blue back-ground, yellow foreground, window title ="Hard and soft".

Q.2 Find the output of following commands and explain:

1. $ls-l|date| who
2. $cal &; date &; uname&
3. $ls l
4. $(cal;date);(uname;who)  
   

   View All

2013 ISS previous year questions (Information System Securities )- MinMarks

B.Tech CS ISS (Information System Securities) previous year questions - MinMarks

 

Q.1 Explain the concept of Dual signature in context of Secure Electronic Transaction (SET). Briefly describe the sequence of events that are required for a SET transaction.

Q.2 What is the difference between HASH and MAC ? Discuss the method of accomplish the confidentiality and authentication using MAC and Hash.

View All