May 06 2006, PTU Joint Campus Placement at Chitkara Institute of Engg and
Tech.
Those guys will give u the same paper. They haven't changed it since July 2,
2001... coz that was the date written on top of every sheet! There's no negative
marking in this paper.
The programming section differed as given in that paper and my paper had 3
questions. All were based on a graph whose Adjacency matrix was given. The graph
consisted of various cities of india and it told about the various air routes
existing among the cities. The programming has to be done in C, its mentioned
there.
1) 5 fill in the blanks. A code with empty blanks and comments was given and we
had to fill in the code based on those comments. Its easy, even if u have the
basics right.
2) Had to write a function which printed the city with max and min connectivity
and took only the adjacency matrix as its argument. Very simple, just sum the
values in the row, then print the cities having max and min values u just
calculated.
3) The graph was modified in this question and the edges were assigned weights.
We had to write a function which printed the cities having the heaviest edges
connected to them and also their weights. You should know how to make the weight
matrix for this question...
tip: guys at Persistent like Trees, Graphs and Matrices.
The paper consists of 2 test.
Test 1 -- consists of only technicalobjective questions, It has six sections &
each have 5 Qns.
THe sections are --
1. C Programming( in which some C Qns are there)
2. Theory ( Qns from Compiler toc etc.)
3. General( Qns from probability etc.)
4. OS(Qns from OS, like 5 processes are given with their burst & some scheduling
policy is also given, now find out when process P is completed)
5. Database ( Qns from Normalisation, Transactions etc)
6. Data Structures
Qns are pretty simple. one Knowing only the basics can be able to clear the
exam. Just go through C language part in some detail.
Test 2--- Consist of only 1 Qn for program. In this we have to make a C program.
Qn is that there is a binary tree , a node having three pointers -- Left child,
right child, parent. Now the problem is to delete the tree in top-down fashion
ie First delete parent & then child.
In previous paper, the Qn ask in this section is that---
To take a string from the User & then arrange the characters in that string in
ascending order like if user enters "babcac" the program should print it as
"aabbcc"
The test is very simple just go thru the basics of OS, DBMS & data structures. &
concentrate over C programming. It is very essential.
