aglasem.com
Schools Admission Mock Test Playground
ClassChoose class
StateSelect state

PU CET PG 2017 Question Paper MSc_HS__Computer Science_

Download the PU CET PG 2017 Question Paper MSc_HS__Computer Science_ PDF for free at AglaSem. Solving this previous year question paper helps you understand the real PU CET PG exam pattern, question types, difficulty level and marking scheme, and reveals important repeated topics — practise it to build speed, accuracy and exam confidence. More Detail
PU CET PG 2017 Question Paper MSc_HS__Computer Science_ - Page 1 of 10

Finished viewing? Save it for later —

Download PU CET PG 2017 Question Paper MSc_HS__Computer Science_ (PDF · 10 pages)
Downloaded 17 times

About PU CET PG 2017 Question Paper MSc_HS__Computer Science_

PU CET PG 2017 Question Paper MSc_HS__Computer Science_ is available here for free download. Published by Punjab University for PU CET PG, this question paper can be viewed online or downloaded as a PDF (10 pages). Candidates preparing for PU CET PG can use PU CET PG 2017 Question Paper MSc_HS__Computer Science_ to understand the exam pattern, the type of questions asked, and the overall difficulty level.

Frequently Asked Questions

How can I download PU CET PG 2017 Question Paper MSc_HS__Computer Science_?

Open this page and click the Download button to save PU CET PG 2017 Question Paper MSc_HS__Computer Science_ as a PDF. It is completely free on AglaSem Docs.

Is PU CET PG 2017 Question Paper MSc_HS__Computer Science_ free to download?

Yes. PU CET PG 2017 Question Paper MSc_HS__Computer Science_ can be viewed online and downloaded as a PDF free of cost on AglaSem Docs.

How many pages does PU CET PG 2017 Question Paper MSc_HS__Computer Science_ have?

PU CET PG 2017 Question Paper MSc_HS__Computer Science_ contains 10 pages, which you can read online or download together as a single PDF.

Where can I find more PU CET PG study material?

You can find more PU CET PG question papers, sample papers, syllabus, and answer keys on AglaSem Docs.

PU CET PG 2017 Question Paper MSc_HS__Computer Science_ – Text

Read the full text of this question paper below — useful to quickly search, copy and reference the content online without downloading the PDF.

📄 View text version (10 pages)

Page 1

MSc(HS)(Computer Science)
1. Reusable optical storage will typically have the acronym ………..
A. CD
B. DVD
C. ROM
D. RW
2. IC chips used in computers are made of
A. Silicon
B. Chromium
C. Lead
D. Silver
3. Blue tooth technology allows:
A. Landline phone to mobile phone communication
B. Wireless communication between equipments
C. Signal transmission on mobile phones only
D. Satellite television communication
4. Which of the following is not an example of Operating System?
A. Microsoft Office
B. Windows Vista
C. Unix
D. Ubuntu Linux
5. '.MPG' extension refers to:
A. Word file
B. Text file
C. Image file
D. Movie file
6. Round robin scheduling is essentially the pre-emptive version of ________ ?
A. FIFO
B. Shortest job first
C. Shortest remaining
D. Longest time first
7. What is a shell ?
A. It is a hardware component
B. It is a command interpreter
C. It is a part in compiler
D. It is a tool in CPU scheduling
8. In the blocked state ___________?
A. the processes waiting for I/O are found
B. the process which is running is found
C. the processes waiting for the processor are found
D. none of the above

Page 2

9. Identify which is not the state of the process?
A. Blocked
B. Running
C. Ready
D. Privileged
10. The number of processes completed per unit time is known as__________ ?
A. Output
B. Throughput
C. Efficiency
D. Capacity
11. The term used to describe the intangible instructions that tell the computer what to do is:
A. hardware
B. software
C. storage
D. input/output
12. Which of the following has the smallest storage capacity?
A. zip disk
B. hard disk
C. floppy disk
D. data cartridge
13. The level of data abstraction which describes how the data is actually stored is?
A. Physical level
B. Conceptual level
C. Storage Level
D. File level
14. The overall logical structure of data base can be expressed graphically by?
A. Data flow chart
B. Flow chart
C. Directed Graph
D. Entity relationship diagram
15. In an object oriented model, one object can access data of another object by passing?
A. Instance variable
B. Variable
C. Message
D. Function
17. The SQL, DDL, CREATE commands are ________ .
A. Schema, Base and Table
B. Key, Base and Table
C. Base, Table and Schema
D. Schema, Table and View
18. POP3 and IMAP are e-mail accounts in which

Page 3

A. One automatically gets one’s mail everyday
B. One has to be connected to the server to read or write one’s mail
C. One only has to be connected to the server to send and receive email
D. One does not need any telephone lines
19. The octal number system consists of the following symbols:
A. 0 – 7
B. 0 – 9
C. 0 – 9, A – F
D. None of the above
20. If (y)x represents a number y in base x, then which of the following numbers is smallest of all
?
A. (1111)2
B. (1111)8
C. (1111)10
D. (1111)16

21. High level programming language can be converted to machine language using which of the
following?
A. Oracle
B. Compiler
C. Mat lab
D. Assembler
22. The binary equivalent of (–15)10 is (2’s complement system is used)
A. 11110001
B. 11110000
C. 10001111
D. None of these
23. 1 GB is equal to
A. 230 bits
B. 230 bytes
C. 220 bits
D. 220 bytes
24. The PSTN is an example of a ..................... network.
A. packet switched
B. circuit switched
C. message switched
D. None of these
25. Each packet is routed independently in...................
A. virtual circuit subnet
B. short circuit subnet
C. datagram subnet
D. ATM subnet
26. For a connection oriented service, we need a...............

Page 4

A. virtual circuit subnet
B. short circuit subnet
C. datagram subnet
D. wireless subnet
27. Which type of switching uses the entire capacity of a dedicated link?
A. circuit switching
B. datagram packet switching
C. virtual circuit packet switching
D. message switching
28. Representation of data structure in memory is known as:
A. Recursive
B. Abstract data type
C. Storage structure
D. File structure
29. An ADT is defined to be a mathematical model of a user-defined type along with the
collection of all ____________ operations on that model
A. Cardinality
B. Assignment
C. Primitive
D. Structured
30. Correct hierarchical relationship among context- free, right-linear, and context-sensitive
language is
A. context-free ⊂ right-linear ⊂ context-sensitive
B. context-free ⊂ context-sensitive ⊂ right-linear
C. context-sensitive ⊂ right-linear⊂ context-free
D. right-linear ⊂context-free ⊂context-sensitive
31. In the following grammar :
x::=x ⊕y| 4
y::=z*yI2
z : : = id
Which of the folowing is true ?
A. ⊕ is left associative while * is right associative
B. Both ⊕ and * are left associative
C. ⊕ is right associative while * is left associative
D. None of these
32. In multicast routing with spanning tree method, a network with n groups, each with an
average of m members requires for each group ....................
A. n pruned spanning trees must be stored for a total of mn trees
B. m pruned spanning trees must be stored for a total of m trees
C. n pruned spanning trees must be stored for a total of n trees
D. m pruned spanning trees must be stored for a total of mn trees

Page 5

33. To do multicast routing, each router computes a.....................
A. Binary tree
B. AVL tree
C. Spanning tree
D. None of these
34. Well -defined groups that are numerically large in size but small compared to the network as
a whole are used in.......................
A. Unicast routing
B. Multicast routing
C. Broadcast routing
D. Telecast routing
35. The processes that keep track of hosts whose home is in the area, but who currently visiting
another area is.................
A. Home agent
B. Mobile agent
C. Foreign agent
D. User agent
36. ADG is said to be in Chomsky Form (CNF), if all the productions are of the form A --> BC
or A --> a. Let G be a CFG in CNF. To derive a string of terminals of length x , the number of
productions to be used is
A. 2x - 1
B. 2x
C. 2x + I
D. None of these
37. In software cost estimation, base estimation is related to:
A. Cost of similar projects already completed.
B. Cost of the base model of the present project.
C. Cost of the project with the base minimum profit.
D. Cost of the project under ideal situations.
38. Amdahl’s law states that the maximum speedup S achievable by a parallel computer with ‘p’
processors is given by:
A. S≤ f+(1-f)/p
B. S≤ f/p+(1-f)
C. S≤ 1/[f+(1-f)/p]
D. S≤ 1/[1-f+f/p]
39. With reference to cluster analysis in data mining, a distance measure that is NOT used is:
A. Euclidean distance.
B. Manhattan distance.
C. Chebychev’s distance.
D. Lee distance.
40. In a mobile communication system, a geographic region is divided into cells. For each
frequency set, there is a buffer ............... wide where that frequency is not used.

Page 6

A. one-cell
B. two-cells
C. three-cells
D. four-cells
41. Identify the incorrect statement:
A. The overall strategy drives the e-commerce data warehousing strategy.
B. Data warehousing in an e-commerce environment should be done in a classical manner.
C. E-commerce opens up an entirely new world of web servers.
D. E-commerce security threats can be grouped into three major categories.
42. Water fall model for software development is:
A. A top down approach.
B. A bottom up approach.
C. A sequential approach.
D. A consequential approach.
43. In software development, value adjustment factors include the following among others:
A. The criticality of the performance and reusability of the code.
B. Number of lines of code in the software.
C. Number of technical manpower and hardware costs.
D. Time period available and the level of user friendliness.
44. If x is an array of interger, then the value of &x[i] is same as
A. &x[i-1] + sizeof (int)
B. x + sizeof (int) * i
C. x+i
D. none of these
45. Which of the following is incorrect statement about packages?
A. Package defines a namespace in which classes are stored.
B. A package can contain other package within it.
C. Java uses file system directories to store packages.
D. A package can be renamed without renaming the directory in which the classes are stored.
46. What is the output of this program?
Package pkg;
class output {
public static void main(String args[])
{
StringBuffer s1 = new StringBuffer("Hello");
s1.setCharAt(1, x);
System.out.println(s1);
}
}
A. xello
B. xxxxx
C. Hxllo
D. Hexlo

Page 7

47. Which method can be defined only once in a program?
A. main method
B. finalize method
C. static method
D. private method
48. Arrays in Java are implemented as?
A. class
B. object
C. variable
D. None of the mentioned
49. Which of the following statements are incorrect?
A. Static methods can call other static methods only.
B. Static methods must only access static data.
C. Static methods can not refer to this or super in any way.
D. When object of class is declared, each object contains its own copy of static variables.
50. Database __________ , which is the logical design of the database, and the database
_______,which is a snapshot of the data in the database at a given instant in time.
A. Instance, Schema
B. Relation, Schema
C. Relation, Domain
D. Schema, Instance.
51.Course(course_id,sec_id,semester)
Here the course_id,sec_id and semester are __________ and course is a _________ .
A. Relations, Attribute
B. Attributes, Relation
C. Tuple, Relation
D. Tuple, Attributes
52. A domain is atomic if elements of the domain are considered to be ____________ units.
A. Different
B. Indivisbile
C. Constant
D. Divisible
53.The percentage of times a page number is found in the Table Look aside Buffer is known as :
A. miss ratio
B. hit ratio
C. miss percent
D. None of these
54. Which one of the following is the deadlock avoidance algorithm?
A. banker’s algorithm
B. round-robin algorithm
C. elevator algorithm

Page 8

D. karn’s algorithm
55. In Segmentation the segment base contains the :
A. starting logical address of the process
B. starting physical address of the segment in memory
C. segment length
D. None of these
56. Time quantum is defined in
A. shortest job scheduling algorithm
B. round robin scheduling algorithm
C. priority scheduling algorithm
D. multilevel queue scheduling algorithm
57. Inter process communication :
A. allows processes to communicate and synchronize their actions when using the same address
space.
B. allows processes to communicate and synchronize their actions without using the same
address space.
C. allows the processes to only synchronize their actions without communication.
D. None of these
58. _______ is used to store data in registers .
A. D flip flop
B. JK flip flop
C. RS flip flop
D. none of these
59. What is the output of this program?
#include <iostream>
using namespace std;
int main()
{
int a;
a = 5 + 3 * 5;
cout<< a;
return 0;
}
A. 35
B. 20
C. 25
D. 40
60. What is the output of this program?
#include <iostream>
using namespace std;
int main()
{
int a = 5, b = 6, c;
c = (a > b) ?a : b;

Page 9

cout<< c;
return 0;
}
A. 6
B. 5
C. 4
D. 7
61. What is meaning of following declaration?
int(*p[5])();
A. p is pointer to function.
B. p is array of pointer to function.
C. p is pointer to such function which return type is array.
D. p is pointer to array of function.
62. What is size of generic pointer in C++ (in 32-bit platform) ?
A. 2
B. 4
C. 8
D. 0
63. How many successors are generated in backtracking search?
A. 1
B. 2
C. 3
D. 4
64. What is the space complexity of Depth-first search?
A. O(b)
B. O(bl)
C. O(m)
D. O(bm)
65. DFS is ______ efficient and BFS is __________ efficient.
A. Space, Time
B. Time, Space
C. Time, Time
D. Space, Space
66. General algorithm applied on game tree for making decision of win/lose is ____________
A. DFS/BFS Search Algorithms
B. Heuristic Search Algorithms
C. Greedy Search Algorithms
D. MIN/MAX Algorithms
67. In case of, Zero-address instruction method the operands are stored in _____ .
A. Registers
B. Accumulators
C. Push down stack

Page 10

D. Cache
68. The addressing mode which makes use of in-direction pointers is ______ .
A. Indirect addressing mode
B. Index addressing mode
C. Relative addressing mode
D. Offset addressing mode
69. The effective address of the following instruction is , MUL 5(R1,R2)
A. 5+R1+R2
B. 5+(R1*R2)
C. 5+[R1]+[R2]
D. 5*([R1]+[R2])
70. The instruction, MOV AX, 1234H is an example of
A. register addressing mode
B. direct addressing mode
C. immediate addressing mode
D. based indexed addressing mode
71. The addressing mode that is used in unconditional branch instructions is
A. Intrasegment direct addressing mode
B. Intrasegment indirect addressing mode
C. Intrasegment direct and indirect addressing mode
D. Intersegment direct addressing mode
72. The set O of odd positive integers less than 10 can be expressed by ___________ .
A. {1, 2, 3}
B. {1, 3, 5, 7, 9}
C. {1, 2, 5, 9}
D. {1, 5, 7, 9, 11}
73. Power set of empty set has exactly _____ subset.
A. One
B. Two
C. Zero
D. Three
74. What is the Cartesian product of A = {1, 2} and B = {a, b}?
A. {(1, a), (1, b), (2, a), (b, b)}
B. {(1, 1), (2, 2), (a, a), (b, b)}
C. {(1, a), (2, a), (1, b), (2, b)}
D. {(1, 1), (a, a), (2, a), (1, b)}
75. In SQL, the statement select * from R, S is equivalent to
A. Select * from R natural join S
B. Select * from R cross join S
C. Select * from R union join S
D. Select * from R inner join S

Document Details

Board / OrgPanjab University
ExamPU CET PG
TypeQuestion Paper
Pages10
Updated22 Jul 2026