Guru Nanak Dev University Data Structures 2011 Question Paper

Guru Nanak Dev University
B.Sc Information Technology
Data Structures
2011 Question Paper
Time:3 Hrs
Minimum Marks: 100.
Note:-Attempt any FIVE questions carry equal marks.
1. Differentiate binary search from linear search along with the discussion on time complexities of both the algorithms in best, average and worst cases. Write an algorithm for searching an element using binary search. Also discuss the procedure of binary search by taking suitable example. 20
2. Write advantages and disadvantages(if any) of priority queues Discuss the memory representation of priority queues. Write' an algorithm to insert and delete an element from a priority queue. 20
3. (a) List out any three applications of linked list and any three advantages of double Ended linked list over singled linked list. 12
(b) Define recursion and explain it using suitable example.
Give at least three differences between iteration and recursion. 8
4. (a) Discuss the representation of 3-dimensional array in memory with the help of suitable example. 6
(b) Construct a binary tree for: ((6+(3-2)*5)^2+3). 6
(c) Briefly discuss various types of linked lists. 8
5. (a) Given a Postfix Expression :12,7,3,-,/,2,1,5,+,*,+.
Discuss the procedure to translate this post-fix expression using STACK. 10
(b) Write an algorithm for deletion of a node in the stored linked list. 10
6. (a) Discuss the memory representation of graphs. 10
(b) Write an algorithm for finding the shortest path between two nodes of a graph. 10
7. What is binary search tree? Write an algorithm for deletion of a node from binary search tree. 20
8. Write short notes on the following:
(a) Bubble Sort
(b) Time and Space complexity
(c) Depth-first search. 20 

GNDU Object Oriented Programming Using C++ 2011 Question Paper

Guru Nanak Dev University
B.Sc Information Technology
Object Oriented Programming Using C++
2011 Question Paper
Time:3 Hrs
Minimum Marks:100.
Note:-Attempt any FIVE questions carry equal marks.
1. Explain various control statements of c++ with examples. 20
2. Differentiate between function and operator overloading. Also give one example of each. 20
3. (a) Differentiate between:
(1) Call by value and call by reference.
(2) Structure and union. 10
(b) What is recursion? Explain with the help of an example. 10
4. (a) Explain various storage class specifiers of c++. 10
(b) What is string? write a program to enter a line of text and count how many vowels are there. 10
5. (a) What do you mean by inheritance? Give example of single inheritance. 10
(b) Explain various types of files available in c++. What operations can be performed on a file? give suitable examples. 10
6. (a) What do you mean by constructor? Write main characteristics of a constructor. How it is defined? 10
(b) Describe the use of friend function in c++ with examples. 10
7. Define Polymorphism. Explain its types. How polmorphism is implemented in c++? Give suitable examples. 20
8. Explain the following features of C++:-
(a) Classes and objects
(b) Enumerations
(c) Virtual functions
(d) File stream classes. 20 

Computer Architecture GNDU 2011 Question Paper

Guru Nank Dev University
B.Sc Information Technology
Computer Architecture
2011 Question Paper
Time:3 Hours
Minimum Marks:100.
Note:-
(1) There are total EIGHT questions. Candidates are required to attempt any FIVE. All questions carry equal marks.
(2) The students can use only Non-programmable and non-storage type calculator.
1. (a) Explain fixed point and floating point representation of numbers in computer systems.
(b) Explain various arithmetic operations performed by a computer system. Also design and explain the working of a 4-bit arithmetic circuit.
2. Discuss the timing and control signals in a computer.
3. Explain and differentiate the working of hardwired and micro-programmed control unit.
4. What is virtual memory? Discuss the implementation of virtual memory.
5. Explain various modes of transfer during input-output operations.
6. (a) Explai SISD,SIMD,MISD and MIMD computer architectures.
(b) What do you mean by vector processing? Explain.
7. (a) Explain the working of assciative memory.
(b) Discuss different memory reference instruction.
8. Write a short note on the following:-
(a) Alphanumeric codes
(b) Shift micro-operations
(c) I/O processor
(d) Register transfer. 

Guru Nanak Dev University Data Structure and File Processing 2011 Question Paper

Question Paper from Guru Nanak Dev University
Course: B.Sc Information Technology
Data Structure and File Processing - The Subject of this question paper
2011 Question Paper - The year of the question paper asked
Time : 3 hours.
Maximum Marks : 100.
Attachment Type : Text
Version  : Original Version.

UNIT-1
1. (a) Explain linear as well as non-linear data structures along with various operations performed
on them. 12
(b) Discuss briefly the following terms:
(1) Complexity of an algorithm
(2)Time-space tradeoff of algorithm. 8
2. What is binary search? what conditions should be kept in mind before perorming Binary
search? Explain how Binary Search is performed with the help of an example. 20
UNIT-2
3. How Array is implemented in the memory? Write an algorithm that performs insertion an a sorted array. Also determine its complexity. 20
4. What is linked list? How it is represented? Write an algorithm to delete a node in the linked list.
Explain this process with the help of an example. 20
UNIT-3
5. What is Queue? How it is implemented in the memory? Write an algorithm to explain the process of Insertion as well as Deletion of an element from a queue. 20
6. What is Binary Search Tree? How it is different from Binary tree? Explain the process of inserting a new node into a Binary Search tree with the help of an example. 20
UNIT-4
7. What is Graph? Describe its sequential representation. Explain the method of depth-First search
using an example. 20
8. (a) Explain the following terms associated eith file structure:
(1) Master File
(2) Transaction File
(3) Report File
(4) Back-up File
(5) work File. 5
(b) Explain Index Sequential files. Write down the advantages and disadvantages of this file organization. 15