Showing posts with label Model Papers. Show all posts
Showing posts with label Model Papers. Show all posts

Model Paper-III | BCE




B.Tech CSE II Semester Model Paper
Basic Computer Engineering  (BT-203) 
Time:3 Hours Max Marks:70
Sno. Questions Marks

SECTION-1
Note: Attempt all question
a What do you understand hierarchical directory structure. 2
b What is the need of operating system? 2
c What do you understand by compiler and interpreter?  2
d What are object oriented concepts? 2
e How we define class and object in C++. 2
SECTION-2
Note:Attempt Any Five
a Discuss about the hierarchy of computer memory. 4
b Write down the goal of OSI model in computer network. 4
c What do you understand by anti-spyware software? 4
d What is the use of directory in operating system? 4

e What is database query language. 4

f Why traditional file system is not reliable. 4

g What is networking ? Write their goal. 4
SECTION-3
Note: Attempt all question
a Write a program to overload pre and post increment operator in c++.
10
OR
What do you understand by data communication.

b Difference between OSI model and TCP/IP model. 10
OR
What do you understand by default and parameterized constructor.

c Explain data independency with the help of diagram. 10
OR
What do you understand by ER-model.
d
Explain about the application of cloud computing.
10
OR
What do you understand by architecture of cloud computing? 

More Papers

Model Paper-II | BCE




B.Tech CSE II Semester Model Paper
Basic Computer Engineering  (BT-203) 
Time:3 Hours Max Marks:70
Sno. Questions Marks

SECTION-1
Note: Attempt all question
a What do you understand by class and object. 2
b Explain the use of file and folders in system. 2
c Explain the memory hierarchy of a system.  2
d What do you understand by compiler and assembler? 2
e What do you understand by tokens in c++. 2
SECTION-2
Note:Attempt Any Five
a Write down the type of software in operating system. 4
b Explain about logic bomb and email spooling. 4
c Explain the organization of Computer. 4
d Write down the properties of C++. 4

e What are tokens in C++ ? 4

f What do you understand by dbms ? How it is more secure than traditional file system. 4

g What is inter networking ? 4
SECTION-3
Note: Attempt all question
a What do you understand by three level schema of dbms.
10
OR
Explain all layers of OSI model in detail.

b What is operator overloading explain with proper example.List out the operator that can not be overloaded. 10
OR
What do you understand by constructor and their type?

c Write short note on  (a) Data dictionary (b) Internet 10
OR
What do you understand by Trojans and Worms
d
What do you understand by e-commerce and www.
10
OR
What do you understand by cloud infrastructure ? 

More Papers

Model Paper-I | BCE




B.Tech CSE II Semester Model Paper
Basic Computer Engineering  (BT-203) 
Time:3 Hours Max Marks:70
Sno. Questions Marks

SECTION-1
Note: Attempt all question
a Define computer.classify it. 2
b What do you understand by booting process. 2
c What do you understand by system software and utility software. 2
d What do you understand by memory.. 2
e Write down the functionality of CPU. 2
SECTION-2
Note:Attempt Any Five
a What do you understand by software concept. 4
b What is operator precedence? Write precedence of arithmetic operators 4
c Explain the organization of Computer. 4
d Write down the difference between C and C++. 4

e What are C character sets ? What are tokens ? 4

f What do you understand by type casting ? 4

g What is computer network ? 4
SECTION-3
Note: Attempt all question
a What do you understand by computer memory.classify it in detail.
10
OR
Explain all layers of TCP/IP model in detail.

b Write a program contain person as a base class and teacher and student as a derived class with some basic data.like (name,age,contact,address,subject,course, etc) 10
OR
Define a function? Explain two categories/types of argument passing techniques, with proper programs in C.

c What are good computer security habits 10
OR
What do you understand by Virus, Malware
d
Explain (if, if-else, nested if-else, cascaded if else) in C language with syntax and example.
10
OR
What is cloud computing ? 

More Papers

Index | Model Papers

Model Paper -4 | C Language




B.Tech CSE I Semester Model Paper
Programming & Problem Solving  (BT-103) 
Time:3 Hours Max Marks:70
Sno. Questions Marks

Q 1. Short Answer Type Question (Attempt Any Five)
a What do you understand by typedef ? 6
b What does a storage class mean? Mention different storage classes available in C. 6
c Explain all loop structures in C with the help of syntax and flow charts. 6
d What is function ? Write down their type. 6

e Define formal and actual argument of function with the help of example. 6

f What is the use of break, continue, goto and exit in c program. 6

g Explain file handling in C. 6
Q 2. Long Answer Type Question (Attempt Any Four)
a Write a to multiply by 2 with input values by using command line arguments. 10
OR
What is pointer in C ? Write a program to add and subtract any integer value with pointer and display value of pointer.

b Write a program to print details of student(name, course, branch) and address(state, city, pin) using nesting of structure.
10
OR
Write a program to print ASCII value of any character using function.

c Write a program to find the diagonal elements of matrix.
10
OR
What is switch case in C program. Implement a simple calculator by using switch case.
d
What is bitwise operators.Explain any two bitwise operator using proper example.
10
OR
Write a program to convert upper character to lower and lower to upper without using predefined functions.
e
Write a program to print reverse of any number.
10
f
What is File handling? Explain and Implement following function such as fgetc(), fputc(), fputs(), fgets(), fopen(), fclose().
10

More Papers

Index Model Paper | TOC (Theory of Computation)

Model Paper-3 | C-Language




B.Tech CSE I Semester Model Paper
Programming & Problem Solving  (BT-103) 
Time:3 Hours Max Marks:70
Sno. Questions Marks

Q 1. Short Answer Type Question (Attempt Any Five)
a What is type conversion? Explain two types of conversion with examples 6
b Explain Union in C and demonstrate it with program. 6
c Show how break and continue statements are used in a C program, with example. 6
d Explain and demonstrate with program the array of pointers in C. 6

e Define string. List out all string manipulation function. Explain any two with example. 6

f Write a program to copy the elements of one array into another array. 6

g How python is plate form independent language explains. 6
Q 2. Long Answer Type Question (Attempt Any Four)
a Explain pointers to function with the help of example.
10
OR
What is compiler, Interpreter and Assembler?

b What are the types of constants in C? Also give example of each.
10
OR
What is a variable? How it is categorised?

c Write a program to show the use of conditional operator.
10
OR
Write a program to print the fibonacci series up to 100 by using for and while loop.
d
Write a program to display sum of series 1+3+5+....+n.
10
OR
Write a program to write and read 10 lines of any file.
e
What is pointer to pointer.Write a program to declare pointer to pointer variable and display the element of pointer.
10
f
Write a program to print a table of any number n using python.
10

More Papers

Model Paper -2 | C Language




B.Tech CSE I Semester Model Paper
Programming & Problem Solving  (BT-103) 
Time:3 Hours Max Marks:70
Sno. Questions Marks

Q 1. Short Answer Type Question (Attempt Any Five)
a Write a program in C to demonstrate pointer for functions. 6
b What do you understand by Constants in C? Explain its types also. 6
c Consider 16 bit memory word, How 4.5 is represented in (1.M) floating point representation. 6
d Define pseudo code. Write a pseudo code to find the sum and average of given three numbers. 6

e Explain structures in C and demonstrate it with program. 6

f What do you understand by MACROS? 6

g What is python? Write down some of features of python ? 6
Q 2. Long Answer Type Question (Attempt Any Four)
a Explain all operators of C language with proper program.
10
OR
What are bitwise and logical operator? Discuss all.

b Write difference between structure and union with the help example
10
OR
Write a program to convert binary number (101110) into decimal.

c Explain two categories/types of argument passing techniques, with examples.
10
OR
Explain how the structure variable passed as a parameter to a function with example.
d
What is pointer? Write the difference between * and & operation explain with example.
10
OR
Convert (765.25)10 into its equivalent binary number, octal number and hexadecimal number.
e
Explain dynamic memory allocation in C in details with its functions.
10
f
Write a program to print a statement "I am name and I am age years old" in python by taking name and age as a string variable.
10

More Papers

Model Paper -1 | C-Language




B.Tech CSE I Semester Model Paper
Programming & Problem Solving  (BT-103) 
Time:3 Hours Max Marks:70
Sno. Questions Marks

Q 1. Short Answer Type Question (Attempt Any Five)
a Draw the flowchart and write a C program to compute simple interest. 6
b What is operator precedence? Write precedence of arithmetic operators 6
c Explain the organization of Computer. 6
d What do you understand by algorithms ? Explain different ways of stating algorithms. 6

e What are C character sets ? What are tokens ? 6

f What do you understand by type casting ? 6

g What is python? Write their scope ? 6
Q 2. Long Answer Type Question (Attempt Any Four)
a Explain switch case statement and write a calculator program in C language to do simple operations like addition, subtraction, multiplication and division using switch case.
10
OR
Write a C program to read N integers into an array A and to find the (i)sum of odd numbers,(ii) sum of even numbers,(iii) average of all numbers. Output the results computed with appropriate headings.

b Write a program that reads two matrices A and B of size 3X3 and prints the result of A+B.
10
OR
Define a function? Explain two categories/types of argument passing techniques, with proper programs in C.

c What are Recursive functions? Demonstrate factorial program using recursion.
10
OR
Explain the array of pointes with example? or Explain how pointers and arrays are related with example.
d
Explain (if, if-else, nested if-else, cascaded if else) in C language with syntax and example.
10
OR
What is function parameter? Explain different types of parameters in C functions. 
e
What is function? Explain different classification of user defined functions based on parameter passing and return type with examples.
10
f
What are the common built-in data types in python? Write a program to print sum of 10 numbers using python.
10

More Papers

Model Paper-3 | Theory of Computation


B.Tech CSE III Semester Model Paper
Theory Of Computation 
Time:3 Hours Max Marks:70
Sno. Questions Marks

1 a Construct a DFA which accept a string of a's and b's starts and ends with the same symbol. 2
b Construct a FA for  following RE aa* and (ab* + b)2
c Suppose R be any regular expression than write down some identity rule of RE. 2
d Create parse tree for E→E + E | E * E | (E) | id and verify id+id*id. 2

e Explain about the type of grammar. 2
2 a Construct a RE to given finite automata using arden's theorem.
5
OR
3 a
Explain about the minimization of Finite Automata with example.
                                     

4 a Minimize the given DFA using tabular method.

5
OR
6 a
Minimize the given DFA using set method.



7 a What is FA with output.Explain with their formal definition.

5
9 a
Construct a moore machine which print even if number of 0's are even and print odd if number of 0's are odd against input string of 0's and 1's.

5
10 a
Convert the given moore machine to mealy machine.


10
11 a
What is Grammar and the normal form of grammar with example. 

10
12 a
Convert the given grammar into chomsky normal form (CNF).
    S → aB | bA  , A → bAA | aS | a , B → aBB | bS | b

10
14 a
Explain the complete procedure to remove left recursive grammar with the help of example.
10

Model Paper - 2 | Theory of Computation


B.Tech CSE III Semester Model Paper
Theory Of Computation 
Time:3 Hours Max Marks:70
Sno. Questions Marks

1 a Construct a DFA which accept a string of 0's and 1's contain 3 consecutive 0's. 2
b Construct a FA for following RE  (01)* + 0  and  (0+1)*. 2
c Suppose R be any regular expression than write down some identity rule of RE.. 2
d Define parse tree.Give one example. 2

e Explain about the normal form of grammar.. 2
2 a Design a DFA accept a language L{w | w has both an even number of 0's and even number of 1's} 5
OR
3 a
Construct a DFA for given FA with all tuples.

                                     


4 a Convert given FA into DFA with all tuples.
5
OR
6 a
Define regular expression with example.Prove that following.

7 a Construct a DFA for (01* + 1) with complete tuples.

5
9 a
Construct a DFA for (a+b)*abb with complete tuples.

5
10 a
Consider an automata M1 and M2 are given

Suppose R1 ia a R.E which is accepted by M1 and R2 be any R.E which is accepted by M2. Construct an DFA for (R1 U R2).

10
11 a
Explain about Arden's Theorem.Apply in the given example.


10
12 a
Construct a regular expression(R.E) by given finite automata using Arden's theorem.



10
14 a
Construct a regular expression(R.E) by given finite automata using Arden's theorem.






10

Model Paper- I | Theory of computation


B.Tech CSE III Semester Model Paper
Theory Of Computation 
Time:3 Hours Max Marks:70
Sno. Questions Marks

1 a What is Finite Automata ? with example. 2
b What is the difference beteween NDFA and DFA ? 2
c Explain why we use Null move or epsilon move. 2
d Define regular expression.Give one example. 2

e Difference between kleen closer and positive closer 2
2 a Define all tuples of given diagram and find whether 011,0111 is accepted or not.

5
OR

3 a
Write down the formal definition of Non deterministic finite automata. If input string is 0100 than check whether it is accepted or not for given diagram.


4 a Explain about deterministic finite automata (DFA) and write down the condition of DFA.Give one example with all tuples. 5
OR
6 a
Convert the given Non deterministic finite automata to deterministic finite automata.


7 a Convert the given Non deterministic finite automata to Deterministic finite automata.

5
9 a Construct a DFA which accept string of 0's and 1's end with substring 00 and write all tuples.

5
10 a Construct a DFA which accept a string of a's and b's start and end with a and write all tuples.

10
11 a Construct a DFA which accept a string of a's and b's contains even number of a's followed by odd number of b's and write all tuples. 10
12 a Construct a DFA which accept number (integer) divisible by 2 or multiple of 2. 10
13 a Construct a DFA which accept number (integer) divisible by 2 or multiple of 2.


10