24/06/2016 College Lecturer Exam ComputerScienceII
1/52
Rajasthan Public Service Commission 2016
Paper ComputerScienceII
Ques: 150
Time: 3 Hours
Ques
In how many ways can 6 people be seated around a round tabel? Two arrangements are equvalent if relative
position of all pairs is same:1)
720
240
36
120
6 ..... .. ... ... .. ...... ...... ..... .. ... .... .. .. .... .... .... .., .... ........ .. .......
..... .. ...... ....... .... ..
720
240
36
120
Ques
Given a relation R on a set A The minimum number of ordered pairs that must be
added to R so that, R becomes an equivalence Relation is
Four
Five
Six
Seven
...... A .. .. ....... R ..... ... .. ....... ...... ...... R ... .... ....
...... .. ..... R .. ....... (...........) ....... .. ....
...
....

...
Ques
A function is invertible, if it
One One
Onto
Both one one
and onto
Neither oneone
nor onto
.. ... ........... .... .. .... .. ..
...... (....)
.......(.. ..)
...... ... ....... .....
.. ... ...... .. .. ... .......
Ques
Let S be a set of n elements . The number of ordered pairs in largest and smallest equivalence relation on set S

24/06/2016 College Lecturer Exam ComputerScienceII
2/52
are respectively



.... S .. n ..... .. ...... .. S .. .. ....... (...........) ....... ... ...... ....... .. .......
... ....... ...... ..... ....



Ques
(PRE POST
(PRE POST
(PRE POST
(PRE POST

24/06/2016 College Lecturer Exam ComputerScienceII
3/52
(PRE POST
(PRE POST
(PRE POST
(PRE POST
Ques
Choose an invalid property of a minimum spanning tree extracted from a connected graph G of n vertices:1)
T has n1
edges
T has n vertices
T is connected
R has n/2 edges
.. n ....... .. ........ .... .. ...... ... ......... .. T .. .... ......... ....... .. ... ...
T ... n1
.... ....
T .. n ...... .....
T ........ ....
T ... n/2 .... ....
Ques
A regular expression that denotes a language comprising all possible strings of even length over the alphabet
is




.. ...... ......... .. ... .. ...... .. ..... .... ......., .. ........ .. ... .. .. ....... ..





24/06/2016 College Lecturer Exam ComputerScienceII
4/52
Ques
Choose the statement that best defines the relationship among type o
Language context free language
regular languages(Lr) and context sensetive language(Lcs):1)



....o
........(Lo), ........... ... ........ ...... ........(Lr) ... ........... .......... ........(Lcs) ..
.... ....... .. .......... .... .... ........ ... ..



Ques
Given the language L ab, aa, baa} which of the following strings is not in
abaabaaabaa
aaaabaaaa
baaaaabaaaab
baaaabaa
... .. ........ L ab, aa, baa} .. .... ...... ... .. ..... ..... ... ..... ..
abaabaaabaa
aaaabaaaa
baaaaabaaaab
baaaabaa
Ques :10
Context Free
Regular but not context free
Neither Context free nor regular
Both regular and context free
........... ....
...... ...... ........... .... .....
.. ........... .... .. .. ......
........... .... .. ...... .....
Ques :11


24/06/2016 College Lecturer Exam ComputerScienceII
5/52







Ques :12
Choose a false statement
Greedy approach is based on local optimal solution .
Greedy approach is faster than dynamic programming.
Greedy approach examines all feasible solutions.
MST prim's algorithm is based on greedy approach
..... ... ......
..... ..... ....... ........ ......, .. ....... .. .
..... ....., ........ .......... .. ... .. .
..... ..... ... .... ........ .. ...... .... .. .
MST ... ....... ........... ..... ..... .. ....... ..
Ques :13
Which of the following algorithm design technique is used in designing quick sort algorithm
Dynamic programming method
Back tracking strategy
Divide and conquer strategy
Greedy strategy
..... ..... ........... .. .... ... ..... ........... .... ..... ..... ... ... .. ..
........ .......... ....
... ... .... ..........
....... .... ..... ..........
..... ..........
Ques :14

24/06/2016 College Lecturer Exam ComputerScienceII
6/52
DEBAC
DBEAC
EDABC
DEABC
DEBAC
DBEAC
EDABC
DEABC
Ques :15
ABCD
BACD
BADC
ABDC

24/06/2016 College Lecturer Exam ComputerScienceII
7/52
ABCD
BACD
BADC
ABDC
Ques :16
Which of the following is an all pair shortest path algorithm of graphs
Bellman Ford
algorithm
Ford Fulkerson
algorithm
Floydwashall
algorithm
Dijkstra's algorithm
...... ... .. ..... .... .. ..... ..... ..... .. (.. .... ........ ...) ........... ..
.........
.. ..........
.......
...... ..........
...... ......
..........
............ ..........
Ques :17
Which of the following is not a method of obraining hash function
Random probing
Folding
Truncation
Modular Arithmetic
...... ... .. ..... ... ... ..... .. ...... ..... ..
..... ........
........
.......
........ ..........
Ques :18
Which of the following is not a collision resolution technique in hash table using linear open addressing
Rehashing
Clustering
Quarditic probing
Linear probing
...... ... .. ....., ........ ... ........ ... .... .. ......
..... ........... ..... ..... ..
.........

24/06/2016 College Lecturer Exam ComputerScienceII
8/52
...........
............. ........
........ ........
Ques :19
The average number of comparisions performed in sequencial search on a list of n elements is


2

n ..... .. .. ..... .., ........... .... ...... .... .... .... ......( ...........) .. .......
(.....) ..


2

Ques :20
Which of the following statements is not valid about binary search

It constructs a Binary search tree.
It is applicable only on a sorted list
It uses divide and conquer strategy.
....... .... .. .... ... ...... ... .. ..... ... ..... ..... ..
.. .. ....... .... .... .. ........ .... ..
.. .... .......... ....) ..... .. ... ..... .... ..
.. ....... .... ..... ......... ... .. .... ..
Ques :21
The number of swappings needed to sort the number in ascending order using bubble sort is
3
5
7
10
... ..... .......... .. ..... .. ....... .. .... ... ... ....... .... .. .... ......
....
..... (.........) .....:1)
3
5
7
10
Ques :22
In context of problem classes, which of following statement is not valid


24/06/2016 College Lecturer Exam ComputerScienceII
9/52


....... ....... .. ....... ... ...... ... .. ..... ... ..... .... ..



Ques :23
Let L1 is an NP complete
problem, another problem L2 will also be an NPcompete
problem if



.... L1 .. NP complete
...... ..| .... ...... L2 .. NP complete
...... .... ....



Ques :24
Which of the following problems is not an NPcomplete
class problem?
3CNFSAT
Problem
Vertex cover problem
Depth First
search
of graph
Clique problem
...... ....... ... .. ..... NPcomplete
..... .. ...... ..... ..
3CNFSAT
......
...... ... ......
.... ... ..... ...... ....
..... ......
Ques :25
A relation in which every nonkey
attribute is fully functionally dependant on primary key and has no
transitive dependency, is in
BNCF
2NF
3NF
4NF
.. ... ....... ..... .. ........ ....... ........ ..... .. " ....... ......... ........" .... .. ... .....
... ........ ........... .... .... .. .. .... ..
BNCF ..

24/06/2016 College Lecturer Exam ComputerScienceII
10/52
2NF ..
3NF ..
4NF ..
Ques :26
BCNF
2NF
3NF
4NF
BCNF
2NF
3NF
4NF
Ques :27
Which of the following operation requires two tables as input and the two table must have one common
column?
Division
Join
Projection
Cartesian product
............. ... .. .... ...... ... .. ......... ..... .... .. ... ..... ......... ... .. ......... ...... ..
.... ...... ..
........
....
.........
......... .......
Ques :28
Intersection operation on two relations R1 and R2 of data base is
Associative but not commutative
Commutative but not Associative
Both Associative and Commutative
Neither Associative nor commutative
....... .. .. ....... R1 ... R2 .. ......../ ......... ...... .. ....... ..
....... ...... ... ......... .....
... ......... ...... ....... .....
....... ... ... ........ .....
.. ... ....... ... .. ... ... ........

24/06/2016 College Lecturer Exam ComputerScienceII
11/52
Ques :29
If relation R1 has P atrributes and m tuples and relation R2 has q attributes and n tuples, then relation R1 X
R2 has .........attributes and .........tubles.




.... R1 ....... ... P ....... ... m ... .. ... R2 ....... ... q ....... ... n ... .. .. ....... R1xR2 ...
........ ....... ... ........ ... .....




Ques :30
In ER
model when subgroups of a given entity type are defined, this is known as
Aggregation
Inheritance
Specialization
Generalization
ER
.... ... .. ..... ........ ..... .. .... ......(......) .......... ..... .... .. .. .. ...... ..
........
.............
..............
...........
Ques :31
Cardinality ratio strong entity set weak entity set' in their binary identifying relationship is
one toone
Onetomany
Manytoone
Manytomany
.... ....... ............. ........... ... ............ ......(. ........... .......) '..... ........ ...:
... ........ ...' .... ..
......
.. ..
...
... ..
..
... ..
...
Ques :32
In ER
diagram is
represented by dashed ellips
Multivalued attribute
Composite attribute
Derived attribute
Complex attribute
ER ..... ... ..
..... ........... .. ....... .... ..

24/06/2016 College Lecturer Exam ComputerScienceII
12/52
............. ..........
........(....) ..........
.........(..........)..........
.......... (.......) ..........
Ques :33
SELECT ecode FROM EMPLOYEE WHERE;
is an SQL query to retrieve ecode of employees whose
address contains Following completes the query:1)
addresss LIKE
address
address AS
address LIKE
SELECT ecode FROM EMPLOYEE WHERE .. SQL ....... .. ............ .. ecode .......
.. ..... .... ... ... .. ...... .. ....... .. ..... .... ..
addresss LIKE
address
address AS
address LIKE
Ques :34
What will be retrieved by following SQL query SELECT ecode FROM EMPLOYEE WHERE Salary>=
ALL(SELECT salary FROM EMPLOYEE);
ecode of employees getting maximum salary
ecode of all employees
ecode and salary of all employees
ecode and salary of employees getting maximum salary
...... SQL ....... ...... .... ...... .... SELECT ecode FROM EMPLOYEE WHERE salary
ALL (SELECT salary FROM EMPLOYEE);
....... .... .... ............ .. ecode
... ............ .. ecode
... ............ .. ecode ... salary
....... .... .... ............ .. ecode ... salary
Ques :35
SQL command used to change attribute values of one or more selected tuples is
MODIFY
UPDATE
INSERT
ALTER
.. .. ..... ...... ..... .. ....... .. .... .. ........ .... .. .... ... ... ..... SQL .....
(....) ..
MODIFY
UPDATE
INSERT
ALTER
Ques :36

24/06/2016 College Lecturer Exam ComputerScienceII
13/52
To avoid duplicate tuples in result of an SQL query, we use
DISTINCT Keyword in SELECT clause
UNIQUE Keyword in SELECT clause
DISTINCT clause after WHERE clause
UNIQUE clause after WHERE clause
SQL ....... .. ..... ... .... ... .. ...... .. ..... .. .... .. ..... .... ..
DISTINCT ......., SELECT ..... ..
UNIQUE ......., SELECT ..... ..
DISTINCT ....., WHERE ..... .. ......
UNIQUE ....., WHERE ..... .. ......
Ques :37
Valid SQL query to know total number of tuples available is a relation
SELECT SUM(*)FROM Book;
SELECT NUMBER(*) FROM Book;
SELECT FROM Book;
SELECT FROM Book
....... Book ... ..... ..... .. ......... ..... .. .... ..... SQL ....... ..
SELECT SUM(*)FROM Book;
SELECT NUMBER(*) FROM Book;
SELECT FROM Book;
SELECT FROM Book
Ques :38
Which of the following is a pair of stable sorting algorithms?
Quick, Selection
Bubble Insertion
Heap, Bubble
Selection, Insertion
...... ... .. ..... ..... (......) ........ ............ .. ..... ..
....., .......
..., .......
.... ...
......., .......
Ques :39
In direct file organization
A collision always results into an overflow
A collision never results into an overflow
A collision may or may not lead to an overflow
A collision never occures
........ .... ..... (........... ...
...... .... ....... .. .... .... ..
...... ... .. ....... .. .... ..... .... ..
...... ....... .. .... .. .. .... .. .. ..... ..
...... ... ..... ..... .... ..

24/06/2016 College Lecturer Exam ComputerScienceII
14/52
Ques :40
All changes made by a transaction are made permanent in the database only after transaction
FINAL
ROLL BACK
ABORT
COMMIT
.. ........ ...... ..... .. ... ......... ....... ... ........ .. ....
.. ...... ..... ..... .... ..
FINAL(.....)
ROLL BACK(......)
ABORT(......)
COMMIT(....)
Ques :41
Lost update problem
Direct read problem
Incorrect summary problem
Unrepeatable read problem
..........
.......
... .... .......
........ ..... .......
............ .... .......
Ques :42
ACID properties of a transaction means
Atomicity, concurrency, Integrity, Durability
Atomicity consistancy Isolation Durability
Automatic, Concurrency, In consistancy Durability
Automatic consistancy, Integrity Degrade
........ .. ACID ....... .. ........ ..
.........., ........., ............, ..............
..........,........... ,........ ..............
........., ........., ............., ..............
........., ..........., ............, .......
Ques :43
A schedule in which transactions can neither read nor write an item X until the last transaction that wrote x
has commited or aborted. This type of schedule is called:1)
Recoverable
Cascadless

24/06/2016 College Lecturer Exam ComputerScienceII
15/52
Strict
Nonrecoverable
.. ....... ..... ........ .. .... .... x .. .. .... .... ..... .. .. .... .., .. .. .. ..
........ ..... ...... ... x .. ....., .. .. ..... .. .... .. ...... .. .... .. ..... .. ....... ......
..
.........
.........
........
...
.........
Ques :44
In context of database transactions, a 'wait for
graph'
is used for
Concurrency control
Dead lock prevention
Recovery
Dead lock detection
....... ........ .. ...... ... .. ......
....' ..... ..... .... ..
.......... ....... .. ...
...... ... ...... .. ...
........ .. ...
...... ... ..... .. ...
Ques :45
In context of compilers, a lexical analyser generates:1)
Syntax tree
Token stream
Regular expression
Intermidiate code
........ .. ....... ..., ........ ........ (... .........) ....... .... ..
......... ....
.... .......
........ ......... (......)
........... ...
Ques :46
The following function is not performed by a loader:1)
Allocation
Translation
Linking
Relocation
.. .... ...... ..... ..... .... ..
.......
.........
.......

24/06/2016 College Lecturer Exam ComputerScienceII
16/52
........
Ques :47
Which of the following is not a machine independent phase of compiler?
Code generation
Laxical Analysis
Snytax Analysis
Intermidiate code generation
...... ... .. ..... ........ .. .... .. ........(......) ... ..... ..
... ......
........ ........
......... ........
............ ... ......
Ques :48
An assembler is a system software that:1)
Assembles modules of high level language program
Translates assembly language program to machine language equivalent
Tanslate HLL program into object file
Converts a high level language program to assembly language
........ .. ....... ........ .. .. ...
....... ........ ....... .. ........ .. ....... .... ..
......... ........ ....... .. .... ........ .. .......... .... ..
.. ......... ........ ....... .. .......... .... ..
....... ........ .. ....... .. ......... ........ .. ..... ..
Ques :49
Which of the following term is not related to Bottom up
parsing
LR
Parser
Shift reduce
parser
Reduction and pruning
Recursive decent
parser
...... ... .. ..... .... ......
........ .. ......... ..... ..
....
......
.....
........ ......
........ ... ........
........ ..
.... ......
Ques :50
Choose a false statement about MACRO in context of an assembly language source code:1)
It is single line abbreviation for group of instructions
Macroname
is used as an operation mnemonic
Macro calls are replaced by Macro defination
Macro defination also appears in epanded source code

24/06/2016 College Lecturer Exam ComputerScienceII
17/52
......... ........ .. ..... ... .. ....... ... MACRO .. .... ... ..... ... .. ... .....
.. ..... .. .... .. .. ...... .......... ... ..
........ .. ..... ....... ..... (...... .........) ... ... ....... .... ..
.......... ..... ... ........ .. ........... .. ... .... ..
..... .. ........, ........... ..... ... .. .. .... ..
Ques :51
Resolving symbolic refrences when a program is loaded is main memory for execution is called:1)
Allocation
Linking
Relocation
Loading
.. .. ....... .. ........... .. .... ..... ....... (.... .......) ... ... ..... .... .. .. .......... ......
...... (........... ......... .........) .. ... .... ..
.......
.......
........
.......
Ques :52
YACC stands for
Yet Accepted compiler construction
Yet another compiler compiler
Yet Available compiler compiler
Yet Another compiler construction
YACC .. ........ ..
... ......... ........ ........
... ..... .........
.......
... ....... .........
.......
... ..... ...............
Ques :53
Consider various forms of a program code for code optimisation. It is possible to optimise:1)
Source code and intermidite code only
Intermidiate code and Target code only
Source code, Intermidiate code and Target code
Source code and Target code only
.. ....... ... .. ......... ..... .. ... ............(.......) .. ....... ... ...... ... ... .........
..... .. .... ..
.... ..... ... ... ............ ... ..
.... ............ ... .... ... ..
..... ..., ............ ... ... .... ... ..
.... ..... ... ... .... ... ..
Ques :54

24/06/2016 College Lecturer Exam ComputerScienceII
18/52
In context of laxical analyser generator tool choose a valid statement about lex.yy.c:1)
It is a document defining tool
It is a Lex language program
It is compiler of tool
It is C language program generated from a Lex program by Lex compiler.
........ ........ ...... ... "Lex" .. ...... ... lex.yy.c .. .... ... ..... ... .. ... ....:1)
.. "Lex" .. .......... .... .... ......... ..
.. "Lex" .... .. .. ....... ..
.. ... "Lex" .. ........ ..
.. "Lex" ........ . "Lex" ....... .. ....... (....... ..
Ques :55
Which of the following is a function of an Editor
Replace
Tracing
Gait
Watch
...... ... ..... .. . ... .. ..... ..
Replace(.......)
Tracing (.......)
Gait(...)
Watch(...)
Ques :56
Consider task T1: control execution speed T2: search a word, T3: delete a paragraph and T4: Track flow of
execution. Choose appropriate match
Debugger: T1,T4... ...... T2, T3
Debugger: T2,T3 ... ...... T1, T4
Debugger: T1,T3 ... ...... T2, T4
Debugger: T2,T4 ... ...... T1, T3
..... T1 ....... ........... .... ........ ;T2 :... .. ... T3 ........ .. ....... ... T4
........... .. ..... .. ... .... .. ...... ... ....... ...... .. ... ...
......: T1,T4 ... ...... T2, T3
......: T2,T3 ... ...... T1, T4
......: T1,T3 ... ...... T2, T4
......: T2,T4 ... ...... T1, T3
Ques :57
The least intuitive category among four categorities of Flynn's classification scheme for serial and parallel
computer architecture is
SISD
SIMD
MISD
MIMD

24/06/2016 College Lecturer Exam ComputerScienceII
19/52
...... ... ......... ........ ...... .... ..... .. ..... ....... .. ... .... ... .. .... .. ...
...... ..... .... .... .... ..
SISD
SIMD
MISD
MIMD
Ques :58
Mobility management task that ensures connectivity of mobile node to the network, when the node moves from
one cell to another cell, is
Adaptibility Management
Location management
Hand off Management
Switching Management
........... ...... ....., .. ...... ... .. ....... .. ............. .......... .... .. .. .. ... .. ... ..
...... ... ... .... .. ...... ..
............... ........ (......)
...... ........
...... ........
......... ........
Ques :59
In WLAN which of the following services is not provided by Distribution system
Association
Distribution
Authentication
Integration
WLAN ..., ...... ... .. ..... .... ......... ....... ...... ..... ..... .. .... ..
........
..............
...........
..........
Ques :60
WLAN security standard make use of IEEE802.1x, port based network access protocol, for the purpose of
Authentication protocol
Generaing Master Session key(MSK)
Both Authentication protocol and Generaing Master Session key(MSK)
Neither Authentication protocol nor Generaing Master Session key(MSK)
WLAN ............. .......... ....... ...... ........ IEEE802.1X .. ..... ...... ........ .. .... ....
..
.......... ........
...... .... ... ....... .... .. ...
.......... ........ ... ...... .... ... ....... .... .. ...
.. ... .. .......... ........ .. .. ... ...... .... ... ....... .... .. ...

24/06/2016 College Lecturer Exam ComputerScienceII
20/52
Ques :61
Components of ecommerce
business model includes A value propogation, competative enviorenment and
Revenue model II: Market strategy organizational development and management team
Only I
Only II
Both I and II
Neither I nor II
.....
.. ..... .... .. ..... ... ...... ..
....... ....., .................. ... ...... .... II:
........ ....... ..... ...... ... ...... ....
.... I
.... III
I ... II .....
.. ... I .. ... II
Ques :62
Consider a CSMA/CD network that transmits data at a rate of 100 Mbps (108 bits per second) over a 1 km
(kilometer) cable with no repeaters. If the minimum frame size required for this network is 1250 bytes, what is
the signal speed in the cable?
8000
10000
16000
20000
.. CSMA/CD ....... 100 Mbps (108 .... ..... .....) .. ... .. 1 km (.........) ..... .... ......
..... .......... ..... .. .... ....... .... .. .... .. ....... .. .... ....... .... .... 1250 ...... .. ..
.. .... ... signal speed ... .... ....
8000
10000
16000
20000
Ques :63
A virtual keyboard is diplayed on computer screen while using internet banking to avoid passwords captured
by and
other similar softwers
Adware
Cookie
Sniffer
Keylogger
.... .... ............. ..... ....... ........ .. ..... .. .... ........ ...... .. ..... ....
... ........ ...... .. ...... .....
.. ......... ..... .... ..
......
.....
......
.......
Ques :64
Have
a micro chip
embeded on
Smart card

24/06/2016 College Lecturer Exam ComputerScienceII
21/52
Credit card
Debit card
All of these
.. .. .......... ... ...(........) .... ..
....... .....
....... .....
...... .....
.... .. ...
Ques :65
Let sends a message to in an ecommerce
transaction . Security aspect nonrepudiation
in this
transaction means:1)
M must not be disclosed to anybody except to R
Preventing from denial, beign sender of M
M received to R is same as send by S
S and R are sure of each others identity
.... .. . ....
.. ....... ... .. ..... ........... .. ..... .. .. ...... .... " ...
............" .. .. .......... .... ....
M .... .. .. ...... .. .., ..... R ..
M .. ..... .... .. S .. ...... ... ......
R .. ...... M .... .... .. .... S .. ....... ....
S ... R .. ..... ... ..... .. .... .......... ..
Ques :66
In an ecommerce
transaction performed on Paytm
Which fo the following payment modes is not an epayment?
Cash on delievery payment
ewallet
payment
Debit card payment
Net banking payment
.......... .. ........... .. .....
.. ....... .., ...... ... .. ....., ...... .. ...... ....
... ..... ..
COD ......
......
......
........... ......
......
.... ......
Ques :67
Which ordered pair correctly represnts the data structures used in implementing graph traversing algorithms
BFS DFS
(Queue Stack
(Stack Queue
(Stack Stack
(Queue Queue
.... ...... .. .......... BFS ... DFS .. ........ ... ....... .... ....... .. ....... .... ...... .....
..
(Queue Stack

24/06/2016 College Lecturer Exam ComputerScienceII
22/52
(Stack Queue
(Stack Stack
(Queue Queue
Ques :68
In Data warehouse, OLAP operation that performs aggregation on data cube, either by dimension reduction
or by climbing up in concept hierarchy is
Pivot
Drilldown
Slice and dice
Roll up
........ .... ... ......... ........ .. ........ ...... ........... .. ...... .... ..... .. ........ ......
.... .... OLAP ...... ..
Pivot(.....)
Drilldown
(.. ......)
Slice and dice(...... .... ....)
Roll up(
.....)
Ques :69
In data mining kmeans
method is used for the purpose
Data cleaning
Data Reduction
Clustering by partiioning
Outlier detection
.... ........ ... k..
... ...... ...... ........ .... ..... ... ... .... ..
.... ..........
.... ........
........... ... .............
....... .........
Ques :70
Correlation analysis
Data cube aggregation
Smoothing data
Clustering
..
....... ........
....
..... ........
......... ....
...........
Ques :71
A multidimensional database schema with one central fact table and one table for each dimension is called:

24/06/2016 College Lecturer Exam ComputerScienceII
23/52
Snow flake
schema
Star schema
Fact constellation
schema
Hybrid schema
.. ............... ...... ..... .. ......... ..... .... ... .. ........ .. .. .... .... .., ...... ..

....
..... .......
..... .......
..... ........... .......
........ .......
Ques :72
Which of the following is not a measure of dispersion of data
Median
Range
Standard deviation
Variance
...... ... .. ..... ......./..... (...........) .. .... ..... ..
....... (.......)
......(...)
...../.... ...... (........ ........)
.....(...........)
Ques :73
Pumping lemma for regualr sets is used
Prove that certain sets are regular
Prove that certain sets are not regualr
Generate context free language
Generate context sensetive language
" ...... ... .. .... ....... ...." ..... ... .... .... ..
... ..... .. ...... .... .... .. ...
.. .... .... .. ... ... ... ..... ........ .... ..
........... .... ........ .....(.......) .... .. ...
........... .......... ........ ..... .... .. ...
Ques :74
For sampling of a large dataset ntuples
of D were divided into multiple disjoint subsets, then Random
sampling was applied an each subset to obtain a sample of D. Sampling of D is
Cluster sampling
Partial sampling
Stratified sampling
Ramdom sampling
.. .... .... ... D .. ........ .... D .. n ..
... .. .. .... .... ........ .....
.... ... ........ ..
..... ... ....... ........ .. ..... .......... .. D .. ..... ...... ..... .. .......... .......
....... .........
..... .........

24/06/2016 College Lecturer Exam ComputerScienceII
24/52
............ .........
.... .........
Ques :75
Which of the following is not a tier in threetier
architecture of dataware house?
Data warehouse server
OLEDB
OLAP server
Front end
client tool
...... ... .. ..... ........ .... .. 3 ..
... ...... .. .. ..... ..... ..
........ .... .....
OLEDB
OLAP.....
..........
..... .....
Ques :76
In a mobile network, a location management scheme conceptually consists of two operations namely and


Sort and search
Read and write
search and hand off
Search register /update
.. ...... ....... ... ...... .......... ..... ........ ... .. .. ....... .. .... ..
..... ... ....
.... ... ....
.... ... .... ..
.... ... ......./.....
Ques :77
In mobile networks state or false location management assists in establishing newconnection
II: Handoff
ensure connectivity of mobile node to the network
Itrue
and II false
Itrue
and II true
Ifalse
and II true
Ifalse
and II false
...... ....... ... .... .... ..... .....: ...... .......... .. ....... ........ .... ... ..... ..
II: ....... ...... ... .. ....... .. ... ....... .......... .... ..
I.
... ... II ..
...
I.
... ... II .
...
I..
... ... II .
...
I..
... ... II ..
...
Ques :78
In mobile computing which of the following is not a dynamic update scheme of location management:1)
Periodic updates

24/06/2016 College Lecturer Exam ComputerScienceII
25/52
Movement based
updates
Cost based
update
Distance based
updates
...... ........... ... ...... ... .. ..... ...... ......... .. ......... ..... ..... ..... ..
............ .......
........
... .......
.......
... .......
..........
... .......
Ques :79
If values 33,42,38,12,22 and 77 are inserted insequence, into initially empty, Linear open addressing hash
table gaving 10 buckets of single slot with linear probing and hash function k nod 10. In which bucket
No. (numbered 0 to value 22 falls?
4
2
8
6
..... ... ..... ........ ... ...., ........ ........, 10 .... ..... ..... ....) ... k ... 10 ...
...... ..... .. ... .... ... 33, 42, 38, 12,22, ... 77 .. ..... ..... ..... ...... 22 ..... .... (... 0
.. 9 ... ......
4
2
8
6
Ques :80
Let M1 is a single tape turing machine simulating a multitape
turning machine M (ktapes)
. Time taken by
M1 to simulate n moves of M considering as constant is given by



.... M1 .. ...... ... ......... .... .. .. .. ......... ......... .... M .....) .. ........ .... ..
.. ... ..... .. M .. n .. . .. ........ .... ... M1 ...... ..... .... .... ... ....



Ques :81
Which one of the following is the tightest bound that represents the time compexity of inserting an object into
a binary search tree of n nodes?

O(log

O(n log

24/06/2016 College Lecturer Exam ComputerScienceII
26/52
............. ... .. ..... .... ... ... ...... .. .. ....... .... .. .. n ..... ... .. ....... .......
.... .. .... ............... .. ....... ..

O(log

O(n log
Ques :82
An index is clustered, if
It is on a set of fields that from a candidate key.
It is on a set of fields that include the primary key.
The data records of the file are organized in the same order as the data entries of the index.
The data records of the file are organized not in the same order as the data entries of the index
.. .......,......... .... ....
.... ......... ... ...... .. .. .. ........ ... ... ...
.... ......... ... ...... .. .. ..... ........ ... ........ ..
.... .. .... ........ ... ..... .. ....... .. .... ....... .. .... ...... ....... ..
.... .. .... ........ .. ..... .. ....... ..... .. .... ....... .. .... ...... ....... ..
Ques :83
What is the time complexity of BellmanFord
singlesource
shortest path algorithm on a completegraph of n
vertices?




...... ..... ...... ..... ........ ... ........... .. n ........ .. ........ .... .. .... .... ...............
.... ....



Ques :84
What is the logical translation of the following statement? "None of my friends are perfect."




............. ... .. ...... ....... .... .... "None of my friends are perfect."





24/06/2016 College Lecturer Exam ComputerScienceII
27/52
Ques :85
72
73
74
75
72
73
74
75
Ques :86
One of the purposes of using intermediate code in compilers is to
Make parsing and semantic analysis simpler
Improve error recovery and error reporting
Increase the chances of reusing the machineindependent
code optimizer in other compliers
Improve the register allocation
........ ... ....... ... ... .. ..... .. ...... ... .. .. ..... .. ..
....... ... ........ ........ .. ... .....
... ........ ... ... ........... .. ..... .....
.... .......... ... .......... .. .... ........ .. ...: ..... ... ........ .. .....
....... ....... .. ..... .....

24/06/2016 College Lecturer Exam ComputerScienceII
28/52
Ques :87
Number of internal nodes in the tree
Height of the tree
Number of nodes without a right sibling in the tree
Number of leaf nodes in the tree

24/06/2016 College Lecturer Exam ComputerScienceII
29/52
.... .. ....... ... ... ......
.... ... ....
.... ... .. ..... ... ...... ..... .... ....... ..... ..
.... ... .... ..... ... ......
Ques :88
Names of all the employees with at least one of their customers having a rating.
Names of all the employees with at most one of their customers having a rating
Names of all the employees with none of their customers having a rating.
Names of all the employees with all their customers having a rating.

24/06/2016 College Lecturer Exam ComputerScienceII
30/52
.. ........ .. ... ..... .. .. .. .. ...... .. ....... ..
.. ........ .. ... ..... ....... .. ...... .. ....... ..
.. ........ .. ... ..... .... .. ...... .. ....... ..... ..
.. ........ .. ... ..... ... ...... .. ....... ..
Ques :89
Let r1and r2 both be relations on schema R. The SQL expression Select from r1 where
in (select from r2) is equivalent to




.. ....... .. ..... .. ..... ....... r1 .. r2 .. ...... R .. ......... .. ............. SQL
expression .. .... .. ..... Select from r1 where in (select from r2) ....... SQL
expression ............. ... .. ...... ..... ..



Ques :90
3
4
5
6
3
4
5
6

24/06/2016 College Lecturer Exam ComputerScienceII
31/52
Ques :91








Ques :92
A simple graph G with nvertices
is connected if the graph has




.. ...... .... G ..... ........ .., ........ .... .... .... .... .... .. ...... ..



Ques :93
Which of the following connected simple graph has exactly one spanning tree
Complete graph
Hamiltonian graph
Euler graph
None of these
............. ... .. ..... ........ ...... .... ... .... .. ......... .. ....
........ ....
............ ....
.... ....
.... .. ... .....
Ques :94
Data marts that incorporate data mining tools to extract sets of data are called
Independent data mart
Dependent data marts
Intraentry
data mart
Interentry
data mart

24/06/2016 College Lecturer Exam ComputerScienceII
32/52
.... ...... ..... .... .. .......... .. .... ........ ... ...... .., .... ...... ..
.......... .... .....
........ .... .....
............ .... .....
.......... .... .....
Ques :95
The solution of recurrence relation,T(n) 2T(floor log(n) is
O(n log loglogn)
O(n log logn)
O(log logn)
O(logn log logn)
......... ....... 2T(floor log(n) .. ........ .... ....
O(n log loglogn)
O(n log logn)
O(log logn)
O(logn log logn)
Ques :96
A tree index is to be built on the name attribute of the relation STUDENT. Assume that all students names
are of length 8 bytes, disk block are of size 512 bytes and index pointers are of size 4 bytes. Given this
scenario what would be the best choice of the degree (i.e. the number of pointers per node) of the tree
16
42
43
44
.. .. .. ....... .. ........ ....... .. ... ....... .. .... .. ..... .... .. .... .. ... ......... ..
... .. ... 8 ..... .. .... .... .. .... 512 .... .. ... ....... ........ .. .... 4 ..... ..| ..
......... .. .... .. ..... ... .. .. .... ........ .... .... .... (...... ..... ... ........ .. ...... ....
....
16
42
43
44
Ques :97
The problem that occurs when one transaction updates a database item and then the transaction fails for some
reason is
Temporary select problem
Temporary modify problem
Dirty read problem
None of these
.. ... ........ ..... ....... .... .. ..... .. .... .. ... .......... ..... .... .. .. ........
... .. .... .. .. ... ...... .. .... ..
.......... ...... .......
.......... ........ .......
... .... ........

24/06/2016 College Lecturer Exam ComputerScienceII
33/52
.... .. ... .....
Ques :98
Dependency preserving but not lossless join
Dependency preserving and lossless join
Lossless Join but not dependency preserving
Lossless Join
......... ........... .. ...... ...... ...... ..... ..
......... ........... .. ... ...... ...... ..
...... ...... .. ..... ......... ........... ..... ..
.... ...... ...... ..
Ques :99
The Kimball's iterative data warehouse development approach drew on decades of experience to develop the

Business Dimensional Lifecycle
Data Warehouse Dimension
Business Definition Lifecycle
OLAP Dimension
Kimball .. ........ ............ ......... ..... ... .. ...... .. ....... ..... .. .... .. .... ....
.....:1)
....... ....... .........
............ .......
....... ......... .........
OLAP .......
Ques :100
Consider the regular expression … (ntimes).
The minimum number of states in finite
automaton that recognizes the language represented by this regular expression contains
n states
n 1 states
n 2 states
2n states
.. ........ .......... … (ntimes).
.. ....... .. minimum number of states
.... ... .. .. ........ .......... ...... ............. ........ .. .......... .. ...:1)
n states
n 1 states
n 2 states
2n states
Ques :101

24/06/2016 College Lecturer Exam ComputerScienceII
34/52
Match the following Regular Grammar Pushdown Automaton Context free Grammar
Linearboundedautomaton Unrestricted Grammar Deterministic finite automaton Context Sensitive
Grammar Turingmachine



iv)d



iv)b



iv)d



iv)a
.... .... .. ..... .... Regular Grammar Pushdown Automaton Context free Grammar
Linearboundedautomaton Unrestricted Grammar Deterministic finite automaton
Context Sensitive Grammar Turingmachine



iv)d



iv)b



iv)d



iv)a
Ques :102
The worst case time complexity of AVL tree is better in comparison to binary search tree for
Search and Insert Operations
Search and Delete Operations
Insert and Delete Operations
Search, Insert and Delete Operations
AVL .. .. ...... .... ............... .. ...... ....... .... .. .... ...... .. .... ..... ....:1)
Search ... Insert ......
Search ... Delete ......
Insert ... Delete ......
Search, Insert ... Delete ......
Ques :103
If the parse tree of a word w generated by a Chomsky normal form grammar has no path of length greater
than then the word w is of length
No greater than 2i+1
No greater than 2i
No greater than 2i-1
No greater than i
.... Chomsky normal form grammar ...... ....... .... W .. ..... .. ... ... ... ... ..... .. ..... ....
....
2i+1 .. ...... .....
2i .. ...... .....
2i-1 .. ...... .....
i .. ...... .....
Ques :104

24/06/2016 College Lecturer Exam ComputerScienceII
35/52








Ques :105
I and II
I and III
II and III
All of these
I ...II
I ...III
II ...III
All of these
Ques :106
An IP router with a Maximum Transmission Unit of 1500 bytes has received an IP packet of size 4404
bytes with an IP header of length 20 bytes. The values of the relevant fields in the header of the third IP
fragment generated by the router for this packet are
MF bit: Datagram Length: 1444; Offset: 370
MF bit: Datagram Length: 1424; Offset: 185
MF bit: Datagram Length: 1500; Offset: 370

24/06/2016 College Lecturer Exam ComputerScienceII
36/52
MF bit: Datagram Length: 1424; Offset: 2960
.. IP ..... ..... Maximum Transmission Unit of 1500 bytes .. .. 4404 .. IP ..... ..
...... .... .. ..... IP header .. .... 20 byte .. .. ..... .. .... ..... ...... ....... third IP fragment
.... ... ......... ....... .. ... ....
MF bit: Datagram Length: 1444; Offset: 370
MF bit: Datagram Length: 1424; Offset: 185
MF bit: Datagram Length: 1500; Offset: 370
MF bit: Datagram Length: 1424; Offset: 2960
Ques :107
Unsorted array
Minheap
Sorted array
Sorted doubly linked list
Unsorted array
Minheap
Sorted array
Sorted doubly linked list
Ques :108
According to the IEEE Project 802.11, there are two types of wireless LAN. In an infrastructured based
network what is a BSA (Basic Service Area
A BSA is wireless station
A BSA is a gateway connects a wireless station to a network
A BSA is simply a cell
A BSA is another word for server

24/06/2016 College Lecturer Exam ComputerScienceII
37/52
IEEE Project 802.11 ...... .. ..... .. ....... ... .. ..... ......... ..... ....... ... Basic Service
Area .... .... ..
BSA .. ....... ...... ..
BSA .. ..... .. .. ....... ...... .. ....... .. ...... .... ..
BSA .. ....... ... ..
BSA ..... .. ... ....... .... ..
Ques :109
When calculating the data rates for LMDS, capacity is the number of cell sites multiplied by which of the
following?
The capacity per cell site
The number of cells
The number of sectors in the cell site
The sector capacity
LMDS ... .... ..... .. .... .... ... .......... .. .... number of cell sites .. ...... ... .. ...... ....
..... .... ..
The capacity per cell site
The number of cells
The number of sectors in the cell site
The sector capacity
Ques :110
The GSM cellular radio system uses GMSK in a 200kHz,
with a channel data rate of 270.833 kbps. Calculate
the frequency shift between mark and space in kHz?
135.4165
153.6514
315.4651
513.1654
.. GSM cellular radio system, GMSK .. ..... 200kH
... .... .. ... .... channel data rate of
270.833 kbps .. .... mark ... space .. ... frequency shift .. .... kHz ... .....?
135.4165
153.6514
315.4651
513.1654
Ques :111
Encryption: private key followed by private key; Decryption: public key followedby public key
Encryption: private key followed by public key; Decryption: public key followedby private key
Encryption: public key followed by private key; Decryption: public key followedby private key
Encryption: private key followed by public key; Decryption: private key followedby public key

24/06/2016 College Lecturer Exam ComputerScienceII
38/52
Encryption: private key followed by private key; Decryption: public key followedby
public key
Encryption: private key followed by public key; Decryption: public key followedby
private key
Encryption: public key followed by private key; Decryption: public key followedby
private key
Encryption: private key followed by public key; Decryption: private key followedby
public key
Ques :112
Determine the maximum length of the cable (in km) for transmitting data at a rate of 500 Mbps in an Ethernet
LAN with frames of size 10,000 bits. Assume the signal speed in the cable to be 2,00,000 km/s.
1
2
2.5
5
.. Eithernet LAN me ....... cable .. ....... length (km ...) .. .... .... .. 500 Mbps .. .. ..
.... ....... .. ... ..... ...... .. .... 10,000 bits .. .... .. .... ... ....... .. ..... 2,00,000 km
..... ..... ..
1
2
2.5
5
Ques :113
A priority queue is implemented as a MaxHeap.
Initially, it has 5 elements. The levelorder
traversal of the
heap is: 10, 2. Two new elements 1 and 7 are inserted into the heap in that order. The levelorder
traversal of the heap after the insertion of the elements is
10, 5
10, 5
10, 5
10, 1
.. priority queue,MaxHeap
.. ... ... .............. .. ....... ... ..... 5 ........ .. .... .. .... .....
...... 10, 2 .. .. .... ........ 1 ... 7 .. ... ... ... .... ... ....... ..... .... .. ....... .....
.... .... .. ...... ........ .. .... ..... ...... ....
10, 5
10, 5
10, 5
10, 1
Ques :114
A complete binary tree of depth 5 has
15 nodes
25 nodes
63 nodes

24/06/2016 College Lecturer Exam ComputerScienceII
39/52
33 nodes
.. depth 5 .. ........ ....... .. ... ..... ....
15 .....
25 .....
63 .....
33 .....
Ques :115
The following sequence are inserted into a binary search tree 6 10 25 12 4 7 15 8 33 What is the type of
traversal given by:
Inorder
Postorder
Preorder
Level order
.. ....... .. ... ...... ....... .... ....... .. .... .. 6 10 25 12 4 7 15 8 33 ..... type of traversal ....

Inorder
Postorder
Preorder
Level order
Ques :116
Find the running time of the fastest algorithm to calculate the shortest path between any two vertices of a
graph where all edges have equal weights'.




.. ... .... .. ..... .... .. .... ... .., .. .. ........ .. ... .. ........ ... .. .... .... ....
.... ... ........... .. ...... .... .... ...




Ques :117
Consider a language L for which there exists a Turning Machine T that accepts every word in L and
either rejects of loops for every word that is not in L. The language L is:
NP hard
NPcomplete
Recursive
Recursively enumerable
.. ........ L ..... .... .. turing Machine T ..... .. .. L .. ....... ... .. ...... .... .. ...
....... .. ... .. .. L ... ..... .. reject of loofs .... .. .. ..... .. .... ....
NP .....
NP.
.......

24/06/2016 College Lecturer Exam ComputerScienceII
40/52
.........
............ .............
Ques :118
The logic of pumping lemma is a good example of
Pigeon hole principle
Recursion
Divide and conquer technique
Iteration
Pumping lemma .. ..... ............. ... ...... ..... ...... ..
..... ... ........
........
....... .... ..... .....
.......
Ques :119
A finite state machine having finite tape length without rewinding capability and unidirectional tape movement
is called
Turing machine
PDA
DFA
All of these
.. ....... ..... .... ..... ....... ... ... .. ... ....... ... ............. . .. ... ... .. .......
................ .., .... .... ..
Turing machine
PDA
DFA
.... .. ...
Ques :120
A problem is NPcomplete
if
Answer can be verified quickly
A quick algorithm to solve this problem can be used to solve all other NP problems quickly
It can be solved in polynomial time
All of these
... .. ....... NPcomplete
.... ....:1)
....... .. ........... .... .. ...
.. ........ .. ..... .... .... quick ........... .. ..... .... NPcomplete
.. .... ...... .. ....
.. ...
... .......... .... .. ..... .... .. ...
.... .. ...
Ques :121


24/06/2016 College Lecturer Exam ComputerScienceII
41/52







Ques :122
Recursive language
Recursive enumerable but not recursive
Norrecursivelyenumerable(
notRE)
language
Both Recursive enumerable but not recursive) and (Norrecursivelyenumerable(
notRE)
language)
......... ........
......... ............. ..... ......... .....
.....
.......... ............. ........ (not RE)
......... ............. ..... ......... .....) ... (.....
.......... ............. ........ (not RE)
.....
Ques :123
If there is an NPcomplete
language L whose complement is in NP, then the complement of any language in NP
is in
NP
P
Both NP and P
None of these
.... ... language L NPcomplete
.. ..... ............ .. NP .. .. ..... .. language .. NP .., ..
............ ....:1)
NP
P
NP ... P .....
.... .. ... .....
Ques :124

24/06/2016 College Lecturer Exam ComputerScienceII
42/52
Chomsky normal form but not strong Chomsky normal form
Weak Chomsky normal form but not Chomsky normal form
Strong Chomsky normal form
Greibach normal form
Chomsky normal form .. .. ..... strong Chomsky normal form .. .....
Weak Chomsky normal form .. .. ..... Chomsky normal form .. ..... ..
Strong Chomsky normal form .. ..
Greibach normal form .. ..
Ques :125
A cellular system is capable of coping with a handoffs once every 2 minutes. What is the maximum cell radius
if the system must be capable of working with cars traveling at highway speed of 120 km/hr?
3 km
1 km
4 km
6 km
.. ........ ....... ..... .. ..... ... .. ... handoffs .. cope .... .. ..... .... .. ... ....... ..
........ ... .. ... .... .... .... ....... .. ..... ..... 120 ......... ..... .... .. .... .. .... ...
.... ... ...... .... ..
3 km
1 km
4 km
6 km
Ques :126
How often will handoffs
occur when vehicle travels through a CMTS at 100 km per hour speed if the distance
between cell sites is 10 km?
6 mins
12 mins
395 sec
10 hrs
.... ... .... CMTS ... .. 100 ......... ......... .. .... .. ...... .. ... ... ...... .. ... .. ..... 10

24/06/2016 College Lecturer Exam ComputerScienceII
43/52
km .. .. handsoff .... ... ...... .. ....
6 mins
12 mins
395 sec
10 hrs
Ques :127
A star schema has what type of relationship between a dimension and fact table?
Manytomany
Onetoone
Onetomany
All of the above.
..... ..... ...... ... ........ ... ..... .... .. ... ..... ....... ....
.... .. ....
.. .. ..
.. .. ....
.... .. ...
Ques :128
A metadata repository contain all of the following except
Data warehouse schema
Operational metadata
The algorithms used for summarization
Business Reports
..... .... .... ........... ... ............. ... .. ..... ....... ......... .... ....
............ ......
....... .... ....
......... .. ..... .. ... .... ...........
....... ........
Ques :129
Concept hierarchies can be used to generalize data by replacing lowlevel
values by higherlevel
abstractions
in:
Star Query
Snow Flake Query
Starnet query
Reduction Query
........ ........ .. ..... .... .. ........... ... .... .... ....... .. .... .... ......... ..
............ .. ...... ... .. ...... ..... .... ..
..... .......
....... .......
........ .......
........ .......
Ques :130

24/06/2016 College Lecturer Exam ComputerScienceII
44/52
An iceberg cube is a data cube that stores only those cube cells that have an aggregate value
Above some minimum support threshold
Below some minimum support threshold
Equal to some minimum support threshold
No concern with minimum support threshold
....... ..... .. ...... ..... .. .... ..... .... .. .. .... ...... ..... .. ........ .... .. ..... .......
......:1)
....... ...... ........ .. ...... ..
....... ...... ........ .. .. ..
....... ...... ........ .. ..... ..
....... ...... ........ .. ... ....... ..... ..
Ques :131
StarCubing
algorithm uses startrees
to compute an
Fully Connected Cube
Semi Connected Cube
Iceberg Cube
Snow Flake Cube
StarCubing
........... ..... ... .. ..... .... .... .. .... .... ..
..... ........ .....
.... ........ .....
....... .....
......... .....
Ques :132
The most common source of change data in refreshing a data warehouse is
Queryable change data
Cooperative change data
Logged change data
Snapshot change data
..... .... .... .... .. ....... .... .. .... .... .... .. .... ....... ...... .... ..
.......... ... ....
.. ........ ... ....
........ ....
....... ... ....
Ques :133
The term that is not associated with data cleaning process is
Domain consistance
Deduplication
Disambiguation
Segmentation
............. ... .. ..... ....... .... .......... ........ .. .... .... .... ..
..... ....
.....
....
.........

24/06/2016 College Lecturer Exam ComputerScienceII
45/52
...............
..........
Ques :134
Eclat (Equivalence Class Transformation) algorithm Mines using
Horizontal data format
Vertical data format
Mixed data format
Class Data Format
Eclat(......... ..... ...........) ........... ......... .... ..... .. ........ ... .... ..... ... .... ..
.......... .... ....
........ .... ....
....... .... ....
..... .... ....
Ques :135
Pruning a decision tree always
Increase the error rate
Reduce the size of the tree
Provide partitions with lower entropy
Provide partitions with higher entropy
..... ..... .. ... ........ .... ... ...... ... .. .... .... ..
... ... .. .....
.... .. .... .. .. .... ..
.... ....... .. ...... ...... ..... ..
.... ....... .. ...... ...... ..... ..
Ques :136
In decision tree algorithms applied to datasets with a large number of classes and numerical attributes, the
attribute selection method to avoid is:
Information gain
Gain ratio
Gini index
Dimension Fitting
.. ..... .. ........... .. ........ ... ......... .. ...... ..... .... .. ..... .... ... ...... ...
....... ... ........... ......... .. .. ...... ... .. ..... ....... ....... .... ... ... ..... ..... ....
......
...... ...
... ....
Gini .......
....... .......
Ques :137
From the statement given below, choose a FALSE statement:

24/06/2016 College Lecturer Exam ComputerScienceII
46/52
Exactly one path exists between each pair of vertices in a tree

The sum of degrees of vertices in a graph is twice the number of edges
Each connected graph has exactly one spanning tree
..... .. ..... ... .. ..... ... ....:1)
.. .... .. ...... .. ....... ..... .. ... .. .. .... .. ... .... ..

.. .... .. ... ... ... ...... .. ..., .... ... ...... .. ...... .... ..
.. ........ .... .. .. .. .... .. ......... .... .... ..
Ques :138
Which pair of regular expression is not pair of equivalent expression
and
and
and
and
........ ........... .. ..... ....., .... ........ ........... .. ..... ..... ..
...
...
...
...
Ques :139









24/06/2016 College Lecturer Exam ComputerScienceII
47/52
Ques :140
The set of all strings over having exactly three is represented by the regualr expression
a*bbb

a*ba*ba*b
ba*ba*b
.. .. ... ..... .. ... .., ..... ... .. .... ... b .., ....... .... ........ .........( ....) ..

a*bbb

a*ba*ba*b
ba*ba*b
Ques :141
Choose correct increasing order of growth rates of asymptotic notations:1)



......... ...... .. .... .. .. .... ... ......



Ques :142
Using dynamic programming approach, longest common subsequence of two sequences of size n each,
may be computed in



n .... .. .. ........... .. ........ .... ..
.........(LCS), ......... ........... ..... .. .... .... ...
.... .... ...:1)



Ques :143

24/06/2016 College Lecturer Exam ComputerScienceII
48/52
1
5
7
8
1
5
7
8
Ques :144
20
15
9
27

24/06/2016 College Lecturer Exam ComputerScienceII
49/52
20
15
9
27
Ques :145
01011
00011
00111
00100
01011
00011
00111
00100
Ques :146

24/06/2016 College Lecturer Exam ComputerScienceII
50/52
Association rules are always defined
Binary attribute
Single attribute
Relational database
Multidimensional attribute
......... ..... .... .... .. .......... ..... .... ..
....... ..........
..... ..........
........ .......
............... ..........
Ques :147






24/06/2016 College Lecturer Exam ComputerScienceII
51/52



Ques :148
Which of the following clustering analysis method uses multi resolution approach
STUNT
OPTICS
CLIQUE
Wave Cluster
............. ... .. ..... .......... .. .... .... .......... ........... .. ........ ....
STUNT
OPTICS
CLIQUE
Wave Cluster
Ques :149








Ques :150
Time compexity of strasen's matrix multiplication algorithm is given by




24/06/2016 College Lecturer Exam ComputerScienceII
52/52
...... .. . ... ....(..... ...............) ........... .. .... ............. ... .. .... ..