#1. The switching expression corresponding to f(W,X,Y,Z)= ∑(1,4,5,9,11,12) is

XY’Z’ + W’Y’Z +WX’Z

WXY’ + WYZ + X’Y’Z

WYZ’ + W’XY’ + WY’Z’

W’XZ + WYZ’ + XYZ’

#2. What is the minimum number of NAND gates required to implement a 2-input Exclusive Or function without using any other logic gate?

6

5

4

3

#3. How many pulses are needed to change the contents of a 8-bit upcounter from 10101100 to 00100111 ?

123

124

133

134

#4. The number 43 in 2’s complement representation is

01010101

00101011

10101011

11010101

#5. How many 32K X 1 RAM chips are needed to provide a memory capacity of 256 K-bytes?

128

64

32

8

#6. Consider the following:i. two concurrent activities interact to cause a processing errorii. two users of the DBMS are interacting with different files at the same timeA race condition occurs when

only (i) occurs

only (ii) occurs

both (i) and (ii) occur

Neither (i) nor (ii) occurs

#7. Which of the following systems calls does not return control to the calling point on termination?

fork

exec

ioctl

longjmp

#8. The size of virtual memory depends on the size of the

Cache

Primary memory

Address bus

Secondary memory

#9. Which of the following involves context switch?

system call

privileged instruction

floating point exception

all the above

#10. Producer- consumer problem can be solved using:

Semaphore

Event counters

Monitors

All of the above

#11. Consider a main memory with five page frames and the following sequence of page references: 4, 9, 3, 4, 10, 2, 7, 4, 9, 10, 4, 7, 3, 2, 4. Which one of the following is true with respect to page replacement policies First In First Out (FIFO) and Least Recently Used (LRU)?

FIFO incurs 2 more page faults than LRU

FIFO incurs 1 more page faults than LRU

LRU incurs 2 more page faults than FIFO

Both incur the same number of page fault

#12. Consider the following set of processes that need to be scheduled on a single CPU. All the times are given in milliseconds.ProcessNameArrival TimeExecution TimeP106P232P354P476P5103Using the Shortest remaining time first scheduling algorithm, the average process turnaround time is ____________________.

4.8 msec

6.0 msec

7.2 msec

9.6 msec

#13. Consider a disk pack with a seek time of 4 milliseconds and rotational speed of 10000 rotations per minute (RPM). It has 600 sectors per track and each sector can store 512 bytes of data. Consider a file stored in the disk. The file contains 2000 sectors. Assume that every sector access necessitates a seek, and the average rotational latency for accessing each sector is half of the time for one complete rotation. The total time (in milliseconds) needed to read the entire file is ____________.

14020

14040

14200

14400

#14. Assume a page reference string for a process with m frames (initially all empty). The page reference string has length l with m distinct page numbers occurring in it. For any page- replacement algorithms, what is a lower bound & an upper bound on the number of page faults?

m/2, l

l,m

m, l/2

m, l

#15. A non-planar graph with minimum number of vertices has

6 edges, 4 vertices

9 edges, 5 vertices

9 edges, 6 vertices

10 edges, 5 vertices

#16. Given statements:S₁: The set of positive rational numbers is countable.S₂: The set of real numbers is countable.

Both S1 and S2 are true

Both S1 and S2 are false

S1 is true and S2 is false

S1 is false and S2 is true

#17. How many reflexive relations are there on a set with n elements?

2ⁿ

2ⁿ⁽ⁿ⁻¹⁾

n²

n/2

#18. Let f and g be functions from {11, 12,13, 14} to {a, b, c, d} and from {a, b, c, d} to {11, 12, 13, 14}, respectively, with f (11) = d, f (12) = c, f (13) = a, and f (14) = b, and g(a) = 12, g(b) = 11, g(c) = 13, and g(d) = 12. Which of the following is correct?

Only inverse of f exists

Only inverse of g exists

Inverse of both f and g exist

Inverse of both f and g do not exist

#19. Some group (G, *) is known to be abelian. Then, which one of the following is true for G?

f = f⁻¹ for every g ∈ G

f = f² for every g ∈ G

(f*g)² = f² * g² for every f, g ∈ G

G is of finite order

#20. Let X and Y be sets and X’ and Y’ denote compliments of the sets X and Y. The set(X-Y) ∪ (Y-X) ∪ (X ∩ Y) is equal to

X ∩ Y

X’ ∩ Y’

X ∪ Y

X’ ∪ Y’

#21. In a class of 400 students, 175 students have taken Artificial Intelligence course, 110 students have taken Cloud Computing course, 90 students have taken Software Engineering course; 75 students have taken both Artificial Intelligence and Cloud Computing, 60 students have taken both Artificial Intelligence and Software Engineering, 55 students have taken both Cloud Computing and Software Engineering, 40 have taken all the three courses. How many students have not taken any of the three courses?

175

185

215

325

#22. If the function h is defined by h(x)=x²+1 on the set {-2,-1,0,1,2}, What will be its range?

{-1,0,1}

{-2,-1,0}

{1,2,5}

{1,3,5}

#23. The minimum number of cards to be dealt from an arbitrarily shuffled deck of 52 cards to guarantee that three cards are from same suit is

3

8

9

12

#24. How many edges are there in a forest of t trees containing total of v vertices ?

vᵗ

v-t

v+t

v*t

#25. A binary tree T has 90 leaves. What is the number of internal nodes in the binary tree T having two children

91

89

45

44

#26. In a reflexive relation on R

each element of R is related to itself

each ordered pair (x, y) is matched by (y, x)

if xRy and yRz then xRz

All of the above

#27. Consider an undirected graph G with 50 nodes. The maximum number of edges to be included in G so that the graph is not connected is

2450

1225

1176

2352

#28. The time complexity of merging two sorted arrays of size M and N is

O(max(M),max(N))

O(min(M),min(N))

O(MN)

O(M+N)

#29. A program takes as input a balanced binary search tree with n leaf nodes and computes the value of a function b(X) for each node X. If the cost of computing b(X) is min(number of leaf nodes in left subtree, number of leaf nodes in right subtree of X) then the worst case time complexity of the Program is

O(n)

O(nlog(n))

O(n)²

O(2ⁿ)

#30. For the given data set :18,14,15,16,12,11,17,13, the result after three iterations of merge sort will be :

11,12,13,14,15,16,17,18

14,15,16,18,11,12,17,13

14,18,15,16,11,12,13,17

13, 14,11,12,17, 18, 15,16

#31. A data file of 2000 characters contains only the characters U-Z, with the frequencies as indicated in table :UVWXYZFrequency in thousand4513121695using the variable-length code by Huffman codes, the file can be encoded with

5280 bits

5040 bits

4920 bits

4480 bits

#32. How many different full binary trees are possible with 7 nodes?

127

132

429

1430

#33. Of the following tree structure, which is, efficient considering space and time complexities?

Almost complete Binary Tree

Complete Binary Tree

Full Binary Tree

Incomplete Binary Tree

#34. Which is the simplest file structure?

Indexed

Random

Sequential

Sequential Indexed

#35. Kruskal’s algorithm for finding a minimum spanning tree of a weighted graph G with v nodes and e edges has the time complexity of

O(v²)

O(ev)

O(e+v)

O(elogv)

#36. A vertex cover of an undirected graph G(V, E) is a subset V1 ⊆ V Vertices such that

If (u, v) ∈ E then u ∈ V1 and v ∈ V1

If (u, v) ∈ E then u ∈ V1 or v ∈ V1

Each pair of vertices in V1 is connected by an edge

All pairs of vertices in V1 are not connected by an edge

#37. Let G be a graph with v vertices and e edges. What is the upper bound on the running time of depth first search on search on G, when G represented as an adjacency matrix?

O(v)

O(v+e)

O(e)

O(v²)

#38. What is the maximum number of parenthesis that will appear on the stack at any one time for parenthesis expression given by:( ( ) (( ( ) )) ( ( ) ) )

3

4

5

6

#39. What is the value of the postfix expression given below?a b c d + – * (where a = 8, b = 4, c = 2 and d = 5)

–38

-83

24

-24

#40. A source S = {S1, S2, S3} emits symbols with P= {a, b, c }. The entropy of source S is maximum when

a=b=c

a=b=c=0.5

a≠b≠c

None of the above

#41. A binary tree whose left and right subtree differ in height at most by one node is called

AVL Tree

Black and White tree

Binary Search tree

Strictly binary tree

#42. How many bytes of data can be sent in 25 seconds over a serial link with baud rate of 4800 in asynchronous mode with odd parity and two stop bits in the frame?

5,000 bytes

10,000 bytes

6,000 bytes

12,000 bytes

#43. If a class B network on the Internet has a subnet mask of 255.255.248.0, what is the maximum number of hosts per subnet?

1022

1023

2046

2047

#44. Which of the following is not a client-side server application?

E-mail

Internet Chat

Ping

Web browsing

#45. Which of the following performs modulation and demodulation?

coaxial cable

fiber optics

modem

satellite

#46. Which of the following is required to communicate between two computers?

communications software

protocol

communication hardware

all of above including access to transmission medium

#47. In communication satellite, multiple repeaters are known as

detector

modulator

stations

transponders

#48. To send a data packet using datagram,

connection will be established before data transmission.

connection is not established before data transmission.

no connection is required.

a broadband connection is required.

#49. Which of the following does not affect bandwidth?

the amount of network traffic

the software protocols of the network

the type of information being transmitted

the type of network connection

#50. The CRC code word for the data bit sequence 1101 using the generator polynomial:x³ + x + 1.

101

100

010

001

#51. The count-to-infinity problem is associated with

Distance vector routing algorithm

Flooding algorithm

Hierarchical routing algorithm

Link state routing algorithm

#52. Which of these following is not a characteristic of a relational database model?

Complex logical relationships

Records

Tables

Treelike structures

#53. Consider the following schedules involving two transactions.S₁ : r₁(X); r₁(Y); r₂(X); r₂(Y); w₂(Y); w₁(X)S₂ : r₁(X); r₂(X); r₂(Y); w₂(Y); r₁(Y); w₁(X)Which one of the following statements is TRUE?

Both S1 and S2 are conflict serializable.

Both S1 and S2 are not conflict serializable.

S1 is conflict serializable and S2 is not conflict serializable.

S1 is not conflict serializable and S2 is conflict serializable.

#54. Consider relations S(a, b) and T(c, d).The result of select distinct a, b from S, T is guaranteed to be same as S, provided

S has no duplicates and T is non-empty

S and T have no duplicates

T has no duplicates and S is non-empty

S and T have the same number of tuples

#55. In SQL, relations can contain null values, and comparisons with null values are treated as unknown. Suppose all comparisons with a null value are treated as false. Which of the following pairs is not equivalent?

y = 5, not (not (y = 5)

y = 5, y> 4 and y < 6, where y is an integer

y < 5, not(y = 5)

None of the above

#56. Which one of the following statements about normal forms is FALSE?

BCNF is stricter than 3NF

Lossless, dependency-preserving decomposition into 3NF is always possible

Lossless, dependency-preserving decomposition into BCNF is always possible

Any relation with two attributes is in BCNF

#57. Let E and F be two entities in an ER diagram with simple single-valued attributes. R and S are two relationships between E and F, where R is one-to-many and S is many-to-many. R and S do not have any attributes of their own. What is the minimum number of tables required to represent this situation in the relational model?

2

3

4

5

#58. Which of the following is FALSE about B/B+ tree?

B/B+ trees grow upward while Binary Search Trees grow downward.

Time complexity of search operation in B/B+ tree is better than Red Black Trees in general.

Number of child pointers in a B/B+ tree node is always equals to number of keys in it plus one.

A B/B+ tree is defined by a term minimum degree. And the minimum degree depends on hard disk block size, key and address sizes.

#59. Consider the relation scheme R=(A, B, C, D, E, F, G, H, I, J) and the set of functional dependencies {{A, B} → {C},{B} → {E, F},{A, D} → {G, H},{G} → {I},{H} → {J}} on R. What is the key for R ?

{A, B}

{A, B,D}

{A, B, D, G, H}

{A}

#60. The concept of locking can be used to solve the problem of

Lost update

uncommitted dependency

inconsistent data

All of the above

#61. In mapping of ERD to DFD

relations in ERD has 1 to 1 correspondence to processes in DFD

relationships in ERD has 1 to 1 correspondence to flows in DFD

entities in ERD should correspond to an existing entity/store in DFD

entity in DFD is converted to attributes of an entity in ERD

#62. Which of the following testing techniques supports automatic rerun of some tests for the software whenever a slight change to the product is made.

Acceptance testing

Exhaustive testing

Regression testing

Non-linear testing

#63. Equivalence partitioning is a __________ method that divides the input domain of a program into classes of data from which test cases can be derived.

White-box testing

Black-box testing

Cohesion testing

Coupling testing

#64. Boehm has proposed

Iterative model

Waterfall model

Prototyping model

Spiral model

#65. Functionality of a software is tested using

Glassbox testing

Whitebox testing

Blackbox testing

Glassbox testing and Whitebox testing

#66. The property of sticking together of data elements within a single module is called

Coupling

Cohesion

Decomposition

Modularity

#67. Improving processing efficiency or performance or restructuring of software to improve changeability is known as

Corrective maintenance

Perfective maintenance

Adaptive maintenance

Code maintenance

#68. Thoma’s-write rule is ______.

Two phase locking protocol

Timestamp ordering protocol

One phase locking protocol

Sliding window protocol

#69. What is difference between Non-deterministic Finite Automaton (NFA) and Deterministic Finite Automaton (DFA)?

A DFA uses a number to label states while a NFA uses a set of numbers to label states.

A DFA doesn't allow two transitions to different states for the same input symbol while a NFA doesn't have this restriction.

In a DFA, we can't use the same name to label two different states while in a NFA we can use the same name to label two different states.

A DFA only has one unique diagram while a NFA may have more than one different diagrams.

#70. Which of the following is incorrect statement?

If a Non-deterministic FAs (NFA) has n states, then its corresponding Deterministic FAs (DFA) must have more than n states.

If a NFA has n halt states, its corresponding DFA must have at least n halt states.

If a NFA's start state is also a halt state, then in its corresponding DFA, the start state must also be a halt state.

If a string s is recognized by a NFA after checking through n transitions, then s can be recognized by the corresponding DFA using not more than n transitions.

#71. Which of the following languages CANNOT be defined by Finite Automata?

{ab, abab, ababab, abababab, ...}

{abb, aabbbb, aaabbbbbb, aaaabbbbbbbb, ...}

{a, b, aa, bb, aaa, bbb, aaaa, bbbb, ...}

{a, aa, aba, abba, abbba, abbbba, abbbbba, ...}

#72. Which of the following regular expressions describes the language containing strings having “010” as substring?

(010)*

(0|1)*010(0|1)*

(0|1)*010

010(0|1)*

#73. Which language is generated by the following grammar:X -> ε | a Y aY -> ε | b X b, where X is start symbol of the grammar.

{ ε, aa, baab, abaaba, ...}

{ ε, aa, bb, aaaa, bbbb, ...}

{ε, aa, abba, abbbba, abbbbbba...}

{ε, aa, abba, abaaba, ababbaba...}

#74. The number of states in a minimal deterministic finite automaton corresponding to the language L = { aⁿ | n>3 } is

3

4

5

6

#75. Regular expression for the language L = { w ∈ {0, 1}* | w has no pair of consecutive 0} is

(1 + 010)*

(01 + 10)*

(1 + 010)*(0 + λ)

(1 + 01)*(0 + λ)

#76. Consider the following two languages :L1 = {aⁿbˡaᵏ | n + l + k>5 }L2 = { aⁿbˡaᵏ | n>5, l >3, k≤ l }Which of the following is true ?

Both L1 and L2 are regular languages.

Both L1 and L2 are not regular languages.

L1 is regular language and L2 is not regular language.

L1 is not regular language and L2 is regular language.

#77. Assume the statements S1 and S2 given as:S1 : Given a context free grammar G, there exists an algorithm for determining whether L(G) is infinite.S2 : There exists an algorithm to determine whether two context free grammars generate the same language.Which of the following is true ?

S1 is correct and S2 is not correct.

Both S1 and S2 are correct.

Both S1 and S2 are not correct.

S1 is not correct and S2 is correct.

#78. The grammar with production rulesS → aSb | SS | λgenerates language L given by :

L = {w∈{a, b}* | nₐ(w) = nᵦ(w) and nₐ(v) ≥ nᵦ(v) where v is any prefix of w}

L = {w∈{a, b}* | nₐ(w) = nᵦ(w) and nₐ(v) ≤ nᵦ(w) where v is any prefix of w}

L = {w∈{a, b}* | nₐ(w) ≠ nᵦ(w) and nₐ(w) ≥ nᵦ(w) where v is any prefix of w}

L = {w∈{a, b}* | nₐ(w) ≠ nᵦ(w) and nₐ(v) ≤ nᵦ(w) where v is any prefix of w}

#79. What growth rate was the economy of H.P. expected to achieve during 2017-18 financial year ( in percentage terms)?

8.1

6.9

6.3

6.1

#80. Which Municipal Corporation in H.P. has been approved by the Government of India under Smart city Mission?

Nahan

Mandi

Hamirpur

Shimla

#81. With whom is the famous folk song ‘Thandi Thandi Hawa Chaldi, Chulde Chilan de dalu, Jeena Kangre da’ associated?

Pratap Chand Sharma

Achhar Singh Parmar

Jawala Parsad

Shukla Sharma

#82. Which country is collaborating with H.P. in projects like watershed and wadi projects?

Holland

Germany

Canada

France

#83. According to 2010-11 agricultural census what is the percentage of marginal holdings in H.P.?

87.95

78.23

71.85

69.78

#84. Which country is assisting in H.P. Forest Eco-systems climate proofing project?

Japan

Germany

Belgium

Canada

#85. Out of 14 silk yarn reeling units which have been set up in H.P. in the private sector, how many are in Kangra District?

4

5

6

7

#86. Approximately how much hydro power has been harnessed so far in H.P.?

10519.17 MW

11462.34 MW

12570.63 MW

16750.89 MW

#87. According to 2011 census what is the female literacy rate in H.P.?

70.63

73.85

75.93

77.46

#88. When was Dr. Rajendra Prasad Government Medical College at Tanda in Kangra District of H.P. established?

1990

1996

1998

1999

#89. How many seats did the Telangana Rashtra Samithi win in Telangana Assembly poll held in 2018?

77

82

85

88

#90. How many gold medals has Mary Kom won in World Boxing Championships?

Three

Four

Five

Six

#91. What is India’s rank in 2018 Global Innovation Index?

57th

67th

77th

87th

#92. When was Pradhan Mantri Mudra Yojna launched?

October, 2014

January, 2015

April, 2015

October, 2015

#93. Find the mis-match between defence equipment and the functions they perform in India’s defence?

Agni - Missile

Arjun - tank

Tejas - heliicopter

Arihant - submarine

#94. Who is the President of Georgia?

Giorgi Magvelashvili

Salome Zurabishvili

Irakli Garibashvili

None of these

#95. Among how many persons was 2018 Nobel Prize for Physics divided?

Two

Three

One

None

#96. What name was given to the storm that shook Thailand in January, 2019?

Katrina

Titli

Pabuk

Mangkut

#97. Who is the author of Sleep Donation?

Rebecca Mead

Karen Russell

Rachel Joyce

Ben Marcus

#98. Where is the Headquarter of the European Union?

Geneva

Berlin

Rome

Brussels

Assistant Computer Programmer Previous Year Question Paper – HPPSC – 2019

Results

#1. The switching expression corresponding to f(W,X,Y,Z)= ∑(1,4,5,9,11,12) is

#2. What is the minimum number of NAND gates required to implement a 2-input Exclusive Or function without using any other logic gate?

#3. How many pulses are needed to change the contents of a 8-bit upcounter from 10101100 to 00100111 ?

#4. The number 43 in 2’s complement representation is

#5. How many 32K X 1 RAM chips are needed to provide a memory capacity of 256 K-bytes?

#6. Consider the following:i. two concurrent activities interact to cause a processing errorii. two users of the DBMS are interacting with different files at the same timeA race condition occurs when

#7. Which of the following systems calls does not return control to the calling point on termination?

#8. The size of virtual memory depends on the size of the

#9. Which of the following involves context switch?

#10. Producer- consumer problem can be solved using:

#11. Consider a main memory with five page frames and the following sequence of page references: 4, 9, 3, 4, 10, 2, 7, 4, 9, 10, 4, 7, 3, 2, 4. Which one of the following is true with respect to page replacement policies First In First Out (FIFO) and Least Recently Used (LRU)?

#14. Assume a page reference string for a process with m frames (initially all empty). The page reference string has length l with m distinct page numbers occurring in it. For any page- replacement algorithms, what is a lower bound & an upper bound on the number of page faults?

#15. A non-planar graph with minimum number of vertices has

#16. Given statements:S₁: The set of positive rational numbers is countable.S₂: The set of real numbers is countable.

#17. How many reflexive relations are there on a set with n elements?

#18. Let f and g be functions from {11, 12,13, 14} to {a, b, c, d} and from {a, b, c, d} to {11, 12, 13, 14}, respectively, with f (11) = d, f (12) = c, f (13) = a, and f (14) = b, and g(a) = 12, g(b) = 11, g(c) = 13, and g(d) = 12. Which of the following is correct?

#19. Some group (G, *) is known to be abelian. Then, which one of the following is true for G?

#20. Let X and Y be sets and X’ and Y’ denote compliments of the sets X and Y. The set(X-Y) ∪ (Y-X) ∪ (X ∩ Y) is equal to

#22. If the function h is defined by h(x)=x²+1 on the set {-2,-1,0,1,2}, What will be its range?

#23. The minimum number of cards to be dealt from an arbitrarily shuffled deck of 52 cards to guarantee that three cards are from same suit is

#24. How many edges are there in a forest of t trees containing total of v vertices ?

#25. A binary tree T has 90 leaves. What is the number of internal nodes in the binary tree T having two children

#26. In a reflexive relation on R

#27. Consider an undirected graph G with 50 nodes. The maximum number of edges to be included in G so that the graph is not connected is

#28. The time complexity of merging two sorted arrays of size M and N is

#30. For the given data set :18,14,15,16,12,11,17,13, the result after three iterations of merge sort will be :

#31. A data file of 2000 characters contains only the characters U-Z, with the frequencies as indicated in table :UVWXYZFrequency in thousand4513121695using the variable-length code by Huffman codes, the file can be encoded with

#32. How many different full binary trees are possible with 7 nodes?

#33. Of the following tree structure, which is, efficient considering space and time complexities?

#34. Which is the simplest file structure?

#35. Kruskal’s algorithm for finding a minimum spanning tree of a weighted graph G with v nodes and e edges has the time complexity of

#36. A vertex cover of an undirected graph G(V, E) is a subset V1 ⊆ V Vertices such that

#37. Let G be a graph with v vertices and e edges. What is the upper bound on the running time of depth first search on search on G, when G represented as an adjacency matrix?

#38. What is the maximum number of parenthesis that will appear on the stack at any one time for parenthesis expression given by:( ( ) (( ( ) )) ( ( ) ) )

#39. What is the value of the postfix expression given below?a b c d + – * (where a = 8, b = 4, c = 2 and d = 5)

#40. A source S = {S1, S2, S3} emits symbols with P= {a, b, c }. The entropy of source S is maximum when

#41. A binary tree whose left and right subtree differ in height at most by one node is called

#42. How many bytes of data can be sent in 25 seconds over a serial link with baud rate of 4800 in asynchronous mode with odd parity and two stop bits in the frame?

#43. If a class B network on the Internet has a subnet mask of 255.255.248.0, what is the maximum number of hosts per subnet?

#44. Which of the following is not a client-side server application?

#45. Which of the following performs modulation and demodulation?

#46. Which of the following is required to communicate between two computers?

#47. In communication satellite, multiple repeaters are known as

#48. To send a data packet using datagram,

#49. Which of the following does not affect bandwidth?

#50. The CRC code word for the data bit sequence 1101 using the generator polynomial:x³ + x + 1.

#51. The count-to-infinity problem is associated with

#52. Which of these following is not a characteristic of a relational database model?

#53. Consider the following schedules involving two transactions.S₁ : r₁(X); r₁(Y); r₂(X); r₂(Y); w₂(Y); w₁(X)S₂ : r₁(X); r₂(X); r₂(Y); w₂(Y); r₁(Y); w₁(X)Which one of the following statements is TRUE?

#54. Consider relations S(a, b) and T(c, d).The result of select distinct a, b from S, T is guaranteed to be same as S, provided

#55. In SQL, relations can contain null values, and comparisons with null values are treated as unknown. Suppose all comparisons with a null value are treated as false. Which of the following pairs is not equivalent?

#56. Which one of the following statements about normal forms is FALSE?

#58. Which of the following is FALSE about B/B+ tree?

#59. Consider the relation scheme R=(A, B, C, D, E, F, G, H, I, J) and the set of functional dependencies {{A, B} → {C},{B} → {E, F},{A, D} → {G, H},{G} → {I},{H} → {J}} on R. What is the key for R ?

#60. The concept of locking can be used to solve the problem of

#61. In mapping of ERD to DFD

#62. Which of the following testing techniques supports automatic rerun of some tests for the software whenever a slight change to the product is made.

#63. Equivalence partitioning is a __________ method that divides the input domain of a program into classes of data from which test cases can be derived.

#64. Boehm has proposed

#65. Functionality of a software is tested using

#66. The property of sticking together of data elements within a single module is called

#67. Improving processing efficiency or performance or restructuring of software to improve changeability is known as

#68. Thoma’s-write rule is ______.

#69. What is difference between Non-deterministic Finite Automaton (NFA) and Deterministic Finite Automaton (DFA)?

#70. Which of the following is incorrect statement?

#71. Which of the following languages CANNOT be defined by Finite Automata?

#72. Which of the following regular expressions describes the language containing strings having “010” as substring?

#73. Which language is generated by the following grammar:X -> ε | a Y aY -> ε | b X b, where X is start symbol of the grammar.

#74. The number of states in a minimal deterministic finite automaton corresponding to the language L = { aⁿ | n>3 } is

#75. Regular expression for the language L = { w ∈ {0, 1}* | w has no pair of consecutive 0} is

#76. Consider the following two languages :L1 = {aⁿbˡaᵏ | n + l + k>5 }L2 = { aⁿbˡaᵏ | n>5, l >3, k≤ l }Which of the following is true ?

#77. Assume the statements S1 and S2 given as:S1 : Given a context free grammar G, there exists an algorithm for determining whether L(G) is infinite.S2 : There exists an algorithm to determine whether two context free grammars generate the same language.Which of the following is true ?

#78. The grammar with production rulesS → aSb | SS | λgenerates language L given by :

#79. What growth rate was the economy of H.P. expected to achieve during 2017-18 financial year ( in percentage terms)?

#80. Which Municipal Corporation in H.P. has been approved by the Government of India under Smart city Mission?

#81. With whom is the famous folk song ‘Thandi Thandi Hawa Chaldi, Chulde Chilan de dalu, Jeena Kangre da’ associated?

#82. Which country is collaborating with H.P. in projects like watershed and wadi projects?

#83. According to 2010-11 agricultural census what is the percentage of marginal holdings in H.P.?