Dark Mode

Recent questions tagged kpgcet-cse-2019

0 votes

0 answers

31

KPGCET-CSE-2019-31
The running time of an algorithm of n interdependent operations is computed with both the asymptotic & amortized analyses. The most accurate running time obtained by Asymptotic analysis Amortized analysis Both analyses None of these

gatecse asked in Algorithms Aug 4, 2019

203 views

0 votes

0 answers

32

KPGCET-CSE-2019-32
In a banking system, where customers transact randomly for the storage & accession of desired data,the most appropriate file for storage of records could be Sequential file Indexed sequential file Hash file Random file

gatecse asked in Others Aug 4, 2019

114 views

1 vote

2 answers

33

KPGCET-CSE-2019-33
The least running time of creating spanning tree from connected graph in G(E, V) is O (V log V) O (E + V log V) O (E log V) O (V log V + E log V) Where E, V are respectively number of edges & vertices in the graph.

gatecse asked in Algorithms Aug 4, 2019

480 views

0 votes

0 answers

34

KPGCET-CSE-2019-34
When a programming system and software are developed separately for the same business process, the development cost of programming system is more than the software. software is more than the programming system. Both are same Both cannot be comparable.

gatecse asked in Others Aug 4, 2019

172 views

0 votes

0 answers

35

KPGCET-CSE-2019-35
The iterations of Software Development Stage Activities in different process models are used to Eliminate errors of previous iterations in the current iteration and also to accommodate the changes in the business process Only eliminate errors of previous iterations in the current iteration Only accommodate the change in business process None of these

gatecse asked in IS&Software Engineering Aug 4, 2019

160 views

0 votes

0 answers

36

KPGCET-CSE-2019-36
The average number of accesses to access the desired record stored in a sequential file containing $n$ records is $(n+1)/2$ $n/2$ $(n − 1)/2$ $n$

gatecse asked in Others Aug 4, 2019

99 views

0 votes

0 answers

37

KPGCET-CSE-2019-37
During the implementation stage of Software Development Life Cycle, the following UML diagram is designed to determine the correctness & Completeness of integration of different software Class diagram Object diagram Usecase diagram Component diagram

gatecse asked in Others Aug 4, 2019

139 views

0 votes

0 answers

38

KPGCET-CSE-2019-38
In DBMS, the only association would satiate the complete interrelationships set of business processes and in object oriented paradigm, the inter relationships are enhanced by additional aggregation & super-sub class hierarchy. This addition ... following from the object-oriented paradigm null values only redundancies only both null values & redundancies inconsistencies

gatecse asked in Databases Aug 4, 2019

144 views

0 votes

0 answers

39

KPGCET-CSE-2019-39
Relational Algebra is integral part of DBMS because it contains operators analogous to query language queries. contains relational operators analogous to query language queries. is used as intermediate language in translating programming language ... query language queries is used as intermediate language in translating query language queries into programming language programs.

gatecse asked in Databases Aug 4, 2019

150 views

0 votes

0 answers

40

KPGCET-CSE-2019-40
The following relational algebra operators form complete set of operators. The other operators can be represented by any combinations of these : $\{ \rho, \sigma , \Pi, – , \cap \}$ $\{ \sigma , ÷, – , \cup, X \}$ $ \{ \sigma, \Pi, – , \cup, X \}$ $\{ \sigma, \Pi, – , \cap, ÷ \}$

gatecse asked in Others Aug 4, 2019

172 views

0 votes

0 answers

41

KPGCET-CSE-2019-41
The ‘divide’ operator in the relational algebra is categorized as A mathematical operator A relational operator A mathematical cum relational operator Neither relational nor mathematical operator

gatecse asked in Databases Aug 4, 2019

99 views

0 votes

0 answers

42

KPGCET-CSE-2019-42
The comparison of algorithm types divide-and-conquer (DAC) and dynamic programming (DP) indicates that DP is bottom-up approach and DAC is top-down approach. DP is top-down approach and DAC is bottom-up approach. Both DP and DAC are bottom-up approaches. Both DP and DAC are top-down approaches.

gatecse asked in Algorithms Aug 4, 2019

170 views

1 vote

0 answers

43

KPGCET-CSE-2019-43
The distinction between B tree and B+ tree is that В tree contains data at all memory locations whereas B+ tree contains data at leaf level nodes B+ tree contains data at all levels and B tree contains data only at the leaf nodes. Both contain data at all levels Both contains data only at leaf nodes.

gatecse asked in Databases Aug 4, 2019

283 views

0 votes

0 answers

44

KPGCET-CSE-2019-44
The decomposition of a relation R of relational DBMS into two relations $RI(X)$ & $R2(Y)$ is lossless if $X \cap Y > X-Y \text{ or } X \cap Y > Y-X \text{ is in }F^+$ ... $>$ means determines, $F^+$ is closure of functional dependencies and $X, \: Y$ are set of attributes present in $R1$ & $R2$ respectively.

gatecse asked in Others Aug 4, 2019

117 views

0 votes

0 answers

45

KPGCET-CSE-2019-45
In the transaction management of schedule, the Conflict serializability implies View serializability View serializability implies Conflict serializability Conflict serializability does not implies View serializability None of these

gatecse asked in Databases Aug 4, 2019

172 views

0 votes

0 answers

46

KPGCET-CSE-2019-46
A two level indexed sequential file of size $12,000$ records has $20$ entries in each index. The average number of accesses required for accessing a desired record is $6000$ $70$ $35$ $39$

gatecse asked in Others Aug 4, 2019

253 views

0 votes

0 answers

47

KPGCET-CSE-2019-47
In a real time system, the time is more important than the quality of Structure of the system Function of the system Cardinality of the file Functional dependencies of the record

gatecse asked in Distributed Computing Aug 4, 2019

174 views

0 votes

1 answer

48

KPGCET-CSE-2019-48
The efficacious software testing follows the following principle Maximum number of test cases to detect & correct minimum number of errors Minimum number of test cases to detect & correct minimum number of errors Maximum number of test cases to detect & correct maximum number of errors Minimum number of test cases to detect & correct maximum number of errors

gatecse asked in Others Aug 4, 2019

155 views

0 votes

0 answers

49

KPGCET-CSE-2019-49
The communication network comprises number of base stations. The scope of each base station covers the circular area. To avoid the overlapping and gaping of areas, the scope of each base station is accounted by Rectangle Pentagon Hexagon Octagon

gatecse asked in Digital Signal Processing Aug 4, 2019

176 views

0 votes

1 answer

50

KPGCET-CSE-2019-50
In the software testing, the behavioural testing is called White box testing Black box testing Mutation testing Integration testing

gatecse asked in IS&Software Engineering Aug 4, 2019

317 views

0 votes

0 answers

51

KPGCET-CSE-2019-51
In a communicative network, though the scope of base station is circular area, the network scope is represented by______ shape, as it is nearest to the circular area. triangular rectangular pentagonal hexagonal.

gatecse asked in Digital Signal Processing Aug 4, 2019

136 views

0 votes

0 answers

52

KPGCET-CSE-2019-52
In the software development, the physical architecture is related to the _______stage/s and logical architecture is related to ____________stage/s. Implementation & Deployment, Design Coding & implementation, Design Design & Implementation, Deployment Deployment & Implementation, Deployment

gatecse asked in IS&Software Engineering Aug 4, 2019

174 views

0 votes

1 answer

53

KPGCET-CSE-2019-53
In the software Testing, the white box testing tests _________ part and black box testing tests ________part of the developed programming system. structural, behavioural behavioural, structural mutational, structural structural , mutational

gatecse asked in IS&Software Engineering Aug 4, 2019

210 views

0 votes

0 answers

54

KPGCET-CSE-2019-54
The signature present in the object method clause of the class diagram contains ____________attributes of the related classes and ___________type. return, referential referral, return referential, return definitional, used

gatecse asked in Unknown Category Aug 4, 2019

257 views

0 votes

0 answers

55

KPGCET-CSE-2019-55
In the 'Analyzing’ stage of Software Development Life Cycle (SDLC), _______defines the entire memory structure and ________ defines the main memory. schema, paradigm schema, relation paradigm, relation schema, relation structure

gatecse asked in Unknown Category Aug 4, 2019

119 views

0 votes

0 answers

56

KPGCET-CSE-2019-56
The Information Technology encompasses the engineering disciplines of _____, _____, _____ and _______. CSE, ECE, Instrumentation, Telecommunication ECE, Instrumentation, Telecommunication, Electrical CSE, ECE, Instrumentation, Electrical Electrical, CSE, ECE, Telecommunication

gatecse asked in Others Aug 4, 2019

83 views

0 votes

0 answers

57

KPGCET-CSE-2019-57
A society is called information society if majority of people of all walks of life use _______ for their routine information processing. calculator information computer television

gatecse asked in Unknown Category Aug 4, 2019

100 views

0 votes

0 answers

58

KPGCET-CSE-2019-58
In software engineering, the word paradigm means the operators and _______ are within the system. variables operands constants transitive verbs

gatecse asked in Others Aug 4, 2019

95 views

0 votes

0 answers

59

KPGCET-CSE-2019-59
The level $0$ data flow diagram (context diagram) contains the syntactics viz.______,________ and __________only and not _____. data stores,processes,data flows and not actors actors,data flows,processes and not data stores data stores, processes, actors and not data flows data stores, actors, data flows and not processes

gatecse asked in Others Aug 4, 2019

91 views

0 votes

0 answers

60

KPGCET-CSE-2019-60
The conflict serializability can be determined by ______ of the graph containing READs and WRITEs of transactions of a schedule as vertices and READ-WRITE, WRITE-READ and ______ in the time order as edges acyclicity, READ-READ cyclicity, READ-WRITE cyclicity, WRITE-READ acyclicity, WRITE-WRITE

gatecse asked in Unknown Category Aug 4, 2019

111 views

Page:

Recent questions tagged kpgcet-cse-2019