Table of Contents

Table of Contents 1
Contributors 15
1 Algorithms (100) 16
1.1 Activity Selection Problem (1) 17
1.2 Algorithm Design Technique (1) 17
1.3 Algorithm Efficiency (1) 18
1.4 Algorithms Sorting (1) 18
1.5 Array (2) 18
1.6 Artificial Intelligence (2) 18
1.7 Asymptotic Notation (8) 19
1.8 B Tree (2) 20
1.9 Bellman Ford (1) 20
1.10 Binary Heap (1) 21
1.11 Binary Search Tree (1) 21
1.12 Binary Tree (4) 21
1.13 Decision Tree (1) 22
1.14 Depth First Search (3) 22
1.15 Dijkstras Algorithm (1) 23
1.16 Double Hashing (1) 23
1.17 Dynamic Programming (2) 23
1.18 Graph Algorithms (2) 24
1.19 Graph Search (1) 24
1.20 Greedy Algorithms (1) 24
1.21 Huffman Code (2) 25
1.22 In Place Algo (1) 25
1.23 Knapsack Problem (2) 25
1.24 Linear Search (1) 26
1.25 Longest Common Subsequence (1) 26
1.26 Matrix Chain Ordering (4) 26
1.27 Merge Sort (2) 27
1.28 Minimum Spanning Tree (1) 27
1.29 Non Gatecse (1) 28
1.30 Optimal Search Tree (1) 28
1.31 Optimal Solution (1) 29
1.32 P NP NPC NPH (3) 29
1.33 Prims Algorithm (1) 30
1.34 Quick Sort (1) 30
1.35 Recurrence Relation (7) 30
1.36 Recursion (2) 32
1.37 Red Black Tree (1) 32
1.38 Shortest Path (2) 32
1.39 Sorting (4) 33
1.40 Space Complexity (2) 33
1.41 Time Complexity (10) 34
1.42 Topological Sort (1) 36
1.43 Tree (2) 37
1.44 Tree Search Algorithm (2) 37
1.45 Tree Traversal (1) 37
Answer Keys 38
2 Artificial Intelligence (45) 39
2.1 Artificial Intelligence (17) 39
2.2 Artificial Neural Network (1) 43
2.3 Back Propagation (1) 43
2.4 Blocks World Problem (1) 43
2.5 Chaining (1) 44
2.6 Expert System (2) 44
2.7 Fuzzy Logic (1) 44
2.8 Genetic Algorithms (1) 44
2.9 Heuristic Search (1) 45
2.10 Linear Programming (1) 45
 2.11 Machine Learning (2) 45
2.12 Map Coloring (1) 46
2.13 Means End (1) 46
2.14 Minimax Procedure (1) 46
2.15 Neural Network (3) 47
2.16 Planning (1) 47
2.17 Prolog (2) 47
2.18 Reinforcement Learning (1) 48
2.19 Searches (1) 48
2.20 Sigmoid Function (1) 48
2.21 Strips (1) 49
2.22 User Query (1) 49
Answer Keys 49
3 CO and Architecture (100) 50
3.1 8085 Microprocessor (6) 50
3.2 Accumulator (1) 51
3.3 Addressing Modes (11) 52
3.4 Amdahls Law (1) 54
3.5 Assembly (15) 54
3.6 Byte Addressable (1) 57
3.7 CO and Architecture (12) 57
3.8 Cache Memory (5) 60
3.9 Cmos (1) 61
3.10 Compilation Phases (1) 61
3.11 Cpu (1) 61
3.12 DMA (1) 61
3.13 Data Transfer (1) 61
3.14 Dynamic Ram (1) 62
3.15 Flags (1) 62
3.16 Hardware Interrupt (1) 62
3.17 Instruction Format (1) 62
3.18 Integrated Circuits (1) 62
3.19 Interrupts (3) 63
3.20 Language (1) 63
3.21 Machine Instruction (2) 63
3.22 Memory (4) 64
3.23 Memory Data Transfer (1) 65
3.24 Microprocessors (12) 65
3.25 Microprogram Control Unit (1) 67
3.26 Parallel Computing (1) 67
3.27 Parallel Processing (1) 67
3.28 Pipelining (6) 68
3.29 Priority Encoder (1) 69
3.30 Processor Address Bus (1) 69
3.31 Register (1) 69
3.32 Speedup (2) 69
Answer Keys 70
4 Compiler Design (74) 71
4.1 Assembler (2) 75
4.2 Chomsky Normal Form (1) 75
4.3 Code Optimization (2) 76
4.4 Compilation Phases (2) 76
4.5 Compiler Optimization (2) 76
4.6 Constant Folding (1) 77
4.7 Context Sensitive (1) 77
4.8 Control Flow Graph (1) 77
4.9 Grammar (6) 77
4.10 Intermediate Code (1) 79
4.11 LR Parser (2) 79
4.12 Lexical Analysis (3) 79
4.13 Linker (1) 80
4.14 Machine Instruction (1) 80
4.15 Parameter Passing (2) 80
 4.16 Parsing (13) 81
4.17 Quadruple Representation (1) 84
4.18 Runtime Environment (1) 84
4.19 Shift Reduce Parser (2) 84
4.20 Symbol Table (3) 85
4.21 System Software& Compilers (1) 85
4.22 Translator (1) 85
4.23 Two Pass Assembler (1) 86
Answer Keys 86
5 Computer Networks (294) 87
5.1 Analog & Digital Transmission (1) 98
5.2 Analog Signals (1) 98
5.3 Application Layer (1) 98
5.4 Asymmetric Key Cryptography (1) 98
5.5 Asymptotic Notation (1) 98
5.6 Binary Search Tree (1) 99
5.7 Binary Symmetric Channel (1) 99
5.8 Bit Oriented Protocol (1) 99
5.9 Bit Rate (1) 99
5.10 Bridges (1) 99
5.11 CRC Polynomial (2) 100
5.12 Cache Memory (1) 100
5.13 Checksum (1) 100
5.14 Classful Addressing (2) 100
5.15 Classless Addressing (1) 101
5.16 Communication (9) 101
5.17 Computer Neworks (1) 102
5.18 Cryptography (7) 103
5.19 Data Communication (7) 104
5.20 Data Link Layer (7) 106
5.21 Data Mining Algorithm (1) 107
5.22 Data Transmission (1) 107
5.23 Distance Vector Routing (2) 107
5.24 Edi Layer (1) 108
5.25 Electronic Payment Systems (1) 108
5.26 Encoding (2) 108
5.27 Encryption Decryption (2) 108
5.28 Entropy (1) 109
5.29 Error Correction (5) 109
5.30 Error Detection Correction (1) 110
5.31 Ethernet (5) 110
5.32 Firewall (1) 111
5.33 Hamming Distance (1) 111
5.34 Huffman Code (1) 111
5.35 IP Addressing (13) 111
5.36 IP Packet (2) 114
5.37 Internal Memory (1) 114
5.38 Internet Security (1) 114
5.39 Internet Stack Layers (1) 114
5.40 Ipv6 (1) 114
5.41 LAN Technologies (2) 115
5.42 Link State Routing (1) 115
5.43 Loopback Address (1) 115
5.44 Mesh topology (3) 116
5.45 Mobile Communication (7) 116
5.46 Modulation (2) 118
5.47 Multimedia Protocol (1) 118
5.48 Multiple Access Protocol (1) 118
5.49 Multiplexing (2) 118
5.50 Network Addressing (2) 119
5.51 Network Layer (1) 119
5.52 Network Layering (5) 119
5.53 Network Protocols (10) 120
 5.54 Network Security (18) 122
5.55 Network Switching (5) 126
5.56 Network topologies (4) 127
5.57 Osi Model (11) 127
5.58 Osi Protocol (5) 130
5.59 Physical Layer (4) 131
5.60 Port Numbers (1) 131
5.61 Propagation Delay (1) 132
5.62 Propagation Time (1) 132
5.63 Protocol (1) 132
5.64 Rarp Protocol (1) 132
5.65 Routers Bridge Hubs Switches (2) 133
5.66 Routing (4) 133
5.67 Routing Algorithm (3) 134
5.68 Rsa (1) 134
5.69 Rsa Public Key (1) 134
5.70 Rsa Security Networks (2) 134
5.71 Session Layer (1) 135
5.72 Signalling (1) 135
5.73 Signals (1) 135
5.74 Sliding Window (4) 136
5.75 Slotted Aloha (1) 136
5.76 Subnetting (2) 137
5.77 TCP (4) 137
5.78 TCP Header (1) 138
5.79 TCP IP Model (1) 138
5.80 TCP IP Suit Protocols (1) 138
5.81 Tele Communication (1) 138
5.82 Token Bucket (1) 138
5.83 Transmission Media (9) 139
5.84 Unguided Media (1) 140
5.85 Wifi (1) 140
5.86 Wireless Communication (1) 141
5.87 Wireless Lan (4) 141
5.88 Wireless Networks (1) 142
5.89 Wireless Protocol (1) 142
5.90 Wireless Transmission (1) 142
Answer Keys 142
6 Data Mining and Warehousing (17) 145
6.1 Data Cube (1) 145
6.2 Data Mining (1) 145
6.3 Data Mining and Warehousing (1) 145
6.4 Decision Tree (1) 145
6.5 Expert System (1) 145
6.6 Fuzzy Set (1) 146
6.7 Group Decision Support System (1) 146
6.8 K Means Clustering (1) 146
6.9 Knowledge Representation (5) 147
6.10 Non Gatecse (1) 148
6.11 Olap (1) 148
6.12 Perceptron (1) 148
Answer Keys 149
7 Databases (180) 150
7.1 Aggregation (2) 156
7.2 B Tree (2) 156
7.3 B+tree (1) 157
7.4 Bcnf Decomposition (1) 157
7.5 Candidate Key (4) 157
7.6 Cardinality Ratio (1) 158
7.7 Circular Queue (1) 158
7.8 Concurrency Control Protocols (1) 159
7.9 Conflict Serializable (1) 159
7.10 Crosstabquery (1) 159
 7.11 Data Dependency (2) 160
7.12 Data Integrity (1) 160
7.13 Data Mining (2) 160
7.14 Data Model (2) 161
7.15 Database Constraints (1) 161
7.16 Database Design (2) 161
7.17 Database Normalization (23) 162
7.18 Decomposition (3) 166
7.19 Dependency Preserving (1) 167
7.20 Distributed Database (2) 167
7.21 ER Diagram (18) 168
7.22 Enhanced ER Model (1) 172
7.23 File System (1) 173
7.24 Functional Dependency (1) 173
7.25 Generalization (1) 173
7.26 Granularity (1) 173
7.27 Hierarchical Database (1) 173
7.28 Indexing (1) 174
7.29 Java (1) 174
7.30 Joins (2) 174
7.31 Object Oriented Database (2) 175
7.32 Protocol (1) 175
7.33 Question Fixed (1) 176
7.34 Rdbms (8) 176
7.35 Recovery From Failure (1) 178
7.36 Referential Integrity (3) 178
7.37 Relation (1) 179
7.38 Relational Algebra (3) 179
7.39 Relational Calculus (2) 180
7.40 Relational Model (2) 180
7.41 Relational Schema (1) 181
7.42 SQL (33) 181
7.43 Transaction and Concurrency (8) 192
7.44 Transactions and Concurrency Control (2) 194
7.45 Weak Entity (1) 194
Answer Keys 194
8 Digital Logic (114) 196
8.1 Adder (4) 199
8.2 Boolean Algebra (10) 200
8.3 Circuit Output (5) 202
8.4 Combinational Circuit (3) 203
8.5 Digital Circuits (10) 204
8.6 Digital Counter (2) 206
8.7 Encoding (1) 206
8.8 Excess 3 (1) 206
8.9 Flip Flop (10) 206
8.10 Floating Point Representation (2) 208
8.11 Full Adder (1) 209
8.12 IEEE Representation (2) 209
8.13 K Map (6) 209
8.14 Memory (1) 211
8.15 Multiplexer (4) 211
8.16 Number Representation (11) 212
8.17 Number System (10) 214
8.18 Number Theory (1) 216
8.19 Priority Encoder (1) 216
8.20 ROM (1) 216
8.21 Ripple Counter Operation (3) 216
8.22 Sequential Circuit (6) 217
8.23 Sum of Product (1) 218
8.24 Unix (1) 218
Answer Keys 218
9 Discrete Mathematics: Combinatory (18) 220
 9.1 Binary Tree (1) 220
9.2 Combinatory (7) 220
9.3 Counting (3) 221
9.4 Euler Phi Function (1) 222
9.5 Inclusion Exclusion (1) 222
9.6 Parenthesization (1) 222
9.7 Permutation and Combination (1) 222
9.8 Pigeonhole Principle (1) 223
9.9 Recurrence Relation (1) 223
Answer Keys 223
10 Discrete Mathematics: Graph Theory (45) 224
10.1 Binary Tree (1) 228
10.2 Euler Graph (2) 229
10.3 Flow Network (1) 229
10.4 Graph Coloring (3) 230
10.5 Graph Connectivity (7) 230
10.6 Graph Isomorphism (1) 231
10.7 Graph Planarity (2) 232
10.8 Hamiltonian Graph (1) 233
10.9 Handshaking Theorem (1) 233
10.10 Minimum Spanning Tree (1) 233
10.11 Non Planar (1) 234
10.12 Tree (2) 234
Answer Keys 235
11 Discrete Mathematics: Mathematical Logic (44) 236
11.1 Countable Uncountable Set (1) 240
11.2 First Order Logic (5) 240
11.3 Functions (1) 241
11.4 Group Theory (1) 242
11.5 Prolog (1) 242
11.6 Propositional Logic (15) 242
11.7 Relations (1) 246
Answer Keys 246
12 Discrete Mathematics: Set Theory & Algebra (20) 247
12.1 Boolean (1) 247
12.2 Complement In Fuzzy Set (1) 247
12.3 Euler Phi Function (1) 248
12.4 Factors (1) 248
12.5 Function Composition (1) 248
12.6 Functions (3) 248
12.7 Inclusion Exclusion (1) 249
12.8 Poset (1) 249
12.9 Power Set (1) 250
12.10 Relational Algebra (1) 250
12.11 Relations (5) 250
Answer Keys 251
13 Engineering Mathematics: Discrete Mathematics (36) 252
13.1 Boolean Function (1) 254
13.2 Combinatory (2) 254
13.3 Equivalence Class (1) 254
13.4 First Order Logic (2) 254
13.5 Functions (2) 255
13.6 Group Theory (1) 255
13.7 Linear Programming (1) 256
13.8 Number Representation (1) 256
13.9 Partial Order (2) 256
13.10 Propositional Logic (8) 256
13.11 Quantifiers (1) 259
13.12 Relations (1) 259
13.13 Set Theory (2) 259
Answer Keys 259
14 Engineering Mathematics: Linear Algebra (3) 261
 14.1 Eigen Value (1) 261
Answer Keys 262
15 Engineering Mathematics: Probability (13) 263
15.1 Binary Tree (1) 263
15.2 Joint Distribution (1) 263
15.3 Poisson Distribution (1) 263
15.4 Probability (9) 263
Answer Keys 265
16 General Aptitude: Analytical Aptitude (1) 266
16.1 Number Series (1) 266
Answer Keys 266
17 General Aptitude: Quantitative Aptitude (27) 267
17.1 Data Interpretation (5) 272
17.2 Number System (1) 274
17.3 Percentage (1) 274
17.4 Quadratic Equations (1) 275
17.5 Work Time (1) 275
Answer Keys 275
18 General Aptitude: Verbal Aptitude (8) 276
18.1 Logical Reasoning (2) 277
Answer Keys 277
19 Non GATE CSE: Big Data Systems (1) 278
19.1 Big Data Systems (1) 278
Answer Keys 278
20 Non GATE CSE: Cloud Computing (2) 279
20.1 Cloud Computing (2) 279
Answer Keys 279
21 Non GATE CSE: Computer Graphics (83) 280
21.1 2d Geometry (1) 280
21.2 2d Transformation (1) 280
21.3 3d Graphics (2) 280
21.4 3d Rotation (1) 281
21.5 Animation (1) 281
21.6 Anti Aliasing (1) 281
21.7 Breshenmans Algorithm (1) 281
21.8 Color Models (1) 282
21.9 Computer Graphics (41) 282
21.10 Crt (2) 292
21.11 Digital Image Processing (5) 293
21.12 Display Devices (1) 294
21.13 Frame Buffer (1) 294
21.14 Halftoning (1) 294
21.15 Image Compression (1) 294
21.16 Image Entropy (1) 295
21.17 Image Rotation (2) 295
21.18 Line Clipping (1) 295
21.19 Line Drawing Algorithm (3) 295
21.20 Parametric Line Equation (1) 296
21.21 Phong Color Model (1) 296
21.22 Projection (8) 296
21.23 Raster Graphics (2) 298
21.24 Resolution (1) 299
21.25 Transformation (2) 299
Answer Keys 299
22 Non GATE CSE: Computer Peripherals (3) 301
22.1 Computer Peripherals (1) 301
22.2 IO Devices (1) 301
22.3 Matrix Printer (1) 301
Answer Keys 301
23 Non GATE CSE: Digital Image Processing (8) 302
23.1 Discovolution (1) 302
 23.2 Entropy (2) 302
23.3 Fourier Transform (1) 302
23.4 Image Compression (4) 302
Answer Keys 303
24 Non GATE CSE: Digital Signal Processing (5) 304
24.1 Butterworth Lowpass Filter (1) 304
24.2 Digital Signal Processing (1) 304
24.3 Discrete Memoryless Channel (1) 304
24.4 Spatial Mask (1) 304
Answer Keys 305
25 Non GATE CSE: Distributed Computing (11) 306
25.1 Computing Models (1) 306
25.2 Distributed Computing (3) 306
25.3 Distributed Database (2) 306
25.4 Distributed System (2) 307
25.5 Message Passing (1) 307
25.6 Parallel Virtual Machine (1) 308
25.7 Rpc (1) 308
Answer Keys 308
26 Non GATE CSE: Geometry (2) 309
26.1 Geometry (1) 309
26.2 Lines Curves (1) 309
Answer Keys 309
27 Non GATE CSE: Integrated Circuits (1) 310
27.1 Integrated Circuits (1) 310
Answer Keys 310
28 Non GATE CSE: IS&Software Engineering (215) 311
28.1 Adaptive Maintenance (1) 314
28.2 Artificial Intelligence (2) 315
28.3 Assignment Problem (1) 315
28.4 CRC Polynomial (1) 315
28.5 Cmm Model (3) 316
28.6 Cmmi (1) 316
28.7 Cocomo Model (3) 317
28.8 Coding and Testing (1) 317
28.9 Cohesion (2) 318
28.10 Cost Estimation Model (2) 318
28.11 Coupling (3) 319
28.12 Coupling Cohesion (1) 319
28.13 Cyclomatic Complexity (2) 320
28.14 Data Mining (2) 320
28.15 Digital Marketing (1) 320
28.16 Fan In (1) 320
28.17 Flow Chart (1) 321
28.18 Function Point Metric (2) 321
28.19 Git (1) 321
28.20 Information System (1) 321
28.21 Is&software Engineering (62) 322
28.22 Life Cycle Model (1) 335
28.23 Mis (1) 335
28.24 Model View Controller (1) 335
28.25 Object Oriented Modelling (1) 336
28.26 Optimization (1) 336
28.27 Project Planning (1) 336
28.28 Project Tracking (1) 336
28.29 Risk Management (3) 337
28.30 Size Metrices (1) 337
28.31 Software (1) 337
28.32 Software Configuration (1) 338
28.33 Software Cost Estimation (1) 338
28.34 Software Design (18) 338
28.35 Software Development (3) 342
 28.36 Software Development Life Cycle Models (11) 343
28.37 Software Development Models (1) 345
28.38 Software Intergrity (1) 345
28.39 Software Maintenance (2) 346
28.40 Software Metrics (3) 346
28.41 Software Process (1) 347
28.42 Software Quality Assurance (2) 347
28.43 Software Quality Characteristics (1) 347
28.44 Software Reliability (11) 347
28.45 Software Requirement Specification (1) 350
28.46 Software Requirement Specifications (1) 350
28.47 Software Reuse (1) 350
28.48 Software Testing (22) 351
28.49 Software Validation (1) 355
28.50 Source Code Metric (1) 355
28.51 Uml (1) 355
28.52 Validation (1) 355
28.53 Waterfall Model (2) 355
28.54 White Box Testing (1) 356
Answer Keys 356
29 Non GATE CSE: Java (10) 358
29.1 Abstract Method (1) 358
29.2 Applet (1) 358
29.3 Java (3) 358
29.4 Method Overriding (1) 359
29.5 Multi Threaded Programming (1) 359
29.6 Oops (1) 359
29.7 Servlet (1) 360
29.8 Wrapper Class Object (1) 360
Answer Keys 360
30 Non GATE CSE: Numerical Methods (3) 361
30.1 Hungarian Method (1) 361
30.2 Operation Research Pert Cpm (1) 361
30.3 Simplex Method (1) 361
Answer Keys 361
31 Non GATE CSE: Object Oriented Programming (59) 362
31.1 Abstract Class (2) 362
31.2 C++ (2) 363
31.3 Composition (1) 363
31.4 Constructor (3) 363
31.5 Final (1) 364
31.6 Friend Class (1) 364
31.7 Friend Function (2) 365
31.8 Inheritance (3) 365
31.9 Java (10) 366
31.10 Object Oriented Programming (25) 368
31.11 Operator Overloading (1) 373
31.12 Programming In C (1) 373
31.13 Software Design (1) 374
31.14 Template Vs Macro (1) 374
31.15 Windows (1) 374
Answer Keys 374
32 Non GATE CSE: Optimization (18) 376
32.1 Assignment Problem (2) 376
32.2 Dual Linear Programming (1) 376
32.3 Linear Programming (1) 376
32.4 Linear Programming Problem (1) 376
32.5 Optimization (8) 377
32.6 Transportation Problem (5) 378
Answer Keys 380
33 Non GATE CSE: Others (150) 381
33.1 3 Puzzle (1) 406
 33.2 Algorithm Design (1) 407
33.3 Alpha Beta Pruning (1) 407
33.4 Alpha Cut (1) 407
33.5 Application Software (1) 407
33.6 Bigdata Hadoop (1) 408
33.7 Convex Optimization (1) 408
33.8 Data Mining (2) 408
33.9 Data Warehousing (4) 409
33.10 Debugger (1) 410
33.11 Defuzzification (1) 410
33.12 Encryption Decryption (1) 410
33.13 Fuzzy Relation (1) 410
33.14 Fuzzy Set (5) 411
33.15 Geographical Information System (1) 412
33.16 Hill Climbing Search (1) 412
33.17 Inventory (1) 412
33.18 K Mean Clustering (1) 413
33.19 Llp (1) 413
33.20 Machine Learning (1) 413
33.21 Net Exam (1) 413
33.22 Operational Research (2) 414
33.23 Optimization (1) 414
33.24 Process Scheduling (1) 414
33.25 Searching (1) 414
33.26 Shell (1) 415
33.27 Shell Script (2) 415
33.28 Simplex (1) 415
33.29 Simplex Method (2) 416
33.30 System Software& Compilers (1) 416
33.31 Transportation Problem (1) 417
33.32 Unified Modeling Language (1) 417
33.33 Unix (4) 417
33.34 Vertex Cover (1) 418
33.35 Windows (1) 418
Answer Keys 419
34 Non GATE CSE: Web Technologies (32) 420
34.1 Activex (1) 420
34.2 Client Server Application (1) 420
34.3 Data Warehousing (1) 420
34.4 E Commerce (1) 420
34.5 Edi Layer (2) 420
34.6 Html (5) 421
34.7 Javascript (2) 422
34.8 Non Gatecse (1) 422
34.9 Transmission Media (1) 422
34.10 Trojan Horse (1) 423
34.11 Web Technologies (8) 423
34.12 Xml (7) 424
34.13 Xsl (1) 426
Answer Keys 426
35 Operating System (232) 427
35.1 Applications In Windows (1) 437
35.2 Bankers Algorithm (3) 437
35.3 Binary Semaphore (1) 437
35.4 Counting Semaphores (1) 438
35.5 Critical Section (1) 438
35.6 Deadlock Prevention Avoidance Detection (9) 438
35.7 Delay (1) 440
35.8 Dijkstras Bankers Algorithm (1) 440
35.9 Directory Structure (1) 440
35.10 Disk (10) 441
35.11 Disk Cpu Memory Interrupt (1) 443
35.12 Disk Scheduling (9) 443
 35.13 Distributed Computing (1) 445
35.14 Distributed System (1) 445
35.15 Dynamic Linking (1) 445
35.16 Effective Memory Access (1) 445
35.17 File System (7) 446
35.18 Fragmentation (1) 447
35.19 Hard Disk Drive (1) 447
35.20 Hit Ratio (1) 448
35.21 IO Handling (1) 448
35.22 Input Output (2) 448
35.23 Interrupts (2) 449
35.24 Java (1) 449
35.25 Linux (1) 449
35.26 Memory Management (8) 450
35.27 Mmu (1) 451
35.28 Monitors (1) 452
35.29 Multiprogramming Os (1) 452
35.30 Mutual Exclusion (1) 452
35.31 Non Gatecse (3) 452
35.32 Page Replacement (9) 453
35.33 Pipelining (1) 455
35.34 Process (2) 455
35.35 Process Model (2) 455
35.36 Process Scheduling (25) 456
35.37 Process Synchronization (2) 461
35.38 Ram (1) 462
35.39 Resource Allocation (2) 462
35.40 Runtime Environment (1) 463
35.41 Scheduling (4) 463
35.42 Seek Latency (1) 464
35.43 Semaphore (3) 464
35.44 Shell Script (7) 465
35.45 Sjf (1) 467
35.46 Sstf (1) 467
35.47 Storage Devices (1) 467
35.48 System Call (2) 467
35.49 System Reliability (1) 468
35.50 Threads (4) 469
35.51 Transaction and Concurrency (1) 469
35.52 Unix (24) 470
35.53 Virtual Memory (7) 475
35.54 Vsam (1) 476
35.55 Windows (5) 476
Answer Keys 477
36 Others: Others (687) 479
36.1 Abelian Group (1) 586
36.2 Acid Properties (1) 586
36.3 Array (1) 586
36.4 Artificial Intelligence (1) 586
36.5 Assembly (1) 587
36.6 Binary Heap (1) 587
36.7 Binary Tree (1) 587
36.8 Boolean Algebra (1) 588
36.9 Combinatory (1) 588
36.10 Compilation Phases (1) 588
36.11 Crypt Arithmetic (1) 588
36.12 Data Compression (1) 588
36.13 Data Flow Diagram (1) 589
36.14 Data Mart (1) 589
36.15 Data Mining (4) 589
36.16 Data Warehousing (2) 590
36.17 Deadlock Prevention Avoidance Detection (1) 590
36.18 Decomposition (1) 590
36.19 Digital Image Processing (3) 590
36.20 Disk (1) 591
36.21 Disk Scheduling (1) 591
36.22 Duality (1) 591
36.23 E Commerce (2) 592
36.24 E Payment (1) 592
36.25 E Technologies (3) 592
36.26 Encryption Decryption (2) 593
36.27 Enterprise Resource Planning (2) 593
36.28 Error Correction (1) 594
36.29 File System (1) 594
36.30 Fuzzy Logic (2) 594
36.31 Fuzzy Relations (1) 594
36.32 Fuzzy Set (2) 595
36.33 General Awareness (33) 595
36.34 Hashing (2) 603
36.35 Image Compression (1) 603
36.36 Information System (1) 603
36.37 Interpreter (1) 604
36.38 Is&software Engineering (1) 604
36.39 Java (1) 604
36.40 Job (1) 604
36.41 Kruskals Algorithm (1) 604
36.42 Linear Programming (3) 605
36.43 Linker (2) 606
36.44 Linux (1) 606
36.45 Management Information System (2) 606
36.46 Microprocessors (1) 607
36.47 Minimum Spanning Tree (1) 607
36.48 Mis (1) 608
36.49 Mobile Communication (2) 608
36.50 Multiple Document Interface (1) 608
36.51 Natural Join (1) 608
36.52 Natural Language Processing (1) 609
36.53 Network Switching (1) 609
36.54 Neural Network (6) 609
36.55 Non Gatecse (9) 610
36.56 Number System (1) 613
36.57 Oops Concept (1) 613
36.58 Operator Overloading (1) 613
36.59 Parsing (1) 613
36.60 Pipelining (1) 613
36.61 Process Scheduling (2) 613
36.62 Prolog (1) 614
36.63 Quadratic Equations (1) 614
36.64 Queue (1) 614
36.65 Rdbms (2) 614
36.66 Relations (1) 615
36.67 Semantic Nets (1) 615
36.68 Shell (1) 616
36.69 Single Layer Perceptron (1) 616
36.70 Software Development Life Cycle Models (1) 616
36.71 Software Engineering Framework (1) 616
36.72 Software Testing (1) 617
36.73 System Software Compilers (1) 617
36.74 Transaction and Concurrency (3) 617
36.75 Transportation Problem (3) 618
36.76 Tree (2) 618
36.77 Unix (4) 619
36.78 Virtual Memory (1) 620
36.79 Windows (5) 620
36.80 Windows Programming (2) 621
Answer Keys 621
37 Programming and DS (26) 626
37.1 Array (2) 626
37.2 Array of Pointers (1) 626
37.3 Dangling Pointers (1) 626
37.4 Data Types (1) 626
37.5 Input Output Statement (1) 627
37.6 Operator Precedence (2) 627
37.7 Operators (2) 627
37.8 Parameter Passing (1) 628
37.9 Pointer Declaration (1) 628
37.10 Programming In C (12) 628
37.11 Storage Classes In C (1) 631
37.12 Three Dimensional Array (1) 632
Answer Keys 632
38 Programming and DS: DS (107) 633
38.1 AVL Tree (2) 635
38.2 B Tree (1) 636
38.3 B and Bplus Trees (1) 636
38.4 Binary Heap (7) 636
38.5 Binary Search Tree (6) 638
38.6 Binary Tree (7) 639
38.7 Cryptography (1) 640
38.8 Data Structures (7) 640
38.9 Graph Algorithms (1) 642
38.10 Graph Connectivity (1) 642
38.11 Hashing (13) 642
38.12 Infix Prefix (2) 645
38.13 Linear Probing (1) 645
38.14 Linked List (2) 645
38.15 Max Heap (1) 646
38.16 Minimum Spanning Tree (2) 646
38.17 Priority (1) 646
38.18 Priority Queue (2) 646
38.19 Queue (5) 647
38.20 Quick Sort (1) 648
38.21 Radix Sort (2) 648
38.22 Recursion (1) 648
38.23 Relational Algebra (1) 649
38.24 Stack (13) 649
38.25 Tree (11) 651
38.26 Tree Traversal (1) 653
Answer Keys 654
39 Programming: Programming in C (84) 655
39.1 Aliasing (1) 660
39.2 Array (3) 660
39.3 Binary Search Tree (1) 661
39.4 Bitwise Operation (1) 661
39.5 Data Types (2) 662
39.6 Dynamic Memory Allocation (1) 662
39.7 Evaluation Postfix (1) 662
39.8 Exception Handling (1) 662
39.9 Expression Evaluation (1) 663
39.10 File Handling (1) 663
39.11 Graph Coloring (1) 663
39.12 IO Statement (1) 663
39.13 Java (4) 664
39.14 Linked List (1) 664
39.15 Loop (1) 665
39.16 Non Gatecse (4) 665
39.17 Object Oriented Programming (3) 666
39.18 Operator Precedence (1) 667
39.19 Operators (1) 667
39.20 Pointers (2) 667
 39.21 Programming In C (15) 668
39.22 Pseudocode (1) 671
39.23 Row Major Address Calculation (1) 671
39.24 Storage Classes In C (2) 671
39.25 Tree Traversal (1) 672
39.26 Undefined Behaviour (1) 672
39.27 Union (1) 672
39.28 Variable Scope (4) 673
Answer Keys 674
40 Theory of Computation (143) 675
40.1 Closure Property (3) 680
40.2 Complement (1) 681
40.3 Context Free Grammar (9) 681
40.4 Context Free Language (8) 683
40.5 Context Sensitive (2) 685
40.6 Decidability (5) 685
40.7 Expression (1) 687
40.8 Finite Automata (10) 687
40.9 Grammar (15) 689
40.10 Identify Class Language (8) 693
40.11 Language (1) 695
40.12 Languages Classification (1) 695
40.13 Languages Relationships (1) 695
40.14 Minimal State Automata (1) 695
40.15 Parsing (1) 696
40.16 Pumping Lemma (3) 696
40.17 Pushdown Automata (5) 696
40.18 Recursive and Recursively Enumerable Languages (3) 697
40.19 Regular Expression (18) 698
40.20 Regular Grammar (4) 702
40.21 Regular Language (9) 703
40.22 Right Quotient (1) 705
40.23 Strings (1) 706
40.24 Turing Machine (5) 706
Answer Keys 707
41 Unknown Category (197) 709
41.1 Binary Heap (1) 750
41.2 Binary Search Tree (1) 750
41.3 CO and Architecture (2) 751
41.4 Clustering (1) 751
41.5 Database Normalization (1) 751
41.6 Disk Scheduling (1) 751
41.7 Dynamic Programming (1) 752
41.8 E Technologies (1) 752
41.9 Ethernet (1) 752
41.10 Graph Algorithms (1) 752
41.11 IP Addressing (1) 753
41.12 Indexing (1) 753
41.13 Linked List (1) 753
41.14 Microprocessors (1) 753
41.15 Minimum Spanning Tree (1) 753
41.16 Multiplexing (1) 754
41.17 Osi Model (1) 754
41.18 Physical Layer (1) 754
41.19 SQL (1) 754
41.20 Software Testing (1) 755
41.21 Sorting (1) 755
41.22 Stack (1) 755
41.23 Transaction and Concurrency (1) 755
Answer Keys 756
Contributors
User
, Answers User
Added User
Done
sanjay 1151, 560 GO 1388 soujanyareddy13 576
shekhar 676, 171 Editor Pooja Khatri 503
chauhan Misbah Ghaya 548 Arjun 458
Leen Sharma 369, 114 Arjun 335 Suresh
VIPIN NARAYAN 342, 177 Suresh sanjay 284
Prashant 216, 87 soujanyareddy13 134 Misbah Ghaya 258
Singh RISHABH 126 Lakshman Patel 214
papesh 92, 28 KUMAR GO 136
Muktinath Vishwakarma 90, 15 admin 108 Editor
Debasmita 80, 49 Pooja Khatri 99 Don't defeat anybody but yourself. 133
Bhoumik sanjay 57 Hira 106
Satbir 63, 19 Rajesh Prajapati 14 Sankaranarayanan P.N 85
Singh RISHABH 68
Hira 54, 51 KUMAR
RISHABH 47, 101 Krithiga2101 64
KUMAR Leen Sharma 52
Dhananjay Kumar Sharma 46, 12 Prashant 47
Arjun 45, 13 Singh
Suresh VIPIN NARAYAN 46
srestha 39, 16 Debasmita 37
Jeet 39, 16 Bhoumik
Praveen Saini 37, 4 srestha 32
Rajesh Pradhan 36, 26 gatecse 28
kunal chalotra 35, 20 sourav. 25
Shaik Masthan 35, 20 Manoj Kumar 24
asutosh kumar Biswal 32, 16 Sujith 22
Kapil Phulwani 31, 7 Shiva Sagar Rao 22
Deepak Poonia 30, 13 Sabiha 20
Sayan Bose 30, 15 banu
Sankaranarayanan P.N 26, 13 Cristine 19
Ashwani Kumar 25, 16 shekhar 18
Prasanjeet Ghosh 25, 22 chauhan
Resmi 13
Arjun
Deepak Poonia 13
papesh 12
Jeet 12
Dhananjay Kumar Sharma 11
SuShrut2311 11
Kapil Phulwani 10
Satbir 10
Singh
asutosh kumar Biswal 10
Desert_Warrior 9
deepthi 9
Bikram 9
Krishanveer Gangwar 9
Shubham Sharma 8
shivani Sharma 8
shahidhope 7
Meenakshi Sharma 6
im.raj 6
Rajesh Pradhan 6
Prajwal Bhat 6
Rajesh Prajapati 6
1 Algorithms (100)

1.0.1 UGC NET CSE | June 2012 | Part 2 | Question: 2

The post order traversal of a binary tree is DEBFCA. Find out the pre-order traversal

A. ABFCDE B. ADBFEC C. ABDECF D. None of the above

ugcnetcse-june2012-paper2 algorithms

Answer key ☟

1.0.2 UGC NET CSE | August 2016 | Part 3 | Question: 36

Match the following :

where is the set of nodes and is the set of edges in the graph.

A.
B.
C.
D.

ugcnetcse-aug2016-paper3 algorithms

Answer key ☟

1.0.3 UGC NET CSE | July 2018 | Part 2 | Question: 30

Consider a Boolean function of 'n' variables. The order of an algorithm that determines whether the Boolean
function produces a output 1 is

A. Logarithmic B. Linear C. Quadratic D. Exponential

ugcnetcse-july2018-paper2 algorithms

Answer key ☟

1.0.4 UGC NET CSE | July 2018 | Part 2 | Question: 27

Match the following with respect to algorithm paradigms :

A. B.
C. D.
ugcnetcse-july2018-paper2 algorithms

Answer key ☟
 1.0.5 UGC NET CSE | January 2017 | Part 3 | Question: 36

Match the following with respect to algorithm paradigms :

A. B.
C. D.
ugcnetcse-jan2017-paper3 algorithms easy match-the-following

Answer key ☟

1.0.6 UGC NET CSE | December 2004 | Part 2 | Question: 25

How much extra space is used by heapsort ?

A. B. C. D.
algorithms heap-sort ugcnetcse-dec2004-paper2

Answer key ☟

1.0.7 UGC NET CSE | October 2020 | Part 2 | Question: 90

Given below are two statements:

Statement : A genetic algorithm is a stochastic hill-climbing search in which a large population of states is
maintained
Statement : In nondeterministic environments, agents can apply AND-OR search to generate contingent plans that
reach the goal regardless of which outcomes occur during execution.
In the light of the above statements, choose the correct answer from the options given below

A. Both Statement and Statement are true

B. Both Statement and Statement are false
C. Statement is correct but Statement is false
D. Statement is incorrect but Statement is true

algorithms ugcnetcse-oct2020-paper2

Answer key ☟

1.1 Activity Selection Problem (1)

1.1.1 Activity Selection Problem: UGC NET CSE | December 2015 | Part 3 | Question: 16

In Activity-Selection problem, each activity has a start time and a finish time where . Activities
and are compatible if
A. B.
C. or D. and
ugcnetcse-dec2015-paper3 algorithms activity-selection-problem

Answer key ☟

1.2 Algorithm Design Technique (1)

1.2.1 Algorithm Design Technique: UGC NET CSE | December 2006 | Part 2 | Question: 22

Binary search tree is an example of :

 A. Divide and conquer technique B. Greedy algorithm
C. Back tracking D. Dynamic Programming
ugcnetcse-dec2006-paper2 algorithms easy algorithm-design-technique

Answer key ☟

1.3 Algorithm Efficiency (1)

1.3.1 Algorithm Efficiency: UGC NET CSE | Junet 2015 | Part 2 | Question: 25

To determine the efficiency of an algorithm the time factor is measured by

A. Counting micro seconds B. Counting number of key operations

C. Counting number of statements D. Counting kilobytes of algorithm
ugcnetcse-june2015-paper2 algorithm-efficiency

Answer key ☟

1.4 Algorithms Sorting (1)

1.4.1 Algorithms Sorting: UGC NET CSE | Junet 2015 | Part 2 | Question: 48

Which of the following algorithms sort integers, having the range to , in ascending order in
time?

A. Selection sort B. Bubble sort

C. Radix sort D. Insertion sort
ugcnetcse-june2015-paper2 algorithms-sorting

Answer key ☟

1.5 Array (2)

1.5.1 Array: UGC NET CSE | January 2017 | Part 2 | Question: 21

Which of the following is true for computation time in insertion, deletion and finding maximum and minimum
element in a sorted array ?

A. Insertion – , Deletion – , Maximum – , Minimum –

B. Insertion – , Deletion – , Maximum – , Minimum –
C. Insertion – , Deletion – , Maximum – , Minimum –
D. Insertion – , Deletion – , Maximum – , Minimum –

ugcnetjan2017ii algorithms array

Answer key ☟

1.5.2 Array: UGC NET CSE | July 2016 | Part 3 | Question: 32

Let be an array of n distinct numbers. If and , then the pair is called an

inversion of . What is the expected number of inversions in any permutation on elements?

A. B. C. D.
ugcnetcse-july2016-paper3 algorithms array

Answer key ☟

1.6 Artificial Intelligence (2)

1.6.1 Artificial Intelligence: UGC NET CSE | June 2014 | Part 3 | Question: 31

Consider Where function is a measure of the cost of getting from the start node to the
current node. and is an estimate of the additional cost of getting from the current node to the goal node.
Then is used in which one of the following algorithms?
 A. algorithm B. algorithm
C. Greedy best first search algorithm D. Iterative algorithm
ugcnetjune2014iii artificial-intelligence algorithms

Answer key ☟

1.6.2 Artificial Intelligence: UGC NET CSE | June 2014 | Part 3 | Question: 33

________ is used in game trees to reduce the number of branches of the search tree to be traversed without
affecting the solution.
A. Best first search B. Goal stack planning
C. Alpha-beta pruning procedure D. Min-max search
ugcnetjune2014iii artificial-intelligence algorithms

Answer key ☟

1.7 Asymptotic Notation (8)

1.7.1 Asymptotic Notation: UGC NET CSE | December 2013 | Part 2 | Question: 35

Big-O estimate for is given as

A. B. C. D.
ugcnetcse-dec2013-paper2 algorithms easy asymptotic-notation

Answer key ☟

1.7.2 Asymptotic Notation: UGC NET CSE | December 2013 | Part 3 | Question: 35

Let and be two matrices. The efficient algorithm to multiply the two matrices has the time
complexity

A. B. C. D.
ugcnetcse-dec2013-paper3 algorithms asymptotic-notation

Answer key ☟

1.7.3 Asymptotic Notation: UGC NET CSE | December 2013 | Part 3 | Question: 36

The recurrence relation is satisfied by

A. O(n ) B. O(n )
C. O(n D. O(n lg n)
ugcnetcse-dec2013-paper3 algorithms asymptotic-notation recurrence-relation

Answer key ☟

1.7.4 Asymptotic Notation: UGC NET CSE | January 2017 | Part 3 | Question: 31

The asymptotic upper bound solution of the recurrence relation given by is

A. B.
C. D.
ugcnetcse-jan2017-paper3 algorithms asymptotic-notation recurrence-relation

Answer key ☟

1.7.5 Asymptotic Notation: UGC NET CSE | June 2014 | Part 2 | Question: 24

Big- estimates for the factorial function and the logarithm of the factorial function i.e. and is given by

A. and B. and
C. and D. and
ugcnetcse-june2014-paper2 algorithms time-complexity asymptotic-notation
 Answer key ☟

1.7.6 Asymptotic Notation: UGC NET CSE | June 2014 | Part 2 | Question: 39

An algorithm is made up of modules and . If time complexity of modules and are and
respectively, the time complexity of the algorithm is
A. B.
C. D.
ugcnetcse-june2014-paper2 algorithms time-complexity asymptotic-notation

Answer key ☟

1.7.7 Asymptotic Notation: UGC NET CSE | June 2014 | Part 3 | Question: 61

Given the following equalities : for all fixed and and .

. Which of the following is true ?

1. is correct and is correct.

2. is correct and is not correct.
3. is not correct and is correct.
4. is not correct and is not correct.

asymptotic-notation ugcnetjune2014iii

Answer key ☟

1.7.8 Asymptotic Notation: UGC NET CSE | Junet 2015 | Part 3 | Question: 35

Let and be asymptotically non-negative functions. Which of the following is correct?

A. B.
C. D.
asymptotic-notation algorithms ugcnetcse-june2015-paper3

Answer key ☟

1.8 B Tree (2)

1.8.1 B Tree: UGC NET CSE | December 2010 | Part 2 | Question: 21

What is the maximum number of nodes in a B-tree of order of depth (root at depth ) ?

A. B. C. D. None of the above

ugcnetcse-dec2010-paper2 algorithms b-tree

Answer key ☟

1.8.2 B Tree: UGC NET CSE | December 2013 | Part 2 | Question: 24

For any B-tree of minimum degree t 2, every node other than the root must have at least ____ keys and every
node can have at most ____ keys.

A. t-1, 2t+1 B. t+1, 2t+1 C. t-1, 2t-1 D. t+1, 2t-1

ugcnetcse-dec2013-paper2 algorithms b-tree

Answer key ☟

1.9 Bellman Ford (1)

1.9.1 Bellman Ford: UGC NET CSE | October 2020 | Part 2 | Question: 70

Match with
 Choose the correct answer from the options given below:
A. B.
C. D.

ugcnetcse-oct2020-paper2 topological-sort bellman-ford algorithms match-the-following

Answer key ☟

1.10 Binary Heap (1)

1.10.1 Binary Heap: UGC NET CSE | December 2012 | Part 3 | Question: 51

Suppose there are sorted lists of element each. The time complexity of producing a sorted list of all
these elements is (use heap data structure)

A. B.
C. D.
ugcnetcse-dec2012-paper3 algorithms time-complexity binary-heap

Answer key ☟

1.11 Binary Search Tree (1)

1.11.1 Binary Search Tree: UGC NET CSE | January 2017 | Part 2 | Question: 25

Which of the following statements is false?

A. Optimal binary search tree construction can be performed efficiently using dynamic programming.
B. Breadth-first search cannot be used to find connected components of a graph.
C. Given the prefix and postfix walks of a binary tree, the tree cannot be reconstructed uniquely.
D. Depth-first-search can be used to find the connected components of a graph.

ugcnetjan2017ii algorithms binary-tree binary-search-tree

Answer key ☟

1.12 Binary Tree (4)

1.12.1 Binary Tree: UGC NET CSE | December 2010 | Part 2 | Question: 22

A binary tree with nodes has _______ null branches.

A. B. C. D. None of the above

ugcnetcse-dec2010-paper2 algorithms binary-tree

Answer key ☟

1.12.2 Binary Tree: UGC NET CSE | December 2011 | Part 2 | Question: 19

The post order traversal of a binary tree is DEBFCA. Find out the preorder traversal.
 A. ABFCDE B. ADBFEC C. ABDECF D. ABDCEF
ugcnetcse-dec2011-paper2 algorithms binary-tree

Answer key ☟

1.12.3 Binary Tree: UGC NET CSE | December 2011 | Part 2 | Question: 50

The number of nodes in a complete binary tree of height (with roots at level ) is equal to

A. B.
C. D.
ugcnetcse-dec2011-paper2 algorithms binary-tree

Answer key ☟

1.12.4 Binary Tree: UGC NET CSE | December 2014 | Part 2 | Question: 25

A full binary tree with leaves contains

A. nodes B. nodes
C. nodes D. nodes
ugcnetcse-dec2014-paper2 algorithms binary-tree

Answer key ☟

1.13 Decision Tree (1)

1.13.1 Decision Tree: UGC NET CSE | December 2014 | Part 3 | Question: 31

Any decision tree that sorts elements has height

A. B. C. D.
ugcnetcse-dec2014-paper3 algorithms decision-tree

Answer key ☟

1.14 Depth First Search (3)

1.14.1 Depth First Search: UGC NET CSE | December 2015 | Part 2 | Question: 36

In the following graph, discovery time stamps and finishing time stamps of Depth First Search (DFS) are shown
as , where is discovery time stamp and is finishing time stamp.

It shows which of the following depth first forest?

A. {a,b,e} {c,d,f,g,h} B. {a,b,e} {c,d,h} {f,g}

C. {a,b,e} {f,g} {c,d} {h} D. {a,b,c,d} {e,f,g} {h}
ugcnetcse-dec2015-paper2 algorithms depth-first-search

Answer key ☟
 1.14.2 Depth First Search: UGC NET CSE | June 2013 | Part 3 | Question: 68

Which one of the following is not an informed search technique?

A. Hill climbing search B. Best first search

C. A* search D. Depth first search
ugcnetcse-june2013-paper3 algorithms depth-first-search

Answer key ☟

1.14.3 Depth First Search: UGC NET CSE | June 2019 | Part 2 | Question: 65

Which of the following is application of depth-first search?

A. Only topological sort

B. Only strongly connected components
C. Both topological sort and strongly connected components
D. Neither topological sort nor strongly connected components

ugcnetcse-june2019-paper2 depth-first-search

Answer key ☟

1.15 Dijkstras Algorithm (1)

1.15.1 Dijkstras Algorithm: UGC NET CSE | January 2017 | Part 3 | Question: 35

Dijkstra’s algorithm is based on

A. Divide and conquer paradigm B. Dynamic programming

C. Greedy approach D. Backtracking paradigm
ugcnetcse-jan2017-paper3 algorithms dijkstras-algorithm

Answer key ☟

1.16 Double Hashing (1)

1.16.1 Double Hashing: UGC NET CSE | June 2019 | Part 2 | Question: 66

Consider double hashing of the form

where where and
. For , what is the difference between first and second probes in terms of slots?

A. B. C. D.
ugcnetcse-june2019-paper2 double-hashing

Answer key ☟

1.17 Dynamic Programming (2)

1.17.1 Dynamic Programming: UGC NET CSE | December 2013 | Part 3 | Question: 37

The longest common subsequence of the sequences and

has length

A. B. C. D.
ugcnetcse-dec2013-paper3 algorithms dynamic-programming

Answer key ☟

1.17.2 Dynamic Programming: UGC NET CSE | July 2016 | Part 3 | Question: 36

A triangulation of a polygon is a set of chords that divide the polygon into disjoint triangles. Every
triangulation of vertex convex polygon has ____ chords and divides the polygon into ____ triangles
 A. B. C. D.
ugcnetcse-july2016-paper3 algorithms dynamic-programming

Answer key ☟

1.18 Graph Algorithms (2)

1.18.1 Graph Algorithms: UGC NET CSE | December 2015 | Part 3 | Question: 20

Floyd-Warshall algorithm utilizes _____ to solve the all-pairs shortest paths problem on a directed graph in
____ time

A. Greedy algorithm, B. Greedy algorithm,

C. Dynamic programming, D. Dynamic programming,
ugcnetcse-dec2015-paper3 graph-algorithms algorithms

Answer key ☟

1.18.2 Graph Algorithms: UGC NET CSE | June 2019 | Part 2 | Question: 61

Match List-I with List-II:

Choose the correct option from those options given below:

A. (a) – (ii); (b)-(iv); (c)-(i); (d)-(iii)

B. (a) – (iii); (b)-(iv); (c)-(i); (d)-(ii)
C. (a) – (ii); (b)-(i); (c)-(iv); (d)-(iii)
D. (a) – (iii); (b)-(i); (c)-(iv); (d)-(ii)

ugcnetcse-june2019-paper2 graph-algorithms

Answer key ☟

1.19 Graph Search (1)

1.19.1 Graph Search: UGC NET CSE | June 2012 | Part 3 | Question: 51

The strategy used to reduce the number of tree branches and the number of static evaluations applied in case of a
game tree is

A. Minmax strategy B. Alpha-beta pruning strategy

C. Constraint satisfaction strategy D. Static max strategy
ugcnetcse-june2012-paper3 algorithms graph-search tree-traversal

Answer key ☟

1.20 Greedy Algorithms (1)

1.20.1 Greedy Algorithms: UGC NET CSE | Junet 2015 | Part 3 | Question: 64

Given the symbols A, B, C, D, E, F, G and H with the probabilities and respectively.

The average Huffman code size in bits per symbol is

A. B. C. D.
ugcnetcse-june2015-paper3 algorithms greedy-algorithms huffman-code
 Answer key ☟

1.21 Huffman Code (2)

1.21.1 Huffman Code: UGC NET CSE | July 2016 | Part 3 | Question: 34

Match the following :

A. B.
C. D.
ugcnetcse-july2016-paper3 algorithms huffman-code

Answer key ☟

1.21.2 Huffman Code: UGC NET CSE | July 2016 | Part 3 | Question: 59

Consider a source with symbols with probabilities respectively. What is the

average number of bits per symbol for the Huffman code generated from above information?

A. bits per symbol B. bits per symbol

C. bits per symbol D. bits per symbol
ugcnetcse-july2016-paper3 algorithms huffman-code probability

Answer key ☟

1.22 In Place Algo (1)

1.22.1 In Place Algo: UGC NET CSE | June 2019 | Part 2 | Question: 62

There are many sorting algorithms based on comparison. The running time of heapsort algorithm is .
Like , but unlike , heapsort sorts in place where is equal to

A. Merge sort, Quick sort B. Quick sort, insertion sort

C. Insertion sort, Quick sort D. Insertion sort, Merge sort
ugcnetcse-june2019-paper2 in-place-algo quicksort-mergesort-insertion-sort

Answer key ☟

1.23 Knapsack Problem (2)

1.23.1 Knapsack Problem: UGC NET CSE | June 2014 | Part 3 | Question: 62

Consider the fractional knapsack instance

and .
The maximum profit is given by (Assume and denotes profit and weight of objects respectively)

A. B. C. D.
ugcnetjune2014iii algorithms greedy-algorithm knapsack-problem

Answer key ☟

1.23.2 Knapsack Problem: UGC NET CSE | September 2013 | Part 3 | Question: 42

Given 0-1 knapsack problem and fractional knapsack problem and the following statements:
: 0-1 knapsack is efficiently solved using Greedy algorithm.
: Fractional knapsack is efficiently solved using Dynamic programming.
 Which of the following is true?

A. is correct and is not correct B. Both and are correct

C. Both and are not correct D. is not correct and is correct
ugcnetcse-sep2013-paper3 algorithms knapsack-problem

Answer key ☟

1.24 Linear Search (1)

1.24.1 Linear Search: UGC NET CSE | Junet 2015 | Part 2 | Question: 24

The average case occurs in Linear Search Algorithm when

A. The item to be searched is in some where middle of the Array

B. The item to be searched is not in the array
C. The item to be searched is in the last of t he array
D. The item to be searched is either in the last or not in the array

ugcnetcse-june2015-paper2 algorithms linear-search

Answer key ☟

1.25 Longest Common Subsequence (1)

1.25.1 Longest Common Subsequence: UGC NET CSE | December 2015 | Part 3 | Question: 17

Given two sequences and :

The longest common subsequence of X and Y is:

A. B.
C. D.
ugcnetcse-dec2015-paper3 algorithms longest-common-subsequence

Answer key ☟

1.26 Matrix Chain Ordering (4)

1.26.1 Matrix Chain Ordering: UGC NET CSE | August 2016 | Part 3 | Question: 31

Consider the problem of a chain < > of four matrices. Suppose that the dimensions of the matrices
and are and respectively. The minimum number of scalar
multiplications needed to compute the product is ____.

A. B. C. D.
ugcnetcse-aug2016-paper3 algorithms dynamic-programming numerical-answers matrix-chain-ordering

Answer key ☟

1.26.2 Matrix Chain Ordering: UGC NET CSE | December 2014 | Part 3 | Question: 35

Consider the problem of a chain of three matrices. Suppose that the dimensions of the matrices are
, and respectively. There are two different ways of parenthesization : (i)
and (ii) . Computing the product according to the first parenthesization is ______ times faster in
comparison to the second parenthesization.

A. B. C. D.
ugcnetcse-dec2014-paper3 algorithms matrix-chain-ordering

Answer key ☟
 1.26.3 Matrix Chain Ordering: UGC NET CSE | January 2017 | Part 3 | Question: 34

The minimum number of scalar multiplication required, for parenthesization of a matrix-chain product whose
sequence of dimensions for four matrices is is

A. B. C. D.
ugcnetcse-jan2017-paper3 algorithms matrix-chain-ordering

Answer key ☟

1.26.4 Matrix Chain Ordering: UGC NET CSE | September 2013 | Part 3 | Question: 39

The number of possible paranthesizations of a sequence of n matrices is

A. O(n) B. (n Ig n) C. D. None of the above

ugcnetcse-sep2013-paper3 algorithms dynamic-programming matrix-chain-ordering

Answer key ☟

1.27 Merge Sort (2)

1.27.1 Merge Sort: UGC NET CSE | December 2013 | Part 2 | Question: 25

Given two sorted list of size 'm' and 'n' respectively. The number of comparisons needed in the worst case by
the merge sort algorithm will be

A. m n B. max(m, n) C. min(m, n) D. m+n-1

ugcnetcse-dec2013-paper2 algorithms merge-sort

Answer key ☟

1.27.2 Merge Sort: UGC NET CSE | June 2014 | Part 2 | Question: 36

Mergesort makes two recursive calls. Which statement is true after these two recursive calls finish, but before
the merge step ?

A. The array elements form a heap.

B. Elements in each half of the array are sorted amongst themselves.
C. Elements in the first half of the array are less than or equal to elements in second half of the array.
D. All of the above

ugcnetcse-june2014-paper2 algorithms sorting merge-sort

Answer key ☟

1.28 Minimum Spanning Tree (1)

1.28.1 Minimum Spanning Tree: UGC NET CSE | November 2017 | Part 2 | Question: 5

Consider the graph given below:

Use Kruskal’s algorithm to find a minimal spanning tree for the graph. The List of the edges of the tree in the order in
which they are chosen is
A. AD, AE, AG, GC, GB, BF B. GC, GB, BF, GA, AD, AE
C. GC, AD, GB, GA, BF, AE D. AD, AG, GC, AE, GB, BF
ugcnetcse-nov2017-paper2 graph-algorithms minimum-spanning-tree
 Answer key ☟

1.29 Non Gatecse (1)

1.29.1 Non Gatecse: UGC NET CSE | October 2020 | Part 2 | Question: 69

Match with
With reference to CMM developed by Software Engineering Institute (SEI)

Choose the correct answer from the options given below:

A. B.
C. D.
ugcnetcse-oct2020-paper2 non-gatecse algorithms

Answer key ☟

1.30 Optimal Search Tree (1)

1.30.1 Optimal Search Tree: UGC NET CSE | December 2015 | Part 3 | Question: 21

L e t and =(do, if, int, while). Let and

where and denotes the probability with which we search and the identifier
being searched satisfy respectively. The optimal search tree is given by:

1.

1.
 1.

1.

ugcnetcse-dec2015-paper3 algorithms optimal-search-tree

Answer key ☟

1.31 Optimal Solution (1)

1.31.1 Optimal Solution: UGC NET CSE | June 2019 | Part 2 | Question: 68

Consider the following steps:

: Characterize the structure of an optimal solution
: Compute the value of an optimal solution in bottom-up fashion
Which of the following step(s) is/are common to both dynamic programming and greedy algorithms?

A. Only B. Only C. Both and D. Neither nor

ugcnetcse-june2019-paper2 optimal-solution dynamic-programming greedy-algorithm

Answer key ☟

1.32 P NP NPC NPH (3)

1.32.1 P NP NPC NPH: UGC NET CSE | December 2014 | Part 3 | Question: 33

We can show that the clique problem is -hard by proving that

A. CLIQUE P 3-CNF_SAT B. CLIQUE P VERTEX_COVER
C. CLIQUE P SUBSET_SUM D. None of the above
ugcnetcse-dec2014-paper3 algorithms p-np-npc-nph

Answer key ☟

1.32.2 P NP NPC NPH: UGC NET CSE | June 2019 | Part 2 | Question: 67

Consider the complexity class as the set of languages such that , and the following two
statements:

Which of the following is/are correct?

A. Only B. Only C. Both and D. Neither nor

 ugcnetcse-june2019-paper2 p-np-npc-nph

Answer key ☟

1.32.3 P NP NPC NPH: UGC NET CSE | Junet 2015 | Part 3 | Question: 32

The travelling salesman problem can be solved in

A. Polynomial time using dynamic programming algorithm

B. Polynomial time using branch-and-bound algorithm
C. Exponential time using dynamic programming algorithm or branch-and-bound algorithm
D. Polynomial time using back tracking algorithm

algorithms p-np-npc-nph ugcnetcse-june2015-paper3

Answer key ☟

1.33 Prims Algorithm (1)

1.33.1 Prims Algorithm: UGC NET CSE | October 2020 | Part 2 | Question: 78

Consider the undirected graph below:

Using Prim’s algorithm to construct a minimum spanning tree starting with node , which one of the following
sequences of edges represents a possible order in which the edges would be added to construct the minimum spanning
tree?

A.
B.
C.
D.

prims-algorithm algorithms minimum-spanning-tree ugcnetcse-oct2020-paper2

Answer key ☟

1.34 Quick Sort (1)

1.34.1 Quick Sort: UGC NET CSE | June 2014 | Part 3 | Question: 66

Suppose that the splits at every level of quicksort are in the proportion to , where is a
constant. The minimum depth of a leaf in the recursion tree is approximately given by

A. B.
C. D.
ugcnetjune2014iii data-structures sorting algorithms quick-sort

Answer key ☟

1.35 Recurrence Relation (7)

1.35.1 Recurrence Relation: UGC NET CSE | December 2012 | Part 3 | Question: 14

Let be a function defined by and , which of the following is true?

A. B.
C. D.
ugcnetcse-dec2012-paper3 algorithms recurrence-relation time-complexity

Answer key ☟

1.35.2 Recurrence Relation: UGC NET CSE | December 2015 | Part 3 | Question: 19

The solution of the reccurence relation

is

A. B. C. D. None of the above

ugcnetcse-dec2015-paper3 algorithms recurrence-relation

Answer key ☟

1.35.3 Recurrence Relation: UGC NET CSE | December 2018 | Part 2 | Question: 21

The solution of recurrence relation:

is

A. B.
C. D.
ugcnetcse-dec2018-paper2 recurrence-relation

Answer key ☟

1.35.4 Recurrence Relation: UGC NET CSE | July 2018 | Part 2 | Question: 21

The solution of the recurrence relation is

A. B.
C. D.
ugcnetcse-july2018-paper2 algorithms time-complexity recurrence-relation

Answer key ☟

1.35.5 Recurrence Relation: UGC NET CSE | June 2013 | Part 3 | Question: 12

The solution of recurrence relation, is

A. B.
C. D.
ugcnetcse-june2013-paper3 algorithms recurrence-relation

Answer key ☟

1.35.6 Recurrence Relation: UGC NET CSE | June 2014 | Part 3 | Question: 63

The solution of the recurrence relation of is

A. B. C. D.
ugcnetjune2014iii algorithms recurrence-relation

Answer key ☟
 1.35.7 Recurrence Relation: UGC NET CSE | September 2013 | Part 3 | Question: 37

The time complexity of reccurence relation T(n) = T(n/3) + T(2n/3) +O(n) is

A. O(Ig n) B. O(n) C. O(n Ig n) D. O(n )

ugcnetcse-sep2013-paper3 algorithms time-complexity recurrence-relation

Answer key ☟

1.36 Recursion (2)

1.36.1 Recursion: UGC NET CSE | December 2009 | Part 2 | Question: 11

Recursive functions are executed in a

(A) First in first out-order

(B) Last in first out-order

(C) Parallel fashion

(D) Load balancing

ugcnetcse-dec2009-paper2 algorithms recursion

Answer key ☟

1.36.2 Recursion: UGC NET CSE | December 2011 | Part 2 | Question: 3

Which of the following is a bad example of recursion ?

A. Factorial B. Fibonacci numbers
C. Tower of Hanai D. Tree traversal
ugcnetcse-dec2011-paper2 algorithms recursion

Answer key ☟

1.37 Red Black Tree (1)

1.37.1 Red Black Tree: UGC NET CSE | January 2017 | Part 3 | Question: 33

Red-black trees are one of many search tree schemes that are “balanced” in order to guarantee that basic
dynamic-set operations take _____ time in the worst case.

A. B. C. D.
ugcnetcse-jan2017-paper3 algorithms red-black-tree

Answer key ☟

1.38 Shortest Path (2)

1.38.1 Shortest Path: UGC NET CSE | December 2014 | Part 3 | Question: 34

Dijkstra algorithm, which solves the single-source shortest--paths problem, is a _______, and the Floyd-
Warshall algorithm, which finds shortest paths between all pairs of vertices, is a ________.

A. Greedy algorithm, Divide-conquer algorithm

B. Divide-conquer algorithm, Greedy algorithm
C. Greedy algorithm, Dynamic programming algorithm
D. Dynamic programming algorithm, Greedy algorithm

ugcnetcse-dec2014-paper3 algorithms shortest-path

Answer key ☟
 1.38.2 Shortest Path: UGC NET CSE | Junet 2015 | Part 3 | Question: 31

An all-pairs shortest-paths problem is efficiently solved using:

A. Dijkstra's algorithm B. Bellman-Ford algorithm
C. Kruskal algorithm D. Floyd-Warshall algorithm
ugcnetcse-june2015-paper3 algorithms easy shortest-path

Answer key ☟

1.39 Sorting (4)

1.39.1 Sorting: UGC NET CSE | December 2013 | Part 3 | Question: 38

Assuming there are n keys and each key is in the range [0, m-1]. The run time of bucket sort is

A. O(n) B. O(n lgn) C. O(n lgm) D. O(n+m)

ugcnetcse-dec2013-paper3 algorithms sorting

Answer key ☟

1.39.2 Sorting: UGC NET CSE | December 2014 | Part 2 | Question: 22

You have to sort a list , consisting of a sorted list followed by a few ‘random’ elements. Which of the
following sorting method would be most suitable for such a task ?

A. Bubble sort B. Selection sort

C. Quick sort D. Insertion sort
ugcnetcse-dec2014-paper2 algorithms data-structures sorting

Answer key ☟

1.39.3 Sorting: UGC NET CSE | December 2015 | Part 3 | Question: 18

If there are n integers to sort, each integer had d digits and each digit is in the set , radix sort can
sort the numbers in

A. B. C. D.
ugcnetcse-dec2015-paper3 algorithms sorting

Answer key ☟

1.39.4 Sorting: UGC NET CSE | June 2019 | Part 2 | Question: 64

Which of the following is best running time to sort integers in the range to ?

A. B. C. D.
ugcnetcse-june2019-paper2 sorting

Answer key ☟

1.40 Space Complexity (2)

1.40.1 Space Complexity: UGC NET CSE | December 2015 | Part 2 | Question: 39

An ideal sort is an in-place-sort whose additional space requirement is

A. O (log n) B. O (nlog n) C. O (1) D. O (n)

ugcnetcse-dec2015-paper2 algorithms sorting space-complexity

Answer key ☟
 1.40.2 Space Complexity: UGC NET CSE | October 2020 | Part 2 | Question: 73

Match with

Choose the correct answer from the options given below:

A. B.
C. D.
ugcnetcse-oct2020-paper2 space-complexity algorithms

Answer key ☟

1.41 Time Complexity (10)

1.41.1 Time Complexity: UGC NET CSE | December 2006 | Part 2 | Question: 21

Which algorithm has same average, worst case and best case time ?
A. Binary search B. Maximum of n number
C. Quick sort D. Fibonacci search
algorithms time-complexity ugcnetcse-dec2006-paper2

Answer key ☟

1.41.2 Time Complexity: UGC NET CSE | December 2010 | Part 2 | Question: 23

The time complexity to build a heap of n elements is

A. B. C. D.
ugcnetcse-dec2010-paper2 algorithms time-complexity

Answer key ☟

1.41.3 Time Complexity: UGC NET CSE | December 2012 | Part 3 | Question: 11

The time complexities of some standard graph algorithms are given. Match each algorithm with its time
complexity ? ( and are no. of nodes and edges respectively)

A. B.
C. D.
ugcnetcse-dec2012-paper3 algorithms time-complexity

Answer key ☟
1.41.4 Time Complexity: UGC NET CSE | December 2014 | Part 3 | Question: 32

Match the following

A. B.
C. D.
ugcnetcse-dec2014-paper3 algorithms time-complexity

Answer key ☟

1.41.5 Time Complexity: UGC NET CSE | Junet 2015 | Part 3 | Question: 33

Which of the following is asymptotically smaller?

A. lg(lg*n) B. lg*(lgn) C. lg(n!) D. lg*(n!)

algorithms ugcnetcse-june2015-paper3 time-complexity

Answer key ☟

1.41.6 Time Complexity: UGC NET CSE | October 2020 | Part 2 | Question: 25

If algorithm and another algorithm take and microseconds, respectively, to solve a problem,
then the largest size of a problem these algorithms can solve, respectively, in one second are ______ and
______.

A. and B. and C. and D. and

ugcnetcse-oct2020-paper2 algorithms time-complexity

Answer key ☟

1.41.7 Time Complexity: UGC NET CSE | October 2020 | Part 2 | Question: 52

The running time of an algorithm is if and only if

a. its worst-case running time is and its best-case running time is

b. its worst-case running time is and its best-case running time is
c.
d. is non-empty set,

ugcnetcse-oct2020-paper2 algorithms time-complexity

Answer key ☟

1.41.8 Time Complexity: UGC NET CSE | October 2022 | Part 1 | Question: 87

Consider the following algorithms and their running times :

Algorithms Complexities
(A) Breadth First Search (I)
(B) Rabin-Karp
(II)
Algorithm
( I I I )
(C) Depth-First Search
 (D) Heap sort (worst
(IV)
case)
(E) Quick sort (worst
(V)
case)

Which one of the following is correct?

A.
B.
C.
D.

ugcnetcse-oct2022-paper1 algorithms time-complexity match-the-following

Answer key ☟

1.41.9 Time Complexity: UGC NET CSE | September 2013 | Part 2 | Question: 9

The amortized time complexity to perform ____ operation(s) in Splay trees is O(Ig n)

A. Search B. Search and Insert

C. Search and Delete D. Search, Insert and Delete
ugcnetsep2013ii algorithms time-complexity

Answer key ☟

1.41.10 Time Complexity: UGC NET CSE | September 2013 | Part 3 | Question: 40

The time complexity of an efficient algorithm to find the longest monotonically increasing subsequence of n
numbers is

A. B. C. D. None of the above

algorithms time-complexity ugcnetcse-sep2013-paper3

Answer key ☟

1.42 Topological Sort (1)

1.42.1 Topological Sort: UGC NET CSE | December 2005 | Part 2 | Question: 23

Consider the graph, which of the following is a valid topological sorting?

A. B. C. D.
ugcnetcse-dec2005-paper2 algorithms topological-sort

Answer key ☟
1.43 Tree (2)

1.43.1 Tree: UGC NET CSE | December 2015 | Part 2 | Question: 37

The number of disk pages access in B-tree search, where h is height, n is the number of keys and t is the
minimum degree, is

A. B.
C. D.
ugcnetcse-dec2015-paper2 algorithms tree

Answer key ☟

1.43.2 Tree: UGC NET CSE | January 2017 | Part 3 | Question: 32

Any decision tree that sorts n elements has height ____

A. B.
C. D.
ugcnetcse-jan2017-paper3 algorithms tree

Answer key ☟

1.44 Tree Search Algorithm (2)

1.44.1 Tree Search Algorithm: UGC NET CSE | Junet 2015 | Part 3 | Question: 58

Which of the following statements is true for Branch-and-Bound search?

A. Underestimates of remaining distance may cause deviation from optimal path

B. Overestimates can't cause right path to be overlooked
C. Dynamic programming principle can be used to discard redundant partial paths
D. All of the above

ugcnetcse-june2015-paper3 algorithms branch-and-bound tree-search-algorithm graph-search

Answer key ☟

1.44.2 Tree Search Algorithm: UGC NET CSE | September 2013 | Part 3 | Question: 2

cutoffs are applied to

A. Depth first search B. Best first search
C. Minimax search D. Breadth first search
ugcnetcse-sep2013-paper3 algorithms graph-search tree-search-algorithm

Answer key ☟

1.45 Tree Traversal (1)

1.45.1 Tree Traversal: UGC NET CSE | Junet 2015 | Part 2 | Question: 4

Consider the following statements:

i. Depth-first search is used to traverse a rooted tree

ii. Pre-order, Post-order and Inorder are used to list the vertices of an ordered rooted tree.
iii. Huffman's algorithm is used to find an optimal binary tree with given weights
iv. Topological sorting provides a labelling such that the parents have larger labels than their children

Which one of the above statements is true?

A. B.
C. D.
ugcnetcse-june2015-paper2 tree tree-traversal

Answer key ☟
Answer Keys
1.0.1 C 1.0.2 Q-Q 1.0.3 Q-Q 1.0.4 Q-Q 1.0.5 D
1.0.6 A 1.0.7 A 1.1.1 C 1.2.1 Q-Q 1.3.1 B
1.4.1 C 1.5.1 C 1.5.2 D 1.6.1 C 1.6.2 C
1.7.1 B 1.7.2 B 1.7.3 X 1.7.4 C 1.7.5 B
1.7.6 B 1.7.7 B 1.7.8 D 1.8.1 Q-Q 1.8.2 C
1.9.1 X 1.10.1 A 1.11.1 B 1.12.1 Q-Q 1.12.2 Q-Q
1.12.3 Q-Q 1.12.4 C 1.13.1 C 1.14.1 A 1.14.2 D
1.14.3 C 1.15.1 C 1.16.1 C 1.17.1 C 1.17.2 B
1.18.1 A 1.18.2 B 1.19.1 B 1.20.1 C 1.21.1 C
1.21.2 B 1.22.1 D 1.23.1 B 1.23.2 C 1.24.1 A
1.25.1 B 1.26.1 Q-Q 1.26.2 B 1.26.3 D 1.26.4 C
1.27.1 D 1.27.2 B 1.28.1 C 1.29.1 A 1.30.1 C
1.31.1 A 1.32.1 D 1.32.2 C 1.32.3 C 1.33.1 A;C
1.34.1 C 1.35.1 C 1.35.2 C 1.35.3 D 1.35.4 Q-Q
1.35.5 D 1.35.6 C 1.35.7 C 1.36.1 Q-Q 1.36.2 B
1.37.1 B 1.38.1 C 1.38.2 D 1.39.1 D 1.39.2 D
1.39.3 D 1.39.4 B 1.40.1 C 1.40.2 A 1.41.1 Q-Q
1.41.2 Q-Q 1.41.3 A 1.41.4 C 1.41.5 A 1.41.6 B
1.41.7 X 1.41.8 N/A 1.41.9 D 1.41.10 B 1.42.1 Q-Q
1.43.1 D 1.43.2 C 1.44.1 C 1.44.2 C 1.45.1 D
2 Artificial Intelligence (45)

2.0.1 UGC NET CSE | July 2016 | Part 3 | Question: 75

A software program that infers and manipulates existing knowledge in order to generate new knowledge is
known as:

A. Data dictionary B. Reference mechanism

C. Inference engine D. Control strategy
ugcnetcse-july2016-paper3

Answer key ☟

2.0.2 UGC NET CSE | July 2016 | Part 3 | Question: 66

A perceptron has input weights and with threshold value What output does it
give for the input and

A. B. C. D.
ugcnetcse-july2016-paper3

Answer key ☟

2.1 Artificial Intelligence (17)

2.1.1 Artificial Intelligence: UGC NET CSE | December 2013 | Part 3 | Question: 26

The mean-end analysis process centers around the detection of differences between the current state and goal
state. Once such a difference is isolated, an operator that can reduce the difference must be found. But perhaps
that operator cannot be applied to the current state. So a sub-problem of getting to a state in which it can be applied is
set up. The kind of backward chaining in which operators are selected and then sub goals are set up to establish the
precondition of operators is called

A. backward planning B. goal stack planning

C. operator subgoaling D. operator overloading
ugcnetcse-dec2013-paper3 artificial-intelligence

Answer key ☟

2.1.2 Artificial Intelligence: UGC NET CSE | December 2014 | Part 3 | Question: 72

Match the following learning modes . characteristics of available information for learning :
a. Supervised i. Instructive information on desired responses, explicitly specified by a teacher.
b. Recording ii. A priori design information for memory storing
c. iii. Partial information about desired responses, or only “right” or “wrong” evaluative
Reinforcement information
d.
iv. No information about desired responses
Unsupervised
Codes :
a b c d

A. i ii iii iv
B. i iii ii iv
C. ii iv iii i
D. ii iii iv i

ugcnetcse-dec2014-paper3 artificial-intelligence machine-learning

Answer key ☟
2.1.3 Artificial Intelligence: UGC NET CSE | December 2015 | Part 3 | Question: 46

Language model used in LISP is

A. Functional programming B. Logic programming

C. Object oriented programming D. All of the above
ugcnetcse-dec2015-paper3 artificial-intelligence

Answer key ☟

2.1.4 Artificial Intelligence: UGC NET CSE | December 2015 | Part 3 | Question: 64

Consider the two class classification task that consists of the following points:
Class
Class
The decision boundary between the two classes and using single perception is given by:
A. B.
C. D.
ugcnetcse-dec2015-paper3 artificial-intelligence

Answer key ☟

2.1.5 Artificial Intelligence: UGC NET CSE | January 2017 | Part 3 | Question: 55

Consider following two rules and in logical reasoning in Artificial Intelligence (AI):
From is known as Modulus Tollens (MT)

From is known as Modus Ponens(MP)

A. Only is correct. B. Only is correct.

C. Both and are correct. D. Neither nor is correct.
ugcnetcse-jan2017-paper3 non-gatecse artificial-intelligence

Answer key ☟

2.1.6 Artificial Intelligence: UGC NET CSE | July 2018 | Part 2 | Question: 71

In artificial Intelligence (AI), an environment is uncertain if it is ___

A. Not fully observable and not deterministic

B. Not fully observable or not deterministic
C. Fully observable but not deterministic
D. Not fully observable but deterministic

ugcnetcse-july2018-paper2 artificial-intelligence

Answer key ☟

2.1.7 Artificial Intelligence: UGC NET CSE | July 2018 | Part 2 | Question: 72

In artificial Intelligence (AI), a simple reflex agent selects actions on the basis of ___

A. current percept, completely ignoring rest of the percept history

B. rest of the percept history, completely ignoring the current percept
C. both current percept and complete percept history
D. both current percept and just previous percept

ugcnetcse-july2018-paper2 artificial-intelligence

Answer key ☟
2.1.8 Artificial Intelligence: UGC NET CSE | July 2018 | Part 2 | Question: 73

In heuristic search algorithms in Artificial Intelligence (AI), if a collection of admissible heuristics is

available for a problem and none of them dominates any of the others, which should we choose?

A. B.
C. D.
ugcnetcse-july2018-paper2 artificial-intelligence

Answer key ☟

2.1.9 Artificial Intelligence: UGC NET CSE | July 2018 | Part 2 | Question: 74

Consider following sentences regarding , an informed search strategy in Artificial Intelligence (AI).

a. expands all nodes with

b. expands no nodes with
c. Pruning is integral to

Here, is the cost of the optimal solution path. Which of the following is correct with respect to the above statements?

A. Both statements a and statement b are true

B. Both statements a and statement c are true
C. Both statements b and statement c are true
D. All the statements a, b and c are true

ugcnetcse-july2018-paper2 artificial-intelligence

Answer key ☟

2.1.10 Artificial Intelligence: UGC NET CSE | June 2012 | Part 3 | Question: 2

In Delta Rule for error minimization

A. weights are adjusted w.r.to change in the output

B. weights are adjusted w.r.to difference between desired output and actual output
C. weights are adjusted w.r.to difference between output and output
D. none of the above

ugcnetcse-june2012-paper3 artificial-intelligence machine-learning

Answer key ☟

2.1.11 Artificial Intelligence: UGC NET CSE | June 2012 | Part 3 | Question: 21

algorithm uses to estimate the cost of getting from the initial state to the goal state, where is a
measure of cost getting from initial state to the current node and the function is an estimate of the cost of
getting from the current node to the goal state. To find a path involving the fewest number of steps, we should test,

A. B. C. D.
ugcnetcse-june2012-paper3 artificial-intelligence

Answer key ☟

2.1.12 Artificial Intelligence: UGC NET CSE | June 2014 | Part 3 | Question: 28

Match the following

 A. B.
C. D.
ugcnetjune2014iii artificial-intelligence

Answer key ☟

2.1.13 Artificial Intelligence: UGC NET CSE | June 2014 | Part 3 | Question: 30

Slots and facets are used in

A. Semantic Networks B. Frames C. Rules D. All of these

ugcnetjune2014iii artificial-intelligence

Answer key ☟

2.1.14 Artificial Intelligence: UGC NET CSE | Junet 2015 | Part 3 | Question: 23

Which of the following is false for the programming language PROLOG?

A. A PROLOG variable can only be assigned to a value once

B. PROLOG is a strongly typed language
C. The scope of a variable in PROLOG is a single clause or rule
D. The scope of a variable in PROLOG is a single query

ugcnetcse-june2015-paper3 artificial-intelligence

Answer key ☟

2.1.15 Artificial Intelligence: UGC NET CSE | Junet 2015 | Part 3 | Question: 56

Match the following knowledge representation techniques with their applications

A. B.
C. D.
ugcnetcse-june2015-paper3 artificial-intelligence

Answer key ☟

2.1.16 Artificial Intelligence: UGC NET CSE | Junet 2015 | Part 3 | Question: 59

Match the following with respect to heuristic search techniques

 A. B.
C. D.
ugcnetcse-june2015-paper3 artificial-intelligence

Answer key ☟

2.1.17 Artificial Intelligence: UGC NET CSE | October 2020 | Part 2 | Question: 36

Which of the following is NOT true in problem solving in artificial intelligence?

A. Implements heuristic search technique B. Solution steps are not explicit

C. Knowledge is imprecise D. It works on or implements repetition mechanism
ugcnetcse-oct2020-paper2 non-gatecse artificial-intelligence

Answer key ☟

2.2 Artificial Neural Network (1)

2.2.1 Artificial Neural Network: UGC NET CSE | December 2013 | Part 3 | Question: 30

An artificial neuron receives n inputs with weights attached to the input links.
The weighted sum ____ is computed to be passed on to a non-linear filter called activation function to release
the output.

A. B.
C. D.
ugcnetcse-dec2013-paper3 machine-learning artificial-neural-network

Answer key ☟

2.3 Back Propagation (1)

2.3.1 Back Propagation: UGC NET CSE | December 2012 | Part 2 | Question: 46

Back propagation is a learning technique that adjusts weights in the neutral network by propagating weight
changes.
A. Forward from source to sink B. Backward from sink to source
C. Forward from source to hidden nodes D. Backward from sink to hidden nodes
ugcnetcse-dec2012-paper2 machine-learning data-mining back-propagation

Answer key ☟

2.4 Blocks World Problem (1)

2.4.1 Blocks World Problem: UGC NET CSE | September 2013 | Part 3 | Question: 5

The Blocks World Problem in Artificial Intelligence is normally discussed to explain a

A. Search technique B. Planning system

C. Constraint satisfaction system D. Knowledge base system
ugcnetcse-sep2013-paper3 artificial-intelligence blocks-world-problem
 Answer key ☟

2.5 Chaining (1)

2.5.1 Chaining: UGC NET CSE | December 2015 | Part 3 | Question: 8

Forward chaining systems are ____ where as backward chaining systems are ____

A. Data driven, Data driven B. Goal driven, Data driven

C. Data driven, Goal driven D. Goal driven, Goal driven
ugcnetcse-dec2015-paper3 artificial-intelligence chaining

Answer key ☟

2.6 Expert System (2)

2.6.1 Expert System: UGC NET CSE | December 2012 | Part 3 | Question: 67

An expert system shell is an expert system without

A. domain knowledge B. explanation facility

C. reasoning with knowledge D. all of the above
ugcnetcse-dec2012-paper3 artificial-intelligence expert-system

Answer key ☟

2.6.2 Expert System: UGC NET CSE | December 2015 | Part 3 | Question: 45

Reasoning strategies used in expert systems include

A. Forward chaining, backward chaining and problem reduction

B. Forward chaining, backward chaining and boundary mutation
C. Forward chaining, backward chaining and back propagation
D. Forward chaining, problem reduction and boundary mutation

ugcnetcse-dec2015-paper3 artificial-intelligence expert-system

Answer key ☟

2.7 Fuzzy Logic (1)

2.7.1 Fuzzy Logic: UGC NET CSE | June 2019 | Part 2 | Question: 94

A fuzzy conjunction operator denoted as and a fuzzy disjunction operator denoted as form a dual
pair if they satisfy the condition:

A. B.
C. D.
ugcnetcse-june2019-paper2 artificial-intelligence fuzzy-logic

Answer key ☟

2.8 Genetic Algorithms (1)

2.8.1 Genetic Algorithms: UGC NET CSE | June 2019 | Part 2 | Question: 97

Consider the following:

i. Evolution
ii. Selection
iii. Reproduction
iv. Mutation

Which of the following are found in genetic algorithms?

 A. b, c and d only B. b and d only C. a, b, c and d D. a, b and d only
ugcnetcse-june2019-paper2 artificial-intelligence genetic-algorithms

Answer key ☟

2.9 Heuristic Search (1)

2.9.1 Heuristic Search: UGC NET CSE | December 2013 | Part 3 | Question: 25

If h* represents an estimate from the cost of getting from the current node N to the goal node and h represents
actual cost of getting from the current node to the goal node, then A* algorithm gives an optimal solution if

A. h* is equal to h B. h* overestimates h
C. h* underestimates h D. none of these
ugcnetcse-dec2013-paper3 artificial-intelligence heuristic-search

Answer key ☟

2.10 Linear Programming (1)

2.10.1 Linear Programming: UGC NET CSE | September 2013 | Part 3 | Question: 13

If an artificial variable is present in the ‘basic variable’ of optimal simplex table then the solution is
A. Alternative solution B. Infeasible solution
C. Unbounded solution D. Degenerate solution
ugcnetcse-sep2013-paper3 artificial-intelligence linear-programming

Answer key ☟

2.11 Machine Learning (2)

2.11.1 Machine Learning: UGC NET CSE | December 2012 | Part 3 | Question: 73

Match the following:

1. The decision system receives
a. Supervised
rewards for its action at the end of
learning
a sequence of steps
b.
2. Manual labels of inputs are not
Unsupervised
used
learning
c. Re-
3. Manual labels of inputs are
inforcement
used
learning
d. Inductive
4. System learns by example
learning
a b c d
A 1 2 3 4
B 2 3 1 4
C 3 2 4 1
D 3 2 1 4

ugcnetcse-dec2012-paper3 machine-learning

Answer key ☟

2.11.2 Machine Learning: UGC NET CSE | June 2014 | Part 3 | Question: 09

Perceptron learning, Delta learning and learning are learning methods which falls under the category of

A. Error correction learning - learning with a teacher

B. Reinforcement learning - learning with a critic
 C. Hebbian learning
D. Competitive learning - learning without a teacher

ugcnetjune2014iii machine-learning

Answer key ☟

2.12 Map Coloring (1)

2.12.1 Map Coloring: UGC NET CSE | June 2013 | Part 3 | Question: 71

The map colouring problem can be solved using which of the following technique?
A. Means-end analysis B. Constraint satisfaction
C. AO* search D. Breadth first search
ugcnetcse-june2013-paper3 artificial-intelligence map-coloring

Answer key ☟

2.13 Means End (1)

2.13.1 Means End: UGC NET CSE | September 2013 | Part 3 | Question: 6

Means-Ends Analysis process centres around the detection of difference between the current state and the goal
state. Once such a difference is found, then to reduce the difference one applies

A. a forward search that can reduce the difference

B. a backward search that can reduce the difference
C. a bidirectional search that can reduce the difference
D. an operator that can reduce the difference

ugcnetcse-sep2013-paper3 artificial-intelligence means-end analysis

Answer key ☟

2.14 Minimax Procedure (1)

2.14.1 Minimax Procedure: UGC NET CSE | June 2019 | Part 2 | Question: 91

Consider the game tree given below:

Here and represents MIN and MAX nodes respectively. The value of the root node of the game tree is

A. B. C. D.
ugcnetcse-june2019-paper2 artificial-intelligence minimax-procedure

Answer key ☟
2.15 Neural Network (3)

2.15.1 Neural Network: UGC NET CSE | December 2012 | Part 3 | Question: 9

You are given an OR problem and XOR problem to solve. Then, which one of the following statements is true?

A. Both OR and XOR problems can be solved using single layer perception
B. OR can be solved using single layer perception and XOR problem can be solved using self organizing maps
C. OR problem can be solved using radial basis function and XOR problem can be solved using single layer perception
D. OR can be solved using single layer perception and XOR problem can be solved using radial basis function

ugcnetcse-dec2012-paper3 artificial-intelligence neural-network

Answer key ☟

2.15.2 Neural Network: UGC NET CSE | June 2019 | Part 2 | Question: 98

Which of the following is an example of unsupervised neural network?

A. Back-propagation network B. Hebb network

C. Associative memory network D. Self-organizing feature map
ugcnetcse-june2019-paper2 artificial-intelligence neural-network

Answer key ☟

2.15.3 Neural Network: UGC NET CSE | September 2013 | Part 3 | Question: 28

In a single perceptron, the updation rule of weight vector is given by

A. B.
C. D.
ugcnetcse-sep2013-paper3 neural-network machine-learning

Answer key ☟

2.16 Planning (1)

2.16.1 Planning: UGC NET CSE | July 2018 | Part 2 | Question: 78

Consider the following two sentences:

a. The planning graph data structure can be used to give a better heuristic for a planning problem
b. Dropping negative effects from every action schema in a planning problem results in a relaxed problem

Which of the following is correct with respect to the above sentences?

A. Both sentence a and sentence b are false

B. Both sentence a and sentence b are true
C. Sentence a is true but sentence b is false
D. Sentence a is false but sentence b is true

ugcnetcse-july2018-paper2 planning

Answer key ☟

2.17 Prolog (2)

2.17.1 Prolog: UGC NET CSE | June 2013 | Part 3 | Question: 67

Which one of the following is the correct implementation of the meta-predicate “not” in PROLOG (Here G
represents a goal)?

A. not(G):- !, call(G), fail. not(G). B. not(G):- call(G), !, fail. not(G).

C. not(G):- call(G), fail, !, not(G). D. not(G):- call(G), !, fail.not(G):- !.
 ugcnetcse-june2013-paper3 artificial-intelligence prolog

2.17.2 Prolog: UGC NET CSE | June 2014 | Part 3 | Question: 14

Which one of the following describes the syntax of prolog program?

I. Rules and facts are terminated by full stop(.)

II. Rules and facts are terminated by semi colon(;)
III. Variables names must start with upper case alphabets.
IV. Variables names must start with lower case alphabets.

A. I, II B. III, IV C. I, III D. II, IV

ugcnetjune2014iii artificial-intelligence prolog

Answer key ☟

2.18 Reinforcement Learning (1)

2.18.1 Reinforcement Learning: UGC NET CSE | June 2019 | Part 2 | Question: 100

Reinforcement learning can be formalized in terms of ____ in which the agent initially only knows the set of
possible _____ and the set of possible actions.

A. Markov decision processes, objects B. Hidden states, objects

C. Markov decision processes, states D. objects, states
ugcnetcse-june2019-paper2 artificial-intelligence reinforcement-learning

Answer key ☟

2.19 Searches (1)

2.19.1 Searches: UGC NET CSE | June 2019 | Part 2 | Question: 92

Math List-I with List-II:

Choose the correct option from those given below:

A. (a) – (i) ; (b) – (ii); (c) – (iii)

B. (a) – (iii) ; (b) – (ii); (c) – (i)
C. (a) – (i) ; (b) – (iii); (c) – (ii)
D. (a) – (ii) ; (b) – (iii); (c) – (i)

ugcnetcse-june2019-paper2 artificial-intelligence searches

Answer key ☟

2.20 Sigmoid Function (1)

2.20.1 Sigmoid Function: UGC NET CSE | June 2019 | Part 2 | Question: 99

The value of the derivative of Sigmoid function given by at is

A. B. C. D.
ugcnetcse-june2019-paper2 artificial-intelligence sigmoid-function

Answer key ☟
2.21 Strips (1)

2.21.1 Strips: UGC NET CSE | June 2019 | Part 2 | Question: 93

The STRIPS representation is

A. a feature-centric representation
B. an action-centric representation
C. a combination of feature-centric and action-centric representations
D. a hierarchical feature-centric representation

ugcnetcse-june2019-paper2 artificial-intelligence strips

Answer key ☟

2.22 User Query (1)

2.22.1 User Query: Required Artificial Intelligence resources for UGC NET

Hi
I need some useful resources of AI for upcoming UGC NET exam.
Currently, I am reading from Rich and Knight, Is it enough?
Please let me know about any good quality books or video lectures.

user-query

Answer key ☟

Answer Keys
2.0.1 C 2.0.2 C 2.1.1 C 2.1.2 A 2.1.3 C
2.1.4 B 2.1.5 D 2.1.6 B 2.1.7 Q-Q 2.1.8 Q-Q
2.1.9 Q-Q 2.1.10 B 2.1.11 A 2.1.12 D 2.1.13 B
2.1.14 B 2.1.15 A 2.1.16 B 2.1.17 D 2.2.1 D
2.3.1 B 2.4.1 B 2.5.1 D 2.6.1 A 2.6.2 B
2.7.1 C 2.8.1 C 2.9.1 C 2.10.1 B 2.11.1 D
2.11.2 A 2.12.1 B 2.13.1 D 2.14.1 B 2.15.1 D
2.15.2 D 2.15.3 C 2.16.1 Q-Q 2.17.1 B 2.17.2 C
2.18.1 C 2.19.1 D 2.20.1 B 2.21.1 B 2.22.1 Q-Q
3 CO and Architecture (100)

3.0.1 UGC NET CSE | June 2009 | Part 2 | Question: 09

With four programs in memory and with % average wait, the utilization is ?

A. % B. %
C. % D. %
ugcnetcse-june2009-paper2

Answer key ☟

3.1 8085 Microprocessor (6)

3.1.1 8085 Microprocessor: UGC NET CSE | December 2014 | Part 3 | Question: 04

Match the following instructions with the flags

A. B.
C. D.
ugcnetcse-dec2014-paper3 8085-microprocessor non-gatecse

Answer key ☟

3.1.2 8085 Microprocessor: UGC NET CSE | December 2014 | Part 3 | Question: 05

How many times will the following loop be executed ?

LXI B, 0007 H
LOP : DCX B
MOV A, B
ORA C
JNZ LOP

A. B. C. D.
ugcnetcse-dec2014-paper3 8085-microprocessor non-gatecse

Answer key ☟

3.1.3 8085 Microprocessor: UGC NET CSE | December 2014 | Part 3 | Question: 06

Specify the contents of the accumulator and the status of the and flags when microprocessor
performs addition of and .

A. B. C. D.
ugcnetcse-dec2014-paper3 8085-microprocessor non-gatecse

Answer key ☟

3.1.4 8085 Microprocessor: UGC NET CSE | July 2016 | Part 3 | Question: 3

Which of the following in 8085 microprocessor performs HL=HL+DE ?

 A. DAD D B. DAD H C. DAD B D. DAD SP
ugcnetcse-july2016-paper3 co-and-architecture 8085-microprocessor

Answer key ☟

3.1.5 8085 Microprocessor: UGC NET CSE | November 2017 | Part 2 | Question: 31

Consider the following program fragment in assembly language:

mov ax, 0h
mov cx, 0A h
do loop:
dec ax
loop doloop

What is the value of and registers after the completion of the doloop ?

A. and B. and
C. and D. and
ugcnetcse-nov2017-paper2 co-and-architecture 8085-microprocessor

Answer key ☟

3.1.6 8085 Microprocessor: UGC NET CSE | November 2017 | Part 2 | Question: 32

Consider the following assembly program fragment:

stc
mov al, 11010110b
mov cl,2
rcl al,3
rol al, 4
shr al, cl
mul cl

The contents of the destination register (in hexadecimal ) and the status of Carry Flag (CF) after the execution of
above instructions, are:

A. B.
C. D.
ugcnetcse-nov2017-paper2 8085-microprocessor non-gatecse

Answer key ☟

3.2 Accumulator (1)

3.2.1 Accumulator: UGC NET CSE | October 2020 | Part 2 | Question: 6

The following program is stored in memory unit of the basic computer. What is the content of the accumulator
after the execution of program? (All location numbers listed below are in hexadecimal).

A. B. C. D.
ugcnetcse-oct2020-paper2 accumulator assembly-language co-and-architecture
 Answer key ☟

3.3 Addressing Modes (11)

3.3.1 Addressing Modes: UGC NET CSE | August 2016 | Part 3 | Question: 5

In _____ addressing mode, the operands are stored in the memory. The address of the corresponding memory
location is given in a register which is specified in the instruction.
A. Register direct B. Register indirect
C. Base indexed D. Displacement
ugcnetcse-aug2016-paper3 co-and-architecture addressing-modes

Answer key ☟

3.3.2 Addressing Modes: UGC NET CSE | December 2008 | Part 2 | Question: 38

In which addressing mode, the effective address of the operand is generated by adding a constant value to the
contents of register ?

A. absolute mode B. immediate mode

C. indirect mode D. index mode
ugcnetcse-dec2008-paper2 co-and-architecture addressing-modes

Answer key ☟

3.3.3 Addressing Modes: UGC NET CSE | December 2010 | Part 2 | Question: 34

The register or main memory location which contains the effective address of the operand is known as
A. Pointer B. Special location
C. Indexed register D. None of the above
ugcnetcse-dec2010-paper2 co-and-architecture addressing-modes

Answer key ☟

3.3.4 Addressing Modes: UGC NET CSE | December 2013 | Part 3 | Question: 49

Match the following:

Codes:
A. B.
C. D.
ugcnetcse-dec2013-paper3 co-and-architecture addressing-modes

Answer key ☟

3.3.5 Addressing Modes: UGC NET CSE | January 2017 | Part 3 | Question: 4

Match the following :

 A. B.
C. D.
ugcnetcse-jan2017-paper3 co-and-architecture addressing-modes match-the-following

Answer key ☟

3.3.6 Addressing Modes: UGC NET CSE | July 2016 | Part 3 | Question: 5

The ____ addressing mode is similar to register indirect addressing mode, except that an offset is added to the
contents of the register. The offset and register are specified in the instruction.

A. Base indexed B. Base indexed plus displacement

C. Indexed D. Displacement
ugcnetcse-july2016-paper3 co-and-architecture addressing-modes

Answer key ☟

3.3.7 Addressing Modes: UGC NET CSE | June 2009 | Part 2 | Question: 33

In which addressing mode the operand is given explicitly in the instruction itself ?
A. Absolute mode B. Immediate mode
C. Indirect mode D. Index mode
ugcnetcse-june2009-paper2 co-and-architecture addressing-modes easy

Answer key ☟

3.3.8 Addressing Modes: UGC NET CSE | June 2012 | Part 3 | Question: 27

Identify the addressing modes of the below instructions and match them :

A. B.
C. D.
ugcnetcse-june2012-paper3 co-and-architecture addressing-modes

Answer key ☟

3.3.9 Addressing Modes: UGC NET CSE | June 2014 | Part 3 | Question: 40

The advantage of _______ is that it can reference memory without paying the price of having a full memory
address in the instruction.
A. Direct addressing B. Indexed addressing
C. Register addressing D. Register Indirect addressing
ugcnetjune2014iii co-and-architecture addressing-modes

Answer key ☟
 3.3.10 Addressing Modes: UGC NET CSE | June 2019 | Part 2 | Question: 11

Which type of addressing mode, less number of memory references are required?

A. Immediate B. Implied C. Register D. Indexed

ugcnetcse-june2019-paper2 co-and-architecture addressing-modes

Answer key ☟

3.3.11 Addressing Modes: UGC NET CSE | November 2017 | Part 3 | Question: 4

Which of the following addressing mode is best suited to access elements of an array of contiguous memory
locations?

A. Indexed addressing mode

B. Base Register addressing mode
C. Relative address mode
D. Displacement mode

ugcnetcse-nov2017-paper3 addressing-modes co-and-architecture

Answer key ☟

3.4 Amdahls Law (1)

3.4.1 Amdahls Law: UGC NET CSE | June 2008 | Part 2 | Question: 46

Amdahl's law states that the maximum speedup achievable by a parallel computer with ' ' processors is given
by :

A.
B.
C.
D.

ugcnetcse-june2008-paper2 co-and-architecture amdahls-law speedup

Answer key ☟

3.5 Assembly (15)

3.5.1 Assembly: UGC NET CSE | August 2016 | Part 2 | Question: 32

The content of the accumulator after the execution of the following 8085 assembly language program, is
MVI A, 35H
MOV B, A
STC
CMC
RAR
XRA B

A. B. C. D.
ugcnetcse-aug2016-paper2 co-and-architecture assembly 8085-microprocessor

Answer key ☟

3.5.2 Assembly: UGC NET CSE | December 2008 | Part 2 | Question: 37

An assembly program contains :

 1. imperative and declarative statements
2. imperative and assembler directives
3. imperative and declarative statements as well as assembler directives
4. declarative statements and assembler directives

ugcnetcse-dec2008-paper2 co-and-architecture assembly

Answer key ☟

3.5.3 Assembly: UGC NET CSE | December 2010 | Part 2 | Question: 31

Object code is the output of ______.

A. Operating System B. Compiler or Assembler

C. Only Assembler D. Only Compiler
ugcnetcse-dec2010-paper2 co-and-architecture assembly

Answer key ☟

3.5.4 Assembly: UGC NET CSE | December 2010 | Part 2 | Question: 32

'Macro' in an assembly level program is _______.

A. Sub program B. A complete program

C. A hardware portion D. Relative coding
ugcnetcse-dec2010-paper2 co-and-architecture assembly macros

Answer key ☟

3.5.5 Assembly: UGC NET CSE | December 2010 | Part 2 | Question: 35

Macro-processors are ______.

A. Hardware B. Compiler C. Registers D. None of the above

ugcnetcse-dec2010-paper2 co-and-architecture assembly 8085-microprocessor

Answer key ☟

3.5.6 Assembly: UGC NET CSE | December 2015 | Part 3 | Question: 2

What will be the output at if the following program is executed?

MVI B, 82H
MOV A, B
MOV C, A
MVI D, 37H
OUT PORT1
HLT

A. B. C. D.
ugcnetcse-dec2015-paper3 8086 assembly co-and-architecture non-gatecse

Answer key ☟

3.5.7 Assembly: UGC NET CSE | December 2018 | Part 2 | Question: 15

Consider the following – assembly language instructions:

MOV AL, 153
NEG AL

The contents of the destination register (in -bit binary notation), th status of Carry Flag and Sign Flag
after the execution of above instructions, are

A. B.
C. D.
ugcnetcse-dec2018-paper2 co-and-architecture assembly non-gatecse
 Answer key ☟

3.5.8 Assembly: UGC NET CSE | July 2016 | Part 3 | Question: 4

The Register that stores all interrupt requests is

Interrupt mask register

Interrupt service register

Interrupt request register

Status register
ugcnetcse-july2016-paper3 co-and-architecture assembly

Answer key ☟

3.5.9 Assembly: UGC NET CSE | July 2018 | Part 2 | Question: 97

Match the items in and :

A. B.
C. D.
ugcnetcse-july2018-paper2 co-and-architecture assembly interrupts

Answer key ☟

3.5.10 Assembly: UGC NET CSE | June 2013 | Part 3 | Question: 41

Which of the following is not an addressing mode?

A. Register indirect B. Autoincrement

C. Relative indexed D. Immediate operand
ugcnetcse-june2013-paper3 co-and-architecture assembly addressing-modes

Answer key ☟

3.5.11 Assembly: UGC NET CSE | June 2013 | Part 3 | Question: 42

Computers can have instruction formats with

A. only two address and three address instructions

B. only one address and two address instructions
C. only one address, two address and three address instructions
D. zero address, one address, two address and three address instructions

ugcnetcse-june2013-paper3 co-and-architecture assembly instruction-format

Answer key ☟
 3.5.12 Assembly: UGC NET CSE | June 2013 | Part 3 | Question: 43

What is not a p typical program control instruction?

A. MR B. JMP C. SHL D. TST

ugcnetcse-june2013-paper3 co-and-architecture assembly

Answer key ☟

3.5.13 Assembly: UGC NET CSE | June 2013 | Part 3 | Question: 44

Interrupt which arises from illegal or erroneous use of an instruction or data is

A. Software interrupt B. Internal interrupt

C. External interrupt D. None of the above
ugcnetcse-june2013-paper3 co-and-architecture assembly interrupts

Answer key ☟

3.5.14 Assembly: UGC NET CSE | Junet 2015 | Part 2 | Question: 31

Match the following:

A. B.
C. D.
ugcnetcse-june2015-paper2 assembly

Answer key ☟

3.5.15 Assembly: UGC NET CSE | September 2013 | Part 3 | Question: 33

The instruction : MOV CL, [BX] [DI] + 8 represents the ____ addressing mode

A. Based Relative B. Based Indexed

C. Indexed Relative D. Register Indexed
ugcnetcse-sep2013-paper3 co-and-architecture assembly addressing-modes

Answer key ☟

3.6 Byte Addressable (1)

3.6.1 Byte Addressable: UGC NET CSE | June 2014 | Part 3 | Question: 43

A byte addressable computer has a memory capacity of Kbytes and can perform operations. An
instruction involving operands and one operator needs a maximum of

A. bits B. bits
C. bits D. bits
ugcnetjune2014iii co-and-architecture byte-addressable

Answer key ☟

3.7 CO and Architecture (12)

3.7.1 CO and Architecture: UGC NET CSE | December 2008 | Part 2 | Question: 39

Which of the following are Assembler Directives?

(i) EQU (ii) ORIGIN (iii) START (iv) END

A. (ii), (iii) and (iv)

 B. (i), (iii) and (iv)
C. (iii) and (iv)
D. (i), (ii), (iii) and (iv)

ugcnetcse-dec2008-paper2 co-and-architecture

Answer key ☟

3.7.2 CO and Architecture: UGC NET CSE | December 2010 | Part 2 | Question: 50

One of the distinguished features of super-computer over other category of computer is

A. Parallel processing B. Highest accuracy level

C. More speed D. More capacity
ugcnetcse-dec2010-paper2 co-and-architecture

Answer key ☟

3.7.3 CO and Architecture: UGC NET CSE | December 2012 | Part 3 | Question: 27

In an enhancement of a CPU design, the speed of a floating point unit has been increased by 20% and the speed
of a fixed point unit has been increased by 10%. What is the overall speed achieved if the ratio of the number of
floating point operations to the number of fixed point operations is 2:3 and the floating point operation used to take
twice the time taken by the fixed point operation in original design?

A. 1.62 B. 1.55 C. 1.85 D. 1.285

co-and-architecture ugcnetcse-dec2012-paper3

Answer key ☟

3.7.4 CO and Architecture: UGC NET CSE | December 2013 | Part 3 | Question: 52

Serial access memories are useful in applications where

A. Data consists of numbers B. Short access time is required

C. Each stored word is processed differently. D. None of these
ugcnetcse-dec2013-paper3 co-and-architecture

Answer key ☟

3.7.5 CO and Architecture: UGC NET CSE | January 2017 | Part 3 | Question: 3

The general configuration of the microprogrammed control unit is given below:

What are blocks B and C in the diagram respectively?

A. Block address register and cache memory B. Control address register and control memory
C. Branch register and cache memory D. Control address register and random access memory
ugcnetcse-jan2017-paper3 co-and-architecture control-unit

Answer key ☟

3.7.6 CO and Architecture: UGC NET CSE | June 2012 | Part 2 | Question: 3

The branch logic that provides decision making capabilities in the control unit is known as

A. Controlled transfer B. Conditional transfer

C. Unconditional transfer D. None of the above
ugcnetcse-june2012-paper2 co-and-architecture
 Answer key ☟

3.7.7 CO and Architecture: UGC NET CSE | June 2012 | Part 2 | Question: 46

A complete micro computer system consists of

A. Microprocessor B. Memory
C. Peripheral equipment D. All of the above
co-and-architecture ugcnetcse-june2012-paper2

Answer key ☟

3.7.8 CO and Architecture: UGC NET CSE | June 2012 | Part 2 | Question: 47

Where does a computer add and compare data?

A. Hard disk B. Floppy disk C. CPU chip D. Memory chip

co-and-architecture ugcnetcse-june2012-paper2

Answer key ☟

3.7.9 CO and Architecture: UGC NET CSE | June 2012 | Part 3 | Question: 61

Identify the devices given below with their numbers :

A. B.
C. D.
ugcnetcse-june2012-paper3 co-and-architecture

Answer key ☟

3.7.10 CO and Architecture: UGC NET CSE | October 2020 | Part 2 | Question: 44

Which of the following statements with respect to multiprocessor system are true?

i. Multiprocessor system is controlled by one operating system

ii. In Multiprocessor system, multiple computers are connected by the means of communication lines
iii. Multiprocessor system is classified as multiple instruction stream and multiple data stream system

Choose the correct answer from the options given below:

A. only B. and only C. and only D. and only

ugcnetcse-oct2020-paper2 co-and-architecture

3.7.11 CO and Architecture: UGC NET CSE | October 2020 | Part 2 | Question: 81

Given below are two statements:

Statement : Hardwired control unit can be optimized to produce fast mode of operation
Statement : Indirect addressing mode needs two memory reference to fetch operand
In the light of the above statements, choose the correct answer from the options given below

A. Both Statement and Statement are true

B. Both Statement and Statement are false
C. Statement is correct but Statement is false
D. Statement is incorrect but Statement is true
 ugcnetcse-oct2020-paper2 co-and-architecture control-unit

Answer key ☟

3.7.12 CO and Architecture: UGC NET CSE | September 2013 | Part 3 | Question: 31

Which of the following electronic component is not found in IC’s?

A. Diode B. Resistor C. Transistor D. Inductor

ugcnetcse-sep2013-paper3 co-and-architecture

Answer key ☟

3.8 Cache Memory (5)

3.8.1 Cache Memory: UGC NET CSE | December 2014 | Part 3 | Question: 01

A hierarchical memory system that uses cache memory has cache access time of nano seconds, main memory
access time of nano seconds, % of memory requests are for read, hit ratio of for read access and the
write-through scheme is used. What will be the average access time of the system both for read and write requests ?
A. n.sec. B. n.sec.
C. n.sec. D. n.sec.
ugcnetcse-dec2014-paper3 co-and-architecture cache-memory

Answer key ☟

3.8.2 Cache Memory: UGC NET CSE | July 2016 | Part 3 | Question: 6

In ___ method, the word is written to the block in both the cache and main memory, in parallel
A. Write through B. Write back
C. Write protected D. Direct mapping
ugcnetcse-july2016-paper3 co-and-architecture cache-memory

Answer key ☟

3.8.3 Cache Memory: UGC NET CSE | July 2018 | Part 2 | Question: 98

Which of the following mapping is not used for mapping process in cache memory
A. Associative mapping B. Direct mapping
C. Set-Associative mapping D. Segmented - page mapping
ugcnetcse-july2018-paper2 co-and-architecture cache-memory

Answer key ☟

3.8.4 Cache Memory: UGC NET CSE | June 2012 | Part 2 | Question: 32

Cached and interleaved memories are ways of speeding up memory access between CPU’s and slower RAM.
Which memory models are best suited (i.e. improves the performance most) for which programs ?

I. Cached memory is best suited for small loops.

II. Interleaved memory is best suited for small loops
III. Interleaved memory is best suited for large sequential code.
IV. Cached memory is best suited for large sequential code.
A. I and II are true B. I and III are true
C. IV and II are true D. IV and III are true
ugcnetcse-june2012-paper2 co-and-architecture cache-memory

Answer key ☟

3.8.5 Cache Memory: UGC NET CSE | October 2020 | Part 2 | Question: 5

Consider a machine with a byte addressable main memory of bytes block size of bytes. Assume that a
direct mapped cache consisting of lines used with this machine. How many bits will be there in Tag, line and
 word field of format of main memory addresses?

A. B. C. D.
ugcnetcse-oct2020-paper2 co-and-architecture cache-memory

Answer key ☟

3.9 Cmos (1)

3.9.1 Cmos: UGC NET CSE | July 2018 | Part 2 | Question: 91

CMOS is a computer chip on the motherboard, which is

A. RAM B. ROM C. EPROM D. Auxillary storage

ugcnetcse-july2018-paper2 co-and-architecture cmos

Answer key ☟

3.10 Compilation Phases (1)

3.10.1 Compilation Phases: UGC NET CSE | June 2009 | Part 2 | Question: 34

A compiler that runs on one machine and produces code for a different machine is called :

A. Cross compilation
B. One pass compilation
C. Two pass compilation
D. None of the above

ugcnetcse-june2009-paper2 compiler-design compilation-phases

Answer key ☟

3.11 Cpu (1)

3.11.1 Cpu: UGC NET CSE | December 2011 | Part 2 | Question: 31

CPU does not perform the operation

A. Data transfer B. Logic operation

C. Arithmetic operation D. All of the above
ugcnetcse-dec2011-paper2 co-and-architecture cpu

Answer key ☟

3.12 DMA (1)

3.12.1 DMA: UGC NET CSE | December 2015 | Part 3 | Question: 5

A DMA controller transfers 32-bit words to memory using cycle Stealing. The words are assembled from a
device that transmits characters at a rate of 4800 characters per second. The CPU is fetching and executing
instructions at an average rate of one million instructions per second. By how much will the CPU be slowed down
because of the DMA transfer?

A. 0.06% B. 0.12% C. 1.2% D. 2.5%

ugcnetcse-dec2015-paper3 co-and-architecture dma

Answer key ☟

3.13 Data Transfer (1)

 3.13.1 Data Transfer: UGC NET CSE | Junet 2015 | Part 3 | Question: 2

Consider a 32-bit microprocessor, with a 16-bit external data bus, driven by an 8 MHz input clock. Assume that
this microprocessor has a bus cycle whose minimum duration equals four input clock cycles. What is the
maximum data transfer rate for this microprocessor?

A. bytes/sec B. bytes/sec
C. bytes/sec D. bytes/sec
ugcnetcse-june2015-paper3 co-and-architecture data-transfer

Answer key ☟

3.14 Dynamic Ram (1)

3.14.1 Dynamic Ram: UGC NET CSE | December 2015 | Part 3 | Question: 4

A dynamic RAM has refresh cycle of times per msec. Each refresh operation requires msec and a memory
cycle requires msec. What percentage of memory's total operating time is required for refreshes?

A. B. C. D.
ugcnetcse-dec2015-paper3 co-and-architecture dynamic-ram

Answer key ☟

3.15 Flags (1)

3.15.1 Flags: UGC NET CSE | December 2012 | Part 3 | Question: 31

Which of the following flags are set when ‘JMP’ instruction is executed?

A. SF and CF B. AF and CF C. All flags D. No flag is set

ugcnetcse-dec2012-paper3 co-and-architecture flags

Answer key ☟

3.16 Hardware Interrupt (1)

3.16.1 Hardware Interrupt: UGC NET CSE | July 2016 | Part 3 | Question: 2

8085 microprocessor has ___ hardware interrupt

A. 2 B. 3 C. 4 D. 5
ugcnetcse-july2016-paper3 co-and-architecture hardware-interrupt

Answer key ☟

3.17 Instruction Format (1)

3.17.1 Instruction Format: UGC NET CSE | December 2013 | Part 3 | Question: 50

Which of the following is a design criteria for instruction formats?

A. The size of instructions

B. The number of bits in the address fields
C. The sufficient space in the instruction format to express all the operands desired
D. All of these

ugcnetcse-dec2013-paper3 co-and-architecture instruction-format

Answer key ☟

3.18 Integrated Circuits (1)

 3.18.1 Integrated Circuits: UGC NET CSE | December 2011 | Part 2 | Question: 32

A chip having gates will be classified as

A. SSI B. MSI C. LSI D. VLSI

ugcnetcse-dec2011-paper2 co-and-architecture integrated-circuits

Answer key ☟

3.19 Interrupts (3)

3.19.1 Interrupts: UGC NET CSE | December 2015 | Part 3 | Question: 6

A CPU handles interrupt by executing interrput service subroutine ____

A. by checking interrupt register after execution of each instruction

B. by checking interrupt register at the end of the fetch cycle
C. whenever an interrupt is registered
D. by checking interrupt register at regular time interval

ugcnetcse-dec2015-paper3 interrupts co-and-architecture

Answer key ☟

3.19.2 Interrupts: UGC NET CSE | January 2017 | Part 3 | Question: 1

Which of the following is an interrupt according to temporal relationship with system clock?
A. Maskable interrupt B. Periodic interrupt
C. Division by zero D. Synchronous interrupt
ugcnetcse-jan2017-paper3 interrupts co-and-architecture

Answer key ☟

3.19.3 Interrupts: UGC NET CSE | June 2012 | Part 2 | Question: 37

Interrupts which are initiated by an instruction are

A. Internal B. External C. Hardware D. Software

co-and-architecture interrupts ugcnetcse-june2012-paper2

Answer key ☟

3.20 Language (1)

3.20.1 Language: UGC NET CSE | Junet 2015 | Part 3 | Question: 3

The RST 7 instruction in 8085 microprocessor is equal to

A. CALL 0010 H B. CALL 0034 H

C. CALL 0038 H D. CALL 003C H
ugcnetcse-june2015-paper3 8085-microprocessor assembly language non-gatecse co-and-architecture

Answer key ☟

3.21 Machine Instruction (2)

3.21.1 Machine Instruction: UGC NET CSE | January 2017 | Part 2 | Question: 32

Consider the following assembly language instructions:

mov al, 15
mov ah, 15
xor al, al
mov cl, 3
shr ax, cl
 add al, 90H
add ah, 0

What is the value in register after execution of above instructions?

A. B. C. D.
ugcnetjan2017ii co-and-architecture machine-instruction

Answer key ☟

3.21.2 Machine Instruction: UGC NET CSE | October 2020 | Part 2 | Question: 75

Arrange the following types of machine in descending order of complexity.

i. SISD
ii. MIMD
iii. SIMD

Choose the correct answer from the options given below:

A. B. C. D.
ugcnetcse-oct2020-paper2 co-and-architecture machine-instruction

Answer key ☟

3.22 Memory (4)

3.22.1 Memory: UGC NET CSE | June 2019 | Part 2 | Question: 12

Suppose that the register and the register have the bit configuration. Only the three leftmost bits of are
compared with memory words because has ’s in these positions. Because of its organization, this type of
memory is uniquely suited to parallel searches by data association. This type of memory is known as
A. RAM B. ROM
C. content addressable memory D. secondary memory
ugcnetcse-june2019-paper2 co-and-architecture memory

Answer key ☟

3.22.2 Memory: UGC NET CSE | June 2019 | Part 2 | Question: 19

How many address lines and data lines are required to provide a memory capacity of ?

A. B. C. D.
ugcnetcse-june2019-paper2 co-and-architecture memory

Answer key ☟

3.22.3 Memory: UGC NET CSE | September 2013 | Part 3 | Question: 30

Which logic family dissipates the minimum power?

A. DTL B. TTL C. ECL D. CMOS

ugcnetcse-sep2013-paper3 co-and-architecture memory

Answer key ☟

3.22.4 Memory: UGC NET CSE | September 2013 | Part 3 | Question: 32

A given memory chip has 14 address and 8 data pins. It has the following number of locations.

A. B. C. D.
ugcnetcse-sep2013-paper3 co-and-architecture memory
 Answer key ☟

3.23 Memory Data Transfer (1)

3.23.1 Memory Data Transfer: UGC NET CSE | Junet 2015 | Part 3 | Question: 5

The CPU of a system having 1 MIPS execution rate needs 4 machine cycles on an average for executing an
instruction. The fifty percent of the cycles use memory bus. A memory read/write employs one machine cycle.
For execution of the programs, the system utilizes 90% of the CPU time. For block data transfer, an IO device is
attached to the system while CPU executes the background programs continuously. What is the maximum IO data
transfer rate if programmed IO data transfer technique is used?
A. 500 Kbytes/sec B. 2.2 Mbytes/sec
C. 125 Kbytes/sec D. 250 Kbytes/sec
ugcnetcse-june2015-paper3 co-and-architecture memory-data-transfer

Answer key ☟

3.24 Microprocessors (12)

3.24.1 Microprocessors: UGC NET CSE | August 2016 | Part 3 | Question: 2

microprocessor has ____ bit ALU.

A. B. C. D.
ugcnetcse-aug2016-paper3 co-and-architecture microprocessors 8085-microprocessor

3.24.2 Microprocessors: UGC NET CSE | August 2016 | Part 3 | Question: 4

Which of the following in 8085 microprocessor performs ?

A. DAD D B. DAD H C. DAD B D. DAD SP

ugcnetcse-aug2016-paper3 co-and-architecture microprocessors 8085-microprocessor

Answer key ☟

3.24.3 Microprocessors: UGC NET CSE | December 2013 | Part 3 | Question: 54

The essential difference between traps and interrupts is

A. traps are asynchronous and interrupts are synchronous with the program.
B. traps are synchronous and interrupts are asynchronous with the program.
C. traps are synchronous and interrupts are asynchronous with the I/O devices.
D. None of these

ugcnetcse-dec2013-paper3 microprocessors

Answer key ☟

3.24.4 Microprocessors: UGC NET CSE | January 2017 | Part 2 | Question: 34

The contents of Register and Register of microprocessor are and respectively. The
contents of , the status of carry flag and sign flag after executing assembly
language instruction, are
A. B.
C. D.
ugcnetjan2017ii microprocessors 8085-microprocessor machine-instruction co-and-architecture

Answer key ☟
3.24.5 Microprocessors: UGC NET CSE | January 2017 | Part 3 | Question: 5

In microprocessor, the digit indicates that the microprocessor needs

A. volts, volts supply B. volts supply only
C. volts supply only D. MHz clock
ugcnetcse-jan2017-paper3 co-and-architecture microprocessors

Answer key ☟

3.24.6 Microprocessors: UGC NET CSE | January 2017 | Part 3 | Question: 6

In , which of the following performs: load register pair immediate operation?

A. LDAX rp B. LKLD addr C. LXI rp, data D. INX rp

ugcnetcse-jan2017-paper3 co-and-architecture microprocessors

Answer key ☟

3.24.7 Microprocessors: UGC NET CSE | July 2018 | Part 2 | Question: 100

In 8085 microprocessor, what is the output of following program?

LDA 8000H
MVI B, 30H
ADD B
STA 8001 H

A. Read a number from input port and store it in memory

B. Read a number from input device with address 8000H and store it in memory location 8001H
C. Read a number from memory at location 8000H and store it in memory location 8001H
D. Load A with data from input device with address 8000H and display it on the output device with address 8001H

ugcnetcse-july2018-paper2 co-and-architecture 8085-microprocessor microprocessors

Answer key ☟

3.24.8 Microprocessors: UGC NET CSE | November 2017 | Part 3 | Question: 1

In microprocessor which of the following flag(s) is (are) affected by an arithmetic operation?

A. AC flag only B. CY flag Only

C. Z flag Only D. AC, CY, Z flags
ugcnetcse-nov2017-paper3 microprocessors 8085-microprocessor co-and-architecture

Answer key ☟

3.24.9 Microprocessors: UGC NET CSE | November 2017 | Part 3 | Question: 2

In microprocessor the address bus is of ___________ bits.

A. B. C. D.
ugcnetcse-nov2017-paper3 microprocessors 8085-microprocessor co-and-architecture

3.24.10 Microprocessors: UGC NET CSE | November 2017 | Part 3 | Question: 3

In the architecture of microprocessor match the following :

 A. B.
C. D.
ugcnetcse-nov2017-paper3 microprocessors 8085-microprocessor co-and-architecture

Answer key ☟

3.24.11 Microprocessors: UGC NET CSE | November 2017 | Part 3 | Question: 5

Which of the following is correct statement?

A. In memory – mapped I/O, the CPU can manipulate I/O data residing in interface registers that are not used to
manipulate memory words.
B. The isolated I/O method isolates memory and I/O addresses so that memory address range is not affected by
interface address assignment.
C. In asynchronous serial transfer of data the two units share a common clock.
D. In synchronous serial transmission of data the two units have different clocks.

ugcnetcse-nov2017-paper3 microprocessors co-and-architecture

Answer key ☟

3.24.12 Microprocessors: UGC NET CSE | November 2017 | Part 3 | Question: 6

A micro-instruction format has micro-ops field which is divided into three subfields , , each having
seven distinct micro-operations, conditions field for four status bits, branch field having four options
used in conjunction with address field . The address space is of memory locations. The size of micro-
instruction is

A. bits B. bits C. bits D. bits

ugcnetcse-nov2017-paper3 microprocessors co-and-architecture

Answer key ☟

3.25 Microprogram Control Unit (1)

3.25.1 Microprogram Control Unit: UGC NET CSE | June 2019 | Part 2 | Question: 14

The fault can be easily diagnosed in the micro-program control unit using diagnostic tools by maintaining the
contents of

A. flags and counters B. registers and counters

C. flags and registers D. flags, registers and counters
ugcnetcse-june2019-paper2 co-and-architecture microprogram-control-unit

Answer key ☟

3.26 Parallel Computing (1)

3.26.1 Parallel Computing: UGC NET CSE | June 2012 | Part 3 | Question: 5

Suppose that the given application is run on a 64-processor machine and that 70 percent of the application can
be parallelized. Then the expected performance improvement using Amdahl’s law is

A. 4.22 B. 3.22 C. 3.32 D. 3.52

parallel-computing ugcnetcse-june2012-paper3

Answer key ☟

3.27 Parallel Processing (1)

3.27.1 Parallel Processing: UGC NET CSE | Junet 2015 | Part 2 | Question: 46

In the case of parallelization, Amdahl's law states that if is the proportion of a program that can be made
parallel and is the proportion that cannot be parallelized, then the maximum speed-up that can be
 achieved by using processors is:

A. B. C. D.

ugcnetcse-june2015-paper2 parallel-processing amdahls-law

Answer key ☟

3.28 Pipelining (6)

3.28.1 Pipelining: UGC NET CSE | December 2004 | Part 2 | Question: 47

The processing speeds of pipeline segments are usually :

A. Equal B. Unequal C. Greater D. None of these

ugcnetcse-dec2004-paper2 co-and-architecture pipelining

Answer key ☟

3.28.2 Pipelining: UGC NET CSE | July 2016 | Part 2 | Question: 48

Pipelining improves performance by

A. decreasing instruction latency B. eliminating data hazards
C. exploiting instruction level parallelism D. decreasing the cache miss rate
ugcnetcse-july2016-paper2 co-and-architecture pipelining

Answer key ☟

3.28.3 Pipelining: UGC NET CSE | June 2012 | Part 2 | Question: 48

Pipelining strategy is called implement

A. instruction execution B. instruction prefetch
C. instruction decoding D. instruction manipulation
co-and-architecture pipelining ugcnetcse-june2012-paper2

Answer key ☟

3.28.4 Pipelining: UGC NET CSE | June 2012 | Part 3 | Question: 3

The concept of pipelining is a most effective in improving performance in the tasks being performed in different
stages:

A. require different amount of time

B. require about the same amount of time
C. require different amount of time with time difference between any two tasks being same
D. require different amount with time difference between any two tasks being different

ugcnetcse-june2012-paper3 co-and-architecture pipelining

Answer key ☟

3.28.5 Pipelining: UGC NET CSE | October 2020 | Part 2 | Question: 43

Which of the following statements with respect to -segment pipelining are true?

i. Maximum speedup that a pipeline can provide is theoretically

ii. It is impossible to achieve maximum speed up in -segment pipeline
iii. All segments in pipeline take same time in computation

Choose the correct answer from the options given below:

 A. and only B. and only
C. and only D. and
ugcnetcse-oct2020-paper2 co-and-architecture pipelining

Answer key ☟

3.28.6 Pipelining: UGC NET CSE | October 2020 | Part 2 | Question: 7

A non-pipeline system takes ns to process a task. The same task can be processed in six-segment pipeline with
a clockcycle of ns. Determine approximately the speedup ratio of the pipeline for tasks.

A. B. C. D.
ugcnetcse-oct2020-paper2 co-and-architecture pipelining

Answer key ☟

3.29 Priority Encoder (1)

3.29.1 Priority Encoder: UGC NET CSE | December 2015 | Part 3 | Question: 1

The three outputs from the priority encoder are used to provide a vector address of the form
. what is the second highest priority vector address in hexadecimal if the vector addresses are
starting from the one with the highest priority?

A. B. C. D.
ugcnetcse-dec2015-paper3 co-and-architecture priority-encoder

Answer key ☟

3.30 Processor Address Bus (1)

3.30.1 Processor Address Bus: UGC NET CSE | June 2019 | Part 2 | Question: 49

A processor can support a maximum memory of GB where memory is word addressable and a word is bytes.
What will be the size of the address bus of the processor?

A. At least bits B. At least bytes

C. At least bits D. Minimum bytes
ugcnetcse-june2019-paper2 co-and-architecture processor-address-bus

Answer key ☟

3.31 Register (1)

3.31.1 Register: UGC NET CSE | August 2016 | Part 3 | Question: 3

The register that stores the bits required to mask the interrupts is ______.
A. Status register B. Interrupt service register
C. Interrupt mask register D. Interrupt request register
ugcnetcse-aug2016-paper3 co-and-architecture register interrupts

Answer key ☟

3.32 Speedup (2)

3.32.1 Speedup: UGC NET CSE | December 2012 | Part 3 | Question: 49

Let be the fraction of the computation (in terms of time) that is parallelizabl . the number of processors in
the system, and the speed up achievable in comparison with sequential execution – then the can be
calculated using the relation:

A. B. C. D.
ugcnetcse-dec2012-paper3 co-and-architecture speedup
 Answer key ☟

3.32.2 Speedup: UGC NET CSE | June 2019 | Part 2 | Question: 20

Suppose that a computer program takes seconds of execution time on a computer with multiplication
operation responsible for seconds of this time. How much do you have to improve the speed of the
multiplication operation if you are asked to execute this program four times faster?
A. times faster B. times faster
C. times faster D. times faster
ugcnetcse-june2019-paper2 co-and-architecture speedup

Answer key ☟

Answer Keys
3.0.1 Q-Q 3.1.1 D 3.1.2 B 3.1.3 D 3.1.4 A
3.1.5 B 3.1.6 A 3.2.1 D 3.3.1 Q-Q 3.3.2 D
3.3.3 Q-Q 3.3.4 C 3.3.5 A 3.3.6 D 3.3.7 Q-Q
3.3.8 A 3.3.9 D 3.3.10 X 3.3.11 A 3.4.1 Q-Q
3.5.1 Q-Q 3.5.2 Q-Q 3.5.3 Q-Q 3.5.4 Q-Q 3.5.5 Q-Q
3.5.6 C 3.5.7 Q-Q 3.5.8 C 3.5.9 Q-Q 3.5.10 C
3.5.11 D 3.5.12 C 3.5.13 B 3.5.14 D 3.5.15 B
3.6.1 D 3.7.1 Q-Q 3.7.2 Q-Q 3.7.3 X 3.7.4 D
3.7.5 B 3.7.6 A 3.7.7 D 3.7.8 C 3.7.9 A
3.7.10 C 3.7.11 A 3.7.12 D 3.8.1 A 3.8.2 A
3.8.3 Q-Q 3.8.4 B 3.8.5 A 3.9.1 Q-Q 3.10.1 Q-Q
3.11.1 Q-Q 3.12.1 B 3.13.1 B 3.14.1 D 3.15.1 D
3.16.1 D 3.17.1 D 3.18.1 Q-Q 3.19.1 A 3.19.2 D
3.19.3 D 3.20.1 C 3.21.1 A 3.21.2 C 3.22.1 C
3.22.2 C 3.22.3 D 3.22.4 B 3.23.1 D 3.24.1 Q-Q
3.24.2 Q-Q 3.24.3 B 3.24.4 C 3.24.5 B 3.24.6 C
3.24.7 Q-Q 3.24.8 D 3.24.9 C 3.24.10 B 3.24.11 B
3.24.12 B 3.25.1 D 3.26.1 B 3.27.1 C 3.28.1 Q-Q
3.28.2 C 3.28.3 X 3.28.4 B 3.28.5 A 3.28.6 B
3.29.1 A 3.30.1 C 3.31.1 Q-Q 3.32.1 C 3.32.2 C
4 Compiler Design (74)

4.0.1 UGC NET CSE | June 2012 | Part 3 | Question: 73

In which file the compiler manage various objects, which are used in windows programming?

A. Control File B. Binary File C. Text File D. Obj File

ugcnetcse-june2012-paper3 compiler-design

Answer key ☟

4.0.2 UGC NET CSE | June 2013 | Part 2 | Question: 21

Given the production rules of a grammar G1 as

and the production rules of a grammar G2 as

Which of the following is correct statement?

A. G1 is ambiguous and G2 is not ambiguous B. G1 is ambiguous and G2 is ambiguous

C. G1 is not ambiguous and G2 is ambiguous D. G1 is not ambiguous and G2 is not ambiguous
ugcnetcse-june2013-paper2 compiler-design

Answer key ☟

4.0.3 UGC NET CSE | June 2013 | Part 2 | Question: 23

The equivalent production rules corresponding to the production rules is

A.
B. ,
C.
D.

ugcnetcse-june2013-paper2 compiler-design

Answer key ☟

4.0.4 UGC NET CSE | December 2013 | Part 2 | Question: 29

The process of assigning load addresses to the various parts of the program and adjusting the code and data in
the program to reflect the assigned address is called

A. Symbol resolution B. Parsing C. Assembly D. Relocation

ugcnetcse-dec2013-paper2 compiler-design

Answer key ☟

4.0.5 UGC NET CSE | December 2013 | Part 3 | Question: 17

The compiler converts all operands upto the type of the largest operand is called
A. Type Promotion B. Type Evaluation
C. Type Conversion D. Type Declaration
ugcnetcse-dec2013-paper3 compiler-design

Answer key ☟
4.0.6 UGC NET CSE | Junet 2015 | Part 2 | Question: 35

Which phase of compiler generates stream of atoms?

A. Syntax Analysis B. Lexical Analysis
C. Code Generation D. Code Optimization
ugcnetcse-june2015-paper2 compiler-design

Answer key ☟

4.0.7 UGC NET CSE | June 2009 | Part 2 | Question: 32

The linker :

A. is similar to interpreter
B. uses source code as its input
C. is required to create a load module
D. none of the above

ugcnetcse-june2009-paper2

Answer key ☟

4.0.8 Which activity is not included in the first pass of two pass assemblers (UGC NET Dec 04)

Q1. Which activity is not included in the first pass of two pass
assemblers?
(A) Build the symbol table
(B) Construct the intermediate code
(C) Separate mnemonic opcode and operand fields
(D) None of the above

4.0.9 UGC NET CSE | November 2017 | Part 2 | Question: 35

Match the description of several parts of a classic optimizing compiler in , with the names of those parts in
:

A.
B.
C.
D.
 ugcnetcse-nov2017-paper2 compiler-design

Answer key ☟

4.0.10 UGC NET CSE | June 2006 | Part 2 | Question: 4

The logic of pumping lemma is a good example of :

A. pigeon hole principle B. recursion
C. divide and conque technique D. iteration
ugcnetcse-june2006-paper2 compiler-design

Answer key ☟

4.0.11 UGC NET CSE | December 2004 | Part 2 | Question: 31

Which activity is not included in the first pass of two pass assemblers ?

A. Build the symbol table B. Construct the intermediate code

C. Separate mnemonic opcode and operand fields D. None of the above
ugcnetcse-dec2004-paper2

Answer key ☟

4.0.12 UGC NET CSE | December 2004 | Part 2 | Question: 35

In two pass assembler the symbol table is used to store :

A. Label and value B. Only value C. Mnemonic D. Memory Location

ugcnetcse-dec2004-paper2

Answer key ☟

4.0.13 UGC NET CSE | December 2004 | Part 2 | Question: 34

Which activity is included in the first pass of two pass assemblers?

A. Build the symbol table B. Construct the intermediate code
C. Separate mnemonic opcode and operand fields D. None of these
ugcnetcse-dec2004-paper2

Answer key ☟

4.0.14 UGC NET CSE | December 2004 | Part 2 | Question: 33

Code optimization is responsibility of :

A. Application programmer B. System programmer

C. Operating system D. All of the above
ugcnetcse-dec2004-paper2

Answer key ☟

4.0.15 UGC NET CSE | December 2006 | Part 2 | Question: 39

A permanent database of a general model of compiler is ____________ .

A. Identifier table B. Page map table
C. Literal table D. Terminal table
ugcnetcse-dec2006-paper2

4.0.16 UGC NET CSE | December 2006 | Part 2 | Question: 33

A compiler for a high level language that runs on one machine and produces code for a different machine is
called :
 A. Optimizing B. One pass compiler
C. Cross compiler D. Multipass compiler
ugcnetcse-dec2006-paper2

Answer key ☟

4.0.17 UGC NET CSE | December 2006 | Part 2 | Question: 32

Which of the following is the most general phase-structured grammar ?

A. Regular B. Context-sensitive C. Context free D. Syntax tree

ugcnetcse-dec2006-paper2

Answer key ☟

4.0.18 UGC NET CSE | December 2007 | Part 2 | Question: 35

In the context of compiler design, “reduction in strength” refers to :

A. code optimization obtained by the use of cheaper machine instructions

B. reduction in accuracy of the output
C. reduction in the range of values of input variables
D. reduction in efficiency of the program

ugcnetcse-dec2007-paper2

Answer key ☟

4.0.19 UGC NET CSE | December 2007 | Part 2 | Question: 34

Top-down parsers are predictive parsers, because :

A. next tokens are predicted

B. length of the parse tree is predicted before hand
C. lowest node in the parse tree is predicted
D. next lower level of the parse tree is predicted

ugcnetcse-dec2007-paper2

Answer key ☟

4.0.20 UGC NET CSE | December 2007 | Part 2 | Question: 33

Absolute loader demands that the programmer needs to know the :

A. start address of the available main memory B. total size of the program
C. actual address of the data location D. absolute values of the operands used
ugcnetcse-dec2007-paper2

Answer key ☟

4.0.21 UGC NET CSE | December 2007 | Part 2 | Question: 32

A single instruction in an assembly language program contains :

A. one micro operation B. one macro operation
C. one instruction to be completed in a single pulse D. one machine code instruction
ugcnetcse-dec2007-paper2

Answer key ☟
 4.0.22 UGC NET CSE | December 2007 | Part 2 | Question: 31

In a two pass compiler, during the first pass :

A. user defined address symbols are correlated with their binary equivalent
B. the syntax of the statement is checked and mistakes, if any, are listed
C. object program is generated
D. semantic of the source program is elucidated

ugcnetcse-dec2007-paper2

Answer key ☟

4.0.23 UGC NET CSE | October 2020 | Part 2 | Question: 74

Find the lexicographic ordering of the bit strings given below based on the ordering .

a.
b.
c.
d.
e.

Choose the correct answer from the options given below:

A.
B.
C.
D.

ugcnetcse-oct2020-paper2 compiler-design

Answer key ☟

4.1 Assembler (2)

4.1.1 Assembler: UGC NET CSE | December 2005 | Part 2 | Question: 35

Which activities is not included in the first pass of two pass assembler?

A. build the symbol table B. construct the Intermediate code

C. separate memonic opcode and operand field. D. none of these
ugcnetcse-dec2005-paper2 compiler-design assembler

Answer key ☟

4.1.2 Assembler: UGC NET CSE | June 2005 | Part 2 | Question: 33

Which activity is not included in the first pass of two pass assemblers?
A. Build the symbol table B. Construct the machine code
C. Separate mnemonic opcode and operand fields. D. None of these
ugcnetcse-june2005-paper2 compiler-design assembler

Answer key ☟

4.2 Chomsky Normal Form (1)

4.2.1 Chomsky Normal Form: UGC NET CSE | December 2012 | Part 3 | Question: 53

If the parse tree of a word w generated by a Chomsky form grammar has no path of length greater than i, then
the word w is of length
 A. no greater than B. no greater than
C. no greater than D. no greater than
chomsky-normal-form ugcnetcse-dec2012-paper3 parsing

Answer key ☟

4.3 Code Optimization (2)

4.3.1 Code Optimization: UGC NET CSE | December 2006 | Part 2 | Question: 35

Peer-hole optimization is a form of :

A. loop optimization B. local optimization
C. constant folding D. data flow analysis
ugcnetcse-dec2006-paper2 compiler-design code-optimization

Answer key ☟

4.3.2 Code Optimization: UGC NET CSE | December 2012 | Part 2 | Question: 11

In compiler design ‘reducing the strength’ refers to

A. reducing the range of values of input variables B. code optimization using cheaper machine instructions
C. reducing efficiency of program D. none of the above
code-optimization ugcnetcse-dec2012-paper2 compiler-design

Answer key ☟

4.4 Compilation Phases (2)

4.4.1 Compilation Phases: UGC NET CSE | August 2016 | Part 2 | Question: 33

In compiler optimization, operator strength reduction uses mathematical identities to replace slow math
operations with faster operations. Which of the following code replacements is an illustration of operator
strength reduction ?

A. Replace by or Replace by .
B. Replace by
C. Replace by
D. Replace by

ugcnetcse-aug2016-paper2 compiler-design compilation-phases

Answer key ☟

4.4.2 Compilation Phases: UGC NET CSE | June 2005 | Part 2 | Question: 31

Which of the statements related to Compilers is wrong ?

A. Lexical analysis is breaking the input into tokens B. Syntax analysis is for parsing the phrase
C. Syntax analysis is for analyzing the semantic D. None of these
ugcnetcse-june2005-paper2 compiler-design compilation-phases

Answer key ☟

4.5 Compiler Optimization (2)

4.5.1 Compiler Optimization: UGC NET CSE | December 2015 | Part 2 | Question: 41

Loop unrolling is a code optimization technique:

A. that avoids tests at every iteration of the loop

B. that improves preformance by decreasing the number of instructions in a basic block
C. that exchanges inner loops with outer loops
D. that reorders operations to allow multiple computations to happen in parallel
 ugcnetcse-dec2015-paper2 compiler-design compiler-optimization

Answer key ☟

4.5.2 Compiler Optimization: UGC NET CSE | July 2016 | Part 2 | Question: 33

In ____, the bodies of the two loops are merged together to form a single loop provided that they do not make
any references to each other.
A. Loop unrolling B. Strength reductions
C. Loop concatenation D. Loop jamming
ugcnetcse-july2016-paper2 compiler-design compiler-optimization

Answer key ☟

4.6 Constant Folding (1)

4.6.1 Constant Folding: UGC NET CSE | June 2019 | Part 2 | Question: 73

Replacing the expression by is known as

A. constant folding B. induction variable
C. strength reduction D. code reduction
ugcnetcse-june2019-paper2 code-optimization constant-folding

Answer key ☟

4.7 Context Sensitive (1)

4.7.1 Context Sensitive: UGC NET CSE | June 2005 | Part 2 | Question: 32

Which of the following is the most general phase – structured grammar ?

A. Regular B. Context – Sensitive
C. Context free D. None of these
ugcnetcse-june2005-paper2 compiler-design grammar context-sensitive

Answer key ☟

4.8 Control Flow Graph (1)

4.8.1 Control Flow Graph: UGC NET CSE | December 2013 | Part 3 | Question: 4

Given a flow graph with 10 nodes, 13 edges and one connected components, the number of regions and the
number of predicate (decision) nodes in the flow graph will be

A. 4, 5 B. 5, 4 C. 3, 1 D. 13, 8
ugcnetcse-dec2013-paper3 compiler-design control-flow-graph

Answer key ☟

4.9 Grammar (6)

4.9.1 Grammar: UGC NET CSE | December 2009 | Part 2 | Question: 32

Which of the following grammar is LR (1) ?

(A) A --> a A b, A --> b A b, A --> a , A --> b

(B) A --> a A a, A --> a A b, A --> c

(C) A --> A + A, A --> a

(D) Both (A) and (B)

 ugcnetcse-dec2009-paper2 compiler-design grammar

4.9.2 Grammar: UGC NET CSE | December 2009 | Part 2 | Question: 35

Synthesized attribute can be easily simulated by a

(A) LL grammar

(B) Ambiguous grammar

(C) LR grammar

(D) None of the above

ugcnetcse-dec2009-paper2 compiler-design grammar

Answer key ☟

4.9.3 Grammar: UGC NET CSE | December 2015 | Part 3 | Question: 24

The language of all non-null strings of a's can be defined by a context free grammar as follow :

The word can be generated by ______ different trees.

A. Two B. Three C. Four D. Five

compiler-design grammar ugcnetcse-dec2015-paper3

Answer key ☟

4.9.4 Grammar: UGC NET CSE | June 2010 | Part 2 | Question: 34

Which of the following is the most general phase structured grammar ?

A. Regular B. Context-sensitive
C. Context free D. None of the above
ugcnetcse-june2010-paper2 compiler-design grammar

Answer key ☟

4.9.5 Grammar: UGC NET CSE | June 2014 | Part 2 | Question: 06

A grammar is if and only if the following conditions hold for two distinct productions
I. First First where is some terminal symbol of the grammar.
II. First First
III. First Follow if First

A. I and II B. I and III C. II and III D. I, II and III

ugcnetcse-june2014-paper2 compiler-design grammar parsing

Answer key ☟

4.9.6 Grammar: UGC NET CSE | October 2022 | Part 1 | Question: 83

Consider the grammer .

Consider the following statements:
The string abababa has
(A) two parse trees
(B) two left most derivations
(C) two right most derivations
Which of the following is correct?
A. All and are true, B. Only is true
 C. Only is true D. Only is true
ugcnetcse-oct2022-paper1 compiler-design grammar easy

4.10 Intermediate Code (1)

4.10.1 Intermediate Code: UGC NET CSE | October 2020 | Part 2 | Question: 30

Which of the following is not an intermediate code form?

A. Syntax trees B. Three address codes
C. Quadrupules D. Post fix Notation
ugcnetcse-oct2020-paper2 compiler-design intermediate-code

Answer key ☟

4.11 LR Parser (2)

4.11.1 LR Parser: UGC NET CSE | December 2006 | Part 2 | Question: 34

The ‘K’ in LR (K) cannot be :

A. B. C. D. None of these
ugcnetcse-dec2006-paper2 lr-parser compiler-design

Answer key ☟

4.11.2 LR Parser: UGC NET CSE | December 2014 | Part 2 | Question: 32

Which of the following is true ?

A. Canonical parser is parser with single look ahead terminal

B. All parsers with can be transformed into parsers.
C. Both and
D. None of the above

ugcnetcse-dec2014-paper2 compiler-design lr-parser

Answer key ☟

4.12 Lexical Analysis (3)

4.12.1 Lexical Analysis: UGC NET CSE | December 2014 | Part 3 | Question: 20

How many tokens will be generated by the scanner for the following statement ?
;

A. B. C. D.
ugcnetcse-dec2014-paper3 compiler-design lexical-analysis

Answer key ☟

4.12.2 Lexical Analysis: UGC NET CSE | January 2017 | Part 2 | Question: 33

Consider the following statements related to compiler construction:

I. Lexical Analysis is specified by context-free grammars and implemented by pushdown automata.

II. Syntax Analysis is specified by regular expressions and implemented by finite-state machine.

Which of the above statement(s) is/are correct?

A. Only I B. Only II
C. Both I and II D. Neither I nor II
ugcnetjan2017ii compiler-design lexical-analysis
 Answer key ☟

4.12.3 Lexical Analysis: UGC NET CSE | June 2010 | Part 2 | Question: 35

Which of the following is used for grouping of characters into tokens (in a computer) ?

A. A parser B. Code optimizer C. Code generator D. Scanner

ugcnetcse-june2010-paper2 compiler-design lexical-analysis

Answer key ☟

4.13 Linker (1)

4.13.1 Linker: UGC NET CSE | August 2016 | Part 2 | Question: 34

Which of the following are the principles tasks of the linker ?

I. Resolve external references among separately compiled program units.
II. Translate assembly language to machine code.
III. Relocate code and data relative to the beginning of the program.
IV. Enforce access-control restrictions on system libraries.

A. and B. and C. and D. and

ugcnetcse-aug2016-paper2 compiler-design linker

Answer key ☟

4.14 Machine Instruction (1)

4.14.1 Machine Instruction: UGC NET CSE | December 2015 | Part 2 | Question: 42

What will be the hexadecimal value in the register (32-bit) after executing the following instructions?
mov al, 15
mov ah, 15
xor al, al
mov cl, 3
shr ax, cl

A. 0F00 h B. 0F0F h C. 01E0 h D. FFFF h

ugcnetcse-dec2015-paper2 machine-instruction compiler-design

Answer key ☟

4.15 Parameter Passing (2)

4.15.1 Parameter Passing: UGC NET CSE | August 2016 | Part 3 | Question: 21

Assume that the program is implementing parameter passing with ‘call by reference’. What will be printed
by following print statements in ?
Program P
{
x=10;
y=3;
funb(y,x,x)
print x;
print y;
}
funb (x,y,z)
{
y=y+4;
z=x+y+z;
}
 A. 10, 7 B. 31, 3 C. 10, 3 D. 31, 7
ugcnetcse-aug2016-paper3 parameter-passing

Answer key ☟

4.15.2 Parameter Passing: UGC NET CSE | December 2014 | Part 3 | Question: 19

Consider the following statements and :

: In call-by-value, anything that is passed into a function call is unchanged in the caller’s scope when the
function returns.
: In call-by-reference, a function receives implicit reference to a variable used as argument.
: In call-by-reference, caller is unable to see the modified variable used as argument.
A. and are true. B. and are true.
C. and are true. D. are true.
ugcnetcse-dec2014-paper3 compiler-design runtime-environment parameter-passing

Answer key ☟

4.16 Parsing (13)

4.16.1 Parsing: UGC NET CSE | December 2005 | Part 2 | Question: 32

A Top - down Parse generates

A. Left most derivation B. Right – most derivation

C. Right most derivation in reverse D. Left – most derivation in reverse
ugcnetcse-dec2005-paper2 compiler-design parsing

Answer key ☟

4.16.2 Parsing: UGC NET CSE | December 2009 | Part 2 | Question: 33

A shift-reduce parser carries out the actions specified within braces immediately after reducing with the
corresponding rule of the grammar.

S --> x x W [ print “1”]

S --> y [print “2”]
W --> S2 [print “3”],

what is the translation of “x x x x y z z” ?

(A) 1 1 2 3 1

(B) 1 1 2 3 3

(C) 2 3 1 3 1

(D) 2 3 3 2 1
ugcnetcse-dec2009-paper2 compiler-design parsing

4.16.3 Parsing: UGC NET CSE | December 2012 | Part 2 | Question: 18

Given the following expressions of a grammar

Which of the following is true?

A. has the higher precedence than + B. - has the higher precedence than
C. + and – have same precedence D. + has the higher precedence than
ugcnetcse-dec2012-paper2 compiler-design parsing
 Answer key ☟

4.16.4 Parsing: UGC NET CSE | December 2012 | Part 2 | Question: 27

Which of the following is true while converting CFG to an LL(1) grammar?

A. Removing left recursion alone B. Factoring the grammar alone

C. Removing left recursion and factoring the grammar D. None of the above
ugcnetcse-dec2012-paper2 compiler-design parsing

Answer key ☟

4.16.5 Parsing: UGC NET CSE | December 2013 | Part 2 | Question: 26

Given the following statements:
: SLR uses follow information to guide reductions. In case of LR and LALR parsers, the look-aheads are
associated with the items and they make use of the left context available to the parser.
: LR grammar is a large subclass of context free grammar as compared to that SLR and LALR grammars.
Which of the following is true?
A. is not correct and is not correct.
B. is not correct and is correct.
C. is correct and is not correct.
D. is correct and is correct

ugcnetcse-dec2013-paper2 compiler-design parsing

Answer key ☟

4.16.6 Parsing: UGC NET CSE | December 2015 | Part 2 | Question: 43

Which of the following statements is false?

A. Top-down parsers are LL parsers where first L stands for left-to-right scan and second L stands for a leftmost
derivation
B. (000)* is a regular expression that matches only strings containing an odd number of zeroes, including the empty
string
C. Bottom-up parsers are in the LR family, where L stands for left-to-right scan and R stands for rightmost derivation
D. The class of context-free languages is closed under reversal. That is, if L is any context-free language, then the
language is context-free

ugcnetcse-dec2015-paper2 compiler-design parsing

Answer key ☟

4.16.7 Parsing: UGC NET CSE | December 2018 | Part 2 | Question: 39

Consider the following grammar :

where is the set of non-terminals, is the set of terminals.

Which of the following statement(s) is/are correct?

: can parse all strings that are generated using grammar .

: can parse all strings that are generated using grammar .

Choose the correct answer from the code given below:

A. Only B. Only C. Both and D. Neither nor

 ugcnetcse-dec2018-paper2 parsing

Answer key ☟

4.16.8 Parsing: UGC NET CSE | July 2016 | Part 2 | Question: 35

Which of the following is false?

A. The grammar , where is the only non-terminal symbol and is the null string, is
ambiguous
B. SLR is powerful than LALR
C. An LL(1) parser is a top-down parser
D. YACC tool is an LALR(1) parser generator

ugcnetcse-july2016-paper2 compiler-design parsing

Answer key ☟

4.16.9 Parsing: UGC NET CSE | July 2018 | Part 2 | Question: 39

A bottom-up parser generates:

A. Left-most derivation in reverse B. Right-most derivation in reverse

C. Left-most derivation D. Right-most derivation
ugcnetcse-july2018-paper2 compiler-design parsing

Answer key ☟

4.16.10 Parsing: UGC NET CSE | June 2014 | Part 2 | Question: 07

Which of the following suffices to convert an arbitrary to an grammar ?

A. Removing left recursion alone B. Removing the grammar alone
C. Removing left recursion and factoring the grammar D. None of the above
ugcnetcse-june2014-paper2 compiler-design parsing

Answer key ☟

4.16.11 Parsing: UGC NET CSE | June 2014 | Part 2 | Question: 08

A shift reduce parser suffers from

A. Shift reduce conflict only

B. Reduce reduce conflict only
C. Both shift reduce conflict and reduce reduce conflict
D. Shift handle and reduce handle conflicts

ugcnetcse-june2014-paper2 compiler-design parsing

Answer key ☟

4.16.12 Parsing: UGC NET CSE | June 2023 | Part 2: 27

Which of the following parser is most powerful parser?

A. Operator precedence B. C. Canonical D.

ugcnetcse-june2023-paper2 compiler-design parsing

Answer key ☟

4.16.13 Parsing: UGC NET CSE | Junet 2015 | Part 2 | Question: 34

Which one of the following is false?

A. LALR parser is Bottom-Up parser

 B. A parsing algorithm which performs a left to right scanning and a right most deviation is RL( )
C. LR parser is Bottom-Up parser
D. In LL( ), the indicates that there is a one symbol look-ahead

ugcnetcse-june2015-paper2 compiler-design parsing

Answer key ☟

4.17 Quadruple Representation (1)

4.17.1 Quadruple Representation: UGC NET CSE | June 2019 | Part 2 | Question: 72

On translating the expression given below into quadruple representation, how many operations are required?

A. B. C. D.
ugcnetcse-june2019-paper2 intermediate-code quadruple-representation

Answer key ☟

4.18 Runtime Environment (1)

4.18.1 Runtime Environment: UGC NET CSE | January 2017 | Part 2 | Question: 35

Which of the following statement(s) regarding a linker software is/are true ?

I. A function of a linker is to combine several object modules into a single load module.

II. A function of a linker is to replace absolute references in an object module by symbolic references to locations
in other modules.

A. Only I B. Only II
C. Both I and II D. Neither I nor II
ugcnetjan2017ii runtime-environment compiler-design

Answer key ☟

4.19 Shift Reduce Parser (2)

4.19.1 Shift Reduce Parser: UGC NET CSE | December 2014 | Part 2 | Question: 31

Shift-Reduce parsers perform the following :

A. Shift step that advances in the input stream by symbols and Reduce step that applies a completed
grammar rule to some recent parse trees, joining them together as one tree with a new root symbol.
B. Shift step that advances in the input stream by one symbol and Reduce step that applies a completed grammar rule
to some recent parse trees, joining them together as one tree with a new root symbol.
C. Shift step that advances in the input stream by symbols and Reduce step that applies a completed
grammar rule to form a single tree.
D. Shift step that does not advance in the input stream and Reduce step that applies a completed grammar rule to form a
single tree.

ugcnetcse-dec2014-paper2 compiler-design shift-reduce-parser

Answer key ☟

4.19.2 Shift Reduce Parser: UGC NET CSE | June 2019 | Part 2 | Question: 74

Shift-reduce parser consists of

i. input buffer
 ii. stack
iii. parse table

Choose the correct option from those given below:

A. a and b only B. a and c only C. c only D. a, b and c

ugcnetcse-june2019-paper2 shift-reduce-parser

Answer key ☟

4.20 Symbol Table (3)

4.20.1 Symbol Table: UGC NET CSE | June 2005 | Part 2 | Question: 35

Symbol Table can be used for :

A. Checking type compatibility B. Suppressing duplication of error message
C. Storage allocation D. All of these
ugcnetcse-june2005-paper2 compiler-design symbol-table

Answer key ☟

4.20.2 Symbol Table: UGC NET CSE | June 2019 | Part 2 | Question: 71

Which data structure is used by the compiler for managing variables and their attributes?

A. Binary tree B. Link list C. Symbol table D. Parse table

ugcnetcse-june2019-paper2 compiler-design symbol-table

Answer key ☟

4.20.3 Symbol Table: UGC NET CSE | October 2020 | Part 2 | Question: 41

Which of the following are applications of symbol table?

i. Storage allocation
ii. Checking type compatibility
iii. Suppressing duplicate error messages

Choose the correct answer from the options given below:

A. and only B. and only
C. and only D. and

ugcnetcse-oct2020-paper2 compiler-design symbol-table

Answer key ☟

4.21 System Software& Compilers (1)

4.21.1 System Software& Compilers: UGC NET CSE | June 2010 | Part 2 | Question: 31

In an absolute loading scheme, which loader function is accomplished by a loader ?

A. Re-allocation B. Allocation C. Linking D. Loading

ugcnetcse-june2010-paper2 system-software&-compilers compiler-design runtime-environment

Answer key ☟

4.22 Translator (1)

 4.22.1 Translator: UGC NET CSE | Junet 2015 | Part 2 | Question: 32

The translator which performs macro calls expansion is called

A. Macro processor B. Micro pre-processor

C. Macro pre-processor D. Dynamic linker
ugcnetcse-june2015-paper2 translator preprocessor

Answer key ☟

4.23 Two Pass Assembler (1)

4.23.1 Two Pass Assembler: UGC NET CSE | December 2014 | Part 2 | Question: 33

In a two-pass assembler, symbol table is

A. Generated in first pass B. Generated in second pass
C. Not generated at all D. Generated and used only in second pass
ugcnetcse-dec2014-paper2 two-pass-assembler

Answer key ☟

Answer Keys
4.0.1 D 4.0.2 B 4.0.3 D 4.0.4 D 4.0.5 A
4.0.6 B 4.0.7 Q-Q 4.0.8 Q-Q 4.0.9 A 4.0.10 Q-Q
4.0.11 Q-Q 4.0.12 Q-Q 4.0.13 Q-Q 4.0.14 Q-Q 4.0.15 Q-Q
4.0.16 C 4.0.17 Q-Q 4.0.18 Q-Q 4.0.19 Q-Q 4.0.20 Q-Q
4.0.21 Q-Q 4.0.22 Q-Q 4.0.23 B 4.1.1 Q-Q 4.1.2 Q-Q
4.2.1 C 4.3.1 Q-Q 4.3.2 B 4.4.1 Q-Q 4.4.2 Q-Q
4.5.1 A 4.5.2 D 4.6.1 A 4.7.1 Q-Q 4.8.1 B
4.9.1 Q-Q 4.9.2 Q-Q 4.9.3 D 4.9.4 Q-Q 4.9.5 D
4.9.6 Q-Q 4.10.1 X 4.11.1 Q-Q 4.11.2 C 4.12.1 A
4.12.2 D 4.12.3 Q-Q 4.13.1 Q-Q 4.14.1 C 4.15.1 Q-Q
4.15.2 C 4.16.1 A 4.16.2 Q-Q 4.16.3 B 4.16.4 C
4.16.5 D 4.16.6 B 4.16.7 D 4.16.8 B 4.16.9 Q-Q
4.16.10 D 4.16.11 C 4.16.12 Q-Q 4.16.13 B 4.17.1 B
4.18.1 A 4.19.1 B 4.19.2 D 4.20.1 Q-Q 4.20.2 C
4.20.3 D 4.21.1 Q-Q 4.22.1 C 4.23.1 A
5 Computer Networks (294)

5.0.1 UGC NET CSE | December 2013 | Part 2 | Question: 43

Which of the following is widely used inside the telephone system for long-haul data traffic?
A. ISDN
B. ATM
C. Frame Relay
D. ISTN

ugcnetcse-dec2013-paper2 computer-networks

Answer key ☟

5.0.2 UGC NET CSE | December 2015 | Part 3 | Question: 11

A network with bandwidth of Mbps can pass only an average of frames per minute with each
frame carrying an average of bits. What is the throughput of this network ?

A. Mbps B. Mbps C. Mbps D. Mbps

computer-networks ugcnetcse-dec2015-paper3

Answer key ☟

5.0.3 UGC NET CSE | June 2014 | Part 2 | Question: 04

The bit rate of a signal is bps. If each signal unit carries bits, the baud rate of the signal is _________.

A. baud/sec B. baud/sec
C. baud/sec D. baud/sec.
ugcnetcse-june2014-paper2 computer-networks serial-communication

Answer key ☟

5.0.4 UGC NET CSE | June 2012 | Part 2 | Question: 5

Networks that use different technologies can be connected by using

A. Packets B. Switches C. Bridges D. Routers

ugcnetcse-june2012-paper2 computer-networks

Answer key ☟

5.0.5 UGC NET CSE | June 2012 | Part 2 | Question: 14

Which of the following TCP/IP Internet protocol does diskless machine uses to obtain its IP address from a
server?

A. RAP B. RIP C. ARP D. X.25

ugcnetcse-june2012-paper2 computer-networks

Answer key ☟

5.0.6 UGC NET CSE | June 2012 | Part 2 | Question: 34

Checksum used along with each packet computes the sum of the data, where data is treated as a sequence of

A. Integer B. Character C. Real numbers D. Bits

computer-networks ugcnetcse-june2012-paper2

Answer key ☟
5.0.7 UGC NET CSE | June 2012 | Part 3 | Question: 54

What is the size (in terms of bits) of Header length field in IPV4 header?

A. 2 B. 4 C. 8 D. 16
ugcnetcse-june2012-paper3 computer-networks

Answer key ☟

5.0.8 UGC NET CSE | July 2016 | Part 3 | Question: 25

If link transmits 4000 frames per scond and each slot has 8 bits , the transmission rate of circuits of this TDM is
_____

A. 64 Kbps B. 32 Mbps C. 32 Kbps D. 64 Mbps

ugcnetcse-july2016-paper3 computer-networks

Answer key ☟

5.0.9 UGC NET CSE | June 2014 | Part 3 | Question: 67

Ten signals, each requiring Hz, are multiplexed on to a single channel using FDM. How much minimum
bandwidth is required for the multiplexed channel ? Assume that the guard bands are Hz wide.
A. B.
C. D. None of the above
ugcnetjune2014iii computer-networks

Answer key ☟

5.0.10 UGC NET CSE | June 2013 | Part 2 | Question: 17

In classful addressing, the IP address 190.255.254.254 belongs to

A. Class A B. Class B C. Class C D. Class D

ugcnetcse-june2013-paper2 computer-networks easy

Answer key ☟

5.0.11 UGC NET CSE | July 2016 | Part 3 | Question: 27

A Pure ALOHA Network transmits 200 bit frames using a shared channel with 200 kbps bandwidth . If the
system (all stations put together) produces 500 frames per sec , then the throughput of the system is

A. 0.384 B. 0.184 C. 0.286 D. 0.586

ugcnetcse-july2016-paper3 computer-networks pure-aloha

Answer key ☟

5.0.12 UGC NET CSE | September 2013 | Part 2 | Question: 5

The ____ is a set of standards that defines how a dynamic web document should be written, how input data
should be supplied to the program, and how the output result should be used.

A. Hyper Text Markup Language B. File Transfer Protocol

C. Hyper Text Transfer Protocol D. Common Gateway Interface
ugcnetsep2013ii computer-networks

Answer key ☟

5.0.13 UGC NET CSE | December 2013 | Part 3 | Question: 47

The start and stop bits are used in serial communication for
A. error detection B. error correction
 C. synchronization D. slowing down the communication
ugcnetcse-dec2013-paper3 computer-networks serial-communication

Answer key ☟

5.0.14 UGC NET CSE | Junet 2015 | Part 3 | Question: 66

In a binary Hamming Code the number of check digits is r then number of message digits is equal to

A. B. C. D.
ugcnetcse-june2015-paper3 computer-networks hamming-code

Answer key ☟

5.0.15 UGC NET CSE | December 2015 | Part 2 | Question: 22

Which of the following fields in IPv 4 datagram is not related to fragmentation?

A. Type of service B. Fragment offset

C. Flags D. Indentification
ugcnetcse-dec2015-paper2 computer-networks

Answer key ☟

5.0.16 UGC NET CSE | December 2015 | Part 2 | Question: 23

Four channels are multiplexed using TDM. If each channel sends 100 bytes/second and we multiplex 1 byte per
channel, then the bit rate for the link is

A. 400 bps B. 800 bps C. 1600 bps D. 3200 bps

ugcnetcse-dec2015-paper2 computer-networks

Answer key ☟

5.0.17 UGC NET CSE | December 2015 | Part 3 | Question: 15

A network device is sending out the data at the rate of bps. How long does it take to send a file of
characters?

A. B. C. D.
ugcnetcse-dec2015-paper3 computer-networks

Answer key ☟

5.0.18 UGC NET CSE | December 2015 | Part 3 | Question: 68

Which of the following steps is/are not required for analog to digital conversion?

i. Sensing
ii. Conversion
iii. Amplification
iv. Conditioning
v. Quantization
A. a and b B. c and d C. a, b and e D. None of the above
ugcnetcse-dec2015-paper3 computer-networks

Answer key ☟

5.0.19 UGC NET CSE | July 2016 | Part 2 | Question: 26

A multiplexer combines four 100-Kbps channels using a time slot of 2 bits. What is the bit rate?

A. 100 Kbps B. 200 Kbps C. 400 Kbps D. 1000 Kbps

 ugcnetcse-july2016-paper2 computer-networks

Answer key ☟

5.0.20 UGC NET CSE | July 2016 | Part 3 | Question: 26

Given the following statements:

i. Frequency Division Multiplexing is a technique that can be applied when a bandwidth of a link is greater than
combined bandwidth of signals to be transmitted
ii. Wavelength Division Multiplexing (WDM) is an analogue multiplexing technique to combine optical signals
iii. WDM is a digital multiplexing technique
iv. TDM is a digital multiplexing technique

Which of the following is correct?

A. and are true B. and are false

C. and are false; is true D. and are true; is false
ugcnetcse-july2016-paper3 computer-networks

Answer key ☟

5.0.21 UGC NET CSE | July 2016 | Part 3 | Question: 28

Match the following :

A. B.
C. D.
ugcnetcse-july2016-paper3 computer-networks

Answer key ☟

5.0.22 UGC NET CSE | December 2011 | Part 2 | Question: 39

All of the following are examples of real security and privacy risks except

A. Hackers B. Spam C. Viruses D. Identity theft

computer-networks

Answer key ☟

5.0.23 UGC NET CSE | December 2011 | Part 2 | Question: 40

Identify the incorrect statement :

A. The ATM adoption layer is not service dependent.

B. Logical connections in ATM are referred to as virtual channel connections.
C. ATM is streamlined protocol with minimal error and flow control capabilities.
D. ATM is also known as cell delays.

computer-networks

Answer key ☟
5.0.24 UGC NET CSE | December 2011 | Part 2 | Question: 42

The number of bits required for an address is

A. B. C. D.
computer-networks

Answer key ☟

5.0.25 UGC NET CSE | December 2010 | Part 2 | Question: 10

Encoding of data bits into -bit even Parity Hamming Code is

A. B. C. D.
ugcnetcse-dec2010-paper2 computer-networks hamming-code

Answer key ☟

5.0.26 UGC NET CSE | June 2010 | Part 2 | Question: 27

What does the URL need to access documents ?

I. Path name
II. Host name
III. DNS
IV. Retrieval method
V. Server port number

A. B. C. D.
ugcnetcse-june2010-paper2 computer-networks

Answer key ☟

5.0.27 UGC NET CSE | June 2010 | Part 2 | Question: 46

The cost of the network is usually determined by

A. Time complexity B. Switching complexity

C. circuit complexity D. none of these
ugcnetcse-june2010-paper2 computer-networks

Answer key ☟

5.0.28 UGC NET CSE | January 2017 | Part 3 | Question: 64

Let C be a binary linear code with minimum distance then it can correct upto ___ bits of error

A. B. C. D.
ugcnetcse-jan2017-paper3 computer-networks hamming-code

Answer key ☟

5.0.29 UGC NET CSE | December 2016 | Part 3 | Question: 73

Which of the following neural networks uses supervised learning?

i. Multilayer perceptron
ii. Self organizing feature map
iii. Hopfield network

A. only B. only C. and only D. and only

computer-networks
 Answer key ☟

5.0.30 UGC NET CSE | December 2009 | Part 2 | Question: 30

Match the following :

A. B.
C. D.
ugcnetcse-dec2009-paper2 computer-networks

Answer key ☟

5.0.31 UGC NET CSE | June 2009 | Part 2 | Question: 06

The throughput of pure is given by :

A. B.
C. D.
ugcnetcse-june2009-paper2 computer-networks

5.0.32 UGC NET CSE | June 2009 | Part 2 | Question: 07

The Fiber Distributed Data Interface uses :

A. single mode fibers and

B. multimode fibers and
C. single mode fibers and
D. multimode fibers and

ugcnetcse-june2009-paper2

Answer key ☟

5.0.33 UGC NET CSE | June 2009 | Part 2 | Question: 08

To employ multi-access in , users are given different :

1. time slots
2. bandpass filters
3. handsets
4. frequency bands

ugcnetcse-june2009-paper2

Answer key ☟

5.0.34 UGC NET CSE | June 2009 | Part 2 | Question: 29

protocol consists of :

A. Physical and Frame levels

B. Frame and Packet levels
C. Physical, Frame and Packet levels
D. None of the above

ugcnetcse-june2009-paper2
 Answer key ☟

5.0.35 UGC NET CSE | June 2009 | Part 2 | Question: 30

GSM/CDMA systems :

A. are limited to very low speed data

B. require no local loop wires
C. are predominantly used for voice
D. all of the above

ugcnetcse-june2009-paper2

Answer key ☟

5.0.36 UGC NET CSE | June 2009 | Part 2 | Question: 31

Usually information security in a network is achieved by :

A. Layering
B. Cryptography
C. Grade of service
D. None of the above

ugcnetcse-june2009-paper2

5.0.37 UGC NET CSE | June 2009 | Part 2 | Question: 41

Which one of the following ISO standard is used for software process ?
A. B.
C. D.
ugcnetcse-june2009-paper2

Answer key ☟

5.0.38 UGC NET CSE | June 2009 | Part 2 | Question: 45

When compared with analog cellular systems, an advantage of digital cellular system is that :

A. it is less complicated
B. it requires less of computer memory
C. it conserves spectrum bandwidth
D. it costs less

ugcnetcse-june2009-paper2

Answer key ☟

5.0.39 UGC NET CSE | June 2009 | Part 2 | Question: 46

E-commerce includes :
A. B.
C. D. All of the above
ugcnetcse-june2009-paper2

Answer key ☟

5.0.40 UGC NET CSE | June 2009 | Part 2 | Question: 47

A clustering technique that permits a convenient graphical display is :

A. partition based clustering

 B. probabilistic model based clustering
C. hierarchical clustering
D. agglomerative clustering

ugcnetcse-june2009-paper2

Answer key ☟

5.0.41 UGC NET CSE | November 2017 | Part 3 | Question: 28

Match the following :

A.
B.
C.
D.

ugcnetcse-nov2017-paper3 computer-networks

Answer key ☟

5.0.42 UGC NET 2013

In the _______method , after the station finds the line idle , it sends or refrains from sending based on
probability

a)None-Persistent

b)One -Persistent

c) P-Persistent

d)Non-Persistent

Answer key ☟

5.0.43 UGC NET CSE | July 2018 | Part 2 | Question: 44

Which of the following statements are true?

i. Advanced Mobile Phone System is a second generation cellular phone system

ii. IS. is a second generation cellular phone sysyem based on and
iii. The Third generation cellular phone system wil provide universal personnel communication

A. and only B. and only C. and D. and only

ugcnetcse-july2018-paper2 computer-networks

Answer key ☟

5.0.44 UGC NET CSE | December 2018 | Part 2 | Question: 89

Identify the correct sequence in which the following packets are transmitted on the network by a host when a
browser requests a webpage from a remote server, assuming that the host has just been restarted.
 A. HTTP GET request, DNS query, TCP SYN B. DNS query, HTTP GET request, TCP SYN
C. TCP SYN, DNS query, HTTP GET request D. DNS query, TCP SYN, HTTP GET request
ugcnetcse-dec2018-paper2 computer-networks

Answer key ☟

5.0.45 UGC NET CSE | December 2018 | Part 2 | Question: 86

A host is connected to a department network which is part of a university network. The university network, in
turn, is part of the Internet. The largest network, in which the Ethernet address of the host is unique, is

A. the Internet B. the university network

C. the department network D. the subnet to which the host belongs
ugcnetcse-dec2018-paper2 computer-networks

Answer key ☟

5.0.46 UGC NET CSE | December 2018 | Part 2 | Question: 63

Consider network architecture reference model. Session layer of this model offers dialog control,
token management and ______ as services.

A. Syncronization B. Asyncronization C. Flow control D. Errors

ugcnetcse-dec2018-paper2 computer-networks

Answer key ☟

5.0.47 UGC NET CSE | December 2004 | Part 2 | Question: 30

Virtual circuit is associated with a __________ service.

A. Connectionless B. Error-free
C. Segmentation D. Connection-oriented
ugcnetcse-dec2004-paper2

Answer key ☟

5.0.48 UGC NET CSE | December 2004 | Part 2 | Question: 29

Which transport class should be used with residual-error network layer ?

A. B.
C. D.
ugcnetcse-dec2004-paper2

Answer key ☟

5.0.49 UGC NET CSE | December 2004 | Part 2 | Question: 28

Which transport class should be used with a perfect network layer ?

A. and B. and
C. D.
ugcnetcse-dec2004-paper2

Answer key ☟

5.0.50 UGC NET CSE | December 2004 | Part 2 | Question: 27

Making sure that all the data packets of a message are delivered to the destination is _________ control.

A. Error B. Loss C. Sequence D. Duplication

ugcnetcse-dec2004-paper2

Answer key ☟
5.0.51 UGC NET CSE | December 2004 | Part 2 | Question: 26

Error control is needed at the transport layer because of potential error occurring __________.
A. from transmission line noise B. in router
C. from out of sequency delivery D. from packet losses
ugcnetcse-dec2004-paper2

Answer key ☟

5.0.52 UGC NET CSE | December 2006 | Part 2 | Question: 27

A network is limited to :
A. bytes per data field B. stations per segment
C. segments D. feet of cable
ugcnetcse-dec2006-paper2

Answer key ☟

5.0.53 UGC NET CSE | December 2006 | Part 2 | Question: 26

How many signals are transported on a signal ?

A. B. C. D.
ugcnetcse-dec2006-paper2

Answer key ☟

5.0.54 UGC NET CSE | December 2007 | Part 2 | Question: 29

For pure ALOHA, the maximum channel utilization is :

A. B. C. D.
ugcnetcse-dec2007-paper2

Answer key ☟

5.0.55 UGC NET CSE | December 2007 | Part 2 | Question: 28

The maximum data rate of binary signals on a noiseless channel is :

A. bps. B. bps. C. bps. D. bps.

ugcnetcse-dec2007-paper2

Answer key ☟

5.0.56 UGC NET CSE | December 2007 | Part 2 | Question: 27

In a broadcast network, a layer that is often thin or non-existent is :

A. network layer B. transport layer

C. presentation layer D. application layer
ugcnetcse-dec2007-paper2

Answer key ☟

5.0.57 UGC NET CSE | December 2007 | Part 2 | Question: 26

The best known example of a MAN is :

A. Ethernet B. Cable Television C. FDDI D. IEEE

ugcnetcse-dec2007-paper2
 Answer key ☟

5.0.58 UGC NET CSE | December 2007 | Part 2 | Question: 4

Let e : B^m → B^n is a group code. The minimum distance of ‘e’ is equal to :

A. the maximum weight of a non zero code word B. the minimum weight of a non zero code word
C. m D. n
ugcnetcse-dec2007-paper2

Answer key ☟

5.0.59 UGC NET CSE | October 2020 | Part 2 | Question: 88

Given below are two statements:

Statement : The laws of nature put two fundamental limits on data rate of a channel. The H.Nyquist limit restricts the
number of independent samples per second to twice the band-width in a Noiseless channel
Statement : Shannon’s major result about noised channel is that maximum data rate of a channel whose band width is
Hz, and whose signal-to-noise ratio is is given by: Maximum number of bits/sec
In the light of the above statements, choose the correct answer from the options given below

A. Both Statement and Statement are true

B. Both Statement and Statement are false
C. Statement is correct but Statement is false
D. Statement is incorrect but Statement is true

ugcnetcse-oct2020-paper2 computer-networks

Answer key ☟

5.0.60 UGC NET CSE | October 2020 | Part 2 | Question: 31

Consider a code with only four valid code words: , , , and . This
code has distance . If the code word arrived is then the original code word must be _______

A. B. C. D.
ugcnetcse-oct2020-paper2 computer-networks hamming-code

Answer key ☟

5.0.61 UGC NET CSE | June 2023 | Part 1: 9

Identify the correct order of the terms A-E to complete the paragraph about MAC addresses and IP addresses
given below.
A MAC address is a media access_______ address. A network device has a ____________ MAC address that can help
________ the device in the network. An IP address is an Internet __________ address. An IP address can be static or
________.

i. Protocol
ii. Control
iii. Dynamic
iv. Identify
v. E. unique

Choose the correct answer from the options given below:

A. B.
C. D.
 ugcnetcse-june2023-paper1 computer-networks

Answer key ☟

5.1 Analog & Digital Transmission (1)

5.1.1 Analog & Digital Transmission: UGC NET CSE | Junet 2015 | Part 3 | Question: 15

The process of dividing an analog signal into a string of discrete outputs, each of constant amplitude, is called:

A. Strobing B. Amplification C. Conditioning D. Quantization

ugcnetcse-june2015-paper3 analog-&-digital-transmission computer-networks

Answer key ☟

5.2 Analog Signals (1)

5.2.1 Analog Signals: UGC NET CSE | December 2014 | Part 2 | Question: 26

The period of a signal is ms. What is its frequency in Hertz ?

A. B. C. D.
ugcnetcse-dec2014-paper2 computer-networks analog-signals

Answer key ☟

5.3 Application Layer (1)

5.3.1 Application Layer: UGC NET CSE | January 2017 | Part 2 | Question: 27

The maximum size of the data that the application layer can pass on to the layer below is ________.

A. bytes B. bytes + header length

C. bytes – header length D. bytes
ugcnetjan2017ii computer-networks application-layer

Answer key ☟

5.4 Asymmetric Key Cryptography (1)

5.4.1 Asymmetric Key Cryptography: UGC NET CSE | December 2014 | Part 3 | Question: 30

Which one of the following is true for asymmetric-key cryptography ?

A. Private key is kept by the receiver and public key is announced to the public.
B. Public key is kept by the receiver and private key is announced to the public.
C. Both private key and public key are kept by the receiver.
D. Both private key and public key are announced to the public.

ugcnetcse-dec2014-paper3 computer-networks asymmetric-key-cryptography

Answer key ☟

5.5 Asymptotic Notation (1)

5.5.1 Asymptotic Notation: UGC NET CSE | June 2013 | Part 2 | Question: 35

Give as good a big-O estimate as possible for the following functions:

A. B.
C. D.
ugcnetcse-june2013-paper2 asymptotic-notation
 Answer key ☟

5.6 Binary Search Tree (1)

5.6.1 Binary Search Tree: UGC NET CSE | December 2010 | Part 2 | Question: 25

Which of the following can be the sequence of nodes examined in binary search tree while searching for key ?
A. B.
C. D.
ugcnetcse-dec2010-paper2 computer-networks binary-search-tree

Answer key ☟

5.7 Binary Symmetric Channel (1)

5.7.1 Binary Symmetric Channel: UGC NET CSE | June 2013 | Part 3 | Question: 53

Binary symmetric channel uses

A. Half duplex protocol B. Full duplex protocol
C. Bit oriented protocol D. None of the above
ugcnetcse-june2013-paper3 computer-networks binary-symmetric-channel

Answer key ☟

5.8 Bit Oriented Protocol (1)

5.8.1 Bit Oriented Protocol: UGC NET CSE | December 2014 | Part 3 | Question: 29

________ is a bit-oriented protocol for communication over point-to-point and multipoint links.

A. Stop-and-wait B. HDLC C. Sliding window D. Go-back-N

ugcnetcse-dec2014-paper3 computer-networks bit-oriented-protocol

Answer key ☟

5.9 Bit Rate (1)

5.9.1 Bit Rate: UGC NET CSE | December 2014 | Part 2 | Question: 29

An analog signal has a bit rate of bps and a baud rate of baud. How many data elements are carried by
each signal element
A. bits/baud B. bits/baud
C. bits/baud D. None of the above
ugcnetcse-dec2014-paper2 computer-networks bit-rate

Answer key ☟

5.10 Bridges (1)

5.10.1 Bridges: UGC NET CSE | December 2008 | Part 2 | Question: 36

A conventional bridge specifies only the functions of :

A. layers 1 and 2
B. layers 1 through 3
C. all layers
D. none of the above

ugcnetcse-dec2008-paper2 computer-networks osi-model bridges

Answer key ☟
5.11 CRC Polynomial (2)

5.11.1 CRC Polynomial: UGC NET CSE | December 2013 | Part 3 | Question: 33

The message 11001001 is to be transmitted using the CRC polynomial to protect it from errors. The
message that should be transmitted is

A. 110010011001 B. 11001001 C. 110010011001001 D. 11001001011

ugcnetcse-dec2013-paper3 computer-networks crc-polynomial

Answer key ☟

5.11.2 CRC Polynomial: UGC NET CSE | January 2017 | Part 3 | Question: 27

Let be generator polynomial used for CRC checking. The condition that should be satisfied by to
correct odd numbered error bits, will be:
A. is factor of B. is factor of
C. is factor of D. is factor of
ugcnetcse-jan2017-paper3 computer-networks crc-polynomial

Answer key ☟

5.12 Cache Memory (1)

5.12.1 Cache Memory: UGC NET CSE | December 2008 | Part 2 | Question: 9

Suppose it takes to access page table and to access associative memory. If the average access time
is , the corresponding hit rate is:

A. percent
B. percent
C. percent
D. percent

ugcnetcse-dec2008-paper2 computer-networks cache-memory

Answer key ☟

5.13 Checksum (1)

5.13.1 Checksum: UGC NET CSE | August 2016 | Part 3 | Question: 27

In CRC checksum method, assume that given frame for transmission is 1101011011 and the generator
polynomial is . After implementing encoder, the encoded word sent from sender side
is _____.
A. 11010110111110 B. 11101101011011
C. 110101111100111 D. 110101111001111
ugcnetcse-aug2016-paper3 computer-networks crc-polynomial checksum

Answer key ☟

5.14 Classful Addressing (2)

5.14.1 Classful Addressing: UGC NET CSE | December 2012 | Part 3 | Question: 15

In classful addressing, an IP address 123.23.56.4 belongs to _____ format.

A. A B. B C. C D. D
ugcnetcse-dec2012-paper3 computer-networks ip-addressing classful-addressing

Answer key ☟
 5.14.2 Classful Addressing: UGC NET CSE | December 2014 | Part 2 | Question: 27

In a classful addressing, first four bits in Class IP address is

A. B. C. D.
ugcnetcse-dec2014-paper2 computer-networks classful-addressing

Answer key ☟

5.15 Classless Addressing (1)

5.15.1 Classless Addressing: UGC NET CSE | Junet 2015 | Part 2 | Question: 30

Which of the following is/are restriction(s) in classless addressing?

A. The number of addresses needs to be a power of

B. The mask needs to be included in the address to define the block
C. The starting address must be divisible by the number of addresses in the block
D. All of the above

ugcnetcse-june2015-paper2 computer-networks classless-addressing

Answer key ☟

5.16 Communication (9)

5.16.1 Communication: UGC NET CSE | December 2013 | Part 3 | Question: 43

What is the bit rate for transmitting uncompressed 800 600 pixel colour frames with 8 bits/pixel at 40
frames/second?
A. 2.4 Mbps B. 15.36 Mbps
C. 153.6 Mbps D. 1536 Mbps
ugcnetcse-dec2013-paper3 computer-networks communication

Answer key ☟

5.16.2 Communication: UGC NET CSE | December 2013 | Part 3 | Question: 46

A client-server system uses a satellite network, with the satellite at a height of 40,000 kms. What is the best-case
delay in response to a request? (Note that the speed of light in air is 3,00,000 km/second)
A. 133.33 m sec B. 266.67 m sec
C. 400.00 m sec D. 533.33 m sec
ugcnetcse-dec2013-paper3 communication computer-networks

Answer key ☟

5.16.3 Communication: UGC NET CSE | December 2013 | Part 3 | Question: 48

____ is a type of transmission impairment in which the signal looses strength due to the resistance of the
transmission medium

A. Attenuation B. Distortion C. Noise D. Decibel

ugcnetcse-dec2013-paper3 computer-networks communication non-gatecse

Answer key ☟

5.16.4 Communication: UGC NET CSE | June 2012 | Part 2 | Question: 19

The station to hub distance in which it is 2000 meters

A. 100 Base-T B. 100 Base-F C. 100 Base-T D. 100 Base-T

ugcnetcse-june2012-paper2 computer-networks communication
 Answer key ☟

5.16.5 Communication: UGC NET CSE | June 2012 | Part 2 | Question: 39

For the transmission of the signal. Bluetooth wireless technology uses

A. time division multiplexing B. frequency division multiplexing
C. time division duplex D. frequency division duplex
computer-networks communication ugcnetcse-june2012-paper2

Answer key ☟

5.16.6 Communication: UGC NET CSE | June 2012 | Part 2 | Question: 45

_____ is a satellite based tracking system that enables the determination of person’s position
A. Bluetooth B. WAP
C. Short Message Service D. Global Positioning System
computer-networks communication ugcnetcse-june2012-paper2

Answer key ☟

5.16.7 Communication: UGC NET CSE | June 2012 | Part 3 | Question: 64

Match the following with link quality measurement and handoff initiation :

A. B.
C. D.
computer-networks communication ugcnetcse-june2012-paper3

Answer key ☟

5.16.8 Communication: UGC NET CSE | June 2014 | Part 2 | Question: 01

Infrared signals can be used for short range communication in a closed area using _______ propagation.

A. Ground B. Sky C. Line of sight D. Space

ugcnetcse-june2014-paper2 communication non-gatecse

Answer key ☟

5.16.9 Communication: UGC NET CSE | June 2014 | Part 3 | Question: 06

In a digital transmission, the receiver clock is percent faster than the sender clock. How many extra bits per
second does the receiver receive if the data rate is Mbps ?

A. bps B. bps C. bps D. bps

ugcnetjune2014iii computer-networks communication

Answer key ☟

5.17 Computer Neworks (1)

 5.17.1 Computer Neworks: UGC NET CSE | October 2020 | Part 2 | Question: 60

Firewall is a device that filters access to the protected network from the outside network. Firewalls can filter the
packets on the basis of

i. Source IP address
ii. Destination IP address
iii. TCP Source Port
iv. UDP Source Port
v. TCP Destination Port

Choose the correct answer from the options given below:

A. and only B. and only

C. and only D. and only
ugcnetcse-oct2020-paper2 computer-neworks network-security

Answer key ☟

5.18 Cryptography (7)

5.18.1 Cryptography: UGC NET CSE | August 2016 | Part 3 | Question: 30

The plain text message encrypted with algorithm using and and the characters
of the message are encoded using the values to for letters A to Z. Suppose character by character
encryption was implemented. Then, the Cipher Text message is _____.

A. ABHI B. HAQC C. IHBA D. BHQC

ugcnetcse-aug2016-paper3 cryptography computer-networks

Answer key ☟

5.18.2 Cryptography: UGC NET CSE | December 2013 | Part 3 | Question: 32

Find the false statement:

A. In Modern Cryptography, symmetric key algorithms use same key both for Encryption and Decryption.
B. The symmetric cipher DES (Data Encryption Standard) was widely used in the industry for security product.
C. The AES (Advanced Encryption Standard) cryptosystem allows variable key lengths of size 56 bits and 124 bits.
D. Public key algorithms use two different keys for Encryption and Decryption

ugcnetcse-dec2013-paper3 computer-networks cryptography

Answer key ☟

5.18.3 Cryptography: UGC NET CSE | December 2014 | Part 2 | Question: 30

How many distinct stages are there in algorithm, which is parameterized by a -bit key ?

A. B. C. D.
ugcnetcse-dec2014-paper2 computer-networks cryptography

Answer key ☟

5.18.4 Cryptography: UGC NET CSE | July 2018 | Part 2 | Question: 45

Match the following symmetric block ciphers with corresponding block and key sizes:
 A. B.
C. D.
ugcnetcse-july2018-paper2 cryptography computer-networks

Answer key ☟

5.18.5 Cryptography: UGC NET CSE | June 2014 | Part 3 | Question: 56

Match the following cryptographic algorithms with their design issues :

A. B.
C. D.
ugcnetjune2014iii computer-networks network-security cryptography

Answer key ☟

5.18.6 Cryptography: UGC NET CSE | October 2020 | Part 2 | Question: 32

Using ‘RSA’ public key cryptosystem, if , and , find the value of and encrypt the number

A. B. C. D.
ugcnetcse-oct2020-paper2 computer-networks network-security cryptography

Answer key ☟

5.18.7 Cryptography: UGC NET CSE | October 2020 | Part 2 | Question: 54

Which among the following statement(s) is(are) true?

i. A hash function takes a message of arbitrary length and generates a fixed length code
ii. A hash function takes a message of fixed length and generates a code of variable length
iii. A hash function may give same hash value for distinct messages

Choose the correct answer from the options given below:

A. only B. and only C. and only D. only

ugcnetcse-oct2020-paper2 computer-networks network-security cryptography

Answer key ☟

5.19 Data Communication (7)

5.19.1 Data Communication: UGC NET CSE | December 2009 | Part 2 | Question: 26

Device on one network can communicate with devices on another network via a

(A) Hub/Switch

(B) Utility server

 (C) File server

(D) Gateway
ugcnetcse-dec2009-paper2 computer-networks data-communication

Answer key ☟

5.19.2 Data Communication: UGC NET CSE | December 2011 | Part 2 | Question: 35

The cellular frequency reuse factor for the cluster size is

A. B. C. D.
ugcnetcse-dec2011-paper2 computer-networks data-communication

Answer key ☟

5.19.3 Data Communication: UGC NET CSE | December 2011 | Part 2 | Question: 37

Handoff is the mechanism that

A. Transfer an ongoing call from one base station to another B. Initiating a new call
C. Dropping an ongoing call D. None of above
ugcnetcse-dec2011-paper2 computer-networks data-communication

Answer key ☟

5.19.4 Data Communication: UGC NET CSE | December 2011 | Part 2 | Question: 48

A telephone conference call is an example of which type of communications ?

A. Same time / same place B. Same time / different place

C. Different time / different place D. Different time / same place
ugcnetcse-dec2011-paper2 computer-networks data-communication

Answer key ☟

5.19.5 Data Communication: UGC NET CSE | June 2010 | Part 2 | Question: 47

A leased special high-speed connection from the local telephone carrier for business users that transmits at
mbps is known as ________ carrier.

A. B. C. D.
ugcnetcse-june2010-paper2 computer-networks data-communication

Answer key ☟

5.19.6 Data Communication: UGC NET CSE | June 2010 | Part 2 | Question: 48

Cell uses ________ carriers of MHz.

A. B. C. D.
ugcnetcse-june2010-paper2 computer-networks data-communication

5.19.7 Data Communication: UGC NET CSE | Junet 2015 | Part 3 | Question: 29

Suppose a digitazed voice channel is made by digitizing 8 kHz bandwidth analog voice signal. It is required to
sample the signal at twice the highest frequency (two samples per hertz). What is the bit rate required, if it is
assumed that each sample required 8 bits?

A. 32 kbps B. 64 kbps C. 128 kbps D. 256 kbps

ugcnetcse-june2015-paper3 computer-networks data-communication
 Answer key ☟

5.20 Data Link Layer (7)

5.20.1 Data Link Layer: UGC NET CSE | December 2008 | Part 2 | Question: 16

The throughput of slotted is given by:

A. B.
C. D.
ugcnetcse-dec2008-paper2 computer-networks data-link-layer

Answer key ☟

5.20.2 Data Link Layer: UGC NET CSE | December 2009 | Part 2 | Question: 28

Which of the following are Data Link Layer standard ?

1. Ethernet

2. HSSI

3. Frame Relay

4. 10 – Base T

5. Token Ring

(A) 1, 2, 3

(B) 1, 3, 5

(C) 1, 3, 4, 5

(D) 1, 2, 3, 4, 5
ugcnetcse-dec2009-paper2 computer-networks data-link-layer

Answer key ☟

5.20.3 Data Link Layer: UGC NET CSE | July 2016 | Part 3 | Question: 29

Assume that we need to download text documents at the rate of 100 pages per minute. A page is in average of
24 lines with 80 characters in each line requires 8 bits. Then the required bit rate of the channel is

A. 1.636 Kbps B. 1.636 Mbps C. 3.272 Mbps D. 3.272 Kbps

ugcnetcse-july2016-paper3 computer-networks data-link-layer

Answer key ☟

5.20.4 Data Link Layer: UGC NET CSE | November 2017 | Part 3 | Question: 25

Suppose we want to download text documents at the rate of pages per second. Assume that a page consists
of an average of lines with characters in each line. What is the required bit rate of the channel?

A. kbps B. kbps C. Mbps D. Mbps

ugcnetcse-nov2017-paper3 computer-networks data-link-layer

Answer key ☟

5.20.5 Data Link Layer: UGC NET CSE | November 2017 | Part 3 | Question: 27

If a file consisting of characters takes seconds to send, then the data rate is _________

A. kbps B. kbps C. kbps D. kbps

 ugcnetcse-nov2017-paper3 computer-networks data-link-layer

Answer key ☟

5.20.6 Data Link Layer: UGC NET CSE | September 2013 | Part 2 | Question: 2

In ______ CSMA protocol, after the station finds the line idle, it sends or refrains from sending based on the
outcome of a random number generated.

A. Non-persistent B. 0- persistent C. 1- persistent D. p- persistent

ugcnetsep2013ii computer-networks data-link-layer

Answer key ☟

5.20.7 Data Link Layer: UGC NET CSE | September 2013 | Part 3 | Question: 7

Suppose a file of 10,000 characters is to be sent over a line at 2400 bps. Assume that the data is sent in frames.
Each frame consists of 1000 characters and an overhead of 48 bits per frame. Using synchronous transmission,
the total overhead time is

A. 0.05 second B. 0.1 second C. 0.2 second D. 2.0 seconds

ugcnetcse-sep2013-paper3 computer-networks data-link-layer

Answer key ☟

5.21 Data Mining Algorithm (1)

5.21.1 Data Mining Algorithm: UGC NET CSE | December 2008 | Part 2 | Question: 49

An example of a data mining algorithm which uses squared error score function is :

A. CART algorithm
B. back propagation algorithm
C. a priori algorithm
D. vector space algorithm

ugcnetcse-dec2008-paper2 neural-network data-mining-algorithm

Answer key ☟

5.22 Data Transmission (1)

5.22.1 Data Transmission: UGC NET CSE | December 2014 | Part 3 | Question: 26

How many characters per second ( bits + parity) can be transmitted over a bps line if the transfer is
asynchronous ? (Assuming start bit and stop bit)

A. B. C. D.
ugcnetcse-dec2014-paper3 computer-networks data-transmission asynchronous-transmission

Answer key ☟

5.23 Distance Vector Routing (2)

5.23.1 Distance Vector Routing: UGC NET CSE | December 2007 | Part 2 | Question: 30

An example of an adaptive routing algorithm is :

A. distance vector routing B. flooding

C. selective flooding D. shortest path routing
ugcnetcse-dec2007-paper2 algorithms distance-vector-routing

Answer key ☟
 5.23.2 Distance Vector Routing: UGC NET CSE | January 2017 | Part 2 | Question: 29

Distance vector routing algorithm is a dynamic routing algorithm. The routing tables in distance vector routing
algorithm are updated __________.

A. automatically B. by server
C. by exchanging information with neighbour nodes D. with back up database
ugcnetjan2017ii computer-networks distance-vector-routing

Answer key ☟

5.24 Edi Layer (1)

5.24.1 Edi Layer: UGC NET CSE | December 2008 | Part 2 | Question: 48

E-commerce involves :

A. Electronic Data Interchange

B. Electronic mail
C. Electronic Bulletin Boards
D. All of the above

ugcnetcse-dec2008-paper2 e-commerce e-technologies edi-layer

5.25 Electronic Payment Systems (1)

5.25.1 Electronic Payment Systems: UGC NET CSE | December 2015 | Part 2 | Question: 50

____ uses electronic means to transfer funds directly from one account to another rather than by cheque or cash

A. M-Banking B. E-Banking C. O-Banking D. C-Banking

ugcnetcse-dec2015-paper2 e-technologies electronic-payment-systems mobile-computing computer-networks non-gatecse

Answer key ☟

5.26 Encoding (2)

5.26.1 Encoding: UGC NET CSE | December 2012 | Part 3 | Question: 68

An example of a dictionary-based coding technique is

A. Run-length coding B. Huffman coding

C. Predictive coding D. LZW coding
ugcnetcse-dec2012-paper3 computer-networks network-security encoding

Answer key ☟

5.26.2 Encoding: UGC NET CSE | June 2013 | Part 3 | Question: 55

Given code word is to be transmitted with even parity check bit. The encoded word to be
transmitted for this code is

A. B. C. D.
computer-networks ugcnetcse-june2013-paper3 encoding

Answer key ☟

5.27 Encryption Decryption (2)

5.27.1 Encryption Decryption: UGC NET CSE | July 2018 | Part 2 | Question: 50

Encrypt the Message "HELLO MY DEARZ" using Transposition Cipher with

 A. HLLEO YM AEDRZ B. EHOLL ZYM RAED
C. ELHL MDOY AZER D. ELHL DOMY ZAER
ugcnetcse-july2018-paper2 cryptography encryption-decryption computer-networks

Answer key ☟

5.27.2 Encryption Decryption: UGC NET CSE | June 2019 | Part 2 | Question: 86

In the TCP/IP model, encryption and decryption are functions of ____ layer.

A. data link B. network C. transport D. application

ugcnetcse-june2019-paper2 encryption-decryption

Answer key ☟

5.28 Entropy (1)

5.28.1 Entropy: UGC NET CSE | December 2011 | Part 2 | Question: 9

The amount of uncertainty in a system of symbol is called

A. Bandwidth B. Entropy C. Loss D. Quantum

ugcnetcse-dec2011-paper2 computer-networks entropy

Answer key ☟

5.29 Error Correction (5)

5.29.1 Error Correction: UGC NET CSE | December 2009 | Part 2 | Question: 03

If in an error detection and correction code a message M : “You are good students” is stored as M' : Youare
areyou aregood goodare goodstudents studentsgood. What is the space required to store M' in general ? (assume
that ‘n’ is the length of M)

A. 2n B. 3n C. 4n D. less than 4n
ugcnetcse-dec2009-paper2 computer-networks error-correction

Answer key ☟

5.29.2 Error Correction: UGC NET CSE | December 2011 | Part 2 | Question: 12

Start and stop bits are used in serial communications for

A. Error detection B. Error correction

C. Synchronization D. Slowing down the communication
ugcnetcse-dec2011-paper2 computer-networks error-correction

Answer key ☟

5.29.3 Error Correction: UGC NET CSE | July 2018 | Part 2 | Question: 49

To guarantee correction of upto errors, the minimum Hamming distance in a block code must be ______

A. B. C. D.
ugcnetcse-july2018-paper2 computer-networks error-correction error-detection

Answer key ☟

5.29.4 Error Correction: UGC NET CSE | June 2009 | Part 2 | Question: 02

In order that a code is error correcting, the minimum Hamming distance should be :
 1.
2.
3.
4.

ugcnetcse-june2009-paper2 error-correction

Answer key ☟

5.29.5 Error Correction: UGC NET CSE | September 2013 | Part 3 | Question: 56

If the data unit is 111111 and the divisor is 1010. In CRC method, what is the dividend at the transmission
before division?

A. 1111110000 B. 1111111010 C. 111111000 D. 111111

ugcnetcse-sep2013-paper3 computer-networks error-correction crc-polynomial

Answer key ☟

5.30 Error Detection Correction (1)

5.30.1 Error Detection Correction: UGC NET CSE | June 2014 | Part 3 | Question: 57

Consider a code with five valid code words of length ten :

Hamming distance of the code is

A. B. C. D.
ugcnetjune2014iii computer-networks error-detection-correction hamming-distance

Answer key ☟

5.31 Ethernet (5)

5.31.1 Ethernet: UGC NET CSE | June 2013 | Part 3 | Question: 17

The baud rate of a signal is 600 baud/second. If each signal unit carries 6 bits, then the bit rate of a signal is
____

A. 3600 B. 100 C. 6/600 D. None of the above

ugcnetcse-june2013-paper3 computer-networks ethernet

Answer key ☟

5.31.2 Ethernet: UGC NET CSE | June 2013 | Part 3 | Question: 22

What is the baud rate of standard 10 Mbps Ethernet?

A. 10 megabaud B. 20 megabaud C. 30 megabaud D. 40 megabaud

ugcnetcse-june2013-paper3 computer-networks ethernet

Answer key ☟

5.31.3 Ethernet: UGC NET CSE | June 2014 | Part 2 | Question: 03

The minimum frame length for Mbps Ethernet is ________ bytes and maximum is _______ bytes.

A. & B. &
C. & D. &
ugcnetcse-june2014-paper2 computer-networks ethernet

Answer key ☟
 5.31.4 Ethernet: UGC NET CSE | September 2013 | Part 2 | Question: 1

A file is downloaded in a home computer using 56 kbps MODEM connected to an Internet Service Provider. If
the download of the file completes in 2 minutes, what is the maximum size of the data downloaded?

A. 112 Mbits B. 6.72 Mbits C. 67.20 Mbits D. 672 Mbits

ugcnetsep2013ii computer-networks ethernet

Answer key ☟

5.31.5 Ethernet: UGC NET CSE | September 2013 | Part 2 | Question: 4

What is the maximum length of CAT-5 UTP cable in Fast Ethernet network?

A. 100 meters B. 200 meters C. 1000 meters D. 2000 meters

ugcnetsep2013ii computer-networks ethernet

Answer key ☟

5.32 Firewall (1)

5.32.1 Firewall: UGC NET CSE | September 2013 | Part 3 | Question: 58

A _____ can forward or block packets based on the information in the network layer and transport layer header
A. Proxy firewall B. Firewall
C. Packet filter firewall D. Message digest firewall
ugcnetcse-sep2013-paper3 computer-networks firewall

Answer key ☟

5.33 Hamming Distance (1)

5.33.1 Hamming Distance: UGC NET CSE | June 2013 | Part 3 | Question: 54

Hamming distance between 100101000110 and 110111101101 is

A. 3 B. 4 C. 5 D. 6
ugcnetcse-june2013-paper3 computer-networks hamming-distance

Answer key ☟

5.34 Huffman Code (1)

5.34.1 Huffman Code: UGC NET CSE | June 2013 | Part 3 | Question: 14

A data file of characters contains only the characters with the frequencies as indicated in table:

using the variable-length code by Huffman codes, the file can be encoded with
A. bits B. bits
C. bits D. bits
ugcnetcse-june2013-paper3 computer-networks huffman-code data-link-layer

Answer key ☟

5.35 IP Addressing (13)

5.35.1 IP Addressing: UGC NET CSE | December 2006 | Part 2 | Question: 28

The network is a :

A. Class A Network B. Class B Network

C. Class C Network D. Class D Network
ugcnetcse-dec2006-paper2 computer-networks ip-addressing

Answer key ☟

5.35.2 IP Addressing: UGC NET CSE | December 2006 | Part 2 | Question: 29

The subnet mask

A. Extends the network portion to 16 bits

B. Extends the network portion to 26 bits
C. Extends the network portion to 36 bits
D. Has no effect on the network portion of an IP address

ugcnetcse-dec2006-paper2 computer-networks ip-addressing subnetting

Answer key ☟

5.35.3 IP Addressing: UGC NET CSE | December 2008 | Part 2 | Question: 20

IP address in B class is given by:

A. 125.123.123.2 B. 191.023.21.54
C. 192.128.32.56 D. 10.14.12.34
ugcnetcse-dec2008-paper2 computer-networks ip-addressing

Answer key ☟

5.35.4 IP Addressing: UGC NET CSE | December 2013 | Part 3 | Question: 44

In IPV 4, the IP address 200.200.200.200 belongs to

A. Class A B. Class B C. Class C D. Class D

ugcnetcse-dec2013-paper3 computer-networks ip-addressing

Answer key ☟

5.35.5 IP Addressing: UGC NET CSE | July 2018 | Part 2 | Question: 43

The dotted-decimal notation of the following IPV4 address in binary notation is ____
10000001 00001011 00001011 11101111
A. 111.56.45.239 B. 129.11.10.238
C. 129.11.11.239 D. 111.56.11.239
ugcnetcse-july2018-paper2 computer-networks ip-addressing

Answer key ☟

5.35.6 IP Addressing: UGC NET CSE | June 2005 | Part 2 | Question: 30

What is the correct subnet mask to use for a class- address to support Networks and also have the most
hosts possible ?

A. B.
C. D.
ugcnetcse-june2005-paper2 computer-networks ip-addressing subnetting

Answer key ☟
5.35.7 IP Addressing: UGC NET CSE | June 2012 | Part 3 | Question: 29

Which of the following IP address class is a multicast address?

A. Class A B. Class B C. Class C D. Class D

ugcnetcse-june2012-paper3 computer-networks ip-addressing

Answer key ☟

5.35.8 IP Addressing: UGC NET CSE | June 2014 | Part 3 | Question: 71

A network on the Internet has a subnet mask of . What is the maximum number of hosts it can
handle ?

A. B. C. D.
ugcnetjune2014iii computer-networks ip-addressing

Answer key ☟

5.35.9 IP Addressing: UGC NET CSE | June 2019 | Part 2 | Question: 88

What percentage of the IPv4, IP address space do all class C addresses consume?

A. B. C. D.
ugcnetcse-june2019-paper2 ip-addressing

Answer key ☟

5.35.10 IP Addressing: UGC NET CSE | Junet 2015 | Part 2 | Question: 29

What is the size of the 'total length' field in diagram?

A. bits B. bits C. bits D. bits

ugcnetcse-june2015-paper2 computer-networks ip-addressing

Answer key ☟

5.35.11 IP Addressing: UGC NET CSE | November 2017 | Part 3 | Question: 29

The address of a class host is to be split into subnets with a – bit subnet number. What is the maximum
number of subnets and maximum number of hosts in each subnet?

A. subnets and hosts B. subnets and hosts

C. subnets and hosts D. subnets and hosts
ugcnetcse-nov2017-paper3 ip-addressing computer-networks

Answer key ☟

5.35.12 IP Addressing: UGC NET CSE | September 2013 | Part 3 | Question: 12

Given the IP address 201.14.78.65 and the subset mask 255.255.255.224. What is the subset address?

A. 201.14.78.32 B. 201.14.78.64 C. 201.14.78.65 D. 201.14.78.224

ugcnetcse-sep2013-paper3 computer-networks ip-addressing

Answer key ☟

5.35.13 IP Addressing: UGC NET CSE | September 2013 | Part 3 | Question: 8

Which of the following is the size of Network bits and Host bits of Class A of IP address?

A. Network bits 7, Host bits 24 B. Network bits 14, Host bits 16

C. Network bits 15, Host bits 16 D. Network bits 16, Host bits 16
ugcnetcse-sep2013-paper3 computer-networks ip-addressing
 Answer key ☟

5.36 IP Packet (2)

5.36.1 IP Packet: UGC NET CSE | December 2012 | Part 2 | Question: 9

If a packet arrive with M-bit value is ‘1’ and a fragmentation offset value ‘0’, then it is ____ fragement.

A. First B. Middle C. Last D. All of the above

ugcnetcse-dec2012-paper2 computer-networks ip-packet

Answer key ☟

5.36.2 IP Packet: UGC NET CSE | June 2014 | Part 3 | Question: 69

Which of the following is used in the options field of ?

A. Strict source routing B. Loose source routing
C. Time stamp D. All of the above
ugcnetjune2014iii computer-networks ip-packet routing

Answer key ☟

5.37 Internal Memory (1)

5.37.1 Internal Memory: UGC NET CSE | Junet 2015 | Part 3 | Question: 1

For the 8 bit word 00111001,the check bits stored with it would we 0111. Suppose when the word is read from
memory, the check bits are calculated to be 1101. What is the data word that was read from memory?

A. 10011001 B. 00011001 C. 00111000 D. 11000110

ugcnetcse-june2015-paper3 co-and-architecture internal-memory

Answer key ☟

5.38 Internet Security (1)

5.38.1 Internet Security: UGC NET CSE | July 2018 | Part 2 | Question: 47

In Challenge-Response authentication the claimant ____

A. Proves that she knows the secret without revealing it B. Proves that she does not know the secret
C. Reveals the secret D. Gives a challenge
ugcnetcse-july2018-paper2 computer-networks internet-security

Answer key ☟

5.39 Internet Stack Layers (1)

5.39.1 Internet Stack Layers: UGC NET CSE | June 2019 | Part 2 | Question: 87

Which of the following statements is/are true with regard to various layers in the Internet stack?
P: At the link layer, a packet of transmitted information is called a frame.
Q: At the network layer, a packet of transmitted information is called a segment.

A. P only B. Q only C. P and Q D. Neither P nor Q

ugcnetcse-june2019-paper2 internet-stack-layers

Answer key ☟

5.40 Ipv6 (1)

 5.40.1 Ipv6: UGC NET CSE | November 2017 | Part 3 | Question: 30

Which of the following statements are true?

i. The fragmentation fields in the base header section of have moved to the fragmentation extension header in
.
ii. The authentication extension header is new in .
iii. The record route option is not implemented in .

A. (i) and (ii) Only B. (ii) and (iii) Only

C. (i) and (iii) Only D. (i), (ii) and (iii)
ugcnetcse-nov2017-paper3 computer-networks ip-addressing ipv6

Answer key ☟

5.41 LAN Technologies (2)

5.41.1 LAN Technologies: UGC NET CSE | December 2010 | Part 2 | Question: 27

The baud rate is

A. Always equal to the bit transfer rate

B. Equal to twice the bandwidth of an ideal channel
C. Not equal to the signalling rate
D. Equal to half of the bandwidth of an ideal channel

ugcnetcse-dec2010-paper2 computer-networks lan-technologies

Answer key ☟

5.41.2 LAN Technologies: UGC NET CSE | January 2017 | Part 3 | Question: 25

Suppose there are N stations in a slotted LAN. Each station attempts to transmit with a probability P in each
time slot. The probability that only one station transmits in a given slot is____

A. B. C. D.
ugcnetcse-jan2017-paper3 computer-networks lan-technologies

Answer key ☟

5.42 Link State Routing (1)

5.42.1 Link State Routing: UGC NET CSE | January 2017 | Part 2 | Question: 30

In link state routing algorithm after construction of link state packets, new routes are computed using :
A. DES algorithm B. Dijkstra's algorithm
C. RSA algorithm D. Packets
ugcnetjan2017ii computer-networks link-state-routing

Answer key ☟

5.43 Loopback Address (1)

5.43.1 Loopback Address: UGC NET CSE | June 2019 | Part 2 | Question: 85

Consider the following two statements with respect to IPv4 in computer networking:
P: The loopback (IP) address is a member of class B network.
Q: The loopback (IP) address is used to send a packet from host to itself.
What can you say about the statements P and Q?

A. P – True; Q – False B. P – False; Q – True

C. P – True; Q – True D. P – False; Q – False
 ugcnetcse-june2019-paper2 ip-addressing loopback-address

Answer key ☟

5.44 Mesh topology (3)

5.44.1 Mesh topology: UGC NET CSE | December 2014 | Part 3 | Question: 25

For devices in a network, ________ number of duplex-mode links are required for a mesh topology.

A. B.
C. D.
ugcnetcse-dec2014-paper3 computer-networks network-topologies mesh-topology

Answer key ☟

5.44.2 Mesh topology: UGC NET CSE | July 2016 | Part 2 | Question: 27

In a fully connected mesh network with 10 computers, total ___ number of cables are required and ____ number
od ports are required for each device

A. 40, 9 B. 45, 10 C. 45, 9 D. 50, 10

ugcnetcse-july2016-paper2 computer-networks mesh-topology

Answer key ☟

5.44.3 Mesh topology: UGC NET CSE | June 2019 | Part 2 | Question: 81

A fully connected network topology is a topology in which there is a direct link between all pairs of nodes.
Given a fully connected network with nodes, the number of direct links as a function of can be expressed as

A. B. C. D.
ugcnetcse-june2019-paper2 mesh-topology

Answer key ☟

5.45 Mobile Communication (7)

5.45.1 Mobile Communication: UGC NET CSE | December 2012 | Part 2 | Question: 3

The GSM network is divided into the following three major systems:
A. SS, BSS, OSS B. BSS, BSC, MSC
C. CELL, BSS, OSS D. SS, CELL, MSC
ugcnetcse-dec2012-paper2 computer-networks communication mobile-communication

Answer key ☟

5.45.2 Mobile Communication: UGC NET CSE | December 2012 | Part 3 | Question: 26

Which are the classifications of data used in Mobile Applications?

A. Private data, Shared data, User data B. Public data, User data, Virtual data
C. Private data, Public data, Shared data D. Public data, Virtual data, User data
ugcnetcse-dec2012-paper3 mobile-communication computer-networks

Answer key ☟

5.45.3 Mobile Communication: UGC NET CSE | December 2012 | Part 3 | Question: 30

Match the following with respect to the Mobile Computing Architecture.

a. Downlink control 1. 100 Mbps
b. Data communication 2. Residency
data rate Latency (RL)
 c. The average duration of 3. Sending data
user's stay in cell from a BS to MD
d. FDDI bandwidth 4. 2-Mbps
a b c d
A 2 1 4 3
B 3 4 2 1
C 4 1 2 1
D 4 3 1 2

ugcnetcse-dec2012-paper3 mobile-communication computer-networks non-gatecse

Answer key ☟

5.45.4 Mobile Communication: UGC NET CSE | December 2014 | Part 2 | Question: 46

Consider the following statements and :

: A hard handover is one in which the channel in the source cell is retained and used for a while in parallel
with the channel in the target cell.
: A soft handover is one in which the channel in the source cell is released and only then the channel in the target cell
is engaged.

A. is true and is not true. B. is not true and is true.

C. Both and are true. D. Both and are not true.
ugcnetcse-dec2014-paper2 mobile-communication

Answer key ☟

5.45.5 Mobile Communication: UGC NET CSE | December 2015 | Part 2 | Question: 24

In a typical mobile phone system with hexagonal cells, it is forbidden to reuse a frequency band in adjacent
cells. If 840 frequencies are available, how many can be used in a given cell?

A. 280 B. 210 C. 140 D. 120

ugcnetcse-dec2015-paper2 mobile-communication computer-networks non-gatecse

Answer key ☟

5.45.6 Mobile Communication: UGC NET CSE | June 2012 | Part 3 | Question: 60

Radio signals generally propagate according to the following mechanisms:

A. Modulation, Amplification, Scattering

B. Reflection, Diffraction, Scattering
C. Amplification, Diffraction, Modulation
D. Reflection, Amplification, Diffraction

ugcnetcse-june2012-paper3 computer-networks transmission-media mobile-communication

Answer key ☟

5.45.7 Mobile Communication: UGC NET CSE | June 2014 | Part 2 | Question: 26

Match the following with respect to the mobile computing technologies

 A. B.
C. D.
ugcnetcse-june2014-paper2 computer-networks mobile-communication

Answer key ☟

5.46 Modulation (2)

5.46.1 Modulation: UGC NET CSE | November 2017 | Part 3 | Question: 26

Quadrature Amplitude Modulation means changing both

A. Frequency and phase of the carrier B. Frequency and Amplitude of the carrier
C. Amplitude and phase of the carrier D. Amplitude and Wavelength of the carrier
ugcnetcse-nov2017-paper3 computer-networks modulation physical-layer

Answer key ☟

5.46.2 Modulation: UGC NET CSE | September 2013 | Part 3 | Question: 10

Which of the following is an bit rate of an 8-PSK signal having 2500 Hz bandwidth?

A. 2500 bps B. 5000 bps C. 7500 bps D. 20000 bps

ugcnetcse-sep2013-paper3 computer-networks modulation

Answer key ☟

5.47 Multimedia Protocol (1)

5.47.1 Multimedia Protocol: UGC NET CSE | December 2015 | Part 3 | Question: 14

In electronic mail, which of the following protocols allows the transfer of multimedia messages?

A. IMAP B. SMTP C. POP 3 D. MIME

ugcnetcse-dec2015-paper3 computer-networks multimedia-protocol

Answer key ☟

5.48 Multiple Access Protocol (1)

5.48.1 Multiple Access Protocol: UGC NET CSE | August 2016 | Part 3 | Question: 28

A slotted ALOHA network transmits bits frames using a shared channel with kbps bandwidth. If the
system (all stations put together) produces frames per second, then the throughput of the system is
_______.

A. B. C. D.
ugcnetcse-aug2016-paper3 computer-networks multiple-access-protocol transmission-media

Answer key ☟

5.49 Multiplexing (2)

5.49.1 Multiplexing: UGC NET CSE | December 2008 | Part 2 | Question: 35

A high performance switching and multiplexing technology that utilizes fixed length packets to carry different
types of traffic is:

A. ATM B. ADSL C. SONET D. None of the above

ugcnetcse-dec2008-paper2 computer-networks multiplexing network-switching

Answer key ☟
 5.49.2 Multiplexing: UGC NET CSE | December 2010 | Part 2 | Question: 30

The threshold effect in demodulator is

A. Exhibited by all demodulator, when the input signal to noise ratio is low.
B. The rapid fall on output signal to noise ratio when the input signal to noise ratio fall below a particular value.
C. The property exhibited by all A.M. suppressed carrier coherent demodulator.
D. The property exhibited by correlation receiver.

ugcnetcse-dec2010-paper2 computer-networks multiplexing

Answer key ☟

5.50 Network Addressing (2)

5.50.1 Network Addressing: UGC NET CSE | December 2015 | Part 3 | Question: 10

The combination of an IP address and a port number is known as _____

A. network number B. socket address

C. subnet mask number D. MAC address
computer-networks network-addressing ugcnetcse-dec2015-paper3

Answer key ☟

5.50.2 Network Addressing: UGC NET CSE | December 2015 | Part 3 | Question: 13

In a classful addressing the IP address with (zero) as network number:

A. refers to the current network B. refers to broadcast on the local network

C. refers to the broadcast on a distant network D. refers to loopback testing
computer-networks network-addressing ugcnetcse-dec2015-paper3

Answer key ☟

5.51 Network Layer (1)

5.51.1 Network Layer: UGC NET CSE | December 2015 | Part 2 | Question: 40

Which of the following is not a congestion policy at network layer?

A. Flow Control Policy B. Packet Discard Policy
C. Packet Lifetime Management Policy D. Routing Algorithm
ugcnetcse-dec2015-paper2 computer-networks network-layer

Answer key ☟

5.52 Network Layering (5)

5.52.1 Network Layering: UGC NET CSE | December 2012 | Part 2 | Question: 17

The design issue of Datalink layer in OSI Reference Model is

A. Framing B. Representation of bits

C. Synchronization of bits D. Connection control
ugcnetcse-dec2012-paper2 computer-networks network-layering

Answer key ☟

5.52.2 Network Layering: UGC NET CSE | December 2013 | Part 3 | Question: 45

Which layer of OSI reference model is responsible for decomposition of messages and generation of sequence
numbers to ensure correct re-composition from end to end of the network?

A. Physical B. Data-link C. Transport D. Application

 ugcnetcse-dec2013-paper3 computer-networks network-layering

Answer key ☟

5.52.3 Network Layering: UGC NET CSE | June 2012 | Part 2 | Question: 15

Decryption and encryption of data are responsibility of which of the following layer?
A. Physical layer B. Data link layer
C. Presentation layer D. Session layer
ugcnetcse-june2012-paper2 computer-networks network-layering

Answer key ☟

5.52.4 Network Layering: UGC NET CSE | June 2012 | Part 2 | Question: 6

Both hosts and routers and TCP/IP protocol software. However, routers do not use protocol from all layers. The
layer for which the protocol software is not needed by a router is

A. Layer – 5 (Application) B. Layer – 1 (Physical)

C. Layer – 3 (Internet) D. Layer – 4 (Network Interface)
ugcnetcse-june2012-paper2 computer-networks network-layering

Answer key ☟

5.52.5 Network Layering: UGC NET CSE | June 2014 | Part 2 | Question: 05

Match the following

A. B.
C. D.
ugcnetcse-june2014-paper2 computer-networks network-layering

Answer key ☟

5.53 Network Protocols (10)

5.53.1 Network Protocols: UGC NET CSE | August 2016 | Part 2 | Question: 30

Which of the following protocols is used by email server to maintain a central repository that can be accessed
from any machine ?

A. B. C. D.
ugcnetcse-aug2016-paper2 computer-networks network-protocols

Answer key ☟

5.53.2 Network Protocols: UGC NET CSE | August 2016 | Part 3 | Question: 26

Consider the following statements :

A. High speed Ethernet works on optic fiber.
B. A point to point protocol over Ethernet is a network protocol for encapsulating frames inside Ethernet frames.
C. High speed Ethernet does not work on optic fiber.
D. A point to point protocol over Ethernet is a network protocol for encapsulating Ethernet frames inside frames.
Which of the following is correct ?
 A. and are true; and are false. B. and are false; and are true.
C. and are true. D. and are false.
ugcnetcse-aug2016-paper3 computer-networks ethernet network-protocols

Answer key ☟

5.53.3 Network Protocols: UGC NET CSE | December 2010 | Part 2 | Question: 29

Which of the following file transfer protocols use and establishes two virtual circuits between the local
and remote server ?

A. B. C. D.
ugcnetcse-dec2010-paper2 computer-networks network-protocols

Answer key ☟

5.53.4 Network Protocols: UGC NET CSE | December 2012 | Part 2 | Question: 8

The Mobile Application Protocol (MAP) typically runs on top of which protocol?

A. SNMP (Simple Network Management Protocol) B. SMTP (Simple Mail Transfer Protocol)
C. SS7 (Signalling System 7) D. HTTP (Hyper Text Transfer Protocol)
ugcnetcse-dec2012-paper2 computer-networks network-protocols

Answer key ☟

5.53.5 Network Protocols: UGC NET CSE | June 2010 | Part 2 | Question: 26

The ______ field is the SNMP PDV reports an error in a response message.

A. Error index B. Error status C. Set request D. Agent index

ugcnetcse-june2010-paper2 computer-networks network-protocols

Answer key ☟

5.53.6 Network Protocols: UGC NET CSE | October 2020 | Part 2 | Question: 33

Protocols in which the sender sends one frame and then waits for an acknowledgment before proceeding for next
frame are called as ______
A. Simplex protocols B. Unrestricted simplex protocols
C. Simplex stop and wait protocols D. Restricted simplex protocols
ugcnetcse-oct2020-paper2 computer-networks network-protocols

Answer key ☟

5.53.7 Network Protocols: UGC NET CSE | October 2020 | Part 2 | Question: 59

Post office protocol (POP) is a message access protocol which is used to extract message for client. In this
regards, which of the following are true?

i. POP has two modes, Delete mode and keep

ii. In Delete mode, mail is deleted from mail box after each retrival
iii. In Delete mode, mail is deleted from mail box before each retriveal
iv. In keep mode, mail is deleted before retrival
v. In keep mode, mail remains in mail box after retrival

Choose the correct answer from the options given below:

A. and only B. , and only

C. , , and only D. , and only
ugcnetcse-oct2020-paper2 computer-networks network-protocols

Answer key ☟
 5.53.8 Network Protocols: UGC NET CSE | October 2020 | Part 2 | Question: 72

Match with

Choose the correct answer from the options given below:

A. B.
C. D.
ugcnetcse-oct2020-paper2 computer-networks network-protocols

Answer key ☟

5.53.9 Network Protocols: UGC NET CSE | September 2013 | Part 2 | Question: 42

A method to provide secure transmission of email is called

A. TLS B. SA C. IPSec D. PGP

ugcnetsep2013ii computer-networks network-security network-protocols

Answer key ☟

5.53.10 Network Protocols: UGC NET CSE | September 2013 | Part 3 | Question: 11

Match the following

Codes:

A. B.
C. D.
ugcnetcse-sep2013-paper3 computer-networks network-protocols

Answer key ☟

5.54 Network Security (18)

5.54.1 Network Security: UGC NET CSE | August 2016 | Part 2 | Question: 46

An attacker sits between the sender and receiver and captures the information and retransmits to the receiver
after some time without altering the information. This attack is called as _____.

A. Denial of service attack B. Masquarade attack

C. Simple attack D. Complex attack
ugcnetcse-aug2016-paper2 computer-networks network-security

Answer key ☟

5.54.2 Network Security: UGC NET CSE | December 2010 | Part 2 | Question: 20

Which of the following is the process by which a user’s access to physical data in the application is limited,
based on his privileges?
A. Authorization B. Authentication
 C. Access Control D. All of these
ugcnetcse-dec2010-paper2 computer-networks network-security

Answer key ☟

5.54.3 Network Security: UGC NET CSE | December 2012 | Part 2 | Question: 37

AES is a round cipher based on the Rijndal Algorithm that uses a 128 – bit block of data. AES has three
different configurations. ______ rounds with a key size of 128-bits, ______ rounds with a key size of 192 bits
and ______ rounds with a key size of 256 –bits

A. 5, 7, 15 B. 10, 12, 14 C. 5, 6, 7 D. 20, 12, 14

ugcnetcse-dec2012-paper2 computer-networks network-security

Answer key ☟

5.54.4 Network Security: UGC NET CSE | December 2012 | Part 3 | Question: 72

A cryptarithmetic problem of the type

Can be solved efficiently using

A. depth first technique B. breadth first technique

C. constraint satisfaction technique D. bidirectional technique
ugcnetcse-dec2012-paper3 computer-networks network-security

Answer key ☟

5.54.5 Network Security: UGC NET CSE | December 2012 | Part 3 | Question: 8

Using RSA algorithm, what is the value of cipher text C, if the plain text M=5 and p=3, q=11 and d=7?

A. 33 B. 5 C. 25 D. 26
ugcnetcse-dec2012-paper3 computer-networks network-security

Answer key ☟

5.54.6 Network Security: UGC NET CSE | December 2015 | Part 2 | Question: 25

Using p=3, q=13, d=7 and e=3 in the RSA algorithm, what is the value of ciphertext for a plain text 5?

A. 13 B. 21 C. 26 D. 33
ugcnetcse-dec2015-paper2 computer-networks network-security

Answer key ☟

5.54.7 Network Security: UGC NET CSE | December 2018 | Part 2 | Question: 66

Which of the following statement/s is/are true?

i. Firewalls can screen traffic going into or out of an organization.

ii. Virtual private networks can stimulate an old leased network to provide certain desirable properties.

Choose the correct answer from the code given below:

A. (i) only B. (ii) only

C. Both (i) and (ii) D. Neither (i) nor (ii)
ugcnetcse-dec2018-paper2 network-security

Answer key ☟
5.54.8 Network Security: UGC NET CSE | December 2018 | Part 2 | Question: 90

Suppose that everyone in a group of people wants to communicate secretly with other people using
symmetric key cryptographic system. The communication between any two persons should not be decodable by
the others in the group. The number of keys required in the system as a whole to satisfy the confidentiality requirement
is

A. B. C. D.

ugcnetcse-dec2018-paper2 computer-networks network-security

Answer key ☟

5.54.9 Network Security: UGC NET CSE | July 2016 | Part 2 | Question: 29

If there are people in the world and are using secret key encryption and decryption for privacy purpose, then
the number of secret keys required will be

A. B. C. D.
ugcnetcse-july2016-paper2 computer-networks network-security

Answer key ☟

5.54.10 Network Security: UGC NET CSE | July 2016 | Part 2 | Question: 46

An attacker sits between customer and banker and captures the information from the customer and retransmits
to the banker by altering the information . This attack is called as
A. Masquerade attack B. Replay attack
C. Passive attack D. Denial of service attack
ugcnetcse-july2016-paper2 computer-networks network-security

Answer key ☟

5.54.11 Network Security: UGC NET CSE | July 2016 | Part 3 | Question: 30

Encrypt the plain text message using Transposition cipher technique with the following key :

Using as bogus character.

A. B. C. D.
ugcnetcse-july2016-paper3 computer-networks network-security

Answer key ☟

5.54.12 Network Security: UGC NET CSE | June 2009 | Part 2 | Question: 48

After sending a message, the sender should not be able to, at a later date, deny having sent the message, is
referred to as :

A. Authenticity
B. Non-Repudiability
C. Auditability
D. Repudiability

ugcnetcse-june2009-paper2 network-security

Answer key ☟
5.54.13 Network Security: UGC NET CSE | June 2010 | Part 2 | Question: 5

For your ATM debit card, you have a -decimal-digit personal secret code. In the absence of any clue, a brute-
force attack takes time- to crack the code on an ATM terminal. Therefore is the secure-time for a customer
to report in case the card is misplaced. Your Bank has decided to facilitate an increased secure-time. Out of the
following, which option should provide the largest rise in the value of ?

A. Instead of 4-decimal-digits, maintain the personal secret code in 4-hexadecimal-digits.

B. Instead of 4-decimal digits, maintain a 5-decimal-digit personal secret code.
C. Reduce the processing speed of the ATM terminals to the half of their current speed.
D. None of the above provides any improvement.

ugcnetcse-june2010-paper2 computer-networks network-security

Answer key ☟

5.54.14 Network Security: UGC NET CSE | June 2014 | Part 2 | Question: 30

SET, an open encryption and security specification model that is designed for protecting credit card transactions
on the internet, stands for

A. Secure Electronic Transaction B. Secular Enterprise for Transaction

C. Security Electronic Transmission D. Secured Electronic Termination
ugcnetcse-june2014-paper2 computer-networks network-security

Answer key ☟

5.54.15 Network Security: UGC NET CSE | June 2019 | Part 2 | Question: 89

The ability to inject packets into the Internet with a false source address is known as
A. Man-in-the-middle attack B. IP phishing
C. IP sniffing D. IP spoofing
ugcnetcse-june2019-paper2 network-security

Answer key ☟

5.54.16 Network Security: UGC NET CSE | Junet 2015 | Part 3 | Question: 27

Which are two modes of IP security?

A. Transport and certificate B. Transport and tunnel

C. Certificate and tunnel D. Preshared and transport
ugcnetcse-june2015-paper3 computer-networks network-security

Answer key ☟

5.54.17 Network Security: UGC NET CSE | Junet 2015 | Part 3 | Question: 28

A message "COMPUTERNETWORK" encrypted (ignore quotes) using columnar transposition cipher with a
key "LAYER". The encrypted message is

A. CTTOEWMROPNRUEK B. MROUEKCTTPNROEW
C. OEWPNRCTTUEKMRO D. UEKPNRMROOEQCTT
ugcnetcse-june2015-paper3 computer-networks network-security

Answer key ☟

5.54.18 Network Security: UGC NET CSE | October 2020 | Part 2 | Question: 89

Given below are two statements:

Statement : In Ceasar Cipher each letter of Plain text is replaced by another letter for encryption
Statement : Diffie-Hellman algorithm is used for exchange of secret key
 In the light of the above statements, choose the correct answer from the options given below

A. Both Statement and Statement are true

B. Both Statement and Statement are false
C. Statement is correct but Statement is false
D. Statement is incorrect but Statement is true

ugcnetcse-oct2020-paper2 computer-networks network-security

Answer key ☟

5.55 Network Switching (5)

5.55.1 Network Switching: UGC NET CSE | August 2016 | Part 3 | Question: 25

Suppose transmission rate of a channel is kbps. If there are routes from source to destination and each
packet contains bits. Total end to end delay in sending packet is _____.

A. sec B. sec C. se D. sec

ugcnetcse-aug2016-paper3 computer-networks network-switching

Answer key ☟

5.55.2 Network Switching: UGC NET CSE | December 2011 | Part 2 | Question: 10

Which of the following network access standard disassembler is used for connection station to a packet switched
network ?

A. B. C. D.
ugcnetcse-dec2011-paper2 computer-networks network-switching

Answer key ☟

5.55.3 Network Switching: UGC NET CSE | January 2017 | Part 3 | Question: 28

In a packet switching network, if the message size is 48 bytes and each packet contains a header of 3 bytes. If 24
packets are required to transmit the message, the packet size is

A. 2 bytes B. 1 byte C. 4 bytes D. 5 bytes

ugcnetcse-jan2017-paper3 computer-networks network-switching

Answer key ☟

5.55.4 Network Switching: UGC NET CSE | July 2018 | Part 2 | Question: 46

Which of the following statements are true?

i. Three broad categories of Networks are

i. Circuit Switched Networks
ii. Packet Switched Networks
iii. Message Switched Networks
ii. Circuit Switched Network resources need not be reserved during the set up phase
iii. In packet switching there is no resource allocation for packets

A. only B. only
C. only D. only
ugcnetcse-july2018-paper2 computer-networks network-switching

Answer key ☟

5.55.5 Network Switching: UGC NET CSE | June 2012 | Part 2 | Question: 16

In which circuit switching, delivery of data is delayed because data must be stored and retrieved from RAM?
 A. Space division B. Time division C. Virtual D. Packet
ugcnetcse-june2012-paper2 computer-networks network-switching

Answer key ☟

5.56 Network topologies (4)

5.56.1 Network topologies: UGC NET CSE | December 2009 | Part 2 | Question: 29

In case of Bus/Tree topology signal balancing issue is overcome by

(A) Modulation

(B) Polling

(C) Segmentation

(D) Strong transmitter

ugcnetcse-dec2009-paper2 computer-networks network-topologies

5.56.2 Network topologies: UGC NET CSE | December 2009 | Part 2 | Question: 46

The single stage network is also called

(A) one sided network

(B) two sided network

(C) recirculating network

(D) pipeline network

ugcnetcse-dec2009-paper2 computer-networks network-topologies

Answer key ☟

5.56.3 Network topologies: UGC NET CSE | December 2011 | Part 2 | Question: 8

Hub is a term used with

A. A Star Networks B. A Ring Networks C. A Router D. A Bridge

ugcnetcse-dec2011-paper2 computer-networks network-topologies

Answer key ☟

5.56.4 Network topologies: UGC NET CSE | June 2013 | Part 3 | Question: 16

In a fully connected mesh network with n devices, there are _____ physical channels to link all devices.

A. n(n-1)/2 B. n(n+1)/2 C. 2n D. 2n+1

ugcnetcse-june2013-paper3 computer-networks network-topologies

Answer key ☟

5.57 Osi Model (11)

5.57.1 Osi Model: UGC NET CSE | August 2016 | Part 2 | Question: 29

Match the following :

 A. B.
C. D.
ugcnetcse-aug2016-paper2 computer-networks osi-model

Answer key ☟

5.57.2 Osi Model: UGC NET CSE | December 2008 | Part 2 | Question: 17

Congestion control is done by :

A. Network layer
B. Physical layer
C. Presentation layer
D. Application layer

ugcnetcse-dec2008-paper2 computer-networks osi-model

Answer key ☟

5.57.3 Osi Model: UGC NET CSE | December 2008 | Part 2 | Question: 18

Assertion (A): Twisted pairs are widely used as transmission medium.

Reasoning (R): Twisted pairs have adequate performance and low cost.

A. Both (A) and (R) are true and (R) is the correct explanation for (A)
B. Both (A) and (R) are true but (R) is not the correct explanation
C. (A) is true but (R) is false
D. (A) is false but (R) is true

ugcnetcse-dec2008-paper2 computer-networks osi-model

Answer key ☟

5.57.4 Osi Model: UGC NET CSE | December 2008 | Part 2 | Question: 6

An example of a layer that is absent in broadcast networks is :

A. Physical layer
B. Presentation layer
C. Network layer
D. Application layer

ugcnetcse-dec2008-paper2 computer-networks osi-model network-layer

Answer key ☟

5.57.5 Osi Model: UGC NET CSE | December 2012 | Part 2 | Question: 43

Data Encryption Techniques are particularly used for _____

A. protecting data in Data Communication System B. reduce Storage Space Requirement

C. enhances Data Integrity D. decreases Data Integrity
ugcnetcse-dec2012-paper2 computer-networks osi-model

Answer key ☟
5.57.6 Osi Model: UGC NET CSE | December 2013 | Part 2 | Question: 1

When data and acknowledgement are sent in same frame, this is called as
A. Piggy packing B. Piggy backing
C. Back packing D. Good packing
ugcnetcse-dec2013-paper2 computer-networks osi-model

Answer key ☟

5.57.7 Osi Model: UGC NET CSE | December 2013 | Part 2 | Question: 2

Encryption and decryption is the responsibility of ____ Layer

A. Physical B. Network C. Application D. Datalink

ugcnetcse-dec2013-paper2 computer-networks osi-model

Answer key ☟

5.57.8 Osi Model: UGC NET CSE | June 2010 | Part 2 | Question: 28

End-to-End connectivity is provided from Last-to-Last in

A. Network layer B. Session layer

C. Transport layer D. Data link layer
ugcnetcse-june2010-paper2 computer-networks osi-model

Answer key ☟

5.57.9 Osi Model: UGC NET CSE | June 2010 | Part 2 | Question: 29

What services does the internet layer provide ?

1. Quality of service
2. Routing
3. Addressing
4. Connection oriented delivery
5. Framing bits

A. B. C. D.
ugcnetcse-june2010-paper2 computer-networks osi-model

Answer key ☟

5.57.10 Osi Model: UGC NET CSE | June 2013 | Part 3 | Question: 18

Match the following

A. B.
C. D.
ugcnetcse-june2013-paper3 computer-networks osi-model

Answer key ☟

5.57.11 Osi Model: UGC NET CSE | June 2014 | Part 3 | Question: 70

Which layers of the OSI reference model are host-to-host layers ?

 A. Transport, Session, Presentation, Application
B. Network, Transport, Session, Presentation
C. Data-link, Network, Transport, Session
D. Physical, Data-link, Network, Transport

ugcnetjune2014iii computer-networks osi-model

Answer key ☟

5.58 Osi Protocol (5)

5.58.1 Osi Protocol: UGC NET CSE | December 2012 | Part 3 | Question: 10

Match the following :

A. B.
C. D.
ugcnetcse-dec2012-paper3 computer-networks osi-protocol

Answer key ☟

5.58.2 Osi Protocol: UGC NET CSE | January 2017 | Part 2 | Question: 26

Match the following Layers and Protocols for a user browsing with

A. B.
C. D.
ugcnetjan2017ii computer-networks osi-protocol

Answer key ☟

5.58.3 Osi Protocol: UGC NET CSE | June 2012 | Part 3 | Question: 11

X.25 is ______ Network

A. Connection Oriented Network B. Connection Less Network
C. Either Connection Oriented or Connection Less D. Neither Connection Oriented nor Connection Less
ugcnetcse-june2012-paper3 computer-networks osi-protocol

Answer key ☟

5.58.4 Osi Protocol: UGC NET CSE | June 2012 | Part 3 | Question: 41

Which layer of OSI reference model uses the ICMP (Internet Control Message Protocol)?

A. Transport layer B. Data link layer

C. Network layer D. Application layer
ugcnetcse-june2012-paper3 computer-networks osi-protocol

Answer key ☟
 5.58.5 Osi Protocol: UGC NET CSE | Junet 2015 | Part 2 | Question: 26

Which of the following protocols is an application layer protocol that establishes, manages and terminates
multimedia sessions?
A. Session Maintenance Protocol B. Real-time Streaming Protocol
C. Real-time Transport Control Protocol D. Session Initiation Protocol
ugcnetcse-june2015-paper2 osi-protocol computer-networks

Answer key ☟

5.59 Physical Layer (4)

5.59.1 Physical Layer: UGC NET CSE | December 2010 | Part 2 | Question: 28

How much bandwidth is there in micron of spectrum at a wavelength of micron ?

A. MHz B. GHz C. THz D. KHz

ugcnetcse-dec2010-paper2 computer-networks physical-layer

Answer key ☟

5.59.2 Physical Layer: UGC NET CSE | December 2013 | Part 2 | Question: 3

An analog signal carries 4 bits in each signal unit. If 1000 signal units are sent per second, then baud rate and bit
rate of the signal are _____ and _____

A. 4000 bauds/sec & 1000 bps B. 2000 bauds/sec & 1000 bps
C. 1000 bauds/sec & 500 bps D. 1000 bauds/sec & 4000 bps
ugcnetcse-dec2013-paper2 computer-networks osi-model physical-layer

Answer key ☟

5.59.3 Physical Layer: UGC NET CSE | July 2018 | Part 2 | Question: 42

The period of a signal is 100 ms. Its frequency is ____

A. Hertz B. KHz C. KHz D. Hertz

ugcnetcse-july2018-paper2 computer-networks physical-layer

Answer key ☟

5.59.4 Physical Layer: UGC NET CSE | June 2013 | Part 3 | Question: 21

Which one of the following media is multidrop?

A. Shielded Twisted pair cable B. Unshielded Twisted pair cable

C. Thick Coaxial cable D. Fiber Optic cable
ugcnetcse-june2013-paper3 computer-networks physical-layer

Answer key ☟

5.60 Port Numbers (1)

5.60.1 Port Numbers: UGC NET CSE | Junet 2015 | Part 2 | Question: 27

Match the following port numbers with their uses:

 A. B.
C. D.
ugcnetcse-june2015-paper2 computer-networks port-numbers match-the-following

Answer key ☟

5.61 Propagation Delay (1)

5.61.1 Propagation Delay: UGC NET CSE | June 2019 | Part 2 | Question: 83

You are designing a link layer protocol for a link with bandwidth of Gbps ( bits/second) over a fiber link
with length of km. Assume the speed of light in this medium is km/second. What is the propagation
delay in this link?

A. millisecond B. milliseconds
C. milliseconds D. milliseconds
ugcnetcse-june2019-paper2 propagation-delay

Answer key ☟

5.62 Propagation Time (1)

5.62.1 Propagation Time: UGC NET CSE | December 2014 | Part 3 | Question: 28

What is the propagation time if the distance between the two points is ? Assume the propagation speed to
be metre/second in cable.

A. ms B. ms C. ms D. ms
ugcnetcse-dec2014-paper3 computer-networks propagation-time

Answer key ☟

5.63 Protocol (1)

5.63.1 Protocol: UGC NET CSE | December 2014 | Part 2 | Question: 50

Match the following

A. B.
C. D.
ugcnetcse-dec2014-paper2 computer-networks protocol

Answer key ☟

5.64 Rarp Protocol (1)

5.64.1 Rarp Protocol: UGC NET CSE | June 2019 | Part 2 | Question: 82

What is the name of the protocol that allows a client to send a broadcast message with its MAC address and
receive an IP address in reply?

A. ARP B. DNS C. RARP D. ICMP

ugcnetcse-june2019-paper2 rarp-protocol
 Answer key ☟

5.65 Routers Bridge Hubs Switches (2)

5.65.1 Routers Bridge Hubs Switches: UGC NET CSE | June 2009 | Part 2 | Question: 49

The device which connects dissimilar of different topologies using different sets of communication
protocols so that information can flow from one to another is called :

A. Router
B. Bridge
C. Gateway
D. Switch

ugcnetcse-june2009-paper2 computer-networks routers-bridge-hubs-switches

Answer key ☟

5.65.2 Routers Bridge Hubs Switches: UGC NET CSE | June 2014 | Part 2 | Question: 02

A bridge has access to ________ address in the same network.

A. Physical B. Network
C. Datalink D. Application
ugcnetcse-june2014-paper2 routers-bridge-hubs-switches

Answer key ☟

5.66 Routing (4)

5.66.1 Routing: UGC NET CSE | December 2011 | Part 2 | Question: 12

A station in a network in a network forward incoming packets by placing them on its shortest output queue.
What routing algorithm is being used ?

A. Hot potato routing B. Flooding

C. Static routing D. Delta routing
ugcnetcse-dec2011-paper2 computer-networks routing

Answer key ☟

5.66.2 Routing: UGC NET CSE | December 2015 | Part 3 | Question: 12

Consider a subnet with routers. If a three level hierarchy is chosen with clusters, each containing regions
of routers, then total number of entries in the routing table is _______

A. B. C. D.
computer-networks routing ugcnetcse-dec2015-paper3

Answer key ☟

5.66.3 Routing: UGC NET CSE | June 2012 | Part 2 | Question: 17

In which routing method do all the routers have a common database?

A. Distance vector B. Link state
C. Link vector D. Dijikstra method
ugcnetcse-june2012-paper2 computer-networks routing

Answer key ☟

5.66.4 Routing: UGC NET CSE | June 2012 | Part 2 | Question: 41

What is the routing algorithm used by RIP and IGRP?

 A. OSPF B. Link-state C. Dynamic D. Dijikstra vector
computer-networks routing ugcnetcse-june2012-paper2

Answer key ☟

5.67 Routing Algorithm (3)

5.67.1 Routing Algorithm: UGC NET CSE | December 2008 | Part 2 | Question: 19

An example of a non-adaptive routing algorithm is:

A. Shortest path routing

B. Centralised routing
C. Baran’s hot potato routing
D. Baran’s backward learning algorithm

ugcnetcse-dec2008-paper2 computer-networks routing-algorithm

Answer key ☟

5.67.2 Routing Algorithm: UGC NET CSE | December 2014 | Part 2 | Question: 28

Which of the following algorithms is not a broadcast routing algorithm ?

A. Flooding B. Multidestination routing

C. Reverse path forwarding D. All of the above
ugcnetcse-dec2014-paper2 computer-networks routing-algorithm

Answer key ☟

5.67.3 Routing Algorithm: UGC NET CSE | September 2013 | Part 2 | Question: 6

The count-to-infinity problem is associated with

A. Flooding algorithm B. Hierarchical routing algorithm
C. Distance vector routing algorithm D. Link state routing algorithm
ugcnetsep2013ii computer-networks routing-algorithm

Answer key ☟

5.68 Rsa (1)

5.68.1 Rsa: UGC NET CSE | June 2013 | Part 2 | Question: 33

Using data p=3, q=11, n=pq, d=7 in RSA algorithm find the cipher text of the given plain text SUZANNE

A. BUTAEEZ B. SUZANNE C. XYZABCD D. ABCDXYZ

computer-networks network-security rsa ugcnetcse-june2013-paper2

Answer key ☟

5.69 Rsa Public Key (1)

5.69.1 Rsa Public Key: UGC NET CSE | December 2013 | Part 2 | Question: 5

Using the RSA public key crypto system, if p=13, q=31 and d=7, then the value of e is

A. 101 B. 103 C. 105 D. 107

ugcnetcse-dec2013-paper2 computer-networks network-security rsa-public-key

Answer key ☟

5.70 Rsa Security Networks (2)

 5.70.1 Rsa Security Networks: UGC NET CSE | January 2017 | Part 3 | Question: 29

In RSA public key cryptosystem suppose where and are primes. and are public and
private keys respectively. Let be an integer such that and .
Which of the following equations represent RSA public key cryptosystem?

I.

II.

III.

IV.

A. I and II B. I and III

C. II and III D. I and IV
ugcnetcse-jan2017-paper3 computer-networks rsa-security-networks

Answer key ☟

5.70.2 Rsa Security Networks: UGC NET CSE | June 2019 | Part 2 | Question: 90

The RSA encryption algorithm also works in reverse, that is, you can encrypt a message with the private key and
decrypt it using the public key. This property is used in

A. instruction detection systems B. digital signatures

C. data compression D. certification
ugcnetcse-june2019-paper2 network-security rsa-security-networks computer-networks

Answer key ☟

5.71 Session Layer (1)

5.71.1 Session Layer: UGC NET CSE | Junet 2015 | Part 2 | Question: 28

Which of the following is not associated with the session layer?

A. Dialog control B. Token management

C. Semantics of the information transmitted D. synchronization
ugcnetcse-june2015-paper2 computer-networks session-layer

Answer key ☟

5.72 Signalling (1)

5.72.1 Signalling: UGC NET CSE | August 2016 | Part 3 | Question: 59

Which of the following is a source coding technique ?

A. Huffman coding B. Arithmetic coding
C. Run-length coding D. DPCM
ugcnetcse-aug2016-paper3 computer-networks signalling

Answer key ☟

5.73 Signals (1)

5.73.1 Signals: UGC NET CSE | June 2013 | Part 3 | Question: 20

The ______ measure the relative strengths of two signals or a signal at two different points.
 A. frequency B. attenuation C. throughput D. decibel
ugcnetcse-june2013-paper3 computer-networks signals

Answer key ☟

5.74 Sliding Window (4)

5.74.1 Sliding Window: UGC NET CSE | December 2009 | Part 2 | Question: 27

What is the maximum window size in sliding window protocol used in a computer
network ?

(A) 4

(B) 8

(C) 15

(D) 16
ugcnetcse-dec2009-paper2 computer-networks sliding-window

Answer key ☟

5.74.2 Sliding Window: UGC NET CSE | December 2012 | Part 3 | Question: 4

The technique of temporarily delaying outgoing acknowledgements so that they can be hooked onto the next
outgoing data frame is known as

A. Bit stuffing B. Piggy backing C. Pipelining D. Broadcasting

ugcnetcse-dec2012-paper3 computer-networks sliding-window

Answer key ☟

5.74.3 Sliding Window: UGC NET CSE | January 2017 | Part 3 | Question: 26

Station uses byte packets t transmit messages to station using sliding window protocol. The round trip
delay between and is milliseconds and the bottleneck bandwidth on the path between and is
kbps. The optimal window size of is

A. B. C. D.
ugcnetcse-jan2017-paper3 computer-networks sliding-window

Answer key ☟

5.74.4 Sliding Window: UGC NET CSE | June 2014 | Part 3 | Question: 72

Four bits are used for packed sequence numbering in a slinding window protocol used in a computer network.
What is the maximum window size?

A. 4 B. 8 C. 15 D. 16
ugcnetjune2014iii computer-networks sliding-window

Answer key ☟

5.75 Slotted Aloha (1)

5.75.1 Slotted Aloha: UGC NET CSE | July 2018 | Part 2 | Question: 41

A slotted ALOHA network transmits 200-bit frames using a shared channel with a 200 Kbps bandwidth. Find
the throughput of the system (all stations put together) produces 250 frames per second:

A. 49 B. 368 C. 149 D. 151

 ugcnetcse-july2018-paper2 computer-networks slotted-aloha

Answer key ☟

5.76 Subnetting (2)

5.76.1 Subnetting: UGC NET CSE | December 2018 | Part 2 | Question: 87

An Internet Service Provider has following chunk of based addresses available with it :
. The wants to give half of this chunk addresses to organization and a quarter to
organization while retaining the remaining with itself. Which of the following is a valid allocation of addresses to
and ?

A. B.
C. D.
ugcnetcse-dec2018-paper2 computer-networks subnetting

5.76.2 Subnetting: UGC NET CSE | June 2019 | Part 2 | Question: 84

You need subnets, each with about usable host address per subnet. What network mask will you assign
using a class B network address?
A. B.
C. D.
ugcnetcse-june2019-paper2 subnetting

Answer key ☟

5.77 TCP (4)

5.77.1 TCP: UGC NET CSE | January 2017 | Part 2 | Question: 28

A packet whose destination is outside the local network segment is sent to ________.

A. File server B. server C. server D. Default gateway

ugcnetjan2017ii computer-networks tcp

Answer key ☟

5.77.2 TCP: UGC NET CSE | Junet 2015 | Part 3 | Question: 26

Which one of the following control fields in TCP header is used to specify whether the sender has no more data
to transmit?

A. FIN B. RST C. SYN D. PSH

ugcnetcse-june2015-paper3 computer-networks tcp

Answer key ☟

5.77.3 TCP: UGC NET CSE | Junet 2015 | Part 3 | Question: 30

The minimum payload of a TCP segment is

A. 65,535 B. 65,515 C. 65,495 D. 65,475

ugcnetcse-june2015-paper3 computer-networks tcp

Answer key ☟

5.77.4 TCP: UGC NET CSE | September 2013 | Part 3 | Question: 9

Which of the following field of the TCP header tells how many bytes may be sent starting at the byte
acknowledged?

A. TCP header length B. Window size

C. Acknowledgement number D. Urgent pointer
 ugcnetcse-sep2013-paper3 computer-networks tcp

Answer key ☟

5.78 TCP Header (1)

5.78.1 TCP Header: UGC NET CSE | December 2014 | Part 3 | Question: 27

Which of the following is not a field in header ?

A. Sequence number B. Fragment offset
C. Checksum D. Window size
ugcnetcse-dec2014-paper3 computer-networks tcp-header

Answer key ☟

5.79 TCP IP Model (1)

5.79.1 TCP IP Model: UGC NET CSE | July 2016 | Part 2 | Question: 28

In TCP/IP reference model, the job of ____ layer is to permit hosts to inject packets into any network and travel
them independently to the destination

A. Physical B. Transport C. Application D. Host-to-network

ugcnetcse-july2016-paper2 computer-networks tcp-ip-model

Answer key ☟

5.80 TCP IP Suit Protocols (1)

5.80.1 TCP IP Suit Protocols: UGC NET CSE | December 2012 | Part 3 | Question: 22

Which provides an interface to the TCP/IP suit protocols in Windows 95 and Windows NT?

A. FTP Active-X Control B. TCP/IP Active-X Control

C. Calinsock Active-X Control D. HTML Active-X Control
ugcnetcse-dec2012-paper3 computer-networks tcp-ip-suit-protocols

Answer key ☟

5.81 Tele Communication (1)

5.81.1 Tele Communication: UGC NET CSE | Junet 2015 | Part 3 | Question: 25

Which transmission technique guarantees that data packets will be received by the receiver in the same order in
which they were sent by the sender?

A. Broadcasting B. Unicasting
C. Packet switching D. Circuit switching
ugcnetcse-june2015-paper3 computer-networks data-communication tele-communication

Answer key ☟

5.82 Token Bucket (1)

5.82.1 Token Bucket: UGC NET CSE | January 2017 | Part 3 | Question: 30

A node on a Mbps network is regulated by a token bucket. The token bucket is filled at a rate of Mbps.
Token bucket is initially filled with megabits. The maximum duration taken by to transmit at full rate of
Mbps is ______secs.

A. B. C. D.
ugcnetcse-jan2017-paper3 computer-networks token-bucket

Answer key ☟
5.83 Transmission Media (9)

5.83.1 Transmission Media: UGC NET CSE | August 2016 | Part 2 | Question: 26

Which of the following statements is not true with respect to microwaves ?

A. Electromagnetic waves with frequencies from GHz to THz.

B. Propagation is line-of-sight.
C. Very high-frequency waves cannot penetrate walls.
D. Use of certain portions of the band requires permission from authorities.

ugcnetcse-aug2016-paper2 computer-networks transmission-media

Answer key ☟

5.83.2 Transmission Media: UGC NET CSE | August 2016 | Part 2 | Question: 27

In a fast Ethernet cabling, Base- uses ______ cable and maximum segment size is ______.

A. Twisted pair, metres B. Twisted pair, metres

C. Fibre optics, metres D. Fibre optics, metres
ugcnetcse-aug2016-paper2 computer-networks transmission-media

Answer key ☟

5.83.3 Transmission Media: UGC NET CSE | August 2016 | Part 2 | Question: 28

A network with bandwidth of Mbps can pass only an average of frames per minute with each frame
carrying an average of bits. What is the throughput of this network ?

A. Mbps B. Mbps C. Mbps D. Mbps

ugcnetcse-aug2016-paper2 computer-networks transmission-media

Answer key ☟

5.83.4 Transmission Media: UGC NET CSE | August 2016 | Part 3 | Question: 29

An analog signal has a bit rate of bps and a baud rate of . Then analog signal has _____ signal elements
and carry _____ data elements in each signal.

A. bits B. bits C. bits D. bits

ugcnetcse-aug2016-paper3 computer-networks transmission-media

Answer key ☟

5.83.5 Transmission Media: UGC NET CSE | December 2008 | Part 2 | Question: 10

Transmission of N signals, each band limited to fm Hz by TDM, requires a minimum band-width of:

A. fm
B. 2 fm
C. N fm
D. 2N fm

ugcnetcse-dec2008-paper2 computer-networks transmission-media

Answer key ☟

5.83.6 Transmission Media: UGC NET CSE | December 2008 | Part 2 | Question: 7

The cell is:

1. bytes long
 2. bytes long
3. bytes long
4. bytes long

ugcnetcse-dec2008-paper2 computer-networks transmission-media

Answer key ☟

5.83.7 Transmission Media: UGC NET CSE | December 2010 | Part 2 | Question: 26

Frequency shift keying is used mostly in

A. Radio transmission B. Telegraphy

C. Telephone D. None of the above
ugcnetcse-dec2010-paper2 computer-networks transmission-media

Answer key ☟

5.83.8 Transmission Media: UGC NET CSE | December 2012 | Part 2 | Question: 23

Coaxial cables are categorized by Radio Government rating are adapted for specialized functions. Category RG-
59 with impedance 75 used for

A. Cable TV B. Ethernet C. Thin Ethernet D. Thick Ethernet

ugcnetcse-dec2012-paper2 computer-networks transmission-media

Answer key ☟

5.83.9 Transmission Media: UGC NET CSE | July 2016 | Part 2 | Question: 30

Optical fiber uses reflection to guide light through a channel, in which angle of incidence is ____ the critical
angle
A. equal to B. less than
C. greater than D. less than or equal to
ugcnetcse-july2016-paper2 computer-networks transmission-media

Answer key ☟

5.84 Unguided Media (1)

5.84.1 Unguided Media: UGC NET CSE | December 2013 | Part 2 | Question: 4

The VLF and LF bauds use _____ propagation for communication

A. Ground B. Sky C. Line of sight D. Space

ugcnetcse-dec2013-paper2 computer-networks unguided-media

Answer key ☟

5.85 Wifi (1)

5.85.1 Wifi: UGC NET CSE | December 2009 | Part 2 | Question: 49

Another name of IEEE 802.11 a is ____________

(A) Wi-Max

(B) Fast Ethernet

(C) Wi-Fi

(D) 802.11 g
 ugcnetcse-dec2009-paper2 computer-networks wifi

Answer key ☟

5.86 Wireless Communication (1)

5.86.1 Wireless Communication: UGC NET CSE | June 2012 | Part 2 | Question: 28

Mobile IP provides two basic functions

A. Route discovery and registration B. Agent discovery and registration

C. IP binding and registration D. None of the above
ugcnetcse-june2012-paper2 computer-networks mobile-communication wireless-communication

Answer key ☟

5.87 Wireless Lan (4)

5.87.1 Wireless Lan: UGC NET CSE | December 2009 | Part 2 | Question: 48

Which technology is sometime referred to as wireless cable ?

(A) MMDS

(B) ATM

(C) LMDS

(D) CDMA
ugcnetcse-dec2009-paper2 computer-networks wireless-lan

Answer key ☟

5.87.2 Wireless Lan: UGC NET CSE | December 2009 | Part 2 | Question: 50

The unlicensed National Information Infrastructure band operates at the _________ frequency

(A) 2.4 GHz

(B) 5 GHz

(C) 33 MHz

(D) 5 MHz
ugcnetcse-dec2009-paper2 computer-networks wireless-lan

Answer key ☟

5.87.3 Wireless Lan: UGC NET CSE | December 2015 | Part 2 | Question: 21

Which of the following services is not provided by wireless access point in 802.11 WLAN?

A. Association B. Disassociation
C. Error correction D. Integration
ugcnetcse-dec2015-paper2 computer-networks wireless-lan

Answer key ☟

5.87.4 Wireless Lan: UGC NET CSE | June 2010 | Part 2 | Question: 30

What is the maximum operating rate of a wireless LAN using infrared communication ?

A. mbps B. mbps C. mbps D. mbps

 ugcnetcse-june2010-paper2 computer-networks wireless-lan

5.88 Wireless Networks (1)

5.88.1 Wireless Networks: UGC NET CSE | December 2008 | Part 2 | Question: 47

Assertion (A): Cellular telephone systems can handle a multitude of users .

Reasoning (R): Cellular telephone systems permit extensive frequency reuse in a small local area .

A. Both (A) and (R) are true and (R) is the correct explanation for (A)
B. (B) Both (A) and (R) are true but (R) is not the correct explanation
C. (A) is true but (R) is false
D. (A) is false but (R) is true

ugcnetcse-dec2008-paper2 computer-networks wireless-networks

5.89 Wireless Protocol (1)

5.89.1 Wireless Protocol: UGC NET CSE | December 2013 | Part 2 | Question: 42

Match the following

A. B.
C. D.
ugcnetcse-dec2013-paper2 computer-networks wireless-protocol

Answer key ☟

5.90 Wireless Transmission (1)

5.90.1 Wireless Transmission: UGC NET CSE | June 2012 | Part 3 | Question: 66

If the period of a signal is 1000 ms, then what is its frequency in kiliohertz?

A. KHz B. KHz C. KHz D. 1 KHz

ugcnetcse-june2012-paper3 computer-networks data-communication wireless-transmission

Answer key ☟

Answer Keys
5.0.1 B 5.0.2 D 5.0.3 A 5.0.4 D 5.0.5 X
5.0.6 D 5.0.7 B 5.0.8 C 5.0.9 B 5.0.10 B
5.0.11 B 5.0.12 D 5.0.13 C 5.0.14 B 5.0.15 A
5.0.16 D 5.0.17 B 5.0.18 C 5.0.19 C 5.0.20 D
5.0.21 B 5.0.22 Q-Q 5.0.23 Q-Q 5.0.24 D 5.0.25 Q-Q
5.0.26 Q-Q 5.0.27 Q-Q 5.0.28 B 5.0.29 D 5.0.30 Q-Q
5.0.31 Q-Q 5.0.32 Q-Q 5.0.33 Q-Q 5.0.34 Q-Q 5.0.35 Q-Q
5.0.36 Q-Q 5.0.37 Q-Q 5.0.38 Q-Q 5.0.39 Q-Q 5.0.40 Q-Q

5.0.41 D 5.0.42 Q-Q 5.0.43 Q-Q 5.0.44 Q-Q 5.0.45 Q-Q

5.0.46 Q-Q 5.0.47 Q-Q 5.0.48 Q-Q 5.0.49 Q-Q 5.0.50 Q-Q
5.0.51 Q-Q 5.0.52 Q-Q 5.0.53 Q-Q 5.0.54 Q-Q 5.0.55 Q-Q
5.0.56 Q-Q 5.0.57 Q-Q 5.0.58 Q-Q 5.0.59 A 5.0.60 A
5.0.61 Q-Q 5.1.1 D 5.2.1 B 5.3.1 X 5.4.1 A
5.5.1 C 5.6.1 Q-Q 5.7.1 A 5.8.1 B 5.9.1 B
5.10.1 Q-Q 5.11.1 D 5.11.2 A 5.12.1 Q-Q 5.13.1 Q-Q
5.14.1 A 5.14.2 X 5.15.1 D 5.16.1 C 5.16.2 D
5.16.3 A 5.16.4 B 5.16.5 C 5.16.6 D 5.16.7 A
5.16.8 C 5.16.9 C 5.17.1 D 5.18.1 Q-Q 5.18.2 C
5.18.3 D 5.18.4 Q-Q 5.18.5 C 5.18.6 C 5.18.7 C
5.19.1 Q-Q 5.19.2 Q-Q 5.19.3 Q-Q 5.19.4 Q-Q 5.19.5 Q-Q
5.19.6 Q-Q 5.19.7 C 5.20.1 Q-Q 5.20.2 Q-Q 5.20.3 B
5.20.4 D 5.20.5 D 5.20.6 D 5.20.7 C 5.21.1 Q-Q
5.22.1 B 5.23.1 Q-Q 5.23.2 C 5.24.1 Q-Q 5.25.1 B
5.26.1 D 5.26.2 A 5.27.1 C 5.27.2 D 5.28.1 Q-Q
5.29.1 Q-Q 5.29.2 C 5.29.3 Q-Q 5.29.4 Q-Q 5.29.5 C
5.30.1 X 5.31.1 A 5.31.2 B 5.31.3 D 5.31.4 B
5.31.5 A 5.32.1 A 5.33.1 D 5.34.1 D 5.35.1 Q-Q
5.35.2 Q-Q 5.35.3 Q-Q 5.35.4 C 5.35.5 Q-Q 5.35.6 Q-Q
5.35.7 D 5.35.8 C 5.35.9 A 5.35.10 C 5.35.11 A
5.35.12 B 5.35.13 A 5.36.1 A 5.36.2 D 5.37.1 B
5.38.1 Q-Q 5.39.1 A 5.40.1 D 5.41.1 Q-Q 5.41.2 A
5.42.1 B 5.43.1 B 5.44.1 D 5.44.2 C 5.44.3 D
5.45.1 A 5.45.2 C 5.45.3 B 5.45.4 D 5.45.5 A
5.45.6 B 5.45.7 B 5.46.1 C 5.46.2 C 5.47.1 C
5.48.1 Q-Q 5.49.1 Q-Q 5.49.2 Q-Q 5.50.1 B 5.50.2 D
5.51.1 A 5.52.1 A 5.52.2 C 5.52.3 C 5.52.4 A
5.52.5 A 5.53.1 Q-Q 5.53.2 Q-Q 5.53.3 Q-Q 5.53.4 C
5.53.5 Q-Q 5.53.6 C 5.53.7 D 5.53.8 B 5.53.9 D
5.53.10 C 5.54.1 Q-Q 5.54.2 Q-Q 5.54.3 B 5.54.4 C
5.54.5 D 5.54.6 X 5.54.7 Q-Q 5.54.8 Q-Q 5.54.9 C
5.54.10 B 5.54.11 A 5.54.12 Q-Q 5.54.13 Q-Q 5.54.14 A
5.54.15 D 5.54.16 B 5.54.17 C 5.54.18 A 5.55.1 Q-Q
5.55.2 Q-Q 5.55.3 D 5.55.4 Q-Q 5.55.5 B 5.56.1 Q-Q
5.56.2 Q-Q 5.56.3 A 5.56.4 A 5.57.1 Q-Q 5.57.2 Q-Q
5.57.3 Q-Q 5.57.4 Q-Q 5.57.5 A 5.57.6 B 5.57.7 C
5.57.8 Q-Q 5.57.9 Q-Q 5.57.10 B 5.57.11 A 5.58.1 C
5.58.2 A 5.58.3 A 5.58.4 C 5.58.5 D 5.59.1 Q-Q
5.59.2 D 5.59.3 Q-Q 5.59.4 C 5.60.1 D 5.61.1 D
5.62.1 X 5.63.1 B 5.64.1 C 5.65.1 C 5.65.2 A
5.66.1 Q-Q 5.66.2 A 5.66.3 B 5.66.4 D 5.67.1 Q-Q
5.67.2 X 5.67.3 C 5.68.1 A 5.69.1 B 5.70.1 B
5.70.2 B 5.71.1 C 5.72.1 Q-Q 5.73.1 D 5.74.1 Q-Q
5.74.2 B 5.74.3 B 5.74.4 C 5.75.1 Q-Q 5.76.1 Q-Q
5.76.2 B 5.77.1 D 5.77.2 A 5.77.3 D 5.77.4 B
5.78.1 B 5.79.1 X 5.80.1 X 5.81.1 D 5.82.1 B
5.83.1 Q-Q 5.83.2 Q-Q 5.83.3 Q-Q 5.83.4 Q-Q 5.83.5 Q-Q
5.83.6 Q-Q 5.83.7 Q-Q 5.83.8 A 5.83.9 C 5.84.1 A
5.85.1 Q-Q 5.86.1 B 5.87.1 Q-Q 5.87.2 Q-Q 5.87.3 C
5.87.4 Q-Q 5.88.1 Q-Q 5.89.1 D 5.90.1 A
6 Data Mining and Warehousing (17)

6.0.1 UGC NET CSE | December 2004 | Part 2 | Question: 49

A data warehouse is always _________.

A. Subject oriented B. Object oriented

C. Program oriented D. Compiler oriented
ugcnetcse-dec2004-paper2

Answer key ☟

6.1 Data Cube (1)

6.1.1 Data Cube: UGC NET CSE | December 2015 | Part 2 | Question: 31

A data cube has dimensions, and each dimensions has exactly distinct values in the base cuboid. Assume
that there are no concept hierarchies associated with the dimensions. What is the maximum number of cells
possible in the data cube,

A. B. C. D.
ugcnetcse-dec2015-paper2 data-cube data-modelling

Answer key ☟

6.2 Data Mining (1)

6.2.1 Data Mining: UGC NET CSE | October 2020 | Part 2 | Question: 35

The process of removing details from a given state representation is called _____

A. Extraction B. Mining C. Selection D. Abstraction

ugcnetcse-oct2020-paper2 non-gatecse data-mining

Answer key ☟

6.3 Data Mining and Warehousing (1)

6.3.1 Data Mining and Warehousing: UGC NET CSE | December 2015 | Part 2 | Question: 34

____ allows selection of the relevant information necessary for the data warehouse:
A. The Top-Down View B. Data Warehouse View
C. Datasource View D. Business Query View
ugcnetcse-dec2015-paper2 data-warehousing data-mining-and-warehousing

Answer key ☟

6.4 Decision Tree (1)

6.4.1 Decision Tree: UGC NET CSE | September 2013 | Part 2 | Question: 40

The decision tree classifier is a widely used technique for

A. Classification B. Association C. Partition D. Clustering

ugcnetsep2013ii machine-learning decision-tree

Answer key ☟

6.5 Expert System (1)

 6.5.1 Expert System: UGC NET CSE | December 2014 | Part 3 | Question: 59

Match the following components of an expert system

A. B.
C. D.
ugcnetcse-dec2014-paper3 artificial-intelligence expert-system

Answer key ☟

6.6 Fuzzy Set (1)

6.6.1 Fuzzy Set: UGC NET CSE | June 2012 | Part 3 | Question: 6

If two fuzzy set and are given with membership functions

Then the value of will be

A. B.
C. D.
ugcnetcse-june2012-paper3 fuzzy-set

Answer key ☟

6.7 Group Decision Support System (1)

6.7.1 Group Decision Support System: UGC NET CSE | August 2016 | Part 3 | Question: 73

Criticism free idea generation is a factor of _____.

A. Decision Support System B. Group Decision Support System
C. Enterprise Resource Support System D. Artificial Intelligence
ugcnetcse-aug2016-paper3 artificial-intelligence group-decision-support-system

Answer key ☟

6.8 K Means Clustering (1)

6.8.1 K Means Clustering: UGC NET CSE | October 2020 | Part 2 | Question: 83

Given below are two statements:

If two variables and are used for clustering, then consider the following statements for means clustering
with :

Statement I: If and have correlation of the cluster centroid will be in straight line
Statement II: If and have correlation of the cluster centroid will be in straight line

In the light of the above statements, choose the correct answer from the options given below

A. Both Statement I and Statement II are true

B. Both Statement I and Statement II are false
 C. Statement I is correct but Statement II is false
D. Statement I is incorrect but Statement II is true

ugcnetcse-oct2020-paper2 k-means-clustering

Answer key ☟

6.9 Knowledge Representation (5)

6.9.1 Knowledge Representation: UGC NET CSE | December 2013 | Part 3 | Question: 23

High level knowledge which relates to the use of sentences in different contexts and how the context affect the
meaning of the sentences?

A. Morphological B. Syntactic C. Semantic D. Pragmatic

ugcnetcse-dec2013-paper3 artificial-intelligence knowledge-representation

Answer key ☟

6.9.2 Knowledge Representation: UGC NET CSE | December 2014 | Part 3 | Question: 58

Match the following

A. B.
C. D.
ugcnetcse-dec2014-paper3 artificial-intelligence knowledge-representation

6.9.3 Knowledge Representation: UGC NET CSE | June 2010 | Part 2 | Question: 2

' is a robot of ’ means can perform some of the tasks that otherwise would do and is unable to
do anything else.Which of the following is the most appropriate representation to model this situation?

A.

B.

C.
D. None of these

ugcnetcse-june2010-paper2 knowledge-representation non-gatecse

 6.9.4 Knowledge Representation: UGC NET CSE | June 2013 | Part 3 | Question: 72

Which of the following is a knowledge representation technique used to represent knowledge about stereotype
situation?

A. Semantic network B. Frames C. Scripts D. Conceptual Dependency

ugcnetcse-june2013-paper3 artificial-intelligence knowledge-representation

Answer key ☟

6.9.5 Knowledge Representation: UGC NET CSE | June 2014 | Part 3 | Question: 08

Consider a fuzzy set old as defined below

Old = .
Then the alpha-cut for alpha = for the set old will be

A.
B.
C.
D.

ugcnetjune2014iii knowledge-representation fuzzy-set

Answer key ☟

6.10 Non Gatecse (1)

6.10.1 Non Gatecse: UGC NET CSE | January 2017 | Part 3 | Question: 56

Consider the following AO graph:

Which is the best node to expand by next AO* algorithm?

A. A B. B C. C D. B and C
ugcnetcse-jan2017-paper3 non-gatecse

Answer key ☟

6.11 Olap (1)

6.11.1 Olap: UGC NET CSE | December 2015 | Part 2 | Question: 33

____ system is market oriented and is used for data analysis by knowledge workers including Managers,
Executives adn Analysts.

A. OLTP B. OLAP C. Data System D. Market System

ugcnetcse-dec2015-paper2 data-warehousing olap data-mining-and-warehousing

Answer key ☟

6.12 Perceptron (1)

6.12.1 Perceptron: UGC NET CSE | December 2014 | Part 3 | Question: 70

Consider the following statements about a perception :

 . Feature detector can be any function of the input parameters.
. Learning procedure only adjusts the connection weights to the output layer. Identify the correct statement out of the
following :
A. is false and is false. B. is true and is false.
C. is false and is true. D. is true and is true.
ugcnetcse-dec2014-paper3 neural-network perceptron

Answer key ☟

Answer Keys
6.0.1 Q-Q 6.1.1 D 6.2.1 D 6.3.1 A 6.4.1 A
6.5.1 B 6.6.1 X 6.7.1 Q-Q 6.8.1 C 6.9.1 D
6.9.2 B 6.9.3 Q-Q 6.9.4 C 6.9.5 D 6.10.1 A
6.11.1 B 6.12.1 D
7 Databases (180)

7.0.1 UGC NET CSE | June 2014 | Part 2 | Question: 46

Manager’s salary details are hidden from the employee. This is called as

A. Conceptual level data hiding B. Physical level data hiding

C. External level data hiding D. Local level data hiding
ugcnetcse-june2014-paper2 databases

Answer key ☟

7.0.2 UGC NET CSE | June 2014 | Part 2 | Question: 50

Match the following

A. B.
C. D.
ugcnetcse-june2014-paper2 databases

Answer key ☟

7.0.3 UGC NET CSE | June 2012 | Part 2 | Question: 7

In multiuser database if two users wish to update the same record at the same time, they are prevented from
doing so by

A. Jamming B. Password C. Documentation D. Record lock

ugcnetcse-june2012-paper2 databases

Answer key ☟

7.0.4 UGC NET CSE | June 2012 | Part 3 | Question: 9

The problem that occurs when one transaction updates a database item and the transaction fails for some reason
is

A. Temporary Select Problem B. Temporary Modify Problem

C. Dirty Read Problem D. None
ugcnetcse-june2012-paper3 databases

Answer key ☟

7.0.5 UGC NET CSE | December 2012 | Part 2 | Question: 32

The User Work Area (UWA) is a set of Program variables declared in the host program to communicate the
contents of individual records between

A. DBMS and the Host record B. Host program and the Host record
C. Host program and DBMS D. Host program and Host language
ugcnetcse-dec2012-paper2 databases

Answer key ☟
7.0.6 UGC NET CSE | June 2013 | Part 3 | Question: 47

Match the following:

a. Foreign keys i. Domain constraint
ii. Referential
b. Private key
integrity
c. Event control action
iii. Encryption
model
d. Data security iv. Trigger

A. a-iii, b-ii, c-i, d-iv B. a-ii, b-i, c-iv, d-iii

C. a-iii, b-iv, c-i, d-ii D. a-i, b-ii, c-iii, d-iv
ugcnetcse-june2013-paper3 databases

Answer key ☟

7.0.7 UGC NET CSE | December 2013 | Part 2 | Question: 12

GO BOTTOM and SKIP-3 commands are given one after another in a database file of 30 records. It shifts the
control to

A. 28-th record B. 27-th record

C. 3-rd record D. 4-th record
ugcnetcse-dec2013-paper2 databases

Answer key ☟

7.0.8 UGC NET CSE | December 2013 | Part 3 | Question: 60

Match the following

A. B.
C. D.
ugcnetcse-dec2013-paper3 databases

Answer key ☟

7.0.9 UGC NET CSE | December 2015 | Part 2 | Question: 14

Match the following database terms to their functions

A. B.
C. D.
 ugcnetcse-dec2015-paper2 databases match-the-following

Answer key ☟

7.0.10 UGC NET CSE | December 2015 | Part 2 | Question: 18

Which of the following provides the best description of an entity type?

A. A specific concrete object with a defined set of processes (e.g. Jatin with diabetes)
B. A value given to a particular attribute (e.g. height - 230 cm)
C. A thing that we wish to collect data about zero or more, possibly real world examples of it may exist
D. A template for a group of things with the same set of characteristics that may exist in the real world

ugcnetcse-dec2015-paper2 databases

Answer key ☟

7.0.11 UGC NET CSE | December 2015 | Part 2 | Question: 19

A data which improves the performance and accessibility of the database are called:

A. Indexes B. User Data

C. Application Metadata D. Data Dictionary
ugcnetcse-dec2015-paper2 databases

Answer key ☟

7.0.12 UGC NET CSE | July 2016 | Part 2 | Question: 17

Which of the following statement(s) is/are FALSE in the context of Relational DBMS?

I. Views in a database system are important because they with access control by aloowing users to see only a
particular subset of the data in the databse
II. E-R diagrams are useful to logically model concepts
III. An update anamoly is when it is not possible to store information unless some other, unrelated information is stored
as well
IV. SQL is a procedural language
A. I and IV only B. III and IV only C. I, II and III only D. II, III and IV only
ugcnetcse-july2016-paper2 databases

Answer key ☟

7.0.13 UGC NET CSE | July 2016 | Part 3 | Question: 10

Which of the following statements is true?

: The decomposition of the schema R(A, B, C) into R (A,B) and R (A,C) is always lossless
: The decomposition of the schema R(A, B, C, D, E) having AD B, C DE, B AE, and AE C, into R (A,B,
D) and R (A, C, D, E) is lossless

A. Both and B. Neither nor C. Only D. Only

ugcnetcse-july2016-paper3 databases

Answer key ☟

7.0.14 UGC NET CSE | December 2011 | Part 2 | Question: 23

Data security threats include

A. Privacy invasion B. Hardware failure

C. Fraudulent manipulation of data D. Encryption and decryption
ugcnetcse-dec2011-paper2 databases

Answer key ☟
7.0.15 UGC NET CSE | August 2016 | Part 3 | Question: 12

Which one of the following pairs is correctly matched in the context of database design ?

Codes :

A. I-D, II-A, III-B, IV-C B. I-D, II-C, III-B, IV-A

C. I-C, II-D, III-A, IV-B D. I-C, II-A, III-D, IV-B
ugcnetcse-aug2016-paper3

Answer key ☟

7.0.16 UGC NET CSE | June 2009 | Part 2 | Question: 18

(i) includes a query language based on both relation algebra and tuple calculus
(ii) includes a query language based on tuple calculus
(iii) includes a query language based on relational algebra
(iv) includes a query language based on none of the relational algebra and tuple calculus
Which one is correct ?

A. (i) only
B. (ii) only
C. (iii) only
D. (iv) only

ugcnetcse-june2009-paper2

Answer key ☟

7.0.17 UGC NET CSE | June 2009 | Part 2 | Question: 21

Which construct in SQL is used to test whether a subquery has any tuples in its result ?

A. UNIQUE
B. EXISTS
C. GROUP BY
D. EXCEPT

ugcnetcse-june2009-paper2

Answer key ☟

7.0.18 UGC NET CSE | June 2009 | Part 2 | Question: 22

ORACLE supports :
 A. inner join and outer join only
B. outer join and semi join only
C. inner join, outer join , semi join only
D. inner join, outer join, semi join and anti join

ugcnetcse-june2009-paper2

Answer key ☟

7.0.19 UGC NET CSE | July 2018 | Part 2 | Question: 68

Database systems that store each relation in a separate operating system file may use the operating system's
authorization scheme, instead of defining a special scheme themselves. In this case, which of the following is
false?

A. The administrator enjoys more control on the grant option

B. It is difficult among the update, delete and insert authorizations
C. cannot store more than one relation in a file
D. Operations on the database are speeded up as the authorization procedure is carried out at the operating system level

ugcnetcse-july2018-paper2 databases

Answer key ☟

7.0.20 UGC NET CSE | December 2004 | Part 2 | Question: 19

The entity type on which the __________ type depends is called the identifying owner.

A. Strong entity B. Relationship C. Weak entity D. E - R

ugcnetcse-dec2004-paper2

Answer key ☟

7.0.21 UGC NET CSE | December 2004 | Part 2 | Question: 18

The completeness constraint has rules :

A. Supertype, Subtype B. Total specialization, Partial specialization

C. Specialization, Generalization D. All of the above
ugcnetcse-dec2004-paper2

Answer key ☟

7.0.22 UGC NET CSE | December 2004 | Part 2 | Question: 17

Specialization is a __________ process.

A. Top - down B. Bottom - up C. Both (A) and (B) D. None of the above
ugcnetcse-dec2004-paper2

Answer key ☟

7.0.23 UGC NET CSE | December 2004 | Part 2 | Question: 16

The model is expressed in terms of :

i. Entities
ii. The relationship among entities
iii. The attributes of the entities

Then
 A. (i) and (iii) B. (i) and (ii) C. (ii) and (iii) D. None of the above
ugcnetcse-dec2004-paper2

Answer key ☟

7.0.24 UGC NET CSE | December 2006 | Part 2 | Question: 20

Two phase protocol in a database management system is :

A. a concurrency mechanism that is not deadlock free

B. a recovery protocol used for restoring a database after a crash
C. Any update to the system log done in 2-phases
D. not effective in Database

ugcnetcse-dec2006-paper2

Answer key ☟

7.0.25 UGC NET CSE | December 2006 | Part 2 | Question: 17

In DBMS, deferred update means :

A. All the updates are done first but the entries are made in the log file later
B. All the log files entries are made first but the actual updates are done later
C. Every update is done first followed by a writing on the log file
D. Changes in the views are deferred till a query asks for a view

ugcnetcse-dec2006-paper2

Answer key ☟

7.0.26 UGC NET CSE | December 2007 | Part 2 | Question: 20

Consider the query :

SELECT student_name FROM students WHERE
class_name=(SELECT class_name FROM students WHERE math_marks=100);

what will be the output ?

A. the list of names of students with marks in mathematics

B. the names of all students of all classes in which at least one student has marks in mathematics
C. the names of all students in all classes having marks in mathematics
D. the names and class of all students whose marks in mathematics is

ugcnetcse-dec2007-paper2

Answer key ☟

7.0.27 UGC NET CSE | December 2007 | Part 2 | Question: 19

The end of an SQL command is denoted by :

A. an end-of-line character B. an ‘enter-key’ marker

C. entering F4 key D. a semicolon (;)
ugcnetcse-dec2007-paper2

Answer key ☟
 7.0.28 UGC NET CSE | December 2007 | Part 2 | Question: 17

Aggregate functions in SQL are :

A. GREATEST, LEAST and ABS B. SUM, COUNT and AVG

C. UPPER, LOWER and LENGTH D. SQRT, POWER and MOD
ugcnetcse-dec2007-paper2

Answer key ☟

7.0.29 UGC NET CSE | December 2007 | Part 2 | Question: 16

A primary key for an entity is :

A. a candidate key B. any attribute

C. a unique attribute D. a superkey
ugcnetcse-dec2007-paper2

Answer key ☟

7.1 Aggregation (2)

7.1.1 Aggregation: UGC NET CSE | December 2008 | Part 2 | Question: 31

Aggregation is :

A. an abstraction through which relationships are treated as lower level entities

B. an abstraction through which relationships are treated as higher level entities
C. an abstraction through which relationships are not treated at all as entities
D. none of the above

ugcnetcse-dec2008-paper2 databases aggregation

Answer key ☟

7.1.2 Aggregation: UGC NET CSE | July 2016 | Part 3 | Question: 39

Which of the following statements is correct?

A. Aggregation is a strong type of association between two classes with full ownership
B. Aggregation is a strong type of association between two classes with partial ownership
C. Aggregation is a weak type of association between two classes with partial ownership
D. Aggregation is a weak type of association between two classes with full ownership

ugcnetcse-july2016-paper3 databases aggregation

Answer key ☟

7.2 B Tree (2)

7.2.1 B Tree: UGC NET CSE | January 2017 | Part 3 | Question: 12

If following sequence of keys are inserted in a B+ tree with K(=3) pointers:

8, 5, 1, 7, 3, 12, 9, 6
Which of the following shall be correct B+ tree?

A.
 B.

C.

D.

ugcnetcse-jan2017-paper3 databases b-tree

Answer key ☟

7.2.2 B Tree: UGC NET CSE | June 2014 | Part 2 | Question: 22

The upper bound and lower bound for the number of leaves in a B-tree of degree with height is given by :

A. and B. and
C. and D. and
ugcnetcse-june2014-paper2 databases b-tree

Answer key ☟

7.3 B+tree (1)

7.3.1 B+tree: UGC NET CSE | January 2017 | Part 2 | Question: 20

The order of a leaf node in a tree is the maximum number of children it can have. Suppose that block size is
kilobytes, the child pointer takes bytes long and search field value takes bytes long. The order of the leaf
node is _________.

A. B. C. D.
ugcnetjan2017ii databases b+tree

Answer key ☟

7.4 Bcnf Decomposition (1)

7.4.1 Bcnf Decomposition: UGC NET june/August 2024

bcnf-decomposition

7.5 Candidate Key (4)

7.5.1 Candidate Key: UGC NET CSE | January 2017 | Part 3 | Question: 8

Which one is correct w.r.t. RDBMS?

A. primary key super key candidate key

B. primary key candidate key super key
 C. super key candidate key primary key
D. super key primary key candidate key

ugcnetcse-jan2017-paper3 database-normalization candidate-key

Answer key ☟

7.5.2 Candidate Key: UGC NET CSE | July 2016 | Part 2 | Question: 20

Consider the following database table having and as its four attributes and four possible candidate
keys for this table :

If different symbols stand for different values in the table is definitely not equal to then which of the above
could not be the candidate key for the database table?

A. and only B. and only C. only D. only

ugcnetcse-july2016-paper2 databases candidate-key

Answer key ☟

7.5.3 Candidate Key: UGC NET CSE | June 2019 | Part 2 | Question: 35

Which of the following key constraints is required for functioning of foreign key in the context relational
databases?

A. Unique key B. Primary key C. Candidate key D. Check key

ugcnetcse-june2019-paper2 candidate-key

Answer key ☟

7.5.4 Candidate Key: UGC NET CSE | June 2019 | Part 2 | Question: 36

In relational database management, which of the following is/are property/properties of candidate key?
P: Uniqueness
Q: Irreducibility

A. P only B. Q only C. Both P and Q D. Neither P nor Q

ugcnetcse-june2019-paper2 candidate-key

Answer key ☟

7.6 Cardinality Ratio (1)

7.6.1 Cardinality Ratio: UGC NET CSE | December 2013 | Part 2 | Question: 14

Based on the cardinality ratio and participation ______ associated with a relationship type, choose either the
Foreign Key Design, the Cross Referencing Design or Mutual Referencing Design.

A. Entity B. Constraints C. Rules D. Keys

ugcnetcse-dec2013-paper2 databases cardinality-ratio

Answer key ☟

7.7 Circular Queue (1)

 7.7.1 Circular Queue: UGC NET CSE | December 2008 | Part 2 | Question: 34

If else is required in :

A. circular queue
B. linear queue
C. stack
D. deque

ugcnetcse-dec2008-paper2 data-structures circular-queue

Answer key ☟

7.8 Concurrency Control Protocols (1)

7.8.1 Concurrency Control Protocols: UGC NET CSE | December 2009 | Part 2 | Question: 20

Which of the following statement is wrong ?

I. 2-phase locking protocol suffer from dead lock.
II. Time stamp protocol suffer from more aborts.
III. A block hole in a DFD is a data store with only inbound flows.
IV. Multivalued dependency among attribute is checked at 3 NF level.
V. An entity-relationship diagram is a tool to represent event model.

(A) I, II, III

(B) II, III, IV

(C) III, IV, V

(D) II, IV, V

ugcnetcse-dec2009-paper2 concurrency-control-protocols

Answer key ☟

7.9 Conflict Serializable (1)

7.9.1 Conflict Serializable: UGC NET CSE | July 2018 | Part 2 | Question: 65

Consider the following schedules involving two transactions.

Which one of the following statements is correct with respect to above?

A. Both and are conflict serializable

B. Both and are not conflict serializable
C. ​ is conflict serializable and is not conflict serializable​​
D. ​ is not conflict serializable and is conflict serializable​​

ugcnetcse-july2018-paper2 databases transaction-and-concurrency conflict-serializable easy

Answer key ☟

7.10 Crosstabquery (1)

7.10.1 Crosstabquery: UGC NET CSE | September 2013 | Part 2 | Question: 41

Cross_tab displays permit users to view ____ of multidimensional data at a time.

A. One dimension B. Two dimensions
C. Three dimensions D. Multidimensions
 ugcnetsep2013ii databases crosstabquery

Answer key ☟

7.11 Data Dependency (2)

7.11.1 Data Dependency: UGC NET CSE | December 2006 | Part 2 | Question: 18

Which statement is false regarding data independence ?

A. Hierarchical data model suffers from data independence

B. Network model suffers from data independence
C. Relational model suffers only from logical data independence
D. Relational model suffers only from physical data independence

ugcnetcse-dec2006-paper2 databases data-dependency

Answer key ☟

7.11.2 Data Dependency: UGC NET CSE | October 2020 | Part 2 | Question: 14

Consider a relational schema on which the following functional dependencies hold:

Which are the candidate keys among following options?

A.
B.
C.
D.

ugcnetcse-oct2020-paper2 databases data-dependency

Answer key ☟

7.12 Data Integrity (1)

7.12.1 Data Integrity: UGC NET CSE | December 2013 | Part 2 | Question: 15

Data Integrity control uses

A. Upper and lower limits on numeric data

B. Passwords to prohibit unauthorized access to files
C. Data dictionary to keep the data
D. Data dictionary to find last access data

ugcnetcse-dec2013-paper2 databases data-integrity

Answer key ☟

7.13 Data Mining (2)

7.13.1 Data Mining: UGC NET CSE | December 2009 | Part 2 | Question: 47

Analysis of large database to retrieve information is called

(A) OLTP

(B) OLAP

(C) OLDP

(D) OLPP
 ugcnetcse-dec2009-paper2 databases data-mining

Answer key ☟

7.13.2 Data Mining: UGC NET CSE | January 2017 | Part 2 | Question: 47

__________ refers loosely to the process of semi-automatically analyzing large databases to find useful
patterns.

A. Datamining B. Data warehousing C. DBMS D. Data mirroring

ugcnetjan2017ii databases data-mining

Answer key ☟

7.14 Data Model (2)

7.14.1 Data Model: UGC NET CSE | June 2012 | Part 3 | Question: 8, UGCNET-Dec2012-III: 59

Which level of abstraction describes what data are stored in the database?

A. Physical level B. View level

C. Abstraction level D. Logical level
ugcnetcse-june2012-paper3 databases data-model ugcnetcse-dec2012-paper3

Answer key ☟

7.14.2 Data Model: UGC NET CSE | September 2013 | Part 2 | Question: 39

Views are useful for ____ unwanted information, and for collecting together information from more than one
relation into a single view.

A. Hiding B. Deleting C. Highlighting D. All of the above

ugcnetsep2013ii databases data-model

Answer key ☟

7.15 Database Constraints (1)

7.15.1 Database Constraints: UGC NET CSE | December 2013 | Part 2 | Question: 11

The student marks should not be greater than 100. This is

A. Integrity constraint B. Referential constraint
C. Over-defined constraint D. Feasible constraint
databases database-constraints ugcnetcse-dec2013-paper2

Answer key ☟

7.16 Database Design (2)

7.16.1 Database Design: UGC NET CSE | December 2005 | Part 2 | Question: 18

In a relational schema, each tuple is divided in fields called :

A. Relations B. Domains C. Queries D. All the above

ugcnetcse-dec2005-paper2 databases database-design

7.16.2 Database Design: UGC NET CSE | January 2017 | Part 2 | Question: 16

An attribute of datatype varchar has value 'Ram' and the attribute of datatype char has value
'Sita' in oracle. The attribute has ________ memory spaces and has _______ memory spaces.

A. B. C. D.
ugcnetjan2017ii databases database-design
 Answer key ☟

7.17 Database Normalization (23)

7.17.1 Database Normalization: UGC NET CSE | December 2004 | Part 2 | Question: 20

Match the following :

A. i-a, ii-c, iii-b, iv-d B. i-d, ii-c, iii-a, iv-b

C. i-d, ii-c, iii-b, iv-a D. i-a, ii-b, iii-c, iv-d
ugcnetcse-dec2004-paper2 databases database-normalization match-the-following easy

Answer key ☟

7.17.2 Database Normalization: UGC NET CSE | December 2008 | Part 2 | Question: 32

Suppose R is a relation schema and F is a set of functional dependencies on R. Further, suppose R1 and
R2 form a decomposition of R. Then the decomposition is a lossless join decomposition of R provided that:

A. R1∩R2→R1 is in F+
B. R1∩R2→R2 is in F+
C. both R1∩R2→R1 and R1∩R2→R2 functional dependencies are in F+
D. at least one from R1∩R2→R1 and R1∩R2→R2 is in F+

ugcnetcse-dec2008-paper2 databases database-normalization

Answer key ☟

7.17.3 Database Normalization: UGC NET CSE | December 2009 | Part 2 | Question: 18

Match the following :

A. B.
C. D.
ugcnetcse-dec2009-paper2 databases database-normalization match-the-following

Answer key ☟

7.17.4 Database Normalization: UGC NET CSE | December 2009 | Part 2 | Question: 19

A function that has no partial functional dependencies is in __________ form.

(A) 3 NF

(B) 2 NF

(C) 4 NF

(D) BCNF
ugcnetcse-dec2009-paper2 databases database-normalization

Answer key ☟
7.17.5 Database Normalization: UGC NET CSE | December 2010 | Part 2 | Question: 17

The dependency preservation decomposition is a property to decompose database schema D, in which each
functional dependency specified in ,

A. Appeared directly in one of the relation schemas in the decomposed D.

B. Could be inferred from dependencies that appear in some .
C. Both (A) and (B)
D. None of these

ugcnetcse-dec2010-paper2 databases database-normalization

Answer key ☟

7.17.6 Database Normalization: UGC NET CSE | December 2012 | Part 2 | Question: 13

Which of the following is true?

A. A relation in BCNF is always in 3NF B. A relation in 3NF is always in BCNF

C. BCNF and 3NF are same D. A relation in BCNF is not in 3NF
databases ugcnetcse-dec2012-paper2 database-normalization

Answer key ☟

7.17.7 Database Normalization: UGC NET CSE | December 2012 | Part 3 | Question: 63

The third normal form is based on the concept of_____

A. Closure Dependency B. Transitive Dependency

C. Normal Dependency D. Functional Dependency
ugcnetcse-dec2012-paper3 databases database-normalization

Answer key ☟

7.17.8 Database Normalization: UGC NET CSE | December 2013 | Part 3 | Question: 59

Armstrong proposed systematic approach to derive functional dependencies. Match the following w.r.t
functional dependencies:

Codes:

A. B.
C. D.
ugcnetcse-dec2013-paper3 databases database-normalization

Answer key ☟

7.17.9 Database Normalization: UGC NET CSE | December 2014 | Part 2 | Question: 19

The best normal form of relation scheme along with the set of functional dependencies
is

A. Boyce-Codd Normal form B. Third Normal form

C. Second Normal form D. First Normal form
ugcnetcse-dec2014-paper2 databases database-normalization

Answer key ☟
7.17.10 Database Normalization: UGC NET CSE | December 2014 | Part 2 | Question: 20

Identify the minimal key for relational scheme with functional dependencies

A. B. C. D.
ugcnetcse-dec2014-paper2 databases database-normalization

Answer key ☟

7.17.11 Database Normalization: UGC NET CSE | December 2014 | Part 3 | Question: 10

Let is a relational scheme with functional dependency set .

The attribute closures of and are
A. B.
C. D.
ugcnetcse-dec2014-paper3 databases database-normalization

Answer key ☟

7.17.12 Database Normalization: UGC NET CSE | December 2014 | Part 3 | Question: 12

Which of the following is false ?

A. Every binary relation is never be in .

B. Every relation is in .
C. and are based on functional dependencies.
D. Multivalued Dependency is a special case of Join Dependency

ugcnetcse-dec2014-paper3 databases database-normalization

Answer key ☟

7.17.13 Database Normalization: UGC NET CSE | December 2015 | Part 2 | Question: 20

A relation R={A,B,C,D,E,F,G} is given with following set of functional dependencies: F={AD→E, BE→F,
B→C, AF→G}. Which of the following is a candidate key?

A. A B. AB C. ABC D. ABD
ugcnetcse-dec2015-paper2 databases database-normalization

Answer key ☟

7.17.14 Database Normalization: UGC NET CSE | January 2017 | Part 3 | Question: 10

For database relation where the domains of and include only atomic values, only the
following functional dependencies and those that can be inferred from them are:

The relation is in

A. First normal form but not in second normal form

B. Both in first normal form as well as in second normal form
C. Second normal form but not in third normal form.
D. Both in second normal form as well as in third normal form.

ugcnetcse-jan2017-paper3 databases database-normalization

Answer key ☟
7.17.15 Database Normalization: UGC NET CSE | June 2005 | Part 2 | Question: 19

Multi-valued dependency among attribute is checked at which level ?

A. B. C. D.
ugcnetcse-june2005-paper2 database-normalization

Answer key ☟

7.17.16 Database Normalization: UGC NET CSE | June 2010 | Part 2 | Question: 18

Match the following :

A. B.
C. D.
ugcnetcse-june2010-paper2 databases database-normalization

Answer key ☟

7.17.17 Database Normalization: UGC NET CSE | June 2013 | Part 3 | Question: 9

For a database relation R(a, b, c, d) where the domains of a, b, c, d include only the atomic values. The
functional dependency a c, b d holds in the following relation.

A. In 1NF not in 2NF B. In 2NF not in 3NF C. In 3NF D. in 1 NF

ugcnetcse-june2013-paper3 databases database-normalization

Answer key ☟

7.17.18 Database Normalization: UGC NET CSE | June 2014 | Part 2 | Question: 49

Let be a relation schema with the following dependencies , , ,

. Which of the following is a key for ?

A. CD B. EC C. AE D. AC
ugcnetcse-june2014-paper2 databases database-normalization

Answer key ☟

7.17.19 Database Normalization: UGC NET CSE | June 2014 | Part 3 | Question: 22

Consider the following relational schemas for a library database :

Book (Title, Author, Catalog_no, Publisher, Year, Price) Collection(Title, Author, Catalog_no) with the
following functional dependencies :
I. Title, Author Catalog_no
II. Catalog_no Title, Author, Publisher, Year
III. Publisher, Title, Year Price Assume (Author, Title) is the key for both schemas. Which one of the following is
true ?
A. Both Book and Collection are in BCNF. B. Both Book and Collection are in NF.
C. Book is in NF and Collection in NF. D. Both Book and Collection are in NF.
ugcnetjune2014iii databases database-normalization

Answer key ☟
 7.17.20 Database Normalization: UGC NET CSE | June 2019 | Part 2 | Question: 34

In relational databases, if relation R is in BCNF, then which of the following is true about relation R?

A. R is in 4NF B. R is not in 1NF

C. R is in 2NF and not in 3NF D. R is in 2NF and 3NF
ugcnetcse-june2019-paper2 database-normalization

Answer key ☟

7.17.21 Database Normalization: UGC NET CSE | Junet 2015 | Part 3 | Question: 10

The Relation
Vendor Order (V_no, V_ord_no, V_name, Qty_sup, unit_price) is in 2NF because

A. Non_key attribute V_name is dependent on V_no which is part of composite key

B. Non_key attribute V_name is dependent on Qty_sup
C. Key attribute Qty_sup is dependent on primary key unit_price
D. Key attribute V_ord_no is dependent on primary key unit_price

ugcnetcse-june2015-paper3 databases database-normalization

Answer key ☟

7.17.22 Database Normalization: UGC NET CSE | November 2017 | Part 3 | Question: 9

If every non-key attribute is functionally dependent on the primary key, then the relation is in ________

A. First normal form B. Second normal form

C. Third normal form D. Fourth normal form
ugcnetcse-nov2017-paper3 database-normalization

Answer key ☟

7.17.23 Database Normalization: UGC NET CSE | October 2022 | Part 1 | Question: 53

Match List I with List II :

Choose the correct answer from the options given below:

A. B.
C. D.
ugcnetcse-oct2022-paper1 database-normalization

Answer key ☟

7.18 Decomposition (3)

7.18.1 Decomposition: UGC NET CSE | August 2016 | Part 3 | Question: 10

Consider the table with attributes and . The functional dependencies that hold on are :
. Which of the following statements is/are True ?
I. The decomposition of into and is lossless.
II. The decomposition of into and is lossy.

A. Only B. Only C. Both and D. Neither nor

 ugcnetcse-aug2016-paper3 databases database-normalization decomposition

Answer key ☟

7.18.2 Decomposition: UGC NET CSE | December 2012 | Part 3 | Question: 56

If a relation with a Schema R is decomposed into two relations and such that then
which one of the following is to be satisfied for a lossless joint decomposition ( indicates functional
independency)

A.
B.
C.
D.

ugcnetcse-dec2012-paper3 databases decomposition

Answer key ☟

7.18.3 Decomposition: UGC NET CSE | Junet 2015 | Part 3 | Question: 11

The relation schemas and form a Lossless join decomposition of if and only if

i.
ii.
iii.
iv.
A. happen B. happen
C. happen D. happen
ugcnetcse-june2015-paper3 databases decomposition database-normalization

Answer key ☟

7.19 Dependency Preserving (1)

7.19.1 Dependency Preserving: UGC NET CSE | January 2017 | Part 2 | Question: 19

Consider a schema and functional dependencies . Then the decomposition of

into and is __________.

A. Dependency preserving but not lossless join

B. Dependency preserving and lossless join
C. Lossless join but not dependency preserving
D. Neither dependency preserving nor lossless join.

ugcnetjan2017ii databases dependency-preserving

Answer key ☟

7.20 Distributed Database (2)

7.20.1 Distributed Database: UGC NET CSE | August 2016 | Part 3 | Question: 8

The Global conceptual Schema in a distributed database contains information about global relations. The
condition that all the data of the global relation must be mapped into the fragments, that is, it must not happen
that a data item which belongs to a global relation does not belong to any fragment, is called :
A. Disjointness condition B. Completeness condition
C. Reconstruction condition D. Aggregation condition
ugcnetcse-aug2016-paper3 databases distributed-database

Answer key ☟
 7.20.2 Distributed Database: UGC NET CSE | July 2016 | Part 3 | Question: 8

In distributed databases, location transparency allows for database users, programmers and administratirs to
treat the data as if it is at one location, A SQL query with location transparency needs to specify

A. Inheritances B. Fragments C. Locations D. Local formats

ugcnetcse-july2016-paper3 databases distributed-database

Answer key ☟

7.21 ER Diagram (18)

7.21.1 ER Diagram: UGC NET CSE | August 2016 | Part 2 | Question: 19

Consider the following Entity-Relationship diagram and three possible relationship sets I, II and
III) for this diagram:

If different symbols stand for different values (e.g., is definitely not equal to ), then which of the above could not
be the relationship set for the diagram ?

A. I only B. I and II only

C. II only D. I, II and III
ugcnetcse-aug2016-paper2 databases er-diagram

Answer key ☟

7.21.2 ER Diagram: UGC NET CSE | December 2008 | Part 2 | Question: 30

An entity has:
(i) a set of properties
(ii) a set of properties and values for all the properties
(iii) a set of properties and the values for some set of properties may non-uniquely identify an entity
(iv) a set of properties and the values for some set of properties may uniquely identify an entity
Which of the above are valid?

A. (i) only
B. (ii) only
C. (iii) only
D. (iv) only

ugcnetcse-dec2008-paper2 databases er-diagram

Answer key ☟
7.21.3 ER Diagram: UGC NET CSE | December 2009 | Part 2 | Question: 16

The E-R model is expressed in term of

I. Entities
II. The relationship among entities.
III. The attributes of the entities.
IV. Functional relationship.

(A) I, II

(B) I, II, IV

(C) II, II, IV

(D) I, II, III

ugcnetcse-dec2009-paper2 databases er-diagram

Answer key ☟

7.21.4 ER Diagram: UGC NET CSE | December 2009 | Part 2 | Question: 17

Specialization is __________ process.

(A) top-down

(B) bottom up

(C) both (A) and (B)

(D) none of these

ugcnetcse-dec2009-paper2 databases er-diagram

Answer key ☟

7.21.5 ER Diagram: UGC NET CSE | December 2010 | Part 2 | Question: 16

In generalisation, the differences between members of an entity is

A. Maximized B. Minimized C. Both (A) & (B) D. None of these

ugcnetcse-dec2010-paper2 databases er-diagram

Answer key ☟

7.21.6 ER Diagram: UGC NET CSE | December 2013 | Part 2 | Question: 13

An E-R model includes

I. An ER diagram portraying entity types.

II. Attributes for each entity type.
III. Relationships among entity types.
IV. Semantic integrity constrains that reflects the business rules about data not captured in the ER diagram
A. I, II, III and IV B. I and IV C. I, II and IV D. I and III
ugcnetcse-dec2013-paper2 databases er-diagram

Answer key ☟

7.21.7 ER Diagram: UGC NET CSE | December 2013 | Part 3 | Question: 55

Consider the following ER diagram:

 The minimum number of tables required to represent is

A. 2 B. 3 C. 4 D. 5
ugcnetcse-dec2013-paper3 databases er-diagram

Answer key ☟

7.21.8 ER Diagram: UGC NET CSE | December 2013 | Part 3 | Question: 57

Find the false statement:

A. The relationship construct known as the weak relationship type was defined by Dey, Storey & Barron (1999)
B. A weak relationship occurs when two relationship types are linked by either Event- Precedent sequence
or Condition- recedent sequence.
C. Conceptual model is not accurate representation of “Universe of interest”.
D. Ternary, Quaternary and Quintary relationships are shown through a series of application scenario’s and vignette’s.

ugcnetcse-dec2013-paper3 databases er-diagram

Answer key ☟

7.21.9 ER Diagram: UGC NET CSE | December 2014 | Part 2 | Question: 18

What kind of mechanism is to be taken into account for converting a weak entity set into strong entity set in
entity-relationship diagram

A. Generalization B. Aggregation
C. Specialization D. Adding suitable attributes
ugcnetcse-dec2014-paper2 databases er-diagram

Answer key ☟

7.21.10 ER Diagram: UGC NET CSE | December 2014 | Part 3 | Question: 38

How to express that some person keeps animals as pets?

A.

B.

C.

D.

ugcnetcse-dec2014-paper3 databases er-diagram

Answer key ☟
7.21.11 ER Diagram: UGC NET CSE | December 2019 | Part 2 | Question: 23

Find minimum number of tables required for converting the following entity relationship diagram into relational
database?

A. B. C. D.
ugcnetcse-dec2019-paper2 er-diagram

Answer key ☟

7.21.12 ER Diagram: UGC NET CSE | January 2017 | Part 2 | Question: 18

Let and be two entities in an diagram with simple single value attributes. and are two
relationship between and , where as , is one-to-many and , is many-to-many.
The minimum number of tables required to represent , and , in the relational model are ___________.

A. B. C. D.
ugcnetjan2017ii databases er-diagram

Answer key ☟

7.21.13 ER Diagram: UGC NET CSE | July 2018 | Part 2 | Question: 64

Relations produced from E-R Model will always be in _____

A. 1 NF B. 2 NF C. 3 NF D. 4 NF
databases er-diagram database-normalization ugcnetcse-july2018-paper2

Answer key ☟

7.21.14 ER Diagram: UGC NET CSE | June 2010 | Part 2 | Question: 16

An entity instance is a single occurrence of an ______.

A. Entity type B. Relationship type

C. Entity and relationship type D. None of these
ugcnetcse-june2010-paper2 databases er-diagram

Answer key ☟

7.21.15 ER Diagram: UGC NET CSE | Junet 2015 | Part 2 | Question: 49

Which of the following statements is false about weak entity set?

A. Weak entities can be deleted automatically when their strong entity is deleted
B. Weak entity set avoids the data duplication and consequent possible inconsistencies caused by duplicating the key of
the string entity
C. A weak entity set has no primary keys unless attributes of the strong entity set on which it depends are included
 D. Tuples in a weak entity set are not partitioned according to their relationship with tuples with a strong entity set

ugcnetcse-june2015-paper2 er-diagram databases

Answer key ☟

7.21.16 ER Diagram: UGC NET CSE | Junet 2015 | Part 3 | Question: 7

Let and be two entities in E-R diagram with simple single valued attributes. and are two
relationships between and where is one-many and is many-many. and do not have any
attribute of their own. How many minimum number of tables are required to represent this situation in the Relational
Model?

A. 4 B. 3 C. 2 D. 1
databases er-diagram ugcnetcse-june2015-paper3

Answer key ☟

7.21.17 ER Diagram: UGC NET CSE | September 2013 | Part 3 | Question: 48

Match the following

A. B.
C. D.
ugcnetcse-sep2013-paper3 databases er-diagram match-the-following easy

Answer key ☟

7.21.18 ER Diagram: UGC NET CSE | September 2013 | Part 3 | Question: 49

Match the following:

i. One to One Relationship

a.

ii. Relationship
b.
iii. Many to Many Relationship
c.

d. iv. Many to One Relationship

A. a-iii, b-iv, c-ii, d-i B. a-iv, b-iii, c-ii, d-i

C. a-ii, b-iii, c-iv, d-i D. a-iii, b-iv, c-i, d-ii
ugcnetcse-sep2013-paper3 databases er-diagram match-the-following easy

Answer key ☟

7.22 Enhanced ER Model (1)

7.22.1 Enhanced ER Model: UGC NET CSE | June 2014 | Part 3 | Question: 23

Specialization Lattice stands for

 A. An entity type can participate as a subclass in only one specialization.
B. An entity type can participate as a subclass in more than one specialization.
C. An entity type that can participate in one specialization.
D. An entity type that can participate in one generalization.

ugcnetjune2014iii databases enhanced-er-model

Answer key ☟

7.23 File System (1)

7.23.1 File System: UGC NET CSE | Junet 2015 | Part 2 | Question: 19

Database application were directly built on top of file system to overcome the following drawbacks of using
file-systems:

i. Data redundancy and inconsistency

ii. Difficulty in accessing data
iii. Data isolation
iv. Integrity problems

A. B. C. D.
ugcnetcse-june2015-paper2 databases file-system

Answer key ☟

7.24 Functional Dependency (1)

7.24.1 Functional Dependency: UGC NET CSE | January 2017 | Part 3 | Question: 9

Let denotes primary key of relation . A many-to-one relationship that exists between two relations
and can be expressed as follows:
A. B.
C. D.
ugcnetcse-jan2017-paper3 databases functional-dependency database-normalization

Answer key ☟

7.25 Generalization (1)

7.25.1 Generalization: UGC NET CSE | June 2010 | Part 2 | Question: 17

Generalization is _______ process.

A. Top-down B. Bottom up C. Both (A) & (B) D. None of these

ugcnetcse-june2010-paper2 databases generalization

Answer key ☟

7.26 Granularity (1)

7.26.1 Granularity: UGC NET CSE | June 2012 | Part 3 | Question: 4

What is Granularity?

A. The size of database B. The size of data item

C. The size of record D. The size of file
ugcnetcse-june2012-paper3 databases granularity

Answer key ☟

7.27 Hierarchical Database (1)

 7.27.1 Hierarchical Database: UGC NET CSE | July 2018 | Part 2 | Question: 63

In a Hierarchical database, a hashing function is used to locate the ____

A. Collision B. Root C. Foreign Key D. Records

ugcnetcse-july2018-paper2 databases hierarchical-database

Answer key ☟

7.28 Indexing (1)

7.28.1 Indexing: UGC NET CSE | June 2014 | Part 2 | Question: 48

A clustering index is created when _______.

A. Primary key is declared and ordered B. No key ordered

C. Foreign key ordered D. There is no key and no order
ugcnetcse-june2014-paper2 databases indexing

Answer key ☟

7.29 Java (1)

7.29.1 Java: UGC NET CSE | December 2012 | Part 2 | Question: 22

In DML, RECONNCT command cannot be used with

A. OPTIONAL Set B. FIXED Set C. MANDATOR Set D. All of the above

ugcnetcse-dec2012-paper2 programming java bad-question

Answer key ☟

7.30 Joins (2)

7.30.1 Joins: UGC NET CSE | December 2015 | Part 3 | Question: 63

Consider the following three tables and In this question, all the join operations are natural joins .
is the projection operation of a relation:

Possible answer tables for this question are also given as below:
 A. (a) B. (b) C. (c) D. (d)
ugcnetcse-dec2015-paper3 databases joins

Answer key ☟

7.30.2 Joins: UGC NET CSE | July 2018 | Part 2 | Question: 61

In RDBMS, which type of Join returns all rows that satisfy the join condition?

A. Inner Join B. Outer Join

C. Semi Join D. Anti Join
ugcnetcse-july2018-paper2 databases rdbms joins

Answer key ☟

7.31 Object Oriented Database (2)

7.31.1 Object Oriented Database: UGC NET CSE | December 2015 | Part 3 | Question: 58

Which of the following statements regarding the features of the object-oriented approach to databases are true?

i. The ability to develop more realistic models of the real world

ii. The ability to represent the world in a non-geometric way
iii. The ability to develop databases using natural language approaches
iv. The need to split objects into their component parts
v. The ability to develop database models based on location rather than state and behaviour
A. B.
C. D.
ugcnetcse-dec2015-paper3 databases object-oriented-database

Answer key ☟

7.31.2 Object Oriented Database: UGC NET CSE | July 2016 | Part 3 | Question: 7

Which of the following statements concerning Object-oriented database is false?

A. Objects in object-oriented databse contain not only data but also methods for processing the data
B. Object-oriented database store computational instructions in the same place as the data
C. Object-oriented database are mmore adapt at handling structured (analytical) data than relational databases
D. Object-oriented databases store more types of data than relational databases and access that data faster

ugcnetcse-july2016-paper3 databases object-oriented-database

7.32 Protocol (1)

7.32.1 Protocol: UGC NET CSE | June 2014 | Part 3 | Question: 27, UGCNET-June2015-II: 17

Which of the following concurrency protocol ensues both conflict serializability and freedom from deadlock:

I. -phase locking
II. Time phase ordering

A. Both I & II B. II only C. I only D. Neither I nor II

 ugcnetjune2014iii databases concurrency protocol ugcnetcse-june2015-paper2

Answer key ☟

7.33 Question Fixed (1)

7.33.1 Question Fixed: UGC NET CSE | June 2023 | Part 2: 19

Let be a relational schema with following functional dependencies:

. Which of the following is a key for ?

A. B. C. D.
ugcnetcse-june2023-paper2 database-normalization question-fixed

Answer key ☟

7.34 Rdbms (8)

7.34.1 Rdbms: UGC NET CSE | July 2016 | Part 2 | Question: 16

In RDBMS, the constraint that no key attribute (column) may be NULL is referred to as:
A. Referential integrity B. Multi-valued dependency
C. Entity integrity D. Functional dependency
ugcnetcse-july2016-paper2 databases rdbms sql

Answer key ☟

7.34.2 Rdbms: UGC NET CSE | July 2016 | Part 2 | Question: 18

In a relational database model, NULL values canbe used for all but which one of the following?

A. To allow duplicate tuples in the table by filling the primary key column(s) with NULL
B. To avoid confusion with actual legitimate data values like 0 (zero) or integer columns and " (the empty string) for
string columns
C. To leave columns in a tuple marked as "unknown" when the actual value is unknown
D. To fill a column in a tuple when that column does not really "exist" for that particular tuple

ugcnetcse-july2016-paper2 rdbms sql databases

Answer key ☟

7.34.3 Rdbms: UGC NET CSE | July 2018 | Part 2 | Question: 62

Consider a relation book (title, price) which contains the titles and prices of different books. Assuming that no
two books have the same price, what does the following SQL query?
Select title
from book as B
where (select count(*)
from book as T
where T.price > B. price < 7

A. Titles of the six most expensive books

B. Title of the sixth most expensive books
C. Titles of the seven most expensive books
D. Title of the seventh most expensive books

ugcnetcse-july2018-paper2 databases rdbms sql

Answer key ☟
7.34.4 Rdbms: UGC NET CSE | July 2018 | Part 2 | Question: 66

For a database relation where the domains of a, b, c and d include only atomic values and only the
following functional dependencies and those that can be inferred from them hold:

The relation is in ____

A. First normal form but not in second normal form B. Second normal form but not in third normal form
C. Third normal form D. BCNF
ugcnetcse-july2018-paper2 databases rdbms

Answer key ☟

7.34.5 Rdbms: UGC NET CSE | July 2018 | Part 2 | Question: 67

A many-to-one relationship exists between entity sets and . How will it be represented using functional
dependencies if denotes the primary key attribute of relation ?

A. B.
C. D.
ugcnetcse-july2018-paper2 databases rdbms

Answer key ☟

7.34.6 Rdbms: UGC NET CSE | June 2013 | Part 3 | Question: 34

Horn clauses are special kinds of propositions which can be described as

A. Single atomic proposition on left side

B. Single or multiple atomic proposition on left side
C. A single atomic proposition on left side and a single atomic proposition on right side
D. A single atomic proposition on left side or an empty left side

ugcnetcse-june2013-paper3 databases rdbms

Answer key ☟

7.34.7 Rdbms: UGC NET CSE | June 2013 | Part 3 | Question: 7

The “PROJECT” operator of a relational algebra creates a new table that has always

A. More columns than columns in original table

B. More rows than original table
C. Same number of rows as the original table
D. Same number of columns as the original table

ugcnetcse-june2013-paper3 databases rdbms

Answer key ☟

7.34.8 Rdbms: UGC NET CSE | November 2017 | Part 3 | Question: 10

Consider a relation where each attribute is atomic, and following functional

dependencies exist.
 The relation is ________
A. In but not in B. In but not in
C. In but not in D. In
ugcnetcse-nov2017-paper3 databases rdbms database-normalization

Answer key ☟

7.35 Recovery From Failure (1)

7.35.1 Recovery From Failure: UGC NET CSE | December 2014 | Part 3 | Question: 09

_________ rules used to limit the volume of log information that has to be handled and processed in the event of
system failure involving the loss of volatile information.

A. Write-ahead log B. Check-pointing

C. Log buffer D. Thomas
ugcnetcse-dec2014-paper3 databases transaction-and-concurrency recovery-from-failure

Answer key ☟

7.36 Referential Integrity (3)

7.36.1 Referential Integrity: UGC NET CSE | December 2012 | Part 3 | Question: 70

Referential integrity is directly related to

A. Relation key B. Foreign key C. Primary key D. Candidate key

ugcnetcse-dec2012-paper3 databases relational-model referential-integrity candidate-key

Answer key ☟

7.36.2 Referential Integrity: UGC NET CSE | June 2019 | Part 2 | Question: 39

Following table has two attributes Employee_id and Manager_id, where Employee_id is a primary key and
manager_id is a foreign key referencing Employee_id with on-delete cascade:

On deleting the table , the set of other tuples that must be deleted to maintain the referential integrity of table is

A. only B. and only

C. only D. and only
ugcnetcse-june2019-paper2 referential-integrity

Answer key ☟

7.36.3 Referential Integrity: UGC NET CSE | September 2013 | Part 3 | Question: 24

____ constraints ensure that a value that appears in one relation for a given set of attributes also appears for a
certain set of attributes in another relation.
A. Logical Integrity B. Referential Integrity
C. Domain Integrity D. Data Integrity
ugcnetcse-sep2013-paper3 databases referential-integrity

Answer key ☟
7.37 Relation (1)

7.37.1 Relation: UGC NET CSE | July 2018 | Part 2 | Question: 69

Let and be two relations in which a is the foreign key of that refers to the primary key
of . Consider the following four options.
a. Insert into b. Insert into
c. Delete from d. Delete from
Which of the following is correct about the referential integrity constraint with respect to above?

A. Operations a and b will cause violation B. Operations b and c will cause violation
C. Operations c and d will cause violation D. Operations d and a will cause violation
ugcnetcse-july2018-paper2 databases relation

Answer key ☟

7.38 Relational Algebra (3)

7.38.1 Relational Algebra: UGC NET CSE | December 2013 | Part 3 | Question: 56

Consider the following schemas:

Branch=(Branch-name, Assets, Branch-city)
Customer = (Customer-name, Bank name, Customer-city)
Borrow = (Branch-name, Loan number, Customer account-number)
Deposit = (Branch-name, Account-number, Customer-name, Balance)
Using relational Algebra, the Query that finds customers who have balance more than 10,000 is _____

A. )
B. )
C. )
D. )

ugcnetcse-dec2013-paper3 databases relational-algebra

Answer key ☟

7.38.2 Relational Algebra: UGC NET CSE | July 2016 | Part 3 | Question: 9

Consider the relations and and the following four relational algebra queries over R ans S

I.
II.
III.
IV. where refers to the column B in table R

One can determine that:

A. I, III and IV are the same query B. II, III and IV are the same query
C. I, II and IV are the same query D. I, II and III are the same query
ugcnetcse-july2016-paper3 databases relational-algebra

Answer key ☟

7.38.3 Relational Algebra: UGC NET CSE | June 2019 | Part 2 | Question: 33

With respect to relational algebra, which of the following operations are included from mathematical set theory?

i. Join
ii. Intersection
iii. Cartisian product
iv. Project
 A. i and iv B. ii and iii C. iii and iv D. ii and iv
ugcnetcse-june2019-paper2 relational-algebra

Answer key ☟

7.39 Relational Calculus (2)

7.39.1 Relational Calculus: UGC NET CSE | June 2019 | Part 2 | Question: 31

Which of the following has same expressive power with regard to relational query language?

i. Rational algebra and domain relational calculus

ii. Relational algebra and tuples relational calculus
iii. Relational algebra and domain relational calculus restricted to safe expression
iv. Relational algebra and tuples relational calculus restricted to safe expression

A. i and ii only B. iii and iv only C. i and iii only D. ii and iv only
ugcnetcse-june2019-paper2 relational-calculus

Answer key ☟

7.39.2 Relational Calculus: UGC NET CSE | September 2013 | Part 3 | Question: 47

Consider the following schemas:

Branch_Schema = (branch_name, assets, city)
Customer_Schema = (customer_name, street, city)
Deposit_Schema = (branch_name, account_number, customer_name, balance)
Borrow_Schema = (branch_name, loan_number, customer_name, amount)
Which of the following tuple relational calculus finds all customers who have loan amount more than Rs. 12, 0000?

A. {t(customer_name) t borrow[?] t[amount] > 12000 }

B. {t t(customer_name) t borrow[?] t[amount] > 12000 }
C. { t [?] borrow (t(customer_name)=s(customer_name))[?][amount]>12000}
D. { t [?] borrow(t(customer_name)[?] s[amount] > 12000}

ugcnetcse-sep2013-paper3 databases relational-calculus

7.40 Relational Model (2)

7.40.1 Relational Model: UGC NET CSE | June 2019 | Part 2 | Question: 32

Which of the following features is supported in the rational database model?

A. Complex data-types B. Multivalued attributes

C. Associations with multiplicities D. Generalization relationships
ugcnetcse-june2019-paper2 relational-model

Answer key ☟

7.40.2 Relational Model: UGC NET CSE | October 2020 | Part 2 | Question: 67

Match with
 Choose the correct answer from the options given below:

A. B.
C. D.
ugcnetcse-oct2020-paper2 databases relational-model

Answer key ☟

7.41 Relational Schema (1)

7.41.1 Relational Schema: UGC NET CSE | November 2017 | Part 3 | Question: 12

Consider a schema and following functional dependencies.

Then decomposition of into , and is ________

A. Dependency preserving and lossless join B. Lossless join but dependency preserving
C. Dependency preserving but not lossless join D. Not dependency preserving and not lossless join
ugcnetcse-nov2017-paper3 databases relational-schema rdbms

Answer key ☟

7.42 SQL (33)

7.42.1 SQL: UGC NET CSE | August 2016 | Part 2 | Question: 20

Consider a database table with attributes and . Which of the following queries is illegal ?
A. SELECT A FROM R; B. SELECT A, COUNT(*) FROM R;
C. SELECT A, COUNT(*) FROM R GROUP BY A; D. SELECT A, B, COUNT(*) FROM R GROUP BY A, B;
ugcnetcse-aug2016-paper2 databases sql

Answer key ☟

7.42.2 SQL: UGC NET CSE | August 2016 | Part 3 | Question: 11

Consider the following ORACLE relations :

One
Two
Consider the following two queries and :
SQ1 :
SELECT * FROM One)
 EXCEPT
(SELECT * FROM Two);
SQ2 :
SELECT * FROM One)
EXCEPT ALL
(SELECT * FROM Two);
For each of the SQL queries, what is the cardinality (number of rows) of the result obtained when applied to the
instances above ?
A. 2 and 1 respectively B. 1 and 2 respectively
C. 2 and 2 respectively D. 1 and 1 respectively
ugcnetcse-aug2016-paper3 databases sql

Answer key ☟

7.42.3 SQL: UGC NET CSE | December 2011 | Part 2 | Question: 21

What deletes the entire file except the file structure ?

A. ERASE B. DELETE C. ZAP D. PACK

ugcnetcse-dec2011-paper2 databases sql

Answer key ☟

7.42.4 SQL: UGC NET CSE | December 2011 | Part 2 | Question: 22

Which command classes text file, which has been created using "SET ALTERNATIVE" "Command" ?

A. SET ALTERNATE OFF B. CLOSE DATABASE

C. CLOSE ALTERNATE D. CLEAR ALL
ugcnetcse-dec2011-paper2 databases sql

7.42.5 SQL: UGC NET CSE | December 2011 | Part 2 | Question: 24

Which of the following statements is true, when structure of database file with 20 records is modified ?

A. ? EOF ( ) Prints. T B. ? BOF ( ) Prints F

C. ? BOF ( ) Prints T D. ? EOF ( ) Prints F
ugcnetcse-dec2011-paper2 databases sql

Answer key ☟

7.42.6 SQL: UGC NET CSE | December 2011 | Part 2 | Question: 25

The Expression Select distinct . branch name from branch , branch where . assets . assets and
. branch-city = DELHI, finds the name of

A. All branches that have greater asset than any branch located in DELHI.
B. All branches that have greater assets than allocated in DELHI.
C. The branch that has the greatest asset in DELHI.
D. Any branch that has greater asset than any branch located in DELHI.

ugcnetcse-dec2011-paper2 databases sql

Answer key ☟

7.42.7 SQL: UGC NET CSE | December 2012 | Part 2 | Question: 50

Given a Relation POSITION (Posting-No, Skill), then the query to retrieve all distinct pairs of posting-nos.
requiring skill is

A. Select p.posting-No, p.posting-No from position p where p.skill=p.skill and p.posting-No < p.posting-No
 B. Select p .posting-No, p .posting-No from position p , position p where p .skill=p .skill
C. Select p .posting-No, p .posting-No from position p , position p where p .skill=p .skill and p .posting.No < p
.posting-No
D. Select p .posting-No, p .posting-No from position p , position p where p .skill=p .skill and p .posting.No = p
.posting-No

ugcnetcse-dec2012-paper2 databases sql

Answer key ☟

7.42.8 SQL: UGC NET CSE | December 2013 | Part 3 | Question: 58

Consider the table student (stuid, name, course, marks). Which one of the following two queries is correct to
find the highest marks student in course 5?
Q.1. Select S.stuid from student S where not exist (select * from student e where e course ='5' and e marks s marks)
Q.2. select s.stu.id From student S where s.marks > any (select distinct marks from student S where s.course =5)

A. Q.1 B. Q.2 C. Both Q.1 and Q.2 D. Neither Q.1 nor Q.2
ugcnetcse-dec2013-paper3 databases sql

Answer key ☟

7.42.9 SQL: UGC NET CSE | December 2014 | Part 2 | Question: 16

Division operation is ideally suited to handle queries of the type :

A. Customers who have no account in any of the branches in Delhi.

B. Customers who have an account at all branches in Delhi.
C. Customers who have an account in atleast one branch in Delhi.
D. Customers who have only joint account in any one branch in Delhi

ugcnetcse-dec2014-paper2 databases sql

Answer key ☟

7.42.10 SQL: UGC NET CSE | December 2014 | Part 2 | Question: 17

Which of the following is true ?

I. Implementation of self-join is possible in SQL with table alias.
II. Outer-join operation is basic operation in relational algebra.
III. Natural join and outer join operations are equivalent.

A. and are correct. B. and are correct.

C. Only is correct. D. Only is correct.
ugcnetcse-dec2014-paper2 databases sql

Answer key ☟

7.42.11 SQL: UGC NET CSE | December 2015 | Part 2 | Question: 13

Consider a "CUSTOMERS" database table having a column "CITY" filled with all the names of Indian cities (in
capital letters). The SQL statement that finds all cities that have "GAR" somewhere in its name, is:
A. select * from customers where city='%GAR%';

B. select * from customers where city='$GAR$';

C. select * from customers where city like '%GAR%';

D. select * from customers where city as'%GAR';

ugcnetcse-dec2015-paper2 databases sql

 Answer key ☟

7.42.12 SQL: UGC NET CSE | December 2015 | Part 3 | Question: 59

Consider the following database table:

Create table test(

one integer,
two integer,
primary key(one),
unique(two),
check(one>=1 and <=10),
check (two>=1 and <=5)
);

How many data records/tuples atmost can this table contain?

A. B. C. D.
ugcnetcse-dec2015-paper3 databases sql

Answer key ☟

7.42.13 SQL: UGC NET CSE | December 2015 | Part 3 | Question: 60

Suppose ORACLE relation currently has tuples and relation currently has
.Consider the following two SQL queries SQ1 and SQ2:
SQ1: Select * From R Full Join S On R.B=S.B;
SQ2: Select * From R Inner Join S On R.B=S.B;

The numbers of tuples in the result of the SQL query SQ1 and the SQL query SQ2 are given by:
A. and respectively B. and respectively
C. and respectively D. and respectively
ugcnetcse-dec2015-paper3 databases sql

Answer key ☟

7.42.14 SQL: UGC NET CSE | December 2015 | Part 3 | Question: 61

Consider the following three SQL queries (Assume the data in the people table):

i. Select Name from people where ;

ii. Select Name from people where ;
iii. Select Name from people where or ;

If the SQL queries and above, return rows and rows in the result set respectively, then what is one possible
number of rows returned by the SQL query ?

A. B. C. D.
ugcnetcse-dec2015-paper3 databases sql

Answer key ☟

7.42.15 SQL: UGC NET CSE | December 2019 | Part 2 | Question: 22

Given two tables

EMPLOYEE (EID, ENAME, DEPTNO)
DEPARTMENT (DEPTNO, DEPTNAME)

Find the most appropriate statement of the given query:

Select count (*) ‘total’
from EMPLOYEE
where DEPTNO IN (D1,D2)
 group by DEPTNO
having count (*) >5

A. Total number of employees in each department and

B. Total number of employees of department and if their total is
C. Display total number of employees in both departments and
D. The output of the query must have at least two rows

ugcnetcse-dec2019-paper2 sql

Answer key ☟

7.42.16 SQL: UGC NET CSE | January 2017 | Part 2 | Question: 17

Integrity constraints ensure that changes made to the database by authorized users do not result into loss of data
consistency. Which of the following statement(s) is (are) true w.r.t.the examples of integrity constraints?

i. An instructor Id. No. cannot be null, provided Instructor Id No. being primary key.
ii. No two citizens have same Adhar-ld.
iii. Budget of a company must be zero.

A. a, b and c are true. B. a false, b and c are true.

C. a and b are true; c false. D. a,b and c are false.
ugcnetjan2017ii databases sql

Answer key ☟

7.42.17 SQL: UGC NET CSE | January 2017 | Part 3 | Question: 11

Consider the following relation:

Works(emp_name, company_name,salary)

Here,emp name is primary key.

Consider the following SQL query
Select emp name
From works T
where salary > (select avg(salary)
from works S
where T. company name =
S. company name)

The above query is for following:

A. Find the highest paid employee who earns more than the average salary of all employees of his company.
B. Find the highest paid employee who earns more than the average salary of all the employees of all the companies.
C. Find all employees who earn more than the average salary of all employees all the companies.
D. Find all employees who earn more than the average salary of all employees of their company.

ugcnetcse-jan2017-paper3 databases sql

Answer key ☟

7.42.18 SQL: UGC NET CSE | July 2016 | Part 2 | Question: 19

Consider the following two comments C1 and C2 on the relation R from an SQL database:
C1 : drop table R;
C2 : delete from R

I. Both C1 and C2 delete the schema R

II. C2 retains relation R, but delets all tuples in R
III. C1 deletes not only all tuples, but also the schema for R
A. I only B. I and II only C. II and III only D. I, II and III only
 ugcnetcse-july2016-paper2 databases sql

Answer key ☟

7.42.19 SQL: UGC NET CSE | July 2016 | Part 3 | Question: 11

Consider the following ORACLE relations:

R(A, B, C)={<1, 2, 3>, <1, 2, 0>, <1, 3, 1>, <6, 2, 3>, <1, 4, 2>, <3, 1, 4>}
S(B, C, D)={<2, 3, 7>, <1, 4, 5>, <1, 2, 3>, <2, 3, 4>, <3, 1, 4>}
Consider teh following two SQL queries:
SQ ; SELECT R.B, AVG(S.B) FROM R, S WHERE R.A=S.C AND S.D<7 GROUP BY R.B
SQ : SELECT DISTINCT S.B, MIN(S-C) FROM S GROUP BY S.B HAVING COUNT (DISTINCT S.D)>1;
If M is the number of tuples returned by SQ and If N is the number of tuples returned by SQ then

A. M=4, N=2 B. M=5, N=3 C. M=2, N=2 D. M=3, N=3

ugcnetcse-july2016-paper3 databases sql

Answer key ☟

7.42.20 SQL: UGC NET CSE | June 2010 | Part 2 | Question: 19

Which data management language component enabled the DBA to define the schema components ?

A. DML B. Sub-schema DLL C. Schema DLL D. All of these

ugcnetcse-june2010-paper2 databases sql

Answer key ☟

7.42.21 SQL: UGC NET CSE | June 2010 | Part 2 | Question: 20

The PROJECT Command will create new table that has

A. More fields than the original table B. More rows than original table
C. Both (A) & (B) D. None of these
ugcnetcse-june2010-paper2 databases sql

Answer key ☟

7.42.22 SQL: UGC NET CSE | June 2013 | Part 3 | Question: 8

The employee information of an organization is stored in a relation: Employee (name, sex, salary, deptname).
Consider the following SQL query:
Select deptname from Employee where sex=’M’ group by dept name having
avg (salary) > {select avg (salary) from Employee}

Output of the given query corresponds to

A. Average salary of employee more than average salary of the organization

B. Average salary of employee less than average salary of the organization
C. Average salary of employee equal to average salary of the organization
D. Average salary of male employees in a department is more than average salary of the organization

ugcnetcse-june2013-paper3 databases sql

Answer key ☟

7.42.23 SQL: UGC NET CSE | June 2019 | Part 2 | Question: 37

Which of the following statements are DML statements?

a. Update [tablename] b. Delete [tablename] c. Select * from [tablename]

 Set [columnname]=VALUE

A. a and b B. a and d C. a, b and c D. b and c

ugcnetcse-june2019-paper2 sql

Answer key ☟

7.42.24 SQL: UGC NET CSE | Junet 2015 | Part 2 | Question: 16

An Assertion is predicate expressing a condition we wish database to always satisfy. The correct syntax for
Assertion is:
A. CREATE ASSERTION 'ASSERTION Name' CHECK 'Predicate'
B. CREATE ASSERTION 'ASSERTION Name'
C. CREATE ASSERTION, CHECK 'Predicate'
D. SELECT ASSERTION

ugcnetcse-june2015-paper2 databases sql

Answer key ☟

7.42.25 SQL: UGC NET CSE | Junet 2015 | Part 2 | Question: 18

Drop Table cannot be used to drop a Table referenced by _______ constraint

a. Primary key b. Sub key c. Super key d. Foreign key

A. a B. a, b and c C. d D. a and d
ugcnetcse-june2015-paper2 databases sql

Answer key ☟

7.42.26 SQL: UGC NET CSE | Junet 2015 | Part 3 | Question: 8

The STUDENT information in a university stored in the relation STUDENT (Name, SEX, Marks,
DEPT_Name). COnsider the following SQL Query:
SELECT DEPT_Name from STUDENT where SEX='M'
group by DEPT_Name having avg(Marks)>SELECT avg(Marks) from STUDENT

It returns the name of the department for which

A. The average marks of Male students is more than the average marks of students in the department
B. The average marks of Male students is more than the average marks of students in the university
C. The average marks of students is more than the average marks of male students in the university
D. The average marks of Male students is more than the average marks of male students in the university

ugcnetcse-june2015-paper3 sql databases

Answer key ☟

7.42.27 SQL: UGC NET CSE | November 2017 | Part 3 | Question: 11

Given two relations and , the result of following query

Select distinct A, B
From R1, R2

Is guaranteed to be same as R 1 provided one of the following condition is satisfied.

A. has no duplicates and is empty. B. has no duplicates and is non-empty.

C. Both and have no duplicates. D. has no duplicates and is non – empty.
ugcnetcse-nov2017-paper3 databases sql

Answer key ☟
7.42.28 SQL: UGC NET CSE | October 2020 | Part 2 | Question: 100

Consider the following table structures related to a university for the below question.
EMPLOYEE

NAME VARCHAR (30) NOT NULL,

EID VARCHAR (10) NOT NULL,
DEPTNO INT (5) NOT NULL,
HODEID VARCHAR (10),
SALARY INT (10),
PRIMARY KEY (EID),
FOREIGN KEY (HODEID) REFERENCES EMPLOYEE (EID),
FOREIGN KEY (DEPTNO) REFERENCES DEPARTMENT (DID);

DEPARTMENT

DID INT (5) NOT NULL,

DNAME VARCHAR(30) NOT NULL,
HODID VARCHAR (10) NOT NULL,
HODNAME VARCHAR (30),
PRIMARY KEY (DID),
UNIQUE (DNAME),
FOREIGN KEY (HODID) REFERENCES EMPLOYEE (EID)

PROJECT WORK:

EMPID VARCHAR (10) NOTNULL,

PROJNO INT(5) NOT NULL,
PROJECTLOC VARCHAR (30) NOT NULL,
PRIMARY KEY (EMPID, PROJNO),
FOREIGN KEY (EMPID) REFERENCES EMPLOYEE (EID),

Refer table, structures given above, University decided to give all employees in the ‘SCIENCE’ department a rise
in salary. Which of the following query/queries will compute the above results?

i. UPDATE EMPLOYEE
SET SALARY = SALARY*1.20
WHERE DEPT NO. IN (SELECT DID FROM DEPARTMENT WHERE DNAME = ‘SCIENCE’);

ii. UPDATE TABLE EMPLOYEE

SET SALARY = SALARY*1.20 WHERE DNAME=’SCIENCE’;

iii. ALTER TABLE EMPLOYEE

SET SALARY=SALARY*1.20
WHERE DEPTNO. IN (SELECT DNAME FROM DEPARTMENT WHERE DNAME = ‘SCEINCE’)

Choose the correct answer from the options given below:

A. and only B. only C. and only D. only

ugcnetcse-oct2020-paper2 databases sql

Answer key ☟

7.42.29 SQL: UGC NET CSE | October 2020 | Part 2 | Question: 96

Consider the following table structures related to a university for the below question.
EMPLOYEE
NAME VARCHAR (30) NOT NULL,
EID VARCHAR (10) NOT NULL,
DEPTNO INT (5) NOT NULL,
 HODEID VARCHAR (10),
SALARY INT (10),
PRIMARY KEY (EID),
FOREIGN KEY (HODEID) REFERENCES EMPLOYEE (EID),
FOREIGN KEY (DEPTNO) REFERENCES DEPARTMENT (DID);

DEPARTMENT
DID INT (5) NOT NULL,
DNAME VARCHAR(30) NOT NULL,
HODID VARCHAR (10) NOT NULL,
HODNAME VARCHAR (30),
PRIMARY KEY (DID),
UNIQUE (DNAME),
FOREIGN KEY (HODID) REFERENCES EMPLOYEE (EID)

PROJECT WORK:
EMPID VARCHAR (10) NOTNULL,
PROJNO INT(5) NOT NULL,
PROJECTLOC VARCHAR (30) NOT NULL,
PRIMARY KEY (EMPID, PROJNO),
FOREIGN KEY (EMPID) REFERENCES EMPLOYEE (EID),

On the basis of above given table structures, retrieve the distinct employee ID (EMPID) of all employees of university
who are working on project. No. and

A. SELECT EMPID FROM PROJECTWORK WHERE PROJNO=(20,30,40);

B. SELECT EMPID FROM PROJECTWORK WHERE PROJNO IN (20,30,40);

C. SELECT DISTINCT EMPID FROM PROJECTWORK WHERE PROJNO IN(20,30,40);

D. SELECT DISTINCT EMPID FROM PROJECTWORK WHERE PROJNO=20,30,40;

ugcnetcse-oct2020-paper2 databases sql

Answer key ☟

7.42.30 SQL: UGC NET CSE | October 2020 | Part 2 | Question: 97

Consider the following table structures related to a university for the below question.
EMPLOYEE

NAME VARCHAR (30) NOT NULL,

EID VARCHAR (10) NOT NULL,
DEPTNO INT (5) NOT NULL,
HODEID VARCHAR (10),
SALARY INT (10),
PRIMARY KEY (EID),
FOREIGN KEY (HODEID) REFERENCES EMPLOYEE (EID),
FOREIGN KEY (DEPTNO) REFERENCES DEPARTMENT (DID);

DEPARTMENT

DID INT (5) NOT NULL,

DNAME VARCHAR(30) NOT NULL,
HODID VARCHAR (10) NOT NULL,
HODNAME VARCHAR (30),
PRIMARY KEY (DID),
UNIQUE (DNAME),
FOREIGN KEY (HODID) REFERENCES EMPLOYEE (EID)

PROJECT WORK:

EMPID VARCHAR (10) NOTNULL,

 PROJNO INT(5) NOT NULL,
PROJECTLOC VARCHAR (30) NOT NULL,
PRIMARY KEY (EMPID, PROJNO),
FOREIGN KEY (EMPID) REFERENCES EMPLOYEE (EID),

Given below are two statements to find the sum of salaries of all employees of the English department as well as the
maximum, minimum and average salary in English department
STATEMENT :
SELECT SUM (SALARY) MAX(SALARY) MIN(SALARY),
AVG (SALARY) FROM EMPLOYEE, DEPARTMENT
WHERE DEPTNO=DID AND DNAME=’ENGLISH’

STATEMENT :
SELECT SUM (SALARY), MAX(SALARY), MIN (SALARY),
AVG (SALARY), FROM EMPLOYEE, DEPARTMENT
WHERE DNAME=’ENGLISH’

In the light of the above statements, choose the correct answer from the options given below:

A. Both Statement and Statement are true

B. Both Statement and Statement are false
C. Statement is correct but Statement is false
D. Statement is incorrect but Statement is true

ugcnetcse-oct2020-paper2 databases sql

Answer key ☟

7.42.31 SQL: UGC NET CSE | October 2020 | Part 2 | Question: 98

Consider the following table structures related to a university for the below question.
EMPLOYEE

NAME VARCHAR (30) NOT NULL,

EID VARCHAR (10) NOT NULL,
DEPTNO INT (5) NOT NULL,
HODEID VARCHAR (10),
SALARY INT (10),
PRIMARY KEY (EID),
FOREIGN KEY (HODEID) REFERENCES EMPLOYEE (EID),
FOREIGN KEY (DEPTNO) REFERENCES DEPARTMENT (DID);

DEPARTMENT

DID INT (5) NOT NULL,

DNAME VARCHAR(30) NOT NULL,
HODID VARCHAR (10) NOT NULL,
HODNAME VARCHAR (30),
PRIMARY KEY (DID),
UNIQUE (DNAME),
FOREIGN KEY (HODID) REFERENCES EMPLOYEE (EID)

PROJECT WORK:

EMPID VARCHAR (10) NOTNULL,

PROJNO INT(5) NOT NULL,
PROJECTLOC VARCHAR (30) NOT NULL,
PRIMARY KEY (EMPID, PROJNO),
FOREIGN KEY (EMPID) REFERENCES EMPLOYEE (EID),

Which of the following query/queries return the employee ID and name of employees whose salary is greater than the
 salary of all employees in department number of university. Order result by employee ID (refer table structures given
above).

i. SELECT EID, NAME

FROM EMPLOYEE
WHERE SALARY>(SELECT SALARY FROM EMPLOYEE WHERE DEPTNO=20)
ORDER BY EID

ii. SELECT EID, NAME

FROM EMPLOYEE
WHERE SALARY>(SELECT SALARY FROM EMPLOYEE WHERE DEPTNO=20);

iii. SELECT EID, NAME

FROM EMPLOYEE
WHERE SALARY > ALL(SELECT SALARY FROM EMPLOYEE WHERE DEPTNO=20)
ORDER BY EID

Choose the correct answer from the options given below:

A. and only B. and only C. only D. only

ugcnetcse-oct2020-paper2 databases sql

Answer key ☟

7.42.32 SQL: UGC NET CSE | October 2020 | Part 2 | Question: 99

Consider the following table structures related to a university for the below question.
EMPLOYEE

NAME VARCHAR (30) NOT NULL,

EID VARCHAR (10) NOT NULL,
DEPTNO INT (5) NOT NULL,
HODEID VARCHAR (10),
SALARY INT (10),
PRIMARY KEY (EID),
FOREIGN KEY (HODEID) REFERENCES EMPLOYEE (EID),
FOREIGN KEY (DEPTNO) REFERENCES DEPARTMENT (DID);

DEPARTMENT

DID INT (5) NOT NULL,

DNAME VARCHAR(30) NOT NULL,
HODID VARCHAR (10) NOT NULL,
HODNAME VARCHAR (30),
PRIMARY KEY (DID),
UNIQUE (DNAME),
FOREIGN KEY (HODID) REFERENCES EMPLOYEE (EID)

PROJECT WORK:

EMPID VARCHAR (10) NOTNULL,

PROJNO INT(5) NOT NULL,
PROJECTLOC VARCHAR (30) NOT NULL,
PRIMARY KEY (EMPID, PROJNO),
FOREIGN KEY (EMPID) REFERENCES EMPLOYEE (EID),

In reference to the above given table structures, which of the following query/queries will drop the ‘SALARY’ column
from ‘EMPLOYEE’ table?

i. ALTER TABLE EMPLOYEE DROP SALARY CASCADE

 ii. ALTER TABLE EMPLOYEE DROP SALARY RESTRICT

iii. ALTER EMPLOYEE DROP SALARY

Choose the correct answer from the options given below:

A. and only B. and only C. and only D. only

ugcnetcse-oct2020-paper2 databases sql

Answer key ☟

7.42.33 SQL: UGC NET CSE | September 2013 | Part 3 | Question: 25

The SQL expression

Select distinct T.branch_name from branch T, branch S
where T.assets>S.assets and S.branch_city = “Mumbai”

finds the names of

A. All branches that have greater assets than some branch located in Mumbai
B. All branches that have greater assets than all branches in Mumbai
C. The branch that has greatest asset in Mumbai
D. Any branch that has greater assets than any branch in Mumbai

ugcnetcse-sep2013-paper3 databases sql

Answer key ☟

7.43 Transaction and Concurrency (8)

7.43.1 Transaction and Concurrency: UGC NET CSE | December 2010 | Part 2 | Question: 18

Which of the following is an optimistic concurrency control method ?

A. Validation based B. Time stamp ordering

C. Lock-based D. None of these
ugcnetcse-dec2010-paper2 databases transaction-and-concurrency

Answer key ☟

7.43.2 Transaction and Concurrency: UGC NET CSE | December 2014 | Part 3 | Question: 08

Which of the following is correct ?

I. Two phase locking is an optimistic protocol.
II. Two phase locking is pessimistic protocol
III. Time stamping is an optimistic protocol.
IV. Time stamping is pessimistic protocol.

A. and B. and C. and D. and

ugcnetcse-dec2014-paper3 databases transaction-and-concurrency

Answer key ☟

7.43.3 Transaction and Concurrency: UGC NET CSE | January 2017 | Part 3 | Question: 7

Consider following schedules involving two transactions:

Which of the following statement is true?

 A. Both and are conflict serializable.
B. is conflict serializable and is not conflict serializable
C. is not conflict serializable and is conflict serializable
D. Both and are not conflict serializable

ugcnetcse-jan2017-paper3 databases transaction-and-concurrency

Answer key ☟

7.43.4 Transaction and Concurrency: UGC NET CSE | June 2012 | Part 2 | Question: 12

A Transaction Manager is which of the following?

A. Maintains a log of transactions B. Maintains before and after database images

C. Maintains appropriate concurrent control D. All of the above
ugcnetcse-june2012-paper2 databases transaction-and-concurrency

Answer key ☟

7.43.5 Transaction and Concurrency: UGC NET CSE | November 2017 | Part 3 | Question: 7

Consider the following four schedules due to three transactions (indicated by the subscript) using read and write
on a data item , denoted by and respectively. Which one of them is conflict serializable?
:
:
:
:

A. B. C. D.
ugcnetcse-nov2017-paper3 databases transaction-and-concurrency

Answer key ☟

7.43.6 Transaction and Concurrency: UGC NET CSE | November 2017 | Part 3 | Question: 8

Suppose a database schedule S involves transactions . Consider the precedence graph of with
vertices representing the transactions and edges representing the conflicts. If is serializable, which one of the
following orderings of the vertices of the precedence graph is guaranteed to yield a serial schedule?
A. Topological order B. Depth – first order
C. Breadth – first order D. Ascending order of transactions indices
ugcnetcse-nov2017-paper3 databases transaction-and-concurrency

Answer key ☟

7.43.7 Transaction and Concurrency: UGC NET CSE | September 2013 | Part 2 | Question: 37

Usage of Preemption and Transaction Rollback prevents _____.

A. Unauthorized usage of data file B. Deadlock situation

C. Data manipulation D. File pre-emption
ugcnetsep2013ii databases transaction-and-concurrency

Answer key ☟

7.43.8 Transaction and Concurrency: UGC NET CSE | September 2013 | Part 2 | Question: 43

Thoma’s-write rule is

A. Two phase locking protocol B. Timestamp ordering protocol

C. One phase locking protocol D. Sliding window protocol
ugcnetsep2013ii databases transaction-and-concurrency

Answer key ☟
7.44 Transactions and Concurrency Control (2)

7.44.1 Transactions and Concurrency Control: UGC NET CSE | June 2023 | Part 2: 44

Which one of the following is a part of properties of a database transaction?

A. Atomicity B. Consistency C. Isolation D. Deadlock-freedom

ugcnetcse-june2023-paper2 databases transactions-and-concurrency-control

Answer key ☟

7.44.2 Transactions and Concurrency Control: UGC NET CSE | October 2020 | Part 2 | Question: 48

In the context of concurrency control, a given pair of operations in a schedule is called conflict schedule if

i. At least one of the operations is write operation

ii. Both the operations are performed on the same data item
iii. Both the operations are performed by different transactions
iv. Both the operations are performed on different data items

Choose the correct answer from the options given below:

A. and only B. , and only

C. , and only D. and only
ugcnetcse-oct2020-paper2 databases transactions-and-concurrency-control

Answer key ☟

7.45 Weak Entity (1)

7.45.1 Weak Entity: UGC NET CSE | Junet 2015 | Part 2 | Question: 20

For a weak entity set to be meaningful, it must be associated with another entity set in combination with some of
their attribute values, is called as:

A. Neighbour Set B. Strong Entity Set

C. Owner Entity Set D. Weak Set
ugcnetcse-june2015-paper2 databases weak-entity

Answer key ☟

Answer Keys
7.0.1 C 7.0.2 D 7.0.3 D 7.0.4 C 7.0.5 C
7.0.6 B 7.0.7 B 7.0.8 D 7.0.9 B 7.0.10 D
7.0.11 A 7.0.12 D 7.0.13 D 7.0.14 Q-Q 7.0.15 Q-Q
7.0.16 Q-Q 7.0.17 Q-Q 7.0.18 Q-Q 7.0.19 Q-Q 7.0.20 Q-Q
7.0.21 Q-Q 7.0.22 Q-Q 7.0.23 Q-Q 7.0.24 Q-Q 7.0.25 Q-Q
7.0.26 Q-Q 7.0.27 Q-Q 7.0.28 Q-Q 7.0.29 Q-Q 7.1.1 Q-Q
7.1.2 C 7.2.1 A 7.2.2 A 7.3.1 X 7.4.1 Q-Q
7.5.1 B 7.5.2 C 7.5.3 B 7.5.4 C 7.6.1 B
7.7.1 A 7.8.1 Q-Q 7.9.1 Q-Q 7.10.1 B 7.11.1 Q-Q
7.11.2 D 7.12.1 B 7.13.1 Q-Q 7.13.2 A 7.14.1 D
7.14.2 A 7.15.1 A 7.16.1 Q-Q 7.16.2 B 7.17.1 N/A
7.17.2 D 7.17.3 A 7.17.4 B 7.17.5 Q-Q 7.17.6 A
7.17.7 B 7.17.8 D 7.17.9 B 7.17.10 B 7.17.11 B
7.17.12 A 7.17.13 D 7.17.14 A 7.17.15 Q-Q 7.17.16 Q-Q
7.17.17 A 7.17.18 B 7.17.19 C 7.17.20 D 7.17.21 A
7.17.22 C 7.17.23 Q-Q 7.18.1 C 7.18.2 A 7.18.3 C
7.19.1 A 7.20.1 Q-Q 7.20.2 B 7.21.1 Q-Q 7.21.2 Q-Q
7.21.3 Q-Q 7.21.4 Q-Q 7.21.5 Q-Q 7.21.6 A 7.21.7 B
7.21.8 C 7.21.9 D 7.21.10 A 7.21.11 Q-Q 7.21.12 A
7.21.13 A 7.21.14 Q-Q 7.21.15 B 7.21.16 B 7.21.17 A
7.21.18 C 7.22.1 B 7.23.1 D 7.24.1 B 7.25.1 Q-Q
7.26.1 B 7.27.1 Q-Q 7.28.1 A 7.29.1 B 7.30.1 B
7.30.2 Q-Q 7.31.1 B 7.31.2 C 7.32.1 B 7.33.1 Q-Q
7.34.1 C 7.34.2 A 7.34.3 Q-Q 7.34.4 Q-Q 7.34.5 A
7.34.6 D 7.34.7 C 7.34.8 A 7.35.1 B 7.36.1 B
7.36.2 B 7.36.3 B 7.37.1 D 7.38.1 A 7.38.2 D
7.38.3 B 7.39.1 B 7.39.2 C 7.40.1 C 7.40.2 C
7.41.1 A 7.42.1 B 7.42.2 B 7.42.3 Q-Q 7.42.4 Q-Q
7.42.5 Q-Q 7.42.6 Q-Q 7.42.7 C 7.42.8 B 7.42.9 B
7.42.10 D 7.42.11 C 7.42.12 B 7.42.13 B 7.42.14 C
7.42.15 Q-Q 7.42.16 C 7.42.17 D 7.42.18 C 7.42.19 A
7.42.20 Q-Q 7.42.21 Q-Q 7.42.22 D 7.42.23 C 7.42.24 A
7.42.25 C 7.42.26 B 7.42.27 B 7.42.28 B 7.42.29 C
7.42.30 C 7.42.31 D 7.42.32 A 7.42.33 A 7.43.1 Q-Q
7.43.2 D 7.43.3 C 7.43.4 D 7.43.5 D 7.43.6 A
7.43.7 B 7.43.8 B 7.44.1 Q-Q 7.44.2 B 7.45.1 C
8 Digital Logic (114)

8.0.1 UGC NET CSE | June 2013 | Part 3 | Question: 46

Match the following

A. B.
C. D.
ugcnetcse-june2013-paper3 digital-logic

Answer key ☟

8.0.2 UGC NET CSE | September 2013 | Part 2 | Question: 26

Match the following identities/laws to their corresponding name

A. B.
C. D.
ugcnetsep2013ii digital-logic match-the-following easy

Answer key ☟

8.0.3 UGC NET CSE | December 2013 | Part 2 | Question: 6

of a component is defined as

A. Number of components that can call or pass control to component .

B. Number of components that are called by component .
C. Number of components related to component .
D. Number of components dependent on component .

ugcnetcse-dec2013-paper2 digital-logic

Answer key ☟

8.0.4 UGC NET CSE | December 2013 | Part 2 | Question: 31

The dual of a Boolean expression is obtained by interchanging

A. Boolean sums and Boolean products

B. Boolean sums and Boolean products or interchanging and
C. Boolean sums and Boolean products and interchanging and
D. Interchanging and
 ugcnetcse-dec2013-paper2 digital-logic dual-function

Answer key ☟

8.0.5 UGC NET CSE | December 2013 | Part 3 | Question: 51

Synchronization is achieved by a timing device called a ______ which generates a periodic train of
__________.

A. clock generator, clock pulse B. master generator, clock pulse

C. generator, clock D. master clock generator, clock pulse
ugcnetcse-dec2013-paper3 digital-logic

Answer key ☟

8.0.6 UGC NET CSE | July 2016 | Part 2 | Question: 6

Which of the following logic expression is incorrect ?

A. B.
C. D.
ugcnetcse-july2016-paper2 digital-logic

Answer key ☟

8.0.7 UGC NET CSE | July 2016 | Part 2 | Question: 8

Simplified Boolean equation for the following truth table is :

A. B.
C. D.
ugcnetcse-july2016-paper2 digital-logic

Answer key ☟

8.0.8 UGC NET CSE | December 2008 | Part 2 | Question: 13

The dual of the switching function is :

A. B.
C. D.
ugcnetcse-dec2008-paper2 digital-logic dual-function

Answer key ☟

8.0.9 UGC NET CSE | November 2017 | Part 2 | Question: 10

The output of the following combinational circuit is .

 The value of is
A. B.
C. D.
ugcnetcse-nov2017-paper2

Answer key ☟

8.0.10 UGC NET CSE | December 2018 | Part 2 | Question: 11

Consider the following boolean equations:

i.
ii.

What can you say about the above equations ?

A. (i) is true and (ii) is false B. (i) is false and (ii) is true
C. Both (i) and (ii) are true D. Both (i) and (ii) are false
ugcnetcse-dec2018-paper2 digital-logic

Answer key ☟

8.0.11 UGC NET CSE | December 2018 | Part 2 | Question: 10

In computers, subtraction is generally carried out by

A. ’s complement B. ’s complement
C. ’s complement D. ’s complement
ugcnetcse-dec2018-paper2 digital-logic

Answer key ☟

8.0.12 UGC NET CSE | December 2018 | Part 2 | Question: 5

​Which of the following statements are true ?

i. Every logic network is equivalent to one using just NAND gates or just NOR gates.
ii. Boolean expressions and logic networks correspond to labelled acyclic diagraphs.
iii. No two Boolean algebras with n atoms are isomorphic.
iv. Non-zero elements of finite Boolean algebras are not uniquely expressible as joins of atoms

Choose the correct answer from the code given below :

A. i and iv only B. i, ii and iii only C. i and ii only D. ii, iii, and iv only
ugcnetcse-dec2018-paper2 digital-logic
 8.0.13 UGC NET CSE | December 2006 | Part 2 | Question: 9

The characteristic equation of the flip-flop is :

A. B. C. D.
ugcnetcse-dec2006-paper2

Answer key ☟

8.0.14 UGC NET CSE | December 2006 | Part 2 | Question: 8

A sum of products expression can be implemented with __________ logic gates.

A. AND−OR B. NAND−OR C. AND−NOT D. OR−AND

ugcnetcse-dec2006-paper2 digital-logic

Answer key ☟

8.0.15 UGC NET CSE | December 2006 | Part 2 | Question: 7

An example of a self complementing code is :

A. code B. Gray code C. Excess- code D. code

ugcnetcse-dec2006-paper2

8.0.16 UGC NET CSE | December 2007 | Part 2 | Question: 7

Simplified form of Boolean expression is :

A. B. C. D.
ugcnetcse-dec2007-paper2

Answer key ☟

8.0.17 UGC NET CSE | October 2020 | Part 2 | Question: 34

The period of a signal is ms, then the frequency of this signal in kilohertz is ______

A. B. C. D.
ugcnetcse-oct2020-paper2 digital-logic

Answer key ☟

8.1 Adder (4)

8.1.1 Adder: UGC NET CSE | August 2016 | Part 2 | Question: 10

Match the following :

A. B.
C. D.
ugcnetcse-aug2016-paper2 digital-logic adder

Answer key ☟
 8.1.2 Adder: UGC NET CSE | December 2005 | Part 2 | Question: 7

A half-adder is also known as :

A. Circuit B. Circuit C. Circuit D. Circuit

ugcnetcse-dec2005-paper2 combinational-circuit adder

Answer key ☟

8.1.3 Adder: UGC NET CSE | December 2013 | Part 2 | Question: 40

Which of the following statements are true ?

I. A circuit that adds two bits, producing a sum bit and carry bit is called half adder.
II. A circuit that adds two bits, producing a sum bit and carry bit is called full adder.
III. A circuit that adds two bits and a carry bit producing a sum bit and a carry bit is called full adder.
IV. A device that accepts the value of a Boolean variable as input and produces its complement is called an inverter.
A. I & II B. II & III C. I, II, III D. I, III & IV
ugcnetcse-dec2013-paper2 digital-logic adder

Answer key ☟

8.1.4 Adder: UGC NET CSE | December 2014 | Part 2 | Question: 06

The adder to add two decimal digits needs minimum of

A. full adders and half adders B. full adders and half adders
C. full adders and half adders D. full adders and half adders
ugcnetcse-dec2014-paper2 digital-logic adder

Answer key ☟

8.2 Boolean Algebra (10)

8.2.1 Boolean Algebra: UGC NET CSE | December 2009 | Part 2 | Question: 06

The simplified form of the Boolean expression (X + Y + XY) (X + Z) is

(A) X + Y + ZX + Y

(B) XY – YZ

(C) X + YZ

(D) XZ + Y
ugcnetcse-dec2009-paper2 digital-logic boolean-algebra

Answer key ☟

8.2.2 Boolean Algebra: UGC NET CSE | December 2018 | Part 2 | Question: 7

The boolean expression is equivalenet to

A. B. C. D.
ugcnetcse-dec2018-paper2 digital-logic boolean-algebra

Answer key ☟

8.2.3 Boolean Algebra: UGC NET CSE | July 2016 | Part 2 | Question: 9

The simplified form of the Boolean equation is

A. B. C. D.
 ugcnetcse-july2016-paper2 digital-logic boolean-algebra

Answer key ☟

8.2.4 Boolean Algebra: UGC NET CSE | June 2005 | Part 2 | Question: 7

The logic expression reduces to :

A. B. C. D.
ugcnetcse-june2005-paper2 digital-logic boolean-algebra

Answer key ☟

8.2.5 Boolean Algebra: UGC NET CSE | June 2009 | Part 2 | Question: 03

The Boolean expression is equivalent to :

A. x B. y C. z D.
ugcnetcse-june2009-paper2 digital-logic boolean-algebra

Answer key ☟

8.2.6 Boolean Algebra: UGC NET CSE | June 2011 | Part 2 | Question: 4

The absorption law in Boolean algebra say that

A. B.
C. D. None of the above
digital-logic boolean-algebra ugcnetcse-june2011-paper2

Answer key ☟

8.2.7 Boolean Algebra: UGC NET CSE | June 2013 | Part 2 | Question: 41

How many different Boolean functions of degree 4 are there?

A. B. C. D.
ugcnetcse-june2013-paper2 digital-logic boolean-algebra

Answer key ☟

8.2.8 Boolean Algebra: UGC NET CSE | June 2014 | Part 2 | Question: 16

How many different truth tables of the compound propositions are there that involve the propositions & ?

A. B. C. D.
ugcnetcse-june2014-paper2 digital-logic boolean-algebra

Answer key ☟

8.2.9 Boolean Algebra: UGC NET CSE | June 2014 | Part 2 | Question: 17

A Boolean function is called self dual if and only if . How many

Boolean functions of degree are self-dual ?

A. B. C. D.
ugcnetcse-june2014-paper2 digital-logic boolean-algebra

Answer key ☟

8.2.10 Boolean Algebra: UGC NET CSE | Junet 2015 | Part 2 | Question: 6

Consider the following statements:

 i. Boolean expressions and logic gates networks correspond to labelled acyclic digraphs
ii. Optimal boolean expressions may not correspond to simplest networks.
iii. Choosing essential blocks first in a Karnaugh map and then greedily choosing the largest remaining blocks to cover
may not give an optimal expression

Which of these statement(s) is/are correct?

A. i only B. ii only C. i and ii D. i, ii, and iii

ugcnetcse-june2015-paper2 digital-logic boolean-algebra

Answer key ☟

8.3 Circuit Output (5)

8.3.1 Circuit Output: UGC NET CSE | December 2012 | Part 2 | Question: 1

Consider the circuit shown below. IN a certain steady state, ‘Y’ is at logical ‘l’. What are the possible values of
A, B, C?

A. B. C. D.
ugcnetcse-dec2012-paper2 digital-logic circuit-output

Answer key ☟

8.3.2 Circuit Output: UGC NET CSE | December 2013 | Part 3 | Question: 53

What will be output of the following logic diagram ?

A. x y B. x y C. x y D. x y
ugcnetcse-dec2013-paper3 digital-logic circuit-output

Answer key ☟

8.3.3 Circuit Output: UGC NET CSE | December 2018 | Part 2 | Question: 17

Find the boolean expression for the logic circuit shown below:

A. B.
C. D.
 ugcnetcse-dec2018-paper2 digital-logic circuit-output

Answer key ☟

8.3.4 Circuit Output: UGC NET CSE | June 2010 | Part 2 | Question: 6

The logic expression for the output of the circuit shown in the figure is

A. B.
C. D.
ugcnetcse-june2010-paper2 digital-logic circuit-output digital-circuits

Answer key ☟

8.3.5 Circuit Output: UGC NET CSE | September 2013 | Part 2 | Question: 49

What type of logic circuit is represented by the figure shown below ?

A. B. C. D.
ugcnetsep2013ii digital-logic circuit-output

Answer key ☟

8.4 Combinational Circuit (3)

8.4.1 Combinational Circuit: UGC NET CSE | August 2016 | Part 2 | Question: 9

Which of the following logic operations is performed by the following given combinational circuit ?

A. EXCLUSIVE-OR B. EXCLUSIVE-NOR C. NAND D. NOR

ugcnetcse-aug2016-paper2 digital-logic combinational-circuit

Answer key ☟

8.4.2 Combinational Circuit: UGC NET CSE | August 2016 | Part 3 | Question: 6

The output of the following combinational circuit

 is :

A. B. C. D.
ugcnetcse-aug2016-paper3 digital-logic combinational-circuit

Answer key ☟

8.4.3 Combinational Circuit: UGC NET CSE | July 2018 | Part 2 | Question: 93

Match the terms in with the options given in :

A. B.
C. D.
ugcnetcse-july2018-paper2 digital-logic combinational-circuit

Answer key ☟

8.5 Digital Circuits (10)

8.5.1 Digital Circuits: UGC NET CSE | August 2016 | Part 3 | Question: 65

Which of the following 2 input Boolean logic functions is linearly inseparable ?

(a) AND
(b) OR
(c) NOR
(d) XOR
(e) NOT XOR

A. (a) and (b) B. (b) and (c) C. (c), (d) and (e) D. (d) and (e)
ugcnetcse-aug2016-paper3 digital-logic digital-circuits

Answer key ☟

8.5.2 Digital Circuits: UGC NET CSE | December 2008 | Part 2 | Question: 4

Extremely low power dissipation and low cost per gate can be achieved in:

A. MOS ICs B. C MOS ICs

C. TTL ICs D. ECL ICs
ugcnetcse-dec2008-paper2 digital-logic digital-circuits

8.5.3 Digital Circuits: UGC NET CSE | December 2008 | Part 2 | Question: 5

An example of a universal building block is:

1. gate
2. gate
3. gate
4. gate

ugcnetcse-dec2008-paper2 digital-logic digital-circuits

Answer key ☟
8.5.4 Digital Circuits: UGC NET CSE | December 2010 | Part 2 | Question: 7

is equivalent to
A. B.
C. D.
ugcnetcse-dec2010-paper2 digital-logic digital-circuits

Answer key ☟

8.5.5 Digital Circuits: UGC NET CSE | December 2012 | Part 2 | Question: 38

Match the following families with their basic circuits :

A. B.
C. D.
ugcnetcse-dec2012-paper2 digital-logic digital-circuits

Answer key ☟

8.5.6 Digital Circuits: UGC NET CSE | December 2012 | Part 2 | Question: 47

Match the following :

A. B.
C. D.
ugcnetcse-dec2012-paper2 digital-logic digital-circuits match-the-following

Answer key ☟

8.5.7 Digital Circuits: UGC NET CSE | December 2012 | Part 2 | Question: 49

Identify the operation which is commutative but not associative?

A. OR B. NOR C. EX-OR D. NAND

ugcnetcse-dec2012-paper2 digital-logic digital-circuits multiple-selects

Answer key ☟

8.5.8 Digital Circuits: UGC NET CSE | January 2017 | Part 2 | Question: 7

ECL is the fastest of all logic families. High speed in ECL is possible because transistors are used in difference
amplifier configuration, in which they are never driven into ________.

A. Race condition B. Saturation C. Delay D. High impedance

ugcnetjan2017ii digital-logic digital-circuits

Answer key ☟

8.5.9 Digital Circuits: UGC NET CSE | June 2010 | Part 2 | Question: 8

What is the transitive voltage for the voltage input of a CMOS operating from supply ?

A. B. C. D.
 ugcnetcse-june2010-paper2 digital-logic digital-circuits

8.5.10 Digital Circuits: UGC NET CSE | September 2013 | Part 2 | Question: 23

Which one of the following set of gates is best suited for ‘parity’ checking and ‘parity’ generation?

A. AND, OR, NOT B. NAND, NOR C. EX-OR, EX-NOR D. None of the above
ugcnetsep2013ii digital-logic digital-circuits

Answer key ☟

8.6 Digital Counter (2)

8.6.1 Digital Counter: UGC NET CSE | December 2007 | Part 2 | Question: 8

In order to build a counter, the minimum number of flip flops needed is equal to :

A. B. C. D.
ugcnetcse-dec2007-paper2 digital-logic digital-counter

Answer key ☟

8.6.2 Digital Counter: UGC NET CSE | June 2019 | Part 2 | Question: 15

What will be the number of states when a MOD- counter is followed by a MOD- counter?

A. B. C. D.
ugcnetcse-june2019-paper2 digital-logic digital-counter

Answer key ☟

8.7 Encoding (1)

8.7.1 Encoding: UGC NET CSE | June 2014 | Part 2 | Question: 37

A text is made up of the characters and with the probability and

respectively. The optimal coding technique will have the average length of

A. B. C. D.
ugcnetcse-june2014-paper2 computer-networks encoding

Answer key ☟

8.8 Excess 3 (1)

8.8.1 Excess 3: UGC NET CSE | December 2014 | Part 2 | Question: 07

The Excess- decimal code is a self-complementing code because

A. The binary sum of a code and its complement is equal to .

B. It is a weighted code.
C. Complement can be generated by inverting each bit pattern.
D. The binary sum of a code and its complement is equal to .

ugcnetcse-dec2014-paper2 digital-logic excess-3

Answer key ☟

8.9 Flip Flop (10)

8.9.1 Flip Flop: UGC NET CSE | December 2004 | Part 2 | Question: 10

The characteristic equation of a flip-flop is :

A.
B.
C.
D.

The symbols used have the usual meaning.

ugcnetcse-dec2004-paper2 flip-flop

Answer key ☟

8.9.2 Flip Flop: UGC NET CSE | December 2005 | Part 2 | Question: 10

When an inventor is placed between both inputs of an flip flop, the resulting flip flop is :

A. flip-flop B. flip-flop C. flip-flop D. None of these

ugcnetcse-dec2005-paper2 digital-logic flip-flop

Answer key ☟

8.9.3 Flip Flop: UGC NET CSE | December 2008 | Part 2 | Question: 14

The characteristics equation of flip-flop is :

A. = B. = C. = D. =
ugcnetcse-dec2008-paper2 digital-logic flip-flop

Answer key ☟

8.9.4 Flip Flop: UGC NET CSE | December 2010 | Part 2 | Question: 8

An Astable multivibrator has :

A. One stable state B. Two stable states

C. No stable states D. None of these
ugcnetcse-dec2010-paper2 digital-logic flip-flop

Answer key ☟

8.9.5 Flip Flop: UGC NET CSE | January 2017 | Part 2 | Question: 8

A binary -bit down counter uses - flip-flops, with inputs , and outputs , = respectively.
The minimized expression for the input from following is :

I.
II.
III.
IV.
V.
VI.

A. I, III, V B. I, IV, VI C. II, III, V D. II, IV, VI

ugcnetjan2017ii digital-logic flip-flop

Answer key ☟

8.9.6 Flip Flop: UGC NET CSE | July 2016 | Part 2 | Question: 10

In a positive edge triggered - flip flop , if and both are high then the output will be ______on the rising
edge of the clock :
 A. No change B. Set C. Reset D. Toggle
ugcnetcse-july2016-paper2 digital-logic flip-flop

Answer key ☟

8.9.7 Flip Flop: UGC NET CSE | July 2018 | Part 2 | Question: 92

In flip-flop, the output of the flip-flop at time same as the output at time , after the occurrence of a
clock pulse if :

A. B. C. D.
ugcnetcse-july2018-paper2 digital-logic flip-flop

Answer key ☟

8.9.8 Flip Flop: UGC NET CSE | June 2009 | Part 2 | Question: 04

The characteristic equation of a flip-flop is :

A. B.
C. D.
ugcnetcse-june2009-paper2 digital-logic flip-flop

Answer key ☟

8.9.9 Flip Flop: UGC NET CSE | September 2013 | Part 3 | Question: 34

The power dissipation of a flip-flop is mW. The power dissipation of a digital system with flip-flops is given
by :

A. mW B. mW C. mW D. mW
ugcnetcse-sep2013-paper3 digital-logic flip-flop

Answer key ☟

8.9.10 Flip Flop: UGC NET CSE | September 2013 | Part 3 | Question: 35

An Astable multi vibrator using the timer to generate a square wave of KHz with duty cycle will have
:

A.
B.
C.
D.

ugcnetcse-sep2013-paper3 digital-logic flip-flop

Answer key ☟

8.10 Floating Point Representation (2)

8.10.1 Floating Point Representation: UGC NET CSE | December 2014 | Part 2 | Question: 09

The range of representable normalized numbers in the floating point binary fractional representation in a -bit
word with -bit sign, -bit excess biased exponent and -bit mantissa is :

A. to B. to
C. to D. to
ugcnetcse-dec2014-paper2 digital-logic floating-point-representation

Answer key ☟
 8.10.2 Floating Point Representation: UGC NET CSE | December 2018 | Part 2 | Question: 16

The decimal floating point number represented using -bit representation and written in
hexadecimal form is

A. B. C. D.
ugcnetcse-dec2018-paper2 digital-logic number-representation floating-point-representation

Answer key ☟

8.11 Full Adder (1)

8.11.1 Full Adder: UGC NET CSE | Junet 2015 | Part 2 | Question: 7

Consider a full-adder with the following input values :

a. and (carry input) b. and
Compute the value of S(sum) and (carry output) for the above input values :

A. and B. and
C. and D. and
ugcnetcse-june2015-paper2 digital-logic full-adder

Answer key ☟

8.12 IEEE Representation (2)

8.12.1 IEEE Representation: UGC NET CSE | July 2016 | Part 2 | Question: 7

The double precision format to represent floating point numbers, has a length of ______ bits.

A. B. C. D.
ugcnetcse-july2016-paper2 digital-logic ieee-representation

Answer key ☟

8.12.2 IEEE Representation: UGC NET CSE | September 2013 | Part 2 | Question: 7

The single-precision and double-precision format to represent floating-point numbers, has a length of
______ and ________ respectively.
A. bits and bits B. bits and bits
C. bits and bits D. bits and bits
ugcnetsep2013ii digital-logic ieee-representation

Answer key ☟

8.13 K Map (6)

8.13.1 K Map: UGC NET CSE | August 2016 | Part 2 | Question: 8

The Karnaugh map for a Boolean function is given as

 The simplified Boolean equation for the above Karnaugh Map is
A. B.
C. D.
ugcnetcse-aug2016-paper2 digital-logic k-map

Answer key ☟

8.13.2 K Map: UGC NET CSE | July 2018 | Part 2 | Question: 99

Simplify the following using – map :

stands for don't care condition.

A. B.
C. D.
ugcnetcse-july2018-paper2 digital-logic k-map

Answer key ☟

8.13.3 K Map: UGC NET CSE | June 2010 | Part 2 | Question: 10

The function represented by the -map given below is

A. B.
C. D.
ugcnetcse-june2010-paper2 digital-logic k-map

Answer key ☟

8.13.4 K Map: UGC NET CSE | June 2013 | Part 3 | Question: 45

The simplified function in product of sums of Boolean function is

A. B.
C. D.
ugcnetcse-june2013-paper3 digital-logic k-map
 Answer key ☟

8.13.5 K Map: UGC NET CSE | November 2017 | Part 2 | Question: 6

The Boolean function with the Karnaugh map

is
A. B.
C. D.
ugcnetcse-nov2017-paper2 digital-logic k-map

Answer key ☟

8.13.6 K Map: UGC NET CSE | October 2020 | Part 2 | Question: 42

Simplified expression/s for following Boolean function

is/are

i.
ii.
iii.
iv.

Choose the correct answer from the options given below:

A. only B. only C. and only D. and only

ugcnetcse-oct2020-paper2 digital-logic k-map

Answer key ☟

8.14 Memory (1)

8.14.1 Memory: UGC NET CSE | December 2009 | Part 2 | Question: 08

The highest noise margin is offered by

A. B. C. D.
ugcnetcse-dec2009-paper2 digital-logic memory

8.15 Multiplexer (4)

8.15.1 Multiplexer: UGC NET CSE | December 2008 | Part 2 | Question: 15

If input multiplexers drive a input multiplexer, we get a:

A. input
B. input
C. input
 D. input

ugcnetcse-dec2008-paper2 digital-logic multiplexer

Answer key ☟

8.15.2 Multiplexer: UGC NET CSE | June 2009 | Part 2 | Question: 05

In order to implement a variable switching function, a must have :

A. inputs B. inputs C. inputs D. inputs

ugcnetcse-june2009-paper2 digital-logic multiplexer

Answer key ☟

8.15.3 Multiplexer: UGC NET CSE | June 2012 | Part 3 | Question: 53

Consider the below circuit and find the output function

A. B.
C. D.
ugcnetcse-june2012-paper3 digital-logic multiplexer

Answer key ☟

8.15.4 Multiplexer: UGC NET CSE | June 2014 | Part 3 | Question: 68

A terminal multiplexer has six bps terminals and bps terminals connected to it. If the outgoing line
is bps, what is the value of ?

A. B. C. D.
ugcnetjune2014iii digital-logic multiplexer

Answer key ☟

8.16 Number Representation (11)

8.16.1 Number Representation: UGC NET CSE | August 2016 | Part 2 | Question: 6

The octal number is equivalent to

A. and B. and
C. and D. and
ugcnetcse-aug2016-paper2 digital-logic number-representation

Answer key ☟

8.16.2 Number Representation: UGC NET CSE | August 2016 | Part 2 | Question: 7

Which of the following is the most efficient to perform arithmetic operations on the numbers ?
 A. Sign-magnitude B. complement
C. complement D. complement
ugcnetcse-aug2016-paper2 digital-logic number-representation

Answer key ☟

8.16.3 Number Representation: UGC NET CSE | December 2009 | Part 2 | Question: 09

The answer of the operation (10111)2 * (1110)2 in hex equivalence is

(A) 150

(B) 241

(C) 142

(D) 101011110
ugcnetcse-dec2009-paper2 digital-logic number-representation

Answer key ☟

8.16.4 Number Representation: UGC NET CSE | December 2009 | Part 2 | Question: 10

How many 1’s are present in the binary representation of 3 × 512 + 7 × 64 + 5 × 8 + 3

(A) 8

(B) 9

(C) 10

(D) 11
ugcnetcse-dec2009-paper2 digital-logic number-representation

Answer key ☟

8.16.5 Number Representation: UGC NET CSE | December 2010 | Part 2 | Question: 6

The decimal number equivalent of is

A. B. C. D.
ugcnetcse-dec2010-paper2 digital-logic number-representation

Answer key ☟

8.16.6 Number Representation: UGC NET CSE | December 2010 | Part 2 | Question: 9

-bit complement of is
A. B.
C. D.
ugcnetcse-dec2010-paper2 digital-logic number-representation

Answer key ☟

8.16.7 Number Representation: UGC NET CSE | July 2018 | Part 2 | Question: 95

The hexadecimal equivalent of the binary integer number 110101101 is

A. D24 B. 1 B D C. 1 A E D. 1 A D
ugcnetcse-july2018-paper2 digital-logic number-representation easy

Answer key ☟
 8.16.8 Number Representation: UGC NET CSE | July 2018 | Part 2 | Question: 96

Perform the following operation for the binary equivalent of the decimal numbers . The
solution in 8 bit representation is

A. 11100011 B. 00011101 C. 10011101 D. 11110011

ugcnetcse-july2018-paper2 digital-logic number-representation

Answer key ☟

8.16.9 Number Representation: UGC NET CSE | June 2005 | Part 2 | Question: 9

Which of the following binary number is the same as its complement :

A. B. C. D.
ugcnetcse-june2005-paper2 digital-logic number-representation

Answer key ☟

8.16.10 Number Representation: UGC NET CSE | June 2012 | Part 2 | Question: 35

If an integer needs two bytes of storage, then the maximum value of signed integer is

A. B. C. D.
digital-logic number-representation ugcnetcse-june2012-paper2

Answer key ☟

8.16.11 Number Representation: UGC NET CSE | June 2014 | Part 2 | Question: 18

Which of the following statement(s) is (are) not correct ?

i. The ’s complement of is .
ii. In ’s complement, the left most bit cannot be used to express a quantity.
iii. For an -bit word ( ’s complement) which includes the sign bit, there are positive integers, negative
integers and one 0 for a total of unique states.
iv. In ’s complement the significant information is contained in the ’s of positive numbers and ’s of the negative
numbers.

A. & B. & C. D.
ugcnetcse-june2014-paper2 digital-logic number-representation

Answer key ☟

8.17 Number System (10)

8.17.1 Number System: UGC NET CSE | December 2005 | Part 2 | Question: 6

Which of the following is divisible by ?

A. B. C. D.
ugcnetcse-dec2005-paper2 digital-logic number-system

Answer key ☟

8.17.2 Number System: UGC NET CSE | December 2006 | Part 2 | Question: 6

The hexadecimal equivalent of is :

A. B. C. D.
ugcnetcse-dec2006-paper2 digital-logic number-system
 Answer key ☟

8.17.3 Number System: UGC NET CSE | December 2013 | Part 2 | Question: 32

Given that in some number system . The base of that number system is

A. 2 B. 8 C. 10 D. None of the above

ugcnetcse-dec2013-paper2 digital-logic number-system

Answer key ☟

8.17.4 Number System: UGC NET CSE | January 2017 | Part 2 | Question: 10

The hexadecimal equivalent of the octal number is :

A. B. C. D.
ugcnetjan2017ii digital-logic number-system

Answer key ☟

8.17.5 Number System: UGC NET CSE | January 2017 | Part 2 | Question: 15

If is a binary number which is power of , then the value of is :

A. B. C. D.
ugcnetjan2017ii digital-logic number-system

Answer key ☟

8.17.6 Number System: UGC NET CSE | January 2017 | Part 2 | Question: 9

Convert the octal number into its equivalent decimal number.

A. B. C. D.
ugcnetjan2017ii digital-logic number-system

Answer key ☟

8.17.7 Number System: UGC NET CSE | June 2009 | Part 2 | Question: 13

The octal equivalent of hexadecimal is :

A. B. C. D.
ugcnetcse-june2009-paper2 digital-logic number-system number-representation

Answer key ☟

8.17.8 Number System: UGC NET CSE | June 2019 | Part 2 | Question: 18

Consider the equation . Which of the following is the value of ?

A. B. C. D.
ugcnetcse-june2019-paper2 number-system

Answer key ☟

8.17.9 Number System: UGC NET CSE | Junet 2015 | Part 3 | Question: 4

The equivalent hexadecimal notation for octal number 2550276 is

A. FADED B. AEOBE C. ADOBE D. ACABE

ugcnetcse-june2015-paper3 digital-logic number-system
 Answer key ☟

8.17.10 Number System: UGC NET CSE | November 2017 | Part 2 | Question: 7

The octal equivalent of the binary number is

A. B. C. D.
ugcnetcse-nov2017-paper2 digital-logic number-system number-representation

Answer key ☟

8.18 Number Theory (1)

8.18.1 Number Theory: UGC NET CSE | June 2010 | Part 2 | Question: 9

What is decimal equivalent of BCD ?

A. B. C. D.
ugcnetcse-june2010-paper2 digital-logic number-theory

Answer key ☟

8.19 Priority Encoder (1)

8.19.1 Priority Encoder: UGC NET CSE | June 2019 | Part 2 | Question: 17

The parallel bus arbitration technique uses an external priority encoder and a decoder. Suppose, a parallel arbiter
has bus arbiters. What will be the size of priority encoder and decoder respectively?
A. B.
C. D.
ugcnetcse-june2019-paper2 priority-encoder

Answer key ☟

8.20 ROM (1)

8.20.1 ROM: UGC NET CSE | December 2014 | Part 2 | Question: 10

The size of the required to build an 8-bit adder / subtractor with mode control, carry input, carry output
and two's complement overflow output is given as

A. B.
C. D.
ugcnetcse-dec2014-paper2 digital-logic rom

Answer key ☟

8.21 Ripple Counter Operation (3)

8.21.1 Ripple Counter Operation: UGC NET CSE | August 2016 | Part 3 | Question: 1

A ripple counter is a :
A. Synchronous Counter B. Asynchronous counter
C. Parallel counter D. None of the above
ugcnetcse-aug2016-paper3 digital-logic ripple-counter-operation

8.21.2 Ripple Counter Operation: UGC NET CSE | July 2018 | Part 2 | Question: 94

What does the following logic diagram represent?

 A. Synchronous Counter B. Ripple Counter
C. Combinational Circuit D. Mod 2 Counter
ugcnetcse-july2018-paper2 digital-logic ripple-counter-operation

Answer key ☟

8.21.3 Ripple Counter Operation: UGC NET CSE | September 2013 | Part 3 | Question: 36

A binary ripple counter is required to count up to 16383. How many flip-flops are required?

A. 16382 B. 8191 C. 512 D. 14

ugcnetcse-sep2013-paper3 digital-logic ripple-counter-operation

Answer key ☟

8.22 Sequential Circuit (6)

8.22.1 Sequential Circuit: UGC NET CSE | July 2016 | Part 3 | Question: 1

Which of the following is a sequential circuit?

A. Multiplexer B. Decoder C. Full adder D. Counter

ugcnetcse-july2016-paper3 digital-logic sequential-circuit

Answer key ☟

8.22.2 Sequential Circuit: UGC NET CSE | June 2009 | Part 2 | Question: 14

A reduced state table has rows. The minimum number of Flip-flops needed to implement the sequential
machine is :

A. B. C. D.
ugcnetcse-june2009-paper2 digital-logic sequential-circuit

Answer key ☟

8.22.3 Sequential Circuit: UGC NET CSE | June 2010 | Part 2 | Question: 7

Advantage of synchronous sequential circuits over asynchronous ones is

A. Faster operation B. Ease of avoiding problems due to hazard
C. Lower hardware requirement D. Better noise immunity
ugcnetcse-june2010-paper2 digital-logic sequential-circuit

Answer key ☟

8.22.4 Sequential Circuit: UGC NET CSE | June 2014 | Part 3 | Question: 42

The output of a sequential circuit depends on

A. Present input only B. Past input only
C. Both present and past input D. Past output only
ugcnetjune2014iii digital-logic sequential-circuit

Answer key ☟
 8.22.5 Sequential Circuit: UGC NET CSE | June 2014 | Part 3 | Question: 44

Which of the following flip-flops is free from race condition ?

A. flip-flop B. flip-flop
C. Master-slave flip-flop D. None of the above
ugcnetjune2014iii digital-logic sequential-circuit flip-flop

Answer key ☟

8.22.6 Sequential Circuit: UGC NET CSE | Junet 2015 | Part 3 | Question: 6

The number of flip-flops required to design a modulo -272 counter is

A. 8 B. 9 C. 27 D. 11
ugcnetcse-june2015-paper3 digital-logic sequential-circuit flip-flop

Answer key ☟

8.23 Sum of Product (1)

8.23.1 Sum of Product: UGC NET CSE | December 2013 | Part 2 | Question: 33

The sum of products expansion for the function is given as

A.
B.
C.
D.

ugcnetcse-dec2013-paper2 digital-logic sum-of-product

Answer key ☟

8.24 Unix (1)

8.24.1 Unix: UGC NET CSE | December 2015 | Part 3 | Question: 40

In Unix operating system, special files are used to

A. buffer data received in its input from where a process reads

B. provide a mechanism to map physical device to file names
C. store list of file names plus pointers associated with i-nodes
D. store information entered by a user application program or utility program

ugcnetcse-dec2015-paper3 unix

Answer key ☟

Answer Keys
8.0.1 C 8.0.2 A 8.0.3 A 8.0.4 C 8.0.5 A
8.0.6 C 8.0.7 C 8.0.8 Q-Q 8.0.9 B 8.0.10 Q-Q
8.0.11 D 8.0.12 Q-Q 8.0.13 Q-Q 8.0.14 Q-Q 8.0.15 Q-Q
8.0.16 Q-Q 8.0.17 C 8.1.1 Q-Q 8.1.2 Q-Q 8.1.3 D
8.1.4 D 8.2.1 C 8.2.2 Q-Q 8.2.3 A 8.2.4 Q-Q
8.2.5 C 8.2.6 C 8.2.7 D 8.2.8 D 8.2.9 D
8.2.10 D 8.3.1 A;D 8.3.2 C 8.3.3 C 8.3.4 Q-Q
8.3.5 B 8.4.1 Q-Q 8.4.2 Q-Q 8.4.3 Q-Q 8.5.1 Q-Q
8.5.2 Q-Q 8.5.3 Q-Q 8.5.4 Q-Q 8.5.5 A 8.5.6 A
8.5.7 B;D 8.5.8 B 8.5.9 Q-Q 8.5.10 C 8.6.1 Q-Q
8.6.2 B 8.7.1 B 8.8.1 A OR C 8.9.1 Q-Q 8.9.2 Q-Q
8.9.3 Q-Q 8.9.4 Q-Q 8.9.5 D 8.9.6 D 8.9.7 Q-Q
8.9.8 Q-Q 8.9.9 D 8.9.10 X 8.10.1 D 8.10.2 Q-Q
8.11.1 A 8.12.1 D 8.12.2 C 8.13.1 B 8.13.2 Q-Q
8.13.3 Q-Q 8.13.4 A 8.13.5 A 8.13.6 D 8.14.1 Q-Q
8.15.1 Q-Q 8.15.2 Q-Q 8.15.3 A 8.15.4 B 8.16.1 Q-Q
8.16.2 Q-Q 8.16.3 C 8.16.4 Q-Q 8.16.5 Q-Q 8.16.6 Q-Q
8.16.7 Q-Q 8.16.8 Q-Q 8.16.9 Q-Q 8.16.10 B 8.16.11 C
8.17.1 Q-Q 8.17.2 Q-Q 8.17.3 D 8.17.4 C 8.17.5 B
8.17.6 A 8.17.7 Q-Q 8.17.8 B 8.17.9 C 8.17.10 B
8.18.1 Q-Q 8.19.1 D 8.20.1 B 8.21.1 Q-Q 8.21.2 Q-Q
8.21.3 D 8.22.1 C 8.22.2 Q-Q 8.22.3 Q-Q 8.22.4 C
8.22.5 C 8.22.6 B 8.23.1 D 8.24.1 D
9 Discrete Mathematics: Combinatory (18)

9.0.1 UGC NET CSE | December 2012 | Part 3 | Question: 25

The number of distinct bracelets of five beads made up of red, blue and green beads (two bracelets are
indistinguishable if the rotation of one yield another) is,

A. 243 B. 81 C. 51 D. 47
ugcnetcse-dec2012-paper3

Answer key ☟

9.1 Binary Tree (1)

9.1.1 Binary Tree: UGC NET CSE | July 2016 | Part 3 | Question: 31

The number of different binary trees with 6 nodes is

A. 6 B. 42 C. 132 D. 256
ugcnetcse-july2016-paper3 combinatory binary-tree

Answer key ☟

9.2 Combinatory (7)

9.2.1 Combinatory: UGC NET CSE | December 2012 | Part 3 | Question: 20

The number of ways to distribute n distinguishable objects into k distinguishable boxes, so that objects are
placed into box , equals which of the following?

A. B.
C. D.
ugcnetcse-dec2012-paper3 discrete-mathematics combinatory

Answer key ☟

9.2.2 Combinatory: UGC NET CSE | December 2012 | Part 3 | Question: 29

lamps are to be connected to a single electric outlet by using an extension board each of which has four
outlets. The number of extension boards needed to connect all the light is

A. B. C. D.
ugcnetcse-dec2012-paper3 combinatory

Answer key ☟

9.2.3 Combinatory: UGC NET CSE | December 2013 | Part 2 | Question: 38

If n and r are non-negative integers and n r, then p(n+1, r) equals to

A. B.
C. D.
ugcnetcse-dec2013-paper2 discrete-mathematics combinatory

Answer key ☟

9.2.4 Combinatory: UGC NET CSE | December 2015 | Part 2 | Question: 1

How many committees of five people can be chosen from 20 men and 12 women such that each committee
contains at least three women
 A. 75240 B. 52492 C. 41800 D. 9900
combinatory ugcnetcse-dec2015-paper2

Answer key ☟

9.2.5 Combinatory: UGC NET CSE | June 2014 | Part 2 | Question: 25

How many cards must be chosen from a deck to guarantee that at least

i. two aces of two kinds are chosen.

ii. two aces are chosen.
iii. two cards of the same kind are chosen.
iv. two cards of two different kinds are chosen.

A. B.
C. D.
ugcnetcse-june2014-paper2 combinatory

Answer key ☟

9.2.6 Combinatory: UGC NET CSE | June 2019 | Part 2 | Question: 2

How many ways are there to place indistinguishable balls into four distinguishable bins?

A. B. C. D.
ugcnetcse-june2019-paper2 combinatory

Answer key ☟

9.2.7 Combinatory: UGC NET CSE | October 2020 | Part 2 | Question: 2

How many ways are there to pack six copies of the same book into four identical boxes, where a box can
contain as many as six books?

A. B. C. D.
ugcnetcse-oct2020-paper2 discrete-mathematics combinatory

Answer key ☟

9.3 Counting (3)

9.3.1 Counting: UGC NET CSE | December 2018 | Part 2 | Question: 33

The number of substrings that can be formed from string given by

is

A. B. C. D.

ugcnetcse-dec2018-paper2 combinatory counting

Answer key ☟

9.3.2 Counting: UGC NET CSE | Junet 2015 | Part 2 | Question: 1

How many strings of digits have the property that the sum of their digits is ?

A. B. C. D.
ugcnetcse-june2015-paper2 discrete-mathematics counting

Answer key ☟
 9.3.3 Counting: UGC NET CSE | Junet 2015 | Part 2 | Question: 3

In how many ways can indistinguishable fish be placed into different ponds, so that each pond contains at
least one fish?

A. B. C. D.
ugcnetcse-june2015-paper2 combinatory counting

Answer key ☟

9.4 Euler Phi Function (1)

9.4.1 Euler Phi Function: UGC NET CSE | June 2019 | Part 2 | Question: 63

Consider the Euler’s phi function given by

where runs over all the primes dividing . What is the value of ?

A. B. C. D.
ugcnetcse-june2019-paper2 euler-phi-function

Answer key ☟

9.5 Inclusion Exclusion (1)

9.5.1 Inclusion Exclusion: UGC NET CSE | June 2019 | Part 2 | Question: 3

How many bit strings of length ten either start with a bit or end with two bits ?

A. B. C. D.
ugcnetcse-june2019-paper2 combinatory inclusion-exclusion

Answer key ☟

9.6 Parenthesization (1)

9.6.1 Parenthesization: UGC NET CSE | July 2016 | Part 2 | Question: 25

In how many ways can the string be fully paranthesized to yield an infix expression?

A. 15 B. 14 C. 13 D. 12
ugcnetcse-july2016-paper2 parenthesization combinatory

Answer key ☟

9.7 Permutation and Combination (1)

9.7.1 Permutation and Combination: Computer Science - UGC NET 2021 [ Question ID = 2353 ]

How many ways are there to assign 5 different jobs to 4 different employees if every employee is assigned at
least 1 job ?

1. 1024

2. 625

3. 240

4. 20
 discrete-mathematics permutation-and-combination engineering-mathematics

Answer key ☟

9.8 Pigeonhole Principle (1)

9.8.1 Pigeonhole Principle: UGC NET CSE | June 2019 | Part 2 | Question: 7

How many cards must be selected from a standard deck of cards to guarantee that at least three hearts are
present among them?

A. B. C. D.
ugcnetcse-june2019-paper2 combinatory pigeonhole-principle

Answer key ☟

9.9 Recurrence Relation (1)

9.9.1 Recurrence Relation: UGC NET CSE | December 2012 | Part 2 | Question: 10

The number of bit strings of length eight that will either start with a 1 bit and end with two bits 00 shall be

A. 32 B. 64 C. 128 D. 160
ugcnetcse-dec2012-paper2 combinatory recurrence-relation

Answer key ☟

Answer Keys
9.0.1 C 9.1.1 C 9.2.1 C 9.2.2 D 9.2.3 A
9.2.4 B 9.2.5 A 9.2.6 B 9.2.7 D 9.3.1 D
9.3.2 B 9.3.3 A 9.4.1 D 9.5.1 C 9.6.1 B
9.7.1 Q-Q 9.8.1 D 9.9.1 D
10 Discrete Mathematics: Graph Theory (45)

10.0.1 UGC NET CSE | June 2013 | Part 2 | Question: 38

How many edges must be removed to produce the spanning forest of a graph with N vertices, M edges and C
connected components?

A. M+N-C B. M-N-C C. M-N+C D. M+N+C

ugcnetcse-june2013-paper2

Answer key ☟

10.0.2 UGC NET CSE | June 2013 | Part 2 | Question: 37

1. Which of the following connected graph has exactly one spanning tree?

A. Complete graph B. Hamiltonian graph

C. Euler graph D. None of the above
graph-theory ugcnetcse-june2013-paper2

Answer key ☟

10.0.3 UGC NET CSE | June 2014 | Part 3 | Question: 65

Given the following statements :

: The subgraph-isomorphism problem takes two graphs and and asks whether is a subgraph of
.
: The set-partition problem takes as input a set of numbers and asks whether the numbers can be partitioned into
two sets and such that

Which of the following is true ?

A. is problem and is problem.

B. is problem and is problem.
C. is problem and is problem.
D. is problem and is problem.

ugcnetjune2014iii graph-theory

Answer key ☟

10.0.4 UGC NET CSE | June 2013 | Part 2 | Question: 5

Cyclometric complexity of a flow graph G with n vertices and e edges is

A. V(G) = e+n-2 B. V(G) = e-n+2 C. V(G) = e+n+2 D. V(G) = e-n-2

ugcnetcse-june2013-paper2 graph-theory

Answer key ☟

10.0.5 UGC NET CSE | June 2013 | Part 2 | Question: 43

Which one of the following is decimal value of a signed binary number 1101010, if it is in 2’s complement
 form?

A. -42 B. -22 C. -21 D. -106

ugcnetcse-june2013-paper2

Answer key ☟

10.0.6 UGC NET CSE | June 2013 | Part 2 | Question: 45

When a mobile telephone physically moves from one to another cell, the base station transfers ownership to the
cell getting strongest signal. This process is known as
A. handoff B. mobile switching
C. mobile routing D. cell switching
ugcnetcse-june2013-paper2

Answer key ☟

10.0.7 UGC NET CSE | December 2014 | Part 2 | Question: 03

Consider the Graph shown below :

This graph is a _________.

A. Complete Graph B. Bipartite Graph
C. Hamiltonian Graph D. All of the above
ugcnetcse-dec2014-paper2 graph-theory

Answer key ☟

10.0.8 UGC NET CSE | December 2013 | Part 3 | Question: 39

A ____ complete subgraph and a _____ subset of vertices of a graph G=(V,E) are a clique and a vertex cover
respectively
A. minimal, maximal B. minimal, minimal
C. maximal, minimal D. maximal, maximal
ugcnetcse-dec2013-paper3 engineering-mathematics discrete-mathematics graph-theory

Answer key ☟

10.0.9 UGC NET CSE | Junet 2015 | Part 2 | Question: 5

Consider a Hamiltonian Graph(G) with no loops and parallel edges. Which of the following is true with respect
to this graph (G)?

i. for each vertex of

ii. edges
iii. for every and not connected by an edge
 A. and B. and C. and D. , , and
ugcnetcse-june2015-paper2 discrete-mathematics graph-theory

Answer key ☟

10.0.10 UGC NET CSE | December 2015 | Part 2 | Question: 2

Which of the following statement(s) is/are false?

i. A connected multigraph has an Euler Circuit if and only if each of its vertices has even degree.
ii. A connected multigraph has an Euler Path but not an Euler Circuit if and only if it has exactly two vertices of odd
degree.
iii. A complete graph (Kn) has a Hamilton Circuit whenever n 3.
iv. A cycle over six vertices (C6) is not a bipartite graph but a complete graph over 3 vertices is bipartite.

Codes :

A. i only B. ii and iii C. iii only D. iv only

graph-theory ugcnetcse-dec2015-paper2

Answer key ☟

10.0.11 UGC NET CSE | December 2015 | Part 2 | Question: 4

Consider the graph given below:

The two distinct set of vertices, which make the graph bipartite are

A.
B.
C.
D.

ugcnetcse-dec2015-paper2 graph-theory

Answer key ☟

10.0.12 UGC NET CSE | December 2009 | Part 2 | Question: 02

Circle has ____________

(A) No vertices

(B) Only 1 vertex

(C) ∞ vertices

(D) None of these

ugcnetcse-dec2009-paper2 graph-theory
 Answer key ☟

10.0.13 UGC NET CSE | December 2009 | Part 2 | Question: 22

The number of edges in a complete graph of n vertices is

(A) n

(B) n(n – 1)/2

(C) n(n + 1)/2

(D) (n^2)/2
ugcnetcse-dec2009-paper2 graph-theory

Answer key ☟

10.0.14 UGC NET CSE | June 2009 | Part 2 | Question: 12

The complete graph with four vertices has edges where is :

A.
B.
C.
D.

ugcnetcse-june2009-paper2

Answer key ☟

10.0.15 UGC NET CSE | June 2009 | Part 2 | Question: 23

Which two of the following are equivalent for an undirected graph G ?

(i) G is a tree
(ii) There is at least one path between any two distinct vertices of G
(iii) G contains no cycles and has (n-1) edges
(iv) G has n edges

A. (i) and (ii) B. (i) and (iii)

C. (i) and (iv) D. (ii) and (iii)
ugcnetcse-june2009-paper2

Answer key ☟

10.0.16 UGC NET CSE | December 2008 | Part 2 | Question: 2

The graph K3,4 has:

A. edges B. edges
C. edges D. edges
ugcnetcse-dec2008-paper2 graph-theory

Answer key ☟

10.0.17 UGC NET CSE | July 2018 | Part 2 | Question: 81

E is the number of edges in the graph and f is maximum flow in the graph. When the capacities are integers, the
runtime of Ford-Fulberson algorithm is bounded by

A. B. C. D.
ugcnetcse-july2018-paper2 graph-theory
 Answer key ☟

10.0.18 UGC NET CSE | June 2019 | Part 2 | Question: 5

For which values of and does the complete bipartite graph have a Hamiltonian circuit ?

A. B.
C. D.
ugcnetcse-june2019-paper2 graph-theory

Answer key ☟

10.0.19 UGC NET CSE | December 2004 | Part 2 | Question: 23

Weighted graph :
A. Is a bi-directional graph B. Is directed graph
C. Is graph in which number associated with arc D. Eliminates table method
ugcnetcse-dec2004-paper2

Answer key ☟

10.0.20 UGC NET CSE | December 2004 | Part 2 | Question: 4

The following lists are the degrees of all the vertices of a graph :

i.
ii.
iii.
iv.

A. (i) and (ii) B. (iii) and (iv) C. (iii) and (ii) D. (ii) and (iv)
ugcnetcse-dec2004-paper2

Answer key ☟

10.0.21 UGC NET CSE | December 2006 | Part 2 | Question: 3

The number of edges in a complete graph with vertices is equal to :

A. B. C. D.
ugcnetcse-dec2006-paper2

Answer key ☟

10.0.22 UGC NET CSE | December 2007 | Part 2 | Question: 2

The number of edges in a complete graph with vertices is equal to :

A. B. C. D.
ugcnetcse-dec2007-paper2

Answer key ☟

10.1 Binary Tree (1)

10.1.1 Binary Tree: UGC NET CSE | November 2017 | Part 3 | Question: 31

Consider a full binary tree with internal nodes, internal path length , and external path length . the internal
length of a full binary tree is the sum, taken over all nodes of the tree, of the depth of each node. Similarly, the
external path length is the sum, taken over all leaves of the tree, of the depth of each leaf.
Which of the following is correct for the full binary tree?
 A. B. C. D.
ugcnetcse-nov2017-paper3 data-structures binary-tree

Answer key ☟

10.2 Euler Graph (2)

10.2.1 Euler Graph: UGC NET CSE | August 2016 | Part 2 | Question: 5

Given the following graphs :

Which of the following is correct ?

A. contains Euler circuit and does not contain Euler circuit.

B. does not contain Euler circuit and contains Euler circuit.
C. Both and do not contain Euler circuit.
D. Both and contain Euler circuit.

ugcnetcse-aug2016-paper2 graph-theory euler-graph

Answer key ☟

10.2.2 Euler Graph: UGC NET CSE | December 2010 | Part 2 | Question: 2

An undirected graph possesses an eulerian circuit if and only if it is connected and its vertices are
A. All of even degree B. All of odd degree
C. Of any degree D. Even in number
ugcnetcse-dec2010-paper2 graph-theory euler-graph

Answer key ☟

10.3 Flow Network (1)

10.3.1 Flow Network: UGC NET CSE | June 2019 | Part 2 | Question: 69

Consider the following properties with respect to a flow network in which a flow is a real-valued
function :
: For all
: for all

Which one of the following is/are correct?

A. Only B. Only C. Both and D. Neither nor

ugcnetcse-june2019-paper2 flow-network

Answer key ☟
10.4 Graph Coloring (3)

10.4.1 Graph Coloring: UGC NET CSE | January 2017 | Part 2 | Question: 5

Consider a Hamiltonian Graph with no loops or parallel edges and with . The which of the
following is true?

A. for each vertex

B.

C. whenever and are not connected by an edge

D. All of the above

ugcnetjan2017ii graph-theory graph-coloring

Answer key ☟

10.4.2 Graph Coloring: UGC NET CSE | June 2010 | Part 2 | Question: 4

: I teach algorithms and maths.

: My professor teaches maths, electronics and computer science.
: I have a student of maths.
: Algorithm is a part of computer science.
: Maths students know computer science.
What would be the chromatic number of a graph, vertices of which are the actors/entities that are involved in the
sentences to and edges to represent the associations/relationships amongst the entities/actors as expressed in the
sentences to above ?

A. B. C. D. None of these
ugcnetcse-june2010-paper2 graph-coloring

Answer key ☟

10.4.3 Graph Coloring: UGC NET CSE | June 2012 | Part 2 | Question: 4

The number of colours required to properly colour the vertices of every planer graph is

A. 2 B. 3 C. 4 D. 5
ugcnetcse-june2012-paper2 graph-theory graph-coloring

Answer key ☟

10.5 Graph Connectivity (7)

10.5.1 Graph Connectivity: UGC NET CSE | August 2016 | Part 2 | Question: 22

Consider an undirected graph where self-loops are not allowed. The vertex set of is
. There is an edge between and if or . The number of
edges in this graph is

A. B. C. D.
ugcnetcse-aug2016-paper2 graph-theory graph-connectivity

Answer key ☟
 10.5.2 Graph Connectivity: UGC NET CSE | December 2010 | Part 2 | Question: 4

The minimum number of edges in a connected graph with vertices is equal to

A. B. C. D.
ugcnetcse-dec2010-paper2 graph-theory graph-connectivity

Answer key ☟

10.5.3 Graph Connectivity: UGC NET CSE | December 2011 | Part 2 | Question: 15

McCabe’s cyclomatic metric of a graph with vertices, edges and connected component is

A. B. C. D.
ugcnetcse-dec2011-paper2 graph-theory graph-connectivity

Answer key ☟

10.5.4 Graph Connectivity: UGC NET CSE | December 2011 | Part 2 | Question: 5

Maximum number of edges in a n -Node undirected graph without self loop is

A. B.
C. D.
ugcnetcse-dec2011-paper2 graph-theory graph-connectivity

Answer key ☟

10.5.5 Graph Connectivity: UGC NET CSE | June 2013 | Part 3 | Question: 15

A vertex cover of an undirected graph is a subset vertices such that

A. Each pair of vertices in is connected by an edge

B. If then and
C. If then or
D. All pair of vertices in are not connected by an edge

ugcnetcse-june2013-paper3 graph-theory graph-connectivity

Answer key ☟

10.5.6 Graph Connectivity: UGC NET CSE | September 2013 | Part 2 | Question: 22

A simple graph G with n vertices is connected if the graph has

A. (n-1)(n-2)/2 edges B. more than (n-1) (n-2)/2 edges

C. less than (n-1) (n-2)/2 edges D. edges
ugcnetsep2013ii graph-theory graph-connectivity

Answer key ☟

10.5.7 Graph Connectivity: UGC NET CSE | September 2013 | Part 2 | Question: 8

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

A. 2451 B. 4950 C. 4851 D. 9900

ugcnetsep2013ii graph-theory graph-connectivity

Answer key ☟

10.6 Graph Isomorphism (1)

 10.6.1 Graph Isomorphism: UGC NET CSE | June 2014 | Part 2 | Question: 21

Consider the graph given below as :

Which one of the following graph is isomorphic to the above graph ?

A.

B.

C.

D.

ugcnetcse-june2014-paper2 graph-theory non-gatecse graph-isomorphism

Answer key ☟

10.7 Graph Planarity (2)

10.7.1 Graph Planarity: UGC NET CSE | December 2012 | Part 3 | Question: 46

Two graphs A and B are shown below: Which one of the following statements is true?

A. Both A and B are planar B. Neither A nor B is planar

C. A is planar and B is not D. B is planar and A is not
ugcnetcse-dec2012-paper3 graph-theory graph-planarity
 Answer key ☟

10.7.2 Graph Planarity: UGC NET CSE | June 2012 | Part 3 | Question: 72

and are two graphs as shown:

A. Both and are planar graphs B. Both and are not planar graphs
C. is planar and is not planar D. is not planar and is planar
ugcnetcse-june2012-paper3 graph-theory graph-planarity

Answer key ☟

10.8 Hamiltonian Graph (1)

10.8.1 Hamiltonian Graph: UGC NET CSE | June 2014 | Part 2 | Question: 23

Consider a complete bipartite graph . For which values of and does this, complete graph have a
Hamilton circuit
A. B.
C. D.
ugcnetcse-june2014-paper2 graph-theory hamiltonian-graph

Answer key ☟

10.9 Handshaking Theorem (1)

10.9.1 Handshaking Theorem: UGC NET CSE | June 2019 | Part 2 | Question: 4

Suppose that a connected planar graph has six vertices, each of degree four. Into how many regions is the plane
divided by a planar representation of this graph?

A. B. C. D.
ugcnetcse-june2019-paper2 graph-planarity handshaking-theorem

Answer key ☟

10.10 Minimum Spanning Tree (1)

10.10.1 Minimum Spanning Tree: UGC NET CSE | Junet 2015 | Part 2 | Question: 21

Consider the given graph

 Its Minimum Cost Spanning Tree is ______

A.

B.

C.

D.

ugcnetcse-june2015-paper2 graph-theory minimum-spanning-tree

Answer key ☟

10.11 Non Planar (1)

10.11.1 Non Planar: UGC NET CSE | December 2013 | Part 2 | Question: 39

A graph is non-planar if and only if it contains a subgraph homomorphic to

A. B.
C. D.
ugcnetcse-dec2013-paper2 graph-theory non-planar

Answer key ☟

10.12 Tree (2)

 10.12.1 Tree: UGC NET CSE | December 2012 | Part 2 | Question: 33

Consider the tree given below:

Using the property of eccentricity of a vertex, find every vertex that is the centre of the given tree:

A. d & h B. c & k C. g, b, c, h, i, m D. c & h

ugcnetcse-dec2012-paper2 graph-theory tree graph-connectivity

Answer key ☟

10.12.2 Tree: UGC NET CSE | December 2013 | Part 2 | Question: 36

How many edges are there in a forest of t-trees containing a total of n vertices ?

A. n + t B. n – t C. n ∗ t D. n t
ugcnetcse-dec2013-paper2 data-structures tree

Answer key ☟

Answer Keys
10.0.1 C 10.0.2 D 10.0.3 B 10.0.4 B 10.0.5 B
10.0.6 A 10.0.7 C 10.0.8 C 10.0.9 D 10.0.10 D
10.0.11 C 10.0.12 Q-Q 10.0.13 Q-Q 10.0.14 Q-Q 10.0.15 Q-Q
10.0.16 Q-Q 10.0.17 Q-Q 10.0.18 C 10.0.19 Q-Q 10.0.20 Q-Q
10.0.21 Q-Q 10.0.22 Q-Q 10.1.1 B 10.2.1 C 10.2.2 A
10.3.1 A 10.4.1 D 10.4.2 Q-Q 10.4.3 C 10.5.1 Q-Q
10.5.2 Q-Q 10.5.3 D 10.5.4 D 10.5.5 C 10.5.6 B
10.5.7 C 10.6.1 C 10.7.1 A 10.7.2 D 10.8.1 C
10.9.1 B 10.10.1 B 10.11.1 C 10.12.1 D 10.12.2 B
11 Discrete Mathematics: Mathematical Logic (44)

11.0.1 UGC NET CSE | June 2013 | Part 2 | Question: 39

Which of the following shall be a compound proposition involving the propositions p, q and r, that is true when
exactly two of the p, q and r are true and is false otherwise?

A.
B.
C.
D.

ugcnetcse-june2013-paper2

Answer key ☟

11.0.2 UGC NET CSE | June 2013 | Part 2 | Question: 40

The truth value of the statements:

, (where the notation denotes the proposition “There exists a

unique such that is true”) are:

A. True and False B. False and True C. False and False D. True and True
ugcnetcse-june2013-paper2

Answer key ☟

11.0.3 UGC NET CSE | September 2013 | Part 3 | Question: 67

The tracing model in Prolog describes program execution in terms of certain events. These events are
A. call and exit B. call and fail
C. call, exit and redo D. call, exit, redo and fail
ugcnetcse-sep2013-paper3

11.0.4 UGC NET CSE | December 2015 | Part 2 | Question: 6

Which of the following arguments are not valid?

i. "If Gora gets the job and works hard, then he will be promoted. if Gora gets promotion, then he will be happy. He
will not be happy, therefore, either he will not get the job or he will not work hard."
ii. "Either Puneet is not guilty or Pankaj is telling the truth. Pankaj is not telling the truth, therefore, Puneet is not
guilty."
iii. If is a real number such that , then . Suppose that , then .
A. i and iii B. ii and iii C. i,ii, and iii D. i and ii
ugcnetcse-dec2015-paper2 discrete-mathematics mathematical-logic

Answer key ☟

11.0.5 UGC NET CSE | June 2014 | Part 3 | Question: 32

________ predicate calculus allows quantified variables to refer to objects in the domain of discourse and not to
predicates or functions.

A. Zero-order B. First-order
C. Second-order D. High-order
ugcnetjune2014iii discrete-mathematics mathematical-logic

Answer key ☟
11.0.6 UGC NET CSE | Junet 2015 | Part 2 | Question: 8

"If my computations are correct and I pay the electric bill, then I will run out of money. If I don't pay the electric
bill, the power will be turned off. Therefore, If I don't run out of money and the power is still on then my
computations are incorrect."
Convert this argument into logical notations using the variables for propositions of computations, electric bills,
out of money and the power respectively. (Where means NOT).

A.
B.
C.
D.

ugcnetcse-june2015-paper2 mathematical-logic

Answer key ☟

11.0.7 UGC NET CSE | December 2014 | Part 3 | Question: 55

Equivalent logical expression for the Well Formed Formula ,

is
A. B.
C. D.
ugcnetcse-dec2014-paper3 mathematical-logic

Answer key ☟

11.0.8 UGC NET CSE | December 2014 | Part 3 | Question: 57

The resolvent of the set of clauses is

A. B.
C. D.
ugcnetcse-dec2014-paper3 mathematical-logic

Answer key ☟

11.0.9 UGC NET CSE | Junet 2015 | Part 3 | Question: 22

The casual form of the disjunctive normal form is:

A.
B.
C.
D.

ugcnetcse-june2015-paper3 mathematical-logic

Answer key ☟

11.0.10 UGC NET CSE | December 2015 | Part 2 | Question: 7

Let P(m,n) be the statement "m divides n" where the universe of discourse for both the variable is the set of
positive integers. Determine the truth values of each of the following propositions:

i. ,
ii.
iii.
A. a-True, b-True, c-False
B. a-True, b-False, c-False
C. a-False, b-False, c-False
 D. a-True, b-True, c-True

ugcnetcse-dec2015-paper2 discrete-mathematics mathematical-logic

Answer key ☟

11.0.11 UGC NET CSE | December 2015 | Part 2 | Question: 9

Consider the compund propositions given below as:

i.
ii.
iii.

Which of the above propositions are tautologies

A. i and iii B. ii and iii C. i and ii D. i, ii, and iii

ugcnetcse-dec2015-paper2 mathematical-logic

Answer key ☟

11.0.12 UGC NET CSE | June 2011 | Part 2 | Question: 3

The proposition is equivalent to

A. B.
C. D.
ugcnetcse-june2011-paper2 discrete-mathematics mathematical-logic

Answer key ☟

11.0.13 UGC NET CSE | November 2017 | Part 2 | Question: 8

Let and be two propositions is equivalent to

A. B.
C. D.
ugcnetcse-nov2017-paper2 discrete-mathematics mathematical-logic

Answer key ☟

11.0.14 UGC NET CSE | December 2018 | Part 2 | Question: 2

​Match List-I with List-II and choose the correct answer from the code given below :

A. (a)-(i), (b)-(ii), (c)-(iii), (d)-(iv) B. (a)-(ii), (b)-(i), (c)-(iii), (d)-(iv)

C. (a)-(iii), (b)-(iv), (c)-(ii), (d)-(i) D. (a)-(iv), (b)-(iii), (c)-(ii), (d)-(i)
ugcnetcse-dec2018-paper2 mathematical-logic

Answer key ☟

11.0.15 UGC NET CSE | December 2018 | Part 2 | Question: 1

​In mathematical logic, which of the following are statements?

i. There will be snow in January.

ii. What is the time now?
iii. Today is Sunday.
 iv. You must study Discrete mathematics

Choose the correct answer from the code given below:

A. i and iii B. i and ii C. ii and iv D. iii and iv

ugcnetcse-dec2018-paper2 mathematical-logic

Answer key ☟

11.0.16 UGC NET CSE | January 2017 | Part 2 | Question: 2

Match the following :

Codes:

ugcnetjan2017ii mathematical-logic

Answer key ☟

11.0.17 UGC NET CSE | October 2020 | Part 2 | Question: 53

Consider the following statements:

i. Any tree is -colorable

ii. A graph has no cycles of even length if it is bipartite
iii. A graph is -colorable if is bipartite
iv. A graph can be colored with colors if is the maximum degree of any vertex in the graph
v. A graph can be colored with colors if it has edges.

Choose the correct answer from the options given below:

A. and are incorrect B. and are incorrect

C. and are incorrect D. and are incorrect
ugcnetcse-oct2020-paper2 discrete-mathematics graph-theory

Answer key ☟

11.0.18 Computer Science - UGC NET 2021 [ Question ID = 2352 ]

Which of these statements about the floor and ceiling functions are correct ?
Statement 1 : ⌊2x⌋ = ⌊x⌋ + ⌊x + (1/2)⌋ for all real numbers x.

Statement 2 : ⌈x + y⌉ = ⌈x⌉ + ⌈y⌉ for all real numbers x and y.

1. Both Statement I and Statement II are true.

2. Both Statement I and Statement II are false.

3. Statement I is true but Statement II is false.

 4. Statement I is false but Statement II is true.

discrete-mathematics mathematical-logic engineering-mathematics

Answer key ☟

11.0.19 UGC NET CSE_DEC 2023

If universe of disclosure are all real numbers, then which of the following are true?
(A) ∃x ∀y (x + y = y)
(B) ∀x ∀y (((x ≥ 0) ∧ (y < 0))→ (x - y > 0))
(C) ∃x ∃y (((x ≤ 0) ∧ (y ≤ 0)) ∧ (x - y > 0))
(D) ∀x ∀y ((x ≠ 0) ∧ (y ≠ 0) ↔ (xy ≠ 0))
Choose the correct answer from the options given below:
(1) (A) and (B) Only
(2) (A), (C) and (D) Only
(3) (A), (B) and (D) Only
(4) (A), (B), (C) and (D) Only

Answer key ☟

11.1 Countable Uncountable Set (1)

11.1.1 Countable Uncountable Set: UGC NET CSE | December 2015 | Part 2 | Question: 3

Which of the following is/are not true ?

i. The set of negative integers is countable.

ii. The set of integers that are multiples of 7 is countable.
iii. The set of even integers is countable.
iv. The set of real numbers between 0 and 1⁄2 is countable.
A. i and iii B. ii and iv C. ii only D. iv only
ugcnetcse-dec2015-paper2 discrete-mathematics set-theory countable-uncountable-set

Answer key ☟

11.2 First Order Logic (5)

11.2.1 First Order Logic: UGC NET CSE | January 2017 | Part 3 | Question: 60

The first order logic (FOL) statement is equivalent to which of the following?

A.
B.
C.
D.

ugcnetcse-jan2017-paper3 mathematical-logic first-order-logic

Answer key ☟

11.2.2 First Order Logic: UGC NET CSE | July 2018 | Part 2 | Question: 77

Consider the following English sentence:

"Agra and Gwalior are both in India".
A student has written a logical sentence for the above English sentence in First-Order Logic using predicate IN(x, y),
which means x is in y, as follows.
 In(Agra, India) In(Gwalior, India)
Which one of the following is correct with respect to the above logical sentence?

A. It is syntactically valid but does not express the meaning of the English sentence
B. It is syntactically valid and expresses the meaning of the English sentence also
C. It is syntactically invalid but expresses the meaning of the English sentence
D. It is syntactically invalid and does not express the meaning of the English sentence

ugcnetcse-july2018-paper2 discrete-mathematics first-order-logic

Answer key ☟

11.2.3 First Order Logic: UGC NET CSE | June 2013 | Part 3 | Question: 69

If we convert
to .
This process is known as
A. Simplification
B. Unification
C. Skolemization
D. Resolution

ugcnetcse-june2013-paper3 discrete-mathematics first-order-logic

Answer key ☟

11.2.4 First Order Logic: UGC NET CSE | June 2014 | Part 2 | Question: 19

The notation denotes the proposition “there exists a unique such that is true”. Give the truth
values of the following statements :
I.
II.
A. Both & are true. B. Both & are false.
C. - false, - true D. - true, - false
ugcnetcse-june2014-paper2 mathematical-logic first-order-logic

Answer key ☟

11.2.5 First Order Logic: UGC NET CSE | September 2013 | Part 3 | Question: 1

Which of the following is a correct predicate logic statement for “Every Natural number has one successor”?

A.
B.
C.
D.

first-order-logic ugcnetcse-sep2013-paper3

Answer key ☟

11.3 Functions (1)

11.3.1 Functions: UGC NET CSE | July 2018 | Part 2 | Question: 87

Match the following in and , for a function :

 A. B.
C. D.
ugcnetcse-july2018-paper2 discrete-mathematics functions

Answer key ☟

11.4 Group Theory (1)

11.4.1 Group Theory: UGC NET CSE | December 2015 | Part 2 | Question: 10

Which of the following property/ies a Group G must hold, in order to be an Abelian group?

i. The distributive property

ii. The commutative property
iii. The symmetric property
A. i and ii B. ii and iii C. i only D. ii only
ugcnetcse-dec2015-paper2 discrete-mathematics set-theory&algebra group-theory

Answer key ☟

11.5 Prolog (1)

11.5.1 Prolog: UGC NET CSE | December 2015 | Part 3 | Question: 7

Given the following set of prolog clauses:

father(X,Y) :
parent(X,Y),
male(X),
parent(Sally, Bob),
parent(Jim, Bob),
parent(Alice, Jane),
male(Bob),
male(Jim),
female(Salley),
female(Alice)

How many atoms are matched to the variable 'X' before the query father(X, Jane) reports a Result?

A. B. C. D.
ugcnetcse-dec2015-paper3 mathematical-logic prolog non-gatecse

Answer key ☟

11.6 Propositional Logic (15)

11.6.1 Propositional Logic: Computer Science - UGC NET 2021 [ Question ID = 2351 ]

Which of the following are logically equivalent ?

i. ¬p -> ( q -> r ) and q -> ( p v r )

ii. ( p -> q ) -> r and p -> ( q -> r )
iii. ( p -> q ) -> ( r -> s ) and ( p -> r) -> ( q -> s )

Choose the correct answer from the options given :

A. i and ii only B. i and iii only
C. i only D. ii and iii only
 propositional-logic discrete-mathematics mathematical-logic

Answer key ☟

11.6.2 Propositional Logic: UGC NET CSE | December 2006 | Part 2 | Question: 2

The proposition ~ q ∨ p is equivalent to :

A. B. C. D.

ugcnetcse-dec2006-paper2 mathematical-logic propositional-logic

Answer key ☟

11.6.3 Propositional Logic: UGC NET CSE | December 2013 | Part 2 | Question: 34

Let P(m,n) be the statement "m divides n" where the universe of discourse for both the variable is the set of
positive integers. Determine the truth values of each of the following propositions:

I. ,
II.
A. Both I and II are true B. Both I and II are false
C. I-false & II-true D. I-true& II-false
ugcnetcse-dec2013-paper2 discrete-mathematics propositional-logic

Answer key ☟

11.6.4 Propositional Logic: UGC NET CSE | December 2015 | Part 3 | Question: 44

In propositional logic, given and , we can infer ________

A. B.
C. D.
ugcnetcse-dec2015-paper3 propositional-logic mathematical-logic

Answer key ☟

11.6.5 Propositional Logic: UGC NET CSE | January 2017 | Part 2 | Question: 6

In propositional logic if and are two premises such that

is the premise :

A. B. C. D.
ugcnetjan2017ii discrete-mathematics propositional-logic

Answer key ☟

11.6.6 Propositional Logic: UGC NET CSE | January 2017 | Part 3 | Question: 59

Which of the following statements is true?

A. The sentence is a logical consequence of if and only if is satisfiable.

B. The sentence is a logical consequence of if and only if is valid.
C. The sentence is a logical consequence of if and only if is consistent.
D. The sentence is a logical consequence of if and only if is inconsistent.
 ugcnetcse-jan2017-paper3 mathematical-logic propositional-logic

Answer key ☟

11.6.7 Propositional Logic: UGC NET CSE | June 2009 | Part 2 | Question: 25

The prepositional formula given by the tree :

is :

A.
B.
C.
D. None

ugcnetcse-june2009-paper2 propositional-logic

Answer key ☟

11.6.8 Propositional Logic: UGC NET CSE | June 2014 | Part 2 | Question: 20

Give a compound proposition involving propositions and that is true when exactly two of and are
true and is false otherwise

A.
B.
C.
D.

ugcnetcse-june2014-paper2 mathematical-logic propositional-logic

Answer key ☟

11.6.9 Propositional Logic: UGC NET CSE | June 2019 | Part 2 | Question: 6

Which of the following is principal conjunctive normal form for ?

A. B.
C. D.
ugcnetcse-june2019-paper2 propositional-logic

Answer key ☟

11.6.10 Propositional Logic: UGC NET CSE | June 2019 | Part 2 | Question: 8

Match List-I with List-II:

Choose the correct option from those given below:

 A. (a) – (ii); (b) – (iii); (c) – (i); (d) – (iv)
B. (a) – (ii); (b) – (i); (c) – (iii); (d) – (iv)
C. (a) – (iv); (b) – (i); (c) – (iii); (d) – (ii)
D. (a) – (iv); (b) – (iii); (c) – (i); (d) – (ii)

ugcnetcse-june2019-paper2 propositional-logic

Answer key ☟

11.6.11 Propositional Logic: UGC NET CSE | Junet 2015 | Part 2 | Question: 10

Consider a proposition given as:

, if and and its proof as:
If , then
Which of the following is correct with respect to the given proposition and its proof?

i. The proof shows the converse

ii. The proof starts by assuming what is to be shown
iii. The proof is correct and there is nothing wrong

A. only B. only C. and D. only

ugcnetcse-june2015-paper2 discrete-mathematics propositional-logic

Answer key ☟

11.6.12 Propositional Logic: UGC NET CSE | Junet 2015 | Part 2 | Question: 9

Match the following :

A. B.
C. D.
ugcnetcse-june2015-paper2 mathematical-logic propositional-logic

Answer key ☟

11.6.13 Propositional Logic: UGC NET CSE | October 2020 | Part 2 | Question: 61

Consider the statement below.

A person who is radical is electable if he/she is conservative , but otherwise not electable.
Few probable logical assertions of the above sentence are given below.

i.
ii.
iii.
iv.

Which of the above logical assertions are true?

Choose the correct answer from the options given below:

A. only B. only C. and only D. and only

ugcnetcse-oct2020-paper2 discrete-mathematics propositional-logic

Answer key ☟
 11.6.14 Propositional Logic: UGC NET CSE | October 2022 | Part 1 | Question: 85

Consider as logical variables. Identify which of the following represents correct logical equivalence :
(A)
(B)
(C)
(D)
Choose the correct answer from the options given below :

A. (A) and (D) only B. (B) and (C) only, C. (A) and (C) only D. (B) and (D) only
ugcnetcse-oct2022-paper1 propositional-logic

11.6.15 Propositional Logic: UGC NET CSE | September 2013 | Part 2 | Question: 24

The quantification denotes the proposition “There exists a unique x such that P(x) is true”, express he
quantification using universal and existential quantifications and logical operators?

A.
B.
C.
D.

ugcnetsep2013ii discrete-mathematics propositional-logic

Answer key ☟

11.7 Relations (1)

11.7.1 Relations: UGC NET CSE | October 2020 | Part 2 | Question: 39

Consider the following properties:

i. Reflexive
ii. Antisymmetric
iii. Symmetric

Let and be a relation on . Which of

the following property (properties) is (are) satisfied by the relation ?

A. Only B. Only C. Both and D. and not

ugcnetcse-oct2020-paper2 discrete-mathematics set-theory&algebra relations

Answer key ☟

Answer Keys
11.0.1 C 11.0.2 D 11.0.3 D 11.0.4 B 11.0.5 B
11.0.6 A 11.0.7 C 11.0.8 B 11.0.9 A 11.0.10 A
11.0.11 X 11.0.12 Q-Q 11.0.13 A;B 11.0.14 D 11.0.15 A
11.0.16 A 11.0.17 C 11.0.18 Q-Q 11.0.19 Q-Q 11.1.1 D
11.2.1 B 11.2.2 A 11.2.3 C 11.2.4 A 11.2.5 A
11.3.1 Q-Q 11.4.1 D 11.5.1 A 11.6.1 Q-Q 11.6.2 Q-Q
11.6.3 C 11.6.4 B;C 11.6.5 A;B;C;D 11.6.6 B 11.6.7 Q-Q
11.6.8 D 11.6.9 A 11.6.10 D 11.6.11 C 11.6.12 A
11.6.13 D 11.6.14 Q-Q 11.6.15 C 11.7.1 D
12 Discrete Mathematics: Set Theory & Algebra (20)

12.0.1 UGC NET CSE | July 2016 | Part 2 | Question: 1

How many difference equivalence relations with exactly three different equivalence classes are there on a set
with five elements?

A. 10 B. 15 C. 25 D. 30
ugcnetcse-july2016-paper2 discrete-mathematics set-theory&algebra

Answer key ☟

12.0.2 UGC NET CSE | June 2019 | Part 2 | Question: 9

Find the zero-one matrix of the transitive closure of the relation given by the matrix :

A.

B.

C.

D.

ugcnetcse-june2019-paper2 set-theory&algebra

Answer key ☟

12.0.3 UGC NET CSE | December 2004 | Part 2 | Question: 2

If then is :

A. B. C. D. None of these
ugcnetcse-dec2004-paper2

Answer key ☟

12.1 Boolean (1)

12.1.1 Boolean: UGC NET CSE | June 2019 | Part 2 | Question: 13

How many different Boolean functions of degree are the

A. B. C. D.
ugcnetcse-june2019-paper2 boolean function

Answer key ☟

12.2 Complement In Fuzzy Set (1)

 12.2.1 Complement In Fuzzy Set: UGC NET CSE | June 2014 | Part 3 | Question: 07

Given

then will be: (where complement)

A. B.
C. D.
ugcnetjune2014iii fuzzy-set complement-in-fuzzy-set

Answer key ☟

12.3 Euler Phi Function (1)

12.3.1 Euler Phi Function: UGC NET CSE | June 2019 | Part 2 | Question: 70

Consider the following statements:

: For any integer for all , where is Euler’s phi function.
: If is prime, then for all .
Which one of the following is/are correct?

A. Only B. Only C. Both and D. Neither nor

ugcnetcse-june2019-paper2 euler-phi-function set-theory&algebra

Answer key ☟

12.4 Factors (1)

12.4.1 Factors: UGC NET CSE | January 2017 | Part 2 | Question: 4

How many multiples of are there between the following pairs of numbers?

and and and

A. and B. and C. and D. and

ugcnetjan2017ii set-theory&algebra factors

Answer key ☟

12.5 Function Composition (1)

12.5.1 Function Composition: UGC NET CSE | December 2013 | Part 2 | Question: 37

Let f and g be the functions from the set of integers defined by and . Then the
composition of f and g and g and f is given as
A. 6x+7, 6x+11 B. 6x+11, 6x+7
C. 5x+5, 5x+5 D. None of the above
ugcnetcse-dec2013-paper2 algebra function-composition

Answer key ☟

12.6 Functions (3)

12.6.1 Functions: UGC NET CSE | December 2014 | Part 2 | Question: 05

If we define the functions , and that map into by :

, then the value of the composite functions and
are given as
 A. and B. and
C. and D. and
ugcnetcse-dec2014-paper2 discrete-mathematics functions

Answer key ☟

12.6.2 Functions: UGC NET CSE | January 2017 | Part 2 | Question: 3

The functions mapping into are defined as :

and
Then find the value of the following composite functions :
and

A. and

B. and

C. and

D. and

ugcnetjan2017ii functions set-theory&algebra

Answer key ☟

12.6.3 Functions: UGC NET CSE | September 2013 | Part 2 | Question: 25

If F and G are Boolean functions of degree n. Then, which of the following is true?
A. F F + G and F G F B. G F + G and F G G
C. F F + G and F G F D. G F + G and F G F
functions ugcnetsep2013ii

Answer key ☟

12.7 Inclusion Exclusion (1)

12.7.1 Inclusion Exclusion: UGC NET CSE | October 2020 | Part 2 | Question: 1

The number of positive integers not exceeding that are either odd or the square of an integer is _______

A. B. C. D.
ugcnetcse-oct2020-paper2 discrete-mathematics inclusion-exclusion

Answer key ☟

12.8 Poset (1)

12.8.1 Poset: UGC NET CSE | June 2019 | Part 2 | Question: 1

Consider the poset

Which of the following is correct for the given poset ?

A. There exist a greatest element and a least element

B. There exist a greatest element but not a least element
C. There exist a least element but not a greatest element
D. There does not exist a greatest element and a least element

ugcnetcse-june2019-paper2 poset set-theory&algebra

Answer key ☟
12.9 Power Set (1)

12.9.1 Power Set: UGC NET CSE | December 2012 | Part 2 | Question: 4

The power set of the set is

A. B.
C. D.
ugcnetcse-dec2012-paper2 set-theory&algebra set-theory power-set

Answer key ☟

12.10 Relational Algebra (1)

12.10.1 Relational Algebra: UGC NET CSE | December 2008 | Part 2 | Question: 12

A relation R in {1,2,3,4,5,6} is given by {(1,2),(2,3),(3,4),(4,4),(4,5)}. This relation is:

A. reflexive B. symmetric
C. transitive D. not reflexive, not symmetric and not transitive
ugcnetcse-dec2008-paper2 set-theory&algebra relational-algebra

Answer key ☟

12.11 Relations (5)

12.11.1 Relations: UGC NET CSE | December 2009 | Part 2 | Question: 01

If she is my friend and you are her friend, then we are friends. Given this, the friend relationship in this context
is ____________.

(i) commutative (ii) transitive (iii) implicative (iv) equivalence

(A) (i) and (ii)

(B) (iii)

(C) (i), (ii), (iii) and (iv)

(D) None of these

ugcnetcse-dec2009-paper2 set-theory&algebra relations

Answer key ☟

12.11.2 Relations: UGC NET CSE | July 2016 | Part 2 | Question: 3

Suppose that and are reflecive relations on a set A. Which of the following statements is correct?

A. is reflexive and is irreflexive

B. is irreflexive and is reflexive
C. Both and are reflexive
D. Both and are irreflexive

ugcnetcse-july2016-paper2 discrete-mathematics relations

Answer key ☟

12.11.3 Relations: UGC NET CSE | June 2005 | Part 2 | Question: 3

The transitive closure of a relation on set whose relation matrix is :

 A.

B.

C.

D.

ugcnetcse-june2005-paper2 discrete-mathematics relations

Answer key ☟

12.11.4 Relations: UGC NET CSE | June 2010 | Part 2 | Question: 1

" is a clone of " means is identical to in terms of the physical attributes namely, height, weight and
complexion. Given, height, weight and complexion only form a complete set of attributes for an entity, cloning
is an equivalence relation. What is your impression about this statement ?

A. The statement is true B. The statement is false

C. The truth value of the statement cannot be computed D. None of these
ugcnetcse-june2010-paper2 set-theory&algebra relations

Answer key ☟

12.11.5 Relations: UGC NET CSE | June 2013 | Part 2 | Question: 34

The relation “devides” on a set of positive integers is_____

A. Symmetric and transitive B. Anti symmetric and transitive
C. Symmetric only D. Transitive only
ugcnetcse-june2013-paper2 relations set-theory&algebra

Answer key ☟

Answer Keys
12.0.1 C 12.0.2 A 12.0.3 Q-Q 12.1.1 A 12.2.1 C
12.3.1 A 12.4.1 C 12.5.1 A 12.6.1 D 12.6.2 D
12.6.3 A 12.7.1 C 12.8.1 D 12.9.1 B 12.10.1 Q-Q
12.11.1 Q-Q 12.11.2 C 12.11.3 Q-Q 12.11.4 Q-Q 12.11.5 B
13 Engineering Mathematics: Discrete Mathematics (36)

13.0.1 UGC NET CSE | June 2012 | Part 3 | Question: 17

Let denote “x+y=0” and let there be two quantifications given as

I.
II.

where and are real numbers. Then which of the following is valid?

A. I is true and II is false B. I is false and II is true

C. I is false and II is also false D. both I and II are true
ugcnetcse-june2012-paper3 discrete-mathematics mathematical-logic

Answer key ☟

13.0.2 UGC NET CSE | June 2012 | Part 3 | Question: 50

How many relations are there on a set with n elements that are symmetric and a set with n elements that are
reflexive and symmetric?

A. B.
C. D.
ugcnetcse-june2012-paper3 discrete-mathematics set-theory&algebra

Answer key ☟

13.0.3 UGC NET CSE | December 2014 | Part 2 | Question: 01

Consider a set .
How many members of A shall be divisible by or by or by both and ?

A. 533 B. 599 C. 467 D. 66

ugcnetcse-dec2014-paper2 discrete-mathematics set-theory&algebra

Answer key ☟

13.0.4 UGC NET CSE | December 2013 | Part 3 | Question: 24

The objective of ____ procedure is to discover at least one ____ that causes two literals to match.
A. unification, validation B. unification, substituion
C. substitution, unification D. minimax, maximum
ugcnetcse-dec2013-paper3 discrete-mathematics mathematical-logic

Answer key ☟

13.0.5 UGC NET CSE | Junet 2015 | Part 3 | Question: 24

Which one of the following is true?

A. The resolvent of two Horn clauses is not a Horn clause

B. The resolvent of two Horn clauses is a Horn clause
C. If we resolve a negated goal G against a fact or rule A to get clause C then C has positive literal or non-null goal
D. If we resolve a negated goal G against a fact or rule A to get clause C then C has positive literal or null goal

ugcnetcse-june2015-paper3 discrete-mathematics mathematical-logic

Answer key ☟
13.0.6 UGC NET CSE | July 2018 | Part 2 | Question: 86

If then is

A. Z B. Q C. R D. C
ugcnetcse-july2018-paper2 discrete-mathematics

Answer key ☟

13.0.7 UGC NET CSE | October 2020 | Part 2 | Question: 86

Let be a simple undirected graph, be a DFS tree on , and be the BFS tree on . Consider the
following statements.
Statement : No edge of is a cross with respect to
Statement : For every edge of , if is at depth and is at depth in then
In the light of the above statements, choose the correct answer from the options given below

A. Both Statement and Statement are true

B. Both Statement and Statement are false
C. Statement is correct but Statement is false
D. Statement is incorrect but Statement is true

ugcnetcse-oct2020-paper2 discrete-mathematics graph-theory

13.0.8 UGC NET CSE | October 2020 | Part 2 | Question: 38

What kind of clauses are available in conjunctive normal form?

A. Disjunction of literals B. Disjunction of variables

C. Conjunction of literals D. Conjunction of variables
ugcnetcse-oct2020-paper2 discrete-mathematics mathematical-logic

Answer key ☟

13.0.9 UGC NET CSE | October 2020 | Part 2 | Question: 37

If is my friend, and is perfect, then correct logical translation of the statement “some of my
friends are not perfect” is ______
A. B.
C. D.
ugcnetcse-oct2020-paper2 discrete-mathematics mathematical-logic

Answer key ☟

13.0.10 UGC NET CSE | October 2020 | Part 2 | Question: 26

Let be a directed graph whose vertex set is the set of numbers from to . There is an edge from a vertex
to a vertex if and only if either or . The minimum number of edges in a path in from vertex
to vertex is ______

A. B. C. D.
ugcnetcse-oct2020-paper2 discrete-mathematics graph-theory

Answer key ☟

13.0.11 UGC NET CSE | October 2020 | Part 2 | Question: 3

Which of the following pairs of propositions are not logically equivalent?

A. and
 B. and
C. and
D. and

ugcnetcse-oct2020-paper2 discrete-mathematics mathematical-logic

Answer key ☟

13.1 Boolean Function (1)

13.1.1 Boolean Function: UGC NET CSE | August 2016 | Part 2 | Question: 1

The Boolean function is equal to the Boolean function :

A. B. C. D.
ugcnetcse-aug2016-paper2 discrete-mathematics boolean-function

Answer key ☟

13.2 Combinatory (2)

13.2.1 Combinatory: UGC NET CSE | December 2012 | Part 3 | Question: 21

How many solutions do the following equations have?

where

A. B. C. D.
ugcnetcse-dec2012-paper3 discrete-mathematics combinatory

Answer key ☟

13.2.2 Combinatory: UGC NET CSE | December 2015 | Part 2 | Question: 48

How many solutions are there for the equation subject to the constraints that
?

A. 4960 B. 2600 C. 23751 D. 8855

ugcnetcse-dec2015-paper2 discrete-mathematics combinatory

Answer key ☟

13.3 Equivalence Class (1)

13.3.1 Equivalence Class: UGC NET CSE | July 2018 | Part 2 | Question: 89

Which of the following is an equivalence relation on the set of all functions from Z to Z?

A.
B.
C.
D.

ugcnetcse-july2018-paper2 discrete-mathematics equivalence-class

Answer key ☟

13.4 First Order Logic (2)

 13.4.1 First Order Logic: UGC NET CSE | December 2012 | Part 3 | Question: 58

Skolmization is the process of

A. bringing all the quantifiers in the beginning of a formula in FDL

B. removing all the universal quantifiers
C. removing all the extential quantifiers
D. all of the above

ugcnetcse-dec2012-paper3 engineering-mathematics discrete-mathematics first-order-logic

Answer key ☟

13.4.2 First Order Logic: UGC NET CSE | October 2020 | Part 2 | Question: 40

Consider the following argument with premise and conclusion

A. This is a valid argument B. Steps and are not correct inferences

C. Steps and are not correct inferences D. Step is not a correct inference
ugcnetcse-oct2020-paper2 discrete-mathematics first-order-logic

Answer key ☟

13.5 Functions (2)

13.5.1 Functions: UGC NET CSE | December 2011 | Part 2 | Question: 4

Domain and Range of the function is

A. B.
C. D.
ugcnetcse-dec2011-paper2 discrete-mathematics functions

Answer key ☟

13.5.2 Functions: UGC NET CSE | December 2012 | Part 3 | Question: 19

Identify the following activation function:

, Z, X, Y are parameters.

A. Step function B. Ramp function

C. Sigmoid function D. Gaussian function
ugcnetcse-dec2012-paper3 discrete-mathematics functions

Answer key ☟

13.6 Group Theory (1)

13.6.1 Group Theory: UGC NET CSE | June 2012 | Part 3 | Question: 67

Let a*H and b*H be two cosets of H.

I. Either a*H and b*H are disjoint

II. a*H and b*H are identical
 Then,

A. Only I is true B. Only II is true

C. I or II is true D. I and II is false
ugcnetcse-june2012-paper3 discrete-mathematics set-theory&algebra group-theory

Answer key ☟

13.7 Linear Programming (1)

13.7.1 Linear Programming: UGC NET CSE | July 2016 | Part 3 | Question: 70

Consider the statement

"Either "
The negation of this statement is

A. x<-2 or 2<x or -1<x<1 B. x<-2 or 2<x

C. -1<x<1 D. x -2 or 2 x or -1<x<1
ugcnetcse-july2016-paper3 linear-programming

Answer key ☟

13.8 Number Representation (1)

13.8.1 Number Representation: UGC NET CSE | December 2011 | Part 2 | Question: 34

Negative numbers cannot be represented in

A. Signed magnitude form B. complement form

C. complement form D. None of the above
ugcnetcse-dec2011-paper2 discrete-mathematics number-representation

Answer key ☟

13.9 Partial Order (2)

13.9.1 Partial Order: UGC NET CSE | December 2010 | Part 2 | Question: 3

A partially ordered set is said to be a lattice if every two elements in the set have

A. A unique least upper bound B. A unique greatest lower bound

C. Both and D. None of the above
ugcnetcse-dec2010-paper2 discrete-mathematics partial-order

Answer key ☟

13.9.2 Partial Order: UGC NET CSE | July 2018 | Part 2 | Question: 90

Which of the following statements is true?

A. is not totally ordered

B. The set inclusion relation is a partial ordering on the power set of a set S
C. is a poset
D. The directed graph is not a partial order

ugcnetcse-july2018-paper2 discrete-mathematics partial-order

Answer key ☟

13.10 Propositional Logic (8)

13.10.1 Propositional Logic: UGC NET CSE | August 2016 | Part 2 | Question: 2

Let us assume that you construct ordered tree to represent the compound proposition
 .
Then, the prefix expression and post-fix expression determined using this ordered tree are given as _____ and
______ respectively.

A.
B.
C.
D.

ugcnetcse-aug2016-paper2 discrete-mathematics propositional-logic

Answer key ☟

13.10.2 Propositional Logic: UGC NET CSE | August 2016 | Part 3 | Question: 70

Let mean is a vegetarian, for is meat, and for eats . Based on these, consider the
following sentences :
I.
II.
III.
One can determine that
A. Only and are equivalent sentences B. Only and are equivalent sentences.
C. Only and are equivalent sentence . D. and are equivalent sentences.
ugcnetcse-aug2016-paper3 discrete-mathematics propositional-logic

Answer key ☟

13.10.3 Propositional Logic: UGC NET CSE | August 2016 | Part 3 | Question: 74

Consider the following logical inferences :

: If it is Sunday then school will not open.
The school was open.
Inference : It was not Sunday.
: If it is Sunday then school will not open.
It was not Sunday.
Inference : The school was open.
Which of the following is correct ?

A. Both and are correct inferences.

B. is correct but is not a correct inference.
C. is not correct but is a correct inference.
D. Both and are not correct inferences.

ugcnetcse-aug2016-paper3 discrete-mathematics propositional-logic

Answer key ☟

13.10.4 Propositional Logic: UGC NET CSE | December 2011 | Part 2 | Question: 43

The proposition qvp is equivalent to

A. p q B. q p
C. p q D. p q
ugcnetcse-dec2011-paper2 discrete-mathematics propositional-logic

Answer key ☟
13.10.5 Propositional Logic: UGC NET CSE | December 2012 | Part 3 | Question: 75

Let be the statement “x+y=z” and let there be two quantification given as

I.
II.

where x, y, z are real numbers, then which one of the following is correct?
A. I is true and II is true B. I is true and II is false
C. I is false and II is true D. I is false and II is false
ugcnetcse-dec2012-paper3 discrete-mathematics propositional-logic

Answer key ☟

13.10.6 Propositional Logic: UGC NET CSE | December 2015 | Part 2 | Question: 8

Match the following :

A. B.
C. D.
ugcnetcse-dec2015-paper2 discrete-mathematics propositional-logic

Answer key ☟

13.10.7 Propositional Logic: UGC NET CSE | July 2018 | Part 2 | Question: 76

Consider the following statements:

a. False True
b. If

Which of the following is correct with respect to above statements?

A. Both statement a and statement b are false

B. Statement a is true and statement b is false
C. Statement a is false and statement b is true
D. Both statement a and statement b are true

ugcnetcse-july2018-paper2 discrete-mathematics propositional-logic

Answer key ☟

13.10.8 Propositional Logic: UGC NET CSE | Junet 2015 | Part 3 | Question: 57

In propositional language is equivalent to (where denotes NOT)

A. B.
C. D.
ugcnetcse-june2015-paper3 discrete-mathematics propositional-logic

Answer key ☟
13.11 Quantifiers (1)

13.11.1 Quantifiers: UGC NET CSE | July 2018 | Part 2 | Question: 85

The equivalence of is

A.
B.
C.
D.

ugcnetcse-july2018-paper2 discrete-mathematics quantifiers

Answer key ☟

13.12 Relations (1)

13.12.1 Relations: UGC NET CSE | July 2018 | Part 2 | Question: 88

Which of the relations on {0, 1, 2, 3} is an equivalence relation?

A. { (0, 0) (0, 2) (2, 0) (2, 2) (2, 3) (3, 2) (3, 3) }

B. { (0, 0) (1, 2) (2, 2) (3, 3) }
C. { (0, 0) (0, 1) (0, 2) (1, 0) (1, 1) (1, 2) (2, 0) }
D. { (0, 0) (0, 2) (2, 3) (1, 1) (2, 2)

ugcnetcse-july2018-paper2 discrete-mathematics relations

Answer key ☟

13.13 Set Theory (2)

13.13.1 Set Theory: UGC NET CSE | August 2016 | Part 2 | Question: 3

Let and be sets in a finite universal set . Given the following : and
Which of the following is in order of increasing size ?

A.
B.
C.
D.

ugcnetcse-aug2016-paper2 discrete-mathematics set-theory

Answer key ☟

13.13.2 Set Theory: UGC NET CSE | December 2012 | Part 3 | Question: 34

The power set of AUB, where A={2, 3, 5, 7} and B={2, 5, 8, 9}is

A. 256 B. 64 C. 16 D. 4
ugcnetcse-dec2012-paper3 engineering-mathematics discrete-mathematics set-theory

Answer key ☟

Answer Keys
13.0.1 B 13.0.2 D 13.0.3 C 13.0.4 B 13.0.5 B
13.0.6 Q-Q 13.0.7 C 13.0.8 A 13.0.9 B 13.0.10 D
13.0.11 D 13.1.1 Q-Q 13.2.1 D 13.2.2 B 13.3.1 Q-Q
13.4.1 C 13.4.2 B 13.5.1 Q-Q 13.5.2 C 13.6.1 C
13.7.1 A 13.8.1 Q-Q 13.9.1 Q-Q 13.9.2 Q-Q 13.10.1 Q-Q
13.10.2 Q-Q 13.10.3 Q-Q 13.10.4 Q-Q 13.10.5 B 13.10.6 A
13.10.7 Q-Q 13.10.8 B 13.11.1 Q-Q 13.12.1 Q-Q 13.13.1 D
13.13.2 B
14 Engineering Mathematics: Linear Algebra (3)

14.0.1 UGC NET CSE | December 2018 | Part 2 | Question: 42

Which homogeneous matrix transforms the figure (a) on the left side to figure (b) on the right?

A.

B.

C.

D.

ugcnetcse-dec2018-paper2

Answer key ☟

14.0.2 UGC NET CSE | December 2004 | Part 2 | Question: 1

is called :
A. Identity law B. De Morgan’s law
C. Idempotent law D. Complement law
ugcnetcse-dec2004-paper2

Answer key ☟

14.1 Eigen Value (1)

14.1.1 Eigen Value: CSIR UGC NET

Let be a real matrix. Suppose 1 and -1 are two of the three Eigen values of and 18 is one of the Eigen
values of . Then

A. Both and are invertible

B. is invertible but is not invertible
C. is invertible but is not invertible
D. Both and are not invertible.

linear-algebra eigen-value matrix

Answer Keys
14.0.1 Q-Q 14.0.2 Q-Q 14.1.1 Q-Q
15 Engineering Mathematics: Probability (13)

15.0.1 UGC NET CSE | December 2007 | Part 2 | Question: 1

A box contains six red balls and four green balls. Four balls are selected at random from the box. What is the
probability that two of the selected balls are red and two are green ?

A. B. C. D.
ugcnetcse-dec2007-paper2

Answer key ☟

15.1 Binary Tree (1)

15.1.1 Binary Tree: UGC NET CSE | July 2018 | Part 2 | Question: 25

A text is made up of the characters A, B, C, D, E each occurring with the probability 0.08, 0.40, 0.25, 0.15 and
0.12 respectively. The optimal coding will have the average length of

A. 2.4 B. 1.87 C. 3.0 D. 2.15

ugcnetcse-july2018-paper2 probability binary-tree data-structures

Answer key ☟

15.2 Joint Distribution (1)

15.2.1 Joint Distribution: UGC NET CSE | December 2018 | Part 2 | Question: 100

A full joint distribution for the Toothache, Cavity and Catch is given in the table below.
Toothache Toothache
Catch Catch Catch Catch
Cavity
Cavity
What is the probability of Cavity, given evidence of Toothache?

A. B.
C. D.
ugcnetcse-dec2018-paper2 joint-distribution probability non-gatecse

Answer key ☟

15.3 Poisson Distribution (1)

15.3.1 Poisson Distribution: UGC NET CSE | December 2011 | Part 2 | Question: 27

The multiuser operating system, requests are made to use a particular resource per hour, on an average the
probability that no request are made in minutes is

A. B. C. D.
ugcnetcse-dec2011-paper2 probability poisson-distribution

Answer key ☟

15.4 Probability (9)

15.4.1 Probability: UGC NET CSE | August 2016 | Part 2 | Question: 4

What is the probability that a randomly selected bit string of length 10 is a palindrome ?
 A. B. C. D.
ugcnetcse-aug2016-paper2 probability

Answer key ☟

15.4.2 Probability: UGC NET CSE | August 2016 | Part 3 | Question: 54

An experimental file server is up % of the time and down for % of the time due to bugs. How many times
does this file server have to be replicated to give an availability of at least % ?

A. B. C. D.
ugcnetcse-aug2016-paper3 probability

Answer key ☟

15.4.3 Probability: UGC NET CSE | December 2011 | Part 2 | Question: 49

What is the probability of choosing correctly an unknown integer between and with chances ?

A. B. C. D.
ugcnetcse-dec2011-paper2 probability

Answer key ☟

15.4.4 Probability: UGC NET CSE | December 2018 | Part 2 | Question: 3

A box contains six red balls and four green balls. Four balls are selected at random from the box. What is the
probability that two of the selected balls will be red and two will be in green?

A. B. C. D.
ugcnetcse-dec2018-paper2 probability

Answer key ☟

15.4.5 Probability: UGC NET CSE | July 2016 | Part 2 | Question: 4

There are three cards in a box. Both sides of one card are black, both sides of one card are red and the third card
has one black side and one red side. We pick a card at random and observe only one side. What is the probability
that the opposite side is the same colour as the one side we observed?

A. 3/4 B. 2/3 C. 1/2 D. 1/3

ugcnetcse-july2016-paper2 engineering-mathematics probability

Answer key ☟

15.4.6 Probability: UGC NET CSE | July 2018 | Part 2 | Question: 80

Consider the set of all possible five-card poker hands dealt fairly from a standard deck of fifty-two cards. How
many atomic events are there in the joint probability distribution?

A. 2, 598, 960 B. 3, 468, 960 C. 3, 958, 590 D. 2, 645, 590

ugcnetcse-july2018-paper2 probability

Answer key ☟

15.4.7 Probability: UGC NET CSE | July 2018 | Part 2 | Question: 84

Digital data received from a sensor can fill up 0 to 32 buffers. Let the sample space be
where the sample denote that of the buffers are full and . Let A denote the event that the
even number of buffers are full. Then is

A. 0.515 B. 0.785 C. 0.758 D. 0.485

 ugcnetcse-july2018-paper2 probability

Answer key ☟

15.4.8 Probability: UGC NET CSE | Junet 2015 | Part 2 | Question: 2

Considering an experiment of tossing two fair dice, one black and one red. What is the probability that the
number on the black die divides the number on red die?

A. B. C. D.

ugcnetcse-june2015-paper2 probability

Answer key ☟

15.4.9 Probability: UGC NET CSE | September 2013 | Part 3 | Question: 38

How many people must there be in a room before there is a 50% chance that two of them were born on the same
day of the year?

A. At least 23 B. At least 183 C. At least 366 D. At least 730

probability ugcnetcse-sep2013-paper3

Answer key ☟

Answer Keys
15.0.1 Q-Q 15.1.1 Q-Q 15.2.1 Q-Q 15.3.1 A 15.4.1 Q-Q
15.4.2 Q-Q 15.4.3 Q-Q 15.4.4 Q-Q 15.4.5 B 15.4.6 Q-Q
15.4.7 Q-Q 15.4.8 C 15.4.9 A
16 General Aptitude: Analytical Aptitude (1)

16.1 Number Series (1)

16.1.1 Number Series: UGC NET CSE | June 2023 | Part 1: 32

Determine the next term in the following number series

A. B. C. D.
ugcnetcse-june2023-paper1 logical-reasoning analytical-aptitude number-series

Answer key ☟

Answer Keys
16.1.1 Q-Q
17 General Aptitude: Quantitative Aptitude (27)

17.0.1 UGC NET CSE | December 2014 | Part 2 | Question: 04

A computer program selects an integer in the set at random and prints out the result.
This process is repeated 1 million times. What is the probability that the value k = 1 appears in the printout
atleast once ?

A. B. C. D.
ugcnetcse-dec2014-paper2 quantitative-aptitude

Answer key ☟

17.0.2 UGC NET CSE | December 2010 | Part 2 | Question: 1

The number of integers between and that are divisible by and is

A. B. C. D.
ugcnetcse-dec2010-paper2 quantitative-aptitude

Answer key ☟

17.0.3 UGC NET CSE | December 2010 | Part 2 | Question: 5

Consider the problem of connecting lamps to a single electric outlet by using extension cords each of which
has four outlets. The number of extension cords required is

A. B. C. D.
ugcnetcse-dec2010-paper2 quantitative-aptitude

Answer key ☟

17.0.4 UGC NET Paper-1 DEC 14 (average annual growth rate)

For a country CO2 emissions (million metric tons) from various sectors are given in the following table.

Sector
Year Power Industry Commercial Agriculture Domestic
2005 500 200 150 80 100
2006 600 300 200 90 110
2007 650 320 250 100 120
2008 700 400 300 150 150
2009 800 450 320 200 180

What is the average annual growth rate of CO2 emissions in power sector ?
(A) ~12.57% (B) ~16.87%
(C) ~30.81% (D) ~50.25%

17.0.5 UGC NET p1sep2013

The world population growth rate at a certain reference year was 3.5%. Assuming exponential growth of
population, after how many years, the population of the world would have increased by a factor 16 ?
(A) ~ 80 years (B) ~ 40 years
(C) ~ 160 years (D) ~ 320 years
Answer: A
 could you please explain the step?

Answer key ☟

17.0.6 UGC NET CSE | November 2017 | Part 2 | Question: 1

If the time is now O' clock, what will be the time hours from now?

A. O' clock B. O' clock C. O' clock D. O' clock

ugcnetcse-nov2017-paper2

Answer key ☟

17.0.7 UGC NET CSE | July 2018 | Part 2 | Question: 75

Consider a vocabulary with only four propositions A, B, C and D. How many models are there for the following
sentence?

A. 10 B. 12 C. 15 D. 16
ugcnetcse-july2018-paper2 quantitative-aptitude

Answer key ☟

17.0.8 UGC NET CSE | June 2019 | Part 1 | Question: 35

Consider the following table that shows the number (in lakhs) of different sizes of LED television sets sold by a
company over the last seven years from to . Answer the question based on the data contained in the
table:
Sale of LED Television sets (in lakhs) of different sizes (in inches)

Size of LED Television sets (in inches)

Year
22" 24" 32" 40" 49"
2012 85 154 124 112 118
2013 100 136 112 94 136
2014 106 124 85 115 145
2015 115 100 160 100 85
2016 100 85 145 85 100
2017 115 70 175 55 130
2018 125 95 170 110 155
For which LED Television set is the total sales of all the seven years the minimum?
A. - inch Television B. - inch Television
C. - inch Television D. - inch Television
ugcnetcse-june2019-paper1 general-aptitude quantitative-aptitude

Answer key ☟

17.0.9 UGC NET CSE | June 2019 | Part 1 | Question: 34

Consider the following table that shows the number (in lakhs) of different sizes of LED television sets sold by a
company over the last seven years from to . Answer the question based on the data contained in the
 table:
Sale of LED Television sets (in lakhs) of different sizes (in inches)

Size of LED Television sets (in inches)

Year
22" 24" 32" 40" 49"
2012 85 154 124 112 118
2013 100 136 112 94 136
2014 106 124 85 115 145
2015 115 100 160 100 85
2016 100 85 145 85 100
2017 115 70 175 55 130
2018 125 95 170 110 155

What is the total sale of Television sets of size -inches (in lakhs) over all the seven years?

A. B. C. D.
ugcnetcse-june2019-paper1 general-aptitude quantitative-aptitude

Answer key ☟

17.0.10 UGC NET CSE | June 2019 | Part 1 | Question: 33

Consider the following table that shows the number (in lakhs) of different sizes of LED television sets sold by a
company over the last seven years from to . Answer the question based on the data contained in the
table:
Sale of LED Television sets (in lakhs) of different sizes (in inches)

Size of LED Television sets (in inches)

Year
22" 24" 32" 40" 49"
2012 85 154 124 112 118
2013 100 136 112 94 136
2014 106 124 85 115 145
2015 115 100 160 100 85
2016 100 85 145 85 100
2017 115 70 175 55 130
2018 125 95 170 110 155

What is the difference in the number of -inch Television sets sold in and

A. B. C. D.
 ugcnetcse-june2019-paper1 general-aptitude quantitative-aptitude

Answer key ☟

17.0.11 UGC NET CSE | June 2019 | Part 1 | Question: 32

Consider the following table that shows the number (in lakhs) of different sizes of LED television sets sold by a
company over the last seven years from to . Answer the question based on the data contained in the
table:
Sale of LED Television sets (in lakhs) of different sizes (in inches)

Size of LED Television sets (in inches)

Year
22" 24" 32" 40" 49"
2012 85 154 124 112 118
2013 100 136 112 94 136
2014 106 124 85 115 145
2015 115 100 160 100 85
2016 100 85 145 85 100
2017 115 70 175 55 130
2018 125 95 170 110 155

For which size LED Television sets in the total sales of all seven years the maximum?
A. – inch Television B. – inch Television
C. – inch Television D. – inch Television
ugcnetcse-june2019-paper1 general-aptitude quantitative-aptitude

Answer key ☟

17.0.12 UGC NET CSE | June 2019 | Part 1 | Question: 31

Consider the following table that shows the number (in lakhs) of different sizes of LED television sets sold by a
company over the last seven years from to . Answer the question based on the data contained in the
table:
Sale of LED Television sets (in lakhs) of different sizes (in inches)

Size of LED Television sets (in inches)

Year
22" 24" 32" 40" 49"
2012 85 154 124 112 118
2013 100 136 112 94 136
2014 106 124 85 115 145
2015 115 100 160 100 85
 Size of LED Television sets (in inches)
Year
22" 24" 32" 40" 49"
2016 100 85 145 85 100
2017 115 70 175 55 130
2018 125 95 170 110 155

What was the approximate percentage increase/decrease in the sales of -inch LED Television sets in compared
to that in ?

A. B. C. D.
ugcnetcse-june2019-paper1 general-aptitude quantitative-aptitude

Answer key ☟

17.0.13 UGC NET CSE | June 2019 | Part 1 | Question: 27

Given below are two premises with four conclusions drawn from them. Which of the following conclusions
could be validly drawn from the premises?
Premises:

i. No paper is pen
ii. Some paper are handmade

Conclusions:
A. All paper are handmade B. Some handmade are pen
C. Some handmade are not pen D. All handmade are paper
ugcnetcse-june2019-paper1 general-aptitude quantitative-aptitude

Answer key ☟

17.0.14 UGC NET CSE | June 2019 | Part 1 | Question: 25

A sum of money doubles at compound interest in 6 years. In how many years it will become times?

A. years B. years C. years D. years

ugcnetcse-june2019-paper1 general-aptitude quantitative-aptitude

Answer key ☟

17.0.15 UGC NET CSE | June 2019 | Part 1 | Question: 24

In a new budget, the price of petrol rose by . By how much percent must a person reduce his consumption
so that his expenditure on it does not increase?

A. B. C. D.
ugcnetcse-june2019-paper1 general-aptitude quantitative-aptitude

Answer key ☟

17.0.16 UGC NET CSE | June 2019 | Part 1 | Question: 23

If is divided into four parts proportional to , , and , then the smallest part is

A. B. C. D.
ugcnetcse-june2019-paper1 general-aptitude quantitative-aptitude

Answer key ☟
 17.0.17 UGC NET CSE | June 2019 | Part 1 | Question: 22

For all integers .

What is the value of ? Where is a multiplication operator?

A. B. C. D.
ugcnetcse-june2019-paper1 general-aptitude quantitative-aptitude

Answer key ☟

17.0.18 UGC NET CSE | December 2019 | Part 1 | Question: 30

The following table gives the percentage of marks obtained by students in different subjects in an
examination. The numbers in the parenthesis give the maximum marks in each subject. Answer the given
questions based on the table:

Percentage(%) of marks obtained

Name of
student Maths Chemistry Physics Biology English
(150) (130) (120) (100) (100)
Ankit 90 50 80 60 70
Amar 100 60 70 40 80
Sanya 90 60 85 80 60
Rahul 80 75 65 90 90
Puneet 80 80 70 85 50
Pooja 70 75 50 80 40

In which subject the performance of the students is worst in terms of percentage of marks?

A. Chemistry B. Physics C. Biology D. English

ugcnetcse-dec2019-paper1

Answer key ☟

17.1 Data Interpretation (5)

17.1.1 Data Interpretation: UGC NET CSE | October 2020 | Part 1 | Question: 1

The following table shows total number of students in the Department of the Institute along with percentage of
Females and Male students. Answer the question based on the data given below:
 What is the respective ratio of the number of females in Mechanical Department to the number of females in
Electronics Department?

A. B. C. D.
ugcnetcse-oct2020-paper1 general-aptitude quantitative-aptitude data-interpretation

Answer key ☟

17.1.2 Data Interpretation: UGC NET CSE | October 2020 | Part 1 | Question: 2

The following table shows total number of students in the Department of the Institute along with percentage of
Females and Male students. Answer the question based on the data given below:

What is the total number of students in all the Departments?

A. B. C. D.
ugcnetcse-oct2020-paper1 general-aptitude quantitative-aptitude data-interpretation

Answer key ☟

17.1.3 Data Interpretation: UGC NET CSE | October 2020 | Part 1 | Question: 3

The following table shows total number of students in the Department of the Institute along with percentage of
Females and Male students. Answer the question based on the data given below:

What is the total number of male students in Computer and Mining Department together?

A. B. C. D.
ugcnetcse-oct2020-paper1 general-aptitude quantitative-aptitude data-interpretation

Answer key ☟

17.1.4 Data Interpretation: UGC NET CSE | October 2020 | Part 1 | Question: 4

The following table shows total number of students in the Department of the Institute along with percentage of
Females and Male students. Answer the question based on the data given below:
 What is the ratio of the number of females in Civil and Electrical departments together to the number of males in the
same departments together?

A. B. C. D.
ugcnetcse-oct2020-paper1 general-aptitude quantitative-aptitude data-interpretation

Answer key ☟

17.1.5 Data Interpretation: UGC NET CSE | October 2020 | Part 1 | Question: 5

The following table shows total number of students in the Department of the Institute along with percentage of
Females and Male students. Answer the question based on the data given below:

What is the average percentage of female students in the whole institute?

A. B. C. D.
ugcnetcse-oct2020-paper1 general-aptitude quantitative-aptitude data-interpretation

Answer key ☟

17.2 Number System (1)

17.2.1 Number System: UGC NET CSE | June 2011 | Part 2 | Question: 1

Any integer composed of identical digits divisible by

A. B. C. D.
ugcnetcse-dec2011-paper2 quantitative-aptitude number-system

Answer key ☟

17.3 Percentage (1)

17.3.1 Percentage: UGC NET CSE | December 2015 | Part 2 | Question: 32

Suppose that from given statistics, it is known that meningitis causes stiff neck 50% of the time, that the
proportion of persons having meningitis is , and that the proportion od people having stiff neck is . Then
the percentage of people who had meningtis and complain about stiff neck is:

A. 0.01% B. 0.02% C. 0.04% D. 0.05%

ugcnetcse-dec2015-paper2 quantitative-aptitude percentage
 Answer key ☟

17.4 Quadratic Equations (1)

17.4.1 Quadratic Equations: UGC NET CSE | October 2020 | Part 2 | Question: 8

What is the radix of the numbers if the solution to the quadratic equation is and ?

A. B. C. D.
ugcnetcse-oct2020-paper2 quadratic-equations

Answer key ☟

17.5 Work Time (1)

17.5.1 Work Time: UGC NET CSE | June 2023 | Part 1: 17

If and can complete a piece of work in and days respectively, they together will complete the work
in

A. days B. days C. days D. days

ugcnetcse-june2023-paper1 quantitative-aptitude work-time easy

Answer key ☟

Answer Keys
17.0.1 C 17.0.2 B 17.0.3 Q-Q 17.0.4 Q-Q 17.0.5 Q-Q
17.0.6 A 17.0.7 Q-Q 17.0.8 D 17.0.9 D 17.0.10 A
17.0.11 C 17.0.12 B 17.0.13 C 17.0.14 B 17.0.15 C
17.0.16 D 17.0.17 B 17.0.18 Q-Q 17.1.1 B 17.1.2 D
17.1.3 C 17.1.4 D 17.1.5 A 17.2.1 Q-Q 17.3.1 B
17.4.1 D 17.5.1 Q-Q
18 General Aptitude: Verbal Aptitude (8)

18.0.1 UGC NET CSE | June 2013 | Part 3 | Question: 70

Given two jugs of capacities 5 litres and 3 litres with no measuring marks on them. Then the minimum number
of states to measure 4 litres of water will be

A. 3 B. 4 C. 5 D. 7
ugcnetcse-june2013-paper3 quantitative-aptitude general-aptitude

Answer key ☟

18.0.2 UGC NET CSE | July 2018 | Part 2 | Question: 79

A knowledge base contains just one sentence, . Consider the following two sentences
obtained after applying existential instantiation.

a. AsHighAs (Everest, Everest)

b. AsHighAs (Kilimanjaro, Everest)

Which of the following is correct with respect to the above sentences?

A. Both sentence a and sentence b are sound conclusions

B. Both sentence a and sentence b are unsound conclusions
C. Sentence a is sound but sentence b is unsound
D. Sentence a is unsound but sentence b is sound

ugcnetcse-july2018-paper2 verbal-aptitude

Answer key ☟

18.0.3 UGC NET CSE | June 2019 | Part 1 | Question: 28

‘All republics are grateful’ and ‘Some republics are not grateful’ cannot both be true, and they cannot both be
false. This is called as

A. contraries B. contradictories C. subaltern D. super altern

ugcnetcse-june2019-paper1 general-aptitude verbal-aptitude

Answer key ☟

18.0.4 UGC NET CSE | June 2019 | Part 1 | Question: 26

If the proposition ‘Houses are not bricks’ is taken to be False then which of the following propositions can be
True?

i. All houses are bricks

ii. No house is brick
iii. Some houses are bricks
iv. Some houses are not bricks

Select the correct answer from the options given below:

A. ii and iii B. i and iv C. ii only D. iii only

ugcnetcse-june2019-paper1 general-aptitude verbal-aptitude

Answer key ☟
 18.0.5 UGC NET CSE | June 2019 | Part 1 | Question: 21

Oar is to rowboat as foot is to

A. running B. sneaker C. skateboard D. jumping

ugcnetcse-june2019-paper1 general-aptitude verbal-aptitude

Answer key ☟

18.0.6 UGC NET CSE | October 2020 | Part 2 | Question: 80

Given below are two statements:

Statement : divides wherever is a nonnegative integer
Statement : divides whenever is a nonnegative integer
In the light of the above statements, choose the correct answer from the options given below

A. Both Statement and Statement are correct

B. Both Statement and Statement are incorrect
C. Statement is correct but Statement is incorrect
D. Statement is incorrect but Statement is correct

ugcnetcse-oct2020-paper2 general-aptitude quantitative-aptitude

Answer key ☟

18.1 Logical Reasoning (2)

18.1.1 Logical Reasoning: UGC NET CSE | June 2019 | Part 1 | Question: 29

Identify the reasoning in the following argument :

‘Use of teaching aids in the classroom to enhance learning is important in a similar way as that of the use of ICT
for production of knowledge’.

A. Hypothetical B. Analogical C. Inductive D. Deductive

ugcnetcse-june2019-paper1 general-aptitude logical-reasoning

Answer key ☟

18.1.2 Logical Reasoning: UGC NET CSE | June 2019 | Part 1 | Question: 30

The proposition ‘No historians are non-mathematician’ is equivalent to which of the following proposition?

A. All historians are mathematicians B. No historians are mathematicians

C. Some historians are mathematicians D. Some historians are not mathematicians

ugcnetcse-june2019-paper1 general-aptitude logical-reasoning

Answer key ☟

Answer Keys
18.0.1 D 18.0.2 Q-Q 18.0.3 B 18.0.4 D 18.0.5 C
18.0.6 A 18.1.1 B 18.1.2 A
19 Non GATE CSE: Big Data Systems (1)

19.1 Big Data Systems (1)

19.1.1 Big Data Systems: UGC NET CSE | October 2020 | Part 2 | Question: 13

The data node and name node in HADOOP are

A. Worker Node and Master Node respectively B. Master Node and Worker Node respectively
C. Both Worker Nodes D. Both Master Nodes
ugcnetcse-oct2020-paper2 non-gatecse big-data-systems

Answer key ☟

Answer Keys
19.1.1 A
20 Non GATE CSE: Cloud Computing (2)

20.1 Cloud Computing (2)

20.1.1 Cloud Computing: UGC NET CSE | December 2018 | Part 2 | Question: 64

Suppose a cloud contains software stack such as Operating systems, Application softwares, etc. This model is
referred as ____ model

A. B. C. D.
ugcnetcse-dec2018-paper2 cloud-computing

Answer key ☟

20.1.2 Cloud Computing: UGC NET CSE | October 2020 | Part 2 | Question: 58

Which of the following cloud concept/s is/are related to pooling and sharing of resources?

i. Virtual Memory
ii. Service
iii. Virtualization

Choose the correct answer from the options given below:

A. only B. and only C. only D. only

ugcnetcse-oct2020-paper2 non-gatecse cloud-computing

Answer key ☟

Answer Keys
20.1.1 Q-Q 20.1.2 A
21 Non GATE CSE: Computer Graphics (83)

21.1 2d Geometry (1)

21.1.1 2d Geometry: UGC NET CSE | July 2018 | Part 2 | Question: 10

Consider the matrix representing a set of planar (2D) geometric transformations in

homogeneous coordinates. Which of the following statements about the matrix M is True?

A. M represents first, a scaling of vector (2, 1) followed by translation of vector (1,1)

B. M represents first, a translation of vector (1, 1) followed by scaling of vector (2,1)
C. M represents first, a scaling of vector (3, 1) followed by shearing of parameters (-1,1)
D. M represents first, a shearing of parameters (-1, 1) followed by scaling of vector (3,1)

ugcnetcse-july2018-paper2 computer-graphics 2d-geometry

Answer key ☟

21.2 2d Transformation (1)

21.2.1 2d Transformation: UGC NET CSE | June 2019 | Part 2 | Question: 28

Consider the following statements regarding transforms in computer graphics:

is a matrix that reflects (mirrors) only point about the X-axis.

A matrix which mirrors any point about the -axis, is a rotation matrix.
What can you say about the statements and ?
A. Both and are true B. Only is true
C. Only is true D. Both and are false
ugcnetcse-june2019-paper2 2d-transformation

Answer key ☟

21.3 3d Graphics (2)

21.3.1 3d Graphics: UGC NET CSE | July 2018 | Part 2 | Question: 9

Which of the following statements is/are True regarding the solution of the visibility problem in 3D graphics?
S1: The painter's algorithm sorts polygons by depth and then paints (scan - converts) each Polygon on to the
screen starting with the most nearest polygon
S2: Backface Culling refers to eliminating geometry with backfacing normals

A. S1 only B. S2 only C. Both S1 and S2 D. Neither S1 nor S2

ugcnetcse-july2018-paper2 computer-graphics 3d-graphics

Answer key ☟

21.3.2 3d Graphics: UGC NET CSE | June 2019 | Part 2 | Question: 29

In the context of 3D computer graphics, which of the following statements is/are true?
P : Orthographic transformations keep parallel lines parallel.
Q : Orthographic transformations are affine transformations.
Select the correct answer from the options given below:

A. Both P and Q B. Neither P nor Q C. Only P D. Only Q

 ugcnetcse-june2019-paper2 3d-graphics

Answer key ☟

21.4 3d Rotation (1)

21.4.1 3d Rotation: UGC NET CSE | September 2013 | Part 3 | Question: 64

Consider the following transformation matrix for rotation(clockwise):

This matrix rotates an object by an angle about:

A. X-axis B. Y-axis C. Z-axis D. All of the above

ugcnetcse-sep2013-paper3 computer-graphics 3d-rotation

Answer key ☟

21.5 Animation (1)

21.5.1 Animation: UGC NET CSE | December 2014 | Part 3 | Question: 13

Which of the following categories of languages do not refer to animation languages ?

A. Graphical languages B. General-purpose languages
C. Linear-list notations D. None of the above
ugcnetcse-dec2014-paper3 computer-graphics animation non-gatecse

Answer key ☟

21.6 Anti Aliasing (1)

21.6.1 Anti Aliasing: UGC NET CSE | September 2013 | Part 3 | Question: 61

Which of the following is/are fundamental method(s) of antialiasing?

I. Increase of sample rate

II. Treating a pixel as a finite area rather than as a point
III. Decrease of sample rate
A. I and II B. II and III C. I only D. II only
ugcnetcse-sep2013-paper3 computer-graphics anti-aliasing

Answer key ☟

21.7 Breshenmans Algorithm (1)

21.7.1 Breshenmans Algorithm: UGC NET CSE | July 2016 | Part 3 | Question: 13

Consider the Breshenman's circle generation algorithm for plotting a circle with centre (0,0) and radius 'r' unit in
first quadrant. If the current point is and decision parameter is then what will be the next point
and updates decision parameter for ?

A.
B.
C.
D.

ugcnetcse-july2016-paper3 computer-graphics breshenmans-algorithm

Answer key ☟
21.8 Color Models (1)

21.8.1 Color Models: UGC NET CSE | September 2013 | Part 3 | Question: 62

The two color systems – the HSV and HLS are

A. Hue, Saturation, Value and Hue, Lightness, Saturation

B. High, Standard, Value and High Lightness, Saturation
C. Highly, Saturated, Value and Highly, Lightened Saturation
D. Highly, Standard, Value and Hue, Lightness, Saturation

ugcnetcse-sep2013-paper3 computer-graphics color-models

Answer key ☟

21.9 Computer Graphics (41)

21.9.1 Computer Graphics: Computer Science - UGC NET 2021 [ Question ID = 2338 ]

What is the transformation matrix M that transforms a square in the xy plane defined by (1, 1), (-1, 1), (-1, -
1), (1, -1) to a parallelogram whose corresponding vertices are (2, 1), (0,1), (-2, -1), and (0, -1) ?
A. 1 1 0 B. 1 0 0
010 110
001 001

C. 1 1 1 D. 1 1 0
010 110
001 001

computer-graphics

Answer key ☟

21.9.2 Computer Graphics: Computer Science - UGC NET 2021 [ Question ID = 2339 ]

Suppose a Bezier curve P(t) is defined by the following four control points in the xy - plane : P0 = (-2,0); P1 =
(-2,4); P2 = (2,4); and P3 = (2,0). Then which of the following statements are correct ?

1. Bezier curve P(t) has degree 3.

2. P(1 / 2) = (0,3).
3. Bezier curve P(t) may extend outside the convex hull of its control points.

Choose the correct answer from the options given below :

A. 1 and 2 only. B. 1 and 3 only. C. 2 and 3 only. D. 1, 2, and 3.

computer-graphics

21.9.3 Computer Graphics: Computer Science - UGC NET 2021 [ Question ID = 2340 ]

Given below are two statements :

Statement I: The maximum number of sides that a triangle might have when clipped to a rectangular viewport
is 6.
Statement II: In 3D graphics, the perspective transformation is nonlinear in z.
In light of the above statements, choose the correct answer from the options given below :

A. Both Statement I and Statement II are true.

B. Both Statement I and Statement II are false.
C. Statement I is true but Statement II is false.
D. Statement I is false but Statement II is true.
 computer-graphics

21.9.4 Computer Graphics: UGC NET CSE | December 2012 | Part 3 | Question: 12

Let and , then the angle between and and a vector perpendicular to both
and shall be
A. B.
C. D.
ugcnetcse-dec2012-paper3 computer-graphics

Answer key ☟

21.9.5 Computer Graphics: UGC NET CSE | December 2012 | Part 3 | Question: 33

The Z-buffer algorithm is used for Hidden surface removal of objects. The maximum number of objects that can
be handled by this algorithm shall

A. depend on the application B. be arbitrary no. of objects

C. depend on the memory availability D. depend on the processor
ugcnetcse-dec2012-paper3 computer-graphics

Answer key ☟

21.9.6 Computer Graphics: UGC NET CSE | December 2012 | Part 3 | Question: 6

The aspect ratio of an image is defined as

A. The ratio of width to its height measured in unit length

B. The ratio of height to width measured in number of pixel
C. The ratio of depth to width measured in unit length
D. The ratio of width to depth measured in number of pixel

ugcnetcse-dec2012-paper3 computer-graphics

Answer key ☟

21.9.7 Computer Graphics: UGC NET CSE | December 2013 | Part 3 | Question: 62

Which of the following statements is (are) true?

I. Two successive translations are additive

II. Two successive relations are additive
III. Two successive scaling operations are multiplicative
A. I and II B. I and III C. II and III D. All of the above
ugcnetcse-dec2013-paper3 computer-graphics non-gatecse

Answer key ☟

21.9.8 Computer Graphics: UGC NET CSE | December 2013 | Part 3 | Question: 63

Given below are three basic rules:

I. Squash and Stretch

II. Slow-in and Slow-out
III. To stage the action properly

These rules are applied in case of

A. Rendering B. Morphing C. Animation D. All of the above

ugcnetcse-dec2013-paper3 computer-graphics non-gatecse

Answer key ☟
21.9.9 Computer Graphics: UGC NET CSE | December 2013 | Part 3 | Question: 64

Which of the following points lies on the same side as the origin, with reference to the line 3x+7y=2?

A. (3, 0) B. (1, 0) C. (0.5, 0.5) D. (0.5, 0)

ugcnetcse-dec2013-paper3 computer-graphics non-gatecse

Answer key ☟

21.9.10 Computer Graphics: UGC NET CSE | December 2013 | Part 3 | Question: 65

The transformation required for conversion of CMY colour model to RGB colour model is given as:

A.

B.

C.

D.

ugcnetcse-dec2013-paper3 computer-graphics non-gatecse

Answer key ☟

21.9.11 Computer Graphics: UGC NET CSE | December 2013 | Part 3 | Question: 66

What steps shall be required to rotate an object from point (as shown in fig. 1) and its placement such that
what was at is now reduced and is at (as shown in fig. 2)?

I. Translate to origin
II. Scale as required
III. Rotate
IV. Translate to the final position

A. I, II and III B. II, III and IV C. I, III and IV D. All of the above
ugcnetcse-dec2013-paper3 computer-graphics non-gatecse

Answer key ☟

21.9.12 Computer Graphics: UGC NET CSE | December 2014 | Part 3 | Question: 15

A technique used to approximate halftones without reducing spatial resolution is known as________.
A. Halftoning B. Dithering
C. Error diffusion D. None of the above
ugcnetcse-dec2014-paper3 computer-graphics non-gatecse

Answer key ☟
21.9.13 Computer Graphics: UGC NET CSE | December 2015 | Part 3 | Question: 33

Which of the following graphic primitives are considered as the basic building blocks of computer graphics?

i. Points
ii. Lines
iii. Polylines
iv. Polygons
A. B. C. D.
ugcnetcse-dec2015-paper3 computer-graphics

Answer key ☟

21.9.14 Computer Graphics: UGC NET CSE | December 2015 | Part 3 | Question: 50

Which of the following is not a lossy compression technique?

A. JPEG B. MPEG C. FFT D. Arithmetic coding

ugcnetcse-dec2015-paper3 computer-graphics

Answer key ☟

21.9.15 Computer Graphics: UGC NET CSE | December 2015 | Part 3 | Question: 67

Which of the following is/are the principle components of a memory-tube display?

i. Flooding gun
ii. Collector
iii. Phosphorus grains
iv. Ground
A. B.
C. D. All of the above
ugcnetcse-dec2015-paper3 computer-graphics

Answer key ☟

21.9.16 Computer Graphics: UGC NET CSE | December 2015 | Part 3 | Question: 69

Which raster locations would be chosen by Bresenham's algorithm when scan converting a line from to
?

A.
 B.

C.

D.

ugcnetcse-dec2015-paper3 computer-graphics

Answer key ☟

21.9.17 Computer Graphics: UGC NET CSE | December 2015 | Part 3 | Question: 70

Consider a unit square centered at origin. The coordinates at the square are translated by a factor and
rotated by an angle of . What shall be the coordinates of the new square?

A.

B.

C.

D.

ugcnetcse-dec2015-paper3 computer-graphics
 Answer key ☟

21.9.18 Computer Graphics: UGC NET CSE | January 2017 | Part 3 | Question: 16

Below are the few steps given for scan-converting a circle using Bresenham’s Algorithm. Which of the given
steps is not correct?
A. Compute (where is radius) B. Stop if
C. If , then and D. If , then and
ugcnetcse-jan2017-paper3 non-gatecse computer-graphics

Answer key ☟

21.9.19 Computer Graphics: UGC NET CSE | January 2017 | Part 3 | Question: 17

Which of the following is/are side effects of scan conversion?

i. Aliasing
ii. Unequal intensity of diagonal lines
iii. Overstriking in photographic applications
iv. Local or Global aliasing

A. B.
C. D.
ugcnetcse-jan2017-paper3 non-gatecse computer-graphics

Answer key ☟

21.9.20 Computer Graphics: UGC NET CSE | January 2017 | Part 3 | Question: 18

Consider a line with and . Apply a simple algorithm and compute the first four
plots on this line.
A. B.
C. D.
ugcnetcse-jan2017-paper3 non-gatecse computer-graphics

Answer key ☟

21.9.21 Computer Graphics: UGC NET CSE | July 2016 | Part 3 | Question: 15

Let R be the rectangular window against which the lines are to be clipped using 2D Sutherland-Cohen line
clipping algorithm. The rectangular window has lower rectangular corner at (-5, 1) and upper right-hand corner
at (3, 7). Consider the following three lines for clipping with the given end-point coordinates?
Line AB:A(-6,2) and B(-1,8)
Line CD: C(-1,5) and D(4,8)
Line EF: E(-2,3) and F(1,2)
Which of the following lines is/are candidate for clipping?

A. AB B. DC C. EF D. AB and CD
ugcnetcse-july2016-paper3 computer-graphics

Answer key ☟

21.9.22 Computer Graphics: UGC NET CSE | July 2016 | Part 3 | Question: 17

Let us consider that the original point is (x,y) and new transformed point is (x’,y’). Further Sh and Sh are
shearing factors in x and y directions. If we perform the y direction shear relative to x=s then the transformed
point is given by
A. B.
C. D.
ugcnetcse-july2016-paper3 computer-graphics
 Answer key ☟

21.9.23 Computer Graphics: UGC NET CSE | July 2016 | Part 3 | Question: 18

Which of the following statements is/are correct with reference to curve generation?

I. Hermite curves are generated using the concepts of interpolation

II. Bezier curves are generated using the concepts of approximation
III. The Bezier curve lies entirely within the convex hull of its control points
IV. The degree of Bezier curve does not depend on the number of control points
A. I, II and IV only B. II and III only C. I and II only D. I, II and III only
ugcnetcse-july2016-paper3 computer-graphics

Answer key ☟

21.9.24 Computer Graphics: UGC NET CSE | July 2018 | Part 2 | Question: 8

A graphic display system has a frame buffer that is 640 pixels high , 480 pixels high and 1 bit of color depth. If
the access time for each pixel on the average is 200 nanoseconds, then the refresh rate of this frame buffer is
approximately:
A. 16 frames per second B. 19 frames per second
C. 21 frames per second D. 23 frames per second
ugcnetcse-july2018-paper2 computer-graphics

Answer key ☟

21.9.25 Computer Graphics: UGC NET CSE | June 2012 | Part 3 | Question: 14

If the pixels of an image are shuffled then the parameter that may change is

A. Histogram B. Mean C. Entropy D. Covariance

ugcnetcse-june2012-paper3 computer-graphics

Answer key ☟

21.9.26 Computer Graphics: UGC NET CSE | June 2012 | Part 3 | Question: 63

If a and b are the end points of a line, then which of the following is true?

A. If both end points are left, right, above or below the window, the line is invisible.
B. If both end points are left, right, above or below the window, the line is completely visible.
C. If both end points are left, right, above or below the window, the line is trivially visible
D. If both end points are left, right, above or below the window, the line is trivially invisible

computer-graphics non-gatecse ugcnetcse-june2012-paper3

Answer key ☟

21.9.27 Computer Graphics: UGC NET CSE | June 2014 | Part 3 | Question: 01

Beam-penetration and shadow-mask are the two basic techniques for producing color displays with a CRT.
Which of the following is not true ?
I. The beam-penetration is used with random scan monitors.
II. Shadow-mask is used in rasterscan systems.
III. Beam-penetration method is better than shadow-mask method.
IV. Shadow-mask method is better than beam-penetration method.

A. I and II B. II and III C. III only D. IV only

ugcnetjune2014iii non-gatecse computer-graphics
 Answer key ☟

21.9.28 Computer Graphics: UGC NET CSE | June 2014 | Part 3 | Question: 02

Line caps are used for adjusting the shape of the line ends to give them a better appearance. Various kinds of line
caps used are
A. Butt cap and sharp cap B. Butt cap and round cap
C. Butt cap, sharp cap and round cap D. Butt cap, round cap and projecting square cap
ugcnetjune2014iii non-gatecse computer-graphics

Answer key ☟

21.9.29 Computer Graphics: UGC NET CSE | June 2014 | Part 3 | Question: 03

Given below are certain output primitives and their associated attributes. Match each primitive with its
corresponding attributes

A. B.
C. D.
ugcnetjune2014iii non-gatecse computer-graphics

Answer key ☟

21.9.30 Computer Graphics: UGC NET CSE | June 2014 | Part 3 | Question: 04

Consider a window bounded by the lines : and . The line segment joining and
, if clipped against this window will connect the points

A. and B. and
C. and D. and
ugcnetjune2014iii non-gatecse geometry computer-graphics

Answer key ☟

21.9.31 Computer Graphics: UGC NET CSE | June 2014 | Part 3 | Question: 05

Which of the following color models are defined with three primary colors ?
A. RGB and HSV color models B. CMY and HSV color models
C. HSV and HLS color models D. RGB and CMY color models
ugcnetjune2014iii non-gatecse computer-graphics

Answer key ☟

21.9.32 Computer Graphics: UGC NET CSE | Junet 2015 | Part 3 | Question: 16

Which of the following is not a basic primitive of the Graphics Kernel System (GKS)?

A. POLYLINE B. POLYDRAW C. FILL AREA D. POLYMARKER

ugcnetcse-june2015-paper3 computer-graphics

Answer key ☟

21.9.33 Computer Graphics: UGC NET CSE | Junet 2015 | Part 3 | Question: 17

Which of the following statements is/are incorrect?

 i. Mapping the co-ordinates of the points and lines that form the picture into the appropriate co-ordinates on the device
or workstation is known as viewing transformation
ii. The right-handed cartesian co-ordinates system in whose co-ordinates we describe the picture is known as world co-
ordinate system
iii. The co-ordinate system that corresponds to the device or workstation where the image is to be displayed is known as
physical device co-ordinate system
iv. Left-handed co-ordinate system in which the display area of the virtual display device corresponds to the unit
square whose lower left-hand corner is at the origin of the co-ordinate system, is known as normalized device co-
ordinate system
A. B. C. D.
ugcnetcse-june2015-paper3 computer-graphics

Answer key ☟

21.9.34 Computer Graphics: UGC NET CSE | Junet 2015 | Part 3 | Question: 18

Match the following :

A.
B.
C.
D.

ugcnetcse-june2015-paper3 computer-graphics

Answer key ☟

21.9.35 Computer Graphics: UGC NET CSE | November 2017 | Part 3 | Question: 13

Which of the following is not a component of Memory tube display?

A. Flooding gun B. Collector C. Ground D. Liquid Crystal

ugcnetcse-nov2017-paper3 computer-graphics

Answer key ☟

21.9.36 Computer Graphics: UGC NET CSE | October 2020 | Part 2 | Question: 46

In the context of Computer graphics, which of the following statements is/are correct?

i. Under perspective projection, each set of parallel lines in the object do not stay parallel in the image (except those
that are parallel to the viewplane to start with).
ii. Applying a perspective transformation in the graphics pipeline to a vertex involves dividing by its coordinate
iii. Perspective transformation is a linear transformation

Choose the correct answer from the options given below:

 A. and only B. and only
C. and only D. , and
ugcnetcse-oct2020-paper2 non-gatecse computer-graphics

Answer key ☟

21.9.37 Computer Graphics: UGC NET CSE | October 2020 | Part 2 | Question: 47

Concerning phong shading and Gouraud shading in a scene, which of the following statements are true?

i. Gouraud shading requires more computation than phong shading

ii. Gouraud shading linearly interpolates the color of an interior pixel from the color at the vertices
iii. Phong shading interpolates over the normal vectors specified at the vertices

Choose the correct answer from the options given below:

A. and only B. and only
C. and only D. and
ugcnetcse-oct2020-paper2 non-gatecse computer-graphics

21.9.38 Computer Graphics: UGC NET CSE | October 2020 | Part 2 | Question: 66

Match with . gives matrices representing transformations and shows the

corresponding transformation diagrams.
 Choose the correct answer from the options given below:
A. B.
C. D.
ugcnetcse-oct2020-paper2 non-gatecse computer-graphics

Answer key ☟

21.9.39 Computer Graphics: UGC NET CSE | October 2020 | Part 2 | Question: 76

Given below are different properties of projections from . Identify the correct order on the basis of
property true of a perspective projection only, an orthographic projection only, both orthographic and
projective transformations and neither orthographic nor projective transformation, respectively.

i. Straight lines are mapped to straight lines

ii. Distances and angles are (in general) preserved
iii. Far away objects appear the same size as closer ones
iv. Requires homogeneous coordinates in order for it to be encoded into a linear transformation

Choose the correct answer from the options given below:

A. B. C. D.
ugcnetcse-oct2020-paper2 non-gatecse computer-graphics

Answer key ☟

21.9.40 Computer Graphics: UGC NET CSE | October 2020 | Part 2 | Question: 82

Given below are two statements:

Statement : Bezier curves are curves that interpolate all of their control points
Statement : A cubic bezier curve has four control points
In the light of the above statements, choose the correct answer from the options given below

A. Both Statement and Statement are true

B. Both Statement and Statement are false
C. Statement is correct but Statement is false
D. Statement is incorrect but Statement is true

ugcnetcse-oct2020-paper2 non-gatecse computer-graphics

Answer key ☟

21.9.41 Computer Graphics: UGC NET CSE | September 2013 | Part 3 | Question: 59

Which of the following graphics devices are known as active graphics devices?

I. Alphanumeric devices
II. Thumb wheels
III. Digitizers
IV. Joystics
A. I and II B. III and IV C. I, II and III D. I, II, III and IV
ugcnetcse-sep2013-paper3 computer-graphics

Answer key ☟

21.10 Crt (2)

21.10.1 Crt: UGC NET CSE | December 2015 | Part 3 | Question: 71

Which of the following is/are the components of a CRT?

 i. Electron Gun
ii. Control Electrode
iii. Focusing Electrode
iv. Phosphor Coated Screen
A. B.
C. D.
ugcnetcse-dec2015-paper3 computer-graphics crt

Answer key ☟

21.10.2 Crt: UGC NET CSE | November 2017 | Part 3 | Question: 15

With respect to CRT, the horizontal retrace is defined as

A. The path an electron beam takes when returning to the left side of the CRT
B. The path an electron beam takes when returning to the right side of the CRT
C. The technique of turning, the electron beam off while retracing
D. The technique of turning, the electron beam on/ off while retracing

ugcnetcse-nov2017-paper3 computer-graphics crt

Answer key ☟

21.11 Digital Image Processing (5)

21.11.1 Digital Image Processing: UGC NET CSE | June 2013 | Part 3 | Question: 19

An image is 1024 800 pixels with 3 bytes/pixel. Assume the image is uncompressed. How long does it make to
transmit it over a 10 Mbps Ethernet?
A. 196.6 seconds B. 19.66 seconds
C. 1.966 seconds D. 0.1966 seconds
ugcnetcse-june2013-paper3 computer-graphics digital-image-processing

Answer key ☟

21.11.2 Digital Image Processing: UGC NET CSE | June 2013 | Part 3 | Question: 31

Images tend to be very large collection of data. The size of memory required for a 1024 by 1024 image in which
the color of each pixel is represented by a n-bit number, (in an 8-bit machines) is

A. n 8 MB B. n/8 MB
C. (1024 1024)/8 MB D. 1024 MB
ugcnetcse-june2013-paper3 computer-graphics digital-image-processing

Answer key ☟

21.11.3 Digital Image Processing: UGC NET CSE | June 2013 | Part 3 | Question: 56

The number of distinct binary images which can be generated from a given binary image of right M N are

A. M+N B. M N C. 2 D. 2
ugcnetcse-june2013-paper3 computer-graphics digital-image-processing

Answer key ☟

21.11.4 Digital Image Processing: UGC NET CSE | June 2013 | Part 3 | Question: 57

If f(x, y) is a digital image, then x, y and amplitude values of f are

A. Finite B. Infinite
C. Neither finite nor infinite D. None of the above
ugcnetcse-june2013-paper3 computer-graphics digital-image-processing

Answer key ☟
 21.11.5 Digital Image Processing: UGC NET CSE | November 2017 | Part 3 | Question: 18

The three aspects of Quantization, programmers generally concerned with are

A. Coding error, Sampling rate and Amplification

B. Sampling rate, Coding error and Conditioning
C. Sampling rate, Aperture time and Coding error
D. Aperture time, Coding error and Strobing

ugcnetcse-nov2017-paper3 computer-graphics digital-image-processing

Answer key ☟

21.12 Display Devices (1)

21.12.1 Display Devices: UGC NET CSE | June 2013 | Part 3 | Question: 28

The refresh rate above which a picture stops flickering and fuses into a steady image is called ____
A. Crucial fusion frequency B. Current frequency fusion
C. Critical fusion frequency D. Critically diffused frequency
ugcnetcse-june2013-paper3 computer-graphics display-devices

Answer key ☟

21.13 Frame Buffer (1)

21.13.1 Frame Buffer: UGC NET CSE | August 2016 | Part 3 | Question: 14

Consider a -bit plane frame buffer with -bit wide lookup table with . How many intensity levels are
available at a time ?

A. B. C. D.
ugcnetcse-aug2016-paper3 computer-graphics frame-buffer

Answer key ☟

21.14 Halftoning (1)

21.14.1 Halftoning: UGC NET CSE | June 2012 | Part 3 | Question: 75

Halftoning is defined as

A. A technique to obtain increased visual resolution using multiple intensity levels

B. A technique for using minimum number of intensity levels to obtain increased visual resolution
C. A technique to obtain increased visual resolution using maximum number of intensity levels
D. A technique for using appropriate number intensity levels to obtain increased visual resolution

ugcnetcse-june2012-paper3 computer-graphics halftoning

Answer key ☟

21.15 Image Compression (1)

21.15.1 Image Compression: UGC NET CSE | September 2013 | Part 3 | Question: 55

MPEG involves both spatial compression and temporal compression. The spatial compression is similar to
JPEG and temporal compression removes _____ frames.

A. Temporal B. Voice C. Spatial D. Redundant

ugcnetcse-sep2013-paper3 computer-graphics digital-image-processing image-compression

Answer key ☟
21.16 Image Entropy (1)

21.16.1 Image Entropy: UGC NET CSE | December 2012 | Part 3 | Question: 71

You are given four images to represent as

The value of entropy is maximum for image

A. B. C. D.
ugcnetcse-dec2012-paper3 computer-graphics image-entropy

Answer key ☟

21.17 Image Rotation (2)

21.17.1 Image Rotation: UGC NET CSE | July 2016 | Part 3 | Question: 14

A point P(5,1) is rotated by 90 about a pivot point (2,2). What is the coordinate of new transformed point P'?

A. (3,5) B. (5,3) C. (2,4) D. (1,5)

ugcnetcse-july2016-paper3 computer-graphics image-rotation

Answer key ☟

21.17.2 Image Rotation: UGC NET CSE | Junet 2015 | Part 3 | Question: 14

Consider a triangle A(0,0), B(1, 1) and C(5, 2). The triangle has to be rotated by an angle of 45 about the point
P(-1, -1). What shall be the coordinates of new triangle?

A.
B.
C.
D.

ugcnetcse-june2015-paper3 computer-graphics image-rotation

Answer key ☟

21.18 Line Clipping (1)

21.18.1 Line Clipping: UGC NET CSE | December 2014 | Part 3 | Question: 17

In Cyrus-Beck algorithm for line clipping the value of parameter is computed by the relation:
(Here and are the two end points of the line, is a point on the boundary, is inner normal).

A. B.
C. D.
ugcnetcse-dec2014-paper3 non-gatecse computer-graphics line-clipping

Answer key ☟

21.19 Line Drawing Algorithm (3)

21.19.1 Line Drawing Algorithm: UGC NET CSE | August 2016 | Part 3 | Question: 15

Consider the Breshenham’s line generation algorithm for a line with gradient greater than one, current point
and decision parameter, . The next point to be plotted and updated decision parameter,
, for are given as _______.
 A.
B.
C.
D.

ugcnetcse-aug2016-paper3 computer-graphics line-drawing-algorithm

Answer key ☟

21.19.2 Line Drawing Algorithm: UGC NET CSE | August 2016 | Part 3 | Question: 18

The Liang-Barsky line clipping algorithm uses the parametric equation of a line from to along
with its infinite extension which is given as :

Where , and is the parameter with . A line with end points and
is to be clipped against a rectangular window with , and . The lower
and upper bound values of the parameter u for the clipped line using Liang-Barsky algorithm is given as :

A. B. C. D.
ugcnetcse-aug2016-paper3 computer-graphics line-drawing-algorithm

Answer key ☟

21.19.3 Line Drawing Algorithm: UGC NET CSE | June 2013 | Part 3 | Question: 27

Bresenham line drawing algorithm is attractive because it uses

A. Real arithmetic only B. Integer arithmetic only
C. Floating point arithmetic D. Real and integer arithmetic
ugcnetcse-june2013-paper3 computer-graphics line-drawing-algorithm

Answer key ☟

21.20 Parametric Line Equation (1)

21.20.1 Parametric Line Equation: UGC NET CSE | September 2013 | Part 3 | Question: 63

The parametric representation of the line segment between the position vectors and is given as

A.
B.
C.
D.

ugcnetcse-sep2013-paper3 computer-graphics parametric-line-equation

Answer key ☟

21.21 Phong Color Model (1)

21.21.1 Phong Color Model: UGC NET CSE | June 2019 | Part 2 | Question: 30

Using the phong reflectance model, the strength of the specular highlight is determined by the angle between
A. the view vector and the normal vector B. the light vector and the normal vector
C. the light vector and the reflected vector D. the reflected vector and the view vector
ugcnetcse-june2019-paper2 phong-color-model

Answer key ☟

21.22 Projection (8)

21.22.1 Projection: UGC NET CSE | August 2016 | Part 3 | Question: 16

A point is rotated about a pivot point by 60°. What is the new transformed point ?

A. B. C. D.
ugcnetcse-aug2016-paper3 computer-graphics projection

Answer key ☟

21.22.2 Projection: UGC NET CSE | August 2016 | Part 3 | Question: 17

In perspective projection (from 3D to 2D), objects behind the centre of projection are projected upside down and
backward onto the view-plane. This is known as _____.
A. Topological distortion B. Vanishing point
C. View confusion D. Perspective foreshortening
ugcnetcse-aug2016-paper3 computer-graphics projection

Answer key ☟

21.22.3 Projection: UGC NET CSE | December 2014 | Part 3 | Question: 18

Match the following

A. B.
C. D.
ugcnetcse-dec2014-paper3 computer-graphics projection non-gatecse

Answer key ☟

21.22.4 Projection: UGC NET CSE | July 2016 | Part 3 | Question: 16

In perspective projection, if a line segment joining a point which lies in front of the viewer to a point in back of
the viewer is projected to a broken line of infinte extent. This is known as ____
A. View confusion B. Vanishing point
C. Topological distortion D. Perspective foreshortening
ugcnetcse-july2016-paper3 computer-graphics projection

Answer key ☟

21.22.5 Projection: UGC NET CSE | June 2012 | Part 3 | Question: 59

The perspective projection matrix, on the view plan z=d where the centre of projection is the origin (0, 0, 0)
shall be
 A.

B.

C.

D.

ugcnetcse-june2012-paper3 computer-graphics projection

Answer key ☟

21.22.6 Projection: UGC NET CSE | June 2013 | Part 3 | Question: 29

In homogenous coordinate system (x, y, z) the points z=0 are called

A. Cartesian points B. Parallel points
C. Origin point D. Point of infinity
ugcnetcse-june2013-paper3 computer-graphics projection

Answer key ☟

21.22.7 Projection: UGC NET CSE | November 2017 | Part 3 | Question: 14

Which of the following is not true in case of Oblique Projections?

A. Parallel projection rays are not perpendicular to the viewing plane

B. Parallel lines in space appear parallel on the final projected image
C. Used exclusively for pictorial purposes rather than formal working drawings
D. Projectors are always perpendicular to the plane of projection

ugcnetcse-nov2017-paper3 computer-graphics projection

Answer key ☟

21.22.8 Projection: UGC NET CSE | September 2013 | Part 3 | Question: 60

A diametric projection is said to be trimetric projection when

I. two of the three foreshortening factors are equal and third is arbitrary
II. all of the three foreshortening factors are equal
III. all of the three foreshortening factors are arbitrary

Which of the above is true?

A. I and II B. II and III C. I only D. III only

ugcnetcse-sep2013-paper3 computer-graphics projection

Answer key ☟

21.23 Raster Graphics (2)

 21.23.1 Raster Graphics: UGC NET CSE | August 2016 | Part 3 | Question: 13

Consider a raster grid having -axes in positive -direction and positive upward -direction with
, , , and . What is the address of memory pixel with location in
raster grid assuming base address (one) ?

A. B. C. D.
ugcnetcse-aug2016-paper3 computer-graphics raster-graphics

Answer key ☟

21.23.2 Raster Graphics: UGC NET CSE | June 2019 | Part 2 | Question: 27

Consider a raster system with resolution by . What size is frame buffer (in bytes) for this system to store
bits per pixel?
A. kilobytes B. kilobytes
C. kilobytes D. kilobytes
ugcnetcse-june2019-paper2 raster-graphics

Answer key ☟

21.24 Resolution (1)

21.24.1 Resolution: UGC NET CSE | June 2013 | Part 3 | Question: 30

If 40 black lines interleaved with 40 white lines can be distinguished across one inch, the resolution is
A. 40 line-pairs per inch B. 80 line-pairs per inch
C. 1600 lines per inch D. 40 lines per inch
ugcnetcse-june2013-paper3 computer-graphics resolution

Answer key ☟

21.25 Transformation (2)

21.25.1 Transformation: UGC NET CSE | December 2012 | Part 3 | Question: 16

The Mandelbrot set used for the construction of beautiful images is based on the following transformation.
. Here,

A. Both and are real numbers B. Both and are complex numbers
C. is real and is complex D. is complex and is real
ugcnetcse-dec2012-paper3 computer-graphics transformation

Answer key ☟

21.25.2 Transformation: UGC NET CSE | Junet 2015 | Part 3 | Question: 13

Give the number of principal vanishing point(s) along with their direction for the standard prospective
transformation:

A. Only one in the direction K B. Two in the directions i and j

C. Three in the directions I, J and K D. Only two in the directions J and K
ugcnetcse-june2015-paper3 computer-graphics transformation

Answer key ☟

Answer Keys
21.1.1 Q-Q 21.2.1 B 21.3.1 Q-Q 21.3.2 A 21.4.1 C
21.5.1 D 21.6.1 A 21.7.1 B 21.8.1 A 21.9.1 Q-Q
21.9.2 Q-Q 21.9.3 Q-Q 21.9.4 X 21.9.5 B 21.9.6 A
21.9.7 D 21.9.8 C 21.9.9 D 21.9.10 C 21.9.11 X
21.9.12 B 21.9.13 D 21.9.14 X 21.9.15 B 21.9.16 C
21.9.17 D 21.9.18 D 21.9.19 D 21.9.20 A 21.9.21 D
21.9.22 C 21.9.23 D 21.9.24 Q-Q 21.9.25 D 21.9.26 D
21.9.27 C 21.9.28 D 21.9.29 C 21.9.30 A 21.9.31 D
21.9.32 B 21.9.33 D 21.9.34 A 21.9.35 D 21.9.36 A
21.9.37 C 21.9.38 D 21.9.39 C 21.9.40 D 21.9.41 D
21.10.1 C 21.10.2 A 21.11.1 C 21.11.2 B 21.11.3 D
21.11.4 A 21.11.5 C 21.12.1 C 21.13.1 Q-Q 21.14.1 B
21.15.1 D 21.16.1 C 21.17.1 A 21.17.2 C 21.18.1 B
21.19.1 Q-Q 21.19.2 Q-Q 21.19.3 B 21.20.1 C 21.21.1 D
21.22.1 Q-Q 21.22.2 Q-Q 21.22.3 D 21.22.4 C 21.22.5 B
21.22.6 D 21.22.7 D 21.22.8 C 21.23.1 Q-Q 21.23.2 A
21.24.1 A 21.25.1 B 21.25.2 A
22 Non GATE CSE: Computer Peripherals (3)

22.1 Computer Peripherals (1)

22.1.1 Computer Peripherals: UGC NET CSE | December 2013 | Part 3 | Question: 61

Which of the following is not true with respect to to a trackball and/or spaceball?

I. A trackball is a two dimensional positioning device while as a spaceball provides six degrees of freedom
II. Unlike the trackball a spaceball does not actually move
III. A trackball is a three dimensional positioning device while as a spaceball provides six degrees of freedom
A. I and II B. II and III C. II only D. III only
ugcnetcse-dec2013-paper3 non-gatecse computer-peripherals

Answer key ☟

22.2 IO Devices (1)

22.2.1 IO Devices: UGC NET CSE | December 2014 | Part 3 | Question: 14

Match the following

A. B.
C. D.
ugcnetcse-dec2014-paper3 non-gatecse computer-peripherals io-devices

Answer key ☟

22.3 Matrix Printer (1)

22.3.1 Matrix Printer: UGC NET CSE | December 2014 | Part 3 | Question: 03

In a dot matrix printer the time to print a character is m.sec., time to space in between characters is m.sec.,
and the number of characters in a line are . The printing speed of the dot matrix printer in characters per
second and the time to print a character line are given by which of the following options ?
A. chars/second and seconds B. chars/second and seconds
C. chars/second and seconds D. chars/second and seconds
ugcnetcse-dec2014-paper3 computer-peripherals non-gatecse matrix-printer io-devices

Answer key ☟

Answer Keys
22.1.1 D 22.2.1 C 22.3.1 X
23 Non GATE CSE: Digital Image Processing (8)

23.1 Discovolution (1)

23.1.1 Discovolution: UGC NET CSE | December 2015 | Part 3 | Question: 51

Blind image disconvolution is

A. Combination of blur identification and image restoration B. Combination of segmentation and classification
C. Combination of blur and non-blur image D. None of the above
ugcnetcse-dec2015-paper3 digital-image-processing discovolution

Answer key ☟

23.2 Entropy (2)

23.2.1 Entropy: UGC NET CSE | December 2014 | Part 3 | Question: 65

Given a simple image of size whose histogram models the symbol probabilities and is given by

a b c d
The first order estimate of image entropy is maximum when
A. B.
C. D.
ugcnetcse-dec2014-paper3 digital-image-processing entropy

Answer key ☟

23.2.2 Entropy: UGC NET CSE | December 2015 | Part 3 | Question: 49

Consider the conditional entropy and mutual information for the binary symmetric channel. The input source has
alphabet and associated probabilities . The channel matrix is wgere p is the
transition probability. Then the conditional entropy is given by:
A. B.
C. D.
ugcnetcse-dec2015-paper3 digital-image-processing entropy

Answer key ☟

23.3 Fourier Transform (1)

23.3.1 Fourier Transform: UGC NET CSE | December 2012 | Part 3 | Question: 64

If the Fourier transform of the function f(x,y) is F(m,n), then the Fourier transform of the function f(2x,2y) is

A. B. C. D.
ugcnetcse-dec2012-paper3 fourier-transform digital-image-processing

23.4 Image Compression (4)

23.4.1 Image Compression: UGC NET CSE | July 2016 | Part 3 | Question: 60

Which of the following is used for the boundary representation of an image object?

A. Quad Tree B. Projections C. Run length coding D. Chain codes

ugcnetcse-july2016-paper3 image-compression computer-graphics

Answer key ☟
 23.4.2 Image Compression: UGC NET CSE | June 2012 | Part 3 | Question: 10

In an image compression system 16384 bits are used to represent 256 256 image with 256 gray levels. What
is the compression ratio for this system?

A. 1 B. 2 C. 4 D. 8
ugcnetcse-june2012-paper3 image-compression

Answer key ☟

23.4.3 Image Compression: UGC NET CSE | June 2012 | Part 3 | Question: 19

The quantiser in an image-compression system is a

A. lossy element which exploits the psychovisual redundancy

B. lossless element which exploits the psychovisual redundancy
C. lossy element which exploits the statistical redundancy
D. lossless element which exploits the statistical redundancy

ugcnetcse-june2012-paper3 image-compression

Answer key ☟

23.4.4 Image Compression: UGC NET CSE | June 2014 | Part 3 | Question: 55

Given an image of size pixels in which intensity of each pixel is an -bit quality. It requires
_______ of storage space if the image is not compressed.

A. One Terabyte B. One Megabyte

C. Megabytes D. Terabytes
ugcnetjune2014iii image-compression computer-graphics

Answer key ☟

Answer Keys
23.1.1 D 23.2.1 D 23.2.2 D 23.3.1 A 23.4.1 D
23.4.2 X 23.4.3 A 23.4.4 B
24 Non GATE CSE: Digital Signal Processing (5)

24.0.1 UGC NET CSE | December 2012 | Part 3 | Question: 60

The transform which posses ‘multi-resolution’ property is

A. Fourier transform B. Short-time Fourier transform

C. Wavelet transform D. Karhunen-Loere transform
ugcnetcse-dec2012-paper3

Answer key ☟

24.1 Butterworth Lowpass Filter (1)

24.1.1 Butterworth Lowpass Filter: UGC NET CSE | December 2014 | Part 3 | Question: 66

A Butterworth lowpass filter of order , with a cutoff frequency at distance from the origin, has the transfer
function given by

A. B.

C. D.

ugcnetcse-dec2014-paper3 digital-image-processing butterworth-lowpass-filter

Answer key ☟

24.2 Digital Signal Processing (1)

24.2.1 Digital Signal Processing: UGC NET CSE | June 2012 | Part 2 | Question: 18

Page Shift Keying (PSK) Method is used to modulate digital signal at 9600 bps using 16 level. Find the line
signals and speed (i.e., modulation rate)

A. 2400 bauds B. 1200 bauds C. 4800 bauds D. 9600 bauds

ugcnetcse-june2012-paper2 non-gatecse digital-signal-processing

Answer key ☟

24.3 Discrete Memoryless Channel (1)

24.3.1 Discrete Memoryless Channel: UGC NET CSE | July 2016 | Part 3 | Question: 58

Consider a discrete memoryless channel and assume that H(x) is the amount of information per symbol at the
input of the channel; H(y) is the amount of information per symbol at the output of the channel. H(x y) is the
amount of uncertainty remaining on x knowing y; and I(x;y)is the information transmission. Which of the following
does not define the channel capacity of a descrete memoryless channel?
A. max I(x;y); p(x) B. max [H(y)-H(y x)]; p(x)
C. max [H(x)-H(x y)]; p(x) D. max H(x y); p(x)
ugcnetcse-july2016-paper3 digital-image-processing discrete-memoryless-channel

Answer key ☟

24.4 Spatial Mask (1)

24.4.1 Spatial Mask: UGC NET CSE | December 2014 | Part 3 | Question: 64

Given two spatial masks

 The Laplacian of an image at all points can be implemented by convolving the image with spatial mask. Which of
the following can be used as the spatial mask ?
A. only B. only
C. Both and D. None of these
ugcnetcse-dec2014-paper3 digital-image-processing spatial-mask

Answer key ☟

Answer Keys
24.0.1 C 24.1.1 A 24.2.1 A 24.3.1 D 24.4.1 B
25 Non GATE CSE: Distributed Computing (11)

25.1 Computing Models (1)

25.1.1 Computing Models: UGC NET CSE | December 2014 | Part 3 | Question: 75

Which of the following computing models is not an example of distributed computing environment ?
A. Cloud computing B. Parallel computing
C. Cluster computing D. Peer-to-peer computing
ugcnetcse-dec2014-paper3 distributed-computing computing-models

Answer key ☟

25.2 Distributed Computing (3)

25.2.1 Distributed Computing: UGC NET CSE | December 2014 | Part 3 | Question: 11

Consider the following statements :

I. Re-construction operation used in mixed fragmentation satisfies commutative rule.
II. Re-construction operation used in vertical fragmentation satisfies commutative rule Which of the following is correct
?
A. B.
C. Both are correct D. None of the statements are correct.
ugcnetcse-dec2014-paper3 distributed-computing non-gatecse

Answer key ☟

25.2.2 Distributed Computing: UGC NET CSE | December 2014 | Part 3 | Question: 54

In a distributed computing environment, distributed shared memory is used which is

A. Logical combination of virtual memories on the nodes.

B. Logical combination of physical memories on the nodes.​
C. Logical combination of the secondary memories on all the nodes.
D. All of the above

ugcnetcse-dec2014-paper3 distributed-computing

Answer key ☟

25.2.3 Distributed Computing: UGC NET CSE | June 2014 | Part 2 | Question: 27

Object Request Broker (ORB) is

I. A software program that runs on the client as well as on the application server.
II. A software program that runs on the client side only.
III. A software program that runs on the application server, where most of the components reside.
A. , & B. &
C. & D. only
ugcnetcse-june2014-paper2 non-gatecse distributed-computing

Answer key ☟

25.3 Distributed Database (2)

25.3.1 Distributed Database: UGC NET CSE | December 2014 | Part 3 | Question: 07

Location transparency allows:

I. Users to treat the data as if it is done at one location.
II. Programmers to treat the data as if it is at one location.
 III. Managers to treat the data as if it is at one location.
Which one of the following is correct ?

A. and B. and only C. and only D. only

ugcnetcse-dec2014-paper3 distributed-database non-gatecse

Answer key ☟

25.3.2 Distributed Database: UGC NET CSE | July 2016 | Part 3 | Question: 12

Semi-join strategies are techniques for query processing in distributed database system. Which of the following
is semi-joined technique?

A. Only the joining attributes are sent from one site to another and then all of the rows are returned
B. All of the attributes are sent from one site to another and then only the required rows are returned
C. Only the joining attributes are sent from one site to another and then only the required rows are returned
D. All of the attributes are sent from one site to another and then only the required rows are returned

ugcnetcse-july2016-paper3 non-gatecse distributed-computing distributed-database

Answer key ☟

25.4 Distributed System (2)

25.4.1 Distributed System: UGC NET CSE | December 2015 | Part 3 | Question: 62

The distributed system is a collection of _____(P)_____ and communication is achieved in disributed system by
____(Q)____, where (P) and (Q) are:

A. Loosely coupled hardware on tightly coupled software and disk sharing, repspectively
B. Tightly coupled hardware on loosely coupled software and shared memory, repspectively
C. Tightly coupled software on loosely coupled hardware and message passing, repspectively
D. Loosely coupled software on tightly coupled hardware and file sharing, repspectively

ugcnetcse-dec2015-paper3 distributed-system

Answer key ☟

25.4.2 Distributed System: UGC NET CSE | September 2013 | Part 3 | Question: 68

Which of the following statements is not correct with respect to the distributed systems?

A. Distributed system represents a global view of the network and considers it as a virtual uniprocessor system by
controlling and managing resources across the network on all the sites.
B. Distributed system is built on bare machine, not an add-on to the existing software
C. In a distributed system, kernel provides smallest possible set of services on which other services are built. This
kernel is called microkernel. Open servers provide other services and access to shared resources.
D. In a distributed system, if a user wants to run the program on other nodes or share the resources on remote sites due
to their beneficial aspects, user has to log on to that site.

ugcnetcse-sep2013-paper3 distributed-system

Answer key ☟

25.5 Message Passing (1)

25.5.1 Message Passing: UGC NET CSE | Junet 2015 | Part 2 | Question: 50

Which of the following is not valid with reference to Message Passing Interface(MPI)?

A. MPI can run on any hardware platform

B. The programming model is a distributed memory model
 C. All parallelism is implicit
D. MPI- Comm - Size returns the total number of MPI processes in specified communication

ugcnetcse-june2015-paper2 parallel-computing message-passing

Answer key ☟

25.6 Parallel Virtual Machine (1)

25.6.1 Parallel Virtual Machine: UGC NET CSE | Junet 2015 | Part 2 | Question: 47

Which of the following statements is incorrect for Parallel Virtual Machine (PVM)?

A. The PVM communication model provides asynchronous blocking send, asynchronous blocking receive, amd non-
blocking receive function
B. Message buffers are allocated dynamically
C. The PVM communication model assumes that any task can send a message to any order PVM task and that there is
no limit to the size or number of such messages
D. In PVM model, the message order is not preserved

ugcnetcse-june2015-paper2 distributed-computing parallel-virtual-machine

Answer key ☟

25.7 Rpc (1)

25.7.1 Rpc: UGC NET CSE | July 2016 | Part 3 | Question: 54

Suppose that the time to do a null remote procedure call (RPC) (i.e., 0 data bytes) is 1.0 msec with an additional
1.5 msec for every 1K of data. How long does it take to read 32 K from the file server as 32 1K RPCs?

A. 49 msec B. 80 msec C. 48 msec D. 100 msec

ugcnetcse-july2016-paper3 distributed-computing rpc

Answer key ☟

Answer Keys
25.1.1 B 25.2.1 D 25.2.2 B 25.2.3 D 25.3.1 A
25.3.2 C 25.4.1 B 25.4.2 D 25.5.1 C 25.6.1 D
25.7.1 B
26 Non GATE CSE: Geometry (2)

26.1 Geometry (1)

26.1.1 Geometry: UGC NET CSE | December 2014 | Part 3 | Question: 16

Consider a triangle represented by . The triangle is rotated by degrees about a point

. The co ordinates of the new triangle obtained after rotation shall be ________.

A.
B.
C.
D.

ugcnetcse-dec2014-paper3 geometry non-gatecse

Answer key ☟

26.2 Lines Curves (1)

26.2.1 Lines Curves: UGC NET CSE | December 2015 | Part 3 | Question: 32

The end points of a given line are and . Compute each value of y as x steps from to , by using
equation of straight line:

A. For
B. For
C. For
D. For

ugcnetcse-dec2015-paper3 geometry lines-curves

Answer key ☟

Answer Keys
26.1.1 A 26.2.1 C
27 Non GATE CSE: Integrated Circuits (1)

27.1 Integrated Circuits (1)

27.1.1 Integrated Circuits: UGC NET CSE | June 2012 | Part 2 | Question: 36

Which of the following logic families is well suited for high-speed operations?

A. TTL B. ECL C. MOS D. CMOS

non-gatecse integrated-circuits ugcnetcse-june2012-paper2

Answer key ☟

Answer Keys
27.1.1 B
28 Non GATE CSE: IS&Software Engineering (215)

28.0.1 UGC NET CSE | June 2009 | Part 2 | Question: 42

Which of the following is used for test data generation ?

A. White box B. Black box
C. Boundary-value analysis D. All of the above
ugcnetcse-june2009-paper2

Answer key ☟

28.0.2 UGC NET CSE | June 2009 | Part 2 | Question: 39

Capability Maturity Model is meant for :

A. Product
B. Process
C. Product and Process
D. None of the above

ugcnetcse-june2009-paper2

Answer key ☟

28.0.3 UGC NET CSE | June 2009 | Part 2 | Question: 40

In the light of software engineering software consists of :

A. Programs
B. Data
C. Documentation
D. All of the above

ugcnetcse-june2009-paper2

Answer key ☟

28.0.4 UGC NET CSE | June 2009 | Part 2 | Question: 43

Reverse engineering is the process which deals with :

A. Size measurement
B. Cost measurement
C. Design recovery
D. All of the above

ugcnetcse-june2009-paper2

Answer key ☟

28.0.5 UGC NET CSE | December 2018 | Part 2 | Question: 57

A legacy software system has modules. The latest release required that of these modules be changed. In
addition, new modules were added and old modules were removed. Compute the software maturity index
for the system.

A. B. C. D.
ugcnetcse-dec2018-paper2

Answer key ☟
28.0.6 UGC NET CSE | December 2004 | Part 2 | Question: 45

The Function Point metric is :

A. Calculated from user requirements B. Calculated from Lines of code

C. Calculated from software’s complexity assessment D. None of the above
ugcnetcse-dec2004-paper2

Answer key ☟

28.0.7 UGC NET CSE | December 2004 | Part 2 | Question: 43

Reliability of software is dependent on :

A. Number of errors present in software B. Documentation
C. Testing suites D. Development Processes
ugcnetcse-dec2004-paper2

Answer key ☟

28.0.8 UGC NET CSE | December 2004 | Part 2 | Question: 42

Three essential components of a software project plan are :

A. Team structure, Quality assurance plans, Cost estimation

B. Cost estimation, Time estimation, Quality assurance plan
C. Cost estimation, Time estimation, Personnel estimation
D. Cost estimation, Personnel estimation, Team structure

ugcnetcse-dec2004-paper2

Answer key ☟

28.0.9 UGC NET CSE | December 2004 | Part 2 | Question: 41

The main objective of designing various modules of a software system is :

A. To decrease the cohesion and to increase the coupling

B. To increase the cohesion and to decrease the coupling
C. To increase the coupling only
D. To increase the cohesion only

ugcnetcse-dec2004-paper2

Answer key ☟

28.0.10 UGC NET CSE | December 2006 | Part 2 | Question: 45

‘Abstraction’ is ____________ step of Attribute in a software design.

A. First B. Final C. Last D. Middle

ugcnetcse-dec2006-paper2

Answer key ☟

28.0.11 UGC NET CSE | December 2006 | Part 2 | Question: 44

Reliability of software is directly dependent on :

A. quality of the design. B. number of errors present.
 C. software engineer’s experience. D. user requirement.

ugcnetcse-dec2006-paper2

Answer key ☟

28.0.12 UGC NET CSE | December 2006 | Part 2 | Question: 43

In a object oriented software design, ‘Inheritance’ is a kind of __________ .

A. relationship. B. module. C. testing. D. optimization.

ugcnetcse-dec2006-paper2

Answer key ☟

28.0.13 UGC NET CSE | December 2006 | Part 2 | Question: 42

Software Risk estimation involves following two tasks :

A. risk magnitude and risk impact. B. risk probability and risk impact.
C. risk maintenance and risk impact. D. risk development and risk impact.
ugcnetcse-dec2006-paper2

Answer key ☟

28.0.14 UGC NET CSE | December 2006 | Part 2 | Question: 41

Software Cost Performance index (CPI) is given by :

A. B.
C. BCWP-ACWP D. BCWP-BCWS

Where :

ugcnetcse-dec2006-paper2

Answer key ☟

28.0.15 UGC NET CSE | December 2006 | Part 2 | Question: 30

The frame structure and the frame structure of are :

A. Opposite B. Identical C. Reversed D. Non-identical

ugcnetcse-dec2006-paper2

Answer key ☟

28.0.16 UGC NET CSE | December 2006 | Part 2 | Question: 19

Which of the following tools is not required during system analysis phase of system development life cycle ?

A. Case tool B. RAD tool C. Reverse engineering D. None of these

ugcnetcse-dec2006-paper2

Answer key ☟
 28.0.17 UGC NET CSE | December 2006 | Part 2 | Question: 16

Which possibility among the following is invalid in case of a Data Flow Diagram ?

A. A process having in-bound data flows more than out-bound data flows
B. A data flow between two processes
C. A data flow between two data stores
D. A data store having more than one in-bound data flows

ugcnetcse-dec2006-paper2

Answer key ☟

28.0.18 UGC NET CSE | December 2007 | Part 2 | Question: 45

The approach to software testing is to design test cases to :

A. break the software B. understand the software
C. analyse the design of sub processes in the software D. analyze the output of the software
ugcnetcse-dec2007-paper2

Answer key ☟

28.0.19 UGC NET CSE | December 2007 | Part 2 | Question: 44

System development cost estimation with use-cases is problematic because :

A. of paucity of examples B. the data can be totally incorrect
C. the expertise and resource available are not used D. the problem is being over simplified
ugcnetcse-dec2007-paper2

Answer key ☟

28.0.20 UGC NET CSE | December 2007 | Part 2 | Question: 42

Function point metric of a software also depends on the :

A. number of function needed

B. number of final users of the software
C. number of external inputs and outputs
D. time required for one set of output from a set of input data

ugcnetcse-dec2007-paper2

Answer key ☟

28.0.21 UGC NET CSE | December 2007 | Part 2 | Question: 41

A major defect in water fall model in software development is that :

A. the documentation is difficult

B. a blunder at any stage can be disastrous
C. a trial version is available only at the end of the project
D. the maintenance of the software is difficult

ugcnetcse-dec2007-paper2

Answer key ☟

28.1 Adaptive Maintenance (1)

 28.1.1 Adaptive Maintenance: UGC NET CSE | June 2019 | Part 2 | Question: 58

Software products need adaptive maintenance for which of the following reasons?

A. To rectify bugs observed while the system is in use

B. When the customers need the product to run on new platform
C. To support the new features that users want it to support
D. To overcome wear and tear caused by the repeated use of the software

ugcnetcse-june2019-paper2 adaptive-maintenance

Answer key ☟

28.2 Artificial Intelligence (2)

28.2.1 Artificial Intelligence: UGC NET CSE | December 2012 | Part 3 | Question: 74

A* algorithm is guaranteed to find an optimal solution if

A. h’ is always 0 B. g is always 1
C. h’ never overestimates h D. h’ never underestimates h
ugcnetcse-dec2012-paper3 artificial-intelligence

Answer key ☟

28.2.2 Artificial Intelligence: UGC NET CSE | June 2012 | Part 3 | Question: 23

Which of the following prolog programs correctly implement “if G succeeds then execute goal P else execute
goal ”?

A. if-else (G, P, ):-!,call(G), call(P). if-else (G,P, ) :- call( ).

B. if-else (G, P, ):-call(G), !, call(P). if-else (G,P, ) :- call( ).
C. if-else (G, P, ):-call(G), call(P), !. if-else (G,P, ) :- call( ).
D. All of the above

ugcnetcse-june2012-paper3 artificial-intelligence

Answer key ☟

28.3 Assignment Problem (1)

28.3.1 Assignment Problem: UGC NET CSE | June 2012 | Part 3 | Question: 62

The optimal solution of the following assignment problem using Hungarian method is

A. B.
C. D.
ugcnetcse-june2012-paper3 optimization assignment-problem

Answer key ☟

28.4 CRC Polynomial (1)

28.4.1 CRC Polynomial: UGC NET CSE | December 2015 | Part 3 | Question: 31

In CRC based design, a CRC Team consists of

 i. one or two users representatives
ii. several programmers
iii. project co-ordinators
iv. one or two system analysts
A. B.
C. D.
ugcnetcse-dec2015-paper3 is&software-engineering crc-polynomial

Answer key ☟

28.5 Cmm Model (3)

28.5.1 Cmm Model: UGC NET CSE | December 2014 | Part 2 | Question: 42

Requirement Development, Organizational Process Focus, Organizational Training, Risk Management and
Integrated Supplier Management are process areas required to achieve maturity level

A. Performed B. Managed C. Defined D. Optimized

ugcnetcse-dec2014-paper2 is&software-engineering cmm-model

Answer key ☟

28.5.2 Cmm Model: UGC NET CSE | July 2016 | Part 3 | Question: 47

Which of the following sets represent five stages defined by Capability Maturity Model (CMM) in increasing
order of maturity?

A. Initial, Defined, Repeatable, Managed, Optimized

B. Initial, Repeatable, Defined, Managed, Optimized
C. Initial, Defined, Managed, Repeatable, Optimized
D. Initial, Repeatable, Managed, Defined, Optimized

ugcnetcse-july2016-paper3 is&software-engineering cmm-model

Answer key ☟

28.5.3 Cmm Model: UGC NET CSE | June 2014 | Part 3 | Question: 21

Which one of the following is not a key process area in CMM level ?

A. Defect prevention B. Process change management

C. Software product engineering D. Technology change management
ugcnetjune2014iii is&software-engineering cmm-model

Answer key ☟

28.6 Cmmi (1)

28.6.1 Cmmi: UGC NET CSE | July 2018 | Part 2 | Question: 15

Match the Maturity levels staged representations in with their characterizations in

:
 A.
B.
C.
D.

ugcnetcse-july2018-paper2 is&software-engineering cmmi software-development-life-cycle-models

Answer key ☟

28.7 Cocomo Model (3)

28.7.1 Cocomo Model: UGC NET CSE | December 2008 | Part 2 | Question: 45

model is used for:

A. product quality estimation

B. product complexity estimation
C. product cost estimation
D. all of the above

ugcnetcse-dec2008-paper2 is&software-engineering cocomo-model

Answer key ☟

28.7.2 Cocomo Model: UGC NET CSE | December 2010 | Part 2 | Question: 44

The COCOMO model was introduced in the book title “Software Engineering Economics” authored by

A. Abraham Silberschatz B. Barry Boehm

C. C.J. Date D. D.E. Knuth
ugcnetcse-dec2010-paper2 is&software-engineering cocomo-model

Answer key ☟

28.7.3 Cocomo Model: UGC NET CSE | January 2017 | Part 3 | Question: 48

A software company needs to develop a project that is estimated as function points and is planning to use
JAVA as the programming language whose approximate lines of code per function point is accepted as .
Considering as multiplicative factor, as exponention factor for the basic COCOMO effort equation and
as multiplicative factor, as exponention factor for the basic COCOMO duration equation,
approximately how long does project take to complete?
A. months B. months
C. months D. months
ugcnetcse-jan2017-paper3 is&software-engineering cocomo-model

Answer key ☟

28.8 Coding and Testing (1)

 28.8.1 Coding and Testing: UGC NET CSE | July 2016 | Part 3 | Question: 46

Software safety is quality assurance activity that focuses on hazards that

A. affects the reliability of a software component

B. may cause an entire system to fail
C. may result from user input errors
D. prevent profitable marketing of the final product

ugcnetcse-july2016-paper3 is&software-engineering coding-and-testing

Answer key ☟

28.9 Cohesion (2)

28.9.1 Cohesion: UGC NET CSE | December 2014 | Part 3 | Question: 48

Temporal cohesion means

A. Coincidental cohesion B. Cohesion between temporary variables
C. Cohesion between local variables D. Cohesion with respect to time
ugcnetcse-dec2014-paper3 is&software-engineering cohesion

Answer key ☟

28.9.2 Cohesion: UGC NET CSE | Junet 2015 | Part 2 | Question: 44

Cohesion is an extension of:

A. Abstraction concept B. Refinment concept

C. Information hiding concept D. Modularity
ugcnetcse-june2015-paper2 is&software-engineering cohesion

Answer key ☟

28.10 Cost Estimation Model (2)

28.10.1 Cost Estimation Model: UGC NET CSE | December 2009 | Part 2 | Question: 43

Recorded software attributes can be used in the following endeavours :

(i) Cost and schedule estimates.
(ii) Software product reliability predictions.
(iii) Managing the development process.
(iv) No where

Codes :
(A) (i) (ii) (iv)
(B) (ii) (iii) (iv)
(C) (i) (ii) (iii)
(D) (i) (ii) (iii) (iv)
ugcnetcse-dec2009-paper2 is&software-engineering cost-estimation-model

Answer key ☟

28.10.2 Cost Estimation Model: UGC NET CSE | December 2013 | Part 3 | Question: 5

Function points can be calculated by

A. UFP * CAF B. UFP * FAC C. UFP * Cost D. UFP * Productivity

ugcnetcse-dec2013-paper3 is&software-engineering cost-estimation-model

Answer key ☟
28.11 Coupling (3)

28.11.1 Coupling: UGC NET CSE | December 2013 | Part 3 | Question: 6

Match the following

A. B.
C. D.
ugcnetcse-dec2013-paper3 is&software-engineering coupling

Answer key ☟

28.11.2 Coupling: UGC NET CSE | July 2018 | Part 2 | Question: 16

Coupling is a measure of the strength of the interconnections between software modules. Which of the following
are correct statements with respect to module coupling?
P: Common coupling occurs when one module controls the flow of another module by passing it information on what to
do
Q: In data coupling, the complete data structure is passed from one module to another through parameters.
R: Stamp coupling occurs when modules share a composite data structure and use only parts of it.
Code:

A. P and Q only B. P and R only C. Q and R only D. All of P, Q and R

ugcnetcse-july2018-paper2 is&software-engineering coupling

Answer key ☟

28.11.3 Coupling: UGC NET CSE | September 2013 | Part 3 | Question: 46

In _____, modules A and B make use of a common data type, but perhaps perform different operations on it.
A. Data coupling B. Stamp coupling
C. Control coupling D. Content coupling
ugcnetcse-sep2013-paper3 is&software-engineering coupling

Answer key ☟

28.12 Coupling Cohesion (1)

28.12.1 Coupling Cohesion: UGC NET CSE | June 2019 | Part 2 | Question: 51

Which of the following statements is/are true?

P: In software engineering, defects that are discovered earlier are more expensive to fix.
Q: A software design is said to be a good design, if the components are strongly cohesive and weakly coupled.
Select the correct answer from the options given below:

A. P only B. Q only C. P and Q D. Neither P nor Q

ugcnetcse-june2019-paper2 coupling-cohesion defect

Answer key ☟
28.13 Cyclomatic Complexity (2)

28.13.1 Cyclomatic Complexity: UGC NET CSE | December 2014 | Part 2 | Question: 45

Which one of the following is used to compute cyclomatic complexity ?

A. The number of regions

B. , where is the number of flow graph edges and is the number of flow graph nodes.
C. , where is the number of predicate nodes in the flow graph .
D. , where is the number of predicate nodes in the flow graph .

ugcnetcse-dec2014-paper2 is&software-engineering cyclomatic-complexity

Answer key ☟

28.13.2 Cyclomatic Complexity: UGC NET CSE | July 2016 | Part 2 | Question: 44

The cyclomatic complexity of a flow graph V(G), in terms of predicate notes is

A. P+1
B. P-1
C. P-2
D. P+2

Where P is the number of predicate nodes in flow graph V(G)

ugcnetcse-july2016-paper2 cyclomatic-complexity

Answer key ☟

28.14 Data Mining (2)

28.14.1 Data Mining: UGC NET CSE | December 2012 | Part 3 | Question: 5

______ is process of extracting previously non known valid and actionable information from large data to make
crucial business and strategic decisions.

A. Data Management B. Data base C. Data Mining D. Meta Data

ugcnetcse-dec2012-paper3 data-mining

Answer key ☟

28.14.2 Data Mining: UGC NET CSE | June 2012 | Part 3 | Question: 12

Which of the following can be used for clustering the data?

A. Single layer perception B. Multilayer perception

C. Self organizing map D. Radial basis function
ugcnetcse-june2012-paper3 data-mining

Answer key ☟

28.15 Digital Marketing (1)

28.15.1 Digital Marketing: UGC NET CSE | December 2012 | Part 3 | Question: 1

Eco system is a framework for

A. Building a Computer System B. Building Internet Market
C. Building Offline Market D. Building Market
ugcnetcse-dec2012-paper3 e-technologies digital-marketing

Answer key ☟

28.16 Fan In (1)

 28.16.1 Fan In: UGC NET CSE | December 2014 | Part 3 | Question: 47

of a component is defined as

A. Count of the number of components that can call, or pass control, to a component
B. Number of components related to component
C. Number of components dependent on component
D. None of the above

ugcnetcse-dec2014-paper3 is&software-engineering fan-in

Answer key ☟

28.17 Flow Chart (1)

28.17.1 Flow Chart: UGC NET CSE | December 2010 | Part 2 | Question: 45

The Warnier diagram enables analyst

A. To represent information hierarchy in a compact manner B. To further identify requirement
C. To estimate the total cost involved D. None of the above
ugcnetcse-dec2010-paper2 is&software-engineering flow-chart

Answer key ☟

28.18 Function Point Metric (2)

28.18.1 Function Point Metric: UGC NET CSE | December 2014 | Part 3 | Question: 44

To compute function points , the following relationship is used = Count - total

where to ) are value adjustment factors based on questions. The
value of is

A. B. C. D.
ugcnetcse-dec2014-paper3 is&software-engineering function-point-metric

Answer key ☟

28.18.2 Function Point Metric: UGC NET CSE | June 2014 | Part 2 | Question: 14

In function point analysis, the number of complexity adjustment factors is

A. B. C. D.
ugcnetcse-june2014-paper2 is&software-engineering function-point-metric

Answer key ☟

28.19 Git (1)

28.19.1 Git: UGC NET CSE | June 2019 | Part 2 | Question: 55

Which of the following terms best describes Git?

A. Issue Tracking System B. Integrated Development Environment

C. Distributed Version Control System D. Web-based Repository Hosting Service
ugcnetcse-june2019-paper2 git

Answer key ☟

28.20 Information System (1)

28.20.1 Information System: UGC NET CSE | December 2014 | Part 3 | Question: 60

A computer based information system is needed :

 I. As it is difficult for administrative staff to process data.
II. Due to rapid growth of information and communication technology.
III. Due to growing size of organizations which need to process large volume of data.
IV. As timely and accurate decisions are to be taken.
Which of the above statement(s) is/are true ?

A. and B. and C. and D. and

ugcnetcse-dec2014-paper3 information-system

Answer key ☟

28.21 Is&software Engineering (62)

28.21.1 Is&software Engineering: UGC NET CSE OCTOBER 2022

Which of the following are the products of grounded theory?

A. Experimental framework
B. Concepts
C. Hypotheses
D. Attributes of a category
E. Theoretical dilution

is&software-engineering

Answer key ☟

28.21.2 Is&software Engineering: UGC NET CSE | August 2016 | Part 3 | Question: 47

Which of the following are external qualities of a software product ?

A. Maintainability, reusability, portability, efficiency, correctness.

B. Correctness, reliability, robustness, efficiency, usability.
C. Portability, interoperability, maintainability, reusability.
D. Robustness, efficiency, reliability, maintainability, reusability.

ugcnetcse-aug2016-paper3 is&software-engineering

Answer key ☟

28.21.3 Is&software Engineering: UGC NET CSE | August 2016 | Part 3 | Question: 48

Which of the following is/are CORRECT statement(s) about version and release ?
I. A version is an instance of a system, which is functionally identical but nonfunctionally distinct from other
instances of a system.
II. A version is an instance of a system, which is functionally distinct in some way from other system instances.
III. A release is an instance of a system, which is distributed to users outside of the development team.
IV. A release is an instance of a system, which is functionally identical but nonfunctionally distinct from other instances
of a system.

A. I and III B. II and IV C. I and IV D. II and III

ugcnetcse-aug2016-paper3 is&software-engineering

Answer key ☟
28.21.4 Is&software Engineering: UGC NET CSE | December 2011 | Part 2 | Question: 14

An SRS

A. Establishes the basis for agreement between client and the supplier.
B. Provides a reference for validation of the final product.
C. Is a prerequisite to high quality software.
D. All of the above.

ugcnetcse-dec2011-paper2 is&software-engineering

Answer key ☟

28.21.5 Is&software Engineering: UGC NET CSE | December 2011 | Part 2 | Question: 17

Design recovery from source code is done during

A. reverse engineering B. re-engineering

C. reuse D. all of the above
ugcnetcse-dec2011-paper2 is&software-engineering

Answer key ☟

28.21.6 Is&software Engineering: UGC NET CSE | December 2012 | Part 2 | Question: 19

The maturity levels used to measure a process are

A. Initial, Repeatable, Defined, Managed, Optimized

B. Primary, Secondary, Defined, Managed, Optimized
C. Initial, Stating, Defined, Managed, Optimized
D. None of the above

ugcnetcse-dec2012-paper2 non-gatecse is&software-engineering

Answer key ☟

28.21.7 Is&software Engineering: UGC NET CSE | December 2012 | Part 2 | Question: 6

Component level design is concerned with

A. Flow oriented analysis B. Class based analysis

C. Both of the above D. None of the above
ugcnetcse-dec2012-paper2 non-gatecse is&software-engineering

Answer key ☟

28.21.8 Is&software Engineering: UGC NET CSE | December 2013 | Part 2 | Question: 10

Testing of software with actual data and in actual environment is called

A. Alpha testing B. Beta testing

C. Regression testing D. None of the above
ugcnetcse-dec2013-paper2 is&software-engineering

Answer key ☟

28.21.9 Is&software Engineering: UGC NET CSE | December 2013 | Part 2 | Question: 7

The relationship of data elements in a module is called

A. Coupling B. Modularity C. Cohesion D. Granularity

ugcnetcse-dec2013-paper2 is&software-engineering

Answer key ☟
28.21.10 Is&software Engineering: UGC NET CSE | December 2013 | Part 2 | Question: 8

Software Configuration Management is the discipline for systematically controlling

A. the changes due to the evolution of work products as the project proceeds
B. the changes due to defects (bugs) being found and then fixed
C. the changes due to requirement changes
D. all of the above

ugcnetcse-dec2013-paper2 is&software-engineering

Answer key ☟

28.21.11 Is&software Engineering: UGC NET CSE | December 2013 | Part 2 | Question: 9

Which one of the following is not a step of requirement engineering?

A. Requirement elicitation B. Requirement analysis
C. Requirement design D. Requirement documentation
ugcnetcse-dec2013-paper2 is&software-engineering

Answer key ☟

28.21.12 Is&software Engineering: UGC NET CSE | December 2013 | Part 3 | Question: 9

Which of the following is not a software myth?

A. Once we write the program and get it to work, our job is done
B. Projects requirements continually change, but change can be easily accommodated because software is flexible
C. If we get behind schedule, we can add more programmers and catch up
D. If an organization does not understand how to control software projects internally, it will invariably struggle when it
outsources software projects.

ugcnetcse-dec2013-paper3 is&software-engineering

Answer key ☟

28.21.13 Is&software Engineering: UGC NET CSE | December 2015 | Part 3 | Question: 25

Which of the following non-functional quality attributes is not highly affected by the architecture of the
software?

A. Performance B. Reliablity C. Usability D. Portability

ugcnetcse-dec2015-paper3 is&software-engineering

Answer key ☟

28.21.14 Is&software Engineering: UGC NET CSE | December 2015 | Part 3 | Question: 72

Which one of the following statements is incorrect?

A. Pareto analysis is a statistical method used for analyzing causes, and is one of the primary tools for quality
management.
B. Reliability of a software specifies the probability of failure-free operation of that software for a given time duration.
C. The reliability of a system can also be specified as the Mean Time To Failure (MTTF).
D. In white-box testing, the test cases are decided from the specifications or the requirements.

ugcnetcse-dec2015-paper3 is&software-engineering

Answer key ☟
28.21.15 Is&software Engineering: UGC NET CSE | December 2015 | Part 3 | Question: 74

Which one of the following statements, related to the requirements phase in Software Engineering, is incorrect?

A. “Requirement validation” is one of the activities in the requirements phase.

B. “Prototyping” is one of the methods for requirement analysis.
C. “Modelling-oriented approach” is one of the methods for specifying the functional specifications.
D. “Function points” is one of the most commonly used size metric for requirements.

ugcnetcse-dec2015-paper3 is&software-engineering

Answer key ☟

28.21.16 Is&software Engineering: UGC NET CSE | January 2017 | Part 2 | Question: 41

Software Engineering is an engineering discipline that is concerned with:

A. how computer systems work.

B. theories and methods that underlie computers and software systems.
C. all aspects of software production
D. all aspects of computer-based systems development, including hardware, software and process engineering.

ugcnetjan2017ii is&software-engineering

Answer key ☟

28.21.17 Is&software Engineering: UGC NET CSE | January 2017 | Part 2 | Question: 42

Which of the following is not one of three software product aspects addressed by McCall's software quality
factors ?
A. Ability to undergo change B. Adaptiability to new environments
C. Operational characteristics D. Production costs and scheduling
ugcnetjan2017ii is&software-engineering

Answer key ☟

28.21.18 Is&software Engineering: UGC NET CSE | January 2017 | Part 2 | Question: 43

Which of the following statement(s) is/are true with respect to software architecture?
: Coupling is a measure of how well the things grouped together in a module belong together logically.
: Cohesion is a measure of the degree of interaction between software modules.
: If coupling is low and cohesion is high then it is easier to change one module without affecting others.

A. Only and B. Only C. All of , and D. Only

ugcnetjan2017ii is&software-engineering

Answer key ☟

28.21.19 Is&software Engineering: UGC NET CSE | January 2017 | Part 2 | Question: 44

The prototyping model of software development is:

A. a reasonable approach when requirements are well-defined.

B. a useful approach when a customer cannot define requirements clearly.
C. the best approach to use for projects with large development teams.
D. a risky model that rarely produces a meaningful product.

ugcnetjan2017ii is&software-engineering

Answer key ☟
28.21.20 Is&software Engineering: UGC NET CSE | January 2017 | Part 3 | Question: 45

Match the terms related to Software Configuration Management (​​SCM) in List-Ⅰ with the descriptions in List-II.

A. B.
C. D.
ugcnetcse-jan2017-paper3 is&software-engineering

Answer key ☟

28.21.21 Is&software Engineering: UGC NET CSE | January 2017 | Part 3 | Question: 46

A software project was estimated at Function Points . A four person team will be assigned to this project
consisting of an architect, two programmers, and a tester The salary of the architect is ₹ per month, the
programmer ₹ per month and the tester ₹ per month. The average productivity for the team is per
person month. Which of the following represents the projected cost of the project?
A. ₹ B. ₹
C. ₹ D. ₹
ugcnetcse-jan2017-paper3 is&software-engineering

Answer key ☟

28.21.22 Is&software Engineering: UGC NET CSE | January 2017 | Part 3 | Question: 47

Complete each of the following sentences in List-I on the left hand side by filling in the word or phrase from the
List –II on the right hand side that best completes the sentence :

A. B.
C. D.
ugcnetcse-jan2017-paper3 is&software-engineering

Answer key ☟

28.21.23 Is&software Engineering: UGC NET CSE | July 2016 | Part 2 | Question: 41

If is total number of modules defined in the program architecture, is the number of modules whose
correct function depends on prior processing then the number of modules not dependent on prior processing is:

A. B. C. D.
 ugcnetcse-july2016-paper2 is&software-engineering

Answer key ☟

28.21.24 Is&software Engineering: UGC NET CSE | July 2016 | Part 3 | Question: 44

Match the software maintenance activities in List-I to its meaning in List-II.

A. B.
C. D.
ugcnetcse-july2016-paper3 is&software-engineering

Answer key ☟

28.21.25 Is&software Engineering: UGC NET CSE | July 2018 | Part 2 | Question: 12

Match the following in Software Engineering :

A. B.
C. D.
ugcnetcse-july2018-paper2 is&software-engineering match-the-following

Answer key ☟

28.21.26 Is&software Engineering: UGC NET CSE | July 2018 | Part 2 | Question: 13

Which one of the following is not typically provided by Source Code Management Software?

A. Synchronization B. Versioning and Revision history

C. Syntax highlighting D. Project forking
ugcnetcse-july2018-paper2 is&software-engineering

Answer key ☟

28.21.27 Is&software Engineering: UGC NET CSE | July 2018 | Part 2 | Question: 14

A software system crashed 20 times in the year 2017 and for each crash, it took 2 minutes to restart.
Approximately, what was the software availability in that year?
 A. 96.9924% B. 97.9924% C. 98.9924% D. 99.9924%
ugcnetcse-july2018-paper2 is&software-engineering

Answer key ☟

28.21.28 Is&software Engineering: UGC NET CSE | July 2018 | Part 2 | Question: 18

Reasons to re-engineer a software include:

P: Allow legacy software to quickly adapt to the changing requirements
Q: Upgrade to newer technologies/platforms/paradigm (for example, object-oriented)
R: Improve software maintainability
S: Allow change in the functionality and architecture of the software
Code:

A. P, R and S only B. P and R only C. P, Q and S only D. P, Q and R only

ugcnetcse-july2018-paper2 is&software-engineering

Answer key ☟

28.21.29 Is&software Engineering: UGC NET CSE | July 2018 | Part 2 | Question: 19

Which of the following is not a key strategy followed by the clean room approach to software development?

A. Formal specification B. Dynamic verification

C. Incremental development D. Statistical testing of the system
ugcnetcse-july2018-paper2 is&software-engineering

Answer key ☟

28.21.30 Is&software Engineering: UGC NET CSE | July 2018 | Part 2 | Question: 20

Which of the following statements is/are True?

P: Refactoring is the process of changing a software system in such a way that it does not alter the external
behavior of the code yet improves the internal architecture
Q: An example of refactoring is adding new features to satisfy a customer requirement discovered after a project is
shipped
Code:

A. P only B. Q only C. Both P and Q D. Neither P nor Q

ugcnetcse-july2018-paper2 is&software-engineering

Answer key ☟

28.21.31 Is&software Engineering: UGC NET CSE | June 2005 | Part 2 | Question: 42

Which one of the following is not a software process model?

A. Linear sequential model B. Prototyping model

C. The spiral model D. model
ugcnetcse-june2005-paper2 is&software-engineering

Answer key ☟

28.21.32 Is&software Engineering: UGC NET CSE | June 2007 | Part 2 | Question: 43

Match the following:

 Which of the following is true:
A. a-ii, b-iii, c-iv, d-i B. a-i, b-ii, c-iv, d-iii
C. a-iii, b-iv, c-i, d-ii D. None of the above
ugcnetcse-june2007-paper2 match-the-following is&software-engineering non-gatecse

Answer key ☟

28.21.33 Is&software Engineering: UGC NET CSE | June 2010 | Part 2 | Question: 41

Software engineering primarily aims on

A. Reliable software B. Cost effective software
C. Reliable and cost effective software D. None of the above
ugcnetcse-june2010-paper2 is&software-engineering

Answer key ☟

28.21.34 Is&software Engineering: UGC NET CSE | June 2012 | Part 2 | Question: 20

Main aim of software engineering is to produce

A. program B. software
C. within budget D. software within budget in the given schedule
ugcnetcse-june2012-paper2 non-gatecse is&software-engineering

Answer key ☟

28.21.35 Is&software Engineering: UGC NET CSE | June 2012 | Part 2 | Question: 21

Key process areas of CMM level 4 are also classified by a process which is

A. CMM level 2 B. CMM level 3 C. CMM level 5 D. All of the above

ugcnetcse-june2012-paper2 non-gatecse is&software-engineering

Answer key ☟

28.21.36 Is&software Engineering: UGC NET CSE | June 2012 | Part 2 | Question: 22

Validation means
A. are we building the product right B. are we building the right product
C. verification of fields D. None of the above
ugcnetcse-june2012-paper2 is&software-engineering non-gatecse

Answer key ☟

28.21.37 Is&software Engineering: UGC NET CSE | June 2012 | Part 2 | Question: 23

If a process is under statistical control, then it is

A. Maintainable B. Measurable C. Predictable D. Verifiable

ugcnetcse-june2012-paper2 non-gatecse is&software-engineering

Answer key ☟

28.21.38 Is&software Engineering: UGC NET CSE | June 2012 | Part 2 | Question: 24

In a function oriented design, we

 A. minimize cohesion and maximize coupling B. maximize cohesion and minimize coupling
C. maximize cohesion and maximize coupling D. minimize cohesion and minimize coupling
ugcnetcse-june2012-paper2 non-gatecse is&software-engineering

Answer key ☟

28.21.39 Is&software Engineering: UGC NET CSE | June 2012 | Part 2 | Question: 25

Which of the following metric does not depend on the programming language used?
A. Line of code B. Function count
C. Member of token D. All of the above
non-gatecse is&software-engineering ugcnetcse-june2012-paper2

Answer key ☟

28.21.40 Is&software Engineering: UGC NET CSE | June 2012 | Part 2 | Question: 43

Reliability of software is directly dependent on

A. quality of the design B. number of errors present
C. software engineers experience D. user requirement
non-gatecse is&software-engineering ugcnetcse-june2012-paper2

Answer key ☟

28.21.41 Is&software Engineering: UGC NET CSE | June 2012 | Part 3 | Question: 37

Are we building the right product? – This statement refers to

A. Verification B. Validation
C. Testing D. Software quality assurance
ugcnetcse-june2012-paper3 is&software-engineering

Answer key ☟

28.21.42 Is&software Engineering: UGC NET CSE | June 2013 | Part 2 | Question: 3

While estimating the cost of software, Lines Of Code (LOC) and Function Points (FP) are used to measure
which one of the following?
A. Length of code B. Size of software
C. Functionality of software D. None of the above
is&software-engineering ugcnetcse-june2013-paper2

Answer key ☟

28.21.43 Is&software Engineering: UGC NET CSE | June 2014 | Part 2 | Question: 11

in stands for
A. Key Process Area B. Key Product Area
C. Key Principal Area D. Key Performance Area
ugcnetcse-june2014-paper2 is&software-engineering

Answer key ☟

28.21.44 Is&software Engineering: UGC NET CSE | June 2014 | Part 2 | Question: 13

_________ of a system is the structure or structures of the system which comprise software elements, the
externally visible properties of these elements and the relationship amongst them.
A. Software construction B. Software evolution
C. Software architecture D. Software reuse
ugcnetcse-june2014-paper2 is&software-engineering

Answer key ☟
28.21.45 Is&software Engineering: UGC NET CSE | June 2014 | Part 2 | Question: 28

A software agent is defined as

I. A software developed for accomplishing a given task.

II. A computer program which is capable of acting on behalf of the user in order to accomplish a given computational
task.
III. An open source software for accomplishing a given task.

A. B.
C. D. All of the above
ugcnetcse-june2014-paper2 is&software-engineering

Answer key ☟

28.21.46 Is&software Engineering: UGC NET CSE | June 2014 | Part 3 | Question: 19

Match the following

A. B.
C. D.
ugcnetjune2014iii is&software-engineering

Answer key ☟

28.21.47 Is&software Engineering: UGC NET CSE | June 2014 | Part 3 | Question: 20

Which one of the following is not a definition of error ?

A. It refers to the discrepancy between a computed, observed or measured value and the true, specified or theoretically
correct value.
B. It refers to the actual output of a software and the correct output.
C. It refers to a condition that causes a system to fail.
D. It refers to human action that results in software containing a defect or fault.

ugcnetjune2014iii is&software-engineering

Answer key ☟

28.21.48 Is&software Engineering: UGC NET CSE | Junet 2015 | Part 3 | Question: 44

Which design matric is used to measure the compactness of the program in terms of lines of code?

A. Consistency B. Conciseness C. Efficiency D. Accuracy

is&software-engineering non-gatecse ugcnetcse-june2015-paper3

Answer key ☟

28.21.49 Is&software Engineering: UGC NET CSE | Junet 2015 | Part 3 | Question: 45

Requirements prioritization and negotiation belongs to

A. Requirements validation B. Requirements elicitation

 C. Feasibility study D. Requirements reviews
is&software-engineering non-gatecse ugcnetcse-june2015-paper3

Answer key ☟

28.21.50 Is&software Engineering: UGC NET CSE | Junet 2015 | Part 3 | Question: 60

Match the following :

A. B.
C. D.
ugcnetcse-june2015-paper3 is&software-engineering

Answer key ☟

28.21.51 Is&software Engineering: UGC NET CSE | October 2020 | Part 2 | Question: 19

Which of the following diagrams has a static view?

A. Collaboration diagram B. Use-Case diagram
C. State chart diagram D. Activity diagram
ugcnetcse-oct2020-paper2 non-gatecse is&software-engineering

Answer key ☟

28.21.52 Is&software Engineering: UGC NET CSE | October 2020 | Part 2 | Question: 20

Modifying the software by restructuring is called

A. Adaptive maintenance B. Corrective maintenance
C. Perfective maintenance D. Preventive maintenance
ugcnetcse-oct2020-paper2 non-gatecse is&software-engineering

Answer key ☟

28.21.53 Is&software Engineering: UGC NET CSE | October 2020 | Part 2 | Question: 21

A company has a choice of two languages and to develop a software for their client. Number of LOC
required to develop an application in is thrice the LOC in language . Also, software has to be maintained
for next years. Various parameters for two languages are given below to decide which language should be preferred
for development.
 Total cost of project include cost of development and maintenance. What is the for for which cost of
developing the software with both languages must be same?

A. B. C. D.
ugcnetcse-oct2020-paper2 non-gatecse is&software-engineering

Answer key ☟

28.21.54 Is&software Engineering: UGC NET CSE | October 2020 | Part 2 | Question: 22

A Software project was estimated at Function Points. A six person team will be assigned to project
consisting of a requirement gathering person, one designer, two programmers and two testers. The salary of the
designer is per month, requirement gatherer is per month, programmer is per month
and a tester is per month. Average productivity for the team is FP per person month. Which of the
following represents the projected cost of the project
A. B.
C. D.
ugcnetcse-oct2020-paper2 non-gatecse is&software-engineering

Answer key ☟

28.21.55 Is&software Engineering: UGC NET CSE | October 2020 | Part 2 | Question: 45

Which of the following statements regarding XML is/are True?

i. XML is a set of tags designed to tell browsers how to display text and images in a web page
ii. XML defines a syntax for representing data, but the meaning of data varies from application to application
iii. <Letter>, <LETTER> and <letter> are three different tags in XML

Choose the correct answer from the options given below:

A. and only B. and only
C. and only D. and
ugcnetcse-oct2020-paper2 non-gatecse is&software-engineering

Answer key ☟

28.21.56 Is&software Engineering: UGC NET CSE | October 2020 | Part 2 | Question: 49

Software reliability is described with respect to

i. Execution Time
ii. Calender Time
iii. Clock Time

Choose the correct answer from the options given below:

A. and only B. and only

C. , and D. and only
ugcnetcse-oct2020-paper2 non-gatecse is&software-engineering

Answer key ☟

28.21.57 Is&software Engineering: UGC NET CSE | October 2020 | Part 2 | Question: 50

To create an object-behavioral model, the analyst performs the following steps:

a. Evaluates all use-cases b. Builds state transition diagram for the system
c. Reviews the object behaviour model to verify accuracyd. Identifies events that do not derive the interaction
 and consistency sequence
Choose the correct answer from the options given below:

A. , and only B. , and only

C. , and only D. , and only
ugcnetcse-oct2020-paper2 non-gatecse is&software-engineering

Answer key ☟

28.21.58 Is&software Engineering: UGC NET CSE | October 2020 | Part 2 | Question: 51

Which of the following is/are behavioral testing technique(s)?

a. Equivalence Partitioning b. Graph-Based Treating Method

c. Boundary Value Analysis d. Data flow Testing
e. Loop Testing Choose the correct answer from the options given below:
A. and only B. , and only
C. and only D. , and only
ugcnetcse-oct2020-paper2 non-gatecse is&software-engineering

Answer key ☟

28.21.59 Is&software Engineering: UGC NET CSE | October 2020 | Part 2 | Question: 68

Match with
With reference to CMM developed by Software Engineering Institute (SEI)

Choose the correct answer from the options given below:

A. B.
C. D.
ugcnetcse-oct2020-paper2 non-gatecse is&software-engineering

Answer key ☟

28.21.60 Is&software Engineering: UGC NET CSE | October 2020 | Part 2 | Question: 77

Arrange the following types of Cohesion from the best to worst type.

a. Logical Cohesion
b. Sequential Cohesion
c. Communication Cohesion
d. Temporal Cohesion
e. Procedural Cohesion

Choose the correct answer from the options given below:

A.
B.
C.
D.

ugcnetcse-oct2020-paper2 non-gatecse is&software-engineering

Answer key ☟
 28.21.61 Is&software Engineering: UGC NET CSE | October 2020 | Part 2 | Question: 85

Statement : Quality control involves the series of inspections, reviews and tests used throughout the software
process, to ensure each work product meets the requirements placed upon it.
Statement : Quality assurance consists of auditing and reporting functions of management
In the light of the above statements, choose the correct answer from the options given below

A. Both Statement and Statement are true

B. Both Statement and Statement are false
C. Statement is correct but Statement is false
D. Statement is incorrect but Statement is true

ugcnetcse-oct2020-paper2 non-gatecse is&software-engineering

Answer key ☟

28.21.62 Is&software Engineering: UGC NET CSE | September 2013 | Part 2 | Question: 28

The _____ of a program or computing system is the structure or structures of the system, which comprise
software components, the externally visible properties of these components and the relationship among them.

A. E-R diagram B. Data flow diagram

C. Software architecture D. Software design
ugcnetsep2013ii is&software-engineering

Answer key ☟

28.22 Life Cycle Model (1)

28.22.1 Life Cycle Model: UGC NET CSE | Junet 2015 | Part 2 | Question: 43

Which process model is also called as classic life cycle model?

A. Waterfall model B. RAD model

C. Prototyping model D. Incremental model
ugcnetcse-june2015-paper2 is&software-engineering life-cycle-model

Answer key ☟

28.23 Mis (1)

28.23.1 Mis: UGC NET CSE | July 2016 | Part 3 | Question: 71

Which of the following is characteristic of MIS?

A. Provides guidance in identifying problems, finding and evaluating alternative solutions, and selecting or comparing
alternatives
B. Draws on diverse yet predictable data resources to aggregate and summarize data
C. High volume, data capture focus
D. Has as its goal the efficiency of data movement and processing and interfacing different TPS

ugcnetcse-july2016-paper3 mis is&software-engineering

Answer key ☟

28.24 Model View Controller (1)

28.24.1 Model View Controller: UGC NET CSE | June 2019 | Part 2 | Question: 52

The M components in MVC are responsible for

 A. user interface
B. security of the system
C. business logic and domain objects
D. translating between user interface actions/events and operations on the domain objects

ugcnetcse-june2019-paper2 model-view-controller

Answer key ☟

28.25 Object Oriented Modelling (1)

28.25.1 Object Oriented Modelling: UGC NET CSE | December 2014 | Part 3 | Question: 41

What is true about stereotypes ?

A. Stereotype is used for extending the language.

B. Stereotyped class must be abstract
C. The stereotype indicates that the element cannot be changed
D. UML profiles can be stereotyped for backward compatibility

ugcnetcse-dec2014-paper3 object-oriented-modelling uml

Answer key ☟

28.26 Optimization (1)

28.26.1 Optimization: UGC NET CSE | June 2012 | Part 3 | Question: 49

In any simplex table, if corresponding to any negative j, all elements of the column are negative or zero, the
solution under the test is
A. degenerate solution B. unbounded solution
C. alternative solution D. non-existing solution
ugcnetcse-june2012-paper3 optimization linear-programming

Answer key ☟

28.27 Project Planning (1)

28.27.1 Project Planning: UGC NET CSE | Junet 2015 | Part 2 | Question: 45

Which one from the following is highly associated activity of project planning?

A. Keep track of the progress

B. Compare the actual and planned progress and costs
C. Identify the activities, milestones and deliverables produced by a project
D. Both B and C

ugcnetcse-june2015-paper2 is&software-engineering project-planning

Answer key ☟

28.28 Project Tracking (1)

28.28.1 Project Tracking: UGC NET CSE | June 2019 | Part 2 | Question: 59

Which of the following are the primary objectives of risk monitoring in software project tracking?
P: To assess whether predicted risks do, in fact, occur
Q: To ensure that risk aversion steps defined for the risk are being properly applied
R: To collect information that can be used for future risk analysis

A. Only P and Q B. Only P and R C. Only Q and R D. All of P, Q, R

 ugcnetcse-june2019-paper2 project-tracking risk-monitoring

Answer key ☟

28.29 Risk Management (3)

28.29.1 Risk Management: UGC NET CSE | December 2014 | Part 3 | Question: 45

Assume that the software team defines a project risk with % probability of occurrence of risk in the following
manner: Only percent of the software components scheduled for reuse will be integrated into the application
and the remaining functionality will have to be custom developed. If reusable components were planned with average
component size as LOC and software engineering cost for each LOC as $14, then the risk exposure would be

A. $25,200 B. $20,160 C. $17,640 D. $15,120

ugcnetcse-dec2014-paper3 is&software-engineering risk-management

Answer key ☟

28.29.2 Risk Management: UGC NET CSE | June 2014 | Part 2 | Question: 12

Which one of the following is not a risk management technique for managing the risk due to unrealistic
schedules and budgets ?
A. Detailed multi source cost and schedule estimation. B. Design cost
C. Incremental development D. Information hiding
ugcnetcse-june2014-paper2 is&software-engineering risk-management

Answer key ☟

28.29.3 Risk Management: UGC NET CSE | September 2013 | Part 3 | Question: 50

Sixty reusable components were available for an application. If only 70% of these components can be used, rest
30% would have to be developed from scratch. If average component is 100 LOC and cost of each LOC is Rs.
14, what will be risk of exposure if risk probability is 80%?

A. Rs. 25, 200 B. Rs. 20, 160 C. Rs. 25, 160 D. Rs. 20, 400
ugcnetcse-sep2013-paper3 is&software-engineering risk-management

Answer key ☟

28.30 Size Metrices (1)

28.30.1 Size Metrices: UGC NET CSE | Junet 2015 | Part 2 | Question: 41

Match the following:

A. B.
C. D.
ugcnetcse-june2015-paper2 size-metrices is&software-engineering

Answer key ☟

28.31 Software (1)

 28.31.1 Software: UGC NET CSE | January 2017 | Part 2 | Question: 45

A software design pattern used to enhance the functionality of an object at run-time is:

A. Adapter B. Decorator C. Delegation D. Proxy

ugcnetjan2017ii software non-gatecse is&software-engineering

Answer key ☟

28.32 Software Configuration (1)

28.32.1 Software Configuration: UGC NET CSE | December 2013 | Part 3 | Question: 7

A process which defines a series of tasks that have the following four primary objectives is known as

1. to identify all items that collectively define the software configuration

2. to manage changes to one or more of these items
3. to facilitate the construction of different versions of an application
4. to ensure that software quality is maintained as the configuration evolves over time
A. Software Quality Management Process B. Software Configuration Management Process
C. Software Version Management Process D. Software Change Management Process
ugcnetcse-dec2013-paper3 is&software-engineering software-configuration

Answer key ☟

28.33 Software Cost Estimation (1)

28.33.1 Software Cost Estimation: UGC NET CSE | June 2014 | Part 3 | Question: 18

Consider a project with the following functional units :

Number of user inputs =
Number of user outputs =
Number of user enquiries =
Number of user files =
Number of external interfaces =
Assuming all complexity adjustment factors and weighing factors as average, the function points for the project will be

A. 135 B. 722 C. 675 D. 672

ugcnetjune2014iii is&software-engineering software-cost-estimation

Answer key ☟

28.34 Software Design (18)

28.34.1 Software Design: Computer Science - UGC NET 2021 [ Question ID = 2342 ]

The V components in MVC are responsible for :

1. User interface.

2. Security of the system.

3. Business logic and domain objects.

4. Translating between user interface actions / events and operations on the domain objects.

software-design

Answer key ☟
28.34.2 Software Design: Computer Science - UGC NET 2021 [ Question ID = 2344 ]

If every requirement stated in the Software Requirement Specification (SRS) has only one interpretation, then
SRS is said to be :

1. correct

2. consistent

3. unambiguous

4. verifiable

software-design

Answer key ☟

28.34.3 Software Design: Computer Science - UGC NET 2021 [ Question ID = 2348 ]

Identify the correct order of the following five levels of Capability Maturity Model (from lower to higher) to
measure the maturity of an organization's software process.
A. Defined B. Optimizing
C. Initial D. Managed
E. Repeatable Choose the correct answer from the options given below

1. C, A, E, D, B
2. C, B, D, E, A
3. C,E, A, B, D
4. C, E, A, D, B

non-gatecse software-design

Answer key ☟

28.34.4 Software Design: Computer Science - UGC NET 2021 [ Question ID = 2350 ]

Given below are two statements, one is labelled as Assertion A and the other is labelled as Reason R :
Assertion A : Software developers do not do exhaustive software testing in practice.
Reason R : Even for small inputs, exhaustive testing is too computationally intensive (e.g., takes too long) to run all the
tests.
In light of the above statements, choose the correct answer from the options given below :

A. Both A and R are true and R is the correct explanation of A.

B. Both A and R are true but R is NOT the correct explanation of A.

C. A is true but R is false.

D. A is false but R is true.

software-design software-testing non-gatecse

Answer key ☟

28.34.5 Software Design: UGC NET CSE | August 2016 | Part 2 | Question: 43

The quick design of a software that is visible to end users leads to _____.
A. Iterative model B. Prototype model
C. Spiral model D. Waterfall model
ugcnetcse-aug2016-paper2 is&software-engineering software-design
 Answer key ☟

28.34.6 Software Design: UGC NET CSE | December 2011 | Part 2 | Question: 41

Software risk estimation involves following two tasks :

A. Risk magnitude and risk impact B. Risk probability and risk impact
C. Risk maintenance and risk impact D. Risk development and risk impact
ugcnetcse-dec2011-paper2 is&software-engineering software-design

Answer key ☟

28.34.7 Software Design: UGC NET CSE | December 2014 | Part 2 | Question: 43

The software _______ of a program or a computing system is the structure or structures of the system, which
comprise software components, the externally visible properties of those components, and the relationships
among them.
A. Design B. Architecture
C. Process D. Requirement
ugcnetcse-dec2014-paper2 is&software-engineering software-design

Answer key ☟

28.34.8 Software Design: UGC NET CSE | July 2016 | Part 3 | Question: 45

Match each application/software design concept in List-I to its definition in List-II.

A. B.
C. D.
ugcnetcse-july2016-paper3 is&software-engineering software-design

Answer key ☟

28.34.9 Software Design: UGC NET CSE | July 2018 | Part 2 | Question: 17

A software design pattern often used to restrict access to an object is

A. adapter B. decorator C. delegation D. proxy

ugcnetcse-july2018-paper2 is&software-engineering software-design

Answer key ☟

28.34.10 Software Design: UGC NET CSE | June 2010 | Part 2 | Question: 42

Top-down design does not require

A. Step-wise refinement B. Loop invariants

C. Flow charting D. Modularity
ugcnetcse-june2010-paper2 is&software-engineering software-design

Answer key ☟
28.34.11 Software Design: UGC NET CSE | June 2010 | Part 2 | Question: 44

Design phase will usually be

A. Top-down B. Bottom-up C. Random D. Centre fringing

ugcnetcse-june2010-paper2 is&software-engineering software-design

Answer key ☟

28.34.12 Software Design: UGC NET CSE | June 2013 | Part 3 | Question: 1

The Software Maturity Index (SMI) is defined as

where = number of modules in current release
=the number of module in the current release that have been added
= the number of module in the current release that have been changed
= the number of module in the current release that have been deleted
The product begins to stabilize when
A. SMI approaches 1 B. SMI approaches 0
C. SMI approaches -1 D. None of the above
ugcnetcse-june2013-paper3 is&software-engineering software-design non-gatecse

Answer key ☟

28.34.13 Software Design: UGC NET CSE | June 2013 | Part 3 | Question: 10

Match the following

A. B.
C. D.
ugcnetcse-june2013-paper3 is&software-engineering software-design

Answer key ☟

28.34.14 Software Design: UGC NET CSE | June 2013 | Part 3 | Question: 3

______ is a process model that removes defects before they can precipitate serious hazards.

A. Incremental model B. Spiral model

C. Cleanroom software engineering D. Agile model
ugcnetcse-june2013-paper3 is&software-engineering software-design

Answer key ☟

28.34.15 Software Design: UGC NET CSE | June 2013 | Part 3 | Question: 5

The following three golden rules

Place the user in control

Reduce the user’s memory load
Make the interface consistent

are of
A. User satisfaction B. Good interface design
C. Saving system’s resources D. None of these
ugcnetcse-june2013-paper3 is&software-engineering software-design
 Answer key ☟

28.34.16 Software Design: UGC NET CSE | Junet 2015 | Part 3 | Question: 42

Modulo design is used to maximize cohesion and minimize coupling. Which of the following is the key to
implement this rule?

A. Inheritance B. Polymorphism C. Encapsulation D. Abstraction

ugcnetcse-june2015-paper3 software-design is&software-engineering

Answer key ☟

28.34.17 Software Design: UGC NET CSE | Junet 2015 | Part 3 | Question: 47

A Design Concept Refinement is a

A. Top-down approach B. Complementary of abstraction concept
C. process of elaboration D. All of the above
ugcnetcse-june2015-paper3 software-design is&software-engineering

Answer key ☟

28.34.18 Software Design: UGC NET CSE | Junet 2015 | Part 3 | Question: 48

A software design is highly modular if

A. cohesion is functional and coupling is data type

B. cohesion is coincidental and coupling is data type
C. cohesion is sequential and coupling is content type
D. cohesion is functional and coupling is stamp type

ugcnetcse-june2015-paper3 is&software-engineering software-design

Answer key ☟

28.35 Software Development (3)

28.35.1 Software Development: UGC NET CSE | December 2009 | Part 2 | Question: 43

Software Engineering is a discipline that integrates _________ for the development of computer software.

(A) Process

(B) Methods

(C) Tools

(D) All
ugcnetcse-dec2009-paper2 is&software-engineering software-development

Answer key ☟

28.35.2 Software Development: UGC NET CSE | July 2018 | Part 2 | Question: 11

Assume the following regarding the development of a software system P:

Estimated lines of codes P : 33, 480 LOC

Average productivity for P : 620 LOC per person -month
Number of software developers : 6
Average salary of a software developer : INR 50, 000 per month

If E, D and C are the estimated development effort (in person-month), estimated development time (in months), and
 estimated development cost (in INR Lac) respectively, then (E, D, C) = ______

A. (48, 8, 24) B. (54, 9, 27) C. (60, 10, 30) D. (42, 7, 21)

ugcnetcse-july2018-paper2 is&software-engineering software-development

Answer key ☟

28.35.3 Software Development: UGC NET CSE | September 2013 | Part 2 | Question: 27

In which one of the following continuous process improvement is done?

A. ISO9001 B. RMMM C. CMM D. None of the above

ugcnetsep2013ii is&software-engineering software-development

Answer key ☟

28.36 Software Development Life Cycle Models (11)

28.36.1 Software Development Life Cycle Models: UGC NET CSE | August 2016 | Part 3 | Question: 44

Match each software lifecycle model in List – I to its description in List – II :

A. B.
C. D.
ugcnetcse-aug2016-paper3 is&software-engineering software-development-life-cycle-models

Answer key ☟

28.36.2 Software Development Life Cycle Models: UGC NET CSE | December 2008 | Part 2 | Question: 44

Which level is called as “ defined” in capability maturity model?

A. level B. level
C. level D. level
ugcnetcse-dec2008-paper2 is&software-engineering software-development-life-cycle-models

Answer key ☟

28.36.3 Software Development Life Cycle Models: UGC NET CSE | December 2010 | Part 2 | Question: 42

Which one of these are not software maintenance activity ?

A. Error correction B. Adaptation

C. Implementation of Enhancement D. Establishing scope
ugcnetcse-dec2010-paper2 is&software-engineering software-development-life-cycle-models

Answer key ☟
28.36.4 Software Development Life Cycle Models: UGC NET CSE | December 2010 | Part 2 | Question: 43

The system specification is the first deliverable in the computer system engineering process which does not
include
A. Functional Description B. Cost
C. Schedule D. Technical Analysis
ugcnetcse-dec2010-paper2 is&software-engineering software-development-life-cycle-models

Answer key ☟

28.36.5 Software Development Life Cycle Models: UGC NET CSE | December 2011 | Part 2 | Question: 13

For a data entry project for office staff who have never used computers before (user interface and user
friendliness are extremely important), one will use

A. Spiral model B. Component based model

C. Prototyping D. Waterfall model
ugcnetcse-dec2011-paper2 is&software-engineering software-development-life-cycle-models

Answer key ☟

28.36.6 Software Development Life Cycle Models: UGC NET CSE | December 2012 | Part 2 | Question: 24

RAD stands for

A. Rapid and Design B. Rapid Aided Development

C. Rapid Application Development D. Rapid Application Design
ugcnetcse-dec2012-paper2 is&software-engineering software-development-life-cycle-models

Answer key ☟

28.36.7 Software Development Life Cycle Models: UGC NET CSE | December 2012 | Part 2 | Question: 48

_____ is an “umbrella” activity that is applied throughout the software engineering process.

A. Debugging B. Testing
C. Designing D. Software quality assurance
ugcnetcse-dec2012-paper2 is&software-engineering software-development-life-cycle-models

Answer key ☟

28.36.8 Software Development Life Cycle Models: UGC NET CSE | December 2015 | Part 2 | Question: 47

Which of the following is not a software process model?

A. Prototyping B. Iterative C. Timeboxiing D. Glassboxing

ugcnetcse-dec2015-paper2 is&software-engineering software-development-life-cycle-models

Answer key ☟

28.36.9 Software Development Life Cycle Models: UGC NET CSE | July 2016 | Part 2 | Question: 42

The ____ model is preferred for software development when the requirements are not clear.
A. Rapid Application Development B. Rational Unified Process
C. Evolutionary Model D. Waterfall Model
ugcnetcse-july2016-paper2 is&software-engineering software-development-life-cycle-models

Answer key ☟

28.36.10 Software Development Life Cycle Models: UGC NET CSE | June 2019 | Part 2 | Question: 57

Match List-I with List-II:

 Choose the correct option from those given below:
A. a-ii; b-iv; c-i; d-iii B. a-i; b-iii; c-iv; d-ii
C. a-iii; b-ii; c-iv; d-i D. a-iv; b-i; c-iii; d-ii
ugcnetcse-june2019-paper2 software-development-life-cycle-models

Answer key ☟

28.36.11 Software Development Life Cycle Models: UGC NET CSE | September 2013 | Part 2 | Question: 29

Working software is not available until late in the process in

A. Waterfall model B. Prototyping model

C. Incremental model D. Evolutionary Development model
ugcnetsep2013ii is&software-engineering software-development-life-cycle-models

Answer key ☟

28.37 Software Development Models (1)

28.37.1 Software Development Models: UGC NET CSE | June 2010 | Part 2 | Question: 43

Which model is simplest model in Software Development ?

A. Waterfall model B. Prototyping C. Iterative D. None of these

ugcnetcse-june2010-paper2 is&software-engineering software-development-models

Answer key ☟

28.38 Software Intergrity (1)

28.38.1 Software Intergrity: UGC NET CSE | June 2019 | Part 2 | Question: 56

A Web application and its support environment has not been fully fortified against attack. Web engineers
estimate that the likelihood of repelling an attack is only percent. The application does not contain sensitive
or controversial information, so the threat probability is percent. What is the integrity of the web application?

A. B. C. D.
ugcnetcse-june2019-paper2 software-intergrity
 Answer key ☟

28.39 Software Maintenance (2)

28.39.1 Software Maintenance: UGC NET CSE | Junet 2015 | Part 3 | Question: 46

Adaptive maintenance is a maintenance which _____

A. correct errors that were not discovered till testing phase

B. is carried out to port the existing software to a new environment
C. improves the system performance
D. both B and C

ugcnetcse-june2015-paper3 software-maintenance is&software-engineering

Answer key ☟

28.39.2 Software Maintenance: UGC NET CSE | September 2013 | Part 3 | Question: 45

Improving processing efficiency or performance or restructuring of software to improve changeability is known

as

A. Corrective maintenance B. Perfective maintenance

C. Adaptive maintenance D. Code maintenance
ugcnetcse-sep2013-paper3 is&software-engineering software-maintenance

Answer key ☟

28.40 Software Metrics (3)

28.40.1 Software Metrics: UGC NET CSE | December 2014 | Part 2 | Question: 44

Which one of the following set of attributes should not be encompassed by effective software metrics ?

A. Simple and computable B. Consistent and objective

C. Consistent in the use of units and dimensions D. Programming language dependent
ugcnetcse-dec2014-paper2 is&software-engineering software-metrics

Answer key ☟

28.40.2 Software Metrics: UGC NET CSE | July 2016 | Part 3 | Question: 48

The number of function points of a proposed system is calculated as 500. Suppose that the system is planned to
be developed in Java and the LOC/FP ratio of Jave is 50. Estimate teh effort (E) required to complete the project
using the effort formula of basic COCOMO given: E=a(KLOC)
Assume that the values of a and b are 2.5 and 1.0 respectively
A. 25 person months B. 75 person months
C. 62.5 person months D. 72.5 person months
ugcnetcse-july2016-paper3 is&software-engineering software-metrics

Answer key ☟

28.40.3 Software Metrics: UGC NET CSE | June 2012 | Part 3 | Question: 33

Which one of the following statements is incorrect?

A. The number of regions corresponds to the cyclomatic complexity

B. Cyclomatic complexity for a flow graph is , where E is the number of edges and N is the
number of nodes in flow graph.
C. Cyclomatic complexity for a flow graph is , where E is the number of edges and N is the
number of nodes in flow graph.
D. Cyclomatic complexity for a flow graph is , where P is the number of predicate nodes contained in
the flow graph G.
 ugcnetcse-june2012-paper3 is&software-engineering software-metrics

Answer key ☟

28.41 Software Process (1)

28.41.1 Software Process: UGC NET CSE | December 2014 | Part 2 | Question: 41

_________ are applied throughout the software process.

A. Framework activities B. Umbrella activities

C. Planning activities D. Construction activities
ugcnetcse-dec2014-paper2 is&software-engineering software-process

Answer key ☟

28.42 Software Quality Assurance (2)

28.42.1 Software Quality Assurance: UGC NET CSE | August 2016 | Part 3 | Question: 46

The ISO quality assurance standard that applies to software Engineering is

A. ISO 9000 : 2004 B. ISO 9001 : 2000
C. ISO 9002 : 2001 D. ISO 9003 : 2004
ugcnetcse-aug2016-paper3 is&software-engineering software-quality-assurance

Answer key ☟

28.42.2 Software Quality Assurance: UGC NET CSE | December 2012 | Part 3 | Question: 55

The factors that determine the quality of a software system are

A. correctness, reliability
B. efficiency, usability, maintainability
C. testability, portability, accuracy, error tolerances, expandability, access control, audit
D. All of the above

ugcnetcse-dec2012-paper3 is&software-engineering software-quality-assurance

Answer key ☟

28.43 Software Quality Characteristics (1)

28.43.1 Software Quality Characteristics: UGC NET CSE | July 2016 | Part 2 | Question: 45

The extent to which a software tolerates the unexpected problems, is termed as

A. Accuracy B. Reliability C. Correctness D. Robustness

ugcnetcse-july2016-paper2 software-quality-characteristics

Answer key ☟

28.44 Software Reliability (11)

28.44.1 Software Reliability: Computer Science - UGC NET 2021 [ Question ID = 2345 ]

A system has 99.99% uptime and has a mean-time-between-failure of 1 day. How fast does the system have to
repair itself in order to reach this availability goal ?

1. 10 Seconds

2. 11 Seconds

3. 12 Seconds
 4. 9 Seconds

software-design software-reliability software-testing

Answer key ☟

28.44.2 Software Reliability: Computer Science - UGC NET 2021 [ Question ID = 2346 ]

In the context of Software Configuration Management (SCM), what kind of files should be committed to your
source control repository ?
A. Code files B. Documentation files
C. Output files D. Automatically generated files that are required for your
system to be used
Choose the correct answer from the options given below:

1. A and B only

2. B and C only

3. C and D only

4. D and A only

software-design software-reliability non-gatecse

Answer key ☟

28.44.3 Software Reliability: Computer Science - UGC NET 2021 [ Question ID = 2349 ]

Given below are two statements :

Statement I: Cleanroom software process model incorporates the statistical quality certification of code
increments as they accumulate into a system.

Statement II: Cleanroom software engineering follows the classic analysis, design, code, test, and debug cycle to
software development and focussing on defect removal rather than defect prevention.
In light of the above statements, choose the correct answer from the options given below :

1. Both Statement I and Statement II are true.

2. Both Statement I and Statement II are false.

3. Statement I is true but Statement II is false.

4. Statement I is false but Statement II is true.

non-gatecse software-design software-reliability

Answer key ☟

28.44.4 Software Reliability: UGC NET CSE | August 2016 | Part 2 | Question: 45

The extent to which a software performs its intended functions without failures, is termed as

A. Robustness B. Correctness C. Reliability D. Accuracy

ugcnetcse-aug2016-paper2 is&software-engineering software-reliability

Answer key ☟
28.44.5 Software Reliability: UGC NET CSE | December 2011 | Part 2 | Question: 16

Emergency fixes known as patches are result of

A. Adaptive maintenance B. Perfective maintenance
C. Corrective maintenance D. None of the above
ugcnetcse-dec2011-paper2 is&software-engineering software-reliability

Answer key ☟

28.44.6 Software Reliability: UGC NET CSE | December 2014 | Part 3 | Question: 46

Maximum possible value of reliability is

A. B. C. D.
ugcnetcse-dec2014-paper3 is&software-engineering software-reliability

Answer key ☟

28.44.7 Software Reliability: UGC NET CSE | July 2016 | Part 3 | Question: 43

A server crashes on the average once in 30 days, that is, the Mean Time Between Failures (MTBF) is 30 days.
When it happens it takes 12 hours to reboot it, that is, Mean Time To Repair (MTTR) is 12 hours. The
availability of server with these reliability data values is approximately.

A. 96.3 % B. 97.3 % C. 98.3% D. 99.3%

ugcnetcse-july2016-paper3 is&software-engineering software-reliability

Answer key ☟

28.44.8 Software Reliability: UGC NET CSE | June 2013 | Part 3 | Question: 2

Match the following

A. B.
C. D.
ugcnetcse-june2013-paper3 is&software-engineering software-reliability non-gatecse

Answer key ☟

28.44.9 Software Reliability: UGC NET CSE | June 2013 | Part 3 | Question: 6

Software safety is a ______ activity that focuses on the identification and assessment of potential hazards that
may affect software negatively and cause an entire system to fail.
A. Risk mitigation, monitoring and management B. Software quality assurance
C. Software quality assurance D. Defect removal efficiency
ugcnetcse-june2013-paper3 is&software-engineering software-reliability

Answer key ☟

28.44.10 Software Reliability: UGC NET CSE | June 2014 | Part 3 | Question: 17

Assume that a program will experience 200 failures in infinite time. It has now experienced 100 failures. The
initial failure intensity was 20 failures/CPU hr. Then the current failure intensity will be

A. 5 failured/CPU hr B. 10 failured/CPU hr
C. 20 failured/CPU hr D. 40 failured/CPU hr
ugcnetjune2014iii is&software-engineering software-reliability
 Answer key ☟

28.44.11 Software Reliability: UGC NET CSE | September 2013 | Part 3 | Question: 44

The failure intensity for a basic model as a function of failures experienced is given as
where is the initial failure intensity at the start of the execution, is the average or expected number of
failures at a given point in time, the quantity is the total number of failures that would occur in infinite time.
Assume that a program will experience 100 failures in infinite time, the initial failure intensity was 10 failures/CPU hr.
Then the decrement of failures intensity per failure will be

A. 10 per CPU hr B. 0.1 per CPU hr

C. -0.1 per CPU hr D. 90 per CPU hr
ugcnetcse-sep2013-paper3 is&software-engineering software-reliability

Answer key ☟

28.45 Software Requirement Specification (1)

28.45.1 Software Requirement Specification: UGC NET CSE | September 2013 | Part 2 | Question: 31

Consider the following characteristics:

I. Correct and unambiguous

II. Complete and consistent
III. Ranked for importance and/or stability and verifiable
IV. Modifiable and Traceable

Which of the following is true for a good SRS?

A. I, II and III B. I, III and IV C. II, III and IV D. I, II, III and IV
ugcnetsep2013ii is&software-engineering software-requirement-specification

Answer key ☟

28.46 Software Requirement Specifications (1)

28.46.1 Software Requirement Specifications: UGC NET CSE | August 2016 | Part 2 | Question: 41

Which of the following is used to determine the specificity of requirements ?

A. B. C. D.
Where is the number of requirements for which all reviewers have identical interpretations, is number of
requirements in a specification.

ugcnetcse-aug2016-paper2 is&software-engineering software-requirement-specifications

Answer key ☟

28.47 Software Reuse (1)

28.47.1 Software Reuse: UGC NET CSE | June 2019 | Part 2 | Question: 54

Software reuse is

A. the process of analysing software with the objective of recovering its design and specification
B. the process of using existing software artifacts and knowledge to build new software
C. concerned with reimplementing legacy system to make them more maintainable
D. the process of analysing software to create a representation of a higher level of abstraction and breaking software
down into its parts to see how it works

ugcnetcse-june2019-paper2 software-reuse

Answer key ☟
28.48 Software Testing (22)

28.48.1 Software Testing: Computer Science - UGC NET 2021 [ Question ID = 2341 ]

In software testing, beta testing is the testing performed by _______________.

A. potential customers at the developer's location.

B. potential customers at their own locations.
C. product developers at the customer's location.
D. product developers at their own locations.

software-testing

Answer key ☟

28.48.2 Software Testing: Computer Science - UGC NET 2021 [ Question ID = 2343 ]

In software engineering, what kind of notation do formal methods predominantly use ?

1. Textual

2. Diagrammatic

3. Mathematical

4. Computer code

software-testing

Answer key ☟

28.48.3 Software Testing: UGC NET CSE | August 2016 | Part 2 | Question: 44

For a program of variables, boundary value analysis yields ______ test cases.

A. B. C. D.
ugcnetcse-aug2016-paper2 is&software-engineering software-testing

Answer key ☟

28.48.4 Software Testing: UGC NET CSE | December 2008 | Part 2 | Question: 43

Software Quality Assurance ( ) encompasses :

A. verification
B. validation
C. both verification and validation
D. none of the above

ugcnetcse-dec2008-paper2 is&software-engineering software-testing

Answer key ☟

28.48.5 Software Testing: UGC NET CSE | December 2009 | Part 2 | Question: 42

Any error whose cause cannot be identified anywhere within the software system is called ________

(A) Internal error

(B) External error

 (C) Inherent error

(D) Logic error

ugcnetcse-dec2009-paper2 is&software-engineering software-testing

Answer key ☟

28.48.6 Software Testing: UGC NET CSE | December 2009 | Part 2 | Question: 47

Black Box testing is done

(A) to show that s/w is operational at its interfaces i.e. input and output.
(B) to examine internal details of code.
(C) at client side.
(D) none of above.
ugcnetcse-dec2009-paper2 is&software-engineering software-testing

Answer key ☟

28.48.7 Software Testing: UGC NET CSE | December 2010 | Part 2 | Question: 15

“Black” refers in the “Black-box” testing means

A. Characters of the movie “Black” B. I – O is hidden
C. Design is hidden D. Users are hidden
ugcnetcse-dec2010-paper2 is&software-engineering software-testing

Answer key ☟

28.48.8 Software Testing: UGC NET CSE | December 2010 | Part 2 | Question: 41

Prototyping is used to

A. Test the software as an end product B. Expand design details

C. Refine and establish requirements gathering D. None of the above
ugcnetcse-dec2010-paper2 is&software-engineering software-testing

Answer key ☟

28.48.9 Software Testing: UGC NET CSE | December 2011 | Part 2 | Question: 18

Following is used to demonstrate that the new release of software still performs the old one did by rerunning the
old tests :
A. Functional testing B. Path testing
C. Stress testing D. Regression testing
ugcnetcse-dec2011-paper2 is&software-engineering software-testing

Answer key ☟

28.48.10 Software Testing: UGC NET CSE | December 2012 | Part 2 | Question: 31

Basis path testing falls under

A. system testing B. white box testing

C. black box testing D. unit testing
ugcnetcse-dec2012-paper2 is&software-engineering software-testing

Answer key ☟

28.48.11 Software Testing: UGC NET CSE | December 2013 | Part 3 | Question: 8

One weakness of boundary value analysis and equivalence partitioning is

A. they are not effective B. they do not explore combinations of input circumstances
C. they explore combinations of input circumstances D. none of the above
 ugcnetcse-dec2013-paper3 is&software-engineering software-testing

Answer key ☟

28.48.12 Software Testing: UGC NET CSE | December 2015 | Part 2 | Question: 46

In software testing, how the error, fault and failure are related to each other?

A. Error leads to failure but fault is not related to error and failure
B. Fault leads to failure but error is not related to fault and failure
C. Error leads to fault and fault leads to failure
D. Fault leads to error and error leads to failure

ugcnetcse-dec2015-paper2 is&software-engineering software-testing

Answer key ☟

28.48.13 Software Testing: UGC NET CSE | January 2017 | Part 3 | Question: 43

Which of the following statement(s) is/are TRUE with regard to software testing?

I. Regression testing technique ensures that the software product runs correctly after the changes during maintenance.
II. Equivalence partitioning is a white-box testing technique that divides the input domain of a program into classes of
data from which test cases can be derived.

A. only I B. only II
C. both I and II D. neither I nor II
ugcnetcse-jan2017-paper3 is&software-engineering software-testing

Answer key ☟

28.48.14 Software Testing: UGC NET CSE | January 2017 | Part 3 | Question: 44

Which of the following are facts about a top-down software testing approach?

I. Top-down testing typically requires the tester to build method stubs

II. Top-down testing typically requires the tester to build test drivers

A. Only I B. Only II C. Both I and II D. Neither I nor II

ugcnetcse-jan2017-paper3 is&software-engineering software-testing

Answer key ☟

28.48.15 Software Testing: UGC NET CSE | June 2012 | Part 3 | Question: 30

While unit testing a module, it is found that for a set of test data, maximum 90% of the code alone were tested
with a probability of success 0.9. The reliability of the module is
A. at least greater than 0.9 B. equal to 0.9
C. at most 0.81 D. at least 1/0.81
ugcnetcse-june2012-paper3 is&software-engineering software-testing

Answer key ☟

28.48.16 Software Testing: UGC NET CSE | June 2013 | Part 3 | Question: 4

Equivalence partitioning is a ______ method that divides the input domain of a program into classes of data
from which test cases can be derived
A. White-box testing B. Black-box testing
C. Orthogonal array testing D. Stress testing
ugcnetcse-june2013-paper3 is&software-engineering software-testing non-gatecse

Answer key ☟
28.48.17 Software Testing: UGC NET CSE | June 2014 | Part 2 | Question: 15

Regression testing is primarily related to

A. Functional testing B. Development testing
C. Data flow testing D. Maintenance testing
ugcnetcse-june2014-paper2 is&software-engineering software-testing

Answer key ☟

28.48.18 Software Testing: UGC NET CSE | June 2014 | Part 3 | Question: 16

Software testing is

A. the process of establishing that errors are not present

B. the process of establishing confidence that a program does what it is supposed to do
C. the process of executing a program to show that it is working as per specifications
D. the process of executing a program with the intent of finding errors

ugcnetjune2014iii is&software-engineering software-testing

Answer key ☟

28.48.19 Software Testing: UGC NET CSE | Junet 2015 | Part 2 | Question: 42

Which of the testing strategy requirements established during requirements analysis are validated against
developed software?

A. validation testing B. integration testing

C. regression testing D. system testing
ugcnetcse-june2015-paper2 software-testing is&software-engineering

Answer key ☟

28.48.20 Software Testing: UGC NET CSE | September 2013 | Part 2 | Question: 30

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

A. White box B. Black box C. Regression D. Smoke

ugcnetsep2013ii is&software-engineering software-testing

Answer key ☟

28.48.21 Software Testing: UGC NET CSE | September 2013 | Part 3 | Question: 29

____ refers to the discrepancy among a computed, observed or measured value and the true specified or
theoretically correct values?

A. Fault B. Failure C. Defect D. Error

ugcnetcse-sep2013-paper3 is&software-engineering software-testing

Answer key ☟

28.48.22 Software Testing: UGC NET CSE | September 2013 | Part 3 | Question: 43

Equivalence class partitioning approach is used to divide the input domain into a set of equivalence classes, so
that if a program works correctly for all the other values in that class. This is used _____

A. to partition the program in the form of classes

B. to reduce the number of test cases required
C. for designing the test cases in the white box testing
D. all of the above
 ugcnetcse-sep2013-paper3 is&software-engineering software-testing

Answer key ☟

28.49 Software Validation (1)

28.49.1 Software Validation: UGC NET CSE | December 2012 | Part 3 | Question: 65

_____ establishes information about when,why and by whom changes are made in a Software.
A. Software Configuration Management B. Change Control
C. Version Control D. An Audit Trail
ugcnetcse-dec2012-paper3 is&software-engineering software-validation

Answer key ☟

28.50 Source Code Metric (1)

28.50.1 Source Code Metric: UGC NET CSE | December 2014 | Part 3 | Question: 43

Which one of the following is not a source code metric ?

A. Halstead metric B. Function point metric

C. Complexity metric D. Length metric
ugcnetcse-dec2014-paper3 is&software-engineering source-code-metric

Answer key ☟

28.51 Uml (1)

28.51.1 Uml: UGC NET CSE | June 2013 | Part 3 | Question: 26

An actor in an animation is a small program invoked _____ per frame to determine the characteristics of some
object in the animation.

A. once B. twice C. 30 times D. 60 times

ugcnetcse-june2013-paper3 is&software-engineering uml

Answer key ☟

28.52 Validation (1)

28.52.1 Validation: UGC NET CSE | June 2019 | Part 2 | Question: 60

Software validation mainly checks for inconsistencies between

A. use cases and user requirements B. implementation and system design blueprints
C. detailed specifications and user requirements D. functional specifications and use cases
ugcnetcse-june2019-paper2 validation

Answer key ☟

28.53 Waterfall Model (2)

28.53.1 Waterfall Model: UGC NET CSE | August 2016 | Part 2 | Question: 42

The major shortcoming of waterfall model is

A. The difficulty in accommodating changes after requirement analysis.

B. The difficult in accommodating changes after feasibility analysis.
C. The system testing.
D. The maintenance of system.

ugcnetcse-aug2016-paper2 is&software-engineering waterfall-model

 Answer key ☟

28.53.2 Waterfall Model: UGC NET CSE | July 2016 | Part 2 | Question: 43

Which of the following is not included in the waterfall model?

A. Requirement analysis B. Risk analysis

C. Design D. Coding
ugcnetcse-july2016-paper2 waterfall-model

Answer key ☟

28.54 White Box Testing (1)

28.54.1 White Box Testing: UGC NET CSE | June 2019 | Part 2 | Question: 53

In the context of software testing, which of the following statements is/are NOT correct?
P: A minimal test set that achieves path coverage will also achieve statement coverage.
Q: A minimal test set that achieves path coverage will generally detect more faults than one that achieves
statement coverage.
R: A minimal test set that achieves statement coverage will generally detect more faults than one that achieves
branch coverage.

A. R only B. Q only C. P and Q only D. Q and R only

ugcnetcse-june2019-paper2 white-box-testing statement-coverage-branch-coverage-path-coverage

Answer key ☟

Answer Keys
28.0.1 Q-Q 28.0.2 Q-Q 28.0.3 Q-Q 28.0.4 Q-Q 28.0.5 Q-Q
28.0.6 Q-Q 28.0.7 Q-Q 28.0.8 Q-Q 28.0.9 Q-Q 28.0.10 Q-Q
28.0.11 Q-Q 28.0.12 Q-Q 28.0.13 Q-Q 28.0.14 Q-Q 28.0.15 Q-Q
28.0.16 Q-Q 28.0.17 Q-Q 28.0.18 Q-Q 28.0.19 Q-Q 28.0.20 Q-Q
28.0.21 Q-Q 28.1.1 B 28.2.1 C 28.2.2 B 28.3.1 B
28.4.1 C 28.5.1 C 28.5.2 B 28.5.3 C 28.6.1 Q-Q
28.7.1 Q-Q 28.7.2 Q-Q 28.7.3 B 28.8.1 B 28.9.1 D
28.9.2 C 28.10.1 Q-Q 28.10.2 A 28.11.1 B 28.11.2 Q-Q
28.11.3 B 28.12.1 B 28.13.1 D 28.13.2 A 28.14.1 C
28.14.2 C 28.15.1 B 28.16.1 A 28.17.1 Q-Q 28.18.1 B
28.18.2 C 28.19.1 C 28.20.1 B 28.21.1 Q-Q 28.21.2 Q-Q
28.21.3 Q-Q 28.21.4 Q-Q 28.21.5 Q-Q 28.21.6 A 28.21.7 C
28.21.8 B 28.21.9 C 28.21.10 D 28.21.11 C 28.21.12 D
28.21.13 D 28.21.14 A 28.21.15 A 28.21.16 C 28.21.17 D
28.21.18 B 28.21.19 B 28.21.20 B 28.21.21 D 28.21.22 D
28.21.23 B 28.21.24 B 28.21.25 N/A 28.21.26 Q-Q 28.21.27 Q-Q
28.21.28 Q-Q 28.21.29 Q-Q 28.21.30 Q-Q 28.21.31 Q-Q 28.21.32 N/A
28.21.33 Q-Q 28.21.34 D 28.21.35 C 28.21.36 B 28.21.37 C
28.21.38 B 28.21.39 B 28.21.40 B 28.21.41 B 28.21.42 B
28.21.43 A 28.21.44 C 28.21.45 B 28.21.46 A 28.21.47 C
28.21.48 B 28.21.49 B 28.21.50 B 28.21.51 B 28.21.52 C
28.21.53 C 28.21.54 B 28.21.55 C 28.21.56 C 28.21.57 A
28.21.58 B 28.21.59 C 28.21.60 D 28.21.61 A 28.21.62 C
28.22.1 A 28.23.1 B 28.24.1 C 28.25.1 A 28.26.1 B
28.27.1 C 28.28.1 D 28.29.1 B 28.29.2 D 28.29.3 B
28.30.1 D 28.31.1 B 28.32.1 B 28.33.1 D 28.34.1 Q-Q
28.34.2 Q-Q 28.34.3 Q-Q 28.34.4 Q-Q 28.34.5 Q-Q 28.34.6 Q-Q
28.34.7 B 28.34.8 C 28.34.9 Q-Q 28.34.10 Q-Q 28.34.11 Q-Q
28.34.12 A 28.34.13 X 28.34.14 C 28.34.15 B 28.34.16 C
28.34.17 D 28.34.18 A 28.35.1 Q-Q 28.35.2 Q-Q 28.35.3 C
28.36.1 Q-Q 28.36.2 Q-Q 28.36.3 Q-Q 28.36.4 Q-Q 28.36.5 Q-Q
28.36.6 C 28.36.7 D 28.36.8 D 28.36.9 C 28.36.10 D
28.36.11 A 28.37.1 Q-Q 28.38.1 D 28.39.1 B 28.39.2 B
28.40.1 D 28.40.2 C 28.40.3 B 28.41.1 B 28.42.1 Q-Q
28.42.2 D 28.43.1 D 28.44.1 Q-Q 28.44.2 Q-Q 28.44.3 Q-Q
28.44.4 Q-Q 28.44.5 Q-Q 28.44.6 C 28.44.7 C 28.44.8 D
28.44.9 B 28.44.10 B 28.44.11 C 28.45.1 D 28.46.1 Q-Q
28.47.1 B 28.48.1 Q-Q 28.48.2 Q-Q 28.48.3 Q-Q 28.48.4 Q-Q
28.48.5 B 28.48.6 Q-Q 28.48.7 Q-Q 28.48.8 Q-Q 28.48.9 Q-Q
28.48.10 B 28.48.11 B 28.48.12 C 28.48.13 A 28.48.14 A
28.48.15 C 28.48.16 B 28.48.17 D 28.48.18 D 28.48.19 A
28.48.20 B 28.48.21 D 28.48.22 B 28.49.1 D 28.50.1 B
28.51.1 A 28.52.1 C 28.53.1 Q-Q 28.53.2 B 28.54.1 A
29 Non GATE CSE: Java (10)

29.1 Abstract Method (1)

29.1.1 Abstract Method: UGC NET CSE | August 2016 | Part 3 | Question: 40

Which of the following is not a correct statement ?

A. Every class containing abstract method must be declared abstract.

B. Abstract class can directly be initiated with ‘new’ operator.
C. Abstract class can be initiated.
D. Abstract class does not contain any definition of implementation.

ugcnetcse-aug2016-paper3 java abstract-method

Answer key ☟

29.2 Applet (1)

29.2.1 Applet: UGC NET CSE | December 2014 | Part 3 | Question: 42

Which method is called first by an applet program ?

A. start( ) B. run( ) C. init( ) D. begin( )

ugcnetcse-dec2014-paper3 java applet

Answer key ☟

29.3 Java (3)

29.3.1 Java: UGC NET CSE | August 2016 | Part 3 | Question: 42

Java uses threads to enable the entire environment to be ______.

A. Symmetric B. Asymmetric C. Synchronous D. Asynchronous

ugcnetcse-aug2016-paper3 java threads

Answer key ☟

29.3.2 Java: UGC NET CSE | July 2018 | Part 2 | Question: 3

What is the output of the following JAVA program?

class simple
{
public static void main(String[ ] args)
{
simple obj = new simple();
obj.start();
}
void start()
{
long [] P = {3, 4, 5};
long [] Q = method (P);
System.out.print (P[0] + P[1] +P[2]+”:”);
System.out.print (Q[0] + Q[1] + Q[2]);
}
long [ ] method (long [ ] R)
{
R[1] = 7;
return R;
}
} //end of class

A. 12:15 B. 15:12 C. 12:12 D. 15:15

 ugcnetcse-july2018-paper2 java

Answer key ☟

29.3.3 Java: UGC NET CSE | June 2019 | Part 2 | Question: 23

What is the output of the following JAVA program?

public class Good {
private int m;
public Good (int m){this.m=m;}
public Boolean equals (Good n) {return n.m==m;}
public static void main (string args[]){
Good m1 = new Good(22);
Good m2 = new Good(22);
Object s1 = new Good(22);
Object s2 = new Good(22);
System.out.println(m1.equals(m2));
System.out.println(s1.equals(s2));
System.out.println(m1.equals(s2));
System.out.println(s1.equals(m2));
}
}

A. True, True, False, False B. True, False, True, False

C. True, True, False, True D. True, False, False, False
ugcnetcse-june2019-paper2 java

Answer key ☟

29.4 Method Overriding (1)

29.4.1 Method Overriding: UGC NET CSE | August 2016 | Part 3 | Question: 38

Method over-riding can be prevented by using final as a modifier at ______.

A. The start of the class. B. The start of method declaration.
C. The start of derived class. D. The start of the method declaration in the derived class.
ugcnetcse-aug2016-paper3 java method-overriding

Answer key ☟

29.5 Multi Threaded Programming (1)

29.5.1 Multi Threaded Programming: UGC NET CSE | December 2014 | Part 3 | Question: 37

Which methods are utilized to control the access to an object in multi-threaded programming ?
A. Asynchronized methods B. Synchronized methods
C. Serialized methods D. None of the above
ugcnetcse-dec2014-paper3 java multi-threaded-programming

Answer key ☟

29.6 Oops (1)

29.6.1 Oops: UGC NET CSE | July 2016 | Part 3 | Question: 40

Which of the following statements is correct?

A. Every class containing abstract method must not be declared abstract

B. Abstract class cannot be directly initiated with new operator
C. Abstract class cannot be initiated
D. Abstract class contains definition of implementations

ugcnetcse-july2016-paper3 oops java

Answer key ☟
29.7 Servlet (1)

29.7.1 Servlet: UGC NET CSE | June 2014 | Part 3 | Question: 52

Match the following interfaces of Java. Servlet package

A. B.
C. D.
ugcnetjune2014iii java servlet

Answer key ☟

29.8 Wrapper Class Object (1)

29.8.1 Wrapper Class Object: UGC NET CSE | December 2014 | Part 3 | Question: 39

Converting a primitive type data into its corresponding wrapper class object instance is called

A. Boxing B. Wrapping C. Instantiation D. Autoboxing

ugcnetcse-dec2014-paper3 java wrapper-class-object

Answer key ☟

Answer Keys
29.1.1 Q-Q 29.2.1 C 29.3.1 Q-Q 29.3.2 Q-Q 29.3.3 X
29.4.1 Q-Q 29.5.1 B 29.6.1 B;C 29.7.1 D 29.8.1 D
30 Non GATE CSE: Numerical Methods (3)

30.1 Hungarian Method (1)

30.1.1 Hungarian Method: UGC NET CSE | December 2014 | Part 3 | Question: 69

Five men are available to do five different jobs. From past records, the time (in hours) that each man takes to do
each job is known and is given in the following table :

Find out the minimum time required to complete all the jobs.

A. B. C. D.
ugcnetcse-dec2014-paper3 assignment-problem hungarian-method

Answer key ☟

30.2 Operation Research Pert Cpm (1)

30.2.1 Operation Research Pert Cpm: UGC NET CSE | December 2018 | Part 2 | Question: 8

In PERT/CPM, the merge event represents _____ of two or more events.

A. completion B. beginning C. splitting D. joining

ugcnetcse-dec2018-paper2 operation-research-pert-cpm

Answer key ☟

30.3 Simplex Method (1)

30.3.1 Simplex Method: UGC NET CSE | June 2019 | Part 2 | Question: 10

Consider an LPP given as

subject to the constraints

What shall be the solution of the LLP after applying first iteration of the Simplex Method?

A. B.
C. D.
ugcnetcse-june2019-paper2 simplex-method

Answer key ☟

Answer Keys
30.1.1 C 30.2.1 Q-Q 30.3.1 B
31 Non GATE CSE: Object Oriented Programming (59)

31.0.1 UGC NET CSE | December 2012 | Part 2 | Question: 39

Match the following with respect to data types :

A. B.
C. D.
ugcnetcse-dec2012-paper2 match-the-following

Answer key ☟

31.0.2 UGC NET CSE | December 2004 | Part 2 | Question: 15

Polymorphism means :

A. A template function B. Runtime type identification within a class hierarchy

C. Another name for operator overloading D. Virtual inheritance
ugcnetcse-dec2004-paper2

Answer key ☟

31.0.3 UGC NET CSE | December 2007 | Part 2 | Question: 15

Which of the following is true of constructor function in C++ ?

A. A class must have at least one constructor.

B. A constructor is a unique function which cannot be overloaded.
C. A constructor function must be invoked with the object name.
D. A constructor function is automatically invoked when an object is created.

ugcnetcse-dec2007-paper2

Answer key ☟

31.0.4 UGC NET CSE | December 2007 | Part 2 | Question: 14

Which of the following is not true in C++ ?

A. “Private” elements of a base class are not accessible by members of its derived class.
B. “Protected” elements of base class are not accessible by members of its derived class.
C. When base class access specified is “Public”, public elements of the base class become public members of its
derived class.
D. When base class access specified is “Public”, protected elements of a base class become protected members of its
derived class.

ugcnetcse-dec2007-paper2

Answer key ☟

31.1 Abstract Class (2)

 31.1.1 Abstract Class: UGC NET CSE | December 2015 | Part 3 | Question: 29

Which of the following is used to make an Abstract class?

A. Making at least one member function as pure virtual function

B. Making at least one member function as virtual function
C. Declaring as Abstract class using virtual keyword
D. Declaring as Abstract class using static keyword

ugcnetcse-dec2015-paper3 object-oriented-programming abstract-class

Answer key ☟

31.1.2 Abstract Class: UGC NET CSE | December 2015 | Part 3 | Question: 36

Which of the following is/are correct with reference to Abstract class and interface?

i. A class can inherit only one Abstract class but may inherit several interfaces
ii. An abstract class can provide complete and default code but an interface has no code
A. i is true B. ii is true
C. Both i and ii are true D. Neitehr i nor ii are true
ugcnetcse-dec2015-paper3 object-oriented-programming abstract-class

Answer key ☟

31.2 C++ (2)

31.2.1 C++: UGC NET CSE | August 2016 | Part 2 | Question: 15

A function template in C++ provides _____ level of generalization.

A. B. C. D.
ugcnetcse-aug2016-paper2 object-oriented-programming c++ function

Answer key ☟

31.2.2 C++: UGC NET CSE | December 2014 | Part 2 | Question: 13

Which of the following is not a member of class ?

A. Static function B. Friend function
C. Const function D. Virtual function
ugcnetcse-dec2014-paper2 object-oriented-programming c++

Answer key ☟

31.3 Composition (1)

31.3.1 Composition: UGC NET CSE | August 2016 | Part 3 | Question: 39

Which of the following is a correct statement ?

A. Composition is a strong type of association between two classes with full ownership.
B. Composition is a strong type of association between two classes with partial ownership.
C. Composition is a weak type of association between two classes with partial ownership.
D. Composition is a weak type of association between two classes with strong ownership.

ugcnetcse-aug2016-paper3 object-oriented-programming composition

Answer key ☟

31.4 Constructor (3)

 31.4.1 Constructor: UGC NET CSE | August 2016 | Part 3 | Question: 37

Constructors have _____ return type.

A. void B. char C. int D. no

ugcnetcse-aug2016-paper3 object-oriented-programming constructor

Answer key ☟

31.4.2 Constructor: UGC NET CSE | December 2008 | Part 2 | Question: 27

A copy constructor is invoked when :

A. a function returns by value

B. an argument is passed by value
C. a function returns by reference
D. none of the above

ugcnetcse-dec2008-paper2 object-oriented-programming constructor

Answer key ☟

31.4.3 Constructor: UGC NET CSE | December 2008 | Part 2 | Question: 29

How many constructors can a class have ?

A. zero
B. 1
C. 2
D. any number

ugcnetcse-dec2008-paper2 object-oriented-programming constructor

Answer key ☟

31.5 Final (1)

31.5.1 Final: UGC NET CSE | July 2018 | Part 2 | Question: 6

In Java, which of the following statements is/are TRUE?

S1: The ‘final’ keyword applied to a class definition prevents the class form being extended through derivation
S2: A class can only inherit one class but can implement multiple interfaces
S3: Java permits a class to replace the implementation of a method that it has inherited. It is called method overloading
Code:

A. S1 and S2 only B. S1 and S3 only C. S2 and S3 only D. All of S1, S2 and S3

ugcnetcse-july2018-paper2 object-oriented-programming java final

Answer key ☟

31.6 Friend Class (1)

31.6.1 Friend Class: UGC NET CSE | July 2016 | Part 2 | Question: 13

Which one of the following is correct, when a class grants friend status to another class?

A. The member functions of the class generating friendship can access teh members of the friend class
B. All member functions of the class granted friendship have unrestricted access to the members of the class granting
the friendship
C. Class friendship is reciprocal to each other
D. There is no such concept
 ugcnetcse-july2016-paper2 object-oriented-programming friend-class

Answer key ☟

31.7 Friend Function (2)

31.7.1 Friend Function: UGC NET CSE | August 2016 | Part 2 | Question: 13

If a function is friend of a class, which one of the following is wrong ?

A. A function can only be declared a friend by a class itself.

B. Friend functions are not members of a class, they are associated with it.
C. Friend functions are members of a class.
D. It can have access to all members of the class, even private ones.

ugcnetcse-aug2016-paper2 object-oriented-programming friend-function c++

Answer key ☟

31.7.2 Friend Function: UGC NET CSE | June 2014 | Part 2 | Question: 44

A friend function can be used to

A. Avoid arguments between classes.

B. Allow access to classes whose source code is unavailable.
C. Allow one class to access an unrelated class.
D. None of the above

ugcnetcse-june2014-paper2 object-oriented-programming friend-function

Answer key ☟

31.8 Inheritance (3)

31.8.1 Inheritance: UGC NET CSE | December 2013 | Part 2 | Question: 19

_____ allows to create classes which are derived from other classes, so that they automatically include some of
its "parent's" members, plus its own members.

A. Overloading B. Inheritance C. Polymorphism D. Encapsulation

ugcnetcse-dec2013-paper2 inheritance

Answer key ☟

31.8.2 Inheritance: UGC NET CSE | Junet 2015 | Part 2 | Question: 12

Which of the following, in C++, is inherited in a derived class from base class?

A. constructor B. destructor C. data members D. virtual methods

ugcnetcse-june2015-paper2 oops inheritance

Answer key ☟

31.8.3 Inheritance: UGC NET CSE | Junet 2015 | Part 2 | Question: 15

When the inheritance is private, the private methods in base class are _____ in the derived class (in C++)

A. inaccessible B. accessible C. protected D. public

ugcnetcse-june2015-paper2 oops inheritance

Answer key ☟
31.9 Java (10)

31.9.1 Java: UGC NET CSE | December 2012 | Part 3 | Question: 69

Which is the method used to retrieve the current state of a check box?
A. get State ( ) B. put State ( )
C. retrieve State ( ) D. write State ( )
ugcnetcse-dec2012-paper3 object-oriented-programming java

Answer key ☟

31.9.2 Java: UGC NET CSE | January 2017 | Part 3 | Question: 38

Given the array of integers ‘array’ shown below:

13 7 27 2 18 33 9 11 22 8
What is the output of the following JAVA statements?
int[] p = new int [10];
int[] q = new int [10];
for (int k=0; k< 10; k++)
p[k]=array [k];
q=p;
p[4]=20;
System.out.println(array[4]+":"+q[4]);

A. 20:20 B. 18:18 C. 18:20 D. 20:18

ugcnetcse-jan2017-paper3 object-oriented-programming java

Answer key ☟

31.9.3 Java: UGC NET CSE | January 2017 | Part 3 | Question: 39

Consider the following JAVA program:

public class First {
public static int CBSE (int x) {
if (x < 100)x = CBSE (x+10);
return (x-1);
}
public static void main(String[]args){
System.out.print(First.CBSE(60));
}
}

What does this program print?

A. B.
C. D.
ugcnetcse-jan2017-paper3 object-oriented-programming java

Answer key ☟

31.9.4 Java: UGC NET CSE | January 2017 | Part 3 | Question: 40

Which of the following statement(s) with regard to an abstract class in JAVA is /are TRUE ?

I. An abstract class is one that is not used to create objects

II. An abstract class is designed only to act as a base class to be inherited by other classes

A. Only I B. only II
C. Neither I nor II D. Both I and II
ugcnetcse-jan2017-paper3 object-oriented-programming java

Answer key ☟
31.9.5 Java: UGC NET CSE | July 2016 | Part 3 | Question: 38

It is possible to define a class within a class termed as nested class. There are __ types of nested classes

A. 2 B. 3 C. 4 D. 5
ugcnetcse-july2016-paper3 object-oriented-programming java

Answer key ☟

31.9.6 Java: UGC NET CSE | July 2016 | Part 3 | Question: 42

When one object reference variable is assigned to another object reference variable then

A. a copy of the object is created

B. a copy of the reference is created
C. a copy of the reference is not created
D. It is illegal to assign one object reference variable to another object reference variable

ugcnetcse-july2016-paper3 object-oriented-programming java

Answer key ☟

31.9.7 Java: UGC NET CSE | June 2012 | Part 3 | Question: 70, UGCNET-Sep2013-III: 52

Assume that we have constructor functions for both base class and derived class. Now consider the declaration
in
main()
Base *P=New Derived;
In what sequence will the constructor be called?

A. Derived class constructor followed by Base class constructor

B. Base class constructor followed by Derived class constructor
C. Base class constructor will not be called
D. Derived class constructor will not be called

ugcnetcse-june2012-paper3 ugcnetcse-sep2013-paper3 object-oriented-programming java programming-in-c

Answer key ☟

31.9.8 Java: UGC NET CSE | Junet 2015 | Part 3 | Question: 37

In Java, when we implement an interface method, it must be declared as

A. Private B. Protected C. Public D. Friend

ugcnetcse-june2015-paper3 object-oriented-programming java

Answer key ☟

31.9.9 Java: UGC NET CSE | Junet 2015 | Part 3 | Question: 38

The Servlet Response interface enables a servlet to formulate a response for a client using the method
A. void log(Exception e, String s) B. void destroy()
C. int get ServerPort() D. void set ContextType(String Type)
ugcnetcse-june2015-paper3 object-oriented-programming java

Answer key ☟

31.9.10 Java: UGC NET CSE | Junet 2015 | Part 3 | Question: 39

Which one of the following is correct?

A. Java applets cannot be written in any programming language

 B. An applet is not a small program
C. An applet can be run on its own
D. Applets are embedded in another applications

ugcnetcse-june2015-paper3 object-oriented-programming java

Answer key ☟

31.10 Object Oriented Programming (25)

31.10.1 Object Oriented Programming: UGC NET CSE | December 2008 | Part 2 | Question: 28

When a language has the capability to produce new data types, it is said to be :

A. extensible
B. encapsulated
C. overloaded
D. none of the above

ugcnetcse-dec2008-paper2 object-oriented-programming

31.10.2 Object Oriented Programming: UGC NET CSE | December 2012 | Part 3 | Question: 48

Functions defined with class name are called as

A. Inline Function B. Friend Function
C. Constructor D. Static Function
ugcnetcse-dec2012-paper3 object-oriented-programming non-gatecse

Answer key ☟

31.10.3 Object Oriented Programming: UGC NET CSE | December 2013 | Part 3 | Question: 10

Match the following with respect to relationship objects and classes

A. B.
C. D.
ugcnetcse-dec2013-paper3 object-oriented-programming

Answer key ☟

31.10.4 Object Oriented Programming: UGC NET CSE | December 2013 | Part 3 | Question: 11

Match the following style rules for reusability

 A. B.
C. D.
ugcnetcse-dec2013-paper3 object-oriented-programming

Answer key ☟

31.10.5 Object Oriented Programming: UGC NET CSE | December 2013 | Part 3 | Question: 18

C++ actually supports the following two complete dynamic systems:

A. One defined by C++ and the other not defined by C B. One defined by C and one specific to C++
C. Both are specific to C++ D. Both of them are improvements of C
ugcnetcse-dec2013-paper3 object-oriented-programming

Answer key ☟

31.10.6 Object Oriented Programming: UGC NET CSE | December 2013 | Part 3 | Question: 19

Important advantage of using new and delete operators in C++ is

A. Allocation of memory B. Frees the memory previously allocated

C. Initialization of memory easily D. Allocation of memory and frees the memory previously
allocated
ugcnetcse-dec2013-paper3 object-oriented-programming

Answer key ☟

31.10.7 Object Oriented Programming: UGC NET CSE | December 2014 | Part 2 | Question: 15

Which of the following differentiates between overloaded functions and overridden functions ?

A. Overloading is a dynamic or runtime binding and overridden is a static or compile time binding.
B. Overloading is a static or compile time binding and overriding is dynamic or runtime binding.
C. Redefining a function in a friend class is called overloading, while redefining a function in a derived class is called
as overridden function.
D. Redefining a function in a derived class is called function overloading, while redefining a function in a friend class
is called function overriding.

ugcnetcse-dec2014-paper2 object-oriented-programming

Answer key ☟

31.10.8 Object Oriented Programming: UGC NET CSE | December 2015 | Part 2 | Question: 12

Consider the following two statements:

a. A publicly derived class is a subtype of its base class b. Inheritance provides for code resuse
Which of the following statements is correct?
A. Both statements a and b are correct B. Neither of the statements a and b are correct
C. Statement a is correct and b is incorrect D. Statement a is incorrect and b is correct
ugcnetcse-dec2015-paper2 object-oriented-programming
 Answer key ☟

31.10.9 Object Oriented Programming: UGC NET CSE | December 2015 | Part 3 | Question: 30

Match the following with reference to object oriented modelling :

A. B.
C. D.
ugcnetcse-dec2015-paper3 object-oriented-programming

Answer key ☟

31.10.10 Object Oriented Programming: UGC NET CSE | January 2017 | Part 2 | Question: 11

Which of the following cannot be passed to a function in C++?

A. Constant B. Structure C. Array D. Header file

ugcnetjan2017ii object-oriented-programming functions

Answer key ☟

31.10.11 Object Oriented Programming: UGC NET CSE | January 2017 | Part 2 | Question: 12

Which one of the following is correct for overloaded functions in ?

A. Compiler sets up a separate function for every definition of function.

B. Compiler does not set up a separate function for every definition of function.
C. Overloaded functions cannot handle different types of objects.
D. Overloaded functions cannot have same number of arguments.

ugcnetjan2017ii object-oriented-programming functions

Answer key ☟

31.10.12 Object Oriented Programming: UGC NET CSE | January 2017 | Part 2 | Question: 14

Which of the following operators cannot be overloaded in ?

A. Bitwise right shift assignment B. Address of

C. Indirection D. Structure reference
ugcnetjan2017ii object-oriented-programming

Answer key ☟

31.10.13 Object Oriented Programming: UGC NET CSE | January 2017 | Part 3 | Question: 37

Abstraction and encapsulation are fundamental principles that underlie the object oriented approach to software
development. What can you say about the following two statements?

I. Abstraction allows us to focus on what something does without considering the complexities of how it works.
II. Encapsulation allows us to consider complex ideas while ignoring irrelevant detail that would confuse us.
 A. Neither I nor II is correct B. Both I and II are correct
C. Only II is correct D. Only I is correct
ugcnetcse-jan2017-paper3 object-oriented-programming

Answer key ☟

31.10.14 Object Oriented Programming: UGC NET CSE | July 2016 | Part 2 | Question: 14

When a method in subclass has the same name and type signatures as a method in the superclass, then the
method in the subclass ____ the method in the superclass.

A. Overloads B. Friendhips C. Inherits D. Overrides

ugcnetcse-july2016-paper2 object-oriented-programming

Answer key ☟

31.10.15 Object Oriented Programming: UGC NET CSE | July 2016 | Part 3 | Question: 37

Implicit return type of a class constructor is

A. not of class type itself B. class type itself
C. a destructor of class type D. a destructor not of class type
ugcnetcse-july2016-paper3 object-oriented-programming non-gatecse

Answer key ☟

31.10.16 Object Oriented Programming: UGC NET CSE | July 2018 | Part 2 | Question: 5

Given below are three implementations of the function in :

Which of these would actually swap the contents of the two integer variables and ?

A. only B. only C. only D. and only

ugcnetcse-july2018-paper2 object-oriented-programming

Answer key ☟

31.10.17 Object Oriented Programming: UGC NET CSE | June 2005 | Part 2 | Question: 13

The data hiding is taken care by :

A. Abstraction B. Encapsulation C. Modularity D. Inheritance

ugcnetcse-june2005-paper2 object-oriented-programming non-gatecse

Answer key ☟
31.10.18 Object Oriented Programming: UGC NET CSE | June 2010 | Part 2 | Question: 13

Member of a class specified as ______ are accessible only to method of the class.

A. Private B. Public C. Protected D. Derive

ugcnetcse-june2010-paper2 object-oriented-programming

Answer key ☟

31.10.19 Object Oriented Programming: UGC NET CSE | June 2010 | Part 2 | Question: 14

Match the following :

A.
B.
C.
D.

ugcnetcse-june2010-paper2 object-oriented-programming

Answer key ☟

31.10.20 Object Oriented Programming: UGC NET CSE | June 2014 | Part 3 | Question: 12

The control string in consists of three important classifications of characters

A. Escape sequence characters, Format specifiers and Whitespace characters

B. Special characters, White-space characters and Non-white space characters
C. Format specifiers, White-space characters and Non-white space characters
D. Special characters, White-space characters and Format specifiers

ugcnetjune2014iii object-oriented-programming

Answer key ☟

31.10.21 Object Oriented Programming: UGC NET CSE | June 2014 | Part 3 | Question: 13

Match the following with respect to I/O classes in object oriented programming

A. B.
C. D.
ugcnetjune2014iii object-oriented-programming match-the-following

Answer key ☟
 31.10.22 Object Oriented Programming: UGC NET CSE | June 2014 | Part 3 | Question: 49

Superficially the term “objectoriented”, means that, we organize software as a

A. collection of continuous objects that incorporates both data structure and behaviour.
B. collection of discrete objects that incorporates both discrete structure and behaviour.
C. collection of discrete objects that incorporates both data structure and behaviour.
D. collection of objects that incorporates both discrete data structure and behaviour.

ugcnetjune2014iii object-oriented-programming

Answer key ☟

31.10.23 Object Oriented Programming: UGC NET CSE | June 2014 | Part 3 | Question: 50

The "part-whole”or "a-part-of", relationship in which objects representing the components of something
associated with an object representing the entire assembly is called as

A. Association B. Aggregation
C. Encapsulation D. Generalisation
ugcnetjune2014iii object-oriented-programming

31.10.24 Object Oriented Programming: UGC NET CSE | June 2014 | Part 3 | Question: 51

The pure object oriented programming language with extensive metadata available and modifiable at run time is

A. Small talk B. C++ C. Java D. Eiffel

ugcnetjune2014iii object-oriented-programming

Answer key ☟

31.10.25 Object Oriented Programming: UGC NET CSE | October 2020 | Part 2 | Question: 12

Consider the following recursive Java function that takes two long arguments and returns a float value:
public static float f (long m, long n) {
float result = (float)m / (float)n;
if (m < 0 || n<0) return 0.0f;
else result -=f(m*2, n*3);
return result;
}

Which of the following real values best approximates the value of ?

A. B. C. D.
ugcnetcse-oct2020-paper2 non-gatecse object-oriented-programming

31.11 Operator Overloading (1)

31.11.1 Operator Overloading: UGC NET CSE | December 2013 | Part 2 | Question: 18

Which of the following operators cannot be overloaded in C++?

A. * B. += C. == D. : :
ugcnetcse-dec2013-paper2 programming-in-c operator-overloading

Answer key ☟

31.12 Programming In C (1)

31.12.1 Programming In C: UGC NET CSE | June 2019 | Part 2 | Question: 24

Consider the following C++ function f():

unsigned int f(unsigned int n) {
 unsigned int b=0;
while (n) {
b+=n & 1;
n>>1;
}
return b;
}

The function f() returns the int that represents the ____P____ in the binary representation of positive integer n, where P
is

A. number of ’s B. number of bits

C. number of consecutive ’s D. number of ’s
ugcnetcse-june2019-paper2 programming-in-c

Answer key ☟

31.13 Software Design (1)

31.13.1 Software Design: UGC NET CSE | December 2012 | Part 3 | Question: 54

The Object Modelling Technique (OMT) uses the following three kinds of model to describe a system

A. Class Model , Object Model and Analysis Model

B. Object Model, Dynamic Model and Functional Model
C. Class Model, Dynamic Model and Functional Model
D. Object Model, Analysis Model and Dynamic Model

ugcnetcse-dec2012-paper3 software-design object-oriented-programming

Answer key ☟

31.14 Template Vs Macro (1)

31.14.1 Template Vs Macro: UGC NET CSE | Junet 2015 | Part 2 | Question: 14

Which of the following is incorrect in C++?

A. when we write overloaded function we must code the function for each usage
B. when we write function template we code the function only once
C. it is difficult to debug macros
D. templates are more efficient than macros

ugcnetcse-june2015-paper2 oops template-vs-macro

Answer key ☟

31.15 Windows (1)

31.15.1 Windows: UGC NET CSE | June 2014 | Part 3 | Question: 53

The syntax of capturing events method for document object is

A. CaptureEvents() B. CaptureEvents(Orgs eventType)

C. CaptureEvents(eventType) D. CaptureEvents(eventVal)
ugcnetjune2014iii windows object-oriented-programming

Answer key ☟

Answer Keys
31.0.1 A 31.0.2 X 31.0.3 Q-Q 31.0.4 Q-Q 31.1.1 B
31.1.2 C 31.2.1 Q-Q 31.2.2 B 31.3.1 Q-Q 31.4.1 Q-Q
31.4.2 Q-Q 31.4.3 Q-Q 31.5.1 Q-Q 31.6.1 Q-Q 31.7.1 Q-Q

31.7.2 C 31.8.1 B 31.8.2 C 31.8.3 A 31.9.1 A

31.9.2 C 31.9.3 B 31.9.4 D 31.9.5 A 31.9.6 B
31.9.7 B 31.9.8 C 31.9.9 X 31.9.10 D 31.10.1 Q-Q
31.10.2 C 31.10.3 A 31.10.4 A 31.10.5 B 31.10.6 D
31.10.7 B 31.10.8 A 31.10.9 A 31.10.10 D 31.10.11 A
31.10.12 D 31.10.13 A 31.10.14 D 31.10.15 B 31.10.16 Q-Q
31.10.17 Q-Q 31.10.18 Q-Q 31.10.19 Q-Q 31.10.20 C 31.10.21 A
31.10.22 C 31.10.23 B 31.10.24 A 31.10.25 A 31.11.1 D
31.12.1 D 31.13.1 B 31.14.1 X 31.15.1 C
32 Non GATE CSE: Optimization (18)

32.1 Assignment Problem (2)

32.1.1 Assignment Problem: UGC NET CSE | June 2014 | Part 3 | Question: 59

The given maximization assignment problem can be converted into a minimization problem by

A. Subtracting each entry in a column from the maximum value in that column.
B. Subtracting each entry in the table from the maximum value in that table.
C. Adding each entry in a column from the maximum value in that column.
D. Adding maximum value of the table to each entry in the table.

ugcnetjune2014iii optimization assignment-problem

Answer key ☟

32.1.2 Assignment Problem: UGC NET CSE | Junet 2015 | Part 3 | Question: 67

In the Hungarian method for solving assignment problem, an optimal assignment requires that the maximum
number of lines that can be drawn through squares with zero opportunity cost be equal to the number of
A. rows or columns B. rows + columns
C. rows + columns -1 D. rows + columns +1
ugcnetcse-june2015-paper3 assignment-problem optimization

Answer key ☟

32.2 Dual Linear Programming (1)

32.2.1 Dual Linear Programming: UGC NET CSE | December 2012 | Part 3 | Question: 24

If dual has an unbounded solution, then its corresponding primal has

A. no feasible solution B. unbounded solution
C. feasible solution D. none of these
ugcnetcse-dec2012-paper3 optimization dual-linear-programming

Answer key ☟

32.3 Linear Programming (1)

32.3.1 Linear Programming: UGC NET CSE | October 2020 | Part 2 | Question: 4

Consider the following linear programming (LP):

The optimum value of the LP is

A. B. C. D.
ugcnetcse-oct2020-paper2 non-gatecse linear-programming

Answer key ☟

32.4 Linear Programming Problem (1)

32.4.1 Linear Programming Problem: UGC NET CSE | December 2013 | Part 3 | Question: 1

If the primal Linear Programming pro blem has unbounded solution, then it's dual problem will have
 A. feasible solution B. alternative solution
C. no feasible solution at all D. no alternative solution at all
ugcnetcse-dec2013-paper3 optimization linear-programming-problem

Answer key ☟

32.5 Optimization (8)

32.5.1 Optimization: UGC NET CSE | December 2012 | Part 3 | Question: 18

In a Linear Programming Problem, suppose there are three basic variables and 2 non-basic variables, then the
possible number of basic solutions are

A. 6 B. 8 C. 10 D. 12
ugcnetcse-dec2012-paper3 optimization linear-programming

Answer key ☟

32.5.2 Optimization: UGC NET CSE | December 2013 | Part 3 | Question: 2

Given the problem to maximize subject to m number of in equality constraints.

, i=1, 2, .... m including the non-negativity constrains . Which of the following conditions is a
Kuhn-Tucker necessary condition for a local maxima at ?

A.
B.
C.
D. All of these

ugcnetcse-dec2013-paper3 optimization linear-programming

Answer key ☟

32.5.3 Optimization: UGC NET CSE | December 2013 | Part 3 | Question: 3

The following Linear Programming problem has:

Subject to

A. Feasible solution B. No feasible solution

C. Unbounded solution D. Single point as solution
ugcnetcse-dec2013-paper3 optimization linear-programming

Answer key ☟

32.5.4 Optimization: UGC NET CSE | December 2015 | Part 3 | Question: 47

In constraint satisfaction problem, constraints can be stated as

A. Arithmetic equations and inequalities that bind the values of variables

B. Arithmetic equations and inequalities that does not bind any restriction over variables
C. Arithmetic equations that impose restrictions over variables
D. Arithmetic equations that discard constraints over the given variables

ugcnetcse-dec2015-paper3 optimization

Answer key ☟
 32.5.5 Optimization: UGC NET CSE | December 2015 | Part 3 | Question: 52

A basic feasible solution of a linear programming problem is said to be ______ if at least one of the basic
variable is zero

A. generate B. degenerate C. infeasible D. unbounded

ugcnetcse-dec2015-paper3 optimization linear-programming

Answer key ☟

32.5.6 Optimization: UGC NET CSE | June 2012 | Part 3 | Question: 46

The feasible region represented by the constraints of the objective

function Max is
A. A polygon B. Unbounded feasible region
C. A point D. None of these
ugcnetcse-june2012-paper3 optimization linear-programming

Answer key ☟

32.5.7 Optimization: UGC NET CSE | June 2014 | Part 3 | Question: 58

Which of the following special cases does not require reformulation of the problem in order to obtain a solution
?

A. Alternate optimality B. Infeasibility

C. Unboundedness D. All of the above
ugcnetjune2014iii optimization

Answer key ☟

32.5.8 Optimization: UGC NET CSE | Junet 2015 | Part 3 | Question: 69

Given the following statements with respect to linear programming problem:

S1: The dual of the dual linear programming problem is again the primal problem
S2: If either the primal or the dual problem has an unbounded objective function value, the other problem has no feasible
solution
S3: If either the primal or the dual problem has a finite optimal solution, the other one also possess the same, and the
optimal value of the objective functions of the two problems are equal.
Which of the following is true?

A. S1 and S2 B. S1 and S3 C. S2 and S3 D. S1, S2 and S3

ugcnetcse-june2015-paper3 optimization linear-programming

Answer key ☟

32.6 Transportation Problem (5)

32.6.1 Transportation Problem: UGC NET CSE | December 2012 | Part 3 | Question: 28

The initial basic feasible solution to the following transportation problem using Vogel’s approximation method
is

A. , Total cost
B. , Total cost
 C. , Total cost
D. None of the above

ugcnetcse-dec2012-paper3 optimization transportation-problem

Answer key ☟

32.6.2 Transportation Problem: UGC NET CSE | December 2015 | Part 3 | Question: 53

Consider the following conditions:

i. The solution must be feasible, i.e. it must satisfy all the supply and demand constraints
ii. The number of positive allocations must be equal to , where is the number of rows and is the number
of columns
iii. All the positive allocations must be in independent positions

The initial solution of a transportation problem is said to be non-degenerate basic feasible solution if it satisfies:
A. and only B. and only
C. and only D. , and
ugcnetcse-dec2015-paper3 optimization transportation-problem

Answer key ☟

32.6.3 Transportation Problem: UGC NET CSE | December 2015 | Part 3 | Question: 54

Consider the following transportation problem:

Stores
I II III IV Supply
A 4 6 8 13 50
Factories B 13 11 10 8 70
C 14 4 10 13 30
D 9 11 13 8 50
Demand 25 35 105 20

The transportation cost in the initial basic feasible solution of the above transportation problem using Vogel's
Approximation method is

A. B. C. D.
ugcnetcse-dec2015-paper3 optimization transportation-problem

Answer key ☟

32.6.4 Transportation Problem: UGC NET CSE | June 2014 | Part 3 | Question: 60

The initial basic feasible solution of the following transportion problem:

 is given as
5
8
7
2 2 10
then the minimum cost is

A. 76 B. 78 C. 80 D. 82
ugcnetjune2014iii optimization transportation-problem

Answer key ☟

32.6.5 Transportation Problem: UGC NET CSE | Junet 2015 | Part 3 | Question: 68

Consider the following transportation problem:

The initial basic feasible solution of the above transportation problem using Vogel's Approximation method (VAM) is
given below:

The solution of the above problem:

A. is degenerate solution B. is optimum solution
C. needs to improve D. is infeasible solution
ugcnetcse-june2015-paper3 transportation-problem optimization

Answer key ☟

Answer Keys
32.1.1 B 32.1.2 A 32.2.1 A 32.3.1 D 32.4.1 C
32.5.1 C 32.5.2 D 32.5.3 B 32.5.4 A 32.5.5 A
32.5.6 B 32.5.7 A 32.5.8 D 32.6.1 D 32.6.2 A
32.6.3 B 32.6.4 A 32.6.5 B
33 Non GATE CSE: Others (150)

33.0.1 UGC NET CSE | June 2009 | Part 2 | Question: 37

Which of the following changes permission to deny write permission to group and others ?

1. Chmod go-w filex

2. Chmod go w filex
3. Chmod go=w filex
4. None of the above

ugcnetcse-june2009-paper2

33.0.2 UGC NET CSE | December 2004 | Part 2 | Question: 50

The term hacker was originally associated with :

A. A computer program
B. Virus
C. Computer professionals who solved complex computer problems
D. All of the above

ugcnetcse-dec2004-paper2

Answer key ☟

33.0.3 UGC NET CSE | December 2004 | Part 2 | Question: 46

Data Mining can be used as _________ Tool.

A. Software B. Hardware C. Research D. Process

ugcnetcse-dec2004-paper2

Answer key ☟

33.0.4 UGC NET CSE | December 2006 | Part 2 | Question: 50

The maximum size of SMS in is ______ octets.

A. B. C. D.

ugcnetcse-dec2006-paper2

Answer key ☟

33.0.5 UGC NET CSE | December 2006 | Part 2 | Question: 49

Link analysis operation in data mining uses ___________ technique.

A. Classification. B. Association discovery.
C. Visualisation. D. Neural clustering.

ugcnetcse-dec2006-paper2

33.0.6 UGC NET CSE | December 2007 | Part 2 | Question: 50

Identify the incorrect statement :

A. ATM provides both real time and non-real time service

B. ATM provides faster packet switching than
 C. ATM was developed as part of the work on broadband ISDN
D. ATM does not have application in Non-ISDN environments where very high data rates are required

ugcnetcse-dec2007-paper2

33.0.7 UGC NET CSE | December 2007 | Part 2 | Question: 49

Identify the incorrect statement :

A. The internet has evolved into phenomenally successful e-commerce engine

B. e-business is synonymous with e-commerce
C. The e-commerce model did not begin with billboardware
D. The e-commerce model began with billboardware

ugcnetcse-dec2007-paper2

33.0.8 UGC NET CSE | October 2022 | Part 1 | Question: 104

Based on the following passage, answer the Questions :

A long trunk operates at and is used to transmit 64 bytes frames and uses sliding window
protocol. The propagation speed is .
The sender window size to get the maximum efficiency is

A. B. C. D.
ugcnetcse-oct2022-paper1

33.0.9 UGC NET CSE | October 2022 | Part 1 | Question: 103

Based on the following passage, answer the Questions :

A long trunk operates at and is used to transmit 64 bytes frames and uses sliding window
protocol. The propagation speed is .
The transmission and propagation delays are respectively

A.
B.
C.
D.

ugcnetcse-oct2022-paper1

Answer key ☟

33.0.10 UGC NET CSE | October 2022 | Part 1 | Question: 102

Based on the following passage, answer the Questions :

A long trunk operates at and is used to transmit 64 bytes frames and uses sliding window
protocol. The propagation speed is .
The maximum achievable throughput is

A. B. C. D.
ugcnetcse-oct2022-paper1

33.0.11 UGC NET CSE | October 2022 | Part 1 | Question: 101

Based on the following passage, answer the Questions:

A long trunk operates at and is used to transmit 64 bytes frames and uses sliding window
 protocol. The propagation speed is .
If only 6 bits are reserved for sequence number field, then the efficiency of the system is

A. B. C. D.
ugcnetcse-oct2022-paper1

33.0.12 UGC NET CSE | October 2022 | Part 1 | Question: 100

Based on the following passage, answer the Questions :

A long trunk operates at and is used to transmit 64 bytes frames and uses sliding window
protocol. The propagation speed is .
The minimum number of bits required in the sequence number field of the packet is

A. bits B. bits C. bits D. bits

ugcnetcse-oct2022-paper1

Answer key ☟

33.0.13 UGC NET CSE | October 2022 | Part 1 | Question: 99

Read the following and Answer the questions:

Consider the relational schema of sailors , Reserves and Boats .
Table : Sailors

Table : Reserves

Table : Boats
 Which of the following relational algebra query computes the names of sailor who have reserved all boats?

A. (Tempsids, ( bid Reserves) / bid Boats) sname ((Tempsids) Sailors)

B. (Tempsids, ( sid, bid Reserves) / bid Boats) sname ((Tempsids) Sailors)
C. (Tempsids. ( sid Sailors) / bid Boats) ((Tempsids) Sailors)
D. (Tempsids, ( sid Reserves) bid Boats) sname ((Tempsids) Boats)

ugcnetcse-oct2022-paper1

Answer key ☟

33.0.14 UGC NET CSE | October 2022 | Part 1 | Question: 98

Read the following and Answer the Questions:

Consider the relational schema of sailors . Reserves and Boots .
Table : Sailors

Table : Reserves

Table : Boats
 Which of the following relational algebra query/queries computes/compute the sid’s of sailors with age over who
have not reserved red boat?

A. sid Sailors sid Boats Reserves Sailors

B. sid red age (Boats Sailors Reserves
C. sid ( < Sailors sid Boats Reserves Sailors
D. sid Sailors sid Boats Reserves Sailors

ugcnetcse-oct2022-paper1

33.0.15 UGC NET CSE | October 2022 | Part 1 | Question: 97

Read the following and Answer the Questions:

Consider the relational schema of sailors . Reserves and Boots .
Table : Sailors

Table : Reserves

Table : Boats
 Which of the following relational algebra query/queries computes/compute the name of sailors who have reserved red
boat?
sname (( = Boats) Reserves Sailors)
sname ( (( = ) Reserves) Sailors)
sname (( = Reserves) Boats Sailors)

1. Both and
2. Both and
3. Only
4. Only

ugcnetcse-oct2022-paper1

33.0.16 UGC NET CSE | October 2022 | Part 1 | Question: 96

Read the following and Answer the Questions:

Consider the relational schema of sailors . Reserves and Boots .
Table : Sailors

Table : Reserves
 Table : Boats

Which of the following relational algebra query/queries computes/compute the name of sailors who have reserved boat
?
sname (( = Boats) Sailors)
sname = ( = (Reserves Sailors))
sname = (( = Reserves) Sailors)
A. Both and B. Both and
C. Only D. Only
ugcnetcse-oct2022-paper1

Answer key ☟

33.0.17 UGC NET CSE | October 2022 | Part 1 | Question: 95

Read the following and Answer the questions:

Consider the relational schema of sailors , Reserves and Boats .
Table : Sailors

Table : Reserves
 Table : Boats

Which of the following relational algebra query computes the names of sailors who have reserved a red and a green
boat?

A. (Tempred, sid Boats Reserves)), (Tempgreen. sid Boats

Reserves)), sname (Tempred Tempgreen) Sailors
B. Tempboats 2, color Boats color Boats sname (Tempboats 2 Reserves)
C. sname Boats Boats (Tempboats Sailors Reserves))
D. Tempboats 2, Boats Boats sname (Tempboats 2 sailors)

ugcnetcse-oct2022-paper1

33.0.18 UGC NET CSE | October 2022 | Part 1 | Question: 94

In a game playing search tree, upto which depth pruning can be applied?
(A) Root level
(B) level
(C) level
(D) Depends on utility value in a breadth first order
Choose the correct answer from the options given below :

A. and only B. and only C. and only D. and only

ugcnetcse-oct2022-paper1

Answer key ☟

33.0.19 UGC NET CSE | October 2022 | Part 1 | Question: 93

Consider the traversal of a tree

Preorder
Inorder
 Which of the following is correct post order traversal?
A. B.
C. D.
ugcnetcse-oct2022-paper1

33.0.20 UGC NET CSE | October 2022 | Part 1 | Question: 92

A good software requirement specification does have the characteristic

A. Completeness B. Consistency C. Clarity D. Reliability

ugcnetcse-oct2022-paper1

Answer key ☟

33.0.21 UGC NET CSE | October 2022 | Part 1 | Question: 91

L e t be a relation schema and be the set of dependencies

and . The minimal cover of a set of
functional dependencies is

A. , and
B. and
C. and
D. and

ugcnetcse-oct2022-paper1

33.0.22 UGC NET CSE | October 2022 | Part 1 | Question: 90

Modules and operate on the same input and output, then the cohesion is

A. Logical cohesion B. Sequential cohesion

C. Procedural cohesion D. Communicational cohesion
ugcnetcse-oct2022-paper1

33.0.23 UGC NET CSE | October 2022 | Part 1 | Question: 89

For the following page reference string , the number of page faults that occur in Least
Recently Used page replacement algorithm with frame size is

A. B. C. D.

ugcnetcse-oct2022-paper1

33.0.24 UGC NET CSE | October 2022 | Part 1 | Question: 88

Given below are two statements :

Statement : "Grandparent is a parent of one's parent".
Statement : First Order Predicate Logic representation of above statement is
, c grandparent parent parent
In the light of the above statements, choose the most appropriate answer from the options given below :

A. Both Statement and Statement are correct

B. Both Statement and Statement are incorrect
C. Statement is correct but Statement is incorrect
D. Statement is incorrect but Statement is correct

ugcnetcse-oct2022-paper1
33.0.25 UGC NET CSE | October 2022 | Part 1 | Question: 86

Match List I with List II :

List I List II
(A) Localization (I) Encapsulationlation
(B) Packaging or
binding of a (II) Abstraction
collection of items
(C) Mechanism that (III) Characteristic of
enables designer software that indicates
to focus on essential the manner in which
details of a program information is
component. concentrated in program
(IV) Suppressing the
(D) Information
operational details of a
hiding
program component

Choose the correct answer from the options given below :

A. B.
C. D.
ugcnetcse-oct2022-paper1

33.0.26 UGC NET CSE | October 2022 | Part 1 | Question: 84

The total storage capacity of a floppy disk having tracks and storing bytes/sector is bytes. How
many sectors does this disk have?

A. B. C. D.
ugcnetcse-oct2022-paper1

Answer key ☟

33.0.27 UGC NET CSE | October 2022 | Part 1 | Question: 82

The process to gather the software requirements from client, analyze and document is known as -
A. Software Engineering Process B. User Engineering Process
C. Requirement Elicitation Process D. Requirement Engineering Process
ugcnetcse-oct2022-paper1

33.0.28 UGC NET CSE | October 2022 | Part 1 | Question: 81

If every requirement can be checked by a cost-effective process, then is called

A. Verifiable B. Traceable C. Modifiable D. Complete

ugcnetcse-oct2022-paper1

33.0.29 UGC NET CSE | October 2022 | Part 1 | Question: 80

software process model stands for

A. Rapid Application Development B. Relative Application Development
C. Rapid Application Design D. Recent Application Development,
ugcnetcse-oct2022-paper1

Answer key ☟
33.0.30 UGC NET CSE | October 2022 | Part 1 | Question: 79

The reduced grammar equivalent to the grammar, whose production rules are given below, is

A.
B.
C.
D.

ugcnetcse-oct2022-paper1

33.0.31 UGC NET CSE | October 2022 | Part 1 | Question: 78

A magnetic tape drive has transport speed of inches per second and a recording density of bytes per
inch. The time required to write bytes of data grouped in characters record with a blocking factor
is
A. B.
C. D.
ugcnetcse-oct2022-paper1

33.0.32 UGC NET CSE | October 2022 | Part 1 | Question: 77

Consider
Which of the following string is in ?

A. B. C. D.
ugcnetcse-oct2022-paper1

Answer key ☟

33.0.33 UGC NET CSE | October 2022 | Part 1 | Question: 76

Consider the following statements:

Statement : parser is more powerful than canonical Parser.
Statement : parser is more powerful than
Which of the following is correct?

A. Statement true and Statement false

B. Statement false and Statement true
C. Both Statement and Statement false
D. Both Statement and Statement true

ugcnetcse-oct2022-paper1

Answer key ☟

33.0.34 UGC NET CSE | October 2022 | Part 1 | Question: 75

Given below are two statements : one is labelled as Assertion and the other is labelled as Reason :
Assertion :
Reason
 In the light of the above statements, choose the correct answer from the options given below :

A. Both and are true and is the correct explanation of

B. Both and are true but is the correct explanation of
C. is true but is false
D. false but is true

ugcnetcse-oct2022-paper1

33.0.35 UGC NET CSE | October 2022 | Part 1 | Question: 73

Match List I with List II:

Choose the correct answer from the options given below :

A. B.
C. D.

ugcnetcse-oct2022-paper1

33.0.36 UGC NET CSE | October 2022 | Part 1 | Question: 72

Consider the following:

Which of the following is correct matching?

A. B.
C. D.
ugcnetcse-oct2022-paper1

33.0.37 UGC NET CSE | October 2022 | Part 1 | Question: 71

Which statement is false?

A. All function calls in pass arguments using call by value.

B. Call by reference enables a called function to modify a variable in calling function.
C. Call by value is always more efficient than call by reference.
D. Programmers use pointers and indirection operation to simulate call by reference.

ugcnetcse-oct2022-paper1
33.0.38 UGC NET CSE | October 2022 | Part 1 | Question: 70

Of the following, which is a logical error?

A. Using the instead of to determine if two values are equal,

B. Divide by zero
C. Failing to initialize counter and total variables before the body of loop,
D. Using commas instead of two required semicolon in a for loop header

ugcnetcse-oct2022-paper1

Answer key ☟

33.0.39 UGC NET CSE | October 2022 | Part 1 | Question: 69

Let , and Let be the relation . could be interpreted as the relation

approximately equal. is
(A) Reflexive
(B) Symmetric
(C) transitive
Choose the correct answer from the options given below :
A. and only true B. and only true
C. and only true D. , and true
ugcnetcse-oct2022-paper1

33.0.40 UGC NET CSE | October 2022 | Part 1 | Question: 68

Consider the following two lists :

Which of the following is correct match ?

A. B.
C. D.

ugcnetcse-oct2022-paper1

33.0.41 UGC NET CSE | October 2022 | Part 1 | Question: 67

Consider the following related to Fourth Generation Technique :

(A) It controls efforts.
(B) It controls resources.
(C) It controls cost of development.
Choose the correct answer from the options given below :
A. and only B. and only
C. and only D. All , and
ugcnetcse-oct2022-paper1
33.0.42 UGC NET CSE | October 2022 | Part 1 | Question: 66

Which mechanism in allows organizations to specify globally unique names as element tags in
documents?

A. root B. header C. schema D. namespace

ugcnetcse-oct2022-paper1

33.0.43 UGC NET CSE | October 2022 | Part 1 | Question: 65

This transformation is called

A. Scaling B. Shear C. Homography D. Steganography

ugcnetcse-oct2022-paper1

33.0.44 UGC NET CSE | October 2022 | Part 1 | Question: 64

Match List I with List II :

Choose the correct answer from the options given below :

A. B.
C. D.

ugcnetcse-oct2022-paper1

33.0.45 UGC NET CSE | October 2022 | Part 1 | Question: 63

How many rotations are required during the construction of an tree if the following elements are to be
added in the given sequence?

A. left rotations, right rotations B. left rotations, right rotations

C. left rotations, right rotations D. left rotations, right rotation
ugcnetcse-oct2022-paper1

Answer key ☟

33.0.46 UGC NET CSE | October 2022 | Part 1 | Question: 62

Match List I with List II :

 Choose the correct answer from the options given below :
A. B.
C. D.
ugcnetcse-oct2022-paper1

33.0.47 UGC NET CSE | October 2022 | Part 1 | Question: 61

Consider the production rules of grammar G:

Which of the following language is generated by grammer ?

A. B.
C. D.
ugcnetcse-oct2022-paper1

33.0.48 UGC NET CSE | October 2022 | Part 1 | Question: 58

A trigger is

A. A statement that enables to start

B. A statement that is executed by the user when debugging an application program.
C. A condition the system tests for the validity of the database user.
D. A statement that is executed automatically by the system as a side effect of modification to the database.

ugcnetcse-oct2022-paper1

33.0.49 UGC NET CSE | October 2022 | Part 1 | Question: 57

Given below are two statements : one is labelled as Assertion and the other is labelled as Reason :

Assertion : A load-and-go assembler avoids the overhead of writing the object program out and reading it back in.
Reason : This can be done with either one-pass or two pass assembler.
In the light of the above statements, choose the correct answer from the options given below :

A. Both and are true and is the correct explanation of ,

B. Both and are true but is the correct explanation of
C. is true but is false
D. is false but is true

ugcnetcse-oct2022-paper1
33.0.50 UGC NET CSE | October 2022 | Part 1 | Question: 55

The representation of bit code into bit, even parity Hamming code is

A. B. C. D.
ugcnetcse-oct2022-paper1 hamming-code

Answer key ☟

33.0.51 UGC NET CSE | October 2022 | Part 1 | Question: 54

In a cache memory, if address has bits in Tag field and bits in index field, the size of main memory and
cache memory would be respectively
A. B. ,
C. D.
ugcnetcse-oct2022-paper1

33.0.52 UGC NET CSE | October 2022 | Part 1 | Question: 52

Consider the following statements:

Statement : Composite attributes cannot be divided into smaller subparts.
Statement : Complex attribute is formed by nesting composite attributes and multivalued attributes in an arbitrary
way.
Statement : A derived attribute is an attribute whose values are computed from other attribute.
Which of the following is correct?

A. Statement , Statement and Statement are true

B. Statement true and Statement , Statement false
C. Statement , Statement true and Statement false
D. Statement false and Statement , Statement true

ugcnetcse-oct2022-paper1

33.0.53 UGC NET CSE | October 2022 | Part 1 | Question: 51

Consider a logic gate circuit, with 8 input lines and 3 output lines specified
by following operations

Where indicates logical operation. This circuit is

A. multiplexer B. Decimal to converter
C. Octal to Binary encoder D. Priority encoder
ugcnetcse-oct2022-paper1

Answer key ☟

33.0.54 UGC NET CSE | October 2022 | Part 1 | Question: 50

Consider the following in Boolean Algebra

A. is true B. is true
 C. Both and are true D. It does not depend on and
ugcnetcse-oct2022-paper1

33.0.55 UGC NET CSE | October 2022 | Part 1 | Question: 49

If an operating system does not allow a child process to exist when the parent process has been terminated, this
phenomenon is called as.
A. Threading B. Cascading termination
C. Zombie termination D. Process killing
ugcnetcse-oct2022-paper1

33.0.56 UGC NET CSE | October 2022 | Part 1 | Question: 48

Pointers cannot be used to

A. find the address of a variable in memory B. reference value directly

C. simulate call by reference D. manipulate dynamic data structure
ugcnetcse-oct2022-paper1

33.0.57 UGC NET CSE | October 2022 | Part 1 | Question: 47

In a database, a rule is defined as and or ? and , where , . are premises and

. are conclusions of rules with certainty factors ( ) and respectively. If any running program has
produced , , with as , respectively. find the of results on the basis of premises.

A.
B.
C.
D.

ugcnetcse-oct2022-paper1

33.0.58 UGC NET CSE | October 2022 | Part 1 | Question: 46

A top down approach to programming calls for :

Statement : Working from the general to the specific.
Statement : Postpone the minor decisions.
Statement : A systematic approach.
Statement : Intermediate coding of the problem
Which of the following is true?

A. Statement only
B. Statement and Statement only
C. Statement , Statement and Statement only
D. Statement , Statement and Statement only

ugcnetcse-oct2022-paper1

33.0.59 UGC NET CSE | October 2022 | Part 1 | Question: 45

Match List I with List II :

List I List II
(A) Type (I) Finite automata
(B) Type (II) Tuning machine
(C) Type (III) Linear bound automata
(D) Type (IV) Pushdown automata
Choose the correct answer from the options given below :
 A. B.
C. D.

ugcnetcse-oct2022-paper1

Answer key ☟

33.0.60 UGC NET CSE | October 2022 | Part 1 | Question: 44

Consider the following graph :

For the graph; the following sequences of depth first search (DFS) are given
(A)
(B)
(C)
(D)
Which of the following is correct?
A. only B.
C. , only D. only

ugcnetcse-oct2022-paper1

33.0.61 UGC NET CSE | October 2022 | Part 1 | Question: 43

Hidden surface removal problem with minimal pipeline can be solved with
A. Painter's algorithm B. Window Clipping algorithm
C. Brute force rasterization algorithm D. Flood fill algorithm
ugcnetcse-oct2022-paper1

Answer key ☟

33.0.62 UGC NET CSE | October 2022 | Part 1 | Question: 42

Which one is a connectionless transport - layer protocol that belongs to the Internet protocol family?
A. Transmission Control Protocol (TCP) B. User Datagram Protocol (UDP)
C. Routing Protocol (RP) D. Datagram Control Protocol (DCP),
ugcnetcse-oct2022-paper1

33.0.63 UGC NET CSE | October 2022 | Part 1 | Question: 41

Let be a semigroup, where .

(A)
(B)
Choose the most appropriate answer from the options given below :
 A. only true B. only true
C. Both and true, D. Neither nor true,
ugcnetcse-oct2022-paper1

Answer key ☟

33.0.64 UGC NET CSE | October 2022 | Part 1 | Question: 40

The number of gate inputs, required to realize expression + is

A. B. C. D.
ugcnetcse-oct2022-paper1

33.0.65 UGC NET CSE | October 2022 | Part 1 | Question: 39

There are three boxes. First box has white, black and red balls. Second box has white, black and red
balls. Third box has white, black and red balls. A box is chosen at random and balls are drawn out of
which is white, and 1 is red. What is the probability that the balls came from first box?

A. B. C. D.
ugcnetcse-oct2022-paper1

33.0.66 UGC NET CSE | October 2022 | Part 1 | Question: 38

Match List I with List II:

List I List II
(A) DES (I) Key size -
(B) AES (II) Key size -
(C) DES (III) Key size -
(D) RSA (IV) Key size -

A. B.
C. D.
ugcnetcse-oct2022-paper1

Answer key ☟

33.0.67 UGC NET CSE | October 2022 | Part 1 | Question: 37

The logic expression is equivalent to

A. , B. C. D.
ugcnetcse-oct2022-paper1

Answer key ☟

33.0.68 UGC NET CSE | October 2022 | Part 1 | Question: 36

Consider an error-free satellite channel used to send byte data frames in one direction with very short
acknowledgements coming back the other way. What is the maximum throughput for window size of ?
A. B.
C. D. ,
ugcnetcse-oct2022-paper1

33.0.69 UGC NET CSE | October 2022 | Part 1 | Question: 35

The condition cannot be replaced by

A. || B. num
C. D.
 ugcnetcse-oct2022-paper1

Answer key ☟

33.0.70 UGC NET CSE | October 2022 | Part 1 | Question: 34

The model in which the requirements are implemented by its category is

A. Evolutionary Development Model B. Waterfall Model
C. Prototyping Model D. Iterative Enhancement Model
ugcnetcse-oct2022-paper1

33.0.71 UGC NET CSE | October 2022 | Part 1 | Question: 33

Which of the following is correct for the destination address ?

A. unicast address B. multicast address
C. broadcast address D. unicast and broadcast address
ugcnetcse-oct2022-paper1

Answer key ☟

33.0.72 UGC NET CSE | October 2022 | Part 1 | Question: 32

Consider the properties of recursively enumerable sets :

(A) Finiteness
(B) Context Freedom
(C) Emptiness
Which of the following is true?

A. Only and are not decidable

B. Only and are not decidable
C. Only and are not decidable,
D. All , and are not decidable

ugcnetcse-oct2022-paper1

33.0.73 UGC NET CSE | October 2022 | Part 1 | Question: 31

Alpha and Beta testing are forms of

A. White-Box Testing, B. Black-Box Testing
C. Acceptance Testing D. System Testing
ugcnetcse-oct2022-paper1

33.0.74 UGC NET CSE | October 2022 | Part 1 | Question: 30

Consider the following:

Which of the following is correct matching ?
List I List II
(A) Activation record (I) Linking Loader
(B) Location counter (II) Garbage
(C) Reference count (III) Subroutine Call
(D) Address relocation (IV) Assembler

A. B.
C. D.
ugcnetcse-oct2022-paper1
33.0.75 UGC NET CSE | October 2022 | Part 1 | Question: 29

Which of the following is correct for the destination address ?

A. unicast address B. multicast address
C. broadcast address D. unicast and broadcast address
ugcnetcse-oct2022-paper1

Answer key ☟

33.0.76 UGC NET CSE | October 2022 | Part 1 | Question: 28

Consider the properties of recursively enumerable sets :

Finiteness
Context Freedom
Emptiness
Which of the following is true?
A. Only and are not decidable B. Only and are not decidable
C. Only and are not decidable, D. All , and are not decidable
ugcnetcse-oct2022-paper1

Answer key ☟

33.0.77 UGC NET CSE | October 2022 | Part 1 | Question: 27

Alpha and Beta testing are forms of

A. White-Box Testing B. Black-Box Testing
C. Acceptance Testing D. System Testing
ugcnetcse-oct2022-paper1

Answer key ☟

33.0.78 UGC NET CSE | October 2022 | Part 1 | Question: 26

Consider the following :

Which of the following is correct matching ?

A. ( )-( ),( )-( ), ( ) -( ), ( )-( )

B. ( ) -( ), (
C. ( )-( ),
D. ( )-( ),

ugcnetcse-oct2022-paper1

Answer key ☟

33.0.79 UGC NET CSE | October 2022 | Part 1 | Question: 25

Which mode is a block cipher implementation as a self-synchronizing stream cipher?

A. Cipher Block Chaining Mode, B. Cipher Feedback Mode
C. Electronic Codebook Mode D. Output Feedback Mode
ugcnetcse-oct2022-paper1

Answer key ☟
33.0.80 UGC NET CSE | October 2022 | Part 1 | Question: 24

Given below are two statements :

Statement I: Consider bit 'Branch' microinstruction code format given below:

: Micro-operation fields
: Condition for branching
: Branch field
: Address field

Statement II: Instruction represented in above format can perform branch in

In the light of the above statements, choose the most appropriate answer from the options given below :

A. Both Statement and Statement are correct

B. Both Statement and Statement are incorrect
C. Statement is correct but Statement is incorrect
D. Statement is incorrect but Statement is correct

ugcnetcse-oct2022-paper1

33.0.81 UGC NET CSE | October 2022 | Part 1 | Question: 23

Consider the following

Which of the following Language is accepted by ?

A. B.
C. D.
ugcnetcse-oct2022-paper1

Answer key ☟

33.0.82 UGC NET CSE | October 2022 | Part 1 | Question: 22

Consider the language

Which of the following regular expression represents language L?
A. aaaa* B. aaaaa*
C. aaaaa * D. aaaa*
ugcnetcse-oct2022-paper1

Answer key ☟

33.0.83 UGC NET CSE | October 2022 | Part 1 | Question: 21

Consider a memory system having address spaced at a distance of Bank cycle time and number of
banks, then the average data access time per word access in synchronous organization is

A.
 B.

C.

D.

ugcnetcse-oct2022-paper1

Answer key ☟

33.0.84 UGC NET CSE | October 2022 | Part 1 | Question: 20

Which layer divides each message into packets at the source and re-assembles them at the destination?
A. Network layer B. Transport layer
C. Data link layer D. Physical layer
ugcnetcse-oct2022-paper1

Answer key ☟

33.0.85 UGC NET CSE | October 2022 | Part 1 | Question: 19

Which of the following is an indirect measure of product?

A. Quality B. Complexity C. Reliability D. All of these

ugcnetcse-oct2022-paper1

Answer key ☟

33.0.86 UGC NET CSE | October 2022 | Part 1 | Question: 18

Consider a B-tree of height h. minimum degree that contains any -key, where . Which of the
following is correct?

A. B.
C. D.
ugcnetcse-oct2022-paper1

33.0.87 UGC NET CSE | October 2022 | Part 1 | Question: 17

A classless address is given as . The number of addresses in the network is

A. addresses B. addresses C. addresses D. addresses

ugcnetcse-oct2022-paper1

Answer key ☟

33.0.88 UGC NET CSE | October 2022 | Part 1 | Question: 16

Fault base testing technique is

A. Unit testing B. Beta testing,
C. Stress testing D. Mutation testing
ugcnetcse-oct2022-paper1

Answer key ☟

33.0.89 UGC NET CSE | October 2022 | Part 1 | Question: 15

Assume that and are asymptotically positive. Which of the following is correct?

A. and
B. and
 C. and
D. and

ugcnetcse-oct2022-paper1

Answer key ☟

33.0.90 UGC NET CSE | October 2022 | Part 1 | Question: 14

Which Metrics are derived by normalizing quality and/or productivity measures by considering the size of the
software that has been produced?
A. Function - Oriented Metrics B. Function - Point Metrics
C. Line of Code Metrics D. Size Oriented Metrics
ugcnetcse-oct2022-paper1

Answer key ☟

33.0.91 UGC NET CSE | October 2022 | Part 1 | Question: 12

Consider the hash table of size that uses open addressing with linear probing. Let be the
hash function. A sequence of records with keys is inserted into an initially empty
hash table, the bins of which are indexed from to . What is the index of the bin into which the last record is
inserted?

A. B. C. D.
ugcnetcse-oct2022-paper1

Answer key ☟

33.0.92 UGC NET CSE | October 2022 | Part 1 | Question: 11

In reference to Big data, consider the following database :

(A) Memcached
(B) Couch
(C) Infinite graph
Choose the most appropriate answer from the options given below :
A. and only B. and only,
C. and only D. and
ugcnetcse-oct2022-paper1

Answer key ☟

33.0.93 UGC NET CSE | October 2022 | Part 1 | Question: 10

Consider the following statements:

Statement : Conservative is a deadlock-free protocol.
Statement : Thomas's write rule enforces conflict serializability.
Statement : Timestamp ordering protocol ensures serializability based on the order of transaction timestamps.
Which of the following is correct?

A. Statement , Statement true and Statement false

B. Statement , Statement true and Statement false
C. Statement , Statement false and Statement true
D. Statement , Statement and Statement true

ugcnetcse-oct2022-paper1

Answer key ☟
33.0.94 UGC NET CSE | October 2022 | Part 1 | Question: 9

The number of nodes of height in any -element heap is atmost:

A. B. C. D.
ugcnetcse-oct2022-paper1

33.0.95 UGC NET CSE | October 2022 | Part 1 | Question: 8

A -stage pipeline has the stage delay as and ns respectively. Registers that are used between
the stages have delay of . Assuming constant locking rate, the total time required to process data items
on this pipeline is
A. B.
C. D.
ugcnetcse-oct2022-paper1

Answer key ☟

33.0.96 UGC NET CSE | October 2022 | Part 1 | Question: 7

Match List with List :

List I List II
(A)
Ontological (I) Organizing subclass relations
Engineering
(B)
(II) Organizing knowledge into
Taxonomy
category and sub category
Hierarchy
(C) (III) Attaches a number with each
Inheritance possibility
(D) (IV) Representing concepts.
Probability events, time. physical concepts of
mode different domains

Choose the correct answer from the options given below :

A. (A)-(II), (B)-(I), (C)-(IV), (D)-(III) B. (A)-(I), (B)-(II), (C)-(III), (D)-(IV)
C. (A)-(IV), (B)-(III), (C)-(I), (D)-(II) D. (A)-(IV), (B)-(I), (C)-(II), (D)-(III)

ugcnetcse-oct2022-paper1

Answer key ☟

33.0.97 UGC NET CSE | October 2022 | Part 1 | Question: 6

The solution of the recurrence relation is

A. B.
C. D.
ugcnetcse-oct2022-paper1

33.0.98 UGC NET CSE | October 2022 | Part 1 | Question: 5

Size and complexity are a part of

A. People Metrics B. Project Metrics
C. Process Metrics D. Product Metrics
ugcnetcse-oct2022-paper1

Answer key ☟
 33.0.99 UGC NET CSE | October 2022 | Part 1 | Question: 4

Consider the following statements about Context Free Language :

Statement I: is closed under homomorphism.
Statement II: is closed under complement.
Which of the following is correct?

A. Statement is true and Statement II is false

B. Statement is true and Statement is false
C. Both Statement and Statement are true
D. Neither Statement nor Statement is true

ugcnetcse-oct2022-paper1

Answer key ☟

33.0.100 UGC NET CSE | October 2022 | Part 1 | Question: 3

Using algorithm, if and . the value of and cipher value of with key are

A. B. C. D.
ugcnetcse-oct2022-paper1

33.0.101 UGC NET CSE | October 2022 | Part 1 | Question: 2

Consider two lists and of three strings on

:
List A List B

:
List A List B

Which of the following is true?

A. Only PCP in has solution.,

B. Only PCP in has solution.,
C. PCP in both and has solution.
D. PCP neither in nor in has solution.,

ugcnetcse-oct2022-paper1

Answer key ☟

33.1 3 Puzzle (1)

33.1.1 3 Puzzle: UGC NET CSE | July 2016 | Part 3 | Question: 74

Consider a 3-puzzle where, like in the usual 8-puzzle game, a tile can only move to an adjacent empty space.
Given the initial state
12
3
which of the following state cannot be reached?
 31
A
2
3
B
21
13
C
2
2
D
13

ugcnetcse-july2016-paper3 artificial-intelligence 3-puzzle

Answer key ☟

33.2 Algorithm Design (1)

33.2.1 Algorithm Design: UGC NET CSE | October 2022 | Part 1 | Question: 74

Which of the following algorithm design approach is used in Quick sort algorithm?

A. Dynamic programming B. Back Tracking

C. Divide and conquer D. Greedy approach
ugcnetcse-oct2022-paper1 algorithm-design quick-sort

Answer key ☟

33.3 Alpha Beta Pruning (1)

33.3.1 Alpha Beta Pruning: UGC NET CSE | July 2016 | Part 3 | Question: 73

Consider the following game tree in which root is a maximizing node and children are visited left to right. What
nodes will be pruned by the alpha-beta pruning?

A. B. C. D.
ugcnetcse-july2016-paper3 artificial-intelligence alpha-beta-pruning

Answer key ☟

33.4 Alpha Cut (1)

33.4.1 Alpha Cut: UGC NET CSE | June 2019 | Part 2 | Question: 95

Let denotes the -cut of a fuzzy set at . If , then

A. B.
C. D.
ugcnetcse-june2019-paper2 fuzzy-set alpha-cut

Answer key ☟

33.5 Application Software (1)

33.5.1 Application Software: UGC NET CSE | June 2010 | Part 2 | Question: 45

Applications-software
A. Is used to control the operating system B. Includes programs designed to help programmers
 C. Performs a specific task for computer users D. All of the above
ugcnetcse-june2010-paper2 application-software

Answer key ☟

33.6 Bigdata Hadoop (1)

33.6.1 Bigdata Hadoop: UGC NET CSE | June 2019 | Part 2 | Question: 38

Hadoop (a big data tool) works with number of related tools. Choose from the following, the common tools
included into Hadoop:
A. MySQL, Google API and Map reduce B. Map reduce, Scala and Hummer
C. Map reduce, H Base and Hive D. Map reduce, Hummer and Heron
ugcnetcse-june2019-paper2 bigdata-hadoop

Answer key ☟

33.7 Convex Optimization (1)

33.7.1 Convex Optimization: UGC NET CSE | July 2018 | Part 2 | Question: 82

Which of the following statements is false about convex minimization problem?

A. If a local minimum exists, then it is a global minimum

B. The set of all global minima is convex set
C. The set of all global minima is concave set
D. For each strictly convex function, if the function has a minimum, then the minimum is unique

ugcnetcse-july2018-paper2 convex-optimization

Answer key ☟

33.8 Data Mining (2)

33.8.1 Data Mining: UGC NET CSE | July 2016 | Part 2 | Question: 50

Given the following two statements:

I. Strategic value of data mining is timestamping

II. Information collection is an expensive process in building an expert system

Which of the following options is correct?

A. Both I and II are false B. Both I and II are true

C. I is true, II is false D. I is false, II is true
ugcnetcse-july2016-paper2 data-mining

Answer key ☟

33.8.2 Data Mining: UGC NET CSE | June 2010 | Part 2 | Question: 50

Data Mining uses _______, _______ and _______ to build effective predictive model.

(i) Data set

(ii) Information set

(iii) Input set

(iv) Process set

(v) Output set

 (vi) Test set

and

and

and

and
ugcnetcse-june2010-paper2 data-mining

33.9 Data Warehousing (4)

33.9.1 Data Warehousing: UGC NET CSE | July 2016 | Part 2 | Question: 47

Consider the following two statements:

I. Business intelligence and Data warehousing is used for forecasting and Data mining
II. Business intelligence and Data warehousing is used for analysis of large volumes of sales data

Which one of the following options is correct?

A. I is true , II is false B. Both I and II are true

C. I is false II is false D. Both I and II are false
ugcnetcse-july2016-paper2 data-warehousing

Answer key ☟

33.9.2 Data Warehousing: UGC NET CSE | July 2016 | Part 2 | Question: 49

Consider the following two statements:

I. Data scrubling is a process to upgrade the quality of data, before it is moved into Data warehouse
II. Data scrubling is a process of rejecting data from data warehouse to create indexes

Which one of the following options is correct?

A. I is true II is false B. I is false II is true
C. Both I and II are false D. Both I and II are true
ugcnetcse-july2016-paper2 data-warehousing

Answer key ☟

33.9.3 Data Warehousing: UGC NET CSE | June 2012 | Part 3 | Question: 20

Data Warehouse provides

A. Transaction Responsiveness B. Storage, Functionality Responsiveness to queries
C. Demand and Supply Responsiveness D. None of the above
ugcnetcse-june2012-paper3 data-warehousing

Answer key ☟

33.9.4 Data Warehousing: UGC NET CSE | June 2012 | Part 3 | Question: 7

Match the following :

A. B.
C. D.
 ugcnetcse-june2012-paper3 data-mining data-warehousing

Answer key ☟

33.10 Debugger (1)

33.10.1 Debugger: UGC NET CSE | December 2014 | Part 2 | Question: 34

Debugger is a program that

A. Allows to examine and modify the contents of registers

B. Does not allow execution of a segment of program
C. Allows to set breakpoints, execute a segment of program and display contents of register
D. All of the above

ugcnetcse-dec2014-paper2 debugger

Answer key ☟

33.11 Defuzzification (1)

33.11.1 Defuzzification: UGC NET CSE | June 2019 | Part 2 | Question: 96

Consider the following methods:

: Mean of maximum
: Centre of area
: Height method
Which of the following is/are defuzzification method(s)?

A. Only B. Only and C. Only and D. , and

ugcnetcse-june2019-paper2 fuzzy-set defuzzification

Answer key ☟

33.12 Encryption Decryption (1)

33.12.1 Encryption Decryption: UGC NET CSE | July 2018 | Part 2 | Question: 48

Decrypt the message "WTAAD" using the Caesar Cipher with key =15

A. LIPPS B. HELLO C. PLLEH D. DAATW

ugcnetcse-july2018-paper2 cryptography encryption-decryption

Answer key ☟

33.13 Fuzzy Relation (1)

33.13.1 Fuzzy Relation: UGC NET CSE | July 2016 | Part 3 | Question: 64

Let R and S be two fuzzy relations defined as

R=

and

S=

Then, the resulting relation T, which related elements of universe xto elements of universe z using max-min
composition is given by
 A. T=

B. T=

C. T=

D. T=

ugcnetcse-july2016-paper3 fuzzy-set fuzzy-relation

Answer key ☟

33.14 Fuzzy Set (5)

33.14.1 Fuzzy Set: UGC NET CSE | December 2012 | Part 3 | Question: 13

Consider a fuzzy set A defined on the interval X=[0, 10]of integers by the membership Junction .
Then the cut corresponding to $\alpha =0.5 will be
A. B.
C. D.
ugcnetcse-dec2012-paper3 fuzzy-set

Answer key ☟

33.14.2 Fuzzy Set: UGC NET CSE | December 2014 | Part 3 | Question: 71

A ________ point of a fuzzy set is a point at which

A. Core B. Support C. Crossover D. -cut

ugcnetcse-dec2014-paper3 fuzzy-set

Answer key ☟

33.14.3 Fuzzy Set: UGC NET CSE | December 2015 | Part 3 | Question: 65

Consider a standard additive model consisting of rules of the form of

If is AND is THEN is . Given crisp inputs the output of the model is

A.
B.
C.
D.

ugcnetcse-dec2015-paper3 fuzzy-set

Answer key ☟

33.14.4 Fuzzy Set: UGC NET CSE | December 2015 | Part 3 | Question: 66

A bell shaped membership function is specified by three parameters as follows:

A. B.
 C.
D.

ugcnetcse-dec2015-paper3 fuzzy-set

Answer key ☟

33.14.5 Fuzzy Set: UGC NET CSE | July 2016 | Part 3 | Question: 65

Compute the value of adding the following two fuzzy integers:

A={(0.3,1), (0.6,2), (1,3), (0.7,4), (0.2,5)}
B={(0.5,11), (1, 12), (0.5, 13)}
Where fuzzy addition is defined as

Then, f(A+B) is equal to

A. {(0.5, 12), (0.6, 13), (1, 14), (0.7, 15), (0.7, 16), (1, 17), (1, 18)}
B. {(0.5, 12), (0.6, 13), (1, 14), (1, 15), (1, 16), (1, 17), (1, 18)}
C. {(0.3, 12), (0.5, 13), (0.5, 14), (1, 15), (0.7, 16), (0.5, 17), (0.2, 18)}
D. {(0.3, 12), (0.5, 13), (0.6, 14), (1, 15), (0.7, 16), (0.5, 17), (0.2, 18)}

ugcnetcse-july2016-paper3 fuzzy-set

Answer key ☟

33.15 Geographical Information System (1)

33.15.1 Geographical Information System: UGC NET CSE | December 2011 | Part 2 | Question: 46

To compare, overlay or cross analyze to maps in .

A. Both maps must be in digital form B. Both maps must be at the same equivalent scale.
C. Both maps must be on the same coordinate system D. All of the above
ugcnetcse-dec2011-paper2 geographical-information-system

Answer key ☟

33.16 Hill Climbing Search (1)

33.16.1 Hill Climbing Search: UGC NET CSE | July 2016 | Part 3 | Question: 72

How does randomized Hill climbing choose the next move each time?

A. It generates a random move from moveset and accepts this move

B. It generates random move from whole state space, and accepts this move
C. It generates a random move from moveset and accepts this move only if this move improves the evaluation function
D. It generates a random move from whole state space, and accepts this move only if this move improves the
evaluation function

ugcnetcse-july2016-paper3 artificial-intelligence hill-climbing-search

Answer key ☟

33.17 Inventory (1)

33.17.1 Inventory: UGC NET CSE | December 2014 | Part 2 | Question: 49

________ model is designed to bring prices down by increasing the number of customers who buy a particular
product at once.
A. Economic Order Quantity B. Inventory
 C. Data Mining D. Demand-Sensitive Pricing
ugcnetcse-dec2014-paper2 optimization inventory

Answer key ☟

33.18 K Mean Clustering (1)

33.18.1 K Mean Clustering: UGC NET CSE | June 2019 | Part 2 | Question: 40

K-mean clustering algorithm has clustered the given observations into clusters after st iteration as follows:

What will be the Manhattan distance for observation from cluster centroid in the second iteration?

A. B. C. D.
ugcnetcse-june2019-paper2 k-mean-clustering data-mining

Answer key ☟

33.19 Llp (1)

33.19.1 Llp: UGC NET CSE | July 2018 | Part 2 | Question: 83

The following LLP

Subject to

has

A. Solution : B. Unbounded solution

C. No solution D. Solution :
ugcnetcse-july2018-paper2 llp linear-programming

Answer key ☟

33.20 Machine Learning (1)

33.20.1 Machine Learning: UGC NET CSE | June 2014 | Part 2 | Question: 29

Match the following

A. B.
C. D.
ugcnetcse-june2014-paper2 machine-learning

Answer key ☟

33.21 Net Exam (1)

 33.21.1 Net Exam: Information regarding UGC NET

Can someone please tell what's the use of giving UGC NET in computer science after doing MTech and have
given GATE in CSE?

What benefits will NET give when applying for Phd or as an assistant professor?

What is the requirement of NET? I am currently in 1st year MTech, AFAIK we are eligible only if we are in final year
MTECH(ie 2nd year) is this right?
net-exam general admissions query

33.22 Operational Research (2)

33.22.1 Operational Research: UGC NET CSE | December 2014 | Part 3 | Question: 68

The occurrence of degeneracy while solving a transportation problem means that

A. Total supply equals total demand B. Total supply does not equal total demand
C. The solution so obtained is not feasible D. ​None of these
ugcnetcse-dec2014-paper3 operational-research transportation-problem

Answer key ☟

33.22.2 Operational Research: UGC NET CSE | September 2013 | Part 3 | Question: 14

An optimal assignment requires that the minimum number of horizontal and vertical lines that can be drawn to
cover all zeros be equal to the number of
A. rows or columns B. rows + columns
C. rows + columns -1 D. rows + columns +1
ugcnetcse-sep2013-paper3 operational-research assignment-problem

Answer key ☟

33.23 Optimization (1)

33.23.1 Optimization: UGC NET CSE | July 2016 | Part 3 | Question: 61

The region of feasible solution of a linear programminig problem has a ____ property in geometry, provided the
feasible solution of the problem exists

A. concavity B. convexity C. quadratic D. polyhedron

ugcnetcse-july2016-paper3 optimization linear-programming

Answer key ☟

33.24 Process Scheduling (1)

33.24.1 Process Scheduling: UGC NET CSE | October 2022 | Part 1 | Question: 60

What is called Journalling in Linux operating system?

A. Process scheduling B. File saving as transaction,
C. A type of thread D. An editor,
ugcnetcse-oct2022-paper1 operating-system process-scheduling

Answer key ☟

33.25 Searching (1)

33.25.1 Searching: UGC NET CSE | December 2014 | Part 3 | Question: 56

An algorithm is a heuristic search technique which

 A. Is like a depth-first search where most promising child is selected for expansion
B. Generates all successor nodes and computes an estimate of distance (cost) from start node to a goal node through
each of the successors. It then chooses the successor with shortest cost.
C. Saves all path lengths (costs) from start node to all generated nodes and chooses shortest path for further expansion.
D. None of the above

ugcnetcse-dec2014-paper3 artificial-intelligence searching

Answer key ☟

33.26 Shell (1)

33.26.1 Shell: UGC NET CSE | June 2012 | Part 3 | Question: 71

Which one of the following is not a shell in UNIX system?

A. Bourne Shell B. C Shell C. Not Shell D. Korn Shell

ugcnetcse-june2012-paper3 unix shell

Answer key ☟

33.27 Shell Script (2)

33.27.1 Shell Script: UGC NET CSE | June 2014 | Part 2 | Question: 35

Which of the following commands will output “onetwothree” ?

A. for val; do echo-n $val; done < one two three

B. for one two three; do echo-n-; done
C. for n in one two three; do echo-n $n; done
D. for n in one two three {echo –n $ n}

ugcnetcse-june2014-paper2 non-gatecse unix shell-script

Answer key ☟

33.27.2 Shell Script: UGC NET CSE | June 2014 | Part 3 | Question: 39

Match the following with reference to Unix shell scripts

A. B.
C. D.
ugcnetjune2014iii unix shell-script

Answer key ☟

33.28 Simplex (1)

33.28.1 Simplex: UGC NET CSE | October 2022 | Part 1 | Question:: 13

Consider the primal problem :

Maximize
Subject to
 its dual problem is
Minimize
Subject to

Which of the following is correct?

A. unrestricted B.
C. is unrestricted, D. is unrestricted. restricted
ugcnetcse-oct2022-paper1 simplex

Answer key ☟

33.29 Simplex Method (2)

33.29.1 Simplex Method: UGC NET CSE | December 2014 | Part 3 | Question: 67

If an artificial variable is present in the ‘basic variable’ column of optimal simplex table, then the solution is
A. Optimum B. Infeasible
C. Unbounded D. Degenerate
ugcnetcse-dec2014-paper3 linear-programming simplex-method

Answer key ☟

33.29.2 Simplex Method: UGC NET CSE | July 2016 | Part 3 | Question: 62

Consider the following statements:

i. Revised simplex method requires lesser computations than the simplex methods
ii. Revised simplex method automatically generates the inverse of the current basis matrix
iii. Less number of entries are needed in each table of the revised simplex method than usual simplex method

Which of these statements is true?

A. i and ii only B. i and iii only
C. ii and iii only D. i, ii, and iii
ugcnetcse-july2016-paper3 optimization simplex-method

Answer key ☟

33.30 System Software& Compilers (1)

33.30.1 System Software& Compilers: UGC NET CSE | July 2016 | Part 2 | Question: 32

The content of the accumulator after the execution of the following 8085 assembly language program, is:
MVI A,
42H
MVI B, 05h
UGC: ADD B
DCR B
JNZ UGC
ADI 25H
 HLT

A. 82 H B. 78 H C. 76 H D. 47 H
ugcnetcse-july2016-paper2 system-software&-compilers

Answer key ☟

33.31 Transportation Problem (1)

33.31.1 Transportation Problem: UGC NET CSE | July 2016 | Part 3 | Question: 63

The following transportation problem :

Has a solution

The above solution of a given transportation problem is

A. Infeasible solution B. optimum solution
C. non-optimum solution D. unbounded solution
ugcnetcse-july2016-paper3 optimization transportation-problem

Answer key ☟

33.32 Unified Modeling Language (1)

33.32.1 Unified Modeling Language: UGC NET CSE | June 2012 | Part 3 | Question: 44

Which diagram provides a formal graphic notation for modelling objects, classes and their relationships to one
another?
A. Object diagram B. Class diagram
C. Instance diagram D. Analysis diagram
ugcnetcse-june2012-paper3 unified-modeling-language

Answer key ☟

33.33 Unix (4)

33.33.1 Unix: UGC NET CSE | July 2016 | Part 2 | Question: 39

In UNIX, ____ creates three subdirectories; 'PIS' and two subdirectories 'progs' and 'data' from just created
subdirectory 'PIS'
A. mkdir PIS/progs PIS/data PIS B. mkdir PIS progs data
C. mkdir PIS PIS/progs PIS/data D. mkdir PIS/progs data
ugcnetcse-july2016-paper2 unix

Answer key ☟

33.33.2 Unix: UGC NET CSE | July 2016 | Part 3 | Question: 52

Which of the following option with reference to UNIX operating system is not correct?

A. INT signal is sent by the terminal driver when one types <Control-C> and it is a request to terminate the current
 operation
B. TERM is a request to terminate execution completely. The receiving process will clean up its state and exit
C. QUIT is similat to TERM, except that it defaults to producing a core dump if not caught.
D. KILL is a blockable signal

ugcnetcse-july2016-paper3 unix

Answer key ☟

33.33.3 Unix: UGC NET CSE | July 2016 | Part 3 | Question: 67

What is the function of following UNIX command?

WC - l<a >b &

A. It runs the word count program to count the number of lines in its input, a, writing the result to b, as a foreground
process
B. It runs the word count program to count the number of lines in its input, a, writing the result to b, but does it in the
background
C. It counts the error during the execution of the process, a, and puts the result in process b
D. It copies the 'l' numbers of lines of program file, a, and stores in file b

ugcnetcse-july2016-paper3 unix

Answer key ☟

33.33.4 Unix: UGC NET CSE | June 2010 | Part 2 | Question: 49

At any given time Parallel Virtual Machine (PVM) has _______ send buffer and ________ receive buffer.

A. One-one B. One-two C. Two-two D. Two-one

ugcnetcse-june2010-paper2 unix

Answer key ☟

33.34 Vertex Cover (1)

33.34.1 Vertex Cover: UGC NET CSE | October 2022 | Part 1 | Question: 56

Consider the following statements of approximation algorithm :

Statement : Vertex-cover is a polynomial time -approximation algorithm.
Statement : -tour is a polynomial time -approximation algorithm for travelling salesman problem with the
triangle inequality.
Which of the following is correct?

A. Statement true and Statement false

B. Statement and Statement true
C. Statement false and Statement true
D. Statement and Statement false

ugcnetcse-oct2022-paper1 algorithms vertex-cover

33.35 Windows (1)

33.35.1 Windows: UGC NET CSE | June 2012 | Part 3 | Question: 69

What is the meaning of ‘Hibernate’ in WindowsXP/Windows 7?

A. Restart the computers in safe mode

B. Restart the computers in normal mode
C. Shutdown the computer terminating all the running applications
 D. Shutdown the computer without closing the running applications

ugcnetcse-june2012-paper3 windows

Answer key ☟

Answer Keys
33.0.1 Q-Q 33.0.2 Q-Q 33.0.3 Q-Q 33.0.4 Q-Q 33.0.5 Q-Q
33.0.6 Q-Q 33.0.7 Q-Q 33.0.8 Q-Q 33.0.9 Q-Q 33.0.10 Q-Q
33.0.11 Q-Q 33.0.12 Q-Q 33.0.13 Q-Q 33.0.14 Q-Q 33.0.15 Q-Q
33.0.16 Q-Q 33.0.17 Q-Q 33.0.18 Q-Q 33.0.19 Q-Q 33.0.20 Q-Q
33.0.21 Q-Q 33.0.22 Q-Q 33.0.23 Q-Q 33.0.24 Q-Q 33.0.25 Q-Q
33.0.26 Q-Q 33.0.27 Q-Q 33.0.28 Q-Q 33.0.29 Q-Q 33.0.30 Q-Q
33.0.31 Q-Q 33.0.32 Q-Q 33.0.33 Q-Q 33.0.34 Q-Q 33.0.35 Q-Q
33.0.36 Q-Q 33.0.37 Q-Q 33.0.38 Q-Q 33.0.39 Q-Q 33.0.40 Q-Q
33.0.41 Q-Q 33.0.42 Q-Q 33.0.43 Q-Q 33.0.44 Q-Q 33.0.45 Q-Q
33.0.46 Q-Q 33.0.47 Q-Q 33.0.48 Q-Q 33.0.49 Q-Q 33.0.50 Q-Q
33.0.51 Q-Q 33.0.52 Q-Q 33.0.53 Q-Q 33.0.54 Q-Q 33.0.55 Q-Q
33.0.56 Q-Q 33.0.57 Q-Q 33.0.58 Q-Q 33.0.59 Q-Q 33.0.60 Q-Q
33.0.61 Q-Q 33.0.62 Q-Q 33.0.63 Q-Q 33.0.64 Q-Q 33.0.65 Q-Q
33.0.66 Q-Q 33.0.67 Q-Q 33.0.68 Q-Q 33.0.69 Q-Q 33.0.70 Q-Q
33.0.71 Q-Q 33.0.72 Q-Q 33.0.73 Q-Q 33.0.74 Q-Q 33.0.75 Q-Q
33.0.76 Q-Q 33.0.77 Q-Q 33.0.78 Q-Q 33.0.79 Q-Q 33.0.80 Q-Q
33.0.81 Q-Q 33.0.82 Q-Q 33.0.83 Q-Q 33.0.84 Q-Q 33.0.85 Q-Q
33.0.86 Q-Q 33.0.87 Q-Q 33.0.88 Q-Q 33.0.89 Q-Q 33.0.90 Q-Q
33.0.91 Q-Q 33.0.92 Q-Q 33.0.93 Q-Q 33.0.94 Q-Q 33.0.95 Q-Q
33.0.96 Q-Q 33.0.97 Q-Q 33.0.98 Q-Q 33.0.99 Q-Q 33.0.100 Q-Q
33.0.101 Q-Q 33.1.1 C 33.2.1 Q-Q 33.3.1 B 33.4.1 A
33.5.1 Q-Q 33.6.1 C 33.7.1 Q-Q 33.8.1 B 33.8.2 Q-Q
33.9.1 B 33.9.2 A 33.9.3 B 33.9.4 B 33.10.1 C
33.11.1 D 33.12.1 Q-Q 33.13.1 C 33.14.1 C 33.14.2 C
33.14.3 D 33.14.4 A 33.14.5 D 33.15.1 Q-Q 33.16.1 C
33.17.1 D 33.18.1 A 33.19.1 Q-Q 33.20.1 C 33.21.1 Q-Q
33.22.1 C 33.22.2 A 33.23.1 B 33.24.1 Q-Q 33.25.1 B
33.26.1 C 33.27.1 C 33.27.2 C 33.28.1 Q-Q 33.29.1 B
33.29.2 D 33.30.1 C 33.31.1 B 33.32.1 A 33.33.1 C
33.33.2 D 33.33.3 B 33.33.4 Q-Q 33.34.1 Q-Q 33.35.1 D
34 Non GATE CSE: Web Technologies (32)

34.1 Activex (1)

34.1.1 Activex: UGC NET CSE | December 2013 | Part 2 | Question: 41

Active X controls are Pentium binary programs that can be embedded in

A. Word pages B. URL pages

C. Script pages D. Web pages
ugcnetcse-dec2013-paper2 web-technologies activex

Answer key ☟

34.2 Client Server Application (1)

34.2.1 Client Server Application: UGC NET CSE | June 2014 | Part 3 | Question: 26

Which one of the following is not a Client-Server application ?

A. Internet chat B. Web browser

C. E-mail D. Ping
ugcnetjune2014iii web-technologies client-server-application

Answer key ☟

34.3 Data Warehousing (1)

34.3.1 Data Warehousing: UGC NET CSE | December 2014 | Part 2 | Question: 47

Fact-less fact table in a data warehouse contains

A. Only measures B. Only dimensions
C. Keys and measures D. Only surrogate keys
ugcnetcse-dec2014-paper2 data-warehousing

Answer key ☟

34.4 E Commerce (1)

34.4.1 E Commerce: UGC NET CSE | December 2014 | Part 2 | Question: 48

Which e-business model allows consumers to name their own price for products and services ?

A. B. C. D.
ugcnetcse-dec2014-paper2 e-commerce

Answer key ☟

34.5 Edi Layer (2)

34.5.1 Edi Layer: UGC NET CSE | December 2013 | Part 2 | Question: 44

The document standards for EDI were first developed by large business house during the 1970s and are now
under the control of the following standard organization.

A. ISO B. ANSI C. ITU-T D. IEEE

ugcnetcse-dec2013-paper2 e-commerce edi-layer

Answer key ☟

34.5.2 Edi Layer: UGC NET CSE | December 2013 | Part 2 | Question: 45

Electronic Data Interchange Software consists of the following four layers:

 A. Business application, Internal format conversion, Network translator, EDI envelop
B. Business application, Internal format conversion, EDI translator, EDI envelop
C. Application layer, Transport layer, EDI translator, EDI envelop
D. Application layer, Transport layer, IP layer, EDI envelop

ugcnetcse-dec2013-paper2 e-commerce edi-layer

Answer key ☟

34.6 Html (5)

34.6.1 Html: UGC NET CSE | August 2016 | Part 3 | Question: 41

Which of the following tag in HTML is used to surround information, such as signature of the person who
created the page?
A. <body></body> B. <address></address>
C. <strong></strong> D. <em></em>
ugcnetcse-aug2016-paper3 web-technologies html

Answer key ☟

34.6.2 Html: UGC NET CSE | December 2012 | Part 3 | Question: 66

Match the following with respect to HTML tags and usage

A. B.
C. D.
ugcnetcse-dec2012-paper3 web-technologies html

Answer key ☟

34.6.3 Html: UGC NET CSE | January 2017 | Part 3 | Question: 41

Which of the following HTML code will affect the vertical alignment of the table content?

A. <td style="vertical-align:middle"> Text Here </td>

B. <td valign="centre"> Text Here </td>

C. <td style="text-align:center"> Text Here </td>

D. <td align="middle"> Text Here </td>

ugcnetcse-jan2017-paper3 web-technologies html

Answer key ☟

34.6.4 Html: UGC NET CSE | July 2016 | Part 3 | Question: 41

Which of the following statements is not correct?

A. HTML is not screen precise formatting language

B. HTML does not specify a logic
C. DHTML is used to developing highly interacting webpages
D. HTML is a programming language
 ugcnetcse-july2016-paper3 html web-technologies

Answer key ☟

34.6.5 Html: UGC NET CSE | June 2012 | Part 3 | Question: 68

HTML is defined using SGML – an _____ standard, information processing-text and office systems (SGML)
for text information processing.

A. ISO-8878 B. ISO-8879 C. ISO-8880 D. ISO-8881

ugcnetcse-june2012-paper3 web-technologies html

Answer key ☟

34.7 Javascript (2)

34.7.1 Javascript: UGC NET CSE | December 2015 | Part 3 | Question: 34

Javascript and Java have similar name because

i. Javascript syntax is loosely based on Java's syntax

ii. Javascript is stripped down version of Java
iii. Java and Javascript are originated from island of Java
A. i only B. i, ii, and iii C. i and ii D. i and iii
ugcnetcse-dec2015-paper3 web-technologies javascript

Answer key ☟

34.7.2 Javascript: UGC NET CSE | July 2018 | Part 2 | Question: 1

Consider the JavaScript Code:

var y=”12”
function f() {
var y=”6”;
alert (this.y);
function g() {alert (y); }
g();
}
f();

If is the number of alert dialog boxes generated by this JavaScript code and D1, D2, , represents the content
displayed in the each of the dialog boxes, then:

A. M=3; D1 displays “12”; D2 displays “6”; D3 displays “12”

B. M=3; D1 displays”6”; D2 displays “12”; D3 displays “6”
C. M=2; D1 displays”6”; D2 displays “12”.
D. M=3; D1 displays”12”; D2 displays “6”

ugcnetcse-july2018-paper2 javascript web-technologies

Answer key ☟

34.8 Non Gatecse (1)

34.8.1 Non Gatecse: UGC NET CSE | June 2012 | Part 2 | Question: 9

What deletes the entire file except the file structure?

A. ERASE B. DELETE C. ZAP D. PACK

ugcnetcse-june2012-paper2 databases non-gatecse

Answer key ☟

34.9 Transmission Media (1)

 34.9.1 Transmission Media: UGC NET CSE | December 2012 | Part 2 | Question: 28

Identify the Risk factors which are associated with Electronic payment system
A. Fraudulent use of credit card B. Sending credit card details over internet
C. Remote storage of credit card details D. All of the above
ugcnetcse-dec2012-paper2 computer-networks transmission-media

Answer key ☟

34.10 Trojan Horse (1)

34.10.1 Trojan Horse: UGC NET CSE | December 2014 | Part 3 | Question: 74

A Trojan horse is

A. A program that performs a legitimate function that is known to an operating system or its user and also has a hidden
component that can be used for nefarious purposes like attacks on message security or impersonation.
B. A piece of code that can attach itself to other programs in the system and spread to other systems when programs are
copied or transferred.
C. A program that spreads to other computer systems by exploiting security holes like weaknesses in facilities for
creation of remote processes
D. All of the above

ugcnetcse-dec2014-paper3 trojan-horse

Answer key ☟

34.11 Web Technologies (8)

34.11.1 Web Technologies: UGC NET CSE | December 2013 | Part 3 | Question: 13

The document that is used by XSLT to indicate, how to transform the elements of the XML document to
another format is
A. HTML page B. DOC type procedure
C. Style sheet D. Stored procedure
ugcnetcse-dec2013-paper3 web-technologies

Answer key ☟

34.11.2 Web Technologies: UGC NET CSE | December 2015 | Part 3 | Question: 75

__________ tag is an extension to HTML that can enclose any number of Javascript statements.
A. <SCRIPT> B. <BODY>
C. <HEAD> D. <TITLE>
ugcnetcse-dec2015-paper3 web-technologies

Answer key ☟

34.11.3 Web Technologies: UGC NET CSE | January 2017 | Part 3 | Question: 42

What can you say about the following statements?

I. XML tags are case-insensitive

II. In JavaScript, identifier names are case-sensitive
III. Cascading Style Sheets (CSS) cannot be used with XML
IV. All well formed XML documents must contain a document type definition

A. only I and II are false B. only III and IV are false

C. only I and III are false D. only II and IV are false
ugcnetcse-jan2017-paper3 web-technologies programming

Answer key ☟
 34.11.4 Web Technologies: UGC NET CSE | June 2012 | Part 2 | Question: 42

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 classical manner
C. E-Commerce opens up and entirely new world web server
D. E-Commerce security threats can be grouped into three major categories

non-gatecse web-technologies ugcnetcse-june2012-paper2

Answer key ☟

34.11.5 Web Technologies: UGC NET CSE | June 2012 | Part 2 | Question: 44

_______ is not an E-Commerce application

A. House banking B. Buying stocks

C. Conducting an auction D. Evaluating an employee
non-gatecse web-technologies ugcnetcse-june2012-paper2

Answer key ☟

34.11.6 Web Technologies: UGC NET CSE | June 2014 | Part 3 | Question: 54

Linking to another place in the same or another webpage require two A (Anchor) tags, the first with the _______
attribute and the second with the _______ attribute.
A. NAME & LINK B. LINK & HREF
C. HREF & NAME D. TARGET & VALUE
ugcnetjune2014iii web-technologies

Answer key ☟

34.11.7 Web Technologies: UGC NET CSE | June 2019 | Part 2 | Question: 25

Which of the following statements is/are true?

P : In a scripting language like JacaScript, types are typically associated with values, not variables.
Q : It is not possible to show images on a web page without the <img> tag of HTML.
Select the correct answer from the options given below:

A. P only B. Q only C. Both P and Q D. Neither P nor Q

ugcnetcse-june2019-paper2 web-technologies

Answer key ☟

34.11.8 Web Technologies: UGC NET CSE | October 2020 | Part 2 | Question: 10

In HTML, tag is used for

A. defining a path between two nodes in an image B. defining clickable region in an image
C. highlighting an area in an image D. defining the site-map of a web-site
ugcnetcse-oct2020-paper2 non-gatecse web-technologies

Answer key ☟

34.12 Xml (7)

34.12.1 Xml: UGC NET CSE | December 2014 | Part 3 | Question: 40

The behaviour of the document elements in can be defined by

A. Using document object B. Registering appropriate event handlers
 C. Using element object D. All of the above
ugcnetcse-dec2014-paper3 web-technologies xml

Answer key ☟

34.12.2 Xml: UGC NET CSE | December 2015 | Part 3 | Question: 35

Which of the following statements are true with reference to the way of describing XML data?

i. XML uses DTD to describe the data

ii. XML uses XSL to describe the data
iii. XML uses a description node to describe the data
A. B. C. D.
ugcnetcse-dec2015-paper3 web-technologies xml

Answer key ☟

34.12.3 Xml: UGC NET CSE | July 2018 | Part 2 | Question: 2

The definitions in an XML document are said to be ______ when the tagging system ans definitions in the DTD
are all in compliance

A. well-formed B. reasonable C. valid D. logical

ugcnetcse-july2018-paper2 xml web-technologies

Answer key ☟

34.12.4 Xml: UGC NET CSE | June 2019 | Part 2 | Question: 26

Which of the following statements is/are true?

P : An XML document with correct syntax as specified by W3C is called “Well Formed”.
Q : An XML documented validated against a DTD is both “Well formed” and “valid”.
R : <xml version=”1.0” encoding =”UTF-8”>
is syntactly correct declaration for the version of an XML document.
Select the correct answer from the options given below:

A. P and Q only B. P and R only C. Q and R only D. All of P, Q and R

ugcnetcse-june2019-paper2 xml

Answer key ☟

34.12.5 Xml: UGC NET CSE | Junet 2015 | Part 3 | Question: 40

In XML we can specify the frequency of an element by using the symbols:

A. +*! B. #*! C. +*? D. -*?

ugcnetcse-june2015-paper3 web-technologies xml

Answer key ☟

34.12.6 Xml: UGC NET CSE | Junet 2015 | Part 3 | Question: 41

In XML, DOCTYPE declaration specifies to include a reference to ____ file

A. Document type Definition B. Document type declaration
C. Document transfer definition D. Document type language
ugcnetcse-june2015-paper3 web-technologies xml

Answer key ☟
 34.12.7 Xml: UGC NET CSE | September 2013 | Part 2 | Question: 38

The _____ language was originally designed as the Transformation Language for Style Sheet Facility

A. XSTL B. XML C. XQuery D. XPath

ugcnetsep2013ii web-technologies xml html

Answer key ☟

34.13 Xsl (1)

34.13.1 Xsl: UGC NET CSE | December 2012 | Part 3 | Question: 61

Which one is a collection of templates and rules?

A. XML B. CSS C. DHTML D. XSL

ugcnetcse-dec2012-paper3 web-technologies xsl

Answer key ☟

Answer Keys
34.1.1 D 34.2.1 B 34.3.1 B 34.4.1 D 34.5.1 B
34.5.2 B 34.6.1 Q-Q 34.6.2 A 34.6.3 A 34.6.4 D
34.6.5 B 34.7.1 C 34.7.2 Q-Q 34.8.1 C 34.9.1 D
34.10.1 A 34.11.1 C 34.11.2 B 34.11.3 X 34.11.4 D
34.11.5 D 34.11.6 C 34.11.7 A 34.11.8 B 34.12.1 D
34.12.2 B 34.12.3 Q-Q 34.12.4 A 34.12.5 C 34.12.6 A
34.12.7 A 34.13.1 D
35 Operating System (232)

35.0.1 UGC NET CSE | December 2015 | Part 3 | Question: 42

In an operating system, indivisibility of operation means:

A. Operation is interruptable B. Race Condition may occur
C. processor can not be prempted D. All of the above
ugcnetcse-dec2015-paper3 operating-system

Answer key ☟

35.0.2 UGC NET CSE | December 2015 | Part 3 | Question: 41

Match the following in Unix file system :

A. B.
C. D.
operating-system ugcnetcse-dec2015-paper3

Answer key ☟

35.0.3 UGC NET CSE | June 2014 | Part 2 | Question: 45

Which of the following is the correct value returned to the operating system upon the successful completion of a
program ?
A. 0 B. 1
C. -1 D. Program do not return a value.
ugcnetcse-june2014-paper2 operating-system

Answer key ☟

35.0.4 UGC NET CSE | June 2012 | Part 3 | Question: 56

____ is sometimes said to be object oriented, because the only way to manipulate kernel objects is by invoking
methods on their handles.

A. Windows NT B. Windows XP
C. Windows VISTA D. Windows 95/98
ugcnetcse-june2012-paper3 operating-system

Answer key ☟

35.0.5 UGC NET CSE | June 2014 | Part 3 | Question: 24

Match the following

 A. B.
C. D.
ugcnetjune2014iii operating-system

Answer key ☟

35.0.6 UGC NET CSE | December 2012 | Part 3 | Question: 3

Match the following :

A. B.
C. D.
ugcnetcse-dec2012-paper3 operating-system match-the-following

Answer key ☟

35.0.7 UGC NET CSE | June 2013 | Part 3 | Question: 59

A job has four pages A, B, C, D and the main memory has two page frames only. The job needs to process its
pages in following order:
ABACABDBACD
Assuming that the page interrupt occurs when a new page is brought in the main memory, irrespective of whether the
page is swapped out or not. The number of page interrupts in FIFO and LRU page replacement algorithms are

A. 9 and 7 B. 7 and 6 C. 9 and 8 D. 8 and 6

ugcnetcse-june2013-paper3 operating-system paging

Answer key ☟

35.0.8 UGC NET CSE | September 2013 | Part 3 | Question: 23

Match the following

A. B.
C. D.
ugcnetcse-sep2013-paper3 operating-system page-fault

Answer key ☟

35.0.9 UGC NET CSE | December 2014 | Part 2 | Question: 39

For the implementation of a paging scheme, suppose the average process size be bytes, the page size be
bytes, and each page entry requires bytes. The optimum page size that minimizes the total overhead due to the
page table and the internal fragmentation loss is given by

A. B. C. D.
ugcnetcse-dec2014-paper2 operating-system paging

Answer key ☟
35.0.10 UGC NET CSE | December 2014 | Part 2 | Question: 40

In a demand paging memory system, page table is held in registers. The time taken to service a page fault is
m.sec. if an empty frame is available or if the replaced page is not modified, and it takes m.secs., if the
replaced page is modified. What is the average access time to service a page fault assuming that the page to be replaced
is modified % of the time ?
A. m.sec. B. m.sec.
C. m.sec. D. m.sec.
ugcnetcse-dec2014-paper2 operating-system demand-paging

Answer key ☟

35.0.11 UGC NET CSE | December 2013 | Part 2 | Question: 47

The virtual address generated by a CPU is 32 bits. The Translation Look-aside Buffer (TLB) can hold total 64
page table entries and a 4-way set associative (i.e. with 4-cache lines in the set). The page size is 4 KB. The
minimum size of TLB tag is

A. 12 bits B. 15 bits C. 16 bits D. 20 bits

ugcnetcse-dec2013-paper2 operating-system translation-lookaside-buffer

Answer key ☟

35.0.12 UGC NET CSE | Junet 2015 | Part 3 | Question: 49

Match the following for operating system techniques with the most appropriate advantage :

A. B.
C. D.
ugcnetcse-june2015-paper3 operating-system

Answer key ☟

35.0.13 UGC NET CSE | Junet 2015 | Part 3 | Question: 52

Dining Philosopher's problem is a

A. Producer - consumer problem B. Classical IPC problem
C. Starvation problem D. Synchronization primitive
ugcnetcse-june2015-paper3 operating-system

Answer key ☟

35.0.14 UGC NET CSE | December 2015 | Part 2 | Question: 27

Suppose that the number of instructions executed between page fault is directly proportional to the number of
page frames allocated to a program. If the available memory is doubled, the mean interval between the page
faults is also doubled. Further, consider that a normal instruction takes one microsecond, but if a page fault occurs, it
takes 2001 microseconds. If a program takes 60 sec to run, during which time it gets 15,000 page faults, how long
would it take to run twice as much memory were available?

A. 60 sec B. 30 sec C. 45 sec D. 10 sec

ugcnetcse-dec2015-paper2 operating-system page-fault
 Answer key ☟

35.0.15 UGC NET CSE | December 2015 | Part 2 | Question: 29

A system has 4 processes and 5 allocatable resources. The current allocation and maximum needs are as follows:
Allocated Maximum Available
Process A 1 0 2 1 1 1 1 2 1 3 00x11
Process B 2 0 1 1 0 2 2 2 1 0
Process C 1 1 0 1 0 2 1 3 1 0
Process D 1 1 1 1 0 1 1 2 2 1
The smallest value of x for which the above system in safe state is

A. 1 B. 3 C. 2 D. 0
ugcnetcse-dec2015-paper2 operating-system

Answer key ☟

35.0.16 UGC NET CSE | December 2015 | Part 3 | Question: 39

Consider a system with twelve magnetic tape drives and three processes and . process requires
maximum ten tape drives, process may need as many as four tape drives and may need upto nine tape
drives. Suppose that at time , process is holding five tape drives, process is holding two tape drives and process
is holding three tape drives, At time , system is in:
A. safe state B. unsafe state
C. deadlocked state D. starvation state
ugcnetcse-dec2015-paper3 operating-system

Answer key ☟

35.0.17 UGC NET CSE | July 2016 | Part 2 | Question: 37

Suppose there are processes in execution with instances of a Resource in a system.

The maximum need of each process and current allocation are given below :

With reference to current allocation, is system safe? If so, what is the safe sequence?
A. No B. Yes,
C. Yes, D. Yes,
ugcnetcse-july2016-paper2 operating-system

Answer key ☟

35.0.18 UGC NET CSE | December 2010 | Part 2 | Question: 19

Optical storage is a

A. High-speed direct access storage device.

B. Low-speed direct access storage device.
C. Medium-speed direct access storage device.
D. High-speed sequential access storage device.

ugcnetcse-dec2010-paper2 operating-system
 Answer key ☟

35.0.19 UGC NET CSE | December 2010 | Part 2 | Question: 39

Page making process from main memory to disk is called

A. Interruption B. Termination C. Swapping D. None of the above

ugcnetcse-dec2010-paper2 operating-system paging

35.0.20 UGC NET CSE | June 2010 | Part 2 | Question: 36

Match the following :

A. B.
C. D.
ugcnetcse-june2010-paper2 operating-system match-the-following easy

Answer key ☟

35.0.21 UGC NET CSE | June 2010 | Part 2 | Question: 40

Remote Computing Service involves the use of time sharing and _______.

A. Multi-processing

B. Interactive processing

C. Batch processing

D. Real-time processing
ugcnetcse-june2010-paper2 operating-system

Answer key ☟

35.0.22 UGC NET CSE | August 2016 | Part 3 | Question: 51

An operating system supports a paged virtual memory, using a central processor with a cycle time of one
microsecond. It costs an additional one microsecond to access a page other than the current one. Pages have
words, and the paging device is a drum that rotates at revolutions per minute and transfers one million words per
second. Further, one percent of all instructions executed accessed a page other than the current page. The instruction that
accessed another page, % accessed a page already in memory and when a new page was required, the replaced page
was modified % of the time. What is the effective access time on this system, assuming that the system is running
only one process and the processor is idle during drum transfers ?

A. microseconds B. microseconds
C. microseconds D. microseconds
ugcnetcse-aug2016-paper3 operating-system paging

Answer key ☟

35.0.23 UGC NET CSE | August 2016 | Part 3 | Question: 52

Consider the following page reference string :

Which of the following options, gives the correct number of page faults related to LRU, FIFO, and optimal page
replacement algorithms respectively, assuming page frames and all frames are initially empty ?
 A. B. C. D.
ugcnetcse-aug2016-paper3 operating-system page-fault

Answer key ☟

35.0.24 UGC NET CSE | December 2009 | Part 2 | Question: 37

A page fault

(A) is an error specific page.

(B) is an access to the page not currently in memory.
(C) occur when a page program occur in a page memory.
(D) page used in the previous page reference
ugcnetcse-dec2009-paper2 operating-system page-fault

Answer key ☟

35.0.25 UGC NET CSE | June 2009 | Part 2 | Question: 10

Assume segments in memory and a page size of bytes. The wastage on account of internal fragmentation is
:

1. bytes
2. bytes
3. bytes
4. bytes

ugcnetcse-june2009-paper2

Answer key ☟

35.0.26 UGC NET CSE | June 2009 | Part 2 | Question: 38

Variable partition memory management technique with compaction results in :

A. Reduction of fragmentation B. Minimal wastage
C. Segment sharing D. None of the above
ugcnetcse-june2009-paper2

35.0.27 UGC NET CSE | November 2017 | Part 3 | Question: 52

Consider a system with five processes through and three resource types and . Resource type has
seven instances, resource type has two instances and resource type has six instances suppose at time we
have the following allocation.

If we implement Deadlock detection algorithm we claim that system is ________

 A. Semaphore B. Deadlock state
C. Circular wait D. Not in deadlock state
ugcnetcse-nov2017-paper3

Answer key ☟

35.0.28 UGC NET CSE | July 2018 | Part 2 | Question: 58

Consider a virtual page reference string 1, 2, 3, 2, 4, 2, 5, 2, 3, 4. Suppose LRU page replacement algorithm is
implemented with 3 page frames in main memory. Then the number of page faults are _____

A. 5 B. 7 C. 9 D. 10
ugcnetcse-july2018-paper2 operating-system page-fault paging

Answer key ☟

35.0.29 UGC NET CSE | July 2018 | Part 2 | Question: 57

Page information memory is also called as Page Table. The essential contents in each entry of a page table is/are
____
A. Page Access information B. Virtual Page number
C. Page Frame number D. Both virtual page number and Page frame number
ugcnetcse-july2018-paper2 operating-system paging

Answer key ☟

35.0.30 UGC NET CSE | July 2018 | Part 2 | Question: 53

In a multi-user operating system, 30 requests are made to use a particular resource per hour, on an average. The
probability that no requests are made in 40 minutes, when arrival pattern is a poisson distribution, is ______

A. B. C. D.
ugcnetcse-july2018-paper2 operating-system

Answer key ☟

35.0.31 UGC NET CSE | July 2018 | Part 2 | Question: 52

In a paged memory, the page hit ratio is 0.40. The time required to access a page in secondary memory is equal
to 120 ns. The time required to access a page in primary memory is 15 ns. The average time required to access a
page is ____

A. 105 B. 68 C. 75 D. 78
ugcnetcse-july2018-paper2 operating-system paging

Answer key ☟

35.0.32 UGC NET CSE | December 2018 | Part 2 | Question: 74

​Suppose and are co-operating processes satisfying Mutual Exclusion condition. Then, if the process
is executing in its critical section then

A. Both and execute in critical section

B. Neither nor executes in their critical section
C. executes in critical section
D. executes in critical section

ugcnetcse-dec2018-paper2 operating-system

Answer key ☟
35.0.33 UGC NET CSE | January 2017 | Part 2 | Question: 40

Distributed operating systems consist of:

A. Loosely coupled O.S. software on a loosely coupled hardware.

B. Loosely coupled O.S. software on a tightly coupled hardware.
C. Tightly coupled O.S. software on a loosely coupled hardware.
D. Tightly coupled O.S. software on a tightly coupled hardware.

ugcnetjan2017ii operating-system

Answer key ☟

35.0.34 UGC NET CSE | January 2017 | Part 2 | Question: 37

In a paging system, it takes ns to search translation Look-a-side Buffer (TLB) and ns to access the main
memory. If the TLB hit ratio is , the effective memory access time is :

A. ns B. ns C. ns D. ns
ugcnetjan2017ii operating-system paging

Answer key ☟

35.0.35 UGC NET CSE | January 2017 | Part 3 | Question: 66

Names of some of the Operating Systems are given below:

i. MS-DOS
ii. XENIX
iii. OS/

In the above list, following operating systems didn’t provide multiuser facility.
A. (i) only B. (i) and (ii)only
C. (ii) and (iii) only D. (i),(ii) and (iii)
ugcnetcse-jan2017-paper3 operating-system

Answer key ☟

35.0.36 UGC NET CSE | December 2004 | Part 2 | Question: 40

Match the following

A. B.
C. D.
ugcnetcse-dec2004-paper2 operating-system match-the-following

Answer key ☟

35.0.37 UGC NET CSE | December 2004 | Part 2 | Question: 38

Remote computing system involves the use of timesharing systems and :

A. Real time processing B. Batch processing
C. Multiprocessing D. All of the above
ugcnetcse-dec2004-paper2

Answer key ☟
35.0.38 UGC NET CSE | December 2004 | Part 2 | Question: 37

In which of the following storage replacement strategies, is a program placed in the largest available hole in the
memory ?

A. Best fit B. First fit C. Worst fit D. Buddy

ugcnetcse-dec2004-paper2

Answer key ☟

35.0.39 UGC NET CSE | December 2004 | Part 2 | Question: 36

Semaphores are used to :

A. Synchronise critical resources to prevent deadlock B. Synchronise critical resources to prevent contention
C. Do I/o D. Facilitate memory management
ugcnetcse-dec2004-paper2

Answer key ☟

35.0.40 UGC NET CSE | December 2006 | Part 2 | Question: 40

Loading operating system from secondary memory to primary memory is called ____________ .

A. Compiling B. Booting C. Refreshing D. Reassembling

ugcnetcse-dec2006-paper2 operating-system

Answer key ☟

35.0.41 UGC NET CSE | December 2006 | Part 2 | Question: 36

An operating system is :
A. Collection of hardware components B. Collection of input-output devices
C. Collection of software routines D. All the above
ugcnetcse-dec2006-paper2 operating-system

Answer key ☟

35.0.42 UGC NET CSE | December 2007 | Part 2 | Question: 40

The aging algorithm with a = is used to predict run times. The previous four runs from oldest to most recent
are and msec. The prediction for the next time will be :

A. msec. B. msec. C. msec. D. msec.

ugcnetcse-dec2007-paper2

Answer key ☟

35.0.43 UGC NET CSE | December 2007 | Part 2 | Question: 38

Average process size = bytes. Each page entry requires bytes. The optimum page size is given by :

A. B. C. D.
ugcnetcse-dec2007-paper2

Answer key ☟

35.0.44 UGC NET CSE | December 2007 | Part 2 | Question: 37

A program has five virtual pages, numbered from to . If the pages are referenced in the order ,
with three page frames, the total number of page faults with FIFO will be equal to :
 A. B. C. D.
ugcnetcse-dec2007-paper2

Answer key ☟

35.0.45 UGC NET CSE | December 2007 | Part 2 | Question: 36

How many states can a process be in ?

A. B. C. D.
ugcnetcse-dec2007-paper2

Answer key ☟

35.0.46 UGC NET CSE | December 2007 | Part 2 | Question: 25

The performance of a file system depends upon the cache hit rate. If it takes msec to satisfy a request from the
cache but msec to satisfy a request if a disk read is needed, then the mean time (ms) required for a hit rate
is given by :

A. B. C. D.
ugcnetcse-dec2007-paper2

Answer key ☟

35.0.47 UGC NET CSE | October 2020 | Part 2 | Question: 18

Consider a single-level page table system, with the page table stored in the memory. If the hit rate to TLB is
, and it takes nanoseconds to search the , and nanoseconds to access the main memory, then
what is the effective memory access time, in nanoseconds?

A. B. C. D.
ugcnetcse-oct2020-paper2 operating-system translation-lookaside-buffer

Answer key ☟

35.0.48 UGC NET CSE | October 2022 | Part 1 | Question: 59

Match List I with List II :

Choose the correct answer from the options given below :

A. B.
C. D.
ugcnetcse-oct2022-paper1 operating-system

Answer key ☟

35.0.49 UGC NET CSE

Given as 4 GB (4.3X10^9 bytes) of virtual space and typical page size of 4KB and each page table entry is 5
bytes. How many virtual pages would this imply? What is the size of the whole page table?
 OPTIONS:

1. 107500 and 20480 bytes

2. 215000 and 40960 bytes

3. 10750 and 10240 bytes

4. 43000 and 1024 bytes

operating-system

35.1 Applications In Windows (1)

35.1.1 Applications In Windows: UGC NET CSE | December 2012 | Part 3 | Question: 35

In Win32, which function is used to create Windows Applications?

A. Win APP B. Win API C. Win Main D. Win Void

ugcnetcse-dec2012-paper3 applications-in-windows operating-system non-gatecse

Answer key ☟

35.2 Bankers Algorithm (3)

35.2.1 Bankers Algorithm: UGC NET CSE | December 2005 | Part 2 | Question: 40

Banker's algorithm is used for __________ purpose :

A. Deadlock avoidance B. Deadlock removal
C. Deadlock prevention D. Deadlock continuations
ugcnetcse-dec2005-paper2 deadlock-prevention-avoidance-detection bankers-algorithm

Answer key ☟

35.2.2 Bankers Algorithm: UGC NET CSE | June 2005 | Part 2 | Question: 38

Banker's algorithm is for

A. Dead lock Prevention B. Dead lock Avoidance
C. Dead lock Detection D. Dead lock creation
ugcnetcse-june2005-paper2 operating-system bankers-algorithm

Answer key ☟

35.2.3 Bankers Algorithm: UGC NET CSE | June 2013 | Part 3 | Question: 61

An operating system using banker’s algorithm for deadlock avoidance has ten dedicated devices (of same type)
and has three processes P1, P2 and P3 with maximum resource requirements of 4, 5 and 8 respectively. There
are two states of allocation of devices as follows:
State 1 Processes P1 P2 P3
Devices allocated 2 3 4
State 2 Processes P1 P2 P3
Devices allocated 0 2 4
Which of the following is correct?

A. State 1 is unsafe and State 2 is safe B. State 1 is safe and State 2 is unsafe
C. Both State 1 and State 2 are safe D. Both State 1 and State 2 are unsafe
ugcnetcse-june2013-paper3 operating-system bankers-algorithm deadlock-prevention-avoidance-detection

Answer key ☟

35.3 Binary Semaphore (1)

 35.3.1 Binary Semaphore: UGC NET CSE | June 2010 | Part 2 | Question: 39

In order to allow only one process to enter its critical section, binary semaphore are initialized to

A. B. C. D.
ugcnetcse-june2010-paper2 operating-system binary-semaphore

Answer key ☟

35.4 Counting Semaphores (1)

35.4.1 Counting Semaphores: UGC NET CSE | June 2019 | Part 2 | Question: 46

At a particular time of computation, the value of a counting semaphore is . Then (wait) operations and
(signal) operations are completed on this semaphore. What is the resulting value of the semaphore?

A. B. C. D.
ugcnetcse-june2019-paper2 counting-semaphores

Answer key ☟

35.5 Critical Section (1)

35.5.1 Critical Section: UGC NET CSE | December 2014 | Part 2 | Question: 38

Which of the following conditions does not hold good for a solution to a critical section problem ?

A. No assumptions may be made about speeds or the number of 's.

B. No two processes may be simultaneously inside their critical sections.
C. Processes running outside its critical section may block other processes.
D. Processes do not wait forever to enter its critical section.

ugcnetcse-dec2014-paper2 operating-system critical-section

Answer key ☟

35.6 Deadlock Prevention Avoidance Detection (9)

35.6.1 Deadlock Prevention Avoidance Detection: UGC NET CSE | August 2016 | Part 2 | Question: 36

Consider a system with seven processes through and six resources through .
Resource ownership is as follows :
process holds and wants
process holds nothing but wants
process holds nothing but wants
process holds and wants &
process holds and wants
process holds and wants
process holds and wants
Is the system deadlocked ? If yes, _______ processes are deadlocked.

A. No B. Yes, C. Yes, D. Yes,

ugcnetcse-aug2016-paper2 operating-system deadlock-prevention-avoidance-detection

Answer key ☟
35.6.2 Deadlock Prevention Avoidance Detection: UGC NET CSE | August 2016 | Part 2 | Question: 38

Consider a system having ‘m’ resources of the same type. These resources are shared by three processes
and which have peak demands of and resources respectively. For what value of deadlock will not
occur ?

A. B. C. D.
ugcnetcse-aug2016-paper2 operating-system deadlock-prevention-avoidance-detection

Answer key ☟

35.6.3 Deadlock Prevention Avoidance Detection: UGC NET CSE | August 2016 | Part 3 | Question: 50

Consider a system which have number of processes and number of resource types. The time complexity
of the safety algorithm, which checks whether a system is in safe state or not, is of the order of :

A. B. C. D.
ugcnetcse-aug2016-paper3 operating-system deadlock-prevention-avoidance-detection

Answer key ☟

35.6.4 Deadlock Prevention Avoidance Detection: UGC NET CSE | December 2010 | Part 2 | Question: 40

A Dead-lock in an Operating System is

A. Desirable process B. Undesirable process
C. Definite waiting process D. All of the above
ugcnetcse-dec2010-paper2 operating-system deadlock-prevention-avoidance-detection

Answer key ☟

35.6.5 Deadlock Prevention Avoidance Detection: UGC NET CSE | December 2011 | Part 2 | Question: 26

Dijikstra banking algorithm in an operating system, solves the problem of

A. Deadlock avoidance B. Deadlock recovery
C. Mutual exclusion D. Context switching
ugcnetcse-dec2011-paper2 operating-system deadlock-prevention-avoidance-detection

Answer key ☟

35.6.6 Deadlock Prevention Avoidance Detection: UGC NET CSE | December 2013 | Part 3 | Question: 71

Simplest way of deadlock recovery is

A. Roll back B. Preempt resource
C. Lock one of the processes D. Kill one of the processes
ugcnetcse-dec2013-paper3 operating-system deadlock-prevention-avoidance-detection

Answer key ☟

35.6.7 Deadlock Prevention Avoidance Detection: UGC NET CSE | December 2014 | Part 3 | Question: 52

An operating system has tape drives. There are three processes & . Maximum requirement of
is tape drives, is tape drives and is tape drives. Currently, is allocated tape drives, is
allocated tape drives and is allocated tape drives. Which of the following sequences represent a safe state?

1.
2.
3.
4.

ugcnetcse-dec2014-paper3 operating-system deadlock-prevention-avoidance-detection

Answer key ☟
 35.6.8 Deadlock Prevention Avoidance Detection: UGC NET CSE | December 2018 | Part 2 | Question: 70

​Suppose a system has instances of some resource with processes competing for that resource. Each process
may require instances of the resources. The maximum value of for which the system never enters into
deadlock is

A. B. C. D.
ugcnetcse-dec2018-paper2 operating-system deadlock-prevention-avoidance-detection

Answer key ☟

35.6.9 Deadlock Prevention Avoidance Detection: UGC NET CSE | June 2019 | Part 2 | Question: 48

A computer has six tape drives with processes competing for them. Each process may need two drives. What
is the maximum value of for the system to be deadlock free?

A. B. C. D.
ugcnetcse-june2019-paper2 deadlock-prevention-avoidance-detection

Answer key ☟

35.7 Delay (1)

35.7.1 Delay: UGC NET CSE | July 2016 | Part 3 | Question: 53

A Multicomputer with 256 CPUs is organized as 16 16 grid . What is the worst case delay(in hops) that a
message might have to take

A. 16 B. 15 C. 32 D. 30
ugcnetcse-july2016-paper3 operating-system delay

Answer key ☟

35.8 Dijkstras Bankers Algorithm (1)

35.8.1 Dijkstras Bankers Algorithm: UGC NET CSE | September 2013 | Part 3 | Question: 69

A system contains units of resource of same type. The resource requirement and current allocation of these
resources for three processes and are as follows

Now, consider the following resource requests:

i. makes a request for resource units

ii. makes request for resource units
iii. makes a request for resource units

For a safe state, which of the following options must be satisfied?

A. Only request B. Only request
C. Only request D. Request and
ugcnetcse-sep2013-paper3 operating-system dijkstras-bankers-algorithm

Answer key ☟

35.9 Directory Structure (1)

35.9.1 Directory Structure: UGC NET CSE | December 2014 | Part 2 | Question: 23

The directory can be viewed as _______ that translates filenames into their directory entries.
 A. Symbol table B. Partition C. Swap space D. Cache
ugcnetcse-dec2014-paper2 operating-system file-system directory-structure

Answer key ☟

35.10 Disk (10)

35.10.1 Disk: UGC NET CSE | December 2013 | Part 2 | Question: 49

How much space will be required to store the bit map of a 1.3 GB disk with 512 bytes block size?
A. 332.8 KB
B. 83.6 KB
C. 266.2 KB
D. 256.6 KB

operating-system disk ugcnetcse-dec2013-paper2

Answer key ☟

35.10.2 Disk: UGC NET CSE | December 2015 | Part 2 | Question: 28

Consider a disk with 16384 bytes per track having a rotation time of 16 msec and average seek time of 40 msec.
What is the time in msec to read a block of 1024 bytes from this disk?

A. 57 msec B. 49 msec C. 48 msec D. 17 msec

ugcnetcse-dec2015-paper2 operating-system disk

Answer key ☟

35.10.3 Disk: UGC NET CSE | December 2018 | Part 2 | Question: 18

Consider a disk pack with surfaces, tracks and sectors per pack. bytes of data are stored in a bit
serial manner in a sector. The number of bits required to specify a particular sector in the disk is

A. B. C. D.
ugcnetcse-dec2018-paper2 operating-system disk

Answer key ☟

35.10.4 Disk: UGC NET CSE | June 2013 | Part 3 | Question: 64, UGCNET-Dec2015-II: 49

A UNIX file system has 1 KB block size and 4-byte disk addresses. What is the maximum file size if the inode
contains ten direct block entries, one single indirect block entry, one double indirect block entry and one triple
indirect block entry?

A. 30 GB B. 64 GB C. 16 GB D. 1 GB
ugcnetcse-june2013-paper3 ugcnetcse-dec2015-paper2 operating-system disk

Answer key ☟

35.10.5 Disk: UGC NET CSE | October 2020 | Part 2 | Question: 17

Suppose you have a Linux file system where the block size is bytes, a disk address is bits, and an node
contains the disk addresses of the first direct blocks of file, a single indirect block and a double indirect block.
Approximately, what is the largest file that can be represented by an node?

A. Kbytes B. MBytes C. Mbytes D. KBytes

ugcnetcse-oct2020-paper2 operating-system disk

Answer key ☟
35.10.6 Disk: UGC NET CSE | October 2020 | Part 2 | Question: 91

The question given below: concern a disk with a sector size of bytes, tracks per surface, sectors per
track, five double-sided platters, and average seek time of milliseconds.
If is the capacity of a track in bytes, and is the capacity of each surface in bytes, then _______
A. B.
C. D.
ugcnetcse-oct2020-paper2 operating-system disk

Answer key ☟

35.10.7 Disk: UGC NET CSE | October 2020 | Part 2 | Question: 92

The question given below: concern a disk with a sector size of bytes, tracks per surface, sectors per
track, five double-sided platters, and average seek time of milliseconds.
What is the capacity of the disk, in bytes?

A. B. C. D.
ugcnetcse-oct2020-paper2 operating-system disk

Answer key ☟

35.10.8 Disk: UGC NET CSE | October 2020 | Part 2 | Question: 93

The question given below: concern a disk with a sector size of bytes, tracks per surface, sectors per
track, five double-sided platters, and average seek time of milliseconds.
Given below are two statements:
Statement : The disk has a total number of cylinders.
Statement : bytes is not a valid block size for the disk.
In the light of the above statements, choose the correct answer from the options given below:

A. Both Statement and Statement are true

B. Both Statement and Statement are false
C. Statement is correct but Statement is false
D. Statement is incorrect but Statement is true

ugcnetcse-oct2020-paper2 operating-system disk

Answer key ☟

35.10.9 Disk: UGC NET CSE | October 2020 | Part 2 | Question: 94

The question given below concern a disk with a sector size of bytes, tracks per surface, sectors per
track, five double-sided platters, and average seek time of milliseconds.
If the disk platters rotate at rpm (revolutions per minute), then approximately what is the maximum rotational
delay?
A. seconds B. seconds
C. seconds D. seconds
ugcnetcse-oct2020-paper2 operating-system disk

Answer key ☟

35.10.10 Disk: UGC NET CSE | October 2020 | Part 2 | Question: 95

The question given below concern a disk with a sector size of bytes, tracks per surface, sectors per
track, five double-sided platters, and average seek time of milliseconds.
If one track of data can be transferred per revolution, then what is the data transfer rate?
A. KBytes/second B. KBytes/second
 C. KBytes/second D. KBytes/second
ugcnetcse-oct2020-paper2 operating-system disk

Answer key ☟

35.11 Disk Cpu Memory Interrupt (1)

35.11.1 Disk Cpu Memory Interrupt: UGC NET CSE | June 2019 | Part 2 | Question: 42

Match List-I with List-II:

Choose the correct option from those given below:

A. a-i; b-ii; c-iii; d-iv B. a-iii; b-i; c-iv; d-ii
C. a-ii; b-i; c-iv; d-iii D. a-ii; b-iv; c-iii; d-i
ugcnetcse-june2019-paper2 disk-cpu-memory-interrupt

Answer key ☟

35.12 Disk Scheduling (9)

35.12.1 Disk Scheduling: UGC NET CSE | December 2012 | Part 2 | Question: 5 UGCNET-June2013-II: 47

If the disk head is located initially at 32, find the number of disk moves required with FCFS if the disk queue of
I/O blocks requests are 98. 37, 14, 124, 65, 67.

A. 239 B. 310 C. 321 D. 325

ugcnetcse-dec2012-paper2 operating-system disk-scheduling ugcnetcse-june2013-paper2

Answer key ☟

35.12.2 Disk Scheduling: UGC NET CSE | December 2013 | Part 2 | Question: 48

Consider a disk queue with request for input/output to block cylinders 98, 183, 37, 122, 14, 124, 65, 67 in that
order. Assume that disk head is initially positioned at cylinder 53 and moving towards cylinder number 0. The
total number of head movements using Shortest Seek Time First (SSTF) and SCAN algorithms are respectively
A. 236 and 252 cylinders B. 640 and 236 cylinders
C. 235 and 640 cylinders D. 235 and 252 cylinders
ugcnetcse-dec2013-paper2 operating-system disk-scheduling

Answer key ☟

35.12.3 Disk Scheduling: UGC NET CSE | December 2014 | Part 3 | Question: 51

Consider an imaginary disk with cylinders. A request come to read a block on cylinder . While the seek to
cylinder is in progress, new requests come in for cylinders and in that order. The number of
arm motions using shortest seek first algorithm is

A. ​ B. C. D.
ugcnetcse-dec2014-paper3 operating-system disk-scheduling

Answer key ☟

35.12.4 Disk Scheduling: UGC NET CSE | January 2017 | Part 3 | Question: 50

Consider a disk queue with I/O requests on the following cylinders in their arriving order:
 . The disk head is assumed to be at cylinder and moving in the direction of
decreasing number of cylinders. Total number of cylinders in the disk is . The disk head movement using SCAN –
scheduling algorithm is:
A. B.
C. D.
ugcnetcse-jan2017-paper3 operating-system disk-scheduling

Answer key ☟

35.12.5 Disk Scheduling: UGC NET CSE | July 2016 | Part 2 | Question: 38

If the Disk head is located initially at track 32, find the number of disk moves required with FCFS scheduling
criteria if the disk queue of I/O blocks requests are 98, 37, 14, 124, 65, 67

A. 320 B. 322 C. 321 D. 319

ugcnetcse-july2016-paper2 operating-system disk-scheduling

Answer key ☟

35.12.6 Disk Scheduling: UGC NET CSE | June 2012 | Part 3 | Question: 74

On a disk with 1000 cylinders (0 to 999) find the number of tracks, the disk arm must move to satisfy all the
requests in the disk queue. Assume the last request service was at track 345 and the head is moving toward track
0. The queue in FIFO order contains requests for the following tracks:
123, 874, 692, 475, 105, 376
(Assume scan algorithm)

A. 2013 B. 1219 C. 1967 D. 1507

ugcnetcse-june2012-paper3 operating-system disk-scheduling

Answer key ☟

35.12.7 Disk Scheduling: UGC NET CSE | Junet 2015 | Part 2 | Question: 36

A disk drive has cylinders, numbered to . Disk requests come to the disk driver for cylinders
and in that order. The driver is currently serving a request at a cylinder . A seek takes
msec per cylinder moved. How much seek time is needed for shortest seek time first (SSTF) algorithm?

A. sec B. sec C. sec D. sec

ugcnetcse-june2015-paper2 operating-system disk-scheduling

Answer key ☟

35.12.8 Disk Scheduling: UGC NET CSE | October 2020 | Part 2 | Question: 16

Consider a disk system having cylinders. Disk requests are received by a disk drive for cylinders
and , in that order. Assuming the disk head is currently at cylinder , what is the time taken
to satisfy all the requests if it takes milliseconds to move from one cylinder to adjacent one and Shortest Seek Time
First (SSTF) algorithm is used?
A. milliseconds B. milliseconds
C. milliseconds D. milliseconds
ugcnetcse-oct2020-paper2 operating-system disk-scheduling

Answer key ☟

35.12.9 Disk Scheduling: UGC NET CSE | September 2013 | Part 2 | Question: 46

Consider the input/output (I/O) request made at different instants of time directed at a hypothetical disk having
tracks as given in the following table
 Assume that
Current head position is at track no.
Direction of last movement is towards higher number of tracks.
Current clock time is milliseconds
Head movement time per track is millisecond
is a variant of disk-arm scheduling algorithm. In this algorithm, if no more I/O requests are left in
current direction, the disk head reveres its direction. The seek time in Shortest Seek First (SSF) and disk-arm
scheduling algorithms respectively are :
A. and milliseconds B. and milliseconds
C. and milliseconds D. and milliseconds
ugcnetsep2013ii operating-system disk-scheduling

Answer key ☟

35.13 Distributed Computing (1)

35.13.1 Distributed Computing: UGC NET CSE | December 2012 | Part 3 | Question: 2

The efficiency (E) and speed up (sp) for Multiprocessor with p processors satisfies:
A. B.
C. D.
ugcnetcse-dec2012-paper3 operating-system distributed-computing

Answer key ☟

35.14 Distributed System (1)

35.14.1 Distributed System: UGC NET CSE | December 2008 | Part 2 | Question: 24

An example of distributed OS is:

A. Amoeba B. UNIX
C. MS-DOS D. MULTICS
ugcnetcse-dec2008-paper2 operating-system distributed-system

Answer key ☟

35.15 Dynamic Linking (1)

35.15.1 Dynamic Linking: UGC NET CSE | July 2016 | Part 2 | Question: 34

Which of the following is not typically a benefit of dynamic linking?

I. Reduction in overall program execution time

II. Reduction in overall space consumption in memory
III. Reduction in overall space consumption on disk
IV. Reduction in the cost of software updates
A. I and IV B. I only C. II and III D. IV only
ugcnetcse-july2016-paper2 operating-system dynamic-linking

Answer key ☟

35.16 Effective Memory Access (1)

 35.16.1 Effective Memory Access: UGC NET CSE | June 2009 | Part 2 | Question: 19

Suppose it takes ns to access a page table and ns to access associative memory with a % hit rate, the
average access time equals :
A. B.
C. D.
ugcnetcse-june2009-paper2 operating-system effective-memory-access

Answer key ☟

35.17 File System (7)

35.17.1 File System: UGC NET CSE | August 2016 | Part 3 | Question: 53

Consider a file currently consisting of blocks. Assume that the file control block and the index block is
already in memory. If a block is added at the end (and the block information to be added is stored in memory),
then how many disk operations are required for indexed (single-level) allocation strategy ?

A. B. C. D.
ugcnetcse-aug2016-paper3 operating-system file-system

Answer key ☟

35.17.2 File System: UGC NET CSE | December 2013 | Part 3 | Question: 72

The directory structure used in Unix file system is called

A. Hierarchical directory B. Tree structured directory
C. Directed acrylic graph D. Graph structured directory
ugcnetcse-dec2013-paper3 operating-system file-system

Answer key ☟

35.17.3 File System: UGC NET CSE | December 2014 | Part 3 | Question: 50

How many disk blocks are required to keep list of free disk blocks in a GB hard disk with kB block size
using linked list of free disk blocks ? Assume that the disk block number is stored in bits.
A. blocks B. blocks
C. blocks D. blocks
ugcnetcse-dec2014-paper3 operating-system file-system

Answer key ☟

35.17.4 File System: UGC NET CSE | June 2012 | Part 2 | Question: 10

Which command is the fastest among the following?

A. COPY TO <NEW FILE> B. COPY STRUCTURE TO <NEW FILE>
C. COPY FILE <FILE 1> <FILE 2> D. COPY TO MFILE-DAT DELIMITED
ugcnetcse-june2012-paper2 operating-system file-system

Answer key ☟

35.17.5 File System: UGC NET CSE | June 2014 | Part 2 | Question: 34

Match the following

 A. B.
C. D.
ugcnetcse-june2014-paper2 operating-system file-system

Answer key ☟

35.17.6 File System: UGC NET CSE | Junet 2015 | Part 3 | Question: 12

In the indexed scheme of blocks to a file, the maximum possible size of the file depends on:
A. The number of blocks used for index and the size of index
B. Size of Blocks and size of Address
C. Size of index
D. Size of block

ugcnetcse-june2015-paper3 operating-system file-system

Answer key ☟

35.17.7 File System: UGC NET CSE | Junet 2015 | Part 3 | Question: 53

In _____ allocation method for disk block allocation in a file system, insertion and deletion of blocks in a file is
easy

A. Index B. Linked C. Contiguous D. Bit Map

ugcnetcse-june2015-paper3 operating-system file-system

Answer key ☟

35.18 Fragmentation (1)

35.18.1 Fragmentation: UGC NET CSE | July 2018 | Part 2 | Question: 56

Which of the following statements are true?

i. External Fragmentation exists when there is enough total memory space to satisfy a request but the available space
is contiguous.
ii. Memory Fragmentation can be internal as well as external
iii. One solution to external Fragmentation is compaction

A. i and ii only B. i and iii only

C. ii and iii only D. i, ii and iii
ugcnetcse-july2018-paper2 operating-system fragmentation

Answer key ☟

35.19 Hard Disk Drive (1)

 35.19.1 Hard Disk Drive: UGC NET CSE | December 2011 | Part 2 | Question: 29

The maximum amount of information that is available in one portion of the disk access arm for a removal disk
pack (without further movement of the arm with multiple heads)
A. A plate of data B. A cylinder of data
C. A track of data D. A block of data
ugcnetcse-dec2011-paper2 operating-system system hard-disk-drive

35.20 Hit Ratio (1)

35.20.1 Hit Ratio: UGC NET CSE | September 2013 | Part 2 | Question: 45

The hit ratio of a Transaction Look Aside Buffer (TLAB) is 80%. It takes 20 nanoseconds (ns) to search TLAB
and 100 ns to access main memory. The effective memory access time is _____

A. 36 ns B. 140 ns C. 122 ns D. 40 ns
ugcnetsep2013ii operating-system cache-memory hit-ratio

Answer key ☟

35.21 IO Handling (1)

35.21.1 IO Handling: UGC NET CSE | July 2018 | Part 2 | Question: 54

Normally user programs are prevented from handling I/O directly by I/O instructions in them. For CPUs having
explicit I/O instructions, such I/O protection is ensured by having the I/O instructions privileged. In a CPU with
memory mapped I/O, there is no explicit I/O instruction. Which one of the following is true for a CPU with memory
mapped I/O?

A. I/O protection is ensured by operating system routines

B. I/O protection is ensured by a hardware trap
C. I/O protection is ensured during system configuration
D. I/O protection is not possible

ugcnetcse-july2018-paper2 operating-system io-handling

Answer key ☟

35.22 Input Output (2)

35.22.1 Input Output: UGC NET CSE | January 2017 | Part 2 | Question: 38

Match the following w.r.t Input/Output management :

ugcnetjan2017ii operating-system input-output

Answer key ☟
 35.22.2 Input Output: UGC NET CSE | October 2020 | Part 2 | Question: 65

Match with

Choose the correct answer from the options given below:

A. B.
C. D.

ugcnetcse-oct2020-paper2 operating-system input-output

Answer key ☟

35.23 Interrupts (2)

35.23.1 Interrupts: UGC NET CSE | December 2011 | Part 2 | Question: 28

On receiving an interrupt from an device, the

A. Halts for predetermined time.

B. Branches off to the interrupt service routine after completion of the current instruction.
C. Branches off to the interrupt service routine immediately.
D. Hands over control of address bus and data bus to the interrupting device.

ugcnetcse-dec2011-paper2 operating-system interrupts

Answer key ☟

35.23.2 Interrupts: UGC NET CSE | December 2014 | Part 3 | Question: 02

For switching from a CPU user mode to the supervisor mode following type of interrupt is most appropriate
A. Internal interrupts B. External interrupts
C. Software interrupts D. None of the above
ugcnetcse-dec2014-paper3 operating-system interrupts

Answer key ☟

35.24 Java (1)

35.24.1 Java: UGC NET CSE | June 2012 | Part 3 | Question: 13

Which of the following is scheme to deal with deadlock?

A. Time out B. Time in C. Both A and B D. None of the above

ugcnetcse-june2012-paper3 operating-system java deadlock-prevention-avoidance-detection

Answer key ☟

35.25 Linux (1)

 35.25.1 Linux: UGC NET CSE | July 2018 | Part 2 | Question: 55

Which UNIX/Linux command is used to make all files and sub-directions in the directory "progs" executable by
all users?
A. chmod - R a + x progs B. chmod - R 222 progs
C. chmod - X a + x progs D. chmod - X 222 progs
ugcnetcse-july2018-paper2 unix linux operating-system non-gatecse

Answer key ☟

35.26 Memory Management (8)

35.26.1 Memory Management: UGC NET CSE | December 2008 | Part 2 | Question: 40

Which of the following treats hardware as a file system?

A.
B.
C.
D. None of the above

ugcnetcse-dec2008-paper2 operating-system memory-management

Answer key ☟

35.26.2 Memory Management: UGC NET CSE | December 2009 | Part 2 | Question: 39

A program is located in the smallest available hole in the memory is _________

(A) best – fit

(B) first – bit

(C) worst – fit

(D) buddy
ugcnetcse-dec2009-paper2 operating-system memory-management

Answer key ☟

35.26.3 Memory Management: UGC NET CSE | December 2011 | Part 2 | Question: 30

Consider a logical address space of pages of words mapped with memory of frames. How many bits
are there in the physical address ?

1. bits
2. bits
3. bits
4. bits

ugcnetcse-dec2011-paper2 operating-system memory-management

Answer key ☟

35.26.4 Memory Management: UGC NET CSE | December 2012 | Part 2 | Question: 14

Given a memory partitions of 100 K, 500 K, 200 K, 300 K and 600 K (in order) and processes of 212 K, 417 K,
112 K and 426 K (in order), using the first fit algorithm, in which partition would the process requiring 426 K be
placed?

A. 500 K B. 200 K C. 300 K D. 600 K

 ugcnetcse-dec2012-paper2 operating-system memory-management

Answer key ☟

35.26.5 Memory Management: UGC NET CSE | December 2012 | Part 2 | Question: 30

Which of the following memory allocation scheme suffers from external fragmentation?
A. Segmentation
B. Pure demand paging
C. Swapping
D. Paging

ugcnetcse-dec2012-paper2 operating-system memory-management

Answer key ☟

35.26.6 Memory Management: UGC NET CSE | December 2015 | Part 3 | Question: 37

Match the following with respect to various memory management algorithms :

A. B.
C. D.
operating-system memory-management ugcnetcse-dec2015-paper3

Answer key ☟

35.26.7 Memory Management: UGC NET CSE | January 2017 | Part 3 | Question: 49

A memory management system has 64 pages with 512 bytes page size. Physical memory consists of 32 page
frames. Number of bits required in logical and physical address are respectively:

A. 14 and 15 B. 14 and 29 C. 15 and 14 D. 16 and 32

ugcnetcse-jan2017-paper3 operating-system memory-management

Answer key ☟

35.26.8 Memory Management: UGC NET CSE | Junet 2015 | Part 3 | Question: 51

What is the most appropriate function of Memory Management Unit (MMU)?

A. It is an associative memory to store TLB

B. It is a technique of supporting multiprogramming by creating dynamic partitions
C. It is a chip to map virtual address to physical address
D. It is an algorithm to allocate and deallocate main memory to a process

ugcnetcse-june2015-paper3 operating-system memory-management

Answer key ☟

35.27 Mmu (1)

35.27.1 Mmu: UGC NET CSE | December 2015 | Part 3 | Question: 38

Function of memory management unit is :

A. Address translation B. Memory Allocation

 C. Cache management D. All of the above
ugcnetcse-dec2015-paper3 operating-system mmu

Answer key ☟

35.28 Monitors (1)

35.28.1 Monitors: UGC NET CSE | December 2014 | Part 3 | Question: 53

Monitor is an Interprocess Communication technique which can be described as

A. It is higher level synchronization primitive and is a collection of procedures, variables, and data structures grouped
together in a special package.
B. It is a non-negative integer which apart from initialization can be acted upon by wait and signal operations.
C. It uses two primitives, send and receive which are system calls rather than language constructs.
D. It consists of the primitives implemented as system calls to block the process when they are not allowed to
enter critical region to save time.

ugcnetcse-dec2014-paper3 operating-system monitors

Answer key ☟

35.29 Multiprogramming Os (1)

35.29.1 Multiprogramming Os: UGC NET CSE | December 2012 | Part 3 | Question: 7

Which of the following features will characterize an OS as multi-programmed OS?

i. More than one program loaded into main memory at the same time.
ii. If a program waits for certain event another program is immediately scheduled
iii. If the execution of a program terminates, another program is immediately scheduled
A. B.
C. D.
ugcnetcse-dec2012-paper3 operating-system multiprogramming-os

Answer key ☟

35.30 Mutual Exclusion (1)

35.30.1 Mutual Exclusion: UGC NET CSE | June 2012 | Part 3 | Question: 65

Consider the methods used by processes and for accessing their critical sections. The initial values of
shared Boolean variables and are randomly assigned,

while ( == ); while ( ==S2);

critical section critical section
= ; = ;
Which one of the following statements describes the properties achieved?
A. Mutual exclusion but not progress B. Progress but not mutual exclusion
C. Neither mutual exclusion nor progress D. Both mutual exclusion and progress
ugcnetcse-june2012-paper3 operating-system mutual-exclusion critical-section

Answer key ☟

35.31 Non Gatecse (3)

35.31.1 Non Gatecse: UGC NET CSE | December 2012 | Part 3 | Question: 40

Which of the following operating system is better for implementing client-server network?

A. Windows 95 B. Windows 98 C. Windows 2000 D. All of these

 ugcnetcse-dec2012-paper3 operating-system computer-networks non-gatecse

Answer key ☟

35.31.2 Non Gatecse: UGC NET CSE | December 2013 | Part 3 | Question: 69

To place a sound into a word document, following feature of windows is used

A. Clip board B. Task switching C. C Win App D. OLE

ugcnetcse-dec2013-paper3 operating-system non-gatecse

Answer key ☟

35.31.3 Non Gatecse: UGC NET CSE | October 2022 | Part 1 | Question: 1

For multiprocessor system, interconnection network - cross bar switch is an example of

A. Non blocking network B. Blocking network

C. That varies from connection to connection D. Recurrent network
ugcnetcse-oct2022-paper1 non-gatecse

Answer key ☟

35.32 Page Replacement (9)

35.32.1 Page Replacement: UGC NET CSE | August 2016 | Part 2 | Question: 37

Suppose that the virtual Address space has eight pages and physical memory with four page frames. If
page replacement algorithm is used, ______ number of page faults occur with the reference string.
021354637473355311172341

A. B. C. D.
ugcnetcse-aug2016-paper2 operating-system least-recently-used page-replacement

Answer key ☟

35.32.2 Page Replacement: UGC NET CSE | December 2018 | Part 2 | Question: 72

Suppose for a process , reference to pages in order are . Assume that main memory can
accomodate pages and the main memory has already and in the order – first, – second. At this moment,
assume FIFO Page Replacement Algorithm is used then the number of page faults that occur to complete the execution
of process is

A. B. C. D.
ugcnetcse-dec2018-paper2 operating-system page-replacement page-fault

Answer key ☟

35.32.3 Page Replacement: UGC NET CSE | July 2016 | Part 2 | Question: 36

Consider the reference string:

012301401234
If FIFO page replacement algorithm is used, then the number of page faults with three page frames and four page frames
are ____ and ___ respectively.

A. 10, 9 B. 9, 9 C. 10, 10 D. 9, 10
ugcnetcse-july2016-paper2 operating-system page-replacement page-fault

Answer key ☟
35.32.4 Page Replacement: UGC NET CSE | June 2012 | Part 2 | Question: 33

Consider the following page trace:

4,3,2,1,4,3,5,4,3,2,1,5
Percentage of page fault that would occur if FIFO page replacement algorithm is used with number of frames for the
JOB m=4 will be

A. 8 B. 9 C. 10 D. 12
operating-system page-replacement ugcnetcse-june2012-paper2

Answer key ☟

35.32.5 Page Replacement: UGC NET CSE | June 2014 | Part 3 | Question: 35

Consider a program that consists of pages (from to ) and we have page frames in the physical memory for
the pages. The page reference string is :

The number of page faults in LRU and optimal page replacement algorithms are respectively (without including initial
page faults to fill available page frames with pages) :

A. and B. and C. and D. and

ugcnetjune2014iii operating-system page-replacement

Answer key ☟

35.32.6 Page Replacement: UGC NET CSE | June 2019 | Part 2 | Question: 43

Consider that a process has been allocated frames and has a sequence of page referencing as
. What shall be the difference in page faults for the above string using the algorithms of
LRU and optimal page replacement for referencing the string?

A. B. C. D.
ugcnetcse-june2019-paper2 page-replacement least-recently-used

Answer key ☟

35.32.7 Page Replacement: UGC NET CSE | Junet 2015 | Part 2 | Question: 38

A LRU page replacement is used with page frames and eight pages. How many page faults will occur with the
reference string if the four frames are initially empty?

A. B. C. D.
ugcnetcse-june2015-paper2 operating-system page-replacement

Answer key ☟

35.32.8 Page Replacement: UGC NET CSE | October 2020 | Part 2 | Question: 15

Consider a hypothetical machine with pages of physical memory, pages of virtual memory, and
as the stream of page reference by an application. If and
are the number of page faults that the application would incur with FIFO and LRU page replacement algorithms
respectively, then _______(Assuming enough space for storing page frames)

A. B. C. D.
ugcnetcse-oct2020-paper2 operating-system page-replacement

Answer key ☟

35.32.9 Page Replacement: UGC NET CSE | September 2013 | Part 3 | Question: 71

Consider a main memory with three page frames for the following page reference string:
 5, 4, 3, 2, 1, 4, 3, 5, 4, 3, 4, 1, 4
Assuming that the execution of process is initialized after loading page 5 in memory,, the number of page faults in FIFO
and second chance replacement respectively are

A. 8 and 9 B. 10 and 11 C. 7 and 9 D. 9 and 8

ugcnetcse-sep2013-paper3 operating-system page-replacement

Answer key ☟

35.33 Pipelining (1)

35.33.1 Pipelining: UGC NET CSE | September 2013 | Part 2 | Question: 50

The speed up of a pipeline processing over an equivalent non-pipeline processing is defined by the ration:
where no. of tasks
time of completion of each tasks
no. of segments of pipeline
clock cycle time
speed up ratio

A. B.
C. D.
ugcnetsep2013ii operating-system pipelining

Answer key ☟

35.34 Process (2)

35.34.1 Process: UGC NET CSE | December 2014 | Part 2 | Question: 37

A specific editor has of program text, of initial stack, of initialized data, and of bootstrap
code. If five editors are started simultaneously, how much physical memory is needed if shared text is used?

A. B. C. D.
ugcnetcse-dec2014-paper2 operating-system process

Answer key ☟

35.34.2 Process: UGC NET CSE | June 2013 | Part 3 | Question: 63

Working set model is used in memory management to implement the concept of

A. Swapping B. Principal of Locality
C. Segmentation D. Thrashing
ugcnetcse-june2013-paper3 operating-system process

Answer key ☟

35.35 Process Model (2)

35.35.1 Process Model: UGC NET CSE | December 2008 | Part 2 | Question: 21

N processes are waiting for . A process spends a fraction of its time in wait state. The
utilization is given by :

1. 1-p-N
2. 1-pN
3. pN
4. p-N
 ugcnetcse-dec2008-paper2 operating-system process-model

Answer key ☟

35.35.2 Process Model: UGC NET CSE | December 2008 | Part 2 | Question: 22

If holes are half as large as processes, the fraction of memory wasted in holes is :

A.
B.
C.
D.

ugcnetcse-dec2008-paper2 operating-system process-model

Answer key ☟

35.36 Process Scheduling (25)

35.36.1 Process Scheduling: UGC NET CSE | August 2016 | Part 2 | Question: 39

Five jobs and are waiting in Ready Queue. Their expected runtimes are and
respectively. All jobs entered in Ready queue at time zero. They must run in _____ order to minimize average
response time if .
A. B.
C. D.
ugcnetcse-aug2016-paper2 operating-system process-scheduling

Answer key ☟

35.36.2 Process Scheduling: UGC NET CSE | August 2016 | Part 2 | Question: 40

Consider three CPU intensive processes which require and units of time, arrive at times
and respectively. Suppose operating system is implementing Shortest Remaining Time first (preemptive
scheduling) algorithm, then _____ context switches are required (suppose context switch at the beginning of Ready
queue and at the end of Ready queue are not counted).

A. B. C. D.
ugcnetcse-aug2016-paper2 operating-system process-scheduling

Answer key ☟

35.36.3 Process Scheduling: UGC NET CSE | December 2006 | Part 2 | Question: 37

____________ is one of pre-emptive scheduling algorithm.

A. Shortest-Job-first B. Round-robin
C. Priority based D. Shortest-Job-next
ugcnetcse-dec2006-paper2 operating-system process-scheduling

Answer key ☟

35.36.4 Process Scheduling: UGC NET CSE | December 2006 | Part 2 | Question: 38

A software to create a Job Queue is called ____________ .

A. Linkage editor B. Interpreter C. Driver D. Spooler

ugcnetcse-dec2006-paper2 operating-system process-scheduling

Answer key ☟
35.36.5 Process Scheduling: UGC NET CSE | December 2009 | Part 2 | Question: 36

In the process management Round-robin method is essentially the pre-emptive version of _________

(A) FILO

(B) FIFO

(C) SSF

(D) Longest time first

ugcnetcse-dec2009-paper2 operating-system process-scheduling

Answer key ☟

35.36.6 Process Scheduling: UGC NET CSE | December 2012 | Part 2 | Question: 20

The problem of indefinite blockage of low-priority jobs in general priority scheduling algorithm can be solved
using:

A. Parity bit B. Aging C. Compaction D. Timer

ugcnetcse-dec2012-paper2 operating-system process-scheduling

Answer key ☟

35.36.7 Process Scheduling: UGC NET CSE | December 2013 | Part 2 | Question: 46

Consider a preemptive priority based scheduling algorithm based on dynamically changing priority. Larger
priority number implies higher priority. When the process is waiting for CPU in the ready queue (but not yet
started execution), its priority changes at a rate a=2. When it starts running, its priority changes at a rate b=1. All the
processes are assigned priority value 0 when they enter ready queue. Assume that the following processes want to
execute:
Process Arrival Service
ID Time Time
P1 0 4
P2 1 1
P3 2 2
P4 3 1
The time quantum q=1. When two processes want to join ready queue simultaneously, the process which has not
executed recently is given priority. The finish time of processes P1, P2, P3 and P4 will respectively be

A. 4, 5, 7 and 8 B. 8, 2, 7 and 5 C. 2, 5, 7 and 8 D. 8, 2, 5 and 7

ugcnetcse-dec2013-paper2 operating-system process-scheduling

Answer key ☟

35.36.8 Process Scheduling: UGC NET CSE | December 2014 | Part 2 | Question: 36

Consider the following justifications for commonly using the two-level scheduling:
I. It is used when memory is too small to hold all the ready processes.
II. Because its performance is same as that of the .
III. Because it facilitates putting some set of processes into memory and a choice is made from that.
IV. Because it does not allow to adjust the set of in-core processes.
Which of the following is true ?

A. and B. and C. and D. and

ugcnetcse-dec2014-paper2 operating-system process-scheduling

Answer key ☟
35.36.9 Process Scheduling: UGC NET CSE | December 2018 | Part 2 | Question: 73

​Consider the following set of processes and the length of CPU burst time given in milliseconds :

Assume that processes being scheduled with Round-Robin Scheduling Algorithm with time quantum ms. Then the
waiting time for is ______ ms

A. B. C. D.
ugcnetcse-dec2018-paper2 operating-system process-scheduling round-robin-scheduling

Answer key ☟

35.36.10 Process Scheduling: UGC NET CSE | January 2017 | Part 3 | Question: 52

Some of the criteria for calculation of priority of a process are:

i. Processor utilization by an individual process.

ii. Weight assigned to a user or group of users
iii. Processor utilization by a user or group of processes

In fair scheduler, priority is calculated based on:

A. only (i) and (ii) B. only (i) and (iii)
C. (i) ,(ii) and (iii) D. only (ii) and (iii)
ugcnetcse-jan2017-paper3 operating-system process-scheduling

Answer key ☟

35.36.11 Process Scheduling: UGC NET CSE | July 2016 | Part 2 | Question: 40

A scheduling Algorithm assigns priority proportional to the waiting time of a process. Every process starts with
priority zero (lowest priority). The scheduler reevaluates the process priority for every 'T' time units and declares
next process to be scheduled. If teh process have no I/O operations and all arrive at time zero, then the schduler
implements ___ criteria
A. Priority scheduling B. Rond Robin Scheduling
C. Shortest Job First D. FCFS
ugcnetcse-july2016-paper2 operating-system process-scheduling

Answer key ☟

35.36.12 Process Scheduling: UGC NET CSE | July 2018 | Part 2 | Question: 60

In which of the following scheduling criteria, context switching will never take place?
A. ROUND ROBIN B. Preemptive SJF
C. Non-preemptive SJF D. Preemptive priority
ugcnetcse-july2018-paper2 process-scheduling operating-system

Answer key ☟

35.36.13 Process Scheduling: UGC NET CSE | June 2005 | Part 2 | Question: 39

Which is the correct definition of a valid process transition in an operating system ?

A. Wake up : Ready Running B. Dispatch: Ready Running
C. Block : Ready Running D. Timer run out: Ready Blocked
ugcnetcse-june2005-paper2 operating-system process-scheduling
 Answer key ☟

35.36.14 Process Scheduling: UGC NET CSE | June 2010 | Part 2 | Question: 38

_______ is one of pre-emptive scheduling algorithm.

A. B. C. D. Priority based
ugcnetcse-june2010-paper2 operating-system process-scheduling

Answer key ☟

35.36.15 Process Scheduling: UGC NET CSE | June 2012 | Part 2 | Question: 29

Pre-emptive scheduling is the strategy of temporarily suspending a running process

A. before the CPU time slice expires B. to allow starving processes to run
C. when it requires I/O D. to avoid collision
operating-system process-scheduling ugcnetcse-june2012-paper2

Answer key ☟

35.36.16 Process Scheduling: UGC NET CSE | June 2012 | Part 2 | Question: 30
In round robin CPU scheduling as time quantum is increased the average turn around time
A. increases
B. decreases
C. remains constant
D. varies irregularly

ugcnetcse-june2012-paper2 operating-system process-scheduling

Answer key ☟

35.36.17 Process Scheduling: UGC NET CSE | June 2013 | Part 3 | Question: 58

Consider the following processes with time slice of 4 milliseconds (I/O requests are ignored):
Process A B C D
Arrival
time 0 1 2 3

CPU
8 4 9 5
Cycle
The average turnaround time of these processes will be

A. 19.25 milliseconds B. 18.25 milliseconds

C. 19.5 milliseconds D. 18.5 milliseconds
ugcnetcse-june2013-paper3 operating-system process-scheduling

Answer key ☟

35.36.18 Process Scheduling: UGC NET CSE | June 2014 | Part 2 | Question: 32

Match the following

A. B.
 C. D.
ugcnetcse-june2014-paper2 operating-system process-scheduling

Answer key ☟

35.36.19 Process Scheduling: UGC NET CSE | June 2014 | Part 3 | Question: 34

Consider a uniprocessor system where new processes arrive at an average of five processes per minute and each
process needs an average of seconds of service time. What will be the CPU utilization ?

A. % B. % C. % D. %
ugcnetjune2014iii operating-system process-scheduling

Answer key ☟

35.36.20 Process Scheduling: UGC NET CSE | June 2014 | Part 3 | Question: 36

Which of the following statements is not true about disk-arm scheduling algorithms ?

A. SSTF (shortest seek time first) algorithm increases performance of FCFS.

B. The number of requests for disk service are not influenced by file allocation method.
C. Caching the directories and index blocks in main memory can also help in reducing disk arm movements.
D. SCAN and C-SCAN algorithms are less likely to have a starvation problem.

ugcnetjune2014iii operating-system process-scheduling

Answer key ☟

35.36.21 Process Scheduling: UGC NET CSE | June 2019 | Part 2 | Question: 45

Consider three CPU intensive processes, which require , and units of time and arrive at times , and
respectively. How many context switches are needed if the operating system implements a shortest remaining
time first scheduling algorithm? Do not count the context switches at time zero and at the end.

A. B. C. D.
ugcnetcse-june2019-paper2 process-scheduling

Answer key ☟

35.36.22 Process Scheduling: UGC NET CSE | June 2023 | Part 2: 22

Consider the following table of arrival time and burst time for three processes :
Process arrival time Burst time

The pre-emptive shortest job first scheduling algorithm is used. Scheduling is carried out only at arrival or completion
of a process. What is the average waiting time for the three processes?
A. B.
C. D.
ugcnetcse-june2023-paper2 operating-system process-scheduling

Answer key ☟

35.36.23 Process Scheduling: UGC NET CSE | Junet 2015 | Part 3 | Question: 50

Which of the following statements is not true for Multi Level Feedback Queue processor scheduling algorithm?

A. Queues have different priorities

 B. Each queue may have different scheduling algorithm
C. Processes are permanently assigned to a queue
D. This algorithm can be configured to match a specific system under design

ugcnetcse-june2015-paper3 operating-system process-scheduling

Answer key ☟

35.36.24 Process Scheduling: UGC NET CSE | September 2013 | Part 2 | Question: 44

Match the following

A. B.
C. D.
ugcnetsep2013ii operating-system process-scheduling match-the-following easy

Answer key ☟

35.36.25 Process Scheduling: UGC NET CSE | September 2013 | Part 3 | Question: 70

Consider the following set of processes with the length of CPU burst time in milliseconds (ms)

Assume that processes are stored in ready queue in following order

Using round robin scheduling with time slice of ms, the average turn around time is

A. ms B. ms C. ms D. ms
ugcnetcse-sep2013-paper3 operating-system process-scheduling

Answer key ☟

35.37 Process Synchronization (2)

35.37.1 Process Synchronization: UGC NET CSE | December 2018 | Part 2 | Question: 69

​To overcome difficulties in Readers-Writers problem, which of the following statement/s is/are true?

i. Writers are given exclusive access to shared objects.

ii. Readers are given exclusive access to shared objects.
iii. Both Readers and Writers are given exclusive access to shared objects.

Choose the correct answer from the code given below :

A. (i) only B. (ii) only C. (iii) only D. Both (ii) and (iii)
 ugcnetcse-dec2018-paper2 operating-system process-synchronization

Answer key ☟

35.37.2 Process Synchronization: UGC NET CSE | July 2018 | Part 2 | Question: 51

At a particular time of computation, the value of a counting semaphore is 10. Then 12 P operations and "x" V
operations were performed on this semaphore. If the final value of semaphore is 7, x will be

A. 8 B. 9 C. 10 D. 11
ugcnetcse-july2018-paper2 operating-system process-synchronization

Answer key ☟

35.38 Ram (1)

35.38.1 Ram: UGC NET CSE | December 2008 | Part 2 | Question: 41

In which of the following, ready to execute processes must be present in ?

A. multiprocessing
B. multiprogramming
C. multitasking
D. all of the above

ugcnetcse-dec2008-paper2 operating-system ram

Answer key ☟

35.39 Resource Allocation (2)

35.39.1 Resource Allocation: UGC NET CSE | June 2012 | Part 2 | Question: 31

Resources are allocated to the process on non-sharable basis is

A. mutual exclusion B. hold and wait
C. no pre-emption D. circular wait
ugcnetcse-june2012-paper2 operating-system resource-allocation

Answer key ☟

35.39.2 Resource Allocation: UGC NET CSE | June 2014 | Part 2 | Question: 33

Consider a system with five processes through and three resource types , and . Resource type
has instances, has instances and has instances. Suppose that at time , the following snapshot
of the system has been taken :
Allocation

0 1 0
2 0 0
3 0 2
2 1 1
0 2 2
Max

7 5 3
3 2 2
9 0 2
2 2 2
 4 3 3
Available

3 3 2
Assume that now the process requests one additional instance of type and two instances of resource type . The
state resulting after this allocation will be
A. Ready state B. Safe state
C. Blocked state D. Unsafe state
ugcnetcse-june2014-paper2 operating-system resource-allocation

Answer key ☟

35.40 Runtime Environment (1)

35.40.1 Runtime Environment: UGC NET CSE | December 2009 | Part 2 | Question: 31

In an absolute loading scheme which loader function is accomplished by assembler ?

(A) re-allocation

(B) allocation

(C) linking

(D) loading
ugcnetcse-dec2009-paper2 operating-system runtime-environment

Answer key ☟

35.41 Scheduling (4)

35.41.1 Scheduling: UGC NET CSE | December 2008 | Part 2 | Question: 23

An example of a non pre-emptive scheduling algorithm is :

A. Round Robin B. Priority Scheduling
C. Shortest job first D. 2 level scheduling
ugcnetcse-dec2008-paper2 operating-system scheduling

35.41.2 Scheduling: UGC NET CSE | December 2010 | Part 2 | Question: 38

WINDOWS is a _________ operating.

A. Real time B. Multi-user C. Preemptive D. Non-preemptive

ugcnetcse-dec2010-paper2 operating-system scheduling

Answer key ☟

35.41.3 Scheduling: UGC NET CSE | January 2017 | Part 2 | Question: 39

Which of the following scheduling algorithms may cause starvation ?

a. First-come-first-served
b. Round Robin
c. Priority

d. Shortest process next

e. Shortest remaining time first

A. a, c and e B. c, d and e
C. b, d and e D. b, c and d
 ugcnetjan2017ii operating-system scheduling

Answer key ☟

35.41.4 Scheduling: UGC NET CSE | July 2018 | Part 2 | Question: 59

Consider the following three processes with the arrival time and CPU burst time given in miliseconds:
Arrival Burst
Process
Time Time
0 7
1 4
2 8
The Gantt Chart for preemptive SJF scheduling algorithm is _______

A.

B.

C.

D.

ugcnetcse-july2018-paper2 operating-system scheduling process-scheduling

Answer key ☟

35.42 Seek Latency (1)

35.42.1 Seek Latency: UGC NET CSE | June 2019 | Part 2 | Question: 16

For a magnetic disk with concentric circular tracks, the seek latency is not linearly proportional to the seek
distance due to

A. non-uniform distribution of requests

B. arm starting or stopping inertia
C. higher capacity of tracks on the periphery of the platter
D. use of uniform arm scheduling policies

ugcnetcse-june2019-paper2 seek-latency

Answer key ☟

35.43 Semaphore (3)

35.43.1 Semaphore: UGC NET CSE | December 2009 | Part 2 | Question: 38

A semaphore count of negative n means (s = – n) that the queue contains ________ waiting processes.

(A) n + 1

(B) n

(C) n – 1

(D) 0
ugcnetcse-dec2009-paper2 operating-system semaphore

Answer key ☟
 35.43.2 Semaphore: UGC NET CSE | January 2017 | Part 2 | Question: 36

There are three processes and sharing a semaphore for synchronizing a variable. Initial value of
semaphore is one. Assume that negative value of semaphore tells us how many processes are waiting in queue.
Processes access the semaphore in following order :

a. needs to access

b. needs to access
c. needs to access

d. exits critical section

e. exits critical section The final value of semaphore will be :

A. B. C. D.
ugcnetjan2017ii operating-system semaphore

Answer key ☟

35.43.3 Semaphore: UGC NET CSE | June 2013 | Part 3 | Question: 60

Suppose and are two semaphores initialized to and are two processes which are sharing resources.

Their execution may sometimes lead to an undesirable situation called

A. Starvation B. Race condition C. Multithreading D. Deadlock

ugcnetcse-june2013-paper3 operating-system semaphore

Answer key ☟

35.44 Shell Script (7)

35.44.1 Shell Script: UGC NET CSE | July 2016 | Part 3 | Question: 68

Which of the following statements is not correct with reference to cron daemon in UNIX OS?

A. The cron daemon is the standard tool for running commands on a predetermined-schedule
B. It starts when the system boots and runs as long as the system is up
C. Cron reads configuration files that contain list of command lines and the times at which they invoked
D. Crontab for individual users are not stored

ugcnetcse-july2016-paper3 unix shell-script

Answer key ☟

35.44.2 Shell Script: UGC NET CSE | July 2016 | Part 3 | Question: 69

In Unix, files can be protected by assigning each one a 9-bit mode called rights bits, now, consider the following
two statements:

I. A mode of 641 (octal) means that the owner can read and write the file, other members of the owner's group can read
it, and users can execute only
II. A mode of 100 (octal) allows the owner to execute the file , but prohibits all other access
 Which of the following statements is correct with reference to above statements?
A. Only I is correct B. Only II is correct
C. Both I and II are correct D. Both I and II are incorrect
ugcnetcse-july2016-paper3 unix shell-script

Answer key ☟

35.44.3 Shell Script: UGC NET CSE | June 2019 | Part 2 | Question: 50

Which of the following UNIX/Linux pipes will count the number of lines in all the files having .c and .h as their
extension in the current working directory?
A. cat ch wc B. cat c-h wc
C. cat ch ls D. cat ch wc
ugcnetcse-june2019-paper2 shell-script

Answer key ☟

35.44.4 Shell Script: UGC NET CSE | Junet 2015 | Part 2 | Question: 39

What does the following command do? grep -vn "abc" x

A. It will print all of the lines in the file x that match the search string "abc"
B. It will print all of the lines in file x that do not match the search string "abc"
C. It will print the total number of lines in the file x that match the search string "abc"
D. It will print the specific line numbers of the file x in which there is a match for string "abc"

ugcnetcse-june2015-paper2 operating-system shell-script non-gatecse

Answer key ☟

35.44.5 Shell Script: UGC NET CSE | Junet 2015 | Part 3 | Question: 75

The unix command: $ vi file1 file2

A. Edits file1 and stores the contents of file1 in file2

B. Both files i.e., file1 and file2 can be edited using 'ex' command to travel between the files
C. Both files can be edited using 'mv' command to move between the files
D. Edits file1 first, saves it and then edits file2

ugcnetcse-june2015-paper3 shell-script

Answer key ☟

35.44.6 Shell Script: UGC NET CSE | September 2013 | Part 3 | Question: 72

Which of the following shell scripts will produce the output “my first script”?

A. for i in my first script { echo –i $i }

B. for my first script; do echo –n; done
C. for i in my first script; do echo –i $i; done
D. for n in my first script; do echo –i $i; done

ugcnetcse-sep2013-paper3 unix shell-script non-gatecse

Answer key ☟

35.44.7 Shell Script: UGC NET CSE | September 2013 | Part 3 | Question: 75

Which of the following statements is not true for UNIX Operating System?

A. Major strength of UNIX Operating System is its open standards which enables large number of organizations
ranging from academicia to industries to participate in its development
 B. UNIX kernel uses modules with well specified interfaces and provides advantages like simplified tesing and
maintenance of kernel.
C. UNIX is kernel based operating system with two main components viz. process management subsystem and file
management subsystem.
D. All devices are represented as files which simplify the management of I/O devices and files. The directories
structure used is directed acyclic graph.

ugcnetcse-sep2013-paper3 unix shell-script

Answer key ☟

35.45 Sjf (1)

35.45.1 Sjf: UGC NET CSE | December 2008 | Part 2 | Question: 8

Four jobs J1, J2, J3 and J4 are waiting to be run. Their expected run times are 9, 6, 3 and 5 respectively. In order
to minimize average response time, the jobs should be run in the order:

(A) J1 J2 J3 J4 (B) J4 J3 J2 J1

(C) J3 J4 J1 J2 (D) J3 J4 J2 J1
ugcnetcse-dec2008-paper2 operating-system sjf scheduling

Answer key ☟

35.46 Sstf (1)

35.46.1 Sstf: UGC NET CSE | June 2019 | Part 2 | Question: 41

Consider a disk system with cylinders. The requests to access the cylinders occur in the following
sequences:

Assuming that the head is currently at cylinder , what is the time taken to satisfy all requests if it takes ms to move
from the cylinder to adjacent one and the shortest seek time first policy is used?

A. ms B. ms C. ms D. ms
ugcnetcse-june2019-paper2 disk-scheduling sstf

Answer key ☟

35.47 Storage Devices (1)

35.47.1 Storage Devices: UGC NET CSE | December 2014 | Part 3 | Question: 49

Various storage devices used by an operating system can be arranged as follows in increasing order of accessing
speed :

A. Magnetic tapes magnetic disks optical disks electronic disks main memory cache registers
B. Magnetic tapes magnetic disks electronic disks optical disks ​ main memory cache registers
C. Magnetic tapes electronic disks magnetic disks optical disks main memory cache registers
D. Magnetic tapes optical disks magnetic disks electronic disks main memory cache registers

ugcnetcse-dec2014-paper3 storage-devices accessing-speed

Answer key ☟

35.48 System Call (2)

 35.48.1 System Call: UGC NET CSE | November 2017 | Part 3 | Question: 75

Match the following WINDOWS system calls and UNIX system calls with reference to process control and File
manipulation.

A.
B.
C.
D.

ugcnetcse-nov2017-paper3 operating-system system-call

Answer key ☟

35.48.2 System Call: UGC NET CSE | October 2020 | Part 2 | Question: 84

Assuming that the system call never fails, consider the following C program and executed on a
UNIX/Linux system:

Statement : displays “Happy” times

Statement : displays “Happy” times
In the light of the above statements, choose the correct answer from the options given below

A. Both Statement and Statement are true

B. Both Statement and Statement are false
C. Statement is correct but Statement is false
D. Statement is incorrect but Statement is true

ugcnetcse-oct2020-paper2 operating-system system-call

Answer key ☟

35.49 System Reliability (1)

35.49.1 System Reliability: UGC NET CSE | August 2016 | Part 3 | Question: 43

An Operating System crashes on the average once in 30 days, that is, the Mean Time Between Failures
(MTBF) = 30 days. When this happens, it takes 10 minutes to recover the OS, that is, the Mean Time To Repair
(MTTR) = 10 minutes. The availability of the OS with these reliability figures is approximately :

A. 96.97% B. 97.97% C. 99.009% D. 99.97%

 ugcnetcse-aug2016-paper3 operating-system system-reliability

Answer key ☟

35.50 Threads (4)

35.50.1 Threads: UGC NET CSE | December 2012 | Part 3 | Question: 32

A thread is a light weight process.

In the above statement, weight refers to

A. time B. number of resources

C. speed D. all of the above
ugcnetcse-dec2012-paper3 operating-system threads

Answer key ☟

35.50.2 Threads: UGC NET CSE | December 2013 | Part 3 | Question: 75

Possible thread states in Windows 2000 operating system include:

A. Ready, running and waiting

B. Ready, standby, running, waiting, transition and terminated
C. Ready, running, waiting, transition and terminated
D. Standby, running, waiting, transition and terminated

ugcnetcse-dec2013-paper3 operating-system threads non-gatecse

Answer key ☟

35.50.3 Threads: UGC NET CSE | January 2017 | Part 3 | Question: 53

One of the disadvantages of user level threads compared to Kernel level thread is

A. If a user level thread of a process executes a system call, all threads in that process are blocked.
B. Scheduling is application dependent.
C. Thread switching doesn’t require kernel mode privileges.
D. The library procedures invoked for thread management in user level threads are local procedures.

ugcnetcse-jan2017-paper3 operating-system threads

Answer key ☟

35.50.4 Threads: UGC NET CSE | June 2019 | Part 2 | Question: 44

Which of the following are NOT shared by the threads of the same process?

a. Stack b. Registers c. Address space d. Message queue

A. a and d B. b and c C. a and b D. a, b and c

ugcnetcse-june2019-paper2 threads

Answer key ☟

35.51 Transaction and Concurrency (1)

35.51.1 Transaction and Concurrency: UGC NET CSE | Junet 2015 | Part 2 | Question: 37

Let and two processes, R be the set of variables read from memory, and W be the set of variables
written to memory. For the concurrent execution of two processes and which of the conditions are not
true?
A. B.
C. D.
 ugcnetcse-june2015-paper2 transaction-and-concurrency

Answer key ☟

35.52 Unix (24)

35.52.1 Unix: UGC NET CSE | August 2016 | Part 3 | Question: 49

The Unix Operating System Kernel maintains two key data structures related to processes, the process table and
the user structure. Now, consider the following two statements :
I. The process table is resident all the time and contain information needed for all processes, even those that are not
currently in memory.
II. The user structure is swapped or paged out when its associated process is not in memory, in order not to waste
memory on information that is not needed.
Which of the following options is correct with reference to above statements ?

1. Only (I) is correct.

2. Only (II) is correct.
3. Both (I) and (II) are correct.
4. Both (I) and (II) are wrong.

ugcnetcse-aug2016-paper3 operating-system unix

Answer key ☟

35.52.2 Unix: UGC NET CSE | December 2009 | Part 2 | Question: 40

The Unix command used to find out the number of characters in a file is

(A) nc

(B) wc

(C) chcnt

(D) lc
ugcnetcse-dec2009-paper2 unix operating-system

Answer key ☟

35.52.3 Unix: UGC NET CSE | December 2012 | Part 2 | Question: 36

In UNIX, which of the following command is used to set the task priority?

A. init B. nice C. kill D. PS

ugcnetcse-dec2012-paper2 unix operating-system

Answer key ☟

35.52.4 Unix: UGC NET CSE | December 2012 | Part 3 | Question: 37

Everything below the system call interface and above the physical hardware is known as

A. Kernel B. Bus C. Shell D. Stub

ugcnetcse-dec2012-paper3 unix operating-system non-gatecse

Answer key ☟

35.52.5 Unix: UGC NET CSE | December 2013 | Part 2 | Question: 50

Linux operating system uses

 A. Affinity scheduling B. Fair Preemptive Scheduling
C. Hand Shaking D. Highest Penalty Ratio Next
ugcnetcse-dec2013-paper2 operating-system unix

Answer key ☟

35.52.6 Unix: UGC NET CSE | December 2013 | Part 3 | Question: 67

In Unix, how do you check that two given strings a and b are equal?

A. test $a -eq $b B. test $a -equal $b

C. test $a = $b D. sh -C test $a == $b

ugcnetcse-dec2013-paper3 operating-system unix non-gatecse

Answer key ☟

35.52.7 Unix: UGC NET CSE | December 2013 | Part 3 | Question: 73

Which statement is not true about process O in the Unix operating system ?

A. Process O is called init process.

B. Process O is not created by fork system call.
C. After forking process 1, process O becomes swapper process.
D. Process O is a special process created when system boots

ugcnetcse-dec2013-paper3 operating-system unix

Answer key ☟

35.52.8 Unix: UGC NET CSE | December 2013 | Part 3 | Question: 74

Which of the following commands would return process_id of sleep command?

A. Sleep 1 and echo $ B. Sleep 1 and echo $#

C. Sleep 1 and echo $* D. Sleep 1 and echo $!

ugcnetcse-dec2013-paper3 operating-system non-gatecse unix

Answer key ☟

35.52.9 Unix: UGC NET CSE | December 2015 | Part 2 | Question: 30

In Unix, the login prompt can be changed by changing the contents of the file_____

A. contrab B. init C. gettydefs D. inittab

ugcnetcse-dec2015-paper2 operating-system unix

Answer key ☟

35.52.10 Unix: UGC NET CSE | December 2015 | Part 3 | Question: 56

In Unix, the command to enable execution permission for file "mylife" by all is_____
A. Chmod ugo X mylife B. Chmod a X mylife
C. Chmod X mylife D. All of the above
ugcnetcse-dec2015-paper3 unix operating-system non-gatecse
 Answer key ☟

35.52.11 Unix: UGC NET CSE | December 2015 | Part 3 | Question: 57

What will be the output of the following Unix command?

A. Remove file $\text{chap0[1-3]}$ B. Remove file $\text{chap01, chap02, chap03}$

C. Remove file $\text{chap [1-3]}$ D. None of the above

ugcnetcse-dec2015-paper3 unix operating-system non-gatecse

Answer key ☟

35.52.12 Unix: UGC NET CSE | January 2017 | Part 3 | Question: 51

Match the following for Unix file system :

A. B.
C. D.
ugcnetcse-jan2017-paper3 operating-system unix

Answer key ☟

35.52.13 Unix: UGC NET CSE | January 2017 | Part 3 | Question: 54

Which statements is not correct about “init” process in Unix?

A. It is generally the parent of the login shell.

B. It has PID .
C. It is the first process in the system.
D. Init forks and execs a ‘getty’ process at every port connected to a terminal.

ugcnetcse-jan2017-paper3 operating-system unix

Answer key ☟

35.52.14 Unix: UGC NET CSE | July 2016 | Part 3 | Question: 49

In UNIX , processes that have finished execution but have not yet had their status collected are known as
_________
A. Sleeping processes B. Stopped Processes
C. Zombie Process D. Orphan Processes
ugcnetcse-july2016-paper3 operating-system unix

Answer key ☟
35.52.15 Unix: UGC NET CSE | July 2016 | Part 3 | Question: 50

In UNIX OS , when a process creates a new process using the fork() system call , which of the following state is
shared between the parent process and child process
A. Heap B. Stack
C. Shared memory segments D. Both heap and Stack
ugcnetcse-july2016-paper3 operating-system unix

Answer key ☟

35.52.16 Unix: UGC NET CSE | July 2016 | Part 3 | Question: 51

Which of the following information about the UNIX file system is not correct?

A. Super block contains the number of i-nodes, the number of disk blocks, and the start of the list of free disk blocks
B. An i-node contains accounting information as well as enough information to locate all the disk blocks that holds the
file's data
C. Each i-node is 256-bytes long
D. All the files and directories are stored in data blocks

ugcnetcse-july2016-paper3 operating-system unix

Answer key ☟

35.52.17 Unix: UGC NET CSE | June 2013 | Part 2 | Question: 50

The command changes

A. the inode B. the inode-number
C. the directory entry D. both the directory entry and the inode
ugcnetcse-june2013-paper2 unix

Answer key ☟

35.52.18 Unix: UGC NET CSE | June 2014 | Part 3 | Question: 37

__________ maintains the list of free disk blocks in the Unix file system.

A. I-node B. Boot block

C. Super block D. File allocation table
ugcnetjune2014iii operating-system unix

Answer key ☟

35.52.19 Unix: UGC NET CSE | June 2014 | Part 3 | Question: 46

The output generated by the LINUX command :

$ seq 1 2 10
will be
A. 1 2 10 B. 1 2 3 4 5 6 7 8 9 10
C. 1 3 5 7 9 D. 1 5 10
ugcnetjune2014iii operating-system unix

Answer key ☟

35.52.20 Unix: UGC NET CSE | Junet 2015 | Part 2 | Question: 40

The Unix Kernel maintains two key data structures related to processes, the process table and the user structure.
Which of following information is not the part of user structure?
A. File descriptor table B. System call state
C. Scheduling parameters D. Kernel stack
ugcnetcse-june2015-paper2 unix
 Answer key ☟

35.52.21 Unix: UGC NET CSE | Junet 2015 | Part 3 | Question: 54

A unix file may be of the type

A. Regular file B. Directory file
C. Device file D. Any one of the above
ugcnetcse-june2015-paper3 operating-system unix

Answer key ☟

35.52.22 Unix: UGC NET CSE | Junet 2015 | Part 3 | Question: 73

Match the following for UNIX system calls :

A. B.
C. D.
ugcnetcse-june2015-paper3 operating-system unix

Answer key ☟

35.52.23 Unix: UGC NET CSE | September 2013 | Part 2 | Question: 47

Assume that an implementation of Unix operating system uses i-nodes to keep track of data blocks allocated to a
file. It supports 12 direct block addresses, one in direct block address and one double indirect block address. The
file system has 256 bytes block size and 2 bytes for disk block address. The maximum possible size of a file in this
system is

A. 16 MB B. 16 KB C. 70 KB D. 71 KB
ugcnetsep2013ii operating-system unix

Answer key ☟

35.52.24 Unix: UGC NET CSE | September 2013 | Part 3 | Question: 74

Match the following for Windows Operating System

 A. B.
C. D.
ugcnetcse-sep2013-paper3 operating-system unix

Answer key ☟

35.53 Virtual Memory (7)

35.53.1 Virtual Memory: UGC NET CSE | December 2008 | Part 2 | Question: 42

If the executing program size is greater than the existing of a computer, it is still possible to execute the
program if the supports :

A. multitasking
B. virtual memory
C. paging system
D. none of the above

ugcnetcse-dec2008-paper2 operating-system virtual-memory

Answer key ☟

35.53.2 Virtual Memory: UGC NET CSE | December 2013 | Part 3 | Question: 70

Translation Look-aside Buffer (TLB) is

A. a cache-memory in which item to be searched is compared one-by-one with the keys

B. a cache-memory in which item to be searched is compared with all the keys simultaneously
C. An associative memory in which item to be searched is compared one-by-one with the keys
D. An associative memory in which item to be searched is compared with all the keys simultaneously

ugcnetcse-dec2013-paper3 operating-system cache-memory virtual-memory

Answer key ☟

35.53.3 Virtual Memory: UGC NET CSE | December 2015 | Part 2 | Question: 26

A virtual memory has a page size of words. There are eight pages and four blocks. The associative memory
page table contains the following entries :

Which of the following list of virtual addresses (in decimal) will not cause any page fault if referenced by the CPU?
A. B.
C. D.
ugcnetcse-dec2015-paper2 operating-system virtual-memory

Answer key ☟

35.53.4 Virtual Memory: UGC NET CSE | January 2017 | Part 3 | Question: 2

Which of the following is incorrect for virtual memory?

A. Large programs can be written B. More I/O is required
C. More addressable memory available D. Faster and easy swapping of process
ugcnetcse-jan2017-paper3 operating-system virtual-memory
 Answer key ☟

35.53.5 Virtual Memory: UGC NET CSE | June 2005 | Part 2 | Question: 36

Moving Process from main memory to disk is called :

A. Caching B. Termination C. Swapping D. Interruption

ugcnetcse-june2005-paper2 operating-system virtual-memory

Answer key ☟

35.53.6 Virtual Memory: UGC NET CSE | June 2014 | Part 2 | Question: 31

In a paged memory management algorithm, the hit ratio is %. If it takes nanoseconds to search Translation
Look-aside Buffer (TLB) and nanoseconds (ns) to access memory, the effective memory access time is

A. ns B. ns C. ns D. ns
ugcnetcse-june2014-paper2 operating-system virtual-memory

Answer key ☟

35.53.7 Virtual Memory: UGC NET CSE | June 2019 | Part 2 | Question: 47

The minimum number of page frames that must be allocated to a running process in a virtual memory
environment is determined by

A. page size B. physical size of memory

C. the instruction set architecture D. number of processes in memory
ugcnetcse-june2019-paper2 virtual-memory paging

Answer key ☟

35.54 Vsam (1)

35.54.1 Vsam: UGC NET CSE | December 2010 | Part 2 | Question: 36

The dynamic allocation of storage areas with VSAM files is accomplished by

A. Hashing B. Control splits
C. Overflow areas D. Relative recoding
ugcnetcse-dec2010-paper2 operating-system vsam

Answer key ☟

35.55 Windows (5)

35.55.1 Windows: UGC NET CSE | December 2013 | Part 3 | Question: 68

In windows 2000 operating system all the processor-dependent code is isolated in a dynamic link library called
A. NTFS file system B. Hardware abstraction layer
C. Microkernel D. Process Manger
ugcnetcse-dec2013-paper3 operating-system windows non-gatecse

Answer key ☟

35.55.2 Windows: UGC NET CSE | December 2014 | Part 3 | Question: 73

Which of the following versions of Windows O.S. contain built-in partition manager which allows us to shrink
and expand pre-defined drives ?

A. Windows Vista B. Windows

C. Windows NT D. Windows
ugcnetcse-dec2014-paper3 operating-system windows non-gatecse

Answer key ☟
 35.55.3 Windows: UGC NET CSE | December 2015 | Part 3 | Question: 55

The character set used in Windows operating system is

A. bit ASCII B. Extended ASCII

C. bit UNICODE D. bit UNICODE
ugcnetcse-dec2015-paper3 windows operating-system non-gatecse

Answer key ☟

35.55.4 Windows: UGC NET CSE | June 2013 | Part 3 | Question: 66

The versions of windows operating system like Windows XP and Window Vista uses following file system:

A. FAT-16 B. FAT-32
C. NTFS (NT File System) D. All of the above
ugcnetcse-june2013-paper3 operating-system windows

Answer key ☟

35.55.5 Windows: UGC NET CSE | September 2013 | Part 3 | Question: 73

The portion of Windows 2000 operating system which is not portable is

A. processor management B. user interface
C. device management D. virtual memory management
ugcnetcse-sep2013-paper3 operating-system windows

Answer key ☟

Answer Keys
35.0.1 C 35.0.2 A 35.0.3 A 35.0.4 A 35.0.5 A
35.0.6 A 35.0.7 C 35.0.8 A 35.0.9 C 35.0.10 B
35.0.11 C 35.0.12 B 35.0.13 B 35.0.14 C 35.0.15 X
35.0.16 D 35.0.17 C 35.0.18 Q-Q 35.0.19 Q-Q 35.0.20 N/A
35.0.21 Q-Q 35.0.22 B 35.0.23 Q-Q 35.0.24 Q-Q 35.0.25 Q-Q
35.0.26 Q-Q 35.0.27 X 35.0.28 B 35.0.29 Q-Q 35.0.30 Q-Q
35.0.31 Q-Q 35.0.32 B 35.0.33 C 35.0.34 B 35.0.35 X
35.0.36 N/A 35.0.37 Q-Q 35.0.38 Q-Q 35.0.39 Q-Q 35.0.40 Q-Q
35.0.41 Q-Q 35.0.42 Q-Q 35.0.43 Q-Q 35.0.44 Q-Q 35.0.45 Q-Q
35.0.46 Q-Q 35.0.47 B 35.0.48 Q-Q 35.0.49 Q-Q 35.1.1 C
35.2.1 Q-Q 35.2.2 Q-Q 35.2.3 A 35.3.1 B 35.4.1 C
35.5.1 C 35.6.1 Q-Q 35.6.2 Q-Q 35.6.3 B 35.6.4 Q-Q
35.6.5 Q-Q 35.6.6 D 35.6.7 A 35.6.8 Q-Q 35.6.9 A
35.7.1 D 35.8.1 C 35.9.1 A 35.10.1 A 35.10.2 B
35.10.3 C 35.10.4 C 35.10.5 B 35.10.6 C 35.10.7 B
35.10.8 A 35.10.9 A 35.10.10 D 35.11.1 B 35.12.1 C
35.12.2 X 35.12.3 D 35.12.4 B 35.12.5 C 35.12.6 B
35.12.7 D 35.12.8 C 35.12.9 B 35.13.1 B 35.14.1 Q-Q
35.15.1 B 35.16.1 Q-Q 35.17.1 Q-Q 35.17.2 C 35.17.3 X
35.17.4 B 35.17.5 B 35.17.6 A 35.17.7 B 35.18.1 Q-Q
35.19.1 Q-Q 35.20.1 B 35.21.1 Q-Q 35.22.1 A 35.22.2 C
35.23.1 B 35.23.2 C 35.24.1 A 35.25.1 Q-Q 35.26.1 Q-Q
35.26.2 Q-Q 35.26.3 Q-Q 35.26.4 X 35.26.5 A 35.26.6 B
35.26.7 C 35.26.8 C 35.27.1 A 35.28.1 A 35.29.1 D
35.30.1 C 35.31.1 C 35.31.2 D 35.31.3 Q-Q 35.32.1 Q-Q
35.32.2 Q-Q 35.32.3 D 35.32.4 C 35.32.5 B 35.32.6 A
35.32.7 B 35.32.8 D 35.32.9 D 35.33.1 A 35.34.1 B
35.34.2 B 35.35.1 Q-Q 35.35.2 Q-Q 35.36.1 Q-Q 35.36.2 Q-Q
35.36.3 Q-Q 35.36.4 Q-Q 35.36.5 Q-Q 35.36.6 B 35.36.7 B
35.36.8 D 35.36.9 Q-Q 35.36.10 C 35.36.11 B 35.36.12 Q-Q
35.36.13 Q-Q 35.36.14 Q-Q 35.36.15 A 35.36.16 D 35.36.17 B
35.36.18 D 35.36.19 B 35.36.20 B 35.36.21 B 35.36.22 Q-Q
35.36.23 C 35.36.24 A 35.36.25 A 35.37.1 Q-Q 35.37.2 Q-Q
35.38.1 Q-Q 35.39.1 A 35.39.2 B 35.40.1 Q-Q 35.41.1 Q-Q
35.41.2 Q-Q 35.41.3 B 35.41.4 Q-Q 35.42.1 B 35.43.1 Q-Q
35.43.2 A 35.43.3 D 35.44.1 D 35.44.2 C 35.44.3 D
35.44.4 B 35.44.5 B 35.44.6 C 35.44.7 B 35.45.1 Q-Q
35.46.1 D 35.47.1 D 35.48.1 A 35.48.2 C 35.49.1 D
35.50.1 B 35.50.2 B 35.50.3 A 35.50.4 C 35.51.1 C
35.52.1 3 35.52.2 Q-Q 35.52.3 B 35.52.4 A 35.52.5 B
35.52.6 C 35.52.7 A 35.52.8 D 35.52.9 C 35.52.10 B
35.52.11 B 35.52.12 B 35.52.13 C 35.52.14 C 35.52.15 C
35.52.16 C 35.52.17 C 35.52.18 C 35.52.19 C 35.52.20 C
35.52.21 D 35.52.22 A 35.52.23 X 35.52.24 C 35.53.1 Q-Q
35.53.2 D 35.53.3 C 35.53.4 B 35.53.5 Q-Q 35.53.6 D
35.53.7 C 35.54.1 Q-Q 35.55.1 B 35.55.2 A 35.55.3 C
35.55.4 D 35.55.5 D
36 Others: Others (687)

36.0.1 UGC NET CSE | June 2012 | Part 3 | Question: 42

Which of the following binary tree is optimal, if probabilities of successful search and unsuccessful search are
same?

A.

B.

C.

D.

ugcnetcse-june2012-paper3

Answer key ☟

36.0.2 UGC NET CSE | June 2012 | Part 3 | Question: 47

The colour of an object is largely determined by its diffuse reflection coefficient. If , then what
shall be the colour of the object, of the light used is blue and magenta?

A. White and Red B. Red and Blue C. Black and White D. Black and Red
ugcnetcse-june2012-paper3

Answer key ☟

36.0.3 UGC NET CSE | June 2013 | Part 2 | Question: 1

COCOMO stands for

A. COmposite COst MOdel B. COnstructive COst MOdel
C. COnstructive COmposite MOdel D. COmprehensive COnstruction MOdel
ugcnetcse-june2013-paper2

Answer key ☟

36.0.4 UGC NET CSE | June 2013 | Part 2 | Question: 2

Match the following

 A. B.
C. D.
ugcnetcse-june2013-paper2

Answer key ☟

36.0.5 UGC NET CSE | June 2013 | Part 2 | Question: 4

A good software design must have

A. High module coupling, High module cohesion

B. High module coupling, Low module cohesion
C. Low module coupling, High module cohesion
D. Low module coupling, Low module cohesion

ugcnetcse-june2013-paper2

Answer key ☟

36.0.6 UGC NET CSE | June 2013 | Part 2 | Question: 6

When the following code is executed what will be the value of x and y?
int x=1, y=0;
y=x++;

A. 2, 1 B. 2, 2 C. 1, 1 D. 1, 2
ugcnetcse-june2013-paper2

Answer key ☟

36.0.7 UGC NET CSE | June 2013 | Part 2 | Question: 7

How many values can be held by an array A(-1, m; 1, m)?

A. m B. m C. m(m+1) D. m(m+2)
ugcnetcse-june2013-paper2

Answer key ☟

36.0.8 UGC NET CSE | June 2013 | Part 2 | Question: 8

What is the result of the expression(1&2)+(3/4)?

A. 1 B. 2 C. 3 D. 0
ugcnetcse-june2013-paper2

Answer key ☟

36.0.9 UGC NET CSE | June 2013 | Part 2 | Question: 9

How many times the word ‘print’ shall be printed by the following program segment?
for (i=1, i 2, i++)
 for (j=1, j 2, j++)
for (k=1, k 2, k++)
printf(“print\n”)

A. 1 B. 3 C. 6 D. 8
ugcnetcse-june2013-paper2

Answer key ☟

36.0.10 UGC NET CSE | June 2013 | Part 2 | Question: 10

Which of the following is not a type of Database Management System?

A. Hierarchical B. Network C. Relational D. Sequential

ugcnetcse-june2013-paper2

Answer key ☟

36.0.11 UGC NET CSE | June 2013 | Part 2 | Question: 11

Manager’s salary details are to be hidden from Employee table. This Technique is called as
A. Conceptual level Datahiding B. Physical level Datahiding
C. External level Datahiding D. Logical level Datahiding
ugcnetcse-june2013-paper2

Answer key ☟

36.0.12 UGC NET CSE | June 2013 | Part 2 | Question: 12

A Network Schema
A. restricts to one to many relationship B. permits to many to many relationship
C. Stores Data in a Database D. Stores Data in a Relation
ugcnetcse-june2013-paper2

Answer key ☟

36.0.13 UGC NET CSE | June 2013 | Part 2 | Question: 13

Which normal form is considered as adequate for usual database design?

A. 2NF B. 3NF C. 4NF D. 5NF

ugcnetcse-june2013-paper2

Answer key ☟

36.0.14 UGC NET CSE | June 2013 | Part 2 | Question: 14

If are domains in a relational model, then the relation is a table, which is a subset of
A. B.
C. D.
ugcnetcse-june2013-paper2

Answer key ☟

36.0.15 UGC NET CSE | June 2013 | Part 2 | Question: 15

Which of the following addresses is used to deliver a message to the correct application program running on a
host?

A. Port B. IP C. Logical D. Physical

ugcnetcse-june2013-paper2
 Answer key ☟

36.0.16 UGC NET CSE | June 2013 | Part 2 | Question: 16

In _____ substitution, a character in the plaintext is always changed to the same character in ciphertext,
regardless of its position in the text.
A. polyalphabetic B. monoalphabetic
C. transpositional D. multialphabetic
ugcnetcse-june2013-paper2

Answer key ☟

36.0.17 UGC NET CSE | June 2013 | Part 2 | Question: 18

In hierarchical routing with 4800 routers, what region and cluster sizes should be chosen to minimize the size of
the routing table for the three-layer hierarchy?
A. 10 clusters, 24 regions and 20 routers B. 12 clusters, 20 regions and 20 routers
C. 16 clusters, 12 regions and 25 routers D. 15 clusters, 16 regions and 20 routers
ugcnetcse-june2013-paper2

Answer key ☟

36.0.18 UGC NET CSE | June 2013 | Part 2 | Question: 19

In IPv4 header, the ____ field is needed to allow the destination host to determine which datagram a newly
arrived fragments belongs to
A. identification B. fragment offset
C. time to live D. header checksum
ugcnetcse-june2013-paper2

Answer key ☟

36.0.19 UGC NET CSE | June 2013 | Part 2 | Question: 22

Given a grammar , there is a rightmost derivation

Thus, is a right sentential form, and its handle is __________.

A. B. C. D.
ugcnetcse-june2013-paper2

Answer key ☟

36.0.20 UGC NET CSE | June 2013 | Part 2 | Question: 25

Which is the correct statement(s) for Non Recursive predictive parser?

* *
*

A. Both statements S1 and S2 are incorrect B. S1 is incorrect S2 is correct

C. S1 is correct S2 is incorrect D. Both statements S1 and S2 are correct
ugcnetcse-june2013-paper2

Answer key ☟

36.0.21 UGC NET CSE | June 2013 | Part 2 | Question: 26

Given an open address hash table with load factor , the expected number of probes in a successful search is

A. Atmost In B. Atmost In
C. Atleast In D. Atleast In
ugcnetcse-june2013-paper2
 Answer key ☟

36.0.22 UGC NET CSE | June 2013 | Part 2 | Question: 27

For a B-tree of height h and degree t, the total CPU time used to insert a node is

A. O(h log t) B. O(t log h) C. O(t h) D. O(th)

ugcnetcse-june2013-paper2

Answer key ☟

36.0.23 UGC NET CSE | June 2013 | Part 2 | Question: 29

The value of postfix expression: 834+-382/+*2$3+ is

A. 17 B. 131 C. 64 D. 52
ugcnetcse-june2013-paper2

Answer key ☟

36.0.24 UGC NET CSE | June 2013 | Part 2 | Question: 31

Repository of information gathered from multiple sources, storing under unified scheme at a single site is called

A. Data mining B. Meta Data C. Data warehousing D. Database

ugcnetcse-june2013-paper2

Answer key ☟

36.0.25 UGC NET CSE | June 2013 | Part 2 | Question: 32

The task of correcting and preprocessing data is called as

A. Data streaming B. Data cleaning
C. Data mining D. Data storming
ugcnetcse-june2013-paper2

Answer key ☟

36.0.26 UGC NET CSE | June 2013 | Part 2 | Question: 36

A test contains 100 true/false questions. How many different ways can a student answer the question on the test,
if the answer may be left blank also.

A. B. C. D.
ugcnetcse-june2013-paper2

Answer key ☟

36.0.27 UGC NET CSE | June 2013 | Part 2 | Question: 42

A Boolean operator is defined as follows:

1 1 =1, 1 0 = 0, 0 1 = 0 and 0 0 =1
What will be the truth value of the expression (x y) z=x (y z)?
A. Always true B. Always false
C. Sometimes true D. True when x,y, z are all true
ugcnetcse-june2013-paper2

Answer key ☟
36.0.28 UGC NET CSE | June 2013 | Part 2 | Question: 44

A set of processors can execute in parallel if Bernstein’s conditions are satisfied on a pairwise
basis; that is if and only if:
A. B.
C. D.
ugcnetcse-june2013-paper2

Answer key ☟

36.0.29 UGC NET CSE | June 2013 | Part 2 | Question: 46

A virtual memory based memory management algorithm partially swaps out a process. This is an example of
A. short term scheduling B. long term scheduling
C. medium term scheduling D. mutual exclusion
ugcnetcse-june2013-paper2

Answer key ☟

36.0.30 UGC NET CSE | June 2013 | Part 2 | Question: 49

Consider the following UNIX command:

sort<in>temp; head-30<temp; nm temp
Which of the following functions shall be performed by this command?

A. Sort, taking the input from “temp”, prints 20 lines from temp and delete the file temp
B. Sort eh file “temp”, removes 30 lines from temp and delete the file temp
C. Sort, taking the input from “in” and writing the output to “temp”, then prints 30 lines from temp on terminal. Finally
“temp” is removed
D. Sort, taking the input from “temp”, and then prints 30 lines from “temp” on terminal. Finally “temp” is removed.

ugcnetcse-june2013-paper2

Answer key ☟

36.0.31 UGC NET CSE | December 2013 | Part 2 | Question: 23

______ is often used to prove the correctness of a recursive function.

A. Diagnolization B. Communitivity
C. Mathematical Induction D. Matrix Manipulation
ugcnetcse-dec2013-paper2

Answer key ☟

36.0.32 UGC NET CSE | December 2013 | Part 2 | Question: 40

Answer key ☟

36.0.33 UGC NET CSE | December 2013 | Part 3 | Question: 12

Which is the protocol for performing RPCs between applications in a language and system independent way?

A. Hyper Text Transmission Protocol (HTTP)

B. Simple Network Management Protocol (SNMP)
C. Simple Object Access Protocol (SOAP)
D. Simple Main Transfer Protocol (SMTP)

ugcnetcse-dec2013-paper3
 Answer key ☟

36.0.34 UGC NET CSE | December 2013 | Part 3 | Question: 20

Match the following control strategies of protocol

A. B.
C. D.
ugcnetcse-dec2013-paper3

Answer key ☟

36.0.35 UGC NET CSE | December 2014 | Part 3 | Question: 21

Which of the following statements is not true ?

A. MPI_Isend and MPI_Irecv are non-blocking message passing routines of MPI.

B. MPI_Issend and MPI_Ibsend are non-blocking message passing routines of MPI.
C. MPI_Send and MPI_Recv are non-blocking message passing routines of MPI.
D. MPI_Ssend and MPI_Bsend are blocking message passing routines of MPI.

ugcnetcse-dec2014-paper3

Answer key ☟

36.0.36 UGC NET CSE | December 2013 | Part 3 | Question: 27

In alpha-beta pruning, _____ is used to cut off the search at maximizing level only and ____ is used to cut off
the search at maximizing level only.

A. alpha, beta B. beta, alpha C. alpha, alpha D. beta, beta

ugcnetcse-dec2013-paper3

Answer key ☟

36.0.37 UGC NET CSE | December 2011 | Part 2 | Question: 2

The total number of comparisons in a bubble sort is

A. B. C. D. None of the above

ugcnetcse-dec2011-paper2

Answer key ☟

36.0.38 UGC NET CSE | June 2011 | Part 2 | Question: 2

The circumference of the two concentric disks are divided into sections each. For the outer disk, of the
sections are painted red and of the sections are painted blue. For the inner disk, the sections are painted red
and blue in an arbitrary manner. It is possible to align the two disks so that
A. or more
B. or more
C. or more
 D. or more

of the sections on the inner disks have their colours matched with the corresponding section on outer disk.

ugcnetcse-june2011-paper2

Answer key ☟

36.0.39 UGC NET CSE | June 2011 | Part 2 | Question: 5

The number of 1’s present in the binary representation of is

A. B. C. D.
ugcnetcse-june2011-paper2

Answer key ☟

36.0.40 UGC NET CSE | June 2011 | Part 2 | Question: 6

The hexadecimal number equivalent to is

A. B. C. D.
ugcnetcse-june2011-paper2

Answer key ☟

36.0.41 UGC NET CSE | June 2011 | Part 2 | Question: 7

is equivalent to
A. B.
C. D.
ugcnetcse-june2011-paper2

Answer key ☟

36.0.42 UGC NET CSE | June 2011 | Part 2 | Question: 8

A latch is constructed using two cross-coupled

A. AND and OR gates B. AND gates

C. NAND and NOR gates D. NAND gates
ugcnetcse-june2011-paper2

Answer key ☟

36.0.43 UGC NET CSE | June 2011 | Part 2 | Question: 9

A multiplexer is a logic circuit that

A. Accepts one input and gives several output B. Accepts many inputs and gives many output
C. Accepts many inputs and gives one output D. Accepts one input and gives one output
ugcnetcse-june2011-paper2

Answer key ☟

36.0.44 UGC NET CSE | June 2011 | Part 2 | Question: 10

-bit complement form of is

A. 01001101.0100 B. 01001101.0010
C. 10110010.1011 D. 10110010.1101
ugcnetcse-june2011-paper2

Answer key ☟
36.0.45 UGC NET CSE | June 2011 | Part 2 | Question: 11

From the point of view of the programmer, what are the major advantages of using a high-level language rather
than internal machine code or assembly language?

A. Program portability B. Easy development

C. Efficiency D. None of the above
ugcnetcse-june2011-paper2

Answer key ☟

36.0.46 UGC NET CSE | June 2011 | Part 2 | Question: 12

What features make so powerful ?

A. Easy implementation B. Reusing old code
C. Easy memory management D. All of the above
ugcnetcse-june2011-paper2

Answer key ☟

36.0.47 UGC NET CSE | June 2011 | Part 2 | Question: 17

Which of the following is the process by which a user’s privileges ascertained ?

A. Authorization B. Authentication
C. Access Control D. None of these
ugcnetcse-june2011-paper2 databases

Answer key ☟

36.0.48 UGC NET CSE | June 2011 | Part 2 | Question: 28

Consider the following statement :

(i) The bandwidth of the A.M., wave depends on the band width of the modulating signal.
(ii) The bandwidth of the A.M., wave depends on the modulation index.
(iii) The bandwidth of the F.M, wave for all practical purpose depends on the amplitude of the carrier.
Of these statements the correct statements are

A. (i, ii) B. (i, iii) C. (ii, iii) D. All of the above

ugcnetcse-june2011-paper2 computer-networks

Answer key ☟

36.0.49 UGC NET CSE | June 2011 | Part 2 | Question: 29

A smart modem can dial, hangup and answer incoming calls automatically. Can you tell who provides the
appropriate instructions to the modem for this purpose ?

A. Communication software B. Error detection protocols

C. Link access procedure (LAP) D. Telecommunications
ugcnetcse-june2011-paper2 computer-networks

Answer key ☟

36.0.50 UGC NET CSE | June 2011 | Part 2 | Question: 33

Which of the following permanent database that has an entry for each terminal symbol ?
A. Literal table B. Identifier table
C. Terminal table D. Source table
ugcnetcse-june2011-paper2 databases

Answer key ☟
36.0.51 UGC NET CSE | August 2016 | Part 2 | Question: 17

Relational database schema normalization is NOT for :

A. Reducing the number of joins required to satisfy a query.

B. Eliminating uncontrolled redundancy of data stored in the database.
C. Eliminating number of anomalies that could otherwise occur with inserts and deletes.
D. Ensuring that functional dependencies are enforced.

ugcnetcse-aug2016-paper2

Answer key ☟

36.0.52 UGC NET CSE | August 2016 | Part 3 | Question: 7

Which of the following statements is/are True regarding some advantages that an objectoriented DBMS
(OODBMS) offers over a relational database ?
I. An OODBMS avoids the “impedance mismatch” problem.
II. An OODBMS avoids the “phantom” problem.
III. An OODBMS provides higher performance concurrency control than most relational databases.
IV. An OODBMS provides faster access to individual data objects once they have been read from disk.

A. and only B. and only C. and only D. and only

ugcnetcse-aug2016-paper3 databases

Answer key ☟

36.0.53 UGC NET CSE | January 2017 | Part 3 | Question: 72

A neuron with inputs has the weight vector and a bias . If the input vector is
. Then the total input to the neuron is:

A. B. C. D.
ugcnetcse-jan2017-paper3

Answer key ☟

36.0.54 UGC NET CSE | June 2009 | Part 2 | Question: 11

Assertion : Bit maps are not often used in memory management .

Reason : Searching a bitmap for a run of given length is a slow operation.

A. Both and are true and is correct explanation for

B. Both and are true but is not correct explanation for
C. is true is false
D. is false is true

ugcnetcse-june2009-paper2

36.0.55 UGC NET CSE | June 2009 | Part 2 | Question: 44

The spacing between character pairs is called :

A. Kerning B. x-height
C. intercap D. serif
ugcnetcse-june2009-paper2

Answer key ☟
36.0.56 UGC NET CSE | June 2019 | Part 1 | Question: 48

The present form of Inter University Board that was previously established for promoting cooperation and
coordination among Universities is

A. UGC B. AIU C. NUEPA D. ICSSR

ugcnetcse-june2019-paper1

Answer key ☟

36.0.57 UGC NET CSE | June 2019 | Part 1 | Question: 20

Today’s media-society equation is largely

A. Mystical B. Morally bound

C. Consumer conscious D. Tradition centric
ugcnetcse-june2019-paper1

Answer key ☟

36.0.58 UGC NET CSE | January 2017 | Part 2 | Question: 50

Which of the following statements is/are true w.r.t. Enterprise Resource Planning (ERP)?

I. ERP automates and integrates majority of business processes

II. ERP provides access to information in a Real Time Environment
III. ERP is inexpensive to implement

A. I, II and III are false. B. I and II false III true.

C. I and II true III false. D. I true II and III are false.
ugcnetjan2017ii

Answer key ☟

36.0.59 UGC NET CSE | January 2017 | Part 2 | Question: 46

Match the following :

A. B.
C. D.
ugcnetjan2017ii

Answer key ☟
36.0.60 UGC NET CSE | January 2017 | Part 3 | Question: 69

At which of the following stage(s), the degeneracy do not occur in transportation problem?
( represents number of sources and destinations respectively)

i. While the values of dual variables and cannot be computed

ii. While obtaining an initial solution, we may have less than allocations
iii. At any stage while moving towards optimal solution, when two or more occupied cells with the same minimum
allocation become unoccupied simultaneously.
iv. At a stage when the no, of ve allocation is exactly .

A. (i), (ii) and (iii) B. (i),(iii) and (iv)

C. (i) and (iv) D. (i),(ii),(iii) and (iv)
ugcnetcse-jan2017-paper3

Answer key ☟

36.0.61 UGC NET CSE | January 2017 | Part 3 | Question: 68

With respect to a loop in the transportation table, which one of following is not correct?

A. Every loop has an odd no.of cells and atleast .

B. Closed loops may or may not be square in shape.
C. All the cells in the loop that have a plus or minus sign, except the starting cell, must be occupied cells.
D. Every loop has an even no.of cells and atleast four.

ugcnetcse-jan2017-paper3

Answer key ☟

36.0.62 UGC NET CSE | January 2017 | Part 3 | Question: 67

From the given data below:

which one of the following is not a word in the dictionary created by LZ-coding (the initial words are a,b)?

A. B. C. D.
ugcnetcse-jan2017-paper3

Answer key ☟

36.0.63 UGC NET CSE | January 2017 | Part 3 | Question: 65

A t-error correcting q-nary linear code satisfy :

Where M is the number of code words and X is

A. B. C. D.
ugcnetcse-jan2017-paper3 binary-codes

Answer key ☟

36.0.64 UGC NET CSE | December 2004 | Part 2 | Question: 9

Essential hazards may occur in :

A. Combinational logic circuits

B. Synchronous sequential logic circuits
C. Asynchronous sequential logic circuits working in the fundamental mode
D. Asynchronous sequential logic circuits working in the pulse mode
 ugcnetcse-dec2004-paper2

Answer key ☟

36.0.65 UGC NET CSE | December 2004 | Part 2 | Question: 8

An example of a connective which is not associative is :

A. B. C. D.
ugcnetcse-dec2004-paper2

Answer key ☟

36.0.66 UGC NET CSE | December 2004 | Part 2 | Question: 7

When a tri-state logic device is in the third state, then :

A. it draws low current B. it does not draw any current
C. it draws very high current D. it presents a low impedance
ugcnetcse-dec2004-paper2

Answer key ☟

36.0.67 UGC NET CSE | December 2004 | Part 2 | Question: 6

An example of a binary number which is equal to its ’s complement is :

A. B. C. D.
ugcnetcse-dec2004-paper2

Answer key ☟

36.0.68 UGC NET CSE | December 2004 | Part 2 | Question: 5

If denotes the set of integers modulo , then the following are fields with respect to the operations of
addition modulo and multiplication modulo :

i.
ii.
iii.
iv.

A. (i) only B. (i) and (ii) only

C. (i), (ii) and (iii) only D. (i), (ii), (iii) and (iv)
ugcnetcse-dec2004-paper2

36.0.69 UGC NET CSE | June 2005 | Part 2 | Question: 50

Another name of is :

A. B. Fast Ethernet C. Wi-Fi D.

ugcnetcse-june2005-paper2

36.0.70 UGC NET CSE | June 2005 | Part 2 | Question: 49

Theoretically, how many Carriers are there in a cell ?

A. B. C. D.
ugcnetcse-june2005-paper2
36.0.71 UGC NET CSE | June 2005 | Part 2 | Question: 48

Which interim standard describes inter-switching networking ?

A. B. C. D.
ugcnetcse-june2005-paper2

Answer key ☟

36.0.72 UGC NET CSE | June 2005 | Part 2 | Question: 47

The frequency reuse plan is divided into cell grouping using how many cells, where the number of cells equals
?

A. B. C. D.
ugcnetcse-june2005-paper2

Answer key ☟

36.0.73 UGC NET CSE | June 2005 | Part 2 | Question: 46

and Library functions are implemented on the top of the :

A. Universal Message Passing B. Network Interface Driver
C. Media Access Control D. None of these
ugcnetcse-june2005-paper2

36.0.74 UGC NET CSE | June 2005 | Part 2 | Question: 45

Which type of coupling is least preferred ?

A. Content coupling B. Data coupling

C. Control coupling D. Common coupling
ugcnetcse-june2005-paper2

Answer key ☟

36.0.75 UGC NET CSE | June 2005 | Part 2 | Question: 44

Which one is measure of software complexity ?

A. Number of lines of code B. Number of man years
C. Number of function points D. All of the above
ugcnetcse-june2005-paper2

Answer key ☟

36.0.76 UGC NET CSE | June 2005 | Part 2 | Question: 43

System Development Life-cycle has following stages :

I. Requirement analysis
II. Coding
III. Design
IV. Testing

Which option describes the correct sequence of stages ?

A. III, I, IV, II B. II, III, I, IV
C. I, III, IV, II D. None of the above
ugcnetcse-june2005-paper2

Answer key ☟
36.0.77 UGC NET CSE | June 2005 | Part 2 | Question: 41

The capability maturity model defines levels :

Correct matching is :

ugcnetcse-june2005-paper2

Answer key ☟

36.0.78 UGC NET CSE | June 2005 | Part 2 | Question: 40

Which of the following is not an Unix Command?

A. Whoami B. wc C. Is D. put
ugcnetcse-june2005-paper2

Answer key ☟

36.0.79 UGC NET CSE | June 2005 | Part 2 | Question: 37

The principle of Locality of reference justifies the use of :

A. Virtual memory B. Interrupts

C. Cache memory D. Secondary memory
ugcnetcse-june2005-paper2

Answer key ☟

36.0.80 UGC NET CSE | June 2005 | Part 2 | Question: 34

The dynamic binding occurs during the

A. Compile time B. Run time
C. Linking time D. Pre-processing time
ugcnetcse-june2005-paper2

Answer key ☟

36.0.81 UGC NET CSE | June 2005 | Part 2 | Question: 29

Which protocol is used to encapsulate a data pocket created of a higher model layer ?

A. B. C. D.
ugcnetcse-june2005-paper2

Answer key ☟
36.0.82 UGC NET CSE | June 2005 | Part 2 | Question: 28

Which type of links are used for a connection between two devices ?

A. B. Frame Relay C. D. Modem

ugcnetcse-june2005-paper2

Answer key ☟

36.0.83 UGC NET CSE | June 2005 | Part 2 | Question: 27

Which type of Bridge would be used to connect an Ethernet Segment with a token ring Segment ?
A. Transparent Bridge B. Source-Route Bridge
C. Translation Bridge D. None of these
ugcnetcse-june2005-paper2

Answer key ☟

36.0.84 UGC NET CSE | June 2005 | Part 2 | Question: 26

Which of the following are Data link layer standard ?

1. Ethernet
2.
3. Frame Relay
4. -base
5. Token ring

A. B. C. D.
ugcnetcse-june2005-paper2

Answer key ☟

36.0.85 UGC NET CSE | June 2005 | Part 2 | Question: 25

The algorithm that will efficiently sort an array that is nearly sorted except for the interchange of some adjacent
pairs of numbers like is :

A. Quick sort B. Bubble sort C. Merge sort D. Selection sort

ugcnetcse-june2005-paper2

Answer key ☟

36.0.86 UGC NET CSE | June 2005 | Part 2 | Question: 24

If the postfix form of a string is , the actual string is :

A. B.
C. D.
ugcnetcse-june2005-paper2

Answer key ☟

36.0.87 UGC NET CSE | June 2005 | Part 2 | Question: 22

Which of the following statement is false ?

A. Every tree is a bipertite graph B. A tree contains a cycle

C. A tree with n nodes contains edges D. A tree is a connected graph
ugcnetcse-june2005-paper2

Answer key ☟
36.0.88 UGC NET CSE | June 2005 | Part 2 | Question: 20

A into a portion of a data base is :

A. Schema B. View C. Query D. Data Dictionary

ugcnetcse-june2005-paper2

Answer key ☟

36.0.89 UGC NET CSE | June 2005 | Part 2 | Question: 18

A black hole in a is a :
A. A data store with no in bound flows B. A data store with only in bound flows
C. A data store with more than one in bound flow D. None of these
ugcnetcse-june2005-paper2

Answer key ☟

36.0.90 UGC NET CSE | June 2005 | Part 2 | Question: 17

Which of the following tools is not required during system analysis phase of system development Life cycle ?
A. CASE Tool B. RAD Tool
C. Reverse engineering tool D. None of these
ugcnetcse-june2005-paper2

Answer key ☟

36.0.91 UGC NET CSE | June 2005 | Part 2 | Question: 16

An Entity-relationship diagram is a tool to represent :

A. Data model B. Process model C. Event model D. Customer model

ugcnetcse-june2005-paper2

Answer key ☟

36.0.92 UGC NET CSE | June 2005 | Part 2 | Question: 14

If a data-item is declared as a protected access specifier then it can be accessed :

A. Anywhere in the program B. By the base and derived classes
C. Only by base class D. Only by derived class
ugcnetcse-june2005-paper2

Answer key ☟

36.0.93 UGC NET CSE | June 2005 | Part 2 | Question: 10

Identify the logic function performed by the circuit shown

A. Exclusive- B. C. Exclusive- D.
ugcnetcse-june2005-paper2

Answer key ☟

36.0.94 UGC NET CSE | June 2005 | Part 2 | Question: 8

Which of the following logic has the maximum fan out ?

 A. B. C. D.
ugcnetcse-june2005-paper2

Answer key ☟

36.0.95 UGC NET CSE | June 2005 | Part 2 | Question: 6

, then is equal to :

A. B. C. D.
ugcnetcse-june2005-paper2

Answer key ☟

36.0.96 UGC NET CSE | June 2005 | Part 2 | Question: 5

Minimum number of individual shoes to be picked up from a dark room ( containing pair of shoes) if we have
to get atleast one proper pair :

A. B. C. D. None of these
ugcnetcse-june2005-paper2

Answer key ☟

36.0.97 UGC NET CSE | June 2005 | Part 2 | Question: 4

Consider the relation on the set of non-negative integers defined by if and only if:

A. B.
C. D. None of the above
ugcnetcse-june2005-paper2

Answer key ☟

36.0.98 UGC NET CSE | June 2005 | Part 2 | Question: 2

Identify the language which is not context – free.

A. B.
C. D.
ugcnetcse-june2005-paper2

Answer key ☟

36.0.99 UGC NET CSE | June 2005 | Part 2 | Question: 1

Which of the following is not true ?

A. Power of deterministic automata is equivalent to power of non-deterministic automata

B. Power of deterministic pushdown automata is equivalent to power of non-deterministic pushdown automata
C. Power of deterministic turing machine is equivalent to power of non-deterministic turing machine
D. All the above

ugcnetcse-june2005-paper2

Answer key ☟

36.0.100 UGC NET CSE | December 2005 | Part 2 | Question: 30

Encryption and decryption are the functions of the _________ layer of model :

A. transport B. session C. router D. presentation

ugcnetcse-dec2005-paper2
 Answer key ☟

36.0.101 UGC NET CSE | December 2005 | Part 2 | Question: 29

__________ provide a method to recover data that has been delivered but not get used :
A. Segmentation B. Concatenation
C. Transalation D. Synchronization
ugcnetcse-dec2005-paper2

Answer key ☟

36.0.102 UGC NET CSE | December 2005 | Part 2 | Question: 28

Which of following is an example of a client - server model :

A. B. C. D. All the above

ugcnetcse-dec2005-paper2

36.0.103 UGC NET CSE | December 2005 | Part 2 | Question: 27

Which of following file retrieval methods use hypermedia ?

A. B. Veronica C. D.
ugcnetcse-dec2005-paper2

Answer key ☟

36.0.104 UGC NET CSE | December 2005 | Part 2 | Question: 26

The data unit in the application Layer is called a ____________ .

A. message B. segment C. datagram D. frame

ugcnetcse-dec2005-paper2

Answer key ☟

36.0.105 UGC NET CSE | December 2005 | Part 2 | Question: 21

In what tree, for every node the height of its left subtree and right subtree differ at least by one:
A. Binary search tree B. -tree
C. Threaded binary tree D. Complete tree
ugcnetcse-dec2005-paper2

36.0.106 UGC NET CSE | December 2005 | Part 2 | Question: 20

A locked file can be :

A. accessed by only one user B. modified by users with the correct password
C. is used to hide sensitive information D. both and
ugcnetcse-dec2005-paper2

36.0.107 UGC NET CSE | December 2005 | Part 2 | Question: 19

An embedded printer provides :

A. Physical record key B. An inserted Index
C. A secondary access path D. All the above
ugcnetcse-dec2005-paper2

36.0.108 UGC NET CSE | December 2005 | Part 2 | Question: 17

One approach to standarolizing storing of data :

 A. B.
C. Stuctured Programing D. None of the above
ugcnetcse-dec2005-paper2

Answer key ☟

36.0.109 UGC NET CSE | December 2005 | Part 2 | Question: 16

A schema describes :
A. data elements B. records and files
C. record relationship D. all of the above
ugcnetcse-dec2005-paper2

Answer key ☟

36.0.110 UGC NET CSE | December 2005 | Part 2 | Question: 14

Function over loading done at :

A. Runtime B. Compile time
C. Linking time D. Switching from function to function
ugcnetcse-dec2005-paper2

Answer key ☟

36.0.111 UGC NET CSE | December 2005 | Part 2 | Question: 13

Data members and member function of a class by default is respectively :

A. private and public B. public C. public and private D. private

ugcnetcse-dec2005-paper2

Answer key ☟

36.0.112 UGC NET CSE | December 2005 | Part 2 | Question: 9

Consider the following circuit :

to make it a Tautology the should be :

A. gate B. gate C. gate D. gate

ugcnetcse-dec2005-paper2

Answer key ☟

36.0.113 UGC NET CSE | December 2005 | Part 2 | Question: 8

Consider the following sequence of instructions :

This Sequence
A. retains the value of the and B. complements the value of and
C. swap and D. negates values of and
ugcnetcse-dec2005-paper2

Answer key ☟
36.0.114 UGC NET CSE | December 2005 | Part 2 | Question: 3

Let and be two arbitrary events, then :

A.
B.
C.
D.

ugcnetcse-dec2005-paper2

Answer key ☟

36.0.115 UGC NET CSE | December 2005 | Part 2 | Question: 2

If the proposition is true, then the truth value of the proportion is :

A. True B. Multi – Valued
C. False D. Can not determined
ugcnetcse-dec2005-paper2

36.0.116 UGC NET CSE | December 2005 | Part 2 | Question: 1

is a graph with n vertices. is connected and has exactly edges, then :

A. is a tree
B. contains no cycles
C. Every pairs of vertices in is connected by exactly one path
D. All of these

ugcnetcse-dec2005-paper2

Answer key ☟

36.0.117 UGC NET CSE | June 2006 | Part 2 | Question: 30

The program used to determine the round – trip delay between a workstation and a destination adress is :

A. Tracert B. Traceroute C. Ping D. Pop

ugcnetcse-june2006-paper2

Answer key ☟

36.0.118 UGC NET CSE | June 2006 | Part 2 | Question: 29

What is the function of a translating bridge?

A. Connect similar remote B. Connect similar local
C. Connect different types of D. Translate the network adresses into a layer address
ugcnetcse-june2006-paper2

Answer key ☟

36.0.119 UGC NET CSE | June 2006 | Part 2 | Question: 28

What is the difference between the Ethernet frame preamble field and the preamble and start of
frame Delimiter fields?

A. byte B. bit C. bits D. bits

ugcnetcse-june2006-paper2

Answer key ☟
36.0.120 UGC NET CSE | June 2006 | Part 2 | Question: 27

How much bandwidth is required to send voice- grade channels by on an international satellite
system?

A. B. C. D.
ugcnetcse-june2006-paper2

36.0.121 UGC NET CSE | June 2006 | Part 2 | Question: 26

What is the transmission signal coding method for a carrier called?

A. Binary B. C. Bipolar D. Manchester

ugcnetcse-june2006-paper2

Answer key ☟

36.0.122 UGC NET CSE | June 2006 | Part 2 | Question: 25

Application of data structure queue is :

A. Levelwise printing of tree B. Implementation of priority queues
C. Function call implementation D. Depth first search in a graph
ugcnetcse-june2006-paper2

Answer key ☟

36.0.123 UGC NET CSE | June 2006 | Part 2 | Question: 24

If the post fix form of a string is *, The actual string is:

A. * B. * C. * D. *
ugcnetcse-june2006-paper2

Answer key ☟

36.0.124 UGC NET CSE | June 2006 | Part 2 | Question: 23

Which of the following statement is false?

A. Every tree is a bipartite graph B. A tree contains a cycle
C. A tree with nodes contains edges D. A tree is connected graph
ugcnetcse-june2006-paper2

Answer key ☟

36.0.125 UGC NET CSE | June 2006 | Part 2 | Question: 22

Preorder is also known as:

A. Depth first order B. Breadth first order
C. Topological order D. Linear order
ugcnetcse-june2006-paper2

36.0.126 UGC NET CSE | June 2006 | Part 2 | Question: 21

In the balanced binary tree given below, how many nodes will become unbalanced when a node is inserted as a
child of the node .
 A. B. C. D.
ugcnetcse-june2006-paper2

36.0.127 UGC NET CSE | June 2006 | Part 2 | Question: 20

A subclass having more than one super class is called_________.

A. Category B. Classification
C. Combination D. Partial participation
ugcnetcse-june2006-paper2

36.0.128 UGC NET CSE | June 2006 | Part 2 | Question: 19

Which data management language component enabled the DBA to define the schema components?

A. B. Subschema C. Schema D. All of these

ugcnetcse-june2006-paper2

36.0.129 UGC NET CSE | June 2006 | Part 2 | Question: 18

Which of the following statement is wrong?

A. phase locking protocol suffers from dead locks

B. Time-Stamp protocol suffers from more abort
C. Time-Stamp protocol suffers from cascading rollbacks whereas phase locking protocol do not
D. None of these

ugcnetcse-june2006-paper2

Answer key ☟

36.0.130 UGC NET CSE | June 2006 | Part 2 | Question: 17

Immediate updates as a recovery protocol is preferable, when:

A. Database reads more than writes B. Writes are more than reads
C. It does not matter as it is good in both the situations D. There are only writes
ugcnetcse-june2006-paper2

36.0.131 UGC NET CSE | June 2006 | Part 2 | Question: 16

A relation { } is given with following set of functional dependencies:

{ }
 Which of the following is candidate key?

A. B. C. D. None of these
ugcnetcse-june2006-paper2

Answer key ☟

36.0.132 UGC NET CSE | June 2006 | Part 2 | Question: 15

The function works like but operates on :

A. Data in a file B. stdrr C. stdin D. string

ugcnetcse-june2006-paper2

Answer key ☟

36.0.133 UGC NET CSE | June 2006 | Part 2 | Question: 14

define max is a macro definition, which can find the maximum of two numbers and
if:
A. and are both integers only B. and are both declared as float only
C. and are both declared as double only D. and are both integers, float or double
ugcnetcse-june2006-paper2

36.0.134 UGC NET CSE | June 2006 | Part 2 | Question: 13

If the following loop is implemented

{

int num =0;

do {-- num; printf (“%d”, num); num++;}

while(num>=0)

A. the loop will run infinitely many times

B. the program will not enter the loop
C. there will be compilation error reported
D. a run time error will be reported

ugcnetcse-june2006-paper2

36.0.135 UGC NET CSE | June 2006 | Part 2 | Question: 12

A static variable is one :

A. Which cannot be initialized

B. Which is initialized once at the commencement of execution and cannot be changed at runtime
C. Which retains its value throughout the life of the program
D. Which is the same as an automatic variable but is placed at the head of a program

ugcnetcse-june2006-paper2

36.0.136 UGC NET CSE | June 2006 | Part 2 | Question: 11

What is the output of the following program segment?

main()
{
int count, digit=0;
count=1;
 while (digit<=9)
{
printf (“%d/n”,++count);++digit;
}
}

A. B. C. D.
ugcnetcse-june2006-paper2

36.0.137 UGC NET CSE | June 2006 | Part 2 | Question: 10

Upto how many variables, can the Karnaugh map be used?

A. B. C. D.
ugcnetcse-june2006-paper2

Answer key ☟

36.0.138 UGC NET CSE | June 2006 | Part 2 | Question: 9

In a weighted code with weight the decimal is represented by:

A. B. C. D.
ugcnetcse-june2006-paper2

Answer key ☟

36.0.139 UGC NET CSE | June 2006 | Part 2 | Question: 8

Which of the following logic has the maximum fan out?

A. B. C. D.
ugcnetcse-june2006-paper2

36.0.140 UGC NET CSE | June 2006 | Part 2 | Question: 7

Which of the following expression removes static hazard from a two level gate implementation of

A. B. C. D.
ugcnetcse-june2006-paper2

Answer key ☟

36.0.141 UGC NET CSE | June 2006 | Part 2 | Question: 6

The number of ’s present in the binary representation of is:

A. B. C. D.
ugcnetcse-june2006-paper2

36.0.142 UGC NET CSE | June 2006 | Part 2 | Question: 5

Let The function from to is:

A. injective B. surjective
C. both injective and surjective D. neither injective nor surjective
ugcnetcse-june2006-paper2

Answer key ☟
36.0.143 UGC NET CSE | June 2006 | Part 2 | Question: 3

The preposition is equivalent to :

A. B.
C. D.
ugcnetcse-june2006-paper2

36.0.144 UGC NET CSE | June 2006 | Part 2 | Question: 2

For a complete graph with vertices, the total number of spanning trees is given by:

A. B. C. D.
ugcnetcse-june2006-paper2

Answer key ☟

36.0.145 UGC NET CSE | June 2006 | Part 2 | Question: 1

Which of the following strings is in the language defined by grammar

A. B. C. D.
ugcnetcse-june2006-paper2

Answer key ☟

36.0.146 UGC NET CSE | December 2005 | Part 2 | Question: 50

The mechanism with which several uses can share a medium without interference is :
A. Frequency modulation B. Amplitude modulation
C. Multiplexing D. None of these
ugcnetcse-dec2005-paper2

Answer key ☟

36.0.147 UGC NET CSE | December 2005 | Part 2 | Question: 49

The cost of the network is usually determined by :

A. Time complexity B. Switching complexity
C. Circuit complexity D. None of these
ugcnetcse-dec2005-paper2

36.0.148 UGC NET CSE | December 2005 | Part 2 | Question: 48

Analysis of large database to retrive information is called :

A. B. C. D.
ugcnetcse-dec2005-paper2

Answer key ☟

36.0.149 UGC NET CSE | December 2005 | Part 2 | Question: 47

Which of the following is a standard ?

A. B. C. D.
ugcnetcse-dec2005-paper2

Answer key ☟
36.0.150 UGC NET CSE | December 2005 | Part 2 | Question: 46

Which of the following transonission media is used in Blue tooth Technology :

A. Radio links B. Microwave links
C. Communication D. Fiber - optic
ugcnetcse-dec2005-paper2

36.0.151 UGC NET CSE | December 2005 | Part 2 | Question: 45

Sliding window concept of software project management is :

A. Preparation of comprehenciable plan B. Preparation of the various stages of development
C. Ad-hoc planning D. Requirement analysis
ugcnetcse-dec2005-paper2

Answer key ☟

36.0.152 UGC NET CSE | December 2005 | Part 2 | Question: 44

Succesive layer of design in software using but ton-up design is called :

A. Layer of Definement B. Layer of Construction
C. Layer of abstraction D. None of the above
ugcnetcse-dec2005-paper2

Answer key ☟

36.0.153 UGC NET CSE | December 2005 | Part 2 | Question: 43

The Reliability of the software is directly dependent upon :

A. Quality of the design B. Programmer's experience
C. Number of error D. Set of user requirements
ugcnetcse-dec2005-paper2

Answer key ☟

36.0.154 UGC NET CSE | December 2005 | Part 2 | Question: 42

The lower degree of cohesion is :

A. logical cohesion B. coincidential cohesion

C. procedural cohesion D. communicational cohesion
ugcnetcse-dec2005-paper2

Answer key ☟

36.0.155 UGC NET CSE | December 2005 | Part 2 | Question: 41

The testing of software against is called :

A. Acceptance testing B. Integration testing

C. Regression testing D. Series testing
ugcnetcse-dec2005-paper2

Answer key ☟

36.0.156 UGC NET CSE | December 2005 | Part 2 | Question: 39

Nonmodifiable procedures are called :

A. Serially usable procedure B. Concurrent procedure
C. Reentrant procedure D. Topdown procedure
ugcnetcse-dec2005-paper2

Answer key ☟
36.0.157 UGC NET CSE | December 2005 | Part 2 | Question: 38

Which of the following checks cannot be carried out on the input data to a system?
A. Consistency check B. Syntax check
C. Range check D. All the above
ugcnetcse-dec2005-paper2

Answer key ☟

36.0.158 UGC NET CSE | December 2005 | Part 2 | Question: 37

If you want to execute more than one program at a time, the systems software that are used must be capable of :
A. word processing B. virtual memory
C. compiling D. multitasking
ugcnetcse-dec2005-paper2

Answer key ☟

36.0.159 UGC NET CSE | December 2005 | Part 2 | Question: 36

Producer consumer problem can be solved using :

A. semaphores B. event counters C. monitors D. all the above

ugcnetcse-dec2005-paper2

Answer key ☟

36.0.160 UGC NET CSE | December 2005 | Part 2 | Question: 33

A general macroprocessor is an in built function of :

A. Loader B. Linker C. Editor D. Assembler

ugcnetcse-dec2005-paper2

Answer key ☟

36.0.161 UGC NET CSE | December 2005 | Part 2 | Question: 31

The Register or main memory location which contains the effective address of the operand is known as:

A. Pointer B. Indexed register

C. Special Locations D. Scratch Pad
ugcnetcse-dec2005-paper2

Answer key ☟

36.0.162 UGC NET CSE | December 2004 | Part 2 | Question: 48

The cost of a parallel processing is primarily determined by :

A. Time complexity B. Switching complexity
C. Circuit complexity D. None of the above
ugcnetcse-dec2004-paper2

Answer key ☟

36.0.163 UGC NET CSE | December 2004 | Part 2 | Question: 44

In transform analysis, input portion is called :

A. Afferent branch B. Efferent branch
C. Central Transform D. None of the above
ugcnetcse-dec2004-paper2

Answer key ☟
36.0.164 UGC NET CSE | December 2004 | Part 2 | Question: 39

Non modifiable procedures are called

A. Serially useable procedures B. Concurrent procedures
C. Reentrant procedures D. Topdown procedures
ugcnetcse-dec2004-paper2

Answer key ☟

36.0.165 UGC NET CSE | June 2006 | Part 2 | Question: 50

The use of a smart card represents a form of:

A. password encryption B. user- encryption
C. authorization D. authentication
ugcnetcse-june2006-paper2

Answer key ☟

36.0.166 UGC NET CSE | June 2006 | Part 2 | Question: 49

Predictive modeling in data mining uses____technique.

A. Statistical B. Association Discovery
C. Value prediction D. None of these
ugcnetcse-june2006-paper2

Answer key ☟

36.0.167 UGC NET CSE | June 2006 | Part 2 | Question: 48

Downflow is the process associated with _____ and back up of data in a warehouse.

A. packaging B. archiving C. extraction D. loading

ugcnetcse-june2006-paper2

Answer key ☟

36.0.168 UGC NET CSE | June 2006 | Part 2 | Question: 47

Bluetooth technology uses the transmission media.

A. Radio links B. Microwave links
C. communication D. Optical fiber links
ugcnetcse-june2006-paper2

Answer key ☟

36.0.169 UGC NET CSE | June 2006 | Part 2 | Question: 46

(Multimedia Messaging Service) uses ______ types of messages to perform messaging transactions.

A. B. C. D.
ugcnetcse-june2006-paper2

36.0.170 UGC NET CSE | June 2006 | Part 2 | Question: 45

The model is used for_____.

A. software design B. software cost estimation
C. software cost approximation D. software analysis
ugcnetcse-june2006-paper2

Answer key ☟
36.0.171 UGC NET CSE | June 2006 | Part 2 | Question: 44

System study yields the following:

A. Requirement specifications B. Prevailing process description

C. Data source identification D. All the above
ugcnetcse-june2006-paper2

36.0.172 UGC NET CSE | June 2006 | Part 2 | Question: 43

In a good software design, ____coupling is desirable between modules.

A. Highest B. Lowest C. Internal D. External

ugcnetcse-june2006-paper2

Answer key ☟

36.0.173 UGC NET CSE | June 2006 | Part 2 | Question: 42

In Software Metrics, cyclomatic number is given by following formula:

A. B. C. D. n*
ugcnetcse-june2006-paper2

36.0.174 UGC NET CSE | June 2006 | Part 2 | Question: 41

In software project planning, work Breakdown structure must be______.

A. A graph B. A tree C. A Eular’s graph D. None of the above

ugcnetcse-june2006-paper2

36.0.175 UGC NET CSE | June 2006 | Part 2 | Question: 40

The memory allocation scheme subjected to “external” fragmentation is :

A. Segmentation B. Swapping
C. Demand paging D. Multiple contiguous fixed partitions
ugcnetcse-june2006-paper2

Answer key ☟

36.0.176 UGC NET CSE | June 2006 | Part 2 | Question: 39

_______synchronize critical resources to prevent deadlock.

A. - operator B. - operator C. Semaphores D. Hard disk

ugcnetcse-june2006-paper2

Answer key ☟

36.0.177 UGC NET CSE | June 2006 | Part 2 | Question: 38

A page fault_____.

A. is an error in specific page

B. is an access to the page not currently in main memory
C. occurs when a page program accesses a page of memory
D. is reference to the page which belongs to another program

ugcnetcse-june2006-paper2

Answer key ☟
36.0.178 UGC NET CSE | June 2006 | Part 2 | Question: 37

In processor management, round robin method essentially uses the preemptive version of_____.

A. B. C. D. Longest time first

ugcnetcse-june2006-paper2

Answer key ☟

36.0.179 UGC NET CSE | June 2006 | Part 2 | Question: 36

The first operating system of Microprocessor is_______.

A. B. C. D.
ugcnetcse-june2006-paper2

36.0.180 UGC NET CSE | June 2006 | Part 2 | Question: 35

The dynamic binding occurs during the:

A. Compile time B. Run time
C. Linking time D. Pre-processing time
ugcnetcse-june2006-paper2

Answer key ☟

36.0.181 UGC NET CSE | June 2006 | Part 2 | Question: 34

The action of passing the source program into the proper syntactic class is known as:
A. Syntax analysis B. Lexical analysis
C. Interpretation analysis D. Uniform symbol generation
ugcnetcse-june2006-paper2

Answer key ☟

36.0.182 UGC NET CSE | June 2006 | Part 2 | Question: 33

builds up _____parsing table.

A. B. C. D.
ugcnetcse-june2006-paper2

Answer key ☟

36.0.183 UGC NET CSE | June 2006 | Part 2 | Question: 32

Tasks done in parsing are:

A. Check the validity of a source string B. Determine the syntactic structure of a source string
C. Both A and B D. None of these
ugcnetcse-june2006-paper2

36.0.184 UGC NET CSE | June 2006 | Part 2 | Question: 31

Which statement is wrong

A. If linked origin translated origin, relocation must be performed by the linker

B. If load linked origin, the loader must perform relocation
C. A linker always perform relocation, whereas some loaders do not
D. None of these

ugcnetcse-june2006-paper2
 Answer key ☟

36.0.185 UGC NET CSE | December 2006 | Part 2 | Question: 48

An INT file in Windows 95 is :

A. a program file. B. a message file.
C. a text file. D. link file.

ugcnetcse-dec2006-paper2

Answer key ☟

36.0.186 UGC NET CSE | December 2006 | Part 2 | Question: 47

Which of the following is an EDI standard ?

A. ANSI B. ANSI C. ANSI D. ANSI

ugcnetcse-dec2006-paper2

36.0.187 UGC NET CSE | December 2006 | Part 2 | Question: 46

The frequency band allocated for the downlink in GSM is :

A. B. C. D.

ugcnetcse-dec2006-paper2

36.0.188 UGC NET CSE | December 2006 | Part 2 | Question: 14

When one-dimensional character array of unspecified length is assigned an initial value :

A. an arbitrary character is automatically added to the end of the string

B. ‘o’ is added to the end of the string
C. length of the string is added to the end of the string
D. ‘end’ is added to the end of the string

ugcnetcse-dec2006-paper2

36.0.189 UGC NET CSE | December 2006 | Part 2 | Question: 12

Enumeration variables can be used in :

A. search statement like an integer variable B. break statement
C. preprocessor commands D. function statement
ugcnetcse-dec2006-paper2

36.0.190 UGC NET CSE | December 2006 | Part 2 | Question: 10

Which of the following logic is the fastest ?

A. B. C. D.
ugcnetcse-dec2006-paper2

36.0.191 UGC NET CSE | December 2006 | Part 2 | Question: 5

If is a prime number where a and b N, then :

A. B.
 C. D.
ugcnetcse-dec2006-paper2

36.0.192 UGC NET CSE | December 2006 | Part 2 | Question: 4

Which of the following is not true ?

A. B. A−B=A ∩ ~ B C. D.

ugcnetcse-dec2006-paper2

36.0.193 UGC NET CSE | June 2007 | Part 2 | Question: 50

Which digital radio technology employs an frequency – reuse plan?

A. B. C. D.
ugcnetcse-june2007-paper2

36.0.194 UGC NET CSE | June 2007 | Part 2 | Question: 49

The (Unlicensed National Information Infrastructure) band operates at the _______frequency:

A. B. C. D.
ugcnetcse-june2007-paper2

36.0.195 UGC NET CSE | June 2007 | Part 2 | Question: 48

Dimensional modeling in Data Mining refers to:

A. view and interrogate data B. define structures and store data
C. retrieve information only D. none of these
ugcnetcse-june2007-paper2

36.0.196 UGC NET CSE | June 2007 | Part 2 | Question: 47

Wireless interconnection to the are also known as:

A. Localities B. C. D.
ugcnetcse-june2007-paper2

Answer key ☟

36.0.197 UGC NET CSE | June 2007 | Part 2 | Question: 46

Which technical concept sets cellular apart from all preceding mobile/ratio systems?

A. -Transmission B. Duplex Functionality

C. Frequency Reuse D. Technology
ugcnetcse-june2007-paper2

36.0.198 UGC NET CSE | June 2007 | Part 2 | Question: 45

Which one of the following is a object-oriented approaches:

A. The Booch method B. The Rambaugh method
C. The Load and Yomdon method D. All of the above
ugcnetcse-june2007-paper2

36.0.199 UGC NET CSE | June 2007 | Part 2 | Question: 44

Problems with waterfall model are:

1. Real projects rarely follow this model proposes

 2. It is often difficult for the customer
3. Working model is available only in the end
4. Developers are delayed unnecessarily

Which of the following is true:

A. and only B. and only C. , and only D. , , and

ugcnetcse-june2007-paper2

Answer key ☟

36.0.200 UGC NET CSE | June 2007 | Part 2 | Question: 42

Difference between flow-chart and data-flow diagram is:

A. there is no difference B. usage in high level design and low level design
C. control flow and data flow D. used in application programs and system programs
ugcnetcse-june2007-paper2

36.0.201 UGC NET CSE | June 2007 | Part 2 | Question: 41

Which of the following combination is preferred with respect to cohesion and coupling:

A. low and low B. low and high C. high and low D. high and high
ugcnetcse-june2007-paper2

36.0.202 UGC NET CSE | June 2007 | Part 2 | Question: 40

Cache memory is:

A. High-Speed Register B. Low-Speed

C. Non-Volatile D. High-speed
ugcnetcse-june2007-paper2

Answer key ☟

36.0.203 UGC NET CSE | June 2007 | Part 2 | Question: 39

Which page replacement policy suffers from Belady’s anomaly?

A. B. C. D.
ugcnetcse-june2007-paper2

Answer key ☟

36.0.204 UGC NET CSE | June 2007 | Part 2 | Question: 38

The “nice” command is used in Unix:

A. to decrease the priority of a process B. to increase the priority of a process
C. to get the highest priority D. nothing to do with the priorities
ugcnetcse-june2007-paper2

Answer key ☟

36.0.205 UGC NET CSE | June 2007 | Part 2 | Question: 36

Part of a program where the shared memory is accessed and which should be executed indivisibly, is called:
A. Semaphores B. Directory
C. Critical section D. Mutual exclusion
ugcnetcse-june2007-paper2

Answer key ☟
36.0.206 UGC NET CSE | June 2007 | Part 2 | Question: 35

Moving process from main memory to disk is called:

A. Caching B. Termination C. Swapping D. Interruption

ugcnetcse-june2007-paper2

Answer key ☟

36.0.207 UGC NET CSE | June 2007 | Part 2 | Question: 34

Symbol table can be used for:

A. Checking type compability B. Suppressing duplication of error message
C. Storage allocation D. All of these above
ugcnetcse-june2007-paper2

Answer key ☟

36.0.208 UGC NET CSE | June 2007 | Part 2 | Question: 33

In an absolute loading scheme, which loader function is accomplished by programmer?

A. Allocation B. Linking C. Rellocation D. Both and

ugcnetcse-june2007-paper2

36.0.209 UGC NET CSE | June 2007 | Part 2 | Question: 32

A Top-down Parse generates:

A. Right-most derivation B. Right-most derivation, in reverse

C. Left-most derivation D. Left-most derivation, in reverse
ugcnetcse-june2007-paper2

Answer key ☟

36.0.210 UGC NET CSE | June 2007 | Part 2 | Question: 31

The parsing technique that avoids back tracking is:

A. Top-down parsing B. Recursive-descent parsing
C. Predicative D. Syntax tree
ugcnetcse-june2007-paper2

Answer key ☟

36.0.211 UGC NET CSE | June 2007 | Part 2 | Question: 30

Which of the following protocols is used to prevent looping?

A. B. Spanning tree
C. D. Fragment free switching
ugcnetcse-june2007-paper2

36.0.212 UGC NET CSE | June 2007 | Part 2 | Question: 29

What services does the Internet Layer provide?

1. Quality of service
2. Routing
3. Addressing
4. Connection-oriented delivery
5. Framming bits
 A. B. C. D.
ugcnetcse-june2007-paper2

Answer key ☟

36.0.213 UGC NET CSE | June 2007 | Part 2 | Question: 28

is _____.
A. A primary /secondary type protocol B. A peer/peer protocol
C. A Non-priority peer/peer protocol D. A priority type protocol
ugcnetcse-june2007-paper2

36.0.214 UGC NET CSE | June 2007 | Part 2 | Question: 27

Which of the following techniques are used to control data flow?

1. Windowing
2. Routing
3.
4. Buffering

A. B. C. D.
ugcnetcse-june2007-paper2

Answer key ☟

36.0.215 UGC NET CSE | June 2007 | Part 2 | Question: 26

In case of Bus/Tree topology signal balancing issue is overcome by:

A. Strong Transmitter B. Polling
C. Segmentation D. Modulation
ugcnetcse-june2007-paper2

36.0.216 UGC NET CSE | June 2007 | Part 2 | Question: 25

Application of data structure is queue is:

A. Level wise printing of tree. B. Implementation of priority queues.
C. Function call implementation D. Depth first search in a graph.
ugcnetcse-june2007-paper2

Answer key ☟

36.0.217 UGC NET CSE | June 2007 | Part 2 | Question: 24

Which algorithm has some average, worst case and best case time:
A. Binary search B. Maximum of numbers
C. Quick sort D. Fibonacci search
ugcnetcse-june2007-paper2

36.0.218 UGC NET CSE | June 2007 | Part 2 | Question: 23

The equivalent postfix express for is :

A. B. C. D. None of these
ugcnetcse-june2007-paper2
36.0.219 UGC NET CSE | June 2007 | Part 2 | Question: 22

Pre order is also known as:

A. Depth first order B. Breadth first order
C. Topological order D. Linear order
ugcnetcse-june2007-paper2

36.0.220 UGC NET CSE | June 2007 | Part 2 | Question: 21

The time required to find the shortest path in a graph with vertices and edges is:

A. B. C. D.
ugcnetcse-june2007-paper2

Answer key ☟

36.0.221 UGC NET CSE | June 2007 | Part 2 | Question: 20

Which statement is false regarding data Independence:

A. Hierarchical data model suffers from data Independence.

B. Network model suffers from data Independence.
C. Relational model suffers only from logical data Independence.
D. Relational model suffers only from physical data Independence.

ugcnetcse-june2007-paper2

36.0.222 UGC NET CSE | June 2007 | Part 2 | Question: 19

A Relation { } is given with following set of functional dependencies:

{ }. Which of the following is Candidate Key?

A. B. C. D. None of these
ugcnetcse-june2007-paper2

Answer key ☟

36.0.223 UGC NET CSE | June 2007 | Part 2 | Question: 18

A subclass having more than one super class is called:

A. Category B. Classification
C. Combination D. Partial Participation
ugcnetcse-june2007-paper2

Answer key ☟

36.0.224 UGC NET CSE | June 2007 | Part 2 | Question: 17

A recursive foreign key is a :

A. references a relation B. references a table
C. references its own relation D. references a foreign key
ugcnetcse-june2007-paper2

Answer key ☟

36.0.225 UGC NET CSE | June 2007 | Part 2 | Question: 16

Which of the following statements is wrong?

A. phase Locking Protocols suffer from dead locks.

B. Time-Stamp Protocols suffer from more aborts.
 C. Time-Stamp Protocols suffer from cascading roll back where as phase locking Protocol donot.
D. None of these

ugcnetcse-june2007-paper2

Answer key ☟

36.0.226 UGC NET CSE | June 2007 | Part 2 | Question: 15

Runtime polymorphism can be achieved by:

A. Accessing virtual function through the pointer of the base class

B. Accessing virtual function through the object
C. The derived class
D. None of these

ugcnetcse-june2007-paper2

Answer key ☟

36.0.227 UGC NET CSE | June 2007 | Part 2 | Question: 13

What keyboard in class specification helps to hide data:

A. Public B. Private C. Static D. Void

ugcnetcse-june2007-paper2

Answer key ☟

36.0.228 UGC NET CSE | June 2007 | Part 2 | Question: 12

In case of right shift bitwise operator in language, after shifting bits, the leftmost bits:
A. are always filled with zeros B. are always filled with ones
C. are filled with zeros or ones and is machine dependent D. none of the above
ugcnetcse-june2007-paper2

Answer key ☟

36.0.229 UGC NET CSE | June 2007 | Part 2 | Question: 11

The following loop in :

int i=0;
while (i++<0)i--;

A. will terminate B. will go into an infinite loop

C. will give compilation error D. will never be executed
ugcnetcse-june2007-paper2

Answer key ☟

36.0.230 UGC NET CSE | June 2007 | Part 2 | Question: 10

What is the maximum counting speed of a -bit binary counter which is composed of Flip-Flop with a
propagation delay of ?

A. B. C. D.
ugcnetcse-june2007-paper2

Answer key ☟
36.0.231 UGC NET CSE | June 2007 | Part 2 | Question: 9

If then:
A. B.
C. D.
ugcnetcse-june2007-paper2

Answer key ☟

36.0.232 UGC NET CSE | June 2007 | Part 2 | Question: 8

How many ’s are present in the binary representation of :

A. B. C. D.
ugcnetcse-june2007-paper2

Answer key ☟

36.0.233 UGC NET CSE | June 2007 | Part 2 | Question: 7

Which of the following expression remove hazard form : ?

A. B. C. D.
ugcnetcse-june2007-paper2

36.0.234 UGC NET CSE | June 2007 | Part 2 | Question: 6

’s complement of is:

A. B. C. D.
ugcnetcse-june2007-paper2

Answer key ☟

36.0.235 UGC NET CSE | June 2007 | Part 2 | Question: 5

Which of the following language is regular:

A. { } B. { }
C. { } D. { }
ugcnetcse-june2007-paper2

Answer key ☟

36.0.236 UGC NET CSE | June 2007 | Part 2 | Question: 4

The regular expression given below describes:

*

A. Set of all string not containing

B. Set of all string not containing
C. Set of all string containing
D. Set of all string ending in

ugcnetcse-june2007-paper2

Answer key ☟

36.0.237 UGC NET CSE | June 2007 | Part 2 | Question: 3

The maximum number of nodes in a binary tree of depth :

A. B. C. D. None of the above

 ugcnetcse-june2007-paper2

36.0.238 UGC NET CSE | June 2007 | Part 2 | Question: 2

Depth ion travels of the following directed graph is:

A. B.
C. D. None of the above
ugcnetcse-june2007-paper2

36.0.239 UGC NET CSE | June 2007 | Part 2 | Question: 1

The following determiniotic finite automata recognizes:

A. Set of all strings containing B. Set of all strings containing

C. Set of all strings ending in D. None of the above
ugcnetcse-june2007-paper2

Answer key ☟

36.0.240 UGC NET CSE | December 2007 | Part 2 | Question: 48

Consider a typical mobile communication system. If frequencies are available, how many can be used in a
given cell ?

A. B. C. D.
ugcnetcse-dec2007-paper2

36.0.241 UGC NET CSE | December 2007 | Part 2 | Question: 47

With reference to implementation of different association mining algorithms, identify the correct statement :

A. The FP growth method was usually better than the best implementation of the apriori algorithm
B. Apriori algorithm is usually better than CHARM
C. Apriori algorithm is good when the support required is low
D. At very low support the number of frequent items becomes less
 ugcnetcse-dec2007-paper2

36.0.242 UGC NET CSE | December 2007 | Part 2 | Question: 46

Given a parallel algorithm with computation time , if parallel algorithm performs computational
operation, then processors can execute algorithm in time given by :

A. B. C. D.

ugcnetcse-dec2007-paper2

36.0.243 UGC NET CSE | December 2007 | Part 2 | Question: 43

An error message produced by an interactive system should have :

A. always the error code B. the list of mistakes done by the user displayed
C. a non-judgmental approach D. the past records of the occurrence of the same mistake
ugcnetcse-dec2007-paper2

36.0.244 UGC NET CSE | December 2007 | Part 2 | Question: 39

An example of a directory found in most system is :

A. B. C. D.

ugcnetcse-dec2007-paper2

Answer key ☟

36.0.245 UGC NET CSE | December 2007 | Part 2 | Question: 24

An example of a file extension is :

A. text B. pict C. mp D. web

ugcnetcse-dec2007-paper2

36.0.246 UGC NET CSE | December 2007 | Part 2 | Question: 18

If a relation is in 2NF and 3NF forms then :

A. no non-prime attribute is functionally dependent on other non-prime attributes

B. no non-prime attribute is functionally dependent on prime attributes
C. all attributes are functionally independent
D. prime attribute is functionally independent of all non-prime attributes

ugcnetcse-dec2007-paper2

36.0.247 UGC NET CSE | December 2007 | Part 2 | Question: 10

Amongst the logic families and , the family with the least power dissipation is :

A. B. C. D.

ugcnetcse-dec2007-paper2

Answer key ☟
36.0.248 UGC NET CSE | December 2007 | Part 2 | Question: 9

The dual of the switching function is given by :

A. B. C. D.
ugcnetcse-dec2007-paper2

Answer key ☟

36.0.249 UGC NET CSE | December 2007 | Part 2 | Question: 6

A that is equivalent to the is :

A. B. ~ C. ~ ~ D. ~

ugcnetcse-dec2007-paper2

Answer key ☟

36.0.250 UGC NET CSE | December 2019 | Part 1 | Question: 50

Read the passage carefully and answer question that follow:

There is no doubt that the market as a reality and political economy as a theory played an important role in the
liberal critique. But liberalism is neither the consequence nor the development of these; rather, the market played, in the
liberal critique, the role of a “test, a locus of privileged experience where one can identify the effects of excessive
governmentality and even weigh their significance; the analysis of the mechanisms of “dearth” or more generally, of the
grain trade in the middle of the eighteenth century, was meant to show the point at which governing was always
governing too much. Therefore, an analysis to make visible, in the form of evidence, the formation of the value and
circulation of wealth – or, on the contrary, an analysis pre-supposing the intrinsic invisibility of the connection between
individual profit-seeking and the growth of collective wealth-economics, in any case, shows a basic incompatibility
between the optimal development of the economic process and maximization of government procedures. It is by this,
more than the play of ideas, the French or English economists broke away from mercantilism and commercialism; they
freed reflection on economic practice from the hegemony of the “reason of state” and from the saturation of
governmental intervention. By using it as a measure of “governing too much”, they placed it at the limit of
governmental action. Liberalism does not derive from juridical thought any more than it does from an economic
analysis. It is not the idea of a political society, but the result of search for a liberal technology of a government.
The passage is indicative of the author’s preference to
A. economic hegemony of individuals B. limit government control of economics
C. seek liberalism from juridical thought D. promote individual profits
ugcnetcse-dec2019-paper1

36.0.251 UGC NET CSE | December 2019 | Part 1 | Question: 49

Read the passage carefully and answer questions that follow:

There is no doubt that the market as a reality and political economy as a theory played an important role in the
liberal critique. But liberalism is neither the consequence nor the development of these; rather, the market played, in the
liberal critique, the role of a “test, a locus of privileged experience where one can identify the effects of excessive
governmentality and even weigh their significance; the analysis of the mechanisms of “dearth” or more generally, of the
grain trade in the middle of the eighteenth century, was meant to show the point at which governing was always
governing too much. Therefore, an analysis to make visible, in the form of evidence, the formation of the value and
circulation of wealth – or, on the contrary, an analysis pre-supposing the intrinsic invisibility of the connection between
individual profit-seeking and the growth of collective wealth-economics, in any case, shows a basic incompatibility
between the optimal development of the economic process and maximisation of government procedures. It is by this,
more than the play of ideas, the French or English economists broke away from mercantilism and commercialism; they
freed reflection on economic practice from the hegemony of the “reason of state” and from the saturation of
governmental intervention. By using it as a measure of “governing too much”, they placed it at the limit of
governmental action. Liberalism does not derive from juridical thought any more than it does from an economic
analysis. It is not the idea of a political society, but the result of search for a liberal technology of a government.
What is incompatible with optimal economic development?
 A. Play of ideas B. Absence of commercialism
C. Political society D. Excessive government procedures
ugcnetcse-dec2019-paper1

36.0.252 UGC NET CSE | December 2019 | Part 1 | Question: 48

Read the passage carefully and answer questions that follow:

There is no doubt that the market as a reality and political economy as a theory played an important role in the
liberal critique. But liberalism is neither the consequence nor the development of these; rather, the market played, in the
liberal critique, the role of a “test, a locus of privileged experience where one can identify the effects of excessive
governmentality and even weigh their significance; the analysis of the mechanisms of “dearth” or more generally, of the
grain trade in the middle of the eighteenth century, was meant to show the point at which governing was always
governing too much. Therefore, an analysis to make visible, in the form of evidence, the formation of the value and
circulation of wealth – or, on the contrary, an analysis pre-supposing the intrinsic invisibility of the connection between
individual profit-seeking and the growth of collective wealth-economics, in any case, shows a basic incompatibility
between the optimal development of the economic process and maximisation of government procedures. It is by this,
more than the play of ideas, the French or English economists broke away from mercantilism and commercialism; they
freed reflection on economic practice from the hegemony of the “reason of state” and from the saturation of
governmental intervention. By using it as a measure of “governing too much”, they placed it at the limit of
governmental action. Liberalism does not derive from juridical thought any more than it does from an economic
analysis. It is not the idea of a political society, but the result of search for a liberal technology of a government.
What kind of evidence was needed to make the liberal critique visible?

A. Circulation of wealth B. Pre-supposing individual profit

C. Dearth in supply of grain D. Incompatibility of growth
ugcnetcse-dec2019-paper1

36.0.253 UGC NET CSE | December 2019 | Part 1 | Question: 47

Read the passage carefully and answer questions that follow:

There is no doubt that the market as a reality and political economy as a theory played an important role in the
liberal critique. But liberalism is neither the consequence nor the development of these; rather, the market played, in the
liberal critique, the role of a “test, a locus of privileged experience where one can identify the effects of excessive
governmentality and even weigh their significance; the analysis of the mechanisms of “dearth” or more generally, of the
grain trade in the middle of the eighteenth century, was meant to show the point at which governing was always
governing too much. Therefore, an analysis to make visible, in the form of evidence, the formation of the value and
circulation of wealth – or, on the contrary, an analysis pre-supposing the intrinsic invisibility of the connection between
individual profit-seeking and the growth of collective wealth-economics, in any case, shows a basic incompatibility
between the optimal development of the economic process and maximisation of government procedures. It is by this,
more than the play of ideas, the French or English economists broke away from mercantilism and commercialism; they
freed reflection on economic practice from the hegemony of the “reason of state” and from the saturation of
governmental intervention. By using it as a measure of “governing too much”, they placed it at the limit of
governmental action. Liberalism does not derive from juridical thought any more than it does from an economic
analysis. It is not the idea of a political society, but the result of search for a liberal technology of a government.
The liberal critique examined the implications of
A. market expansion B. too much governance
C. growth of political economy D. politics of marketisation
ugcnetcse-dec2019-paper1

36.0.254 UGC NET CSE | December 2019 | Part 1 | Question: 46

Read the passage carefully and answer questions that follow:

There is no doubt that the market as a reality and political economy as a theory played an important role in the liberal
critique. But liberalism is neither the consequence nor the development of these; rather, the market played, in the liberal
critique, the role of a “test, a locus of privileged experience where one can identify the effects of excessive
governmentality and even weigh their significance; the analysis of the mechanisms of “dearth” or more generally, of the
grain trade in the middle of the eighteenth century, was meant to show the point at which governing was always
governing too much. Therefore, an analysis to make visible, in the form of evidence, the formation of the value and
 circulation of wealth – or, on the contrary, an analysis pre-supposing the intrinsic invisibility of the connection between
individual profit-seeking and the growth of collective wealth-economics, in any case, shows a basic incompatibility
between the optimal development of the economic process and maximisation of government procedures. It is by this,
more than the play of ideas, the French or English economists broke away from mercantilism and commercialism; they
freed reflection on economic practice from the hegemony of the “reason of state” and from the saturation of
governmental intervention. By using it as a measure of “governing too much”, they placed it at the limit of
governmental action. Liberalism does not derive from juridical thought any more than it does from an economic
analysis. It is not the idea of a political society, but the result of search for a liberal technology of a government.
Which of the following played a role in the liberal critique?

A. Liberalism as a consequence of market forces B. Liberalism as an offshoot of political economy

C. Reality of market D. Political economy as a practice
ugcnetcse-dec2019-paper1

36.0.255 UGC NET CSE | December 2019 | Part 1 | Question: 45

Rashtriya Uchhatar Shiksha Abhiyan aims to achieve the following in Higher Education System:

i. Equity
ii. Access
iii.
iv. Excellence

Choose the correct option from those given below:

A. i, ii and iii B. i, iii and iv
C. i, ii and iv D. ii, iii and iv
ugcnetcse-dec2019-paper1

Answer key ☟

36.0.256 UGC NET CSE | December 2019 | Part 1 | Question: 44

Which of the following statements is true in the Indian context?

A. Autonomous colleges can grant degrees independent of universities

B. Autonomous colleges can grant only bachelor’s degree independent of universities
C. Except doctoral degrees, all other degrees and diplomas can be granted by autonomous colleges
D. Whatever may be the degree or diploma, autonomous colleges can grant them under their own name but under the
seal of an affiliated university

ugcnetcse-dec2019-paper1

Answer key ☟

36.0.257 UGC NET CSE | December 2019 | Part 1 | Question: 43

According to (General Agreement on Trade and Services), higher education should be a commodity in
the
A. domestic public sector B. domestic private sector
C. non-trading sector D. global marketplace
ugcnetcse-dec2019-paper1

Answer key ☟

36.0.258 UGC NET CSE | December 2019 | Part 1 | Question: 42

The major barriers for access to higher education in India are:

i. more opportunities of employment for less educated

ii. government policies
iii. language of instruction
iv. economic status
 v. competition from foreign universities
vi. gender discrimination in society

Choose the correct answer from the options given below:

A. i, ii and iii B. ii, iii and v
C. iii, iv and vi D. iv, v and vi
ugcnetcse-dec2019-paper1

Answer key ☟

36.0.259 UGC NET CSE | December 2019 | Part 1 | Question: 41

Database stands for

A. Web of Science B. Web of Sources
C. World of Science D. Web of Service
ugcnetcse-dec2019-paper1

Answer key ☟

36.0.260 UGC NET CSE | December 2019 | Part 1 | Question: 40

The most important pollutants that cause degradation of water quality in rivers and streams are

i. Bacteria
ii. Nutrients
iii. Metals
iv. Total dissolved solids
v. Algae

Choose the most appropriate answer from the options given below:
A. i, ii and iii B. i, ii and iv
C. i, ii, iv and v D. i, ii, iii, iv and v
ugcnetcse-dec2019-paper1

Answer key ☟

36.0.261 UGC NET CSE | December 2019 | Part 1 | Question: 39

The most dominant source of Benzene emissions in ambient air is

A. Cement industry B. Cigarettes
C. Car exhausts D. Paints and varnish
ugcnetcse-dec2019-paper1

Answer key ☟

36.0.262 UGC NET CSE | December 2019 | Part 1 | Question: 38

The themes of some Sustainable Development Goals are

a. Climate action b. Sustainable cities and communities
c. Peace, justice and strong institutions d. Skill development and decent employment
e. Green agriculture f. Responsible consumption and production
Choose the most appropriate from those given below:

A. a, b, c, e and f B. b, c , e and f
C. b, c , d, e and f D. a, b, c and f
ugcnetcse-dec2019-paper1

Answer key ☟
36.0.263 UGC NET CSE | December 2019 | Part 1 | Question: 37

Under Green India Mission, how many hectares of degraded forest land is to be brought under afforestation?
A. million hectares B. million hectares
C. million hectares D. million hectares
ugcnetcse-dec2019-paper1

Answer key ☟

36.0.264 UGC NET CSE | December 2019 | Part 1 | Question: 36

Identify from the options given below, the co-benefit of Montreal Protocol

A. Impetus to development of energy efficient systems

B. Reduction in carbon dioxide (equivalent) emissions
C. Convergence of efforts of international community in addressing air pollution
D. Control of transboundary movement of hazardous waste

ugcnetcse-dec2019-paper1

Answer key ☟

36.0.265 UGC NET CSE | December 2019 | Part 1 | Question: 35

The national agency for responding to computer security incidents as and when they occur, is

A. B. C. D.
ugcnetcse-dec2019-paper1

Answer key ☟

36.0.266 UGC NET CSE | December 2019 | Part 1 | Question: 34

stands for
A. Partial Component Interconnect B. Partial Component Interaction
C. Peripheral Component Interconnect D. Peripheral Component Interaction
ugcnetcse-dec2019-paper1

Answer key ☟

36.0.267 UGC NET CSE | December 2019 | Part 1 | Question: 33

_________ is a wireless technology built in electronic gadgets for transferring data over short distance

A. WiFi B. Bluetooth C. Modem D.

ugcnetcse-dec2019-paper1

Answer key ☟

36.0.268 UGC NET CSE | December 2019 | Part 1 | Question: 32

The term one gigabyte refers to:

A. petabytes B. megabytes
C. kilobytes D. bytes
ugcnetcse-dec2019-paper1

Answer key ☟

36.0.269 UGC NET CSE | December 2019 | Part 1 | Question: 31

Which one of the following tasks is associated with changing appearance of a document in word processing?
 A. Editing B. Formatting C. Writing D. Printing
ugcnetcse-dec2019-paper1

Answer key ☟

36.0.270 UGC NET CSE | December 2019 | Part 1 | Question: 29

The following table gives the percentage of marks obtained by students in different subjects in an
examination. The numbers in the parenthesis give the maximum marks in each subject. Answer the given
questions based on the table:

How many students obtained and above marks in all the subjects?

A. Three B. Two C. One D. Zero

ugcnetcse-dec2019-paper1

Answer key ☟

36.0.271 UGC NET CSE | December 2019 | Part 1 | Question: 28

The following table gives the percentage of marks obtained by students in different subjects in an
examination. The numbers in the parenthesis give the maximum marks in each subject. Answer the given
questions based on the table:

What is the average marks obtained by all the six students in Chemistry?

A. B. C. D.
ugcnetcse-dec2019-paper1

Answer key ☟

36.0.272 UGC NET CSE | December 2019 | Part 1 | Question: 27

The following table gives the percentage of marks obtained by students in different subjects in an
examination. The numbers in the parenthesis give the maximum marks in each subject. Answer the given
questions based on the table:
 What was the aggregate of marks obtained by Sanya in all the five subjects?

A. B. C. D.
ugcnetcse-dec2019-paper1

Answer key ☟

36.0.273 UGC NET CSE | December 2019 | Part 1 | Question: 26

The following table gives the percentage of marks obtained by students in different subjects in an
examination. The numbers in the parenthesis give the maximum marks in each subject. Answer the given
questions based on the table:

What is the overall percentage of marks obtained by Amar?

A. B. C. D.
ugcnetcse-dec2019-paper1

Answer key ☟

36.0.274 UGC NET CSE | December 2019 | Part 1 | Question: 25

According to classical Indian school of logic, what is the correct sequence of steps involved in Anum na
(influence)?

A. Upanaya, Pratij a, Hetu, Ud harana, Nigmana

B. Pratij a, Hetu, Upanaya, Ud harana, Nigmana
C. Pratij a, Upanaya, Hetu, Ud harana, Nigmana
D. Pratij a, Hetu, Ud harana, Upanaya, Nigmana

ugcnetcse-dec2019-paper1

36.0.275 UGC NET CSE | December 2019 | Part 1 | Question: 24

Which one of the following fallacious hetu (middle term) is not uniformly concomitant with the major term?
A. Asatpratipaksa B. Auyatireki
C. Anyonya-Asiddha D. Suy bhic ra
ugcnetcse-dec2019-paper1
36.0.276 UGC NET CSE | December 2019 | Part 1 | Question: 23

Which of the following is converse of “Some is ”?

A. Some is not B. Some is not

C. Some is D. No is
ugcnetcse-dec2019-paper1

Answer key ☟

36.0.277 UGC NET CSE | December 2019 | Part 1 | Question: 22

Consider the following argument:

Some chairs are curtains.
All curtains are bedsheets.
Some chairs are bedsheets
What is the Mood of the above proposition?

A. B. C. D.
ugcnetcse-dec2019-paper1

Answer key ☟

36.0.278 UGC NET CSE | December 2019 | Part 1 | Question: 21

Which one of the following hetwabhasa (fallacy) is involved in the argument, “Sound is element because it is
caused”?

A. Viruddha or contradictory middle

B. Satpratipaksa or inferentially contradicted middle
C. S dhyasama or the unproved middle
D. B dhita or non-inferentially contradicted middle

ugcnetcse-dec2019-paper1

Answer key ☟

36.0.279 UGC NET CSE | December 2019 | Part 1 | Question: 20

What is the exact equivalent discount of three successive discounts of , and by sale of an article?

A. B. C. D.
ugcnetcse-dec2019-paper1

36.0.280 UGC NET CSE | December 2019 | Part 1 | Question: 19

A certain principal invested at compound interest payable yearly amounts to Rs. in years and Rs.
in years. What is the rate of interest?

A. B. C. D.
ugcnetcse-dec2019-paper1

36.0.281 UGC NET CSE | December 2019 | Part 1 | Question: 18

The sum of a number and its inverse is . The sum of their cubes is:

A. B. C. D.
ugcnetcse-dec2019-paper1

Answer key ☟
36.0.282 UGC NET CSE | December 2019 | Part 1 | Question: 17

If of of
and of of ,
then what percentage of is ?
A.

B.

C.

D.

ugcnetcse-dec2019-paper1

36.0.283 UGC NET CSE | December 2019 | Part 1 | Question: 16

In a certain coding language, is written as . Using the same coding language, will
be written as

A. B. C. D.
ugcnetcse-dec2019-paper1

Answer key ☟

36.0.284 UGC NET CSE | December 2019 | Part 1 | Question: 15

Given below are two Statements – One is labelled as Assertion and other is labelled as Reason :
Assertion : Use of slang in formal teaching makes communication lively and interesting.
Reasons : Academic decency demands the avoidance of slang in the classroom environment.
In the light of the above statements, choose the correct option:

A. Both and are true and is the correct explanation of

B. Both and are true and is not the correct explanation of
C. is true, but is false
D. is false, but is true

ugcnetcse-dec2019-paper1

36.0.285 UGC NET CSE | December 2019 | Part 1 | Question: 14

Which of the following modes of communication can be employed in a classroom for effective teaching?

a. Top-down b. Iconic
c. Associational d. Dissociational
e. Symbolic f. Abstract
Choose the most appropriate option from the following:
A. (a), (b) and (f) B. (c) , (e) and (f)
C. (b) , (c) and (e) D. (a), (c) and (d)
ugcnetcse-dec2019-paper1

Answer key ☟
36.0.286 UGC NET CSE | December 2019 | Part 1 | Question: 13

A verbal communication technique used in teaching is

A. Slow expression of words B. Varying the speed of voice and tone
C. Presentation without pause D. Resorting to semantic jugglery
ugcnetcse-dec2019-paper1

Answer key ☟

36.0.287 UGC NET CSE | December 2019 | Part 1 | Question: 12

Information overload in a classroom environment by a teacher will lead to

A. High level participation B. Semantic precision
C. Effective impression D. Delayed feedback
ugcnetcse-dec2019-paper1

Answer key ☟

36.0.288 UGC NET CSE | December 2019 | Part 1 | Question: 11

When there is an animated discussion between a teacher and his or her students in the classroom, it can be
classified as
A. Horizontal communication B. Mechanical communication
C. Linear communication D. Categorical communication
ugcnetcse-dec2019-paper1

Answer key ☟

36.0.289 UGC NET CSE | December 2019 | Part 1 | Question: 10

A research scholar while submitting his/her thesis, did not acknowledge in the preface the help and support of
the respondents of questionnaires. This will be called an instance of
A. Technical lapse B. Wilful negligence
C. Unethical act D. Lack of respect
ugcnetcse-dec2019-paper1

Answer key ☟

36.0.290 UGC NET CSE | December 2019 | Part 1 | Question: 9

In which of the following formats ‘Chapter Scheme’ of the document has to be formally approved by a research
degree committee in the university?
A. Thesis/dissertation B. Seminar papers
C. Research articles D. Research monographs
ugcnetcse-dec2019-paper1

Answer key ☟

36.0.291 UGC NET CSE | December 2019 | Part 1 | Question: 8

Which of the following sampling procedures will be appropriate for conducting researches with empirico-
inductive research paradigm?
A. Simple random sampling procedure B. Systematic sampling procedure
C. Stratified sampling procedure D. Any of the non-probability sampling procedures
ugcnetcse-dec2019-paper1

Answer key ☟

36.0.292 UGC NET CSE | December 2019 | Part 1 | Question: 7

A researcher intends to make use of in his/her research. What considerations should weigh most in such a
decision?
 i. Appropriateness of the tool used
ii. Cost involved in procuring it
iii. Availability of tools in the department where research is to be undertaken
iv. Willingness of his/her supervisor to offer help
v. The company from which the equipment has been procured

Choose your answer from the following options:

A. (i), (ii) and (iii) B. (iii) , (iv) and (v)
C. (i), (iii) and (iv) D. (ii), (iii) and (v)
ugcnetcse-dec2019-paper1

Answer key ☟

36.0.293 UGC NET CSE | December 2019 | Part 1 | Question: 6

A university teacher plans to improve the study habits of students in his/her class. Which type of research
paradigm will be helpful in this regard?
A. Evaluative research paradigm B. Fundamental research paradigm
C. Applied research paradigm D. Action research paradigm
ugcnetcse-dec2019-paper1

Answer key ☟

36.0.294 UGC NET CSE | December 2019 | Part 1 | Question: 5

Which of the following types of assessment is conducted periodically with an eye on standards?
A. Formative assessment B. Summative assessment
C. Portfolio assessment D. Performance assessment
ugcnetcse-dec2019-paper1

Answer key ☟

36.0.295 UGC NET CSE | December 2019 | Part 1 | Question: 4

In which of the following types of learning materials, the presentations are highly structured and individualised?

A. Textbooks prescribed by the universities

B. Journals and the articles recommended for readings
C. Writings of great thinkers selected for reflective readings
D. Programmed instructional and modular learning material

ugcnetcse-dec2019-paper1

Answer key ☟

36.0.296 UGC NET CSE | December 2019 | Part 1 | Question: 3

Which of the following are classroom related factors that influence effectiveness of teaching?

i. Prior task related behavior of students

ii. Adherence to linear pattern of communication by the teacher
iii. Socio-economic status of the family to which learners belong
iv. Inappropriate use of technological resources by the teacher
v. Cultural background of students

Choose your answer from the following options:

A. (i), (ii) and (iii) B. (ii), (iii) and (iv)
C. (i), (ii) and (iv) D. (iii) , (iv) and (v)
ugcnetcse-dec2019-paper1

Answer key ☟
36.0.297 UGC NET CSE | December 2019 | Part 1 | Question: 2

Which of the following statements differentiate teaching from learning?

i. Teaching is a social act while learning is a personal act

ii. Teaching implies learning
iii. Teaching is like selling while learning is like buying
iv. Teaching can occur without learning taking place
v. In teaching, influence is directed towards learning and learner, while in learning it is usually towards oneself

Choose the correct answer from the following options:

A. (i), (iii) and (v) B. (i), (ii) and (iii)
C. (ii), (iii) and (iv) D. (iii) , (iv) and (v)
ugcnetcse-dec2019-paper1

Answer key ☟

36.0.298 UGC NET CSE | December 2019 | Part 1 | Question: 1

Which of the learning outcomes are intended in teaching organized at understanding level?

A. Longer recall and retention of facts

B. Seeking of relationships and patterns among facts
C. Creative construction and critical interpretation of ideas
D. Mastery of facts and information

ugcnetcse-dec2019-paper1

36.0.299 UGC NET CSE | December 2019 | Part 2 | Question: 100

An organization needs to maintain database having five attributes . These attributes are
functionally dependent on each other for which functionality dependency set is given as:
. Consider a universal relation with functional
dependency set . Also all attributes are simple and take atomic values only.
Assume that given table is decomposed in two tables
with functional dependency set and
with set
Which of the following option is true w.r.t. given decomposition?
A. Dependency preservation property is followed B. and are both in
C. is in and is in D. is in and is in
ugcnetcse-dec2019-paper2

Answer key ☟

36.0.300 UGC NET CSE | December 2019 | Part 2 | Question: 99

An organization needs to maintain database having five attributes . These attributes are
functionally dependent on each other for which functionality dependency set is given as:
. Consider a universal relation with functional
dependency set . Also all attributes are simple and take atomic values only.
Identify the redundant functional dependency in
A. B.
C. D.
ugcnetcse-dec2019-paper2

Answer key ☟
36.0.301 UGC NET CSE | December 2019 | Part 2 | Question: 98

An organization needs to maintain database having five attributes . These attributes are
functionally dependent on each other for which functionality dependency set is given as:
. Consider a universal relation with functional
dependency set . Also all attributes are simple and take atomic values only.
Identify the normal form in which relation belong to

A. B. C. D.
ugcnetcse-dec2019-paper2

Answer key ☟

36.0.302 UGC NET CSE | December 2019 | Part 2 | Question: 97

An organization needs to maintain database having five attributes . These attributes are
functionally dependent on each other for which functionality dependency set is given as:
. Consider a universal relation with functional
dependency set . Also all attributes are simple and take atomic values only.
Identify primary key of table with functional dependency set

A. B. C. D.
ugcnetcse-dec2019-paper2

Answer key ☟

36.0.303 UGC NET CSE | December 2019 | Part 2 | Question: 96

An organization needs to maintain database having five attributes . These attributes are
functionally dependent on each other for which functionality dependency set is given as:
. Consider a universal relation with functional
dependency set . Also all attributes are simple and take atomic values only.
MInimal cover of functional dependency set is

A.
B.
C.
D.

ugcnetcse-dec2019-paper2

Answer key ☟

36.0.304 UGC NET CSE | December 2019 | Part 2 | Question: 95

A flow graph with entry node and exit node is shown below:

How many predicate nodes are there and what are their names?
A. Three: B. Three:
C. Four: D. Four:
 ugcnetcse-dec2019-paper2

Answer key ☟

36.0.305 UGC NET CSE | December 2019 | Part 2 | Question: 94

A flow graph with entry node and exit node is shown below:

How many nodes are there in the longest independent path?

A. B. C. D.
ugcnetcse-dec2019-paper2

36.0.306 UGC NET CSE | December 2019 | Part 2 | Question: 93

A flow graph with entry node and exit node is shown below:

How many regions are there in flowgraph ?

A. B. C. D.
ugcnetcse-dec2019-paper2

Answer key ☟

36.0.307 UGC NET CSE | December 2019 | Part 2 | Question: 92

A flow graph with entry node and exit node is shown below:

What is the cyclomatic complexity of flowgraph ?

A. B. C. D.
ugcnetcse-dec2019-paper2

Answer key ☟
36.0.308 UGC NET CSE | December 2019 | Part 2 | Question: 91

A flow graph with entry node and exit node is shown below:

How many nodes are there in flowgraph

A. B. C. D.
ugcnetcse-dec2019-paper2

Answer key ☟

36.0.309 UGC NET CSE | December 2019 | Part 2 | Question: 90

The Data Encryption Standard has a function consists of four steps. Which of the following is correct
order of these four steps?

A. an expansion permutation, -boxes, an operation, a straight permutation

B. an expansion permutation, an operation, -boxes, a straight permutation
C. a straight permutation, -boxes, an operation, an expansion permutation
D. a straight permutation, an operation, -boxes, an expansion permutation

ugcnetcse-dec2019-paper2

Answer key ☟

36.0.310 UGC NET CSE | December 2019 | Part 2 | Question: 89

The sequence diagram given in Figure for the Weather Information System takes place when an external system
requests the summarized data from the weather station. The increasing order of lifeline for the objects in the system are:
 A. Sat comms Weather station Commslink Weather data
B. Sat comms Comms link Weather station Weather data
C. Weather data Comms link Weather station Sat Comms
D. Weather data Weather station Comms link Sat Comms

ugcnetcse-dec2019-paper2

Answer key ☟

36.0.311 UGC NET CSE | December 2019 | Part 2 | Question: 88

Match with :

Choose the correct option from those given below:

A. B.
C. D.
ugcnetcse-dec2019-paper2

Answer key ☟

36.0.312 UGC NET CSE | December 2019 | Part 2 | Question: 87

Match and :

Choose the correct option from those given below:

A. B.
C. D.
ugcnetcse-dec2019-paper2

Answer key ☟

36.0.313 UGC NET CSE | December 2019 | Part 2 | Question: 86

An instruction is stored at location with its address field at location . The address field has the value .
A processor register contains the number . Match the addressing mode given below with
effective address for the given instruction:
 Choose the correct option from those given below:

A. B.
C. D.
ugcnetcse-dec2019-paper2

Answer key ☟

36.0.314 UGC NET CSE | December 2019 | Part 2 | Question: 85

Match with :

Choose the correct option from those given below:

A. B.
C. D.
ugcnetcse-dec2019-paper2

Answer key ☟

36.0.315 UGC NET CSE | December 2019 | Part 2 | Question: 84

Match the Agile Process models with the task performed during the model:

Choose the correct option from those given below:

A.
B.
C.
D.

ugcnetcse-dec2019-paper2

Answer key ☟

36.0.316 UGC NET CSE | December 2019 | Part 2 | Question: 83

According to the Standard Quality Model, match the attributes given in with their definitions
in :
 Choose the correct options from the ones given below:

A.
B.
C.
D.

ugcnetcse-dec2019-paper2

Answer key ☟

36.0.317 UGC NET CSE | December 2019 | Part 2 | Question: 82

Match and :

Choose the correct option from those given below:

A.
B.
C.
D.

ugcnetcse-dec2019-paper2

Answer key ☟

36.0.318 UGC NET CSE | December 2019 | Part 2 | Question: 81

Consider the following learning algorithms:

a. Logistic repression b. Back propogation

c. Linear repression Which of the following option represents classification
algorithms?
A. (a) and (b) only B. (a) and (c) only
C. (b) and (c) only D. (a), (b) and (c)
ugcnetcse-dec2019-paper2
36.0.319 UGC NET CSE | December 2019 | Part 2 | Question: 80

Consider the following:

a. Trapping at local maxima b. Reaching a plateau
c. Traversal along the ridge Which of the following option represents shortcomings of
the hill climbing algorithm?

A. (a) and (b) only B. (a) and (c) only

C. (b) and (c) only D. (a), (b) and (c)
ugcnetcse-dec2019-paper2

Answer key ☟

36.0.320 UGC NET CSE | December 2019 | Part 2 | Question: 79

Consider the following statements with respect to network security:

i. Message confidentiality means that the sender and the receiver expect privacy
ii. Message integrity means that the data must arrive at the receiver exactly as they were sent.
iii. Message authentication means the receiver is ensured that the message is coming from the intended sender

Which of the statements is (are) correct?

A. Only (i) and (ii) B. Only (i) and (iii)
C. Only (ii) and (iii) D. (i), (ii) and (iii)
ugcnetcse-dec2019-paper2

Answer key ☟

36.0.321 UGC NET CSE | December 2019 | Part 2 | Question: 78

Consider the following statements:

i. Windows Azure is a cloud-based operating system.

ii. Google App Engine is an integrated set of online services for consumers to communicate and share with others.
iii. Amazon Cloud Front is a web service for content delivery.

Which of the following statements is (are) correct?

A. Only (i) and (ii) B. Only (i) and (iii)
C. Only (ii) and (iii) D. (i), (ii) and (iii)
ugcnetcse-dec2019-paper2

Answer key ☟

36.0.322 UGC NET CSE | December 2019 | Part 2 | Question: 77

Consider the following statements:

i. Fiber optic cable is much lighter than copper cable

ii. Fiber optic cable is not affected by power surges or electromagnetic interference
iii. Optical transmission is inherently bidirectional

Which of the statements is (are) correct?

A. Only (i) and (ii) B. Only (i) and (iii)
C. Only (ii) and (iii) D. (i), (ii) and (iii)
ugcnetcse-dec2019-paper2

Answer key ☟

36.0.323 UGC NET CSE | December 2019 | Part 2 | Question: 76

Consider the following statements:

 i. The running time of dynamic programming algorithm is always where is number of subproblems
ii. When a recurrence relation has a cyclic dependency, it is impossible to use that recurrence relation (unmodified) in
a correct dynamic program.
iii. For a dynamic programming algorithm, computing all values in a bottom-up fashion is asymptotically faster than
using recursion and memorization
iv. If a problem can be reduced to a known -hard problem, then must be -hard

Which of the statement(s) is (are) true?

A. Only (ii) and (i) B. Only (ii) C. Only (ii) and (iii) D. Only (ii) and (iv)
ugcnetcse-dec2019-paper2

Answer key ☟

36.0.324 UGC NET CSE | December 2019 | Part 2 | Question: 75

The following multithreaded algorithm computes transpose of a matrix in parallel:

p Trans
if
then
else partition into four submatrices
partition into four submatrices
spawn p Trans
spawn p Trans
spawn p Trans
spawn p Trans
What is the asymptotic parallelism of the algorithm?
A. or B. or
C. or D. or
ugcnetcse-dec2019-paper2

Answer key ☟

36.0.325 UGC NET CSE | December 2019 | Part 2 | Question: 74

Identify the circumstances under which pre-emptive scheduling is used:

a. A process switches from Running state to Ready state b. A process switches from Waiting state to Ready state
c. A process completes its execution d. A process switches from Ready to Waiting state
Choose the correct option:
A. (a) and (b) only B. (a) and (d) only
C. (c) and (d) only D. (a), (b), (c) only
ugcnetcse-dec2019-paper2

Answer key ☟

36.0.326 UGC NET CSE | December 2019 | Part 2 | Question: 73

Two concurrent executing transactions and are allowed to update same stock item say in an
uncontrolled manner. In such scenario, following problems may occur:
a. Dirty read problem b. Lost update problem
c. Transaction failure d. Inconsistent database state
Which of the following option is correct if database system has no concurrency module and allows concurrent execution
of above two transactions?
A. (a), (b) and (c) only B. (c) and (d) only
C. (a) and (b) only D. (a), (b) and (d) only
ugcnetcse-dec2019-paper2
 Answer key ☟

36.0.327 UGC NET CSE | December 2019 | Part 2 | Question: 72

Which of the following are legal statements in programming language?

i. int *P=&44;

ii. int *P=&r;

iii. int P=&a;

iv. int P=a;

Choose the correct option:

A. (i) and (ii) B. (ii) and (iii) C. (ii) and (iv) D. (i) and (iv)
ugcnetcse-dec2019-paper2

Answer key ☟

36.0.328 UGC NET CSE | December 2019 | Part 2 | Question: 71

Which of the following statements are true regarding ?

i. Overloading gives the capability to an existing operator to operate on other data types
ii. Inheritance in object oriented programming provides support to reusability
iii. When object of a derived class is defined, first the constructor of derived class is excecuted then constructor of a
base class is executed
iv. Overloading is a type of polymorphism

Choose the correct option from those given below:

A. (i) and (ii) only B. (i), (ii) and (iii) only
C. (i), (ii) and (iv) only D. (ii), (iii) and (iv) only
ugcnetcse-dec2019-paper2

Answer key ☟

36.0.329 UGC NET CSE | December 2019 | Part 2 | Question: 70

Consider the following statements with respect to approaches to fill area on raster systems:
: To determine the overlap intervals for scan lines that cross the area
: To start from a given interior position and pain outward from this point until we encounter the specified boundary
conditions.
Select the correct answer from the options given below:

A. only B. only C. Both and D. Neither nor

ugcnetcse-dec2019-paper2

Answer key ☟

36.0.330 UGC NET CSE | December 2019 | Part 2 | Question: 69

Which of the following binary codes for decimal digits are self complementing?

i. code
ii. code
iii. excess- code
iv. excess- gray code

Choose the correct option:

 A. (i) and (ii) B. (ii) and (iii) C. (iii) and (iv) D. (iv) and (i)
ugcnetcse-dec2019-paper2

Answer key ☟

36.0.331 UGC NET CSE | December 2019 | Part 2 | Question: 68

The Reduced Instruction Set Computer characteristics are:

i. Single cycle instruction execution

ii. Variable length instruction formats
iii. Instructions that manipulates operands in memory
iv. Efficient instruction pipeline

Choose the correct characteristics from the options given below:

A. (i) and (ii) B. (ii) and (iii) C. (i) and (iv) D. (iii) and (iv)
ugcnetcse-dec2019-paper2

Answer key ☟

36.0.332 UGC NET CSE | December 2019 | Part 2 | Question: 67

Consider the following statements with respect to duality in :

i. The final simplex table giving optimal solution of the primal also contains optimal solution of its dual in itself
ii. If either the primal or the dual problem has a finite optimal solution, then the other problem also has a finite optimal
solution
iii. If either problem has an unbounded optimum solution, then the other problem has no feasible solution at all

Which of the statements is (are) correct?

A. Only (i) and (ii) B. Only (i) and (iii)
C. only (ii) and (iii) D. (i), (ii) and (iii)
ugcnetcse-dec2019-paper2

Answer key ☟

36.0.333 UGC NET CSE | December 2019 | Part 2 | Question: 66

Consider the following statements:

: If a group is of order , and is such that for some integer , then must divide
.
: If a group is of even order, then there must be an element such that and .
Which of the statements is (are) correct?

A. Only B. Only C. Both and D. Neither and

ugcnetcse-dec2019-paper2

Answer key ☟

36.0.334 UGC NET CSE | December 2019 | Part 2 | Question: 65

Let the population of chromosomes in genetic algorithm is represented in terms of binary number. The strength
of fitness of a chromosome in decimal form, , is given by

where

The population is given by where:

The strength of fitness of chromosome is ________

 A. B. C. D.
ugcnetcse-dec2019-paper2

Answer key ☟

36.0.335 UGC NET CSE | December 2019 | Part 2 | Question: 64

The order of schema and are _______ and _______ respectively.

A. B. C. D.
ugcnetcse-dec2019-paper2

Answer key ☟

36.0.336 UGC NET CSE | December 2019 | Part 2 | Question: 63

Let represents weight between node at layer and node at layer of a given multilayer perceptron.
The weight updation using gradient descent method is given by

A.

B.

C.

D.

Where and represents learning rate and Error in the output respectively.

ugcnetcse-dec2019-paper2

36.0.337 UGC NET CSE | December 2019 | Part 2 | Question: 62

A fuzzy conjuction operators, , and a fuzzy disjunction operator, , form a pair if they satisfy:
.
If then is given by

A. B. C. D.

ugcnetcse-dec2019-paper2

36.0.338 UGC NET CSE | December 2019 | Part 2 | Question: 61

Consider the following models:

: Mamdani model
: Takagi – Sugeno – Kang model
: Kosko’s additive model
Which of the following option contains examples of additive rule model?

A. Only and B. Only and C. Only and D. , and

ugcnetcse-dec2019-paper2

Answer key ☟
36.0.339 UGC NET CSE | December 2019 | Part 2 | Question: 60

Consider the game tree given below:

Here and represent MIN and MAX nodes respectively, The value of the root node of the game tree is:

A. B. C. D.
ugcnetcse-dec2019-paper2

Answer key ☟

36.0.340 UGC NET CSE | December 2019 | Part 2 | Question: 59

Consider the following statements:

and are not logically equivalent.
and are not logically equivalent
Which of the following statements is/are correct?

A. Only B. Only C. Both and D. Neither nor

ugcnetcse-dec2019-paper2

36.0.341 UGC NET CSE | December 2019 | Part 2 | Question: 58

According to Dempster-Shafer theory for uncertainity management,

A. B.
C. D.
Where denotes Belief of event .

ugcnetcse-dec2019-paper2

Answer key ☟

36.0.342 UGC NET CSE | December 2019 | Part 2 | Question: 57

The full form of is

A. Internet Corporation for Assigned Names and Numbers

B. Internet Corporation for Assigned Numbers and Names
C. Institute of Cooperation for Assigned Names and Numbers
D. Internet Connection for Assigned Names and Numbers
 ugcnetcse-dec2019-paper2

Answer key ☟

36.0.343 UGC NET CSE | December 2019 | Part 2 | Question: 56

A network with bandwidth of can pass only an average of frames per minute with each frame
carrying an average of bits. What is the throughput of this network?
A. B.
C. D.
ugcnetcse-dec2019-paper2

Answer key ☟

36.0.344 UGC NET CSE | December 2019 | Part 2 | Question: 55

Piconet is a basic unit of a bluetooth system consisting of __________ master node and up to _________ active
slave nodes.

A. one, five B. one, seven C. two, eight D. one, eight

ugcnetcse-dec2019-paper2

Answer key ☟

36.0.345 UGC NET CSE | December 2019 | Part 2 | Question: 54

Consider a subnet with routers. If a three-level hierarchy is chosen, with eight clusters, each containing
regions of routers, then total number of entries in hierarchical table of each router is

A. B. C. D.
ugcnetcse-dec2019-paper2

Answer key ☟

36.0.346 UGC NET CSE | December 2019 | Part 2 | Question: 53

Which of the following class of address has the last address as ?

A. Class B. Class C. Class D. Class

ugcnetcse-dec2019-paper2

Answer key ☟

36.0.347 UGC NET CSE | December 2019 | Part 2 | Question: 52

Let and . Similarly, let and

.
Which of the following pairs have a post-correspondence solution?
A. Only pair B. Only pair
C. Both and D. Neither nor
ugcnetcse-dec2019-paper2

Answer key ☟

36.0.348 UGC NET CSE | December 2019 | Part 2 | Question: 51

Consider the following statements:

: These exists no algorithm for deciding if any two Turing machines and accept the same language
: Let and be arbitrary Turing machines. The problem to determine is undecidable
Which of the statements is (are) correct?
 A. Only B. Only C. Both and D. Neither nor
ugcnetcse-dec2019-paper2

Answer key ☟

36.0.349 UGC NET CSE | December 2019 | Part 2 | Question: 50

Consider the following language families:

The context-free languages
The context-sensitive languages
The recursively enumerable languages
The recursive languages
Which one of the following options is correct?

A.
B.
C.
D.

ugcnetcse-dec2019-paper2

Answer key ☟

36.0.350 UGC NET CSE | December 2019 | Part 2 | Question: 49

Let be any context-free grammar without any -productions or unit productions. Let be the
maximum number of symbols on the right of any production in . The maximum number of production rules
for any equivalent grammar in Chomsky normal form is given by:
A. B.
C. D.
Where denotes the cardinality of the set.

ugcnetcse-dec2019-paper2

Answer key ☟

36.0.351 UGC NET CSE | December 2019 | Part 2 | Question: 47

Consider the following statements with respect to the language

is a context free language
is context free language for any given
and are context free languages
Which one of the following is correct?

A. only and B. only and C. only and D. , and

ugcnetcse-dec2019-paper2

Answer key ☟

36.0.352 UGC NET CSE | December 2019 | Part 2 | Question: 46

Consider and . Define homomorphism by:

If is the regular language denoted by , then the regular language is given by

 A. B.
C. D.
ugcnetcse-dec2019-paper2

Answer key ☟

36.0.353 UGC NET CSE | December 2019 | Part 2 | Question: 45

Consider the following grammar:

Which language does this grammar generate?

A. B.
C. D.
ugcnetcse-dec2019-paper2

Answer key ☟

36.0.354 UGC NET CSE | December 2019 | Part 2 | Question: 44

Consider the language on . Which one of the following grammars generates

the language ?

A.
B.
C.
D.

ugcnetcse-dec2019-paper2

Answer key ☟

36.0.355 UGC NET CSE | December 2019 | Part 2 | Question: 43

Consider the following grammars:

Which of the following is correct w.r.t. the above grammars?

A. and are equivalent B. and are equivalent
C. and are equivalent D. and are equivalent
ugcnetcse-dec2019-paper2

Answer key ☟

36.0.356 UGC NET CSE | December 2019 | Part 2 | Question: 42

The time complexity to multiply two polynomials of degree using Fast Fourier transform method is:

A. B. C. D.
ugcnetcse-dec2019-paper2

Answer key ☟
36.0.357 UGC NET CSE | December 2019 | Part 2 | Question: 41

When using Dijkstra’s algorithm to find shortest path in a graph, which of the following statement is not true?

A. It can find shortest path within the same graph data structure
B. Every time a new node is visited, we choose the node with smallest known distance/ cost (weight) to visit first
C. Shortest path always passes through least number of vertices
D. The graph needs to have a non-negative weight on every edge

ugcnetcse-dec2019-paper2

Answer key ☟

36.0.358 UGC NET CSE | December 2019 | Part 2 | Question: 40

Consider a weighted directed graph. The current shortest distance from source to node is represented by
. Let , , . What is the updated value of based on current information?

A. B. C. D.
ugcnetcse-dec2019-paper2

Answer key ☟

36.0.359 UGC NET CSE | December 2019 | Part 2 | Question: 39

Give asymptotic upper and lower bound for given below. Assume is constant for .

A.
B.
C.
D.

ugcnetcse-dec2019-paper2

Answer key ☟

36.0.360 UGC NET CSE | December 2019 | Part 2 | Question: 38

In a B-Tree, each node represents a disk block. Suppose one block holds bytes. Each key uses bytes. In a
B-tree of order there are keys. Since each branch is on another disk block, we assume a branch is of
bytes. The total memory requirement for a non-leaf node is

A. B.
C. D.
ugcnetcse-dec2019-paper2

Answer key ☟

36.0.361 UGC NET CSE | December 2019 | Part 2 | Question: 37

What is the worst case running time of Insert and Extract-min, in an implementation of a priority queue using an
unsorted array? Assume that all the insertions can be accomodated.
A. B.
C. D.
ugcnetcse-dec2019-paper2

Answer key ☟

36.0.362 UGC NET CSE | December 2019 | Part 2 | Question: 36

A clique in an undirected graph is a subset of vertices, such that

 A. If then and
B. If then or
C. Each pair of vertices in is connected by an edge
D. All pairs of vertices in are not connected by an edge

ugcnetcse-dec2019-paper2

Answer key ☟

36.0.363 UGC NET CSE | December 2019 | Part 2 | Question: 35

Let and . For , and , What is the

value of ?

A. B. C. D.
ugcnetcse-dec2019-paper2

Answer key ☟

36.0.364 UGC NET CSE | December 2019 | Part 2 | Question: 34

An _______ chart is a project schedule representation that presents project plan as a directed graph. The critical
path is the __________ sequence of ________ tasks and it defines project ________.
A. Activity, Shortest, Independent, Cost B. Activity, Longest, Dependent, Duration
C. Activity, Longest, Independent, Duration D. Activity, Shortest, Dependent, Duration
ugcnetcse-dec2019-paper2

Answer key ☟

36.0.365 UGC NET CSE | December 2019 | Part 2 | Question: 33

In a system for a restaurant, the main scenario for placing order is given below:

i. Customer reads menu

ii. Customer places order
iii. Order is sent to kitchen for preparation
iv. Ordered items are served
v. Customer requests for a bill for the order
vi. Bill is prepared for this order
vii. Customer is given the bill
viii. Customer pays the bill

A sequence diagram for the scenario will have at least how many objects among whom the messages will be exchanged

A. B. C. D.
ugcnetcse-dec2019-paper2

Answer key ☟

36.0.366 UGC NET CSE | December 2019 | Part 2 | Question: 32

Java Virtual Machine is used to execute architectural neutral byte code. Which of the following is
needed by the for execution of Java Code?
A. Class loader only B. Class loader and Java Interpreter
C. Class loader, Java Interpreter and D. Java Interpreter only
ugcnetcse-dec2019-paper2

Answer key ☟
36.0.367 UGC NET CSE | December 2019 | Part 2 | Question: 31

Which of the following methods are used to pass any number of parameters to the operating system through
system calls?
A. Registers B. Block or table in main memory
C. Stack D. Block in main memory and stack
ugcnetcse-dec2019-paper2

Answer key ☟

36.0.368 UGC NET CSE | December 2019 | Part 2 | Question: 30

Given time slice of and following list of processes.

Find average turnaround time and average waiting time using round robin scheduling?

A. B. C. D.
ugcnetcse-dec2019-paper2

Answer key ☟

36.0.369 UGC NET CSE | December 2019 | Part 2 | Question: 29

Which of the following interprocess communication model is used to exchange messages among co-operative
processes?
A. Shared memory model B. Message passing model
C. Shared memory and message passing model D. Queues
ugcnetcse-dec2019-paper2

Answer key ☟

36.0.370 UGC NET CSE | December 2019 | Part 2 | Question: 28

Suppose a system has magnetic tape drives and at time , three processes are allotted tape drives out of their
need as given below:

At time , the system is in safe state. Which of the following is safe sequence so that deadlock is avoided?

A.
B.
C.
D.

ugcnetcse-dec2019-paper2

Answer key ☟
36.0.371 UGC NET CSE | December 2019 | Part 2 | Question: 27

Consider a paging system where translation look aside buffer ( ) a special type of associative memory is used
with hit ratio of .
Assume that memory reference takes nanoseconds and reference time to is nanoseconds. What will be the
effective memory access time given hit ratio?
A. nanoseconds B. nanoseconds
C. nanoseconds D. nanoseconds
ugcnetcse-dec2019-paper2

Answer key ☟

36.0.372 UGC NET CSE | December 2019 | Part 2 | Question: 26

Which of the following scheduling algorithms is/are supported by operating system?

A. Non-preemptive priority scheduling B. Preemptive priority scheduling and time sharing
scheduling
C. Time sharing scheduling only D. Priority scheduling only
ugcnetcse-dec2019-paper2

Answer key ☟

36.0.373 UGC NET CSE | December 2019 | Part 2 | Question: 25

Which of the following is not needed by an encryption algorithm used in Cryptography?

A. B. Message C. Ciphertext D. User details

ugcnetcse-dec2019-paper2

Answer key ☟

36.0.374 UGC NET CSE | December 2019 | Part 2 | Question: 24

A counting semaphore is initialized to . wait ( ) operations and signal ( ) operations are applied. Find the
current value of semaphore variable.

A. B. C. D.
ugcnetcse-dec2019-paper2

Answer key ☟

36.0.375 UGC NET CSE | December 2019 | Part 2 | Question: 21

Given two tables and with and number of tuples respectively. Find maximum number of
tuples in the output of natural join between tables and i.e. ? ( - Natural Join)

A. B. C. D.
ugcnetcse-dec2019-paper2

Answer key ☟

36.0.376 UGC NET CSE | December 2019 | Part 2 | Question: 20

Which of the component module of does rearrangement and possible ordering of operations, eliminate
redundancy in query and use efficient algorithms and indexes during the execution of a query?
A. query compiler B. query optimizer
C. Stored data manager D. Database processor
ugcnetcse-dec2019-paper2

Answer key ☟
36.0.377 UGC NET CSE | December 2019 | Part 2 | Question: 19

If we want to resize a pixels image to one that is pixels wide with the same aspect ratio, what
would be the height of the resized image?

A. Pixels B. Pixels C. Pixels D. Pixels

ugcnetcse-dec2019-paper2

Answer key ☟

36.0.378 UGC NET CSE | December 2019 | Part 2 | Question: 18

Which of the following algorithms is not used for line clipping?

A. Cohen-Sutherland algorithm B. Sutherland-Hodgeman algorithm
C. Liang-Barsky algorithm D. Nicholl-Lee-Nicholl algorithm
ugcnetcse-dec2019-paper2

36.0.379 UGC NET CSE | December 2019 | Part 2 | Question: 17

A rectangle is bound by the lines and . The line segment joining and , if
clipped against this window will connect the points __________.

A. and B. and C. and D. and

ugcnetcse-dec2019-paper2

Answer key ☟

36.0.380 UGC NET CSE | December 2019 | Part 2 | Question: 16

Which tag is used to enclose any number of javascript statements in HTML document?
A. <code> B. <script>
C. <title> D. <body>
ugcnetcse-dec2019-paper2

Answer key ☟

36.0.381 UGC NET CSE | December 2019 | Part 2 | Question: 15

Let be the base class in and be the derived class from with protected inheritance. Which of the
following statement is false for class ?

A. Member function of class can access protected data of class

B. Member function of class can access public data of class
C. Member function of class cannot access private data of class
D. Object of derived class can access public base class data

ugcnetcse-dec2019-paper2

Answer key ☟

36.0.382 UGC NET CSE | December 2019 | Part 2 | Question: 14

What is the output of the following program?

# include <stdio.h>
main ()
{
int i, j, x=0;
for (i=0; i<5; ++i)
for (j=0; j<i; ++j)
{
x+=(i+j-1);
break;
}
 printf(“%d”, x);
}

A. B. C. D.

ugcnetcse-dec2019-paper2

Answer key ☟

36.0.383 UGC NET CSE | December 2019 | Part 2 | Question: 13

The following program is stored in the memory unit of the basic computer. Give the content of accumulator
register in hexadecimal after the execution of the program.

A. B. C. D.
ugcnetcse-dec2019-paper2

36.0.384 UGC NET CSE | December 2019 | Part 2 | Question: 12

Given following equation:

, find base .

A. B. C. D.
ugcnetcse-dec2019-paper2

Answer key ☟

36.0.385 UGC NET CSE | December 2019 | Part 2 | Question: 11

A micro instruction format has microoperation field which is divided into sunbfields and , each having
distinct microoperations, condition field for four status bits, branch field having four options used in
conjunction with address field . The address space is of memory words. The size of micro instruction is:

A. B. C. D.
ugcnetcse-dec2019-paper2

Answer key ☟

36.0.386 UGC NET CSE | December 2019 | Part 2 | Question: 10

A computer uses a memory unit of words of bits each. A binary instruction code is stored in one word
of the memory. The instruction has four parts: an addressing mode field to specify one of the two-addressing
mode (direct and indirect), an operation code, a register code part to specify one of the registers and an address part.
How many bits are there in addressing mode part, opcode part, register code part and the address part?

A. B. C. D.
ugcnetcse-dec2019-paper2

Answer key ☟
36.0.387 UGC NET CSE | December 2019 | Part 2 | Question: 8

How many reflexive relations are there on a set with elements?

A. B. C. D.
ugcnetcse-dec2019-paper2

Answer key ☟

36.0.388 UGC NET CSE | December 2019 | Part 2 | Question: 7

A tree has vertices of degree , vertices of degree , vertices of degree . Determine the number of
vertices and edges in tree.

A. B. C. D.
ugcnetcse-dec2019-paper2

Answer key ☟

36.0.389 UGC NET CSE | December 2019 | Part 2 | Question: 5

Let be the set of all people. Let be a binary relation on such that is in if is a brother of . Is
symmetric transitive, an equivalence relation, a partial order relation?

A. B.
C. D.
ugcnetcse-dec2019-paper2

Answer key ☟

36.0.390 UGC NET CSE | December 2019 | Part 2 | Question: 4

What are the greatest lower bound and the least upper bound of the sets and
if they exist in poset ?

A.
B.
C.
D.

ugcnetcse-dec2019-paper2

Answer key ☟

36.0.391 UGC NET CSE | December 2019 | Part 2 | Question: 2

Consider the following Linear programming problem :

Maximize
Subject to the constraints:

The solution of the above is

A. B.
C. D.
ugcnetcse-dec2019-paper2

Answer key ☟
36.0.392 UGC NET CSE | December 2019 | Part 2 | Question: 1

A basic feasible solution of an transportation problem is said to be non-degenerate, if basic feasible

solution contains exactly _______ number of individual allocation in ______ positions.
A. , independent B. , independent
C. , appropriate D. , independent
ugcnetcse-dec2019-paper2

Answer key ☟

36.0.393 UGC NET CSE | June 2023 | Part 2: 100

IP datagram has arrived with following partial information in the header (in hexadecimal)
.
What is the header size?

A. bytes B. bytes C. bytes D. bytes

ugcnetcse-june2023-paper2

36.0.394 UGC NET CSE | June 2023 | Part 2: 99

IP datagram has arrived with following partial information in the header (in hexadecimal)
.
How many more routers can the packet travel to?

A. B. C. D.

ugcnetcse-june2023-paper2

36.0.395 UGC NET CSE | June 2023 | Part 2: 98

IP datagram has arrived with following partial information in the header (in hexadecimal)
.
What is the protocol of the payload being carried by the packet?

A. B. C. protocol D.

ugcnetcse-june2023-paper2

36.0.396 UGC NET CSE | June 2023 | Part 2: 97

IP datagram has arrived with following partial information in the header (in hexadecimal)

What is the efficiency of this datagram?

A. B. C. D.
ugcnetcse-june2023-paper2

36.0.397 UGC NET CSE | June 2023 | Part 2: 96

IP datagram has arrived with following partial information in the header (in hexadecimal)
.
What is the size of datagram?

A. bytes B. bytes C. bytes D. bytes

 ugcnetcse-june2023-paper2

36.0.398 UGC NET CSE | June 2023 | Part 2: 95

Consider the following program fragment that deals with a table with rows and columns, computing
an average for each column and printing it to screen ( is row index and is column index):
for
temp
for
temp temp
print ( temp 17.0) ;}
[i] [i] and temp are bit floating point values and memory is word addressable. The temporary variable temp is kept
in a processor register so access to temp does not involve a memory reference. The main memory is page and holds
pages of size words, the page replacement policy is "least recently used ", If is stored in the virtual address space
in row major format.
What is the main memory hit ratio?

A. B. C. D.
ugcnetcse-june2023-paper2

36.0.399 UGC NET CSE | June 2023 | Part 2: 94

Consider the following program fragment that deals with a table with rows and columns, computing
an average for each column and printing it to screen ( is row index and is column index):
for j = 0 . .1023]{
temp ;
for ;
temp temp
print temp
[i] [i] and temp are bit floating point values and memory is word addressable. The temporary variable temp is kept
in a processor register so access to temp does not involve a memory reference. The main memory is page and holds
pages of size words, the page replacement policy is "least recently used ", If is stored in the virtual address space
in row major format.
Consider that is stored in column major format, how many page faults will be encountered?

A. B. C. D.

ugcnetcse-june2023-paper2

36.0.400 UGC NET CSE | June 2023 | Part 2: 93

Consider the following program fragment that deals with a table with rows and columns, computing
an average for each column and printing it to screen ( is row index and is column index):
for
temp
for
temp temp
print ( temp/ 17.0); }
[i] [j] and temp are bit floating point values and memory is word addressable. The temporary variable temp is kept
in a processor register so access to temp does not involve a memory reference. The main memory is page and holds
pages of size words, the page replacement policy is "least recently used ", If is stored in the virtual address space
in row major format.
How many page faults will be encountered?
 A. B. C. D.

ugcnetcse-june2023-paper2

36.0.401 UGC NET CSE | June 2023 | Part 2: 92

Consider the following program fragment that deals with a table with rows and columns, computing
an average for each column and printing it to screen ( is row index and is column index):
for
temp
for ;
temp temp
print temp/ 17.0) ; }
[i] [j] and temp are bit floating point values and memory is word addressable. The temporary variable temp is kept
in a processor register so access to temp does not involve a memory reference. The main memory is page and holds
pages of size 1024 words, the page replacement policy is "least recently used ", If T is stored in the virtual address space
in row major format.
Consider again that is stored in column-major format, what is the main memory hit ratio?

A. B. C. D.

ugcnetcse-june2023-paper2

36.0.402 UGC NET CSE | June 2023 | Part 2: 91

Consider the following program fragment that deals with a table with 17 rows and 1024 columns, computing
an average for each column and printing it to screen ( is row index and is column index):
for
temp
for
temp temp
print temp/ 17.0);
[i] [j] and temp are 32 bit floating point values and memory is word addressable. The temporary variable temp is kept
in a processor register so access to temp does not involve a memory reference. The main memory is page and holds 16
pages of size 1024 words, the page replacement policy is "least recently used ", If is stored in the virtual address
space in row major format.
What is fault ratio of row major to column major arrangements ?

A. B. C. D.

ugcnetcse-june2023-paper2

36.0.403 UGC NET CSE | June 2023 | Part 2: 90

The compiler for high level language that runs on one machine and produces code for other machine is called-
A. Cross compiler B. Multipass compiler
C. Optimizing Compiler D. One pass Compiler

ugcnetcse-june2023-paper2

Answer key ☟
36.0.404 UGC NET CSE | June 2023 | Part 2: 89

The maximum yield length of the following is

A. B. C. D.
ugcnetcse-june2023-paper2

36.0.405 UGC NET CSE | June 2023 | Part 2: 88

Southerland Hodgeman method is used on Southerland Hodgeman method is used on

A. Smooth curves B. Line segment

C. Convex polygons D. Concave polygons

ugcnetcse-june2023-paper2

36.0.406 UGC NET CSE | June 2023 | Part 2: 87

Consider the following finite automata that accepts a language

Let be a finite automata which is obtained by reversal of . Then which of the following is correct?

A.
B.
C.
D.

ugcnetcse-june2023-paper2

36.0.407 UGC NET CSE | June 2023 | Part 2: 86

Find the sum of all four digit numbers formed using the digits and .
 A. B. C. D.

ugcnetcse-june2023-paper2

36.0.408 UGC NET CSE | June 2023 | Part 2: 85

What is the output of following code?

main ()
{ static float a[]=\{13.24,1.5,4.5,5.4,3.5}
float * j, * k;
j= a};
k= a + 4
j=j * 2;
k = k / 2;
printf ("% f % f",* j,*k);
}

A. B.
C. D. Illegal use of pointer in main function
ugcnetcse-june2023-paper2

36.0.409 UGC NET CSE | June 2023 | Part 2: 84

Consider the following statements:

i. Dynamic metrics are collected by measurements made of a program in execution

ii. Static metrics are collected by measurements made of representations of the system
iii. The assessment of software quality is an objective process
iv. An important part of quality assurance in the selection of standards that should apply to the software development
process.

Choose the correct answer from the options given below:

A. only B. and only
C. and only D. and only

ugcnetcse-june2023-paper2

36.0.410 UGC NET CSE | June 2023 | Part 2: 83

Let is multiple of and and is a multiple of and . What

is the number of elements in

A. B. C. D.
ugcnetcse-june2023-paper2

Answer key ☟

36.0.411 UGC NET CSE | June 2023 | Part 2: 82

Given below are two statements: one is labelled as Assertion and the other is labelled as Reason .
Assertion : The AVL trees are more balanced as compared to Red Black trees, but they may cause more rotations
during insertion and deletion
Reason : A Red Black tree with n nodes has height that is greater than and the AVL tree with n nodes
has height less than (where is golden ratio)
 In the light of the above statements, choose the correct answer from the options given below.

A. Both and are correct and is the correct explanation of

B. Both and are correct and is NOT the correct explanation of
C. is true but is false
D. is false but is true

ugcnetcse-june2023-paper2

36.0.412 UGC NET CSE | June 2023 | Part 2: 81

Given below are two statements: one is labelled as Assertion and the other is labelled as Reason .
Assertion : Dendral is an expert system
Reason : The rationality of an agent is not related to its reaction to the environment.
In the light of the above statements, choose the correct answer from the options given below.

A. Both and are true and is the correct explanation of

B. Both and are true but is NOT the correct explanation of
C. is true but is false
D. is false but is true

ugcnetcse-june2023-paper2

36.0.413 UGC NET CSE | June 2023 | Part 2: 80

An observational technique that can be used to understand operational process and help to derive requirement
for software to support operational process is known as
A. Requirement specification B. Structural specification
C. Ethnography D. Natural language specification

ugcnetcse-june2023-paper2

36.0.414 UGC NET CSE | June 2023 | Part 2: 79

Consider following statements:

A. A context free language is generated by grammar if and only if it is accepted by a deterministic
pushdown automata and has prefix property
B. If is the single tape simulating multilape , then time taken by to simulate moves is ( )
C. Push down automata behaves like a Turning machine when it has one auxiliary memory.
D. is not context free but context sensitive.
Choose the correct answer from the options given below:

A. and only B. only C. only D. only

ugcnetcse-june2023-paper2

36.0.415 UGC NET CSE | June 2023 | Part 2: 78

Match List I with List II

List I List II
A. I.
 B. II.
C. III.
D. IV.

Choose the correct answer from the options given below: Choose the correct answer from the options given below:
A. B.
C. D.

ugcnetcse-june2023-paper2

Answer key ☟

36.0.416 UGC NET CSE | June 2023 | Part 2: 77

Given below are two statements: one is labelled as Assertion and the other is labelled as Reason .
Assertion : I/O protection is ensured by a hardware trap
Reason : I/O interrupt caused by the condition like I/O completion and device malfunction occuring within the I/O
devices
In the light of the above statements, choose the correct answer from the options given below.

A. Both and are true and is the correct explanation of

B. Both and are true but is NOT the correct explanation of
C. is true but is false
D. is false but is true

ugcnetcse-june2023-paper2

36.0.417 UGC NET CSE | June 2023 | Part 2: 76

Match List I with List II

List I List II
A. Expert system I. Decision tree
B. Fuzzy system II. Scramble
C. Operator in genetic III. Inference
algorithm engine
D. Supervised technique IV. Mycin

Choose the correct answer from the options given below: Choose the correct answer from the options given below:

ugcnetcse-june2023-paper2

36.0.418 UGC NET CSE | June 2023 | Part 2: 75

What will be the output of the following code? What will be the output of the following code?
# include <stdio.h>
int main ( ) {
 int a, b, c;
a=ox10; b=010;
c=a+b;
printf ( %d", c);
return 0 ;
}

A. B. C. Garbage D. error

ugcnetcse-june2023-paper2

Answer key ☟

36.0.419 UGC NET CSE | June 2023 | Part 2: 74

i. The set of turning machine codes for that accept all inputs that are palindromes (possible along with some
other inputs) is decidable
ii. The language of codes for that when started with blank tape, eventually write a somewhere on the tape is
undecidable
iii. The language accepted by a is is always recursive
iv. Post's correspondence problem is undecidable

Choose the correct answer from the options given below:

A. and only B. and only C. and only D. and only

ugcnetcse-june2023-paper2

36.0.420 UGC NET CSE | June 2023 | Part 2: 73

Match List I with List II

List I List II
A.
I. Transforming the raw bits in the
Physical
form of frame for transmission
layer
B. Data
Link II. Control and monitoring of subnet
Layer
C.
III. Transmission of raw bits over
Network
communication channel
layer
D. IV. Datagrams transmission data
Transport through connection oriented or
layer connectionless using datagram

Choose the correct answer from the options given below:

ugcnetcse-june2023-paper2

Answer key ☟
36.0.421 UGC NET CSE | June 2023 | Part 2: 72

Let denote the set of all natural numbers and be the relation on defined by , if
. Then is
A. Symmetric only B. Reflexive only
C. Transitive only D. An equivalence relation

ugcnetcse-june2023-paper2

36.0.422 UGC NET CSE | June 2023 | Part 2: 71

Given the basic diagram and relational model, which of the the following is incorrect?

A. An attribute of an entity can have more than one value

B. An attribute of an entity can be composite
C. In a row of relational table, an attribute can have more than one value
D. In a row of a relational table, an attribute can have exactly one value or a NULL value

ugcnetcse-june2023-paper2

Answer key ☟

36.0.423 UGC NET CSE | June 2023 | Part 2: 70

Which of the following is used to determine the cost performance index?

A. Budgeted cost of work performed-budget at completion

B. Budgeted cost of work performed budget at completion
C. Budgeted cost of work performed Actual cost of work performed
D. Budgeted cost of work performed-Actual cost of work performed

ugcnetcse-june2023-paper2

36.0.424 UGC NET CSE | June 2023 | Part 2: 69

Let denote the group of all integers under addition. Then the number of all automorphisms of is

A. B. C. D.

ugcnetcse-june2023-paper2

36.0.425 UGC NET CSE | June 2023 | Part 2: 68

At a particular time of computation, the value of a counting semaphore is . Then operations and ' '
operations were completed on this semaphore. If the final value of semaphore is . will be

A. B. C. D.

ugcnetcse-june2023-paper2

36.0.426 UGC NET CSE | June 2023 | Part 2: 67

Match List I with List II

List I List II
A. Parallel FFT I.
B. Iterative FFT II.
 C. Evaluation of polynomial at
III.
n points by Horner method
D. Product of two polynomials
that are represented in point IV.
value form

Choose the correct answer from the options given below:

ugcnetcse-june2023-paper2

36.0.427 UGC NET CSE | June 2023 | Part 2: 66

Which of the following transforms in dimension is used to resize a -dimensional object?

A. Translation B. Rotation C. Scaling D. Shearing

ugcnetcse-june2023-paper2

36.0.428 UGC NET CSE | June 2023 | Part 2: 65

let be a relational schema with following function dependencies:

The decomposition of into

A. gives a lossless join, and is dependency preserving

B. gives lossless join, but is not dependency preserving
C. does not give a lossless join, but is dependency preserving
D. does not give a lossless join and is not dependency preserving

ugcnetcse-june2023-paper2

36.0.429 UGC NET CSE | June 2023 | Part 2: 64

Given below are two statements: one is labelled as Assertion and the other is labelled as Reason .
Assertion : Validity checks real need of system users
Reason : Completeness checks system user defined requirements.
In the light of the above statements, choose the correct answer from the options given below.

A. Both and are true and is the correct explanation of

B. Both and are true but is NOT the correct explanation of
C. is true but is false
D. is false but is true

ugcnetcse-june2023-paper2
36.0.430 UGC NET CSE | June 2023 | Part 2: 63

Match List I with List II

List I List II
A. RAID
I. Bit interleaved parity
level
B. RAID II. Block interleaved distributed
level parity
C. RAID
III. Error correcting parity
level
D. RAID
IV. Block interleaved parity
level

Choose the correct answer from the options given below: Choose the correct answer from the options given below:
A. B.
C. D.

ugcnetcse-june2023-paper2

36.0.431 UGC NET CSE | June 2023 | Part 2: 62

If is a natural number and is a natural number . Which of the following is

correct for ?

A. is a natural number
B. is a natural number
C. is a natural number
D. is a natural number

ugcnetcse-june2023-paper2

Answer key ☟

36.0.432 UGC NET CSE | June 2023 | Part 2: 61

The following table shows the time between failures for a software :
Error number
time since last failure (Hours)

The reliability of the system for one hour operation assuming an exponential model is-

A. B. C. D.

ugcnetcse-june2023-paper2

36.0.433 UGC NET CSE | June 2023 | Part 2: 60

A -tree used as an index for a large database table has four levels including the root node. If a new key is
inserted in this index, then maximum number of nodes that could be newly created in the process is

A. B. C. D.
 ugcnetcse-june2023-paper2

36.0.434 UGC NET CSE | June 2023 | Part 2: 59

Given below are two statements:

Which of the following concurrency control protocol ensures both conflict serializability and freedom from
deadlock?
Statement : Two phase locking
Statement : Timestamp ordering
In the light of the above statements, choose the most appropriate answer from the options given below:

A. Both Statement and Statement are correct

B. Both Statement and Statement are incorrect
C. Statement is correct but Statement is incorrect
D. Statement is incorrect but Statement is correct Given below are two statements:

ugcnetcse-june2023-paper2

Answer key ☟

36.0.435 UGC NET CSE | June 2023 | Part 2: 58

Suppose a circular queue of capacity ( elements is implemented with an array of elements. Assume that
the insertion and deletion operations are carried out using REAR and FRONT as array index variable
respectively. Initially,

. The conditions to detect queue empty and queue full are

1. EMPTY: REAR ==F R O N T

FULL : REAR+1) FRONT

2. EMPTY: FRONT +1 REAR

FULL: REAR+ FRONT

3. EMPTY REAR+ ) ==FRONT

FULL: REAR FRONT

4. EMPTY: REAR== FRONT

FULL: FRONT+1) REAR
ugcnetcse-june2023-paper2

36.0.436 UGC NET CSE | June 2023 | Part 2: 57

Match List I with List II

List I List II
A. The running time of straight
forward recursive method to I.
compute nth Fibonacci number

B. The running time to compute

II.
Fn using memoization
C. The running time to compute
Fibonacci number using only
III.
integer addition and
multiplication
D. The running time to determine
IV.
an optimal bitonic tour
 ugcnetcse-june2023-paper2

36.0.437 UGC NET CSE | June 2023 | Part 2: 56

Match List I with List II

List I List II
I. It provides mobile internet
A.
connection with faster data transfer
CDMA
rates
II. It allows user to connect to a
B. GSM network or to other devices over
wireless channel
III. Accessing mechanism for
C. UMTS multiple transmitters over a single
channel
IV. It is a cellular technology that
D. WiFi employs hybrid of FDMA and
TDMA

ugcnetcse-june2023-paper2

Answer key ☟

36.0.438 UGC NET CSE | June 2023 | Part 2: 55

Given below are two statements: one is labelled as Assertion and the other is labelled as Reason .A virtual
memory system uses first-in first-out page replacement policy and allocates a fixed number of frames to a
process
Assertion : Increasing number of page frames allocated to a process sometimes increases the page fault rate.
Reason : Some programs do not exhibit locality of reference.
In the light of the above statements, choose the correct answer from the options given below.

A. Both and are true and is the correct explanation of

B. Both and are true but is NOT the correct explanation of
C. is true but is false
D. is false but is true

ugcnetcse-june2023-paper2
36.0.439 UGC NET CSE | June 2023 | Part 2: 54

Consider the following statements about the software product line system:
Statement : At the interaction level, components provide an operator display interface and an interface with the
communication system used.
Statement : At the I/O management level, components handle operator authentication, report generator and query
manager.
In the light of the above statements, choose the most appropriate answer from the options given below.

A. Both Statement and Statement are correct

B. Both Statement and Statement are incorrect
C. Statement is correct but Statement is incorrect
D. Statement is incorrect but Statement is correct

ugcnetcse-june2023-paper2

36.0.440 UGC NET CSE | June 2023 | Part 2: 53

Match List I with List II

List I List II
A. Critical region I. Hoare's monitor
B. Wait/signal II. Mutual exclusion
C. Working set III. Principle of locality
D. Deadlock IV. Circular wait

ugcnetcse-june2023-paper2

36.0.441 UGC NET CSE | June 2023 | Part 2: 52

Given below are two statements: one is labelled as Assertion and the other is labelled as Reason .
Assertion : A process involves a library function to create a thread.
Reason : The threads make system calls to convey their resource and I/O requirement to the Kernel.
In the light of the above statements, choose the correct answer from the options given below.

A. Both and are true and is the correct explanation of

B. Both and are true but is NOT the correct explanation of
C. is true but is false
D. is false but is true

ugcnetcse-june2023-paper2

Answer key ☟

36.0.442 UGC NET CSE | June 2023 | Part 2: 51

Given below are two statements:

Statement : subsystem models show logical grouping of objects into coherent subsystem
Statement : State machine models show how objects change their states in response to events.
 In the light of the above statements, choose the most appropriate answer from the options given below.

A. Both Statement and Statement are correct

B. Both Statement and Statement are incorrect
C. Statement is correct but Statement is incorrect
D. Statement is incorrect but Statement is correct

ugcnetcse-june2023-paper2

36.0.443 UGC NET CSE | June 2023 | Part 2: 50

The clipping process in computer graphics is used for

A. Adding graphics B. Copying
C. Zooming D. Removing objects and lines
ugcnetcse-june2023-paper2

36.0.444 UGC NET CSE | June 2023 | Part 2: 49

Consider the following language :

is
A. Context free but not linear B. Not context free
C. Context free and linear D. Linear
ugcnetcse-june2023-paper2

36.0.445 UGC NET CSE | June 2023 | Part 2: 48

Consider the following statements:

i. A database design is in BCNF if each member of the set of relation schemas that constitutes the design is in BCNF
ii. A BCNF schema can have transitive dependency
iii. It is always possible to obatin a design without sacrificing a lossless join

There are multivalued dependencies in

A. and only B. and only
C. and only D. and only

ugcnetcse-june2023-paper2

36.0.446 UGC NET CSE | June 2023 | Part 2: 47

i. If some -complete problem is in that

ii. is in
iii. is in
iv. Hamilton circuit problem is not -complete

Choose the correct answer from the options given below:

A. and only B. and only
C. and only D. and only

ugcnetcse-june2023-paper2
36.0.447 UGC NET CSE | June 2023 | Part 2: 46

Consider a popular sports news site. At a given moment, concurrent users submit a request (a transaction,
T) once every minutes on average. Each transaction requires the webapp to download a new article that on
average has bytes in length. What is the throughput?

A. megabits per second B. megabits per second

C. megabits per second D. megabits per second
ugcnetcse-june2023-paper2

36.0.448 UGC NET CSE | June 2023 | Part 2: 45

What is the fit binary fixed point equivalent of ?

A. B. C. D.
ugcnetcse-june2023-paper2

Answer key ☟

36.0.449 UGC NET CSE | June 2023 | Part 2: 43

Let and be asymptotically positive functions. The following conjectures are given
Statement : land
Statement : where for all sufficient large .
In the light of the above statements, choose the most appropriate answer from the options given below.

A. Both Statement and Statement are correct

B. Both Statement and Statement are incorrect
C. Statement is correct but Statement is incorrect
D. Statement is incorrect but Statement is correct

ugcnetcse-june2023-paper2

36.0.450 UGC NET CSE | June 2023 | Part 2: 42

Given below are two statements:

Which of the following statement/s is/are correct with respect to virtual memory
Statement I: Address translation is performed for every logical address used during the execution of a program
Statement II: A program can execute only when all of its components are loaded in the memory
In the light of the above statements, choose the most appropriate answer from the options given below.

A. Both Statement and Statement are correct

B. Both Statement and Statement are incorrect
C. Statement is correct but Statement is incorrect
D. Statement is incorrect but Statement is correct

ugcnetcse-june2023-paper2

36.0.451 UGC NET CSE | June 2023 | Part 2: 41

How many integral solutions are there to , where and ?

A. 2400 B. 2600 C. 2800 D. 3000

ugcnetcse-june2023-paper2

36.0.452 UGC NET CSE | June 2023 | Part 2: 40

Given below are two statements:

 Statement I: If and are two functions and but , we say that the growth rate of is smaller than
that of
Statement II: The class of all decision problems decided by a in exponential time, that is , being a constant.
In the light of the above statements, choose the most appropriate answer from the options given below.

A. Both Statement I and Statement II are correct

B. Both Statement I and Statement II are incorrect
C. Statement I is correct but Statement II is incorrect
D. Statement I is incorrect but Statement II is correct

ugcnetcse-june2023-paper2

36.0.453 UGC NET CSE | June 2023 | Part 2: 39

The total cost of retrieving records in sorted order using an unclustered tree is (P-Average number of
records per data page
N- Data pages
F- Ratio of the size of a data entry to the size of a data record)
A. B.
C. D.
ugcnetcse-june2023-paper2

36.0.454 UGC NET CSE | June 2023 | Part 2: 38

Which is not the component of the natural language understanding process?

A. Morphological analysis B. Semantic analysis
C. Pragmatic analysis D. Meaning analysis
ugcnetcse-june2023-paper2

36.0.455 UGC NET CSE | June 2023 | Part 2: 37

Match List I with List II

List I List II
A. Scenario I. To verify the I/O behavior of
testing text object
B. Regression II. user acceptance
testing methodology
C. Component III. No new bugs after changes
testing in program
IV. The documentation of a
D. Beta testing
use case

Choose the correct answer from the options given below:

ugcnetcse-june2023-paper2

Answer key ☟
36.0.456 UGC NET CSE | June 2023 | Part 2: 36

Which of the following is not a property of a good system for representation of knowledge in a particular
domain?
A. Presentation adequacy B. infrential adequacy
C. Infential efficiency D. acquisitional efficiency
ugcnetcse-june2023-paper2

36.0.457 UGC NET CSE | June 2023 | Part 2: 35

Given below are two statements: one is labelled as Assertion and the other is labelled as Reason .
Assertion A: It is possible to create doubly linked list using only one pointer with every node.
Reason R: By storing the of the addresses of the previous and next nodes.
In the light of the above statements, choose the most appropriate answer from the options given below.

A. Both and are true and is the correct explanation of

B. Both and are true but is NOT the correct explanation of
C. is true but is false
D. is false but is true

ugcnetcse-june2023-paper2

36.0.458 UGC NET CSE | June 2023 | Part 2: 34

What is in the following program?

# include < stdioh >
int main ( )
{typedef (*(* arrfptr[3])())[10];
arrfptr x ;
return 0 ;
}

A. is a pointer B. is a array of three pointer

C. is an array of three function pointer D. Error in declaration
ugcnetcse-june2023-paper2

36.0.459 UGC NET CSE | June 2023 | Part 2: 33

Match List I with List II

List I List II
A. PERT I. used for nonrepetitive jobs
B. Optimistic
II. Used for repetitive jobs
time
III. The shortest possible time
C. CPM to complete the activity if all
goes well.
D. Pessimistic IV. The longest time that an
time activity takes

Choose the correct answer from the options given below:

A. B.
C. D.
 ugcnetcse-june2023-paper2

36.0.460 UGC NET CSE | June 2023 | Part 2: 32

Consider the rectangle with vertices . There is scaling of 2 towards -axis and towards
-axis. The new cordinates of the rectangle are
A. B.
C. D.
ugcnetcse-june2023-paper2

36.0.461 UGC NET CSE | June 2023 | Part 2: 31

Let and be groups under the multiplication. Then, the map defined by
is

A. Not a homomorphism B. A one-one homomorphism, which is not onto

C. An onto homomorphism, which is not one to one D. An homomorphism
ugcnetcse-june2023-paper2

36.0.462 UGC NET CSE | June 2023 | Part 2: 30

How will you free the memory allocated by the following program?

# include < stdio.h>

#include < stdlib. h >
#define MAXROW 3
#define MAXCOL 4
int main ( )
{
int ** p, i, j;
p= (int **) malloc (MAXROW * size of (int*));
return $0 ;$
}
# include $<$ stdio.h $>$
#include $<$ stdlib. h $>$
#define MAXROW 3
#define MAXCOL 4
int main ( )
{
int ** p $, \mathrm{i}, \mathrm{j}$;
p=(int **) malloc (MAXROW * size of (int*));
return 0;
}

A. memfree ; B. dealloc ;
C. malloc ; D. free :
ugcnetcse-june2023-paper2

36.0.463 UGC NET CSE | June 2023 | Part 2: 29

Which of the following is not a solution representation in a genetic algorithm?

A. Binary valued B. Real valued C. Permutation D. Combinations

ugcnetcse-june2023-paper2

36.0.464 UGC NET CSE | June 2023 | Part 2: 28

Consider the following statements:

S1: LRU page replacement algorithm suffers from the belady's anomaly
S2: Shortest remaining time first scheduling may cause starvations
 S3: Stack is shared by all threads in a process

A. and are true

B. false and is true
C. are false and is true
D. and are false

ugcnetcse-june2023-paper2

Answer key ☟

36.0.465 UGC NET CSE | June 2023 | Part 2: 26

A three dimensional array in is declared as int [c]. Consider that array elements are stored in row
major order and indexing begin from . Here the address of an item at the location computed in terms of
word length of an integer is

A. & A [0] [0] [0]

B. & A [0] [0] [0]
C. & A [0] [0] [0]+w
D. & A [0] [0] [0]

ugcnetcse-june2023-paper2

Answer key ☟

36.0.466 UGC NET CSE | June 2023 | Part 2: 25

Match List I with List II

List I List II
A. Bezier I. 3 dim objects that have
curves translation rotational symmetry
B. B-Splines II. Fractal geometry
C. Sweep
III. Bias and tension
representations
D. Natural
IV. painting drawing CAD
objects

Choose the correct answer from the options given below:

A. B.
C. D.

ugcnetcse-june2023-paper2

36.0.467 UGC NET CSE | June 2023 | Part 2: 24

Given below are two statements:

Statement I: Fuzzifier is a part of a fuzzy system
Statement II: Inference engine is a part of fuzzy system
In the light of the above statements, choose the most appropriate answer from the options given below.

A. Both Statement and Statement are correct

B. Both Statement and Statement are incorrect
C. Statement is correct but Statement is incorrect
D. Statement is incorrect but Statement is correct
 ugcnetcse-june2023-paper2

36.0.468 UGC NET CSE | June 2023 | Part 2: 23

Which of the following is not a mutation operator in a genetic algorithm?

A. Random resetting B. Scramble

C. Inversion D. Difference
Choose the correct answer from the options given below:
A. and only B. and only
C. and only D. only

ugcnetcse-june2023-paper2

36.0.469 UGC NET CSE | June 2023 | Part 2: 20

DRAM is organized as a memory externally and as a 16 square array internally. Each

row must be refreshed at least once every mili second to forestall loss of data; refreshing one row takes
nanoseconds. What fraction of the total memory bandwidth is lost to refresh cycles?

A. B. C. D.
ugcnetcse-june2023-paper2

36.0.470 UGC NET CSE | June 2023 | Part 2: 18

Let denote XOR operation. Let and denote the binary constants and is the Boolean expression over two
variables and
Which of the following is equivalent expression to ?

A. B. C. D.
ugcnetcse-june2023-paper2

Answer key ☟

36.0.471 UGC NET CSE | June 2023 | Part 2: 17

A TCP server application is programmed to listen on port on host . A TCP client is connected to the TCP
server over the network, Consider that while TCP connection is active the server is crashed and rebooted.
Assume that the client does not use TCP keepalive timer. Which of the following behaviour is/are possible?
Statement I: The TCP application server on can listen on after reboot.
Statement II: If client sends a packet after the server reboot, it will receive the RST segment.
In the light of the above statements, choose the correct answer from the options given below.

A. Both Statement and Statement are true

B. Both Statement and Statement are false
C. Statement is true but Statement is false
D. Statement is false but Statement is true

ugcnetcse-june2023-paper2

36.0.472 UGC NET CSE | June 2023 | Part 2: 16

Consider two hosts and that are connected through a router . The maximum transfer unit value of
the link between and is bytes and between and is bytes. A segment of size bytes is
transferred from to through with IP identification value of . Assume that IP header size is bytes.
Further the pcaket is allowed to be fragmented that is Don't fragment (DF) flag in the IP Header is not set by . Which
of the following statement/s is/are true?
A. Two fragments are created at and IP datagram size carrying the second fragment is bytes
 B. If the second fragment is lost, then resends the fragment with IP identification value of
C. If the second fragment lost, then requires to resend the entire segment.
D. destination port can be determined by analyzing the second fragment only.

Choose the correct answer from the options given below:

A. and only
B. and only
C. and only
D. and only

ugcnetcse-june2023-paper2

36.0.473 UGC NET CSE | June 2023 | Part 2: 15

In the standard Ethernet with transmission rate of , asssume that the length of the medium is and
size of a frame is bytes. The propagation speed of a signal in a cable is normally . The transmission
delay and propogation delay are
A. and B. and
C. and D. and
ugcnetcse-june2023-paper2

36.0.474 UGC NET CSE | June 2023 | Part 2: 14

Consider a disk system with cylinders. The request to access the cylinders occurs in the following sequence:

Assuming that the head is currently at cylinder , what is the time taken to satisfy all requests if it takes to move
from one cylinder to adjacent one and shortest seek time first policy is used?
A. B.
C. D.
ugcnetcse-june2023-paper2

Answer key ☟

36.0.475 UGC NET CSE | June 2023 | Part 2: 13

Consider universe positive integer , proposition " is an even integers",

". Then truth set of is

A. B. C. D.
ugcnetcse-june2023-paper2

Answer key ☟

36.0.476 UGC NET CSE | June 2023 | Part 2: 12

Which is not a basic approach to the problem of conflict resolution in a production system?

A. Assigning a preference based on the rule that matched

B. Assigning a preference based the object that matched
C. Assigning a preference based on the action that the matched rule would perform
D. Assigning a preference based on the action that the matched object would perform
 ugcnetcse-june2023-paper2

36.0.477 UGC NET CSE | June 2023 | Part 2: 11

________ is intended to show that a system both conforms to its specifications and meets the expectations of the
system customer.
A. Software specification B. Software design
C. Software evaluation D. Software validation
ugcnetcse-june2023-paper2

Answer key ☟

36.0.478 UGC NET CSE | June 2023 | Part 2: 10

A processor chip is used for application in which of execution time is spent on floating point addition. For
the new model of the processor, the design team has come up with redesign the floating point adder to make it
twice as fast. What will be possible maximum speed up by this redesign?

A. B. C. D.
ugcnetcse-june2023-paper2

36.0.479 UGC NET CSE | June 2023 | Part 2: 8

In a multiuser operating system, requests are made to use a particular resource per hour, on an average. The
probability that no request is made in minutes is

A. B. C. D.
ugcnetcse-june2023-paper2

Answer key ☟

36.0.480 UGC NET CSE | June 2023 | Part 2: 7

Which phase of compiler checks the grammar of programming?

A. Code optimization B. Semantic analysis
C. Code generators D. Syntax analysis

ugcnetcse-june2023-paper2

Answer key ☟

36.0.481 UGC NET CSE | June 2023 | Part 2: 6

Consider the following statements

A. C-Fuzzy means clustering is a supervised method of learning
B. PCA is used for dimension reduction
C. Apriori is not a supervised technique
D. When a machine learning model becomes so specially tuned to its exact input data that it fails to generalize to other
similar data it is called underfitting

Choose the correct answer from the options given below:

A. and
B. and
C. and
D. and

ugcnetcse-june2023-paper2
36.0.482 UGC NET CSE | June 2023 | Part 2: 5

Which of the following scenario may lead to an irrecoverable error in a database system?

A. A transaction writes a data item after it is read by an uncommitted transaction

B. A transaction reads a data item after it is read by an uncommitted transaction
C. A transaction reads a data item after it is written by a committed transactions
D. A transaction reads a data item after it is written by an uncommitted transaction.

ugcnetcse-june2023-paper2

Answer key ☟

36.0.483 UGC NET CSE | June 2023 | Part 2: 4

Consider the following statements.

A. The identity is unique in any monoid.
B. A monoid is a group if there exists inverse of each element of monoid.
C. Semi group has closure, associative and identity properties.
D. Quasi group has closure property.

Choose the correct answer from the options given below :

A. and only
B. and only
C. and only
D. and only

ugcnetcse-june2023-paper2

Answer key ☟

36.0.484 UGC NET CSE | June 2023 | Part 2: 3

There are points on one straight line and points on another straight line none of them being .
How many triangles can be formed with these points as vertices?

A. B. C. D.
ugcnetcse-june2023-paper2

36.0.485 UGC NET CSE | June 2023 | Part 2: 2

Which of the following statement is correct?

A. Ackermann's function is primitive recursive.

B. is regular language.
C. is not context free language
D. For every context sensitive language not including , there exists some linear bounded automata such that
.

ugcnetcse-june2023-paper2

36.0.486 UGC NET CSE | June 2023 | Part 2: 1

What is the output of following code?

main ()
struct s1
{ char * z;
 int i;
struct s1 * p;
}
static struct s 1 a []}={
{"Nagpur", 1, a+1}
{"Raipur', 2, a+2}
{"Kanpur', 3, a}
};
struct s 1* ptr =a;
printf (%s %s %s\n", a[0].z. ptr $/rightarrow$ z, a [2]. p $/rightarrow$ z;)

A. Nagpur Raipur Kanpur B. Nagpur Nagpur Nagpur

C. Kanpur Kanpur Kanpur D. Error
ugcnetcse-june2023-paper2

Answer key ☟

36.0.487 UGC NET CSE | June 2008 | Part 2 | Question: 50

Identify the incorrect statement :

A. The adaptation layer is not service dependent.

B. Logical connections in are referred to as virtual channel connections.
C. is a streamlined protocol with minimal error and flow control capabilities.
D. is also known as cell relay.

ugcnetcse-june2008-paper2

36.0.488 UGC NET CSE | June 2008 | Part 2 | Question: 49

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.

ugcnetcse-june2008-paper2

36.0.489 UGC NET CSE | June 2008 | Part 2 | Question: 48

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.

A. one-cell B. two-cells C. three-cells D. four-cells

ugcnetcse-june2008-paper2

36.0.490 UGC NET CSE | June 2008 | Part 2 | Question: 47

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.

ugcnetcse-june2008-paper2
36.0.491 UGC NET CSE | June 2008 | Part 2 | Question: 45

In clean room software engineering :

A. only eco-friendly hardware is used.

B. only hired facilities are used for development.
C. correctness of the code is verified before testing.
D. implementation is done only after ensuring correctness.

ugcnetcse-june2008-paper2

36.0.492 UGC NET CSE | June 2008 | Part 2 | Question: 44

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.

ugcnetcse-june2008-paper2

36.0.493 UGC NET CSE | June 2008 | Part 2 | Question: 43

While designing the user interface, one should :

A. use as many short cuts as possible.

B. use as many defaults as possible.
C. use as many visual layouts as possible.
D. reduce the demand on short-term memory.

ugcnetcse-june2008-paper2

36.0.494 UGC NET CSE | June 2008 | Part 2 | Question: 42

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.

ugcnetcse-june2008-paper2

Answer key ☟

36.0.495 UGC NET CSE | June 2008 | Part 2 | Question: 41

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.

ugcnetcse-june2008-paper2
36.0.496 UGC NET CSE | June 2008 | Part 2 | Question: 39

With bit virtual addresses, a page and of RAM, an inverted page table requires :
A. entries. B. entries.
C. entries. D. entries.

ugcnetcse-june2008-paper2

36.0.497 UGC NET CSE | June 2008 | Part 2 | Question: 38

An example of a memory management system call in is :

A. fork. B. mmap. C. sigaction. D. execve.

ugcnetcse-june2008-paper2

36.0.498 UGC NET CSE | June 2008 | Part 2 | Question: 37

There are ' ' processes in memory. A process spends a fraction ' ' of its time waiting for to complete.
The CPU utilization is given by :

A. B. C. D.

ugcnetcse-june2008-paper2

Answer key ☟

36.0.499 UGC NET CSE | June 2008 | Part 2 | Question: 36

An example of a non-preemptive scheduling algorithm is :

A. Shortest job first scheduling. B. Round robin scheduling.
C. Priority scheduling. D. Fair share scheduling.

ugcnetcse-june2008-paper2

36.0.500 UGC NET CSE | June 2008 | Part 2 | Question: 35

A parse tree is an annotated parse tree if :

A. it shows attribute values at each node.

B. there are no inherited attributes.
C. it has synthesized nodes as terminal nodes.
D. every non-terminal nodes is an inherited attribute.

ugcnetcse-june2008-paper2

36.0.501 UGC NET CSE | June 2008 | Part 2 | Question: 34

Dead-code elimination in machine code optimization refers to :

A. removal of all labels. B. removal of values that never get used.
C. removal of function which are not involved. D. removal of a module after its use.

ugcnetcse-june2008-paper2
36.0.502 UGC NET CSE | June 2008 | Part 2 | Question: 32

In the indirect addressing scheme, the second part of an instruction contains :

A. the operand in decimal form

B. the address of the location where the value of the operand is stored
C. the address of the location where the address of the operand is stored
D. the operand in an encoded form

ugcnetcse-june2008-paper2

36.0.503 UGC NET CSE | June 2008 | Part 2 | Question: 31

Assembler program is :
A. dependent on the operating system B. dependent on the compiler
C. dependent on the hardware D. independent of the hardware

ugcnetcse-june2008-paper2

Answer key ☟

36.0.504 UGC NET CSE | June 2008 | Part 2 | Question: 30

With reference to hierarchical routing, the optimum number of levels for an router subnet is:

A. B. C. D.

ugcnetcse-june2008-paper2

Answer key ☟

36.0.505 UGC NET CSE | June 2008 | Part 2 | Question: 29

An example of a public key encryption algorithm is :

A. Caesar cipher algorithm B. DES algorithm
C. AES algorithm D. Knapsack algorithm

ugcnetcse-june2008-paper2

Answer key ☟

36.0.506 UGC NET CSE | June 2008 | Part 2 | Question: 28

For a channel of bandwidth and signal to noise ratio of , the maximum data rate is:
A. B.
C. D.

ugcnetcse-june2008-paper2

Answer key ☟

36.0.507 UGC NET CSE | June 2008 | Part 2 | Question: 27

For slotted ALOHA, the maximum channel utilization is :

A. B. C. D.
 ugcnetcse-june2008-paper2

36.0.508 UGC NET CSE | June 2008 | Part 2 | Question: 26

The cells are __________ bytes long.

A. B. C. D.

ugcnetcse-june2008-paper2

36.0.509 UGC NET CSE | June 2008 | Part 2 | Question: 25

An example of a possible file attribute is:

A. minimum size B. permanent flag
C. archive flag D. EBCDIC flag

ugcnetcse-june2008-paper2

36.0.510 UGC NET CSE | June 2008 | Part 2 | Question: 24

Files that are related to input/output and are used to model serial devices such as terminals, printers and
networks are called:

A. regular files B. character special files

C. directories D. block special files

ugcnetcse-june2008-paper2

Answer key ☟

36.0.511 UGC NET CSE | June 2008 | Part 2 | Question: 22

Which of the following can be the sequence of nodes examined in a binary search tree while searching for key
?
A. B.
C. D.

ugcnetcse-june2008-paper2

36.0.512 UGC NET CSE | June 2008 | Part 2 | Question: 21

Which of the following data structures is most efficient in terms of both space and time to reverse a string of
characters?

A. Linked list B. Stack C. Array D. Tree

ugcnetcse-june2008-paper2

Answer key ☟

36.0.513 UGC NET CSE | June 2008 | Part 2 | Question: 20

Consider the query: SELECT student_name FROM student_data WHERE rollno (SELECT rollno FROM
student_marks WHERE SEM1_MARK=SEM2_MARK); Which of the following is true?

A. It gives the name of the student whose marks in semester and semester are same.
B. It gives all the names and roll nos of those students whose marks in semester and semester are same.
C. It gives the names of all the students whose marks in semester and semester are same.
 D. It gives roll numbers of all students whose marks in semester and semester are same.

ugcnetcse-june2008-paper2

Answer key ☟

36.0.514 UGC NET CSE | June 2008 | Part 2 | Question: 19

Which of the following is true?

A. A relation in is always in
B. A relation in is always in
C. and are totally different
D. A relation in is in but not in

ugcnetcse-june2008-paper2

Answer key ☟

36.0.515 UGC NET CSE | June 2008 | Part 2 | Question: 18

If a relation is in then :

A. every candidate key is a primary key

B. every non-prime attribute is fully functionally dependent on each relation key
C. every attribute is functionally independent
D. every relational key is a primary key

ugcnetcse-june2008-paper2

Answer key ☟

36.0.516 UGC NET CSE | June 2008 | Part 2 | Question: 17

Which of the following set of keywords constitutes a mapping in ?

A. B.
C. D.

ugcnetcse-june2008-paper2

Answer key ☟

36.0.517 UGC NET CSE | June 2008 | Part 2 | Question: 16

A superkey for an entity consists of :

A. one attribute only B. at least two attributes
C. at most two attributes D. one or more attributes

ugcnetcse-june2008-paper2

36.0.518 UGC NET CSE | June 2008 | Part 2 | Question: 15

Which of the following is true?

A. A "static" member of a class cannot be inherited by its derived class.

B. A "static" member of a class can be initialized only within the class it is a member of.
C. A "static" member of a class can be initialized before an object of that class is created.
D. Since "static" member of a class is actually a global element, it does not require a class/object qualifier to access it
 independently of class/object.

ugcnetcse-june2008-paper2

Answer key ☟

36.0.519 UGC NET CSE | June 2008 | Part 2 | Question: 14

Function overloading is a concept in which :

A. a function is used to implement lots of tasks at the same time.

B. a function is called too many number of times by another function.
C. a function provides common interface to the user to carry out possibly different functions in each call.
D. a function is computationally too expensive for the system to handle.

ugcnetcse-june2008-paper2

Answer key ☟

36.0.520 UGC NET CSE | June 2008 | Part 2 | Question: 13

Consider the following code :

{int a = 5, b=9;
float r;
r= b /a ;}

What is the value of ?

A. B. C. D.

ugcnetcse-june2008-paper2

Answer key ☟

36.0.521 UGC NET CSE | June 2008 | Part 2 | Question: 12

Consider the following declaration in :

char a[];
char * p;

Which of the following statement is not a valid statement?

A. ; B. ;
C. ; D.

ugcnetcse-june2008-paper2

Answer key ☟

36.0.522 UGC NET CSE | June 2008 | Part 2 | Question: 11

What is the effect of the following code?

for(int i=1 ; i ≤ 5 ; i = i + 1/2)
printf(" % d,", i);

A. It prints , and stops

B. It prints , and stops
C. It prints , and repeats forever
D. It prints , and repeats forever
 ugcnetcse-june2008-paper2

36.0.523 UGC NET CSE | June 2008 | Part 2 | Question: 10

The idempotent law in Boolean algebra says that:

A. B. C. D.

ugcnetcse-june2008-paper2

Answer key ☟

36.0.524 UGC NET CSE | June 2008 | Part 2 | Question: 9

The characteristic equation of a flip flop is given by :

A.
B.
C.
D.

ugcnetcse-june2008-paper2

36.0.525 UGC NET CSE | June 2008 | Part 2 | Question: 8

The octal equivalent of the hexadecimal number is :

A. B. C. D.

ugcnetcse-june2008-paper2

Answer key ☟

36.0.526 UGC NET CSE | June 2008 | Part 2 | Question: 7

Among the logic families and , the fastest family is :

A. B. C. D.

ugcnetcse-june2008-paper2

Answer key ☟

36.0.527 UGC NET CSE | June 2008 | Part 2 | Question: 6

An example of a tautology is :
A. B.
C. D.

ugcnetcse-june2008-paper2

Answer key ☟
 36.0.528 UGC NET CSE | June 2008 | Part 2 | Question: 5

In a set of positive integers, there always exists a pair of numbers having the same remainder when divided by
:

A. B. C. D.

ugcnetcse-june2008-paper2

36.1 Abelian Group (1)

36.1.1 Abelian Group: UGC NET CSE | June 2008 | Part 2 | Question: 4

The set of positive integers under the operation of ordinary multiplication is :

A. not a monoid B. not a group
C. a group D. an Abelian group

ugcnetcse-june2008-paper2 abelian-group

Answer key ☟

36.2 Acid Properties (1)

36.2.1 Acid Properties: UGC NET CSE | December 2009 | Part 2 | Question: 45

The name of the transaction file shall be provided by the operator and the file that contains the edited
transactions ready for execution shall be called

(A) Batch. Exe

(B) Trans. Exe

(C) Opt. Exe

(D) Edit.Exe
ugcnetcse-dec2009-paper2 databases acid-properties

36.3 Array (1)

36.3.1 Array: UGC NET CSE | June 2008 | Part 2 | Question: 23

Which of the following is true for a sorted list with ' ' elements?

A. Insertion in a sorted array takes constant time.

B. Insertion in a sorted linear linked list takes constant time.
C. Searching for a key in a sorted array can be done in time.
D. Searching for a key in a sorted linear linked list can be done in time.

ugcnetcse-june2008-paper2 sorting array time-complexity

Answer key ☟

36.4 Artificial Intelligence (1)

36.4.1 Artificial Intelligence: UGC NET CSE | August 2016 | Part 3 | Question: 71

Match each Artificial Intelligence term in List-I that best describes a given situation in List-II :
 A. B.
C. D.
ugcnetcse-aug2016-paper3 artificial-intelligence

Answer key ☟

36.5 Assembly (1)

36.5.1 Assembly: UGC NET CSE | June 2011 | Part 2 | Question: 34

In which way(s) a macroprocessor for assembly language can be implemented?

A. Independent two-pass processor B. Independent one-pass processor
C. Expand macrocalls and substitute arguments D. All of the above
ugcnetcse-june2011-paper2 co-and-architecture microprocessors assembly

Answer key ☟

36.6 Binary Heap (1)

36.6.1 Binary Heap: UGC NET CSE | June 2023 | Part 2: 21

Consider the following statements about heap sort algorithm:

A. The MAX-HEAPIFY procedure which runs in time, is the key to maintaining the max heap property
B. The BUILD-MAX-HEAP procedure, which runs in time, produces max-heap from an unordered input array
C. The MAX-HEAP-INSERT, which runs in time, implements the insertion operation
D. The HEAP-INCREASE-KEY procedure runs in time , to set the key of new node of its correct value

Choose the correct answer from the options given below:

A. only
B. only
C. only
D.

ugcnetcse-june2023-paper2 binary-heap algorithms

Answer key ☟

36.7 Binary Tree (1)

36.7.1 Binary Tree: UGC NET CSE | June 2011 | Part 2 | Question: 22

Given a binary tree whose inorder and preorder traversal are given by
Inorder : EICFBGDJHK
Preorder : BCEIFDGHJK
The post order traversal of the above binary tree is
 A. I E F C G J K H D B B. I E F C J G K H D B
C. I E F C G K J H D B D. I E F C G J K D B H
ugcnetcse-june2011-paper2 algorithms binary-tree

Answer key ☟

36.8 Boolean Algebra (1)

36.8.1 Boolean Algebra: UGC NET CSE | December 2019 | Part 2 | Question: 3

The Boolean expression is unaffected by the value of the Boolean variable _________.

A. B. C. D. and
ugcnetcse-dec2019-paper2 digital-logic boolean-algebra

Answer key ☟

36.9 Combinatory (1)

36.9.1 Combinatory: UGC NET CSE | September 2013 | Part 2 | Question: 19

Find the number of ways to paint 12 offices so that 3 of them will be green, 2 of them pink, 2 of them yellow
and the rest ones white.

A. 55,440 B. 1,66,320 C. 4.790E+08 D. 39,91,680

ugcnetsep2013ii combinatory

Answer key ☟

36.10 Compilation Phases (1)

36.10.1 Compilation Phases: UGC NET CSE | December 2010 | Part 2 | Question: 33

Grammar of the programming is checked at ________ phase of compiler.

A. Semantic analysis B. Code generation
C. Syntax analysis D. Code optimization
ugcnetcse-dec2010-paper2 compiler-design compilation-phases

Answer key ☟

36.11 Crypt Arithmetic (1)

36.11.1 Crypt Arithmetic: UGC NET CSE | September 2013 | Part 3 | Question: 3

Assume that each alphabet can have a value between 0 to 9 in a cryptoarithmetic problem

Which of the following statements is true?

I. No two alphabets can have the same numeric value

II. Any two alphabets can have the same numeric value
III. D=0
IV. D=1
A. I and III B. I and IV C. II and III D. II and IV
ugcnetcse-sep2013-paper3 cryptography crypt-arithmetic

Answer key ☟

36.12 Data Compression (1)

 36.12.1 Data Compression: UGC NET CSE | Junet 2015 | Part 3 | Question: 65

The redundancy in images stems from

A. pixel decolleration B. pixel colleration
C. pixel quantization D. image size
ugcnetcse-june2015-paper3 data-compression digital-image-processing

Answer key ☟

36.13 Data Flow Diagram (1)

36.13.1 Data Flow Diagram: UGC NET CSE | June 2011 | Part 2 | Question: 43

By means of a data flow diagram, the analyst can detect

A. Task duplication B. Unnecessary delays
C. Task overlapping D. All of the above
ugcnetcse-june2011-paper2 is&software-engineering data-flow-diagram

Answer key ☟

36.14 Data Mart (1)

36.14.1 Data Mart: UGC NET CSE | December 2010 | Part 2 | Question: 46

A data mart may contain

A. Summarised data B. De-normalized data
C. Aggregate departmental data D. All of the above
ugcnetcse-dec2010-paper2 data-warehousing data-mart

Answer key ☟

36.15 Data Mining (4)

36.15.1 Data Mining: UGC NET CSE | August 2016 | Part 2 | Question: 48

In Data mining, classification rules are extracted from _______.

A. Data B. Information C. Decision Tree D. Database

ugcnetcse-aug2016-paper2 data-mining

Answer key ☟

36.15.2 Data Mining: UGC NET CSE | August 2016 | Part 2 | Question: 50

In Data mining, ______ is a method of incremental conceptual clustering.

A. STRING B. COBWEB C. CORBA D. OLAD

ugcnetcse-aug2016-paper2 data-mining

Answer key ☟

36.15.3 Data Mining: UGC NET CSE | December 2010 | Part 2 | Question: 47

Data mining is

A. The process of extracting valid, previously unknown, comprehensible and actionable information from large
databases and using it to make crucial business decisions.
B. A tool that allows end users direct access and manipulation of data from within datawarehousing environment
without the intervention of customised programming activity.
C. A tool that helps end users extract useful business information from large database.
D. All of the above
 ugcnetcse-dec2010-paper2 databases data-mining

Answer key ☟

36.15.4 Data Mining: UGC NET CSE | December 2011 | Part 2 | Question: 47

Web Mining is not used in which of the following areas ?

A. Information filtering B. Crime fighting on the internet
C. Online transaction processing D. Click stream analysis.
ugcnetcse-dec2011-paper2 data-mining

Answer key ☟

36.16 Data Warehousing (2)

36.16.1 Data Warehousing: UGC NET CSE | August 2016 | Part 2 | Question: 47

_______ is subject oriented, integrated, time variant, nonvolatile collection of data in support of management
decisions.
A. Data mining B. Web mining
C. Data warehouse D. Database Management System
ugcnetcse-aug2016-paper2 data-warehousing

Answer key ☟

36.16.2 Data Warehousing: UGC NET CSE | June 2011 | Part 2 | Question: 46

Data warehousing refers to

A. Storing data offline at a separate site B. Backing up data regularly
C. Is related to data mining D. Uses tape as opposed to disk
ugcnetcse-june2011-paper2 data-warehousing

Answer key ☟

36.17 Deadlock Prevention Avoidance Detection (1)

36.17.1 Deadlock Prevention Avoidance Detection: UGC NET CSE | June 2008 | Part 2 | Question: 40

A computer has tape drives with ' ' processes competing for them. Each process may need two drives. For
which values of ' ' is the system deadlock free?

A. B. C. D.

ugcnetcse-june2008-paper2 deadlock-prevention-avoidance-detection

36.18 Decomposition (1)

36.18.1 Decomposition: UGC NET CSE | June 2011 | Part 2 | Question: 20

Decomposition help in eliminating some of the problems of bad design

A. Redundancy B. Inconsistencies
C. Anomalies D. All of the above
ugcnetcse-june2011-paper2 databases decomposition

Answer key ☟

36.19 Digital Image Processing (3)

 36.19.1 Digital Image Processing: UGC NET CSE | August 2016 | Part 3 | Question: 60

If the histogram of an image is clustered towards origin on X-axis of a histogram plot then it indicates that the
image is ______.

A. Dark B. Good contrast C. Bright D. Very low contrast

ugcnetcse-aug2016-paper3 digital-image-processing

Answer key ☟

36.19.2 Digital Image Processing: UGC NET CSE | December 2013 | Part 3 | Question: 31

Consider the formula in image processing where is called as compression ratio

and denotes the number of information carrying units in two datasets that represent the same information.
In this situation is called as relative ____ of the first data set.
A. Data Compression B. Data Redundancy
C. Data Relation D. Data Representation
ugcnetcse-dec2013-paper3 digital-image-processing

Answer key ☟

36.19.3 Digital Image Processing: UGC NET CSE | June 2012 | Part 3 | Question: 22

The transform which possess the highest ‘energy compaction’ property is

A. Slant transform B. Cosine transform
C. Fourier transform D. Karhunen-Loeve transform
ugcnetcse-june2012-paper3 digital-image-processing

Answer key ☟

36.20 Disk (1)

36.20.1 Disk: UGC NET CSE | June 2011 | Part 2 | Question: 36

Block or Buffer caches are used to

A. Improve disk performance B. Handle interrupts
C. Increase the capacity of main memory D. Speed up main memory Read operations
ugcnetcse-june2011-paper2 operating-system disk

Answer key ☟

36.21 Disk Scheduling (1)

36.21.1 Disk Scheduling: UGC NET CSE | June 2011 | Part 2 | Question: 23

The number of disk accesses performed by insertion operation in B-tree of height is

A. B. C. D. None of these
ugcnetcse-june2011-paper2 operating-system disk-scheduling

Answer key ☟

36.22 Duality (1)

36.22.1 Duality: UGC NET CSE | August 2016 | Part 3 | Question: 62

Consider the following statements :

(a) If primal (dual) problem has a finite optimal solution, then its dual (primal) problem has a finite optimal
solution.
(b) If primal (dual) problem has an unbounded optimum solution, then its dual (primal) has no feasible solution at all.
(c) Both primal and dual problems may be infeasible. Which of the following is correct ?
 A. (a) and (b) only B. (a) and (c) only C. (b) and (c) only D. (a), (b) and (c)
ugcnetcse-aug2016-paper3 linear-programming duality

Answer key ☟

36.23 E Commerce (2)

36.23.1 E Commerce: UGC NET CSE | August 2016 | Part 2 | Question: 49

Discovery of cross sales opportunities is called as _____.

A. Association B. Visualization C. Correlation D. Segmentation

ugcnetcse-aug2016-paper2 e-technologies e-commerce

Answer key ☟

36.23.2 E Commerce: UGC NET CSE | June 2011 | Part 2 | Question: 50

Which is the most valuable electronic commerce to the individual customer in long run ?
A. Business to Customer B. Business to Business
C. Customer to Customer D. None of the above
ugcnetcse-june2011-paper2 e-technologies e-commerce

Answer key ☟

36.24 E Payment (1)

36.24.1 E Payment: UGC NET CSE | June 2011 | Part 2 | Question: 49

The principal electronic payment systems for electronic commerce is

A. Credit Card B. Digital Wallet

C. Electronic Cheque D. All of the above
ugcnetcse-june2011-paper2 e-technologies e-payment

Answer key ☟

36.25 E Technologies (3)

36.25.1 E Technologies: UGC NET CSE | December 2010 | Part 2 | Question: 48

E-Choupal refers to

A. Calling meeting of Surpanches electronically.

B. Conducting Panchayat meeting using latest electronic gadgets.
C. Providing window of information to villagers and farmers in NIC network.
D. None of the above

ugcnetcse-dec2010-paper2 e-technologies

Answer key ☟

36.25.2 E Technologies: UGC NET CSE | December 2011 | Part 2 | Question: 7

BCC in the internet refers to

A. Black carbon copy B. Blind carbon copy
C. Blank carbon copy D. Beautiful carbon copy
ugcnetcse-dec2011-paper2 e-technologies

Answer key ☟
 36.25.3 E Technologies: UGC NET CSE | June 2011 | Part 2 | Question: 48

"M-Commerce" refers to

A. A myth which does not exist in reality

B. The ability of business to reach potential customers wherever they are
C. The ability to have large capacity of memory storage dealing trade and commerce
D. None of the above

ugcnetcse-june2011-paper2 e-technologies

Answer key ☟

36.26 Encryption Decryption (2)

36.26.1 Encryption Decryption: UGC NET CSE | September 2013 | Part 2 | Question: 3

Which of the following substitution technique have the relationship between a character in the plaintext and a
character in the ciphertext as one-to-many?
A. Monoalphabetic B. Polyalphabetic
C. Transpositional D. None of the above
ugcnetsep2013ii cryptography encryption-decryption

Answer key ☟

36.26.2 Encryption Decryption: UGC NET CSE | September 2013 | Part 3 | Question: 57

If user A wants to send an encrypted message to user B, the plain text of A is encrypted with the
A. Public key of user A B. Public key of user B
C. Private key of user A D. Private key of user B
ugcnetcse-sep2013-paper3 cryptography encryption-decryption

Answer key ☟

36.27 Enterprise Resource Planning (2)

36.27.1 Enterprise Resource Planning: UGC NET CSE | December 2011 | Part 2 | Question: 44

Enterprise Resource Planning (ERP)

A. Has existed for over a decade.

B. Does not integrate well with the functional areas other than operations.
C. Is inexpensive to implement.
D. Automate and integrates the majority of business processes.

ugcnetcse-dec2011-paper2 enterprise-resource-planning

Answer key ☟

36.27.2 Enterprise Resource Planning: UGC NET CSE | December 2011 | Part 2 | Question: 45

Which of the following is false concerning Enterprise Resource Planning (ERP) ?

A. It attempts to automate and integrate the majority of business processes.

B. It shares common data and practices across the enterprise.
C. It is inexpensive to implement.
D. It provides and access information in a real-time environment.

ugcnetcse-dec2011-paper2 enterprise-resource-planning

Answer key ☟
36.28 Error Correction (1)

36.28.1 Error Correction: UGC NET CSE | June 2008 | Part 2 | Question: 3

If a code is t-error correcting, the minimum Hamming distance is equal to :

A. B. C. D.

ugcnetcse-june2008-paper2 hamming-code error-correction

Answer key ☟

36.29 File System (1)

36.29.1 File System: UGC NET CSE | June 2011 | Part 2 | Question: 37

A file organization component VSAM file is

A. Relative records data set B. Keyed sequential data set
C. Entry sequential data set D. All of the above
ugcnetcse-june2011-paper2 operating-system file-system

Answer key ☟

36.30 Fuzzy Logic (2)

36.30.1 Fuzzy Logic: UGC NET CSE | August 2016 | Part 3 | Question: 64

What are the following sequence of steps taken in designing a fuzzy logic machine ?

A. Fuzzification Rule evaluation Defuzzification

B. Fuzzification Defuzzification Rule evaluation
C. Rule evaluation Fuzzification Defuzzification
D. Rule evaluation Defuzzification Fuzzification

ugcnetcse-aug2016-paper3 neural-network fuzzy-logic

Answer key ☟

36.30.2 Fuzzy Logic: UGC NET CSE | September 2013 | Part 3 | Question: 26

Let A be a set of comfortable houses given as and be the set of affordable houses
Then the set of comfortable and affordable houses is

A.
B.
C.
D.

ugcnetcse-sep2013-paper3 neural-network fuzzy-logic

Answer key ☟

36.31 Fuzzy Relations (1)

36.31.1 Fuzzy Relations: UGC NET CSE | August 2016 | Part 3 | Question: 66

Let R and S be two fuzzy relations defined as

 and
Then, the resulting relation, , which relates elements of universe of to elements of universe of using max-product
composition is given by

A.

B.

C.

D.

ugcnetcse-aug2016-paper3 neural-network fuzzy-relations

Answer key ☟

36.32 Fuzzy Set (2)

36.32.1 Fuzzy Set: UGC NET CSE | December 2013 | Part 3 | Question: 28

If A and B are two fuzzy sets with membership functions

Then the value of will be

A. B.
C. D.
ugcnetcse-dec2013-paper3 fuzzy-set

Answer key ☟

36.32.2 Fuzzy Set: UGC NET CSE | December 2013 | Part 3 | Question: 29

The height h(A) of a fuzzy set A is defined as

h(A) = sup A(x)
x A
The fuzzy set A is called normal when

A. h(A)=0 B. h(A)<0 C. h(A)=1 D. h(A)<0

ugcnetcse-dec2013-paper3 fuzzy-set

Answer key ☟

36.33 General Awareness (33)

36.33.1 General Awareness: UGC NET CSE | June 2019 | Part 1 | Question: 1

To organize discussion method in teaching effectively, which of the following conditions should be met?
 i. Topic be easy
ii. Topic be declared in advance
iii. Topic of common interest
iv. Availability of more than one teacher
v. Language facility of participants

Select appropriate answer from the options given below:

A. ii, iii, and v B. i, ii, and iii
C. i, ii and v D. iii, iv and v
ugcnetcse-june2019-paper1 general-awareness

Answer key ☟

36.33.2 General Awareness: UGC NET CSE | June 2019 | Part 1 | Question: 10

Which of the following is a plagiarism checking website?

A. http://go.turnitin.com B. http://www.researchgate.com
C. http://www.editorial.elsevier.com D. http://www.grammarly.com
ugcnetcse-june2019-paper1 general-awareness

Answer key ☟

36.33.3 General Awareness: UGC NET CSE | June 2019 | Part 1 | Question: 11

Michaelangelo is famous for having successfully interpreted the human body. His great achievement is that of
the painting of David whose hands reach out as a sign of human capability and potential. It is assumed that the
time he lived was ripe for exchange of knowledge, development in science and matured enough to advance the horizon
of investigation in all fields. Renaissance humanism stressed on a serious rethink on the nature of art that focussed
on accurate details. In painting and sculpture, artists focussed on not so casual but verifiable and minute details.
Michaelangelo’s paintings are no exception to it. In a study published in the journal of the Royal Society of medicine, a
group of surgeons are of the opinion that the great master was “afflicted by an illness involving his joints”. They have
used his portraits as evidence to argue their view. During his life, he complained of what he felt to be ‘gout’. Later he
complained of his sore and stiff hands which the doctors would find to be natural for someone who was engaged in
handmade art. The doctors found corroboration of those claims in portraits of the artist that show a hanging left hand
with both degenerative and non-degenerative changes. They attribute the pain not just to arthritis, but to the stress of
hammering and chiselling and note that though the master was seen hammering days before his death at an old age, he
did not write or sign his own letters before his death. In recent times there have been attempts to diagnose famous artists
with diseases that were not known during their time. This practice has raised many questions, especially on the issue of
ethics in research. It is also inferred from authentic analysis that Michaelangelo persisted in his work until his last days.
This theory would emphasize that his artistic subject defined his physical infirmities.
Michaelangelo lived during a time that lets us know that

A. Human aspirants are limitless and open to new vistas of knowledge

B. Cross cultural exchange in ideas is the only way for human progress
C. It is progress of science and anatomy that contributes to civilizations exclusively
D. Human beings possess language which is the only key to knowledge

ugcnetcse-june2019-paper1 general-awareness passage-reading

36.33.4 General Awareness: UGC NET CSE | June 2019 | Part 1 | Question: 12

Michaelangelo is famous for having successfully interpreted the human body. His great achievement is that of
the painting of David whose hands reach out as a sign of human capability and potential. It is assumed that the
time he lived was ripe for exchange of knowledge, development in science and matured enough to advance the horizon
of investigation in all fields. Renaissance humanism stressed on a serious rethink on the nature of art that focussed on a
accurate details. In painting and sculpture, artists focussed on not so casual but verifiable and minute details.
Michaelangelo’s paintings are no exception to it. In a study published in the journal of the Royal Society of medicine, a
group of surgeons are of the opinion that the great master was “afflicted by an illness involving his joints”. They have
used his portraits as evidence to argue their view. During his life, he complained of what he felt to be ‘gout’. Later he
complained of his sore and stiff hands which the doctors would find to be natural for someone who was engaged in
 handmade art. The doctors found corroboration of those claims in portraits of the artist that show a hanging left hand
with both degenerative and non-degenerative changes. They attribute the pain not just to arthritis, but to the stress of
hammering and chiselling and note that though the master was seen hammering days before his death at an old age, he
did not write or sign his own letters before his death. In recent times there have been attempts to diagnose famous artists
with diseases that were not known during their time. This practice has raised many questions, especially on the issue of
ethics in research. It is also inferred from authentic analysis that Michaelangelo persisted in his work until his last days.
This theory would emphasize that his artistic subject defined his physical infirmities.
Renaissance painting in Europe was sceptical of
A. The obsessive medieval method of accuracy B. The classical simplicity and lack of control
C. The case and decorative excess of earlier art D. Expressionist technique
ugcnetcse-june2019-paper1 general-awareness passage-reading

36.33.5 General Awareness: UGC NET CSE | June 2019 | Part 1 | Question: 13

Michaelangelo is famous for having successfully interpreted the human body. His great achievement is that of
the painting of David whose hands reach out as a sign of human capability and potential. It is assumed that the
time he lived was ripe for exchange of knowledge, development in science and matured enough to advance the horizon
of investigation in all fields. Renaissance humanism stressed on a serious rethink on the nature of art that focussed on a
accurate details. In painting and sculpture, artists focussed on not so casual but verifiable and minute details.
Michaelangelo’s paintings are no exception to it. In a study published in the journal of the Royal Society of medicine, a
group of surgeons are of the opinion that the great master was “afflicted by an illness involving his joints”. They have
used his portraits as evidence to argue their view. During his life, he complained of what he felt to be ‘gout’. Later he
complained of his sore and stiff hands which the doctors would find to be natural for someone who was engaged in
handmade art. The doctors found corroboration of those claims in portraits of the artist that show a hanging left hand
with both degenerative and non-degenerative changes. They attribute the pain not just to arthritis, but to the stress of
hammering and chiselling and note that though the master was seen hammering days before his death at an old age, he
did not write or sign his own letters before his death. In recent times there have been attempts to diagnose famous artists
with diseases that were not known during their time. This practice has raised many questions, especially on the issue of
ethics in research. It is also inferred from authentic analysis that Michaelangelo persisted in his work until his last days.
This theory would emphasize that his artistic subject defined his physical infirmities.
The controversy that the passage above refers to is whether

A. Michaelangelo worked under duress

B. Michaelangelo could contain his physical infirmity by artistic excellence
C. Michaelangelo submitted to disease
D. Michaelangelo survived different diseases before pursuing art

ugcnetcse-june2019-paper1 general-awareness passage-reading

36.33.6 General Awareness: UGC NET CSE | June 2019 | Part 1 | Question: 14

Michaelangelo is famous for having successfully interpreted the human body. His great achievement is that of
the painting of David whose hands reach out as a sign of human capability and potential. It is assumed that the
time he lived was ripe for exchange of knowledge, development in science and matured enough to advance the horizon
of investigation in all fields. Renaissance humanism stressed on a serious rethink on the nature of art that focussed on a
accurate details. In painting and sculpture, artists focussed on not so casual but verifiable and minute details.
Michaelangelo’s paintings are no exception to it. In a study published in the journal of the Royal Society of medicine, a
group of surgeons are of the opinion that the great master was “afflicted by an illness involving his joints”. They have
used his portraits as evidence to argue their view. During his life, he complained of what he felt to be ‘gout’. Later he
complained of his sore and stiff hands which the doctors would find to be natural for someone who was engaged in
handmade art. The doctors found corroboration of those claims in portraits of the artist that show a hanging left hand
with both degenerative and non-degenerative changes. They attribute the pain not just to arthritis, but to the stress of
hammering and chiselling and note that though the master was seen hammering days before his death at an old age, he
did not write or sign his own letters before his death. In recent times there have been attempts to diagnose famous artists
with diseases that were not known during their time. This practice has raised many questions, especially on the issue of
ethics in research. It is also inferred from authentic analysis that Michaelangelo persisted in his work until his last days.
This theory would emphasize that his artistic subject defined his physical infirmities.
What generalisations do people subscribe to?
 A. Establishing facts by tests
B. Inferring the essence of character from famous people’s handwriting
C. Carbon dating of the hair of celebrities to draw conclusion on their physical structure
D. To retroactively diagnose famous artists and public figures of conditions that were not prevalent during their time

ugcnetcse-june2019-paper1 general-awareness passage-reading

36.33.7 General Awareness: UGC NET CSE | June 2019 | Part 1 | Question: 15

Michaelangelo is famous for having successfully interpreted the human body. His great achievement is that of
the painting of David whose hands reach out as a sign of human capability and potential. It is assumed that the
time he lived was ripe for exchange of knowledge, development in science and matured enough to advance the horizon
of investigation in all fields. Renaissance humanism stressed on a serious rethink on the nature of art that focussed on a
accurate details. In painting and sculpture, artists focussed on not so casual but verifiable and minute details.
Michaelangelo’s paintings are no exception to it. In a study published in the journal of the Royal Society of medicine, a
group of surgeons are of the opinion that the great master was “afflicted by an illness involving his joints”. They have
used his portraits as evidence to argue their view. During his life, he complained of what he felt to be ‘gout’. Later he
complained of his sore and stiff hands which the doctors would find to be natural for someone who was engaged in
handmade art. The doctors found corroboration of those claims in portraits of the artist that show a hanging left hand
with both degenerative and non-degenerative changes. They attribute the pain not just to arthritis, but to the stress of
hammering and chiselling and note that though the master was seen hammering days before his death at an old age, he
did not write or sign his own letters before his death. In recent times there have been attempts to diagnose famous artists
with diseases that were not known during their time. This practice has raised many questions, especially on the issue of
ethics in research. It is also inferred from authentic analysis that Michaelangelo persisted in his work until his last days.
This theory would emphasize that his artistic subject defined his physical infirmities.
What actually may be concluded from the above passage?

A. Physical infirmities do dissuade people with capabilities from excelling

B. Excellence in any form triumphs over extraneous factors including physical ailments
C. Michaelangelo’s gout and other ailments lessened his efficiency
D. The diseases Michaelangelo faced were due to constant hammering

ugcnetcse-june2019-paper1 general-awareness passage-reading

36.33.8 General Awareness: UGC NET CSE | June 2019 | Part 1 | Question: 16

The dance of the honeybee conveying to other bees where nector will be found is an example of
A. Mass communication B. Group communication
C. Interpersonal communication D. Intrapersonal communication
ugcnetcse-june2019-paper1 general-awareness

36.33.9 General Awareness: UGC NET CSE | June 2019 | Part 1 | Question: 17

Choose the correct sequence of communication from the options given below:

A. Information – exposure – persuasion – behavioural change

B. Persuasion – information – behavioural change – exposure
C. Exposure – information – persuasion – behavioural change
D. Behavioural change – information – persuasion – exposure

ugcnetcse-june2019-paper1 general-awareness

36.33.10 General Awareness: UGC NET CSE | June 2019 | Part 1 | Question: 18

Which of the following is a function of mass media?

1. To transmit culture
2. To formulate national policies
3. To help the judiciary take its decision
 4. To stabilise the share market

ugcnetcse-june2019-paper1 general-awareness

36.33.11 General Awareness: UGC NET CSE | June 2019 | Part 1 | Question: 19

In a classroom situation, a teacher organises group discussion to help arrive at a solution of a problem. In terms
of a model communication used, it will be called
A. A transaction model B. An interaction model
C. A horizontal model D. A linear model
ugcnetcse-june2019-paper1 general-awareness

36.33.12 General Awareness: UGC NET CSE | June 2019 | Part 1 | Question: 2

Who developed the theory of ‘Multiple Intelligence’?

A. Alfred Binet B. L. Thurstone
C. Charles Spearman D. Howard Gardner
ugcnetcse-june2019-paper1 general-awareness

Answer key ☟

36.33.13 General Awareness: UGC NET CSE | June 2019 | Part 1 | Question: 3

From the list of the effective teaching behaviours, identify those which are called key behaviours.

i. Direct, audible and oral delivery to all students

ii. Encouraging students to elaborate on an answer
iii. Warm and nurturing relationships with learners
iv. Varying modes of presentation
v. Preventing misbehaviour with a minimum of class disruption
vi. Organising what is to come and summarising what has gone before

Select your answer from the options given below :

A. i, iv and v B. i, ii and iii
C. ii, iii and iv D. iv, v and vi
ugcnetcse-june2019-paper1 general-awareness

36.33.14 General Awareness: UGC NET CSE | June 2019 | Part 1 | Question: 36

Which of the following is a type of malware intentionally inserted into a software system that will setoff a
malicious function when specified conditions are met?

A. Worm B. Trojan C. Spyware D. Logic bomb

ugcnetcse-june2019-paper1 general-awareness

Answer key ☟

36.33.15 General Awareness: UGC NET CSE | June 2019 | Part 1 | Question: 37

Select the true statement about an Operating System (OS)?

A. An OS controls peripherals, allocates memory and organises data into fields and records
B. An OS provides protection against viruses and controls peripherals
C. An OS controls peripheral, and allocates memory and processor time
D. An OS controls the procesor and peripherals and allows user to connect to the Internet

ugcnetcse-june2019-paper1 general-awareness

Answer key ☟
36.33.16 General Awareness: UGC NET CSE | June 2019 | Part 1 | Question: 38

Select the option that shows the storage devices in order of capacity from lowest to highest
A. CD-ROM, DVD-ROM, Blu-ray B. Blu-ray, CD-ROM, DVD-ROM
C. DVD-ROM, Blu-ray, CD-ROM D. DVD-ROM, CD-ROM, Blu-ray
ugcnetcse-june2019-paper1 general-awareness

Answer key ☟

36.33.17 General Awareness: UGC NET CSE | June 2019 | Part 1 | Question: 39

Which of the following statement(s) is/are True in respect of Wireless Technology?

P : Bluetooth is a wireless technology which can be used to connect a headset to a mobile phone.
Q : Bluetooth is a long range wireless technology and is a low cost means of data transfer.

A. P only B. Q only C. Both P and Q D. Neither P nor Q

ugcnetcse-june2019-paper1 general-awareness

Answer key ☟

36.33.18 General Awareness: UGC NET CSE | June 2019 | Part 1 | Question: 4

Which of the following statements explains the concepts of inclusive teaching?

A. Teacher facilitates the learning of the gifted students

B. Teacher facilitates the learning of the weak students
C. Teacher takes support of parents of the students to make them learn
D. Teacher makes the students of different backgrounds to learn together in the same class

ugcnetcse-june2019-paper1 general-awareness

Answer key ☟

36.33.19 General Awareness: UGC NET CSE | June 2019 | Part 1 | Question: 40

Which one of the following pairs LEAST matches in respect of computers?

A. Giga Byte :
B. : Cathode Ray Tube
C. : Rapid Online Memory
D. : Central Processing Unit

ugcnetcse-june2019-paper1 general-awareness

Answer key ☟

36.33.20 General Awareness: UGC NET CSE | June 2019 | Part 1 | Question: 41

In the last few years, India has been affected by which of the following tropical cyclones?
A. Gaja, Hudhud, Bhima B. Hudhud, Bhima, Ockhi
C. Gaja, Hudhud, Ockhi D. Gaja, Bhima, Ockhi
ugcnetcse-june2019-paper1 general-awareness

36.33.21 General Awareness: UGC NET CSE | June 2019 | Part 1 | Question: 42

Which of the following are priority areas in relation to the Sustainable Development Goals?

i. No poverty
ii. Zero hunger
iii. Reducing urbanization
iv. Peace, justice and strong institutions
 Choose the correct answer from the options given below :

A. i, ii, iii B. i, iii, iv C. ii, iii, iv D. i, ii, iv

ugcnetcse-june2019-paper1 general-awareness

36.33.22 General Awareness: UGC NET CSE | June 2019 | Part 1 | Question: 43

Assertion (A) : Methemoglobinemia is a condition in which blood is not able to carry and deliver enough
oxygen to the body.
Reason (R) : Consuming drinking water with high nitrate levels may cause methemoglobinemia.
Choose the correct answer from the options given below :

A. Both (A) and (R) are true and (R) is the correct explanation of (A)
B. Both (A) and (R) are true but (R) is not the correct explanation of (A)
C. (A) is true but (R) is false
D. (A) is false but (R) is true

ugcnetcse-june2019-paper1 general-awareness

36.33.23 General Awareness: UGC NET CSE | June 2019 | Part 1 | Question: 44

Assertion (A) : High concentration of ozone in the lower troposphere is desirable.

Reason (R) : Ozone present in the atmosphere protects the living organisms on the surface of earth from the
harmful ultra-violet radiation of the sun.
Choose the correct answer from the options given below :

A. Both (A) and (R) are true and (R) is the correct explanation of (A)
B. Both (A) and (R) are true but (R) is not the correct explanation of (A)
C. (A) is true but (R) is false
D. (A) is false but (R) is true

ugcnetcse-june2019-paper1 general-awareness

36.33.24 General Awareness: UGC NET CSE | June 2019 | Part 1 | Question: 45

Algal blooms in oligotrophic lakes are

A. very frequent B. frequent C. very rare D. widespread

ugcnetcse-june2019-paper1 general-awareness

Answer key ☟

36.33.25 General Awareness: UGC NET CSE | June 2019 | Part 1 | Question: 46

In post independence India, which one of the following committee/commission’s report deals with all levels of
education in India?
A. Sargeant Commission B. Hartog Committee
C. Kothari Commission D. Radhakrishnan Commission
ugcnetcse-june2019-paper1 general general-awareness

36.33.26 General Awareness: UGC NET CSE | June 2019 | Part 1 | Question: 47

The Education Commission of India that first took serious note of the problem of Brain Drain was
A. The Education Commission of India B. The University Education Commission
C. The Calcutta University Commission D. The Sargeant Commission
ugcnetcse-june2019-paper1 general-awareness
36.33.27 General Awareness: UGC NET CSE | June 2019 | Part 1 | Question: 49

Which one of the following instructional designs is not a part of SWAYAM launched by Government of India?
A. E-tutorial B. E-Content
C. Physical interaction D. Discussion Forum
ugcnetcse-june2019-paper1 general-awareness

Answer key ☟

36.33.28 General Awareness: UGC NET CSE | June 2019 | Part 1 | Question: 5

Which among the following best describes the Emotional Intelligence of learners?

i. Understand the emotion of other people and your own

ii. Express oneself very strongly
iii. Being rational in thinking
iv. Adjusting one’s emotion as per situation
v. Being creative and open to criticism
vi. Accepting other people as they are

Choose your answer from the options given below :

A. B.
C. D.
ugcnetcse-june2019-paper1 general-awareness

Answer key ☟

36.33.29 General Awareness: UGC NET CSE | June 2019 | Part 1 | Question: 50

Which of the following NOT correctly matched?

i. Gyan darshan – Satellite based educational T.V . Channel

ii. Gyan vani – Educational FM Radio network
iii. MOOCs – Massive Open Online Credits

Choose the correct answer from the options given below :

A. Only i and ii B. Only ii and iii C. Only iii D. Only i and iii
ugcnetcse-june2019-paper1 general-awareness

Answer key ☟

36.33.30 General Awareness: UGC NET CSE | June 2019 | Part 1 | Question: 6

Bibliography given in a research report

A. Helps those interested in further research B. Shows the vast knowledge of the researcher
C. Makes the report authentic D. Is an optional part of the report
ugcnetcse-june2019-paper1 general-awareness

36.33.31 General Awareness: UGC NET CSE | June 2019 | Part 1 | Question: 7

The research design is specifically related to which of the following features in research?

i. Sample selection
ii. Formulation of a plan
iii. Deciding about the tool for data collection
iv. Hypothesis making
v. Choice of a field of inquiry

Select your answer from the options given below:

A. ii, iii and iv B. i, ii and iii C. ii, iv and v D. iii, iv and v

 ugcnetcse-june2019-paper1 general-awareness

36.33.32 General Awareness: UGC NET CSE | June 2019 | Part 1 | Question: 8

Through which research method, the manipulation of an independent variable and its effect on dependent
variable is examined with reference to a hypothesis under controlled conditions?
A. Ex-post facto research B. Descriptive research
C. Case study research D. Experimental research
ugcnetcse-june2019-paper1 general-awareness

36.33.33 General Awareness: UGC NET CSE | June 2019 | Part 1 | Question: 9

In which of the following research studies interpretation and meaning get more attention than formulation of
generalisations?

i. Historical studies
ii. Survey studies
iii. Philosophical studies
iv. Ethnographic studies
v. Hypothetico – deductive studies
vi. Ex-post facto studies

Choose your answer from the options given below :

A. i, ii and iii B. iv, v and vi C. ii, iv and v D. i, iii and iv

ugcnetcse-june2019-paper1 general-awareness

36.34 Hashing (2)

36.34.1 Hashing: UGC NET CSE | December 2010 | Part 2 | Question: 24

Linear probing suffers from a problem known as

A. Secondary clustering B. Primary clustering
C. Both (A) and (B) D. None of these
ugcnetcse-dec2010-paper2 data-structures hashing

Answer key ☟

36.34.2 Hashing: UGC NET CSE | June 2011 | Part 2 | Question: 24

Consider a hash table of size and the hash function for . The
location to the key is

A. 46 B. 47 C. 41 D. 43
ugcnetcse-june2011-paper2 data-structures hashing

Answer key ☟

36.35 Image Compression (1)

36.35.1 Image Compression: UGC NET CSE | August 2016 | Part 3 | Question: 58

Which of the following is not used in standard JPEG image compression ?

A. Huffman coding B. Runlength encoding
C. Zig-zag scan D. K-L Transform
ugcnetcse-aug2016-paper3 digital-image-processing image-compression

Answer key ☟

36.36 Information System (1)

 36.36.1 Information System: UGC NET CSE | December 2015 | Part 3 | Question: 48

As compared to rental and leasing methods to acquire computer systems for a Management Information System
(MIS), purchase method has following advantage:
A. It has high level of flexibility B. It does not require cash up-front
C. It is a business investment D. Little risk of obsolescence
ugcnetcse-dec2015-paper3 information-system

Answer key ☟

36.37 Interpreter (1)

36.37.1 Interpreter: UGC NET CSE | June 2011 | Part 2 | Question: 14

The scheme of which interpreter translates the source program is known as

A. Paragraph by paragraph B. Instruction by instruction
C. Line by line D. None of the above
ugcnetcse-june2011-paper2 compiler-design interpreter

Answer key ☟

36.38 Is&software Engineering (1)

36.38.1 Is&software Engineering: UGC NET CSE | June 2011 | Part 2 | Question: 41

Which one of the items listed below is not one of the software engineering layers ?

A. Process B. Manufacturing C. Method D. Tools

ugcnetcse-june2011-paper2 is&software-engineering

Answer key ☟

36.39 Java (1)

36.39.1 Java: UGC NET CSE | June 2011 | Part 2 | Question: 15

Portable program means

A. Program with wheels B. Independent from its authors
C. Independent of platform D. None of the above
ugcnetcse-june2011-paper2 programming java

Answer key ☟

36.40 Job (1)

36.40.1 Job: UGC NET CSE | June 2011 | Part 2 | Question: 32

A special software that is used to create a job queue is called

A. Drive B. Spooler C. Interpreter D. Linkage editor

ugcnetcse-june2011-paper2 operating-system job

Answer key ☟

36.41 Kruskals Algorithm (1)

36.41.1 Kruskals Algorithm: UGC NET CSE | June 2008 | Part 2 | Question: 2

The complexity of Kruskal's minimum spanning tree algorithm on a graph with ' ' nodes and ' ' edges is :
A. B.
C. D.
 ugcnetcse-june2008-paper2 kruskals-algorithm minimum-spanning-tree

Answer key ☟

36.42 Linear Programming (3)

36.42.1 Linear Programming: UGC NET CSE | August 2016 | Part 3 | Question: 61

Consider the following linear programming problem :

Subject to the constraints

and
The total maximum profit for the above problem is :

A. B. C. D.
ugcnetcse-aug2016-paper3 linear-programming

Answer key ☟

36.42.2 Linear Programming: UGC NET CSE | January 2017 | Part 3 | Question: 70

Consider the following LPP:

The standard form of this LPP shall be:

A.

B.

C.
 D.

ugcnetcse-jan2017-paper3 linear-programming

Answer key ☟

36.42.3 Linear Programming: UGC NET CSE | June 2013 | Part 3 | Question: 23

At any iteration of simplex method if corresponding to any non-basic variable is obtained as

zero, the solution under the test is

A. Degenerate solution B. Unbounded solution

C. Alternative solution D. Optimal solution
ugcnetcse-june2013-paper3 linear-programming

Answer key ☟

36.43 Linker (2)

36.43.1 Linker: UGC NET CSE | June 2011 | Part 2 | Question: 31

Object modules generated by assembler that contains unresolved external references are resolved for two or
more object module by a/an

A. Operating system B. Loader C. Linker D. Compiler

ugcnetcse-june2011-paper2 operating-system linker

Answer key ☟

36.43.2 Linker: UGC NET CSE | June 2011 | Part 2 | Question: 35

Which of the following can be accessed by transfer vector approach of linking ?

A. External data segments B. External subroutine

C. Data located in other procedure D. All of the above
ugcnetcse-june2011-paper2 operating-system linker

Answer key ☟

36.44 Linux (1)

36.44.1 Linux: UGC NET CSE | June 2011 | Part 2 | Question: 40

Which command allows you to view your file lines at a time ?

A. More B. Cat C. Pg D. None of the above

ugcnetcse-june2011-paper2 unix linux

36.45 Management Information System (2)

36.45.1 Management Information System: UGC NET CSE | June 2011 | Part 2 | Question: 45

Many causes of the software crisis can be traced to mythology based on

A. Management Myths B. Customer Myths
C. Practitioner Myths D. All of the above
ugcnetcse-june2011-paper2 management-information-system

Answer key ☟
 36.45.2 Management Information System: UGC NET CSE | Junet 2015 | Part 3 | Question: 55

Match the following :

A. B.
C. D.
ugcnetcse-june2015-paper3 management-information-system

Answer key ☟

36.46 Microprocessors (1)

36.46.1 Microprocessors: UGC NET CSE | June 2014 | Part 3 | Question: 45

One of the main features that distinguish microprocessor from micro-computers is

A. Words are usually larger in microprocessors.

B. Words are shorter in microprocessors.
C. Microprocessor does not contain devices.
D. None of the above.

ugcnetjune2014iii microprocessors

Answer key ☟

36.47 Minimum Spanning Tree (1)

36.47.1 Minimum Spanning Tree: UGC NET CSE | December 2019 | Part 2 | Question: 6

The weight of minimum spanning tree in graph , calculated using Kruskal’s algorithm is:

A. B. C. D.
ugcnetcse-dec2019-paper2 algorithms minimum-spanning-tree

Answer key ☟
36.48 Mis (1)

36.48.1 Mis: UGC NET CSE | December 2010 | Part 2 | Question: 49

The basic concepts of ethics in information society is/are

A. Responsibility B. Accountability
C. Liability D. All of the above
ugcnetcse-dec2010-paper2 mis

Answer key ☟

36.49 Mobile Communication (2)

36.49.1 Mobile Communication: UGC NET CSE | January 2017 | Part 2 | Question: 48

Which of the following is/are true w.r.t. applications of mobile computing?

a. Travelling of salesman b. Location awareness services
A. a true; b false. B. Both a and b are true.
C. Both a and b are false. D. a false; b true.
ugcnetjan2017ii mobile-communication

Answer key ☟

36.49.2 Mobile Communication: UGC NET CSE | January 2017 | Part 2 | Question: 49

In network, is also known as . The minimum spectrum allocation required for

is

A. MHz B. KHz C. KHz D. MHz

ugcnetjan2017ii mobile-communication csma-cd

Answer key ☟

36.50 Multiple Document Interface (1)

36.50.1 Multiple Document Interface: UGC NET CSE | August 2016 | Part 3 | Question: 68

Which of the following statements is incorrect for a Windows Multiple Document Interface (MDI) ?

A. Each document in an MDI application is displayed in a separate child window within the client area of the
application’s main window.
B. An MDI application has three kinds of windows namely a frame window, an MDI client window and number of
child windows.
C. An MDI application can support more than one kind of document.
D. An MDI application displays output in the client area of the frame window.

ugcnetcse-aug2016-paper3 windows-programming multiple-document-interface

36.51 Natural Join (1)

36.51.1 Natural Join: UGC NET CSE | August 2016 | Part 3 | Question: 9

Suppose database table currently has tuples and table currently has
. Consider the following three relational algebra queries and :
: where is natural join symbol
: where is left outer join symbol
: and
The number of tuples in the resulting table of RA1, RA2 and RA3 are given by :

A. respectively B. respectively
 C. respectively D. respectively
ugcnetcse-aug2016-paper3 databases natural-join

Answer key ☟

36.52 Natural Language Processing (1)

36.52.1 Natural Language Processing: UGC NET CSE | June 2014 | Part 3 | Question: 29

STRIPS addresses the problem of efficiently representing and implementation of a planner. It is not related to
which one of the following?

A. SHAKEY B. SRI C. NLP D. None of these

ugcnetjune2014iii natural-language-processing

Answer key ☟

36.53 Network Switching (1)

36.53.1 Network Switching: UGC NET CSE | June 2011 | Part 2 | Question: 30

Which of the following switching techniques is most suitable for interactive traffic ?
A. Circuit switching B. Message switching
C. Packet switching D. All of the above
ugcnetcse-june2011-paper2 computer-networks network-switching

Answer key ☟

36.54 Neural Network (6)

36.54.1 Neural Network: UGC NET CSE | June 2013 | Part 3 | Question: 73

A fuzzy set A on R is ______ iff for all and all

where minimum denotes the minimum operator.

A. Support
B. - cut
C. Convex
D. Concave

ugcnetcse-june2013-paper3 neural-network fuzzy-set

Answer key ☟

36.54.2 Neural Network: UGC NET CSE | June 2013 | Part 3 | Question: 74

If A and B are two fuzzy sets with membership functions

Then the value of will be

A. B.
C. D.
ugcnetcse-june2013-paper3 neural-network fuzzy-set

Answer key ☟

36.54.3 Neural Network: UGC NET CSE | Junet 2015 | Part 3 | Question: 70

Consider the two class classification task that consists of the following points:
Class : [1 1.5] [1 -1.5]
 Class : [-2 2.5] [-2 -2.5]
The decision boundary between the two classes using single perceptron is given by:

A. B. C. D.
ugcnetcse-june2015-paper3 fuzzy-set neural-network

Answer key ☟

36.54.4 Neural Network: UGC NET CSE | Junet 2015 | Part 3 | Question: 71

Let A and B be two fuzzy integers defined as:

A={(1.0.3), (2, 0.6), (3, 1), (4, 0.7), (5, 0.2)}
B={(10, 0.5), (11, 1), (12, 0.5)}
Using fuzzy arithmetic operation given by

is _____ . [Note: ]

A. {(11, 0.8), (13, 1), (15, 1)}

B. {(11, 0.3), (12, 0.5), (13, 1), (14, 1), (15, 1), (16, 0.5), (17, 0.2)}
C. {(11, 0.3), (12, 0.5), (13, 0.6), (14, 1), (15, 1), (16, 0.5), (17, 0.2)}
D. {(11, 0.3), (12, 0.5), (13, 0.6), (14, 1), (15, 0.7), (16, 0.5), (17, 0.2)}

ugcnetcse-june2015-paper3 fuzzy-set neural-network

Answer key ☟

36.54.5 Neural Network: UGC NET CSE | Junet 2015 | Part 3 | Question: 72

Suppose the function y and a fuzzy integer number around - 4 for x are given as . Around - 4 =
{(2, 0.3), (3, 0.6), (4, 1), (5, 0.6), (6, 0.3)} respectively. Then f(Around-4) is given by
A. {(2, 0.6), (3, 0.3), (6, 1), (11, 0.3)} B. {(2, 0.6), (3, 1), (6, 1), (11, 0.3)}
C. {(2, 0.6), (3, 1), (6, 0.6), (11, 0.3)} D. {(2, 0.6), (3, 0.3), (6, 0.6), (11, 0.3)}
ugcnetcse-june2015-paper3 fuzzy-set neural-network

Answer key ☟

36.54.6 Neural Network: UGC NET CSE | September 2013 | Part 3 | Question: 27

Support of a fuzzy set within a universal set X is given as

A.
B.
C.
D.

ugcnetcse-sep2013-paper3 neural-network fuzzy-set

Answer key ☟

36.55 Non Gatecse (9)

36.55.1 Non Gatecse: UGC NET CSE | January 2017 | Part 2 | Question: 1

Consider a sequence defined as :

 Then what shall be the set of values of the sequence ?

A. B.
C. D.
ugcnetjan2017ii non-gatecse

Answer key ☟

36.55.2 Non Gatecse: UGC NET CSE | January 2017 | Part 3 | Question: 13

Which of the following statement(s) is/are correct?

A. Persistence is the term used to describe the duration of phosphorescence.

B. The control electrode is used to turn the electron beam on and off.
C. The electron gun creates a source of electrons which are focused into a narrow beam directed at the face of CRT.
D. All of the above

ugcnetcse-jan2017-paper3 non-gatecse

Answer key ☟

36.55.3 Non Gatecse: UGC NET CSE | January 2017 | Part 3 | Question: 14

A segment is any object described by GKS commands and data that start with CREATE SEGMENT and
Terminates with CLOSE SEGMENT command. What functions can be performed on these segments?
A. Translation and Rotation B. Panning and Zooming
C. Scaling and Shearing D. Translation, Rotation, Panning and Zooming
ugcnetcse-jan2017-paper3 non-gatecse

Answer key ☟

36.55.4 Non Gatecse: UGC NET CSE | January 2017 | Part 3 | Question: 15

Match the following :

A. B.
C. D.
ugcnetcse-jan2017-paper3 non-gatecse

Answer key ☟

36.55.5 Non Gatecse: UGC NET CSE | January 2017 | Part 3 | Question: 57

In Artificial Intelligence(AI), what is present in the planning graph?

A. Sequence of levels B. Literals
C. Variables D. Heuristic estimates
ugcnetcse-jan2017-paper3 non-gatecse

Answer key ☟
36.55.6 Non Gatecse: UGC NET CSE | January 2017 | Part 3 | Question: 58

What is the best method to go for the game playing problem?

A. Optimal Search B. Random Search
C. Heuristic Search D. Stratified Search
ugcnetcse-jan2017-paper3 non-gatecse

Answer key ☟

36.55.7 Non Gatecse: UGC NET CSE | January 2017 | Part 3 | Question: 73

Which of the following neural networks uses supervised learning?

A. Multilayer perception
B. Self organizing feature map
C. Hopfield network

A. (A) only
B. (B) only
C. (A) and (B) only
D. (A) and (C) only

ugcnetcse-jan2017-paper3 non-gatecse

Answer key ☟

36.55.8 Non Gatecse: UGC NET CSE | January 2017 | Part 3 | Question: 74

Unix command to change the case of first three lines of file “shortlist” from lower to upper

A. $ tr '[a-z]' '[A-Z]' shortlist ¦ head – 3

B. $ head – 3 shortlist ¦ tr ‘[a-z]’ ‘[A-Z]’

C. $ tr head – 3 shortlist ‘[A-Z]’ ‘[a-z]’

D. $tr shortlist head – 3 ‘[a-z]’ ‘[A-Z]’

ugcnetcse-jan2017-paper3 non-gatecse

Answer key ☟

36.55.9 Non Gatecse: UGC NET CSE | January 2017 | Part 3 | Question: 75

Match the following ⅵ commands in Unix :

A. B.
C. D.
ugcnetcse-jan2017-paper3 non-gatecse

Answer key ☟
36.56 Number System (1)

36.56.1 Number System: UGC NET CSE | December 2005 | Part 2 | Question: 12

The bitwise of with in will be :

A. B. C. D.
ugcnetcse-dec2005-paper2 digital-logic number-system

Answer key ☟

36.57 Oops Concept (1)

36.57.1 Oops Concept: UGC NET CSE | August 2016 | Part 2 | Question: 14

In C++, polymorphism requires :

A. Inheritance only B. Virtual functions only
C. References only D. Inheritance, Virtual functions and references
ugcnetcse-aug2016-paper2 c++ oops-concept

Answer key ☟

36.58 Operator Overloading (1)

36.58.1 Operator Overloading: UGC NET CSE | June 2011 | Part 2 | Question: 13

The goal of operator overloading is

A. To help the user of a class B. To help the developer of a class
C. To help define friend function D. None of the above
ugcnetcse-june2011-paper2 object-oriented-programming operator-overloading

Answer key ☟

36.59 Parsing (1)

36.59.1 Parsing: UGC NET CSE | June 2008 | Part 2 | Question: 33

At the end of parsing,

A. tokens are identified. B. set of instructions are identified.
C. the syntactic groups are identified. D. machine instructions are identified.

ugcnetcse-june2008-paper2 parsing

Answer key ☟

36.60 Pipelining (1)

36.60.1 Pipelining: UGC NET CSE | December 2019 | Part 2 | Question: 9

A non-pipelined system takes to process a task. The same task can be processed in a four-segment pipeline
with a clock cycle of . Determine the speed up of the pipeline for tasks.

A. B. C. D.
ugcnetcse-dec2019-paper2 co-and-architecture pipelining

Answer key ☟

36.61 Process Scheduling (2)

 36.61.1 Process Scheduling: UGC NET CSE | June 2011 | Part 2 | Question: 38

A relationship between processes such that each has some part (critical section) which must not be executed
while the critical section of another is being executed, is known as
A. Semaphore B. Mutual exclusion
C. Multiprogramming D. Message passing
ugcnetcse-june2011-paper2 operating-system process-scheduling

Answer key ☟

36.61.2 Process Scheduling: UGC NET CSE | June 2011 | Part 2 | Question: 39

How many states can a process be in ?

A. B. C. D.
ugcnetcse-june2011-paper2 operating-system process-scheduling

Answer key ☟

36.62 Prolog (1)

36.62.1 Prolog: UGC NET CSE | August 2016 | Part 3 | Question: 75

Which formal system provides the semantic foundation for Prolog ?

A. Predicate calculus B. Lambda calculus
C. Hoare logic D. Propositional logic
ugcnetcse-aug2016-paper3 artificial-intelligence prolog

Answer key ☟

36.63 Quadratic Equations (1)

36.63.1 Quadratic Equations: UGC NET CSE | June 2013 | Part 3 | Question: 11

The golden ratio and its conjugate both satisfy the equation

A. B. C. D.
ugcnetcse-june2013-paper3 quadratic-equations

Answer key ☟

36.64 Queue (1)

36.64.1 Queue: UGC NET CSE | June 2011 | Part 2 | Question: 25

When the priority queue is represented by max heap, the insertion and deletion of an element can be performed
in (queue containing elements)
A. and respectively B. and respectively
C. and respectively D. None of the above
ugcnetcse-june2011-paper2 data-structures queue binary-heap

Answer key ☟

36.65 Rdbms (2)

36.65.1 Rdbms: UGC NET CSE | August 2016 | Part 2 | Question: 16

DBMS provides the facility of accessing data from a database through

A. DDL B. DML C. DBA D. Schema

ugcnetcse-aug2016-paper2 databases rdbms
 Answer key ☟

36.65.2 Rdbms: UGC NET CSE | August 2016 | Part 2 | Question: 18

Consider the following statements regarding relational database model :

(a) NULL values can be used to opt a tuple out of enforcement of a foreign key.
(b) Suppose that table T has only one candidate key. If Q is in NF, then it is also in BCNF.
(c) The difference between the project operator in relational algebra and the SELECT keyword in SQL is that if the
resulting table/set has more than one occurrences of the same tuple, then will return only one of them, while SQL
SELECT will return all. One can determine that :
A. (a) and (b) are true. B. (a) and (c) are true.
C. (b) and (c) are true. D. (a), (b) and (c) are true.
ugcnetcse-aug2016-paper2 databases rdbms

Answer key ☟

36.66 Relations (1)

36.66.1 Relations: UGC NET CSE | January 2017 | Part 3 | Question: 71

Let and be two fuzzy relations defined as:

Then, the resulting relation, , which relates elements of universe to the elements of universe using max-min
composition is given by:

A.

B.

C.

D.

ugcnetcse-jan2017-paper3 engineering-mathematics relations

Answer key ☟

36.67 Semantic Nets (1)

 36.67.1 Semantic Nets: UGC NET CSE | August 2016 | Part 3 | Question: 72

In Artificial Intelligence , a semantic network

A. Is a graph-based method of knowledge representation where nodes represent concepts and arcs represent relations
between concepts.
B. Is a graph-based method of knowledge representation where nodes represent relations between concepts and arcs
represent concepts.
C. Represents an entity as a set of slots and associated rules.
D. Is a subset of first-order logic.

ugcnetcse-aug2016-paper3 artificial-intelligence semantic-nets

Answer key ☟

36.68 Shell (1)

36.68.1 Shell: UGC NET CSE | September 2013 | Part 3 | Question: 4

Which of the following is not a part of an expert system shell?

A. Knowledge base B. Interference engine
C. Explanation facility D. None of the above
ugcnetcse-sep2013-paper3 unix linux shell

Answer key ☟

36.69 Single Layer Perceptron (1)

36.69.1 Single Layer Perceptron: UGC NET CSE | June 2013 | Part 3 | Question: 75

Consider a single perception with weights as given in the following figure:

and is defined as

The above perception can solve

A. OR problem B. AND problem C. XOR problem D. All of the above

ugcnetcse-june2013-paper3 neural-network single-layer-perceptron

Answer key ☟

36.70 Software Development Life Cycle Models (1)

36.70.1 Software Development Life Cycle Models: UGC NET CSE | June 2011 | Part 2 | Question: 42

What is the first stage in program development ?

A. Specification and design B. System Analysis
C. Testing D. None of the above
ugcnetcse-june2011-paper2 is&software-engineering software-development-life-cycle-models

Answer key ☟

36.71 Software Engineering Framework (1)

 36.71.1 Software Engineering Framework: UGC NET CSE | June 2011 | Part 2 | Question: 44

Which of these are the 5 generic software engineering framework activities ?

A. Communication, planning, modelling, construction, deployment

B. Communication, risk management, measurement, production, reviewing
C. Analysis, designing, programming, Debugging, maintenance
D. Analysis, planning, designing, programming, testing

ugcnetcse-june2011-paper2 is&software-engineering software-engineering-framework

Answer key ☟

36.72 Software Testing (1)

36.72.1 Software Testing: UGC NET CSE | Junet 2015 | Part 3 | Question: 43
Verification:
A. refers to the set of activities that ensure that software correctly implements a specific function
B. Gives answer to the question - Are we building the right product
C. requires execution of software
D. both A and B

software-testing non-gatecse ugcnetcse-june2015-paper3

Answer key ☟

36.73 System Software Compilers (1)

36.73.1 System Software Compilers: UGC NET CSE | August 2016 | Part 3 | Question: 45

Match each software term in List-I to its description in List-II :

A. B.
C. D.
ugcnetcse-aug2016-paper3 system-software-compilers macros

Answer key ☟

36.74 Transaction and Concurrency (3)

36.74.1 Transaction and Concurrency: UGC NET CSE | June 2011 | Part 2 | Question: 16

Which of the following is the recovery management technique in DDBMS ?

A. 2PC (Two Phase Commit) B. Backup
C. Immediate update D. All of the above
ugcnetcse-june2011-paper2 databases transaction-and-concurrency

Answer key ☟
 36.74.2 Transaction and Concurrency: UGC NET CSE | June 2011 | Part 2 | Question: 18

The basic variants of time-stampbased method of concurrency control are

A. Total time stamp-ordering B. Partial time stamp ordering
C. Multiversion Time stamp ordering D. All of the above
ugcnetcse-june2011-paper2 databases transaction-and-concurrency

Answer key ☟

36.74.3 Transaction and Concurrency: UGC NET CSE | June 2011 | Part 2 | Question: 19

A transaction can include following basic database access operations :

A. Read_item(X) B. Write_item(X) C. Both (A) and (B) D. None of these

ugcnetcse-june2011-paper2 databases transaction-and-concurrency

Answer key ☟

36.75 Transportation Problem (3)

36.75.1 Transportation Problem: UGC NET CSE | August 2016 | Part 3 | Question: 63

Consider the following statements :

(a) Assignment problem can be used to minimize the cost.
(b) Assignment problem is a special case of transportation problem.
(c) Assignment problem requires that only one activity be assigned to each resource.
Which of the following options is correct ?

A. (a) and (b) only B. (a) and (c) only C. (b) and (c) only D. (a), (b) and (c)
ugcnetcse-aug2016-paper3 linear-programming transportation-problem

Answer key ☟

36.75.2 Transportation Problem: UGC NET CSE | June 2013 | Part 3 | Question: 24

A basic feasible solution to a m-origin, n-destination transportation problem is said to be ______ if the number
of positive allocations are less than m+n-1.

A. degenerate B. non- degenerate C. unbounded D. unbalanced

ugcnetcse-june2013-paper3 linear-programming transportation-problem

Answer key ☟

36.75.3 Transportation Problem: UGC NET CSE | June 2013 | Part 3 | Question: 25

The total transportation cost in an initial basic feasible solution to the following transportation problem using
Vogel’s Approximation method is

A. B. C. D.
ugcnetcse-june2013-paper3 linear-programming transportation-problem

Answer key ☟

36.76 Tree (2)

 36.76.1 Tree: UGC NET CSE | June 2008 | Part 2 | Question: 1

Which of the following does not define a tree?

A. A tree is a connected acyclic graph.

B. A tree is a connected graph with edges where ' ' is the number of vertices in the graph.
C. A tree is an acyclic graph with edges where ' ' is the number of vertices in the graph.
D. A tree is a graph with no cycles.

ugcnetcse-june2008-paper2 directed-acyclic-graph tree

Answer key ☟

36.76.2 Tree: UGC NET CSE | June 2011 | Part 2 | Question: 21

The number of different trees with nodes is

A. 256 B. 255 C. 248 D. None of these

ugcnetcse-june2011-paper2 algorithms tree

Answer key ☟

36.77 Unix (4)

36.77.1 Unix: UGC NET CSE | August 2016 | Part 3 | Question: 67

Consider the following operations to be performed in Unix : "The pipe sorts all files in the current directory
modified in the month of "June" by order of size and prints them to the terminal screen. The sort option skips
ten fields then sorts the lines in numeric order." Which of the following Unix command will perform above set of
operations ?

A. ls - | grep "June" | sort + n

B. ls - | grep "June" | sort + r
C. ls - | grep - "June" | sort + n
D. ls - | grep - "June" | sort + x

ugcnetcse-aug2016-paper3 unix

Answer key ☟

36.77.2 Unix: UGC NET CSE | August 2016 | Part 3 | Question: 69

Which of the following statement(s) is/are True regarding ‘nice’ command of UNIX ?
I. It is used to set or change the priority of a process.
II. A process’s nice value can be set at the time of creation.
III. ‘nice’ takes a command line as an argument.

A. only B. only C. D. only

ugcnetcse-aug2016-paper3 unix

Answer key ☟

36.77.3 Unix: UGC NET CSE | December 2010 | Part 2 | Question: 37

Which of the following command the file names in multiple columns ?

A. B. C. D.
ugcnetcse-dec2010-paper2 unix
 36.77.4 Unix: UGC NET CSE | September 2013 | Part 2 | Question: 48

Which of the following set of Unix commands will always display “WELCOME”?

A. export title =WELCOME; Echo title

B. title =WELCOME; export title ; sh –c “echo title”
C. title =WELCOME; export title ; sh –c “echo title”
D. title =WELCOME; echo title

ugcnetsep2013ii unix

Answer key ☟

36.78 Virtual Memory (1)

36.78.1 Virtual Memory: UGC NET CSE | June 2011 | Part 2 | Question: 47

Virtual memory is
A. Related to virtual reality B. A form of ROM
C. A form of RAM D. None of the above
ugcnetcse-june2011-paper2 co-and-architecture virtual-memory

Answer key ☟

36.79 Windows (5)

36.79.1 Windows: UGC NET CSE | December 2008 | Part 2 | Question: 50

(I) Each object in the active directory of windows 2000 has an access control list.
(II) The scheme is a blueprint of all objects in the domain of windows 2000.
Which of the following is true?

A. only (I)
B. only (II)
C. both (I) and (II)
D. None of the above

ugcnetcse-dec2008-paper2 windows

Answer key ☟

36.79.2 Windows: UGC NET CSE | June 2007 | Part 2 | Question: 37

Windows is a _______ operating system:

A. Non-preemptive B. Preemptive C. Multi-user D. Real time

ugcnetcse-june2007-paper2 operating-system windows

Answer key ☟

36.79.3 Windows: UGC NET CSE | June 2014 | Part 3 | Question: 38

A part of Windows operating system that is not portable is

A. Device Management B. Virtual Memory Management
C. Processor Management D. User Interface
ugcnetjune2014iii windows

Answer key ☟
 36.79.4 Windows: UGC NET CSE | June 2014 | Part 3 | Question: 47

All the classes necessary for windows programming are available in the module :

A. win.txt B. win.main C. win.std D. MFC

ugcnetjune2014iii windows

Answer key ☟

36.79.5 Windows: UGC NET CSE | June 2014 | Part 3 | Question: 48

Windows API supports

A. -bit Windows B. -bit Windows
C. -bit Windows D. All of the above
ugcnetjune2014iii windows

Answer key ☟

36.80 Windows Programming (2)

36.80.1 Windows Programming: UGC NET CSE | June 2009 | Part 2 | Question: 50

We cannot delete the __________ icon but we can made it invisible.

A. Recycle
B. My Computer
C. Internet explorer
D. None of the above

ugcnetcse-june2009-paper2 windows-programming

36.80.2 Windows Programming: UGC NET CSE | Junet 2015 | Part 3 | Question: 74

WOW32 is a

A. Win 32 API library for creating processes and threads

B. Special kind of file system to the NT name space
C. Kernel-mode objects accessible through Win 32 API
D. Special execution environment used to run 16 bit Windows applications on 32-bit machines

ugcnetcse-june2015-paper3 windows-programming

Answer key ☟

Answer Keys
36.0.1 D 36.0.2 D 36.0.3 B 36.0.4 A 36.0.5 C
36.0.6 A 36.0.7 D 36.0.8 D 36.0.9 D 36.0.10 D
36.0.11 C 36.0.12 B 36.0.13 B 36.0.14 B 36.0.15 A
36.0.16 B 36.0.17 D 36.0.18 A 36.0.19 D 36.0.20 B
36.0.21 B 36.0.22 D 36.0.23 D 36.0.24 C 36.0.25 B
36.0.26 D 36.0.27 B 36.0.28 A 36.0.29 C 36.0.30 C
36.0.31 C 36.0.32 Q-Q 36.0.33 C 36.0.34 A 36.0.35 C
36.0.36 B 36.0.37 D 36.0.38 Q-Q 36.0.39 Q-Q 36.0.40 Q-Q
36.0.41 Q-Q 36.0.42 Q-Q 36.0.43 Q-Q 36.0.44 Q-Q 36.0.45 Q-Q
36.0.46 D 36.0.47 Q-Q 36.0.48 Q-Q 36.0.49 Q-Q 36.0.50 Q-Q

36.0.51 Q-Q 36.0.52 Q-Q 36.0.53 C 36.0.54 Q-Q 36.0.55 Q-Q

36.0.56 B 36.0.57 C 36.0.58 C 36.0.59 A 36.0.60 C
36.0.61 A 36.0.62 D 36.0.63 A 36.0.64 Q-Q 36.0.65 Q-Q
36.0.66 Q-Q 36.0.67 Q-Q 36.0.68 Q-Q 36.0.69 Q-Q 36.0.70 Q-Q
36.0.71 Q-Q 36.0.72 Q-Q 36.0.73 Q-Q 36.0.74 Q-Q 36.0.75 Q-Q
36.0.76 Q-Q 36.0.77 Q-Q 36.0.78 Q-Q 36.0.79 Q-Q 36.0.80 Q-Q
36.0.81 Q-Q 36.0.82 Q-Q 36.0.83 Q-Q 36.0.84 Q-Q 36.0.85 Q-Q
36.0.86 Q-Q 36.0.87 Q-Q 36.0.88 Q-Q 36.0.89 Q-Q 36.0.90 Q-Q
36.0.91 Q-Q 36.0.92 Q-Q 36.0.93 C 36.0.94 Q-Q 36.0.95 Q-Q
36.0.96 Q-Q 36.0.97 Q-Q 36.0.98 Q-Q 36.0.99 Q-Q 36.0.100 Q-Q
36.0.101 Q-Q 36.0.102 D 36.0.103 Q-Q 36.0.104 Q-Q 36.0.105 Q-Q
36.0.106 Q-Q 36.0.107 Q-Q 36.0.108 Q-Q 36.0.109 Q-Q 36.0.110 Q-Q
36.0.111 Q-Q 36.0.112 Q-Q 36.0.113 Q-Q 36.0.114 Q-Q 36.0.115 Q-Q
36.0.116 Q-Q 36.0.117 Q-Q 36.0.118 Q-Q 36.0.119 Q-Q 36.0.120 Q-Q
36.0.121 Q-Q 36.0.122 Q-Q 36.0.123 Q-Q 36.0.124 Q-Q 36.0.125 Q-Q
36.0.126 Q-Q 36.0.127 Q-Q 36.0.128 Q-Q 36.0.129 Q-Q 36.0.130 Q-Q
36.0.131 Q-Q 36.0.132 Q-Q 36.0.133 Q-Q 36.0.134 Q-Q 36.0.135 Q-Q
36.0.136 Q-Q 36.0.137 Q-Q 36.0.138 Q-Q 36.0.139 Q-Q 36.0.140 Q-Q
36.0.141 Q-Q 36.0.142 Q-Q 36.0.143 Q-Q 36.0.144 Q-Q 36.0.145 Q-Q
36.0.146 Q-Q 36.0.147 Q-Q 36.0.148 Q-Q 36.0.149 Q-Q 36.0.150 Q-Q
36.0.151 Q-Q 36.0.152 Q-Q 36.0.153 Q-Q 36.0.154 Q-Q 36.0.155 Q-Q
36.0.156 Q-Q 36.0.157 Q-Q 36.0.158 Q-Q 36.0.159 Q-Q 36.0.160 Q-Q
36.0.161 Q-Q 36.0.162 Q-Q 36.0.163 Q-Q 36.0.164 Q-Q 36.0.165 Q-Q
36.0.166 Q-Q 36.0.167 Q-Q 36.0.168 Q-Q 36.0.169 Q-Q 36.0.170 Q-Q
36.0.171 Q-Q 36.0.172 Q-Q 36.0.173 Q-Q 36.0.174 Q-Q 36.0.175 Q-Q
36.0.176 Q-Q 36.0.177 Q-Q 36.0.178 Q-Q 36.0.179 Q-Q 36.0.180 Q-Q
36.0.181 Q-Q 36.0.182 Q-Q 36.0.183 Q-Q 36.0.184 Q-Q 36.0.185 Q-Q
36.0.186 Q-Q 36.0.187 Q-Q 36.0.188 Q-Q 36.0.189 Q-Q 36.0.190 Q-Q
36.0.191 Q-Q 36.0.192 Q-Q 36.0.193 Q-Q 36.0.194 Q-Q 36.0.195 Q-Q
36.0.196 Q-Q 36.0.197 Q-Q 36.0.198 Q-Q 36.0.199 Q-Q 36.0.200 Q-Q
36.0.201 Q-Q 36.0.202 Q-Q 36.0.203 Q-Q 36.0.204 Q-Q 36.0.205 Q-Q
36.0.206 Q-Q 36.0.207 Q-Q 36.0.208 Q-Q 36.0.209 Q-Q 36.0.210 C
36.0.211 Q-Q 36.0.212 Q-Q 36.0.213 Q-Q 36.0.214 Q-Q 36.0.215 Q-Q
36.0.216 Q-Q 36.0.217 Q-Q 36.0.218 Q-Q 36.0.219 Q-Q 36.0.220 Q-Q
36.0.221 Q-Q 36.0.222 Q-Q 36.0.223 Q-Q 36.0.224 Q-Q 36.0.225 Q-Q
36.0.226 Q-Q 36.0.227 Q-Q 36.0.228 Q-Q 36.0.229 Q-Q 36.0.230 Q-Q
36.0.231 Q-Q 36.0.232 Q-Q 36.0.233 Q-Q 36.0.234 Q-Q 36.0.235 C
36.0.236 Q-Q 36.0.237 Q-Q 36.0.238 Q-Q 36.0.239 Q-Q 36.0.240 Q-Q
36.0.241 Q-Q 36.0.242 Q-Q 36.0.243 Q-Q 36.0.244 Q-Q 36.0.245 Q-Q
36.0.246 Q-Q 36.0.247 Q-Q 36.0.248 Q-Q 36.0.249 Q-Q 36.0.250 Q-Q
36.0.251 Q-Q 36.0.252 Q-Q 36.0.253 Q-Q 36.0.254 Q-Q 36.0.255 Q-Q
36.0.256 Q-Q 36.0.257 Q-Q 36.0.258 Q-Q 36.0.259 Q-Q 36.0.260 Q-Q
36.0.261 Q-Q 36.0.262 Q-Q 36.0.263 Q-Q 36.0.264 Q-Q 36.0.265 Q-Q
36.0.266 Q-Q 36.0.267 Q-Q 36.0.268 B 36.0.269 Q-Q 36.0.270 Q-Q
36.0.271 Q-Q 36.0.272 Q-Q 36.0.273 Q-Q 36.0.274 Q-Q 36.0.275 Q-Q
36.0.276 Q-Q 36.0.277 Q-Q 36.0.278 Q-Q 36.0.279 Q-Q 36.0.280 Q-Q
36.0.281 Q-Q 36.0.282 Q-Q 36.0.283 Q-Q 36.0.284 Q-Q 36.0.285 Q-Q
36.0.286 Q-Q 36.0.287 Q-Q 36.0.288 Q-Q 36.0.289 Q-Q 36.0.290 Q-Q
36.0.291 Q-Q 36.0.292 Q-Q 36.0.293 Q-Q 36.0.294 Q-Q 36.0.295 Q-Q
36.0.296 Q-Q 36.0.297 Q-Q 36.0.298 Q-Q 36.0.299 Q-Q 36.0.300 Q-Q
36.0.301 Q-Q 36.0.302 Q-Q 36.0.303 Q-Q 36.0.304 Q-Q 36.0.305 Q-Q
36.0.306 Q-Q 36.0.307 Q-Q 36.0.308 Q-Q 36.0.309 Q-Q 36.0.310 Q-Q
36.0.311 Q-Q 36.0.312 Q-Q 36.0.313 Q-Q 36.0.314 Q-Q 36.0.315 Q-Q
36.0.316 Q-Q 36.0.317 Q-Q 36.0.318 Q-Q 36.0.319 Q-Q 36.0.320 Q-Q
36.0.321 Q-Q 36.0.322 Q-Q 36.0.323 Q-Q 36.0.324 Q-Q 36.0.325 Q-Q
36.0.326 Q-Q 36.0.327 Q-Q 36.0.328 Q-Q 36.0.329 Q-Q 36.0.330 Q-Q
36.0.331 Q-Q 36.0.332 Q-Q 36.0.333 Q-Q 36.0.334 Q-Q 36.0.335 Q-Q
36.0.336 Q-Q 36.0.337 Q-Q 36.0.338 Q-Q 36.0.339 Q-Q 36.0.340 Q-Q
36.0.341 Q-Q 36.0.342 Q-Q 36.0.343 Q-Q 36.0.344 Q-Q 36.0.345 Q-Q
36.0.346 Q-Q 36.0.347 Q-Q 36.0.348 Q-Q 36.0.349 Q-Q 36.0.350 Q-Q
36.0.351 Q-Q 36.0.352 Q-Q 36.0.353 Q-Q 36.0.354 Q-Q 36.0.355 Q-Q
36.0.356 Q-Q 36.0.357 Q-Q 36.0.358 Q-Q 36.0.359 Q-Q 36.0.360 Q-Q
36.0.361 Q-Q 36.0.362 Q-Q 36.0.363 Q-Q 36.0.364 Q-Q 36.0.365 Q-Q
36.0.366 Q-Q 36.0.367 Q-Q 36.0.368 Q-Q 36.0.369 Q-Q 36.0.370 Q-Q
36.0.371 Q-Q 36.0.372 Q-Q 36.0.373 Q-Q 36.0.374 Q-Q 36.0.375 Q-Q
36.0.376 Q-Q 36.0.377 Q-Q 36.0.378 Q-Q 36.0.379 Q-Q 36.0.380 Q-Q
36.0.381 Q-Q 36.0.382 Q-Q 36.0.383 Q-Q 36.0.384 Q-Q 36.0.385 Q-Q
36.0.386 Q-Q 36.0.387 Q-Q 36.0.388 Q-Q 36.0.389 Q-Q 36.0.390 Q-Q
36.0.391 Q-Q 36.0.392 Q-Q 36.0.393 Q-Q 36.0.394 Q-Q 36.0.395 Q-Q
36.0.396 Q-Q 36.0.397 Q-Q 36.0.398 Q-Q 36.0.399 Q-Q 36.0.400 Q-Q
36.0.401 Q-Q 36.0.402 Q-Q 36.0.403 Q-Q 36.0.404 Q-Q 36.0.405 Q-Q
36.0.406 Q-Q 36.0.407 Q-Q 36.0.408 Q-Q 36.0.409 Q-Q 36.0.410 Q-Q
36.0.411 Q-Q 36.0.412 Q-Q 36.0.413 Q-Q 36.0.414 Q-Q 36.0.415 Q-Q
36.0.416 Q-Q 36.0.417 Q-Q 36.0.418 Q-Q 36.0.419 Q-Q 36.0.420 Q-Q
36.0.421 Q-Q 36.0.422 Q-Q 36.0.423 Q-Q 36.0.424 Q-Q 36.0.425 Q-Q
36.0.426 Q-Q 36.0.427 Q-Q 36.0.428 Q-Q 36.0.429 Q-Q 36.0.430 Q-Q
36.0.431 Q-Q 36.0.432 Q-Q 36.0.433 Q-Q 36.0.434 Q-Q 36.0.435 Q-Q
36.0.436 Q-Q 36.0.437 Q-Q 36.0.438 Q-Q 36.0.439 Q-Q 36.0.440 Q-Q
36.0.441 Q-Q 36.0.442 Q-Q 36.0.443 Q-Q 36.0.444 Q-Q 36.0.445 Q-Q
36.0.446 Q-Q 36.0.447 Q-Q 36.0.448 Q-Q 36.0.449 Q-Q 36.0.450 Q-Q
36.0.451 Q-Q 36.0.452 Q-Q 36.0.453 Q-Q 36.0.454 Q-Q 36.0.455 Q-Q
36.0.456 Q-Q 36.0.457 Q-Q 36.0.458 Q-Q 36.0.459 Q-Q 36.0.460 Q-Q
36.0.461 Q-Q 36.0.462 Q-Q 36.0.463 Q-Q 36.0.464 Q-Q 36.0.465 Q-Q
36.0.466 Q-Q 36.0.467 Q-Q 36.0.468 Q-Q 36.0.469 Q-Q 36.0.470 Q-Q
36.0.471 Q-Q 36.0.472 Q-Q 36.0.473 Q-Q 36.0.474 Q-Q 36.0.475 Q-Q
36.0.476 Q-Q 36.0.477 Q-Q 36.0.478 Q-Q 36.0.479 Q-Q 36.0.480 Q-Q
36.0.481 Q-Q 36.0.482 Q-Q 36.0.483 Q-Q 36.0.484 Q-Q 36.0.485 Q-Q
36.0.486 Q-Q 36.0.487 Q-Q 36.0.488 Q-Q 36.0.489 Q-Q 36.0.490 Q-Q
36.0.491 Q-Q 36.0.492 Q-Q 36.0.493 Q-Q 36.0.494 Q-Q 36.0.495 Q-Q
36.0.496 Q-Q 36.0.497 Q-Q 36.0.498 Q-Q 36.0.499 Q-Q 36.0.500 Q-Q
36.0.501 Q-Q 36.0.502 Q-Q 36.0.503 Q-Q 36.0.504 Q-Q 36.0.505 Q-Q
36.0.506 Q-Q 36.0.507 Q-Q 36.0.508 Q-Q 36.0.509 Q-Q 36.0.510 Q-Q
36.0.511 Q-Q 36.0.512 Q-Q 36.0.513 Q-Q 36.0.514 Q-Q 36.0.515 Q-Q
36.0.516 Q-Q 36.0.517 Q-Q 36.0.518 Q-Q 36.0.519 Q-Q 36.0.520 Q-Q
36.0.521 Q-Q 36.0.522 Q-Q 36.0.523 Q-Q 36.0.524 Q-Q 36.0.525 Q-Q
36.0.526 Q-Q 36.0.527 Q-Q 36.0.528 Q-Q 36.1.1 Q-Q 36.2.1 Q-Q
36.3.1 Q-Q 36.4.1 Q-Q 36.5.1 Q-Q 36.6.1 Q-Q 36.7.1 Q-Q
36.8.1 Q-Q 36.9.1 B 36.10.1 C 36.11.1 B 36.12.1 B
36.13.1 Q-Q 36.14.1 Q-Q 36.15.1 Q-Q 36.15.2 Q-Q 36.15.3 Q-Q
36.15.4 Q-Q 36.16.1 Q-Q 36.16.2 Q-Q 36.17.1 Q-Q 36.18.1 Q-Q
36.19.1 Q-Q 36.19.2 B 36.19.3 D 36.20.1 Q-Q 36.21.1 Q-Q
36.22.1 Q-Q 36.23.1 Q-Q 36.23.2 Q-Q 36.24.1 Q-Q 36.25.1 Q-Q
36.25.2 Q-Q 36.25.3 Q-Q 36.26.1 B 36.26.2 B 36.27.1 Q-Q
36.27.2 Q-Q 36.28.1 Q-Q 36.29.1 Q-Q 36.30.1 Q-Q 36.30.2 A
36.31.1 Q-Q 36.32.1 D 36.32.2 C 36.33.1 A 36.33.2 A;D
36.33.3 A 36.33.4 C 36.33.5 B 36.33.6 D 36.33.7 B
36.33.8 B 36.33.9 C 36.33.10 A 36.33.11 A 36.33.12 D
36.33.13 A 36.33.14 D 36.33.15 C 36.33.16 A 36.33.17 A
36.33.18 D 36.33.19 C 36.33.20 C 36.33.21 D 36.33.22 A
36.33.23 D 36.33.24 C 36.33.25 C 36.33.26 A 36.33.27 C
36.33.28 A 36.33.29 C 36.33.30 A 36.33.31 B 36.33.32 D
36.33.33 D 36.34.1 Q-Q 36.34.2 Q-Q 36.35.1 Q-Q 36.36.1 D
36.37.1 Q-Q 36.38.1 Q-Q 36.39.1 Q-Q 36.40.1 Q-Q 36.41.1 Q-Q
36.42.1 Q-Q 36.42.2 A 36.42.3 C 36.43.1 Q-Q 36.43.2 Q-Q
36.44.1 Q-Q 36.45.1 Q-Q 36.45.2 2 36.46.1 C 36.47.1 Q-Q
36.48.1 Q-Q 36.49.1 B 36.49.2 D 36.50.1 Q-Q 36.51.1 Q-Q
36.52.1 C 36.53.1 C 36.54.1 C 36.54.2 C 36.54.3 C

36.54.4 D 36.54.5 C 36.54.6 D 36.55.1 A 36.55.2 D

36.55.3 D 36.55.4 A 36.55.5 A 36.55.6 C 36.55.7 A
36.55.8 B 36.55.9 D 36.56.1 Q-Q 36.57.1 Q-Q 36.58.1 Q-Q
36.59.1 Q-Q 36.60.1 Q-Q 36.61.1 Q-Q 36.61.2 Q-Q 36.62.1 Q-Q
36.63.1 C 36.64.1 D 36.65.1 Q-Q 36.65.2 Q-Q 36.66.1 C
36.67.1 Q-Q 36.68.1 A 36.69.1 B 36.70.1 Q-Q 36.71.1 Q-Q
36.72.1 D 36.73.1 Q-Q 36.74.1 Q-Q 36.74.2 Q-Q 36.74.3 Q-Q
36.75.1 Q-Q 36.75.2 A 36.75.3 B 36.76.1 Q-Q 36.76.2 Q-Q
36.77.1 Q-Q 36.77.2 Q-Q 36.77.3 Q-Q 36.77.4 C 36.78.1 Q-Q
36.79.1 Q-Q 36.79.2 Q-Q 36.79.3 B 36.79.4 A 36.79.5 D
36.80.1 Q-Q 36.80.2 D
37 Programming and DS (26)

37.1 Array (2)

37.1.1 Array: UGC NET CSE | December 2014 | Part 2 | Question: 14

When an array is passed as parameter to a function, which of the following statements is correct ?

A. The function can change values in the original array.

B. In , parameters are passed by value, the function cannot change the original value in the array.
C. It results in compilation error when the function tries to access the elements in the array.
D. Results in a run time error when the function tries to access the elements in the array.

ugcnetcse-dec2014-paper2 programming-in-c array

Answer key ☟

37.1.2 Array: UGC NET CSE | June 2013 | Part 3 | Question: 32

Arrays in C language can have ____ with reference to memory representation.

A. n-subscripts B. two-subscripts
C. only one subscript D. three subscripts only
ugcnetcse-june2013-paper3 programming-in-c array

Answer key ☟

37.2 Array of Pointers (1)

37.2.1 Array of Pointers: UGC NET CSE | August 2016 | Part 2 | Question: 12

The following statement :

int * f[]()

declares :

A. A function returning a pointer to an array of integers.

B. Array of functions returning pointers to integers.
C. A function returning an array of pointers to integers.
D. An illegal statement.

ugcnetcse-aug2016-paper2 programming-in-c array-of-pointers pointers

Answer key ☟

37.3 Dangling Pointers (1)

37.3.1 Dangling Pointers: UGC NET CSE | September 2013 | Part 3 | Question: 65

Consider the following sequence of operations:

Pointer p1 is set to point at a new heap-dynamic variable.

Pointer p2 is assigned p1’s value
The heap dynamic variable pointed to by p1 is explicitly de-allocated but p2 is not changed by the operation

This situation leads to which of the following:

A. p1 becomes a dangling pointer B. p2 becomes a dangling pointer
C. Both p1 and p2 are now dangling pointers D. Neither p1 nor p2 is now a dangling pointer
ugcnetcse-sep2013-paper3 programming-in-c dangling-pointers

37.4 Data Types (1)

 37.4.1 Data Types: UGC NET CSE | December 2011 | Part 2 | Question: 33

If an integer needs two bytes of storage, then the maximum value of unsigned integer is

A. B. C. D.
ugcnetcse-dec2011-paper2 programming-in-c data-types

Answer key ☟

37.5 Input Output Statement (1)

37.5.1 Input Output Statement: UGC NET CSE | December 2009 | Part 2 | Question: 12

What would be the output of the following program, if run from the command line as “myprog 1 2 3” ?

main (int argc, char ∗ argv[ ])

{ int i ;

i = argv[1] + argv[2] + argv[3] ;

printf (“% d”, i) ;

(A) 123

(B) 6

(C) Error

(D) “123”
ugcnetcse-dec2009-paper2 programming-in-c input-output-statement

Answer key ☟

37.6 Operator Precedence (2)

37.6.1 Operator Precedence: UGC NET CSE | December 2010 | Part 2 | Question: 12

The value of the following expression is

A. B. C. D.
ugcnetcse-dec2010-paper2 programming-in-c operator-precedence

Answer key ☟

37.6.2 Operator Precedence: UGC NET CSE | December 2011 | Part 2 | Question: 36

means
A. B.
C. D.
ugcnetcse-dec2011-paper2 programming-in-c operator-precedence

Answer key ☟

37.7 Operators (2)

37.7.1 Operators: UGC NET CSE | December 2012 | Part 2 | Question: 45

What is the result of the following expression?

 (1 & 2) + (3 & 4)

A. 1 B. 3 C. 2 D. 0
ugcnetcse-dec2012-paper2 programming-in-c operators

Answer key ☟

37.7.2 Operators: UGC NET CSE | June 2010 | Part 2 | Question: 11

The statement print

f (" % d", 10 ? 0 ? 5 : 1 : 12);
will print

A. B. C. D.
ugcnetcse-june2010-paper2 programming-in-c operators

Answer key ☟

37.8 Parameter Passing (1)

37.8.1 Parameter Passing: UGC NET CSE | December 2012 | Part 3 | Question: 44

The Default Parameter Passing Mechanism is called as

A. Call by Value B. Call by Reference
C. Call by Address D. Call by Name
ugcnetcse-dec2012-paper3 programming-in-c parameter-passing

Answer key ☟

37.9 Pointer Declaration (1)

37.9.1 Pointer Declaration: UGC NET CSE | September 2013 | Part 3 | Question: 51

Consider the following two function declarations:

int *f()
int (*f)()
Which of the following is true?

A. Both are identical

B. The first is a correct declaration and the second is wrong
C. Both are different ways of declaring pointer to a function
D. The first declaration is a function returning a pointer to an integer and the second is a pointer to function returning
integer

ugcnetcse-sep2013-paper3 programming-in-c pointer-declaration

Answer key ☟

37.10 Programming In C (12)

37.10.1 Programming In C: UGC NET CSE | August 2016 | Part 2 | Question: 11

Given
What is the output of given expression?
x * 3 & & 3 || j | k

A. B. C. D.
ugcnetcse-aug2016-paper2 programming-in-c
 Answer key ☟

37.10.2 Programming In C: UGC NET CSE | December 2010 | Part 2 | Question: 11

How many of the following declarations are correct ?

int ;
double void = ;
short array ;
char c = “\n”;
A. None B. One is correct
C. Two are correct D. All four are correct
ugcnetcse-dec2010-paper2 programming-in-c

Answer key ☟

37.10.3 Programming In C: UGC NET CSE | December 2010 | Part 2 | Question: 13

Which one of the following will set the value of to if has the value , but not otherwise ?
A. If B. If
C. If D. If
ugcnetcse-dec2010-paper2 programming-in-c

Answer key ☟

37.10.4 Programming In C: UGC NET CSE | December 2015 | Part 2 | Question: 11

Consider the following program:

#include<stdio.h>
main()
{
int i, inp;
float x, term=1, sum=0;
scanf("%d %f", &inp, &x);
for(i=1;i<=inp;i++)
{
term=term*x/i;
sum=sum+term;
}
printf("Result=%f\n", sum);
}

The program computes the sum of which of the following series?

A. B.
C. D.
ugcnetcse-dec2015-paper2 programming-in-c

Answer key ☟

37.10.5 Programming In C: UGC NET CSE | December 2015 | Part 3 | Question: 43

A horn clause is

A. A clause in which no variables occur in the expression

B. A clause that has at least one negative literal
C. A disjunction of a number of literals
D. A clause that has atmost one positive literal

programming-in-c ugcnetcse-dec2015-paper3

Answer key ☟
37.10.6 Programming In C: UGC NET CSE | June 2007 | Part 2 | Question: 14

What is the output of the following program?

main()
{
printf(“%x”,-1>>4);
}

A. B. C. D.
ugcnetcse-june2007-paper2 programming-in-c

Answer key ☟

37.10.7 Programming In C: UGC NET CSE | June 2013 | Part 3 | Question: 51

Trace the error:

void main()
{
int *b, &a;
*b=20;
printf(“%d, %d”, a, *b)
}

A. No error B. Logical error C. Syntax error D. Semantic error

ugcnetcse-june2013-paper3 programming-in-c

Answer key ☟

37.10.8 Programming In C: UGC NET CSE | October 2020 | Part 2 | Question: 9

Consider the following pseudo-code fragment, where and are integer variables that have been initialized:
/* Pre-conditions : */
/* Assume that overflow never occurs */
int ; int ;
while
;
;

When the while loop terminates, what will be the value of in terms of and ?

A.
B.
C. /* means floor */
D. /* means ceil */

ugcnetcse-oct2020-paper2 programming-in-c

Answer key ☟

37.10.9 Programming In C: UGC NET CSE | September 2013 | Part 2 | Question: 33

What is the size of the following union? Assume that the size of int=2, size of float =4, size of char=1
union tag {
int a;
float b;
char c;
};

A. 2 B. 4 C. 1 D. 7
 ugcnetsep2013ii programming-in-c

Answer key ☟

37.10.10 Programming In C: UGC NET CSE | September 2013 | Part 2 | Question: 34

What is the output of the following program segment?

sum(n)
{
if (n<1) return n;
else return (n+sum(n-1));
}
main()
{
printf(“%d”, sum(5));
}

A. 10 B. 16 C. 15 D. 14
ugcnetsep2013ii programming-in-c

Answer key ☟

37.10.11 Programming In C: UGC NET CSE | September 2013 | Part 2 | Question: 36

Consider the following program segment:

d=0;
for(i=1; i<31, ++i)
for (j=1; j < 31; ++j)
for (k=1; k < 31; ++k)
if((i+j+k%3)==0))
d=d+1;
printf(“%d”, d);

The output will be

A. 9000 B. 3000 C. 90 D. 2700

ugcnetsep2013ii programming-in-c

Answer key ☟

37.10.12 Programming In C: UGC NET CSE | September 2013 | Part 3 | Question: 53

What is the output of the following program?

#include<stdio.h>
main()
{
int a, b =0;
static int c[10]={1, 2, 3, 4, 5, 6, 7, 8, 9, 0};
for (a=0; a<10; ++a)
int ((c[a]%2)==0) b+=c[a];
printf(“%d”, b);
}

A. 15 B. 25 C. 45 D. 20
ugcnetcse-sep2013-paper3 programming-in-c

Answer key ☟

37.11 Storage Classes In C (1)

37.11.1 Storage Classes In C: UGC NET CSE | January 2017 | Part 2 | Question: 13

Which of the following storage classes have global visibility in ?

A. Auto B. Extern C. Static D. Register

ugcnetjan2017ii programming-in-c storage-classes-in-c
 Answer key ☟

37.12 Three Dimensional Array (1)

37.12.1 Three Dimensional Array: UGC NET CSE | December 2015 | Part 2 | Question: 16

A three dimensional array in 'C' is declared as int A[x][y][z]. Here, the address of an item at the location A[p][q]
[r] can be computed as follows: (where w is the word length of an integer)
A. &A[0][0][0]+w(y*z*q+z*p+r) B. &A[0][0][0]+w(y*z*p+z*q+r)
C. &A[0][0][0]+w(x*y*p+z*q+r) D. &A[0][0][0]+w(x*y*q+z*p+r)
ugcnetcse-dec2015-paper2 programming-in-c three-dimensional-array

Answer key ☟

Answer Keys
37.1.1 A 37.1.2 C 37.2.1 Q-Q 37.3.1 B 37.4.1 A
37.5.1 Q-Q 37.6.1 Q-Q 37.6.2 D 37.7.1 D 37.7.2 Q-Q
37.8.1 A 37.9.1 D 37.10.1 Q-Q 37.10.2 Q-Q 37.10.3 Q-Q
37.10.4 B 37.10.5 B 37.10.6 Q-Q 37.10.7 C 37.10.8 X
37.10.9 B 37.10.10 C 37.10.11 C 37.10.12 D 37.11.1 B
37.12.1 B
38 Programming and DS: DS (107)

38.0.1 UGC NET CSE | June 2013 | Part 2 | Question: 28

The time complexity to build a heap with a list of n numbers is

A. O(log n) B. O(n) C. O(n logn) D. O(n )

heap-sort ugcnetcse-june2013-paper2

Answer key ☟

38.0.2 UGC NET CSE | June 2009 | Part 2 | Question: 28

A binary tree is said to have heap property if the elements along any path :

A. from leaf to root are non-increasing

B. from leaf to root are non-decreasing
C. from root to leaf are non-decreasing
D. from root to leaf are non-increasing

ugcnetcse-june2009-paper2

Answer key ☟

38.0.3 UGC NET CSE | June 2009 | Part 2 | Question: 24

In a B tree of order m with p nodes the average number of splits is at most :

A. 1/(⌈m/2⌉−1) B. ⌈m/2⌉−1
C. 1/(m/2) D. None
ugcnetcse-june2009-paper2

Answer key ☟

38.0.4 UGC NET CSE | December 2004 | Part 2 | Question: 24

What operation is supported in constant time by the doubly linked list, but not by the singly linked list ?

A. Advance B. Backup C. First D. Retrieve

ugcnetcse-dec2004-paper2

Answer key ☟

38.0.5 UGC NET CSE | December 2004 | Part 2 | Question: 22

Suppose we are implementing quadratic probing with a Hash function, Hash mode . If an element
with key is inserted and the first three locations attempted are already occupied, then the next cell that will
be tried is :

A. B. C. D.
ugcnetcse-dec2004-paper2

Answer key ☟

38.0.6 UGC NET CSE | December 2004 | Part 2 | Question: 21

What item is at the root after the following sequence of insertions into an empty splay tree :

A. B. C. D.
 ugcnetcse-dec2004-paper2

Answer key ☟

38.0.7 UGC NET CSE | December 2004 | Part 2 | Question: 32

Which of the following is not collision resolution technique?

A. Hash addressing B. Chaining C. Both (A) and (B) D. Indexing

ugcnetcse-dec2004-paper2

Answer key ☟

38.0.8 UGC NET CSE | December 2006 | Part 2 | Question: 25

Which one of the following is a physical data structure ?

A. Array B. Linked lists C. Stacks D. Tables

ugcnetcse-dec2006-paper2

Answer key ☟

38.0.9 UGC NET CSE | December 2006 | Part 2 | Question: 24

The equivalent postfix expression for :

1.
2.
3.
4. None of these

ugcnetcse-dec2006-paper2

Answer key ☟

38.0.10 UGC NET CSE | December 2006 | Part 2 | Question: 11

When a function is recursively called, all automatic variables :

A. are initialized during each execution of the function B. are retained from the last execution
C. are maintained in a stack D. are ignored
ugcnetcse-dec2006-paper2

Answer key ☟

38.0.11 UGC NET CSE | December 2007 | Part 2 | Question: 23

The height of a binary tree with nodes, in the worst case is :

A. B.
C. D.
ugcnetcse-dec2007-paper2

Answer key ☟

38.0.12 UGC NET CSE | December 2007 | Part 2 | Question: 22

Which of the following data structure is used to implement recursion ?

A. Arrays B. Stacks C. Queues D. Linked lists

ugcnetcse-dec2007-paper2

Answer key ☟
 38.0.13 UGC NET CSE | December 2007 | Part 2 | Question: 21

Consider a rooted tree in which every node has at least three children. What is the minimum number of nodes at
level i (i > ) of the tree ? Assume that the root is at level :

A. B. C. D.
ugcnetcse-dec2007-paper2

Answer key ☟

38.0.14 UGC NET CSE | December 2007 | Part 2 | Question: 12

Consider the following linked list :

Which of the following piece of code will insert the node pointed to by at the end of the list ?

A.

B.

C.

D.

ugcnetcse-dec2007-paper2

Answer key ☟

38.1 AVL Tree (2)

38.1.1 AVL Tree: UGC NET CSE | December 2012 | Part 2 | Question: 2

The worst case time complexity of AVL is tree is better in comparison to binary search tree for
A. Search and Insert Operations B. Search and Delete Operations
C. Insert and Delete Operations D. Search, Insert and Delete Operations
data-structures binary-tree ugcnetcse-dec2012-paper2 avl-tree

Answer key ☟

38.1.2 AVL Tree: UGC NET CSE | June 2005 | Part 2 | Question: 23

In the balanced binary tree given below, how many nodes will become unbalanced when a node is inserted as a
child of the node “ ” ?
 A. B. C. D.
ugcnetcse-june2005-paper2 data-structures avl-tree

Answer key ☟

38.2 B Tree (1)

38.2.1 B Tree: UGC NET CSE | December 2012 | Part 2 | Question: 34

The maximum number of keys stored in a B-tree of order and depth is

A. B.
C. D.
ugcnetcse-dec2012-paper2 b-tree databases

Answer key ☟

38.3 B and Bplus Trees (1)

38.3.1 B and Bplus Trees: UGC NET CSE | June 2010 | Part 2 | Question: 25

In a tree of order , the following keys are inserted as follows : and How many elements
are present in the root of the tree ?

A. B. C. D.
ugcnetcse-june2010-paper2 data-structures b-and-bplus-trees

Answer key ☟

38.4 Binary Heap (7)

38.4.1 Binary Heap: UGC NET CSE | December 2008 | Part 2 | Question: 33

In a heap, every element is ___________ of all the elements in the subtree.

A. maximum
B. minimum
C. sum
D. product

ugcnetcse-dec2008-paper2 data-structures binary-heap

Answer key ☟
38.4.2 Binary Heap: UGC NET CSE | January 2017 | Part 2 | Question: 23

Which of the following is a valid heap?

a. b. c. d.

A. B. C. D.
ugcnetjan2017ii data-structures binary-heap

Answer key ☟

38.4.3 Binary Heap: UGC NET CSE | July 2018 | Part 2 | Question: 22

Consider the array A=<4, 1, 3, 2, 16, 9, 10, 14, 8, 7>. After building heap from the array A, the depth of the
heap and the right child of max-heap are ______ and _____ respectively (Root is at level 0).

A. 3, 14 B. 3, 10 C. 4, 14 D. 4, 10
ugcnetcse-july2018-paper2 data-structures binary-heap

Answer key ☟

38.4.4 Binary Heap: UGC NET CSE | June 2013 | Part 3 | Question: 13

In any n-element heap, the number of nodes of height h is,

A. less than equal to B. greater than

C. greater than D. less than equal to

ugcnetcse-june2013-paper3 data-structures binary-heap

Answer key ☟

38.4.5 Binary Heap: UGC NET CSE | Junet 2015 | Part 3 | Question: 36

The number of nodes in height h in any n-element heap is

A. B.
C. ceil D. ceil
ugcnetcse-june2015-paper3 data-structures binary-heap

Answer key ☟

38.4.6 Binary Heap: UGC NET CSE | November 2017 | Part 3 | Question: 20

Heap allocation is required for languages that

A. Use dynamic scope rules B. Support dynamic data structures
C. Support recursion D. Support recursion and dynamic data structures
ugcnetcse-nov2017-paper3 data-structures binary-heap

Answer key ☟

38.4.7 Binary Heap: UGC NET CSE | October 2020 | Part 2 | Question: 24

In a binary max heap containing numbers, the smallest element can be found in ______

A. B. C. D.
 ugcnetcse-oct2020-paper2 data-structures binary-heap

Answer key ☟

38.5 Binary Search Tree (6)

38.5.1 Binary Search Tree: UGC NET CSE | August 2016 | Part 2 | Question: 23

The runtime for traversing all the nodes of a binary search tree with nodes and printing them in an order is

A. B. C. D.
ugcnetcse-aug2016-paper2 data-structures binary-search-tree

Answer key ☟

38.5.2 Binary Search Tree: UGC NET CSE | December 2005 | Part 2 | Question: 25

Which traversal techniques lists the nodes of a binary search tree in ascending order?

A. post – order B. in – order

C. pre – order D. linear – order
ugcnetcse-dec2005-paper2 data-structures binary-search-tree

Answer key ☟

38.5.3 Binary Search Tree: UGC NET CSE | July 2016 | Part 2 | Question: 21

Consider the following binary search tree:

If we remove the root node which of the node from the left subtree will be the new root?

A. 11 B. 12 C. 13 D. 16
data-structures binary-tree binary-search-tree ugcnetcse-july2016-paper2

Answer key ☟

38.5.4 Binary Search Tree: UGC NET CSE | July 2016 | Part 3 | Question: 35

Suppose that we have numbers between 1 and 1,000 in a binary search tree and want to search for the number
364. Which of the following sequences could not be the sequence of nodes examined?
A. 925, 221, 912, 245, 899, 259, 363, 364 B. 3, 400, 388, 220, 267, 383, 382, 279, 364
C. 926, 203, 912, 241, 913, 246, 364 D. 3, 253, 402, 399, 331, 345, 398, 364
ugcnetcse-july2016-paper3 data-structures binary-search-tree

Answer key ☟

38.5.5 Binary Search Tree: UGC NET CSE | July 2018 | Part 2 | Question: 26

A binary search tree in which every non-leaf node has non-empty left and right subtrees is called a strictly binary
tree. Such a tree with 19 leaves:
A. cannot have more than 37 nodes B. has exactly 37 nodes
C. has exactly 35 nodes D. cannot have more than 35 nodes
ugcnetcse-july2018-paper2 data-structures binary-search-tree
 Answer key ☟

38.5.6 Binary Search Tree: UGC NET CSE | September 2013 | Part 3 | Question: 41

Given a binary search trees for a set of keys with the following probabilities

The expected optimal cost of the search is

A. B. C. D.
ugcnetcse-sep2013-paper3 data-structures binary-search-tree

Answer key ☟

38.6 Binary Tree (7)

38.6.1 Binary Tree: UGC NET CSE | December 2009 | Part 2 | Question: 21

If the number of leaves in a strictly binary tree is an odd number, then what can you say with full conviction
about total number of nodes in the tree ?
(A) It is an odd number.
(B) It is an even number.
(C) It cannot be equal to the number of leaves.
(D) It is always greater than twice the number of leaves.
ugcnetcse-dec2009-paper2 data-structures binary-tree

Answer key ☟

38.6.2 Binary Tree: UGC NET CSE | June 2009 | Part 2 | Question: 27

In a full binary tree of height k, there are ______ internal nodes .

A. 2k-1
B. 2k-1
C. 2k
D. 2k+1

ugcnetcse-june2009-paper2 data-structures binary-tree

Answer key ☟

38.6.3 Binary Tree: UGC NET CSE | June 2012 | Part 2 | Question: 27

The Inorder traversal of the tree will yield a sorted listing of elements of tree in
A. Binary tree B. Binary search tree
C. Heaps D. None of the above
data-structures binary-tree ugcnetcse-june2012-paper2

Answer key ☟

38.6.4 Binary Tree: UGC NET CSE | June 2012 | Part 2 | Question: 8

A binary search tree is a binary tree in which

A. All items in the left subtree are less than root

B. All items in the right subtree are greater than or equal to root
C. Each subtree is itself a binary search tree
D. All of the above
 ugcnetcse-june2012-paper2 data-structures binary-tree

Answer key ☟

38.6.5 Binary Tree: UGC NET CSE | October 2020 | Part 2 | Question: 23

A complete -ary tree is a tree in which each node has children or no children. Let be the number of internal
nodes and be the number of leaves in a complete -ary tree. If , and , what is the value of ?

A. B. C. D.
ugcnetcse-oct2020-paper2 data-structures binary-tree

Answer key ☟

38.6.6 Binary Tree: UGC NET CSE | September 2013 | Part 2 | Question: 11

The min. number of nodes in a binary tree of depth d (root at level 0) is

A. B. C. D.
binary-tree data-structures ugcnetsep2013ii

Answer key ☟

38.6.7 Binary Tree: UGC NET CSE | September 2013 | Part 2 | Question: 21

Consider the In-order and Post-order traversals of a tree as given below:

In-order: j e n k o p b f a c l g m d h i
Post-order: j n o p k e f b c l m g h I d a
The Pre-order traversal of the tree shall be
A. a b f e j k n o p c d g l m h i B. a b c d e f j k n o p g l m h i
C. a b e j k n o p f c d g l m h i D. j e n o p k f b c l m g h I d a
ugcnetsep2013ii data-structures binary-tree

Answer key ☟

38.7 Cryptography (1)

38.7.1 Cryptography: UGC NET CSE | January 2017 | Part 2 | Question: 24

If is chosen from a universal collection of hash functions and is used to hash keys into a table of size ,
where , the expected number of collisions involving a particular key is less than __________.

A. B. C. D.
ugcnetjan2017ii cryptography hashing data-structures

Answer key ☟

38.8 Data Structures (7)

38.8.1 Data Structures: UGC NET CSE | December 2011 | Part 2 | Question: 1

Which of the following data structure is Non-linear type ?

A. Strings B. Lists C. Stacks D. None of the above

ugcnetcse-dec2011-paper2 data-structures

Answer key ☟

38.8.2 Data Structures: UGC NET CSE | July 2016 | Part 2 | Question: 2

The number of different spanning trees in complete graph, and bipartite graph, have ____ and ___
respectively.
 A. 14, 14 B. 16, 14 C. 16, 4 D. 14, 4
ugcnetcse-july2016-paper2 data-structures graph-theory

Answer key ☟

38.8.3 Data Structures: UGC NET CSE | July 2016 | Part 2 | Question: 5

A clique in a simple undirected graph is a complete subgraph that is not contained in any larger complete
subgraph. How many cliques are there in a graph shown below?

A. 2 B. 4 C. 5 D. 6
ugcnetcse-july2016-paper2 data-structures graph-theory

Answer key ☟

38.8.4 Data Structures: UGC NET CSE | June 2012 | Part 2 | Question: 49

Which of the following data structure is linear type?

A. Strings B. Lists C. Queues D. All of the above

data-structures ugcnetcse-june2012-paper2 easy

Answer key ☟

38.8.5 Data Structures: UGC NET CSE | June 2013 | Part 3 | Question: 49

Suppose you want to delete the name that occurs before ‘Vivek’ in an alphabetical listing. Which one of the
following data structures shall be most efficient for this operation?
A. Circular linked list B. Doubly linked list
C. Linked list D. Dequeue
ugcnetcse-june2013-paper3 data-structures

Answer key ☟

38.8.6 Data Structures: UGC NET CSE | October 2020 | Part 2 | Question: 63

Which of the following statements are true?

i. Minimax search is breadth-first; it processes all the nodes at a level before moving to a node in next level.
ii. The effectiveness of the alpha-beta pruning is highly dependent on the order in which the states are examined
iii. The alpha-beta search algorithms computes the same optimal moves as minimax algorithm
iv. Optimal play in games of imperfect information does not require reasoning about the current and future belief states
of each player

Choose the correct answer from the options given below:

A. and only B. and only
C. and only D. and only
ugcnetcse-oct2020-paper2 data-structures breadth-first-search

Answer key ☟
 38.8.7 Data Structures: UGC NET CSE | September 2013 | Part 3 | Question: 15

Which of the following is the minimum cost for an assignment problem given below?

A. B. C. D.
ugcnetcse-sep2013-paper3 data-structures

Answer key ☟

38.9 Graph Algorithms (1)

38.9.1 Graph Algorithms: UGC NET CSE | July 2018 | Part 2 | Question: 24

Which of the following algorithms solves the single-source shortest paths?

A. Prim's algorithm B. Floys-Warshall algorithm
C. Johnson's algorithm D. Dijkstra's algorithm
ugcnetcse-july2018-paper2 data-structures graph-algorithms

Answer key ☟

38.10 Graph Connectivity (1)

38.10.1 Graph Connectivity: UGC NET CSE | September 2013 | Part 2 | Question: 20

Consider the following statements:

I. A graph in which there is a unique path between every pair of vertices is a tree.
II. A connected graph with e=v-1 is a tree
III. A connected graph with e=v-1 that has no circuit is a tree

Which one of the above statements is/are true?

A. I and III B. II and III C. I and II D. All of the above

graph-connectivity ugcnetsep2013ii

Answer key ☟

38.11 Hashing (13)

38.11.1 Hashing: UGC NET CSE | August 2016 | Part 3 | Question: 32

Consider a hash table of size , and the hash function for

. The key is mapped to location ______.

A. B. C. D.
ugcnetcse-aug2016-paper3 data-structures hashing

Answer key ☟

38.11.2 Hashing: UGC NET CSE | December 2005 | Part 2 | Question: 34

Which of the following is not collision Resolution Technique :

 A. Hash addressing B. Chainning C. Indexing D. None of these
ugcnetcse-dec2005-paper2 data-structures hashing

Answer key ☟

38.11.3 Hashing: UGC NET CSE | December 2009 | Part 2 | Question: 25

A hash function f defined as f(key) = key mod 7, with linear probing used to resolve collisions. Insert the keys
37, 38, 72, 48, 98 and 11 into the table indexed from 0 to 6.

What will be the location of 11 ?

(A) 3

(B) 4

(C) 5

(D) 6
ugcnetcse-dec2009-paper2 data-structures hashing

Answer key ☟

38.11.4 Hashing: UGC NET CSE | December 2011 | Part 2 | Question: 6

A hash table has space for records, then the probability of collision before the table is % full.

A. B. C. D.
ugcnetcse-dec2011-paper2 data-structures hashing

Answer key ☟

38.11.5 Hashing: UGC NET CSE | December 2012 | Part 2 | Question: 26

A hash function defined as , with linear probing is used to insert keys 55, 58, 68, 91,
27, 145. What will be the location of 79?

A. 1 B. 2 C. 3 D. 4
ugcnetcse-dec2012-paper2 data-structures hashing

Answer key ☟

38.11.6 Hashing: UGC NET CSE | December 2015 | Part 2 | Question: 35

The hash function used in double hashing is of the form:

A. B.
C. D.
ugcnetcse-dec2015-paper2 data-structures hashing

Answer key ☟

38.11.7 Hashing: UGC NET CSE | July 2018 | Part 2 | Question: 23

A hash function h defined h(key)=key mod 7, with linear probing, is used to insert the keys 44, 45, 79, 55, 91,
18, 63 into a table indexed from 0 to 6. What will be the location of key 18?

A. 3 B. 4 C. 5 D. 6
ugcnetcse-july2018-paper2 data-structures hashing

Answer key ☟
38.11.8 Hashing: UGC NET CSE | July 2018 | Part 2 | Question: 70

Consider a hash table of sze seven, with starting index zero, and a hash function (7x+3) mod 4. Assuming that
the hash table is initially empty, which of the following is the contents of the table when the sequence 1, 3, 8, 10
is inserted into the table using closed hashing? Here "____" denotes an empty location in the table.
A. 3, 10, 1, 8, ___ , ____ , ____ B. 1, 3, 8, 10, ___, ___, ___
C. 1, ___, 3, ___, 8, ___, 10 D. 3, 10, ___, ____, 8, ___, ___
ugcnetcse-july2018-paper2 data-structures hashing

Answer key ☟

38.11.9 Hashing: UGC NET CSE | June 2010 | Part 2 | Question: 24

A chained hash table has an array size of . What is the maximum number of entries that can be placed in the
table ?

A. B.
C. D. There is no upper limit
ugcnetcse-june2010-paper2 data-structures hashing

Answer key ☟

38.11.10 Hashing: UGC NET CSE | June 2014 | Part 2 | Question: 38

Searching for an element in the hash table requires time for the _________time, whereas for direct
addressing it holds for the _______ time.
A. worst-case, average B. worst-case, worst-case
C. average, worst-case D. best, average
ugcnetcse-june2014-paper2 hashing data-structures

Answer key ☟

38.11.11 Hashing: UGC NET CSE | June 2014 | Part 3 | Question: 64

If is chosen from a universal collection of hash functions and is used to hash keys into a table of size ,
where , the expected number of collisions involving a particular key is
A. Less than B. Less than
C. Greater than D. Greater than
ugcnetjune2014iii data-structures hashing

Answer key ☟

38.11.12 Hashing: UGC NET CSE | June 2023 | Part 2: 9

Consider a hash table of size seven with starting index zero and a hash function . Assuming the
hash table is initially empty. Which of the following is the content of the table when the sequence , is
inserted into the table using closed hashing? Here " denotes an empty location in the table.
A. _,_ B. _,
C. _, ,_, D. _ ,_
ugcnetcse-june2023-paper2 data-structures hashing

Answer key ☟

38.11.13 Hashing: UGC NET CSE | Junet 2015 | Part 3 | Question: 34

Consider a hash table of size m=100 and the hash function h(k)=floor (m(kA mod 1)) for
. Compute the location to which the key k=123456 is placed in hash table

A. 77 B. 82 C. 88 D. 89
ugcnetcse-june2015-paper3 data-structures hashing

Answer key ☟
38.12 Infix Prefix (2)

38.12.1 Infix Prefix: UGC NET CSE | August 2016 | Part 2 | Question: 25

Given the following prefix expression :

What is the value of the prefix expression ?

A. B. C. D.
ugcnetcse-aug2016-paper2 data-structures infix-prefix

Answer key ☟

38.12.2 Infix Prefix: UGC NET CSE | June 2012 | Part 2 | Question: 1

The postfix expression AB + CD -* can be evaluated using a

A. stack B. tree C. queue D. linked list

ugcnetcse-june2012-paper2 data-structures stack infix-prefix

Answer key ☟

38.13 Linear Probing (1)

38.13.1 Linear Probing: UGC NET CSE | December 2005 | Part 2 | Question: 22

A hash function defined as , with linear probing it is used to insert the key
into a table index from to . What will be the locations of :

A. B. C. D.
ugcnetcse-dec2005-paper2 data-structures hashing linear-probing

Answer key ☟

38.14 Linked List (2)

38.14.1 Linked List: UGC NET CSE | August 2016 | Part 2 | Question: 21

Consider an implementation of unsorted single linked list. Suppose it has its representation with a head and a tail
pointer (i.e. pointers to the first and last nodes of the linked list). Given the representation, which of the
following operation can not be implemented in time ?

A. Insertion at the front of the linked list.

B. Insertion at the end of the linked list.
C. Deletion of the front node of the linked list.
D. Deletion of the last node of the linked list.

ugcnetcse-aug2016-paper2 data-structures linked-list

Answer key ☟

38.14.2 Linked List: UGC NET CSE | December 2009 | Part 2 | Question: 24

With regard to linked list, which of the following statement is false ?

(A) An algorithm to search for an element in a singly linked list requires 0(n)
operations in the worst case.
(B) An algorithm for deleting the first element in a singly linked list requires 0(n)
operations in the worst case.
(C) An algorithm for finding the maximum value in a circular linked list requires 0(n)
operations.
 (D) An algorithm for deleting the middle node of a circular linked list requires 0(n)
operations.
ugcnetcse-dec2009-paper2 data-structures linked-list time-complexity

Answer key ☟

38.15 Max Heap (1)

38.15.1 Max Heap: UGC NET CSE | July 2016 | Part 3 | Question: 33

Which one of the following array represents a binary max-heap?

A. [26, 13, 17, 14, 11, 9, 15] B. [26, 15, 14, 17, 11, 9, 13]
C. [26, 15, 17, 14, 11, 9, 13] D. [26, 15, 13, 14, 11, 9, 17]
ugcnetcse-july2016-paper3 data-structures max-heap

Answer key ☟

38.16 Minimum Spanning Tree (2)

38.16.1 Minimum Spanning Tree: UGC NET CSE | August 2016 | Part 3 | Question: 33

Consider a weighted complete graph on the vertex set such that the weight of the edge
is . The weight of minimum cost spanning tree of is :

A. B. C. D.
ugcnetcse-aug2016-paper3 data-structures minimum-spanning-tree

Answer key ☟

38.16.2 Minimum Spanning Tree: UGC NET CSE | December 2008 | Part 2 | Question: 3

The total number of spanning trees that can be drawn using five labeled vertices is:

1. 125
2. 64
3. 36
4. 16

ugcnetcse-dec2008-paper2 data-structures minimum-spanning-tree

Answer key ☟

38.17 Priority (1)

38.17.1 Priority: UGC NET CSE | June 2013 | Part 2 | Question: 30

Consider the following statements for priority queue:

S1: It is a data structure in which the intrinsic ordering of the elements does determine the result of its basic
operations.
S2: The elements of a priority queue may be complex structures that are ordered on one or several fields
A. Both S1 and S2 are incorrect B. S1 is correct and S2 is incorrect
C. S1 is incorrect and S2 is correct D. Both S1 and S2 are correct
data-structures priority ugcnetcse-june2013-paper2

Answer key ☟

38.18 Priority Queue (2)

38.18.1 Priority Queue: UGC NET CSE | August 2016 | Part 3 | Question: 34

A priority queue is implemented as a max-heap. Initially, it has five elements. The levelorder traversal of the
 heap is as follows :
20, 18, 15, 13, 12
Two new elements ‘10’ and ‘17’ are inserted in the heap in that order. The level-order traversal of the heap after the
insertion of the element is :
A. 20, 18, 17, 15, 13, 12, 10 B. 20, 18, 17, 12, 13, 10, 15
C. 20, 18, 17, 10, 12, 13, 15 D. 20, 18, 17, 13, 12, 10, 15
ugcnetcse-aug2016-paper3 data-structures priority-queue

Answer key ☟

38.18.2 Priority Queue: UGC NET CSE | June 2010 | Part 2 | Question: 22

What is the most appropriate data structure to implement a priority queue ?

A. Heap B. Circular array C. Linked list D. Binary tree

ugcnetcse-june2010-paper2 data-structures priority-queue

Answer key ☟

38.19 Queue (5)

38.19.1 Queue: UGC NET CSE | August 2016 | Part 2 | Question: 24

Consider the following statements :

: A queue can be implemented using two stacks.
: A stack can be implemented using two queues.
Which of the following is correct ?

A. is correct and is not correct. B. is not correct and is correct.

C. Both and are correct. D. Both and are not correct.
ugcnetcse-aug2016-paper2 data-structures queue stack

Answer key ☟

38.19.2 Queue: UGC NET CSE | December 2005 | Part 2 | Question: 24

The initial configuration of quaue is . is at the front. To get the configuration how many
deletions and additions required:
A. deletions, additions B. deletions, additions
C. deletions, additions D. deletions, additions
ugcnetcse-dec2005-paper2 data-structures queue

Answer key ☟

38.19.3 Queue: UGC NET CSE | December 2009 | Part 2 | Question: 23

At a hill station, the parking lot is one long drive way snaking up a hill side. Cars drive in and park right behind
the car in front of them, one behind another. A car can’t leave until all the cars in front of it have left. Is the
parking lot more like

(A) An array

(B) A stack

(C) A queue

(D) A linked list

ugcnetcse-dec2009-paper2 data-structures queue

Answer key ☟
 38.19.4 Queue: UGC NET CSE | June 2009 | Part 2 | Question: 26

Queue is a …………. list .

A. B.
C. D.
ugcnetcse-june2009-paper2 data-structures queue easy

Answer key ☟

38.19.5 Queue: UGC NET CSE | September 2013 | Part 2 | Question: 12

The efficient data structure to insert/delete a number in a stored set of number is

A. Queue B. Linked list C. Doubly linked list D. Binary tree

ugcnetsep2013ii data-structures queue linked-list

Answer key ☟

38.20 Quick Sort (1)

38.20.1 Quick Sort: UGC NET CSE | September 2013 | Part 2 | Question: 10

Suppose that the splits at every level of Quicksort are in proportion , where is a constant.
The number of elements in an array is n. The maximum depth is approximately
A. 0.5 Ig n B. 0.5 (1- ) Ig n
C. -(Ig n)/(Ig ) D. -(Ig n)/Ig (1- )
ugcnetsep2013ii data-structures sorting algorithms quick-sort

Answer key ☟

38.21 Radix Sort (2)

38.21.1 Radix Sort: UGC NET CSE | August 2016 | Part 3 | Question: 35

If there are integers to sort, each integer has d digits, and each digit is in the set , radix sort can
sort the numbers in :

A. B.
C. D.
ugcnetcse-aug2016-paper3 data-structures radix-sort

Answer key ☟

38.21.2 Radix Sort: UGC NET CSE | July 2018 | Part 2 | Question: 28

The maximum number of comparisons needed to sort 9 items using radix sort is (assume each item is 5 digit
octal number):

A. 45 B. 72 C. 360 D. 450
ugcnetcse-july2018-paper2 data-structures radix-sort

Answer key ☟

38.22 Recursion (1)

38.22.1 Recursion: UGC NET CSE | January 2017 | Part 3 | Question: 24

A recursive function , is defined as follows:

If the value of is then the value of is:

 A. B. C. D.
ugcnetcse-jan2017-paper3 data-structures recursion

Answer key ☟

38.23 Relational Algebra (1)

38.23.1 Relational Algebra: UGC NET CSE | October 2020 | Part 2 | Question: 64

Match with
Let and

Choose the correct answer from the options given below:

A. B.
C. D.
ugcnetcse-oct2020-paper2 data-structures relational-algebra

Answer key ☟

38.24 Stack (13)

38.24.1 Stack: UGC NET CSE | December 2006 | Part 2 | Question: 23

What is the time required to insert an element in a stack with linked implementation ?

A. B. C. D.
ugcnetcse-dec2006-paper2 stack

Answer key ☟

38.24.2 Stack: UGC NET CSE | December 2012 | Part 2 | Question: 40

Given an empty stack, after performing push(1), push(2), pop, push(3), push(4), pop, pop, push(5), pop, what is
the value of the top of the stack?

A. 4 B. 3 C. 2 D. 1
ugcnetcse-dec2012-paper2 data-structures stack

Answer key ☟

38.24.3 Stack: UGC NET CSE | December 2012 | Part 3 | Question: 17

Which of the following permutations can be obtained in the output using a stack of size 3 elements assuming
that input, sequence is 1, 2, 3, 4, 5?

A. 3, 2, 1, 5, 4 B. 5, 4, 3, 2, 1
C. 3, 4, 5, 2, 1 D. 3, 4, 5, 1, 2
ugcnetcse-dec2012-paper3 data-structures stack

Answer key ☟

38.24.4 Stack: UGC NET CSE | December 2014 | Part 2 | Question: 08

How many PUSH and POP operations will be needed to evaluate the following expression by reverse polish
notation in a stack machine ?
 A. PUSH and POP instructions B. PUSH and POP instructions
C. PUSH and POP instructions D. PUSH and POP instructions
ugcnetcse-dec2014-paper2 data-structures stack

Answer key ☟

38.24.5 Stack: UGC NET CSE | December 2014 | Part 2 | Question: 21

Convert the following infix expression into its equivalent post fix expression ^
A. ^ B. ^
C. ^ D. ^
ugcnetcse-dec2014-paper2 data-structures stack

Answer key ☟

38.24.6 Stack: UGC NET CSE | January 2017 | Part 2 | Question: 22

The seven elements and are pushed onto a stack in reverse order, i.e., starting from . The
stack is popped five times and each element is inserted into a queue. Two elements are deleted from the queue
and pushed back onto the stack. Now, one element is popped from the stack. The popped item is ___________.

A. B. C. D.
ugcnetjan2017ii data-structures stack

Answer key ☟

38.24.7 Stack: UGC NET CSE | July 2016 | Part 2 | Question: 22

Consider the following operations performed on a stack of size 5:

Push (a); Pop(); Push(b); Push(c); Pop();
Push(d); Pop(); Pop(); Push(e)
Which of the following statements is correct?
A. Underflow occurs B. Stack operations are performed smoothly
C. Overflow occurs D. None of the above
ugcnetcse-july2016-paper2 data-structures stack easy

Answer key ☟

38.24.8 Stack: UGC NET CSE | July 2016 | Part 2 | Question: 24

Which of the following is not an inherent application of stack?

A. Implementation of recursion B. Evaluation of a postfix expression
C. Job scheduling D. Reverse a string
ugcnetcse-july2016-paper2 data-structures stack

Answer key ☟

38.24.9 Stack: UGC NET CSE | June 2005 | Part 2 | Question: 21

What is the time required to insert an element in a stack with linked implementation?

A. B. C. D.
ugcnetcse-june2005-paper2 data-structures linked-list stack

Answer key ☟

38.24.10 Stack: UGC NET CSE | June 2010 | Part 2 | Question: 21

If we have six stack operationspushing and popping each of and -such that push must occur before
push which must occur before push , then is a possible order for the pop operations, since this
could be our sequence : push , pop , push , push , pop , pop . Which one of the following orders
could not be the order the pop operations are run, if we are to satisfy the requirements described above?
 A. B. C. D.
ugcnetcse-june2010-paper2 data-structures stack

Answer key ☟

38.24.11 Stack: UGC NET CSE | June 2012 | Part 3 | Question: 38

The following postfix expression is evaluated using a stack. 823^/23*+51*- . The top two elements of the stack
after first * is evaluated

A. 6,1 B. 5, 7 C. 3,2 D. 1, 5
ugcnetcse-june2012-paper3 data-structures stack

Answer key ☟

38.24.12 Stack: UGC NET CSE | June 2014 | Part 2 | Question: 40

What is the maximum number of parenthesis that will appear on the stack at any one time for parenthesis
expression given by

A.
B.
C.
D.

ugcnetcse-june2014-paper2 data-structures stack

Answer key ☟

38.24.13 Stack: UGC NET CSE | June 2014 | Part 3 | Question: 41

The reverse polish notation equivalent to the infix expression

A. B.
C. D.
ugcnetjune2014iii data-structures stack

Answer key ☟

38.25 Tree (11)

38.25.1 Tree: UGC NET CSE | December 2012 | Part 2 | Question: 16

In which tree, for every node the height of its left subtree and right subtree differ almost by 1?
A. Binary Search Tree B. AVL Tree
C. Threaded Binary Tree D. Complete Binary Tree
ugcnetcse-dec2012-paper2 data-structures tree binary-tree

Answer key ☟

38.25.2 Tree: UGC NET CSE | December 2012 | Part 2 | Question: 25

Suppose that someone starts with a chain letter. Each person who receives the letter is asked to send it on to
other people. Some people do this, while some do not send any letter. How many people have seen the letter,
including the first person, if none receives more than one letter and if the chain letter ends after there have been 100
people who read it but did not send it out? Also find out how many people sent out the letter?

A. & B. & C. & D. &

ugcnetcse-dec2012-paper2 tree

Answer key ☟
38.25.3 Tree: UGC NET CSE | December 2014 | Part 2 | Question: 02

A certain tree has two vertices of degree , one vertex of degree and one vertex of degree . If the other vertices
have degree , how many vertices are there in the graph ?

A. B. C. D.
ugcnetcse-dec2014-paper2 data-structures tree

Answer key ☟

38.25.4 Tree: UGC NET CSE | December 2015 | Part 2 | Question: 5

A tree with n vertices is called graceful, if its vertices can be labelled with integers 1, , ..., n such that the
absolute value of the difference of the labels of adjacent vertices are all different. Which of the following trees
are graceful?

a.
c.
b.

A. a and b B. b and c C. a and c D. a, b,and c

ugcnetcse-dec2015-paper2 data-structures tree

Answer key ☟

38.25.5 Tree: UGC NET CSE | July 2016 | Part 2 | Question: 23

Suppose you are given a binary tree with n nodes, such that each node has exactly eiter zero or two children. The
maximum height of the tree will be

A. B. C. D.
ugcnetcse-july2016-paper2 data-structures tree

Answer key ☟

38.25.6 Tree: UGC NET CSE | July 2018 | Part 2 | Question: 29

A 5-ary tree in which every internal node has exactly 5 children. The number of left nodes in such a tree with 8
internal nodes will be:

A. 30 B. 33 C. 45 D. 125
ugcnetcse-july2018-paper2 data-structures tree

Answer key ☟

38.25.7 Tree: UGC NET CSE | June 2010 | Part 2 | Question: 23

In a complete binary tree of n nodes, how far are the two most distant nodes ? Assume each edge in the path
counts as !
A. About B. About
C. About D. About
ugcnetcse-june2010-paper2 data-structures tree

Answer key ☟

38.25.8 Tree: UGC NET CSE | June 2010 | Part 2 | Question: 32

Which of the following expression is represented by the parse tree ?

 A. B. C. D.
ugcnetcse-june2010-paper2 data-structures tree

Answer key ☟

38.25.9 Tree: UGC NET CSE | June 2012 | Part 2 | Question: 13

Leaves of which of the following trees are at the same level?

A. Binary tree
B. B-tree
C. AVL-tree
D. Expression tree
ugcnetcse-june2012-paper2 programming tree

Answer key ☟

38.25.10 Tree: UGC NET CSE | June 2012 | Part 2 | Question: 50

To represent hierarchical relationship between elements, which data structure is suitable?

A. Dequeue B. Priority C. Tree D. All of the above

data-structures ugcnetcse-june2012-paper2 tree easy

Answer key ☟

38.25.11 Tree: UGC NET CSE | June 2012 | Part 3 | Question: 36

Number of binary trees formed with 5 nodes are

A. 32 B. 36 C. 120 D. 42
ugcnetcse-june2012-paper3 data-structures tree

Answer key ☟

38.26 Tree Traversal (1)

38.26.1 Tree Traversal: UGC NET CSE | December 2015 | Part 2 | Question: 38

The inorder traversal of the following tree is

A.
B.
C.
D.
 ugcnetcse-dec2015-paper2 data-structures tree-traversal

Answer key ☟

Answer Keys
38.0.1 B 38.0.2 Q-Q 38.0.3 Q-Q 38.0.4 Q-Q 38.0.5 Q-Q
38.0.6 Q-Q 38.0.7 Q-Q 38.0.8 Q-Q 38.0.9 Q-Q 38.0.10 Q-Q
38.0.11 Q-Q 38.0.12 Q-Q 38.0.13 Q-Q 38.0.14 Q-Q 38.1.1 D
38.1.2 Q-Q 38.2.1 X 38.3.1 Q-Q 38.4.1 Q-Q 38.4.2 B
38.4.3 Q-Q 38.4.4 D 38.4.5 X 38.4.6 B 38.4.7 A
38.5.1 Q-Q 38.5.2 Q-Q 38.5.3 D 38.5.4 C 38.5.5 Q-Q
38.5.6 C 38.6.1 Q-Q 38.6.2 Q-Q 38.6.3 B 38.6.4 D
38.6.5 C 38.6.6 C 38.6.7 C 38.7.1 A 38.8.1 Q-Q
38.8.2 C 38.8.3 C 38.8.4 D 38.8.5 B 38.8.6 C
38.8.7 C 38.9.1 Q-Q 38.10.1 D 38.11.1 Q-Q 38.11.2 Q-Q
38.11.3 Q-Q 38.11.4 Q-Q 38.11.5 X 38.11.6 C 38.11.7 Q-Q
38.11.8 Q-Q 38.11.9 Q-Q 38.11.10 C 38.11.11 A 38.11.12 Q-Q
38.11.13 C 38.12.1 Q-Q 38.12.2 A 38.13.1 Q-Q 38.14.1 Q-Q
38.14.2 Q-Q 38.15.1 C 38.16.1 Q-Q 38.16.2 Q-Q 38.17.1 D
38.18.1 Q-Q 38.18.2 Q-Q 38.19.1 Q-Q 38.19.2 Q-Q 38.19.3 Q-Q
38.19.4 Q-Q 38.19.5 C 38.20.1 D 38.21.1 B 38.21.2 Q-Q
38.22.1 C 38.23.1 D 38.24.1 Q-Q 38.24.2 D 38.24.3 A;C
38.24.4 B 38.24.5 A 38.24.6 B 38.24.7 B 38.24.8 C
38.24.9 Q-Q 38.24.10 Q-Q 38.24.11 A 38.24.12 B 38.24.13 A
38.25.1 B 38.25.2 C 38.25.3 D 38.25.4 D 38.25.5 C
38.25.6 Q-Q 38.25.7 Q-Q 38.25.8 Q-Q 38.25.9 B 38.25.10 C
38.25.11 D 38.26.1 D
39 Programming: Programming in C (84)

39.0.1 UGC NET CSE | December 2012 | Part 3 | Question: 39

When a programming language has the capacity to produce new datatype, it is called as,
A. Overloaded Language B. Extensible Language
C. Encapsulated Language D. Abstraction Language
programming ugcnetcse-dec2012-paper3

Answer key ☟

39.0.2 UGC NET CSE | December 2013 | Part 2 | Question: 20

The correct way to round off a floating number x to an integer value is

A. y = (int) (x + 0.5) B. y = int (x + 0.5)
C. y = (int) x + 0.5 D. y = (int) ((int)x + 0.5)
ugcnetcse-dec2013-paper2

Answer key ☟

39.0.3 UGC NET CSE | December 2013 | Part 3 | Question: 34

______ comparisons are necessary in the worst case to find both the maximum and minimum of n numbers.
A. 2n – 2 B. n + floor (lg n) – 2
C. floor ( )–2 D. 2 lg n – 2
ugcnetcse-dec2013-paper3 programming

Answer key ☟

39.0.4 UGC NET CSE | June 2012 | Part 3 | Question: 1

Consider the following Pseudo-code segment:

k:=0
for :=1 to n
for := 1 to
:
:
:
for :=1 to
k:=k+1
The value of k after the execution of this code shall be

A. B. C. D.
ugcnetcse-june2012-paper3 programming algorithms

Answer key ☟

39.0.5 UGC NET CSE | December 2012 | Part 2 | Question: 41

Enumeration is a process of
A. Declaring a set of numbers B. Sorting a list of strings
C. Assigning a legal values possible for a variable D. Sequencing a list of operators
ugcnetcse-dec2012-paper2 programming

Answer key ☟
39.0.6 UGC NET CSE | June 2013 | Part 3 | Question: 50

What will be the output of the following segment of the program?

main()
{
char *s=”hello world”;
int i=7;
printf(“%, *s, i, s);
}

A. syntax error B. hello w C. hello D. o world

ugcnetcse-june2013-paper3

Answer key ☟

39.0.7 UGC NET CSE | September 2013 | Part 3 | Question: 66

The programming languages C and C++ are not strongly typed languages because

A. Both C and C++ allow functions for which parameters are not type checked
B. Both C and C++ allow functions for which parameters are type checked
C. Both C and C++ allow functions for which parameters are not type checked and also the union types in these
languages are not type checked.
D. Union types in these (C and C++) languages are not type checked

ugcnetcse-sep2013-paper3 programming

Answer key ☟

39.0.8 UGC NET CSE | December 2013 | Part 3 | Question: 14

Which of the following concepts means adding new concepts to a program as it runs?
A. Data hiding B. Dynamic loading
C. Dynamic typing D. Dynamic binding
ugcnetcse-dec2013-paper3 programming

Answer key ☟

39.0.9 UGC NET CSE | December 2013 | Part 3 | Question: 15

Which of the following correctly describes overloading of functions?

A. Virtual polymorphism B. Transient polymorphism
C. Ad-hoc polymorphism D. Pseudo polymorphism
ugcnetcse-dec2013-paper3 programming

Answer key ☟

39.0.10 UGC NET CSE | December 2013 | Part 3 | Question: 16

Match the following with respect to the programming language

A. B.
C. D.
ugcnetcse-dec2013-paper3 programming
 Answer key ☟

39.0.11 UGC NET CSE | December 2015 | Part 2 | Question: 17

In C++, which system - provided function is called when no handler is provided to deal with an exception?

A. terminate() B. unexpected() C. abort() D. kill()

ugcnetcse-dec2015-paper2 programming

Answer key ☟

39.0.12 UGC NET CSE | December 2015 | Part 2 | Question: 45

The ____ transfers the executable image of a C++ program from hard disk to main memory

A. Compiler B. Linker C. Debugger D. Loader

ugcnetcse-dec2015-paper2 programming

Answer key ☟

39.0.13 UGC NET CSE | July 2016 | Part 2 | Question: 15

What is the value returned by the function f given below when n=100?
let f(int n)
{ if (n==0) then return n;
else
return n+f(n-2);
}

A. 2550 B. 2556 C. 5220 D. 5520

ugcnetcse-july2016-paper2 programming

Answer key ☟

39.0.14 UGC NET CSE | July 2016 | Part 3 | Question: 19

Given the following statements:

i. To implement Abstract Data Type, a programming language require a syntactic unit to encapsulate type definition
ii. To implement ADT, a programming language requires some primitive operations that are built in the language
processor
iii. C++, Ada, Java 5.0, C#2005 provide support for parameterised ADT

Which one of the following options is correct?

A. i, ii and iii are false B. i, ii are true, iii is false
C. i is true, ii and iii are false D. i, ii and iii are true
ugcnetcse-july2016-paper3 programming abstract-data-type

Answer key ☟

39.0.15 UGC NET CSE | July 2016 | Part 3 | Question: 20

Match the following types of variables with the corresponding programming languages :

A. B.
C. D.
 ugcnetcse-july2016-paper3 programming

Answer key ☟

39.0.16 UGC NET CSE | July 2016 | Part 3 | Question: 21

Which of the following is false regarding the evaluation of computer programming language:
A. Application oriented features B. Efficiency and reliability
C. Software development D. Hardware maintenance cost
ugcnetcse-july2016-paper3 programming

Answer key ☟

39.0.17 UGC NET CSE | August 2016 | Part 3 | Question: 19

Match the following with reference to Functional programming history :

A. B.
C. D.
ugcnetcse-aug2016-paper3 programming

Answer key ☟

39.0.18 UGC NET CSE | December 2009 | Part 2 | Question: 04

P : “Program is a step by step execution of the instructions”. Given P, which of the following is true ?

A. Program is a subset of an instruction set.

B. Program is a sequence of a subset of an instruction set.
C. Program is a partially ordered set of an instruction set.
D. All of the above

ugcnetcse-dec2009-paper2 programming

Answer key ☟

39.0.19 UGC NET CSE | June 2009 | Part 2 | Question: 17

The friend functions are used in situations where :

A. We want to have access to unrelated classes

B. Dynamic binding is required
C. Exchange of data between classes to take place
D. None of the above

ugcnetcse-june2009-paper2

Answer key ☟

39.0.20 UGC NET CSE | June 2009 | Part 2 | Question: 20

There exists a construct which returns a value ‘true’ if the argument subquery is :

A. empty
B. non-empty
C. in error
 D. none of the above

ugcnetcse-june2009-paper2

Answer key ☟

39.0.21 UGC NET CSE | December 2004 | Part 2 | Question: 14

A function object :

A. is an instance of a class for which operator ( ) is a member function

B. is an instance of a class for which operator → is a member function
C. is a pointer to any function
D. is a member function of a class

ugcnetcse-dec2004-paper2

Answer key ☟

39.0.22 UGC NET CSE | December 2004 | Part 2 | Question: 12

Consider the following statements,

Int i=4, j=3, k=0;
k=++i - --j + i++---j +j++;

What will be the values of and after the statement.

A. B. C. D.
ugcnetcse-dec2004-paper2

Answer key ☟

39.0.23 UGC NET CSE | December 2006 | Part 2 | Question: 15

The declaration “unsigned u” indicates :

A. u is an unsigned character B. u is an unsigned integer
C. u is a character D. u is a string
ugcnetcse-dec2006-paper2

Answer key ☟

39.0.24 UGC NET CSE | December 2006 | Part 2 | Question: 13

int arr[ ]={1, 2, 3, 4}

int count;
incr( ) {return ++count;}
main( )
{
arr[count++]=incr( );
printf(“arr[count]=%d\n”, arr[count]);
}

The value printed by the above program is :

A. B. C. D.
ugcnetcse-dec2006-paper2

39.0.25 UGC NET CSE | December 2007 | Part 2 | Question: 13

Which of the following is a valid C code to print character ‘A’ to ‘C’ ?

 A. x='A' ;
switch(x)
{case 'A'= printf ( "%d\n" , x);
....
case 'C'= printf ( "%d\n" , x);
}

B. x='A';
switch(x)
{case 'A' <= x <= 'C' : printf ( "%d\n" , x);}

C. x='A' ;
switch(x)
{
case 'A' : printf ( "%d\n" , x);
break;
case 'B' : printf ( "%d\n" , x);
break;
case 'C' : printf ( "%d\n" , x);
break;
}

D. x='A' ;
switch(x)
{
case 'A' =printf ( "%d\n" , x);
case 'B' =printf ( "%d\n" , x);
case 'C' =printf ( "%d\n" , x);
}

ugcnetcse-dec2007-paper2

Answer key ☟

39.0.26 UGC NET CSE | December 2007 | Part 2 | Question: 11

What cannot replace ‘?’ in the following C-code to print all odd numbers less than ?
for (i=1; ? ; i=i+2)
printf("%d\n", i);

1.
2.
3.
4.

ugcnetcse-dec2007-paper2

Answer key ☟

39.1 Aliasing (1)

39.1.1 Aliasing: UGC NET CSE | August 2016 | Part 3 | Question: 20

Aliasing in the context of programming languages refers to :

A. Multiple variables having the same location

B. Multiple variables having the same identifier
C. Multiple variables having the same value
D. Multiple use of same variable

ugcnetcse-aug2016-paper3 programming aliasing

Answer key ☟

39.2 Array (3)

 39.2.1 Array: UGC NET CSE | June 2013 | Part 3 | Question: 48

When an array is passed as a parameter to a function which of the following statements is correct?

A. The function can values in the original array B. The function cannot values in the original array
C. Results in compilation error D. Results in run-time error
ugcnetcse-june2013-paper3 programming-in-c array

Answer key ☟

39.2.2 Array: UGC NET CSE | Junet 2015 | Part 2 | Question: 11

What is the output of the following program: (Assume that the appropriate preprocessor directives are included
and there is not syntax error)
main( )
{ char S[]="ABCDEFGH";
printf("%C", *(&S[3]));
printf("%s", S+4);
printf("%u", S);
/*Base address of S is 1000 */
}

A. B. C. D.
ugcnetcse-june2015-paper2 programming-in-c array

Answer key ☟

39.2.3 Array: UGC NET CSE | October 2020 | Part 2 | Question: 11

Suppose you are compiling on a machine with -byte chars, -byte shorts, -byte ints, and -byte doubles, and
with alignment rules that require the address of every primitive data element to be an integer multiple of the
element’s size. Suppose further that the compiler is not permitted to reorder fields; padding is used to ensure alignment.
How much space will be consumed by the following array?
struct {
short s;
char c;
short t;
char d;
double r;
int i;
} A[10]; /*10 element array of structs */

A. bytes B. bytes C. bytes D. bytes

ugcnetcse-oct2020-paper2 programming-in-c array

Answer key ☟

39.3 Binary Search Tree (1)

39.3.1 Binary Search Tree: UGC NET CSE | December 2014 | Part 3 | Question: 36

Suppose that we have numbers between and in a binary search tree and we want to search for the number
. Which of the following sequences could not be the sequence of nodes examined ?

A.
B.
C.
D.

ugcnetcse-dec2014-paper3 data-structures binary-search-tree

Answer key ☟

39.4 Bitwise Operation (1)

 39.4.1 Bitwise Operation: UGC NET CSE | December 2004 | Part 2 | Question: 11

Suppose and are two Integer Variables having values and respectively. The result (in hex)
of applying bitwise operator and to and will be :

1.
2.
3.
4.

ugcnetcse-dec2004-paper2 programming-in-c bitwise-operation

Answer key ☟

39.5 Data Types (2)

39.5.1 Data Types: UGC NET CSE | December 2005 | Part 2 | Question: 11

What is the output of the following -program

main()
{
printf("%d %d %d",size of (3.14f), size of (3.14), size of (3.141));
}

A. 4 4 4 B. 4 8 10 C. 8 4 8 D. 8 8 8
ugcnetcse-dec2005-paper2 programming-in-c data-types

Answer key ☟

39.5.2 Data Types: UGC NET CSE | June 2010 | Part 2 | Question: 15

The data type created by the data abstraction process is called

A. Class B. Structure
C. Abstract data type D. User defined data type
ugcnetcse-june2010-paper2 programming data-types

Answer key ☟

39.6 Dynamic Memory Allocation (1)

39.6.1 Dynamic Memory Allocation: UGC NET CSE | June 2012 | Part 3 | Question: 24

The ____________ memory allocation function modifies the previous allocated space.

A. calloc() B. free() C. malloc() D. realloc()

ugcnetcse-june2012-paper3 programming-in-c dynamic-memory-allocation

Answer key ☟

39.7 Evaluation Postfix (1)

39.7.1 Evaluation Postfix: UGC NET CSE | December 2013 | Part 2 | Question: 21

What is the value of the postfix expression a b c d + - * (where a=8, b=4, c=2 and d=5)

A. B. C. 24 D. -24
ugcnetcse-dec2013-paper2 evaluation-postfix

Answer key ☟

39.8 Exception Handling (1)

 39.8.1 Exception Handling: UGC NET CSE | December 2012 | Part 2 | Question: 29

Which of the following are two special functions that are meant for handling exception, that occur during
exception handling itself?

A. Void terminate () and void unexpected()

B. Non void terminate () and void unexpected()
C. Void terminate () and non void unexpected()
D. Non void terminate () and non void unexpected()

ugcnetcse-dec2012-paper2 programming exception-handling

Answer key ☟

39.9 Expression Evaluation (1)

39.9.1 Expression Evaluation: UGC NET CSE | December 2004 | Part 2 | Question: 13

What is the value of the arithmetic expression (Written in C)

A. B. C. D. None of these
ugcnetcse-dec2004-paper2 programming-in-c expression-evaluation operator-precedence

Answer key ☟

39.10 File Handling (1)

39.10.1 File Handling: UGC NET CSE | December 2012 | Part 2 | Question: 42

Which of the following mode declaration used in C++ to open a file for input?

A. ios : : app B. in : : ios C. ios : : file D. ios : : in

ugcnetcse-dec2012-paper2 programming file-handling

Answer key ☟

39.11 Graph Coloring (1)

39.11.1 Graph Coloring: UGC NET CSE | June 2012 | Part 3 | Question: 31

The upper bound of computing time of m colouring decision problem is

A. B. C. D.
ugcnetcse-june2012-paper3 graph-theory graph-coloring

Answer key ☟

39.12 IO Statement (1)

39.12.1 IO Statement: UGC NET CSE | December 2008 | Part 2 | Question: 26

The output of the program code

main()
{
int x=0;
while (x<=10)
for(;;)
if(++x%10==0)
break;
printf(“x=%d”,x);
}
 is :

A. x=1
B. compilation error
C. x=20
D. none of the above

ugcnetcse-dec2008-paper2 programming-in-c io-statement

Answer key ☟

39.13 Java (4)

39.13.1 Java: UGC NET CSE | December 2012 | Part 2 | Question: 21

Which API is used to draw a circle?

A. Circle () B. Ellipse () C. Round Rect () D. Pie ()

ugcnetcse-dec2012-paper2 programming java bad-question

Answer key ☟

39.13.2 Java: UGC NET CSE | July 2018 | Part 2 | Question: 7

Which of the following statements is/are true?

P: C programming language has a weak type system with static types.
Q: Java programming language has a string type system with static types
Code:

A. P only B. Q only C. Both P and Q D. Neither P nor Q

ugcnetcse-july2018-paper2 programming-in-c java

Answer key ☟

39.13.3 Java: UGC NET CSE | June 2012 | Part 3 | Question: 26

The mechanism that binds code and data together and keeps them secure form outside world is known as

A. Abstraction B. Inheritance C. Encapsulation D. Polymorphism

ugcnetcse-june2012-paper3 programming programming-in-c java object-oriented-programming

Answer key ☟

39.13.4 Java: UGC NET CSE | June 2012 | Part 3 | Question: 55

Match the following with respect to java.util. class methods :

A. B.
C. D.
ugcnetcse-june2012-paper3 non-gatecse object-oriented-programming java match-the-following

Answer key ☟

39.14 Linked List (1)

 39.14.1 Linked List: UGC NET CSE | December 2013 | Part 2 | Question: 22

If the queue is implemented with a linked list, keeping track of a front pointer, which of these pointers will
change during an insertion into an non-empty queue?
A. Neither of the pointer change B. Only front pointer changes
C. Only rear pointer changes D. Both of the pointer changes
ugcnetcse-dec2013-paper2 data-structures linked-list

Answer key ☟

39.15 Loop (1)

39.15.1 Loop: UGC NET CSE | December 2010 | Part 2 | Question: 14

Which one of the following sentences is true ?

A. The body of a while loop is executed at least once.

B. The body of a do … while loop is executed at least once.
C. The body of a do … while loop is executed zero or more times.
D. A for loop can never be used in place of a while loop.

ugcnetcse-dec2010-paper2 programming loop

Answer key ☟

39.16 Non Gatecse (4)

39.16.1 Non Gatecse: UGC NET CSE | December 2012 | Part 2 | Question: 15

What is the size of the Unicode character in Windows Operating System?

A. 8-Bits B. 16-Bits C. 32-Bits D. 64-Bits

ugcnetcse-dec2012-paper2 non-gatecse programming

Answer key ☟

39.16.2 Non Gatecse: UGC NET CSE | December 2015 | Part 3 | Question: 9

Match the following w.r.t. programming languages

A. B.
C. D.
ugcnetcse-dec2015-paper3 programming non-gatecse

Answer key ☟

39.16.3 Non Gatecse: UGC NET CSE | June 2012 | Part 2 | Question: 38

printf(“%c”, 100);

A. prints 100 B. prints ASCII equivalent of 100

C. prints garbage D. None of the above
non-gatecse programming-in-c ugcnetcse-june2012-paper2

Answer key ☟
 39.16.4 Non Gatecse: UGC NET CSE | June 2014 | Part 3 | Question: 10

Code blocks allow many algorithms to be implemented with the following parameters :
A. clarity, elegance, performance B. clarity, elegance, efficiency
C. elegance, performance, execution D. execution, clarity, performance
ugcnetjune2014iii programming non-gatecse

Answer key ☟

39.17 Object Oriented Programming (3)

39.17.1 Object Oriented Programming: UGC NET CSE | December 2009 | Part 2 | Question: 14

Encapsulation is

(A) Dynamic binding

(B) A mechanism to associate the code and data.

(C) Data abstraction

(D) Creating new class

ugcnetcse-dec2009-paper2 programming object-oriented-programming

Answer key ☟

39.17.2 Object Oriented Programming: UGC NET CSE | December 2009 | Part 2 | Question: 14

A __________ is a special method used to initialize the instance variable of a class.

(A) Member function

(B) Destructor

(C) Constructor

(D) Structure
ugcnetcse-dec2009-paper2 programming object-oriented-programming

Answer key ☟

39.17.3 Object Oriented Programming: UGC NET CSE | December 2009 | Part 2 | Question: 15

Which of the statements are true ?

I. Function overloading is done at compile time.
II. Protected members are accessible to the member of derived class.
III. A derived class inherits constructors and destructors.
IV. A friend function can be called like a normal function.
V. Nested class is a derived class.

(A) I, II, III

(B) II, III, V

(C) III, IV, V

(D) I, II, IV
ugcnetcse-dec2009-paper2 object-oriented-programming

Answer key ☟
39.18 Operator Precedence (1)

39.18.1 Operator Precedence: UGC NET CSE | June 2010 | Part 2 | Question: 33

Consider the following left associative operators in decreasing order of precedence :

- subtraction (highest precedence)
* multiplication
$ exponentiation (lowest precedence)
What is the result of the following expression ?
3 – 2 * 4 $ | * 2** 3

A. B. C. D.
ugcnetcse-june2010-paper2 programming operator-precedence

Answer key ☟

39.19 Operators (1)

39.19.1 Operators: UGC NET CSE | December 2005 | Part 2 | Question: 15

What will be the value of for the following expression:

int f=11, i=3 ;
i + = (f>3) ? i & 2:5 ;

A. B. C. D.
ugcnetcse-dec2005-paper2 programming-in-c operators

Answer key ☟

39.20 Pointers (2)

39.20.1 Pointers: UGC NET CSE | December 2014 | Part 2 | Question: 12

What does the following expression means ?

char ;

A. A pointer to a function returning array of n pointers to function returning character pointers.

B. A function return array of N pointers to functions returning pointers to characters
C. An array of n pointers to function returning pointers to characters
D. An array of n pointers to function returning pointers to functions returning pointers to characters.

ugcnetcse-dec2014-paper2 programming-in-c pointers

Answer key ☟

39.20.2 Pointers: UGC NET CSE | June 2010 | Part 2 | Question: 12

What will be the output of the following c-code?

void main ()
{
char *p= "ayqm";
char c;
c=++*p;
printf ("%c" , c);
}

A. B. C. D.
ugcnetcse-june2010-paper2 programming-in-c pointers
 Answer key ☟

39.21 Programming In C (15)

39.21.1 Programming In C: Modified UGC NET 2012 Memory allocation scheme

Which among the following is (are) able to modify previously allocated space

I. calloc() II. free() III. realloc()

A. Both II and III

B. I , II and III

C. III only

D. II only
programming-in-c

Answer key ☟

39.21.2 Programming In C: UGC NET CSE | December 2013 | Part 2 | Question: 16

What does the following declaration mean?

int (*ptr) [10];
A. ptr is an array of pointers of 10 integers B. ptr is a pointer to an array of 10 integers
C. ptr is an array of 10 integers D. none of the above
ugcnetcse-dec2013-paper2 programming-in-c

Answer key ☟

39.21.3 Programming In C: UGC NET CSE | December 2013 | Part 2 | Question: 17

Which of the following has compilation error in C?

A. int n=32 ; B. char ch=65 ;
C. float f=(float) 3.2 ; D. none of the above
ugcnetcse-dec2013-paper2 programming-in-c

Answer key ☟

39.21.4 Programming In C: UGC NET CSE | December 2014 | Part 2 | Question: 11

What will be the output of the following code ?

main ()
{ int x = 128;
printf ("\n%d", 1+x++);
}

A. B. C. D.
ugcnetcse-dec2014-paper2 programming-in-c

Answer key ☟

39.21.5 Programming In C: UGC NET CSE | July 2016 | Part 2 | Question: 11

Given i=0, j=1, k=-1, x=0.5, y=0.0, what is the output of the following expression in C language?
x*y<i+j k

A. -1 B. 0 C. 1 D. 2
ugcnetcse-july2016-paper2 programming-in-c
 Answer key ☟

39.21.6 Programming In C: UGC NET CSE | July 2016 | Part 2 | Question: 12

The following statement in C : int (*f())[ ]; declares

A. a function returning a pointer to an array of integers

B. a function returning an array of pointers to integers
C. array of functions returning pointers to integers
D. an illegal statement

ugcnetcse-july2016-paper2 programming-in-c

Answer key ☟

39.21.7 Programming In C: UGC NET CSE | June 2013 | Part 3 | Question: 33

Refer the points as listed below:

i. What are the operator precedence rules?

ii. What are the operator associativity rules?
iii. What is the order of operand evaluation?
iv. Are these restrictions on operand evaluations side effects?

Which of the above must be considered as primary design issues for arithmetic expressions?

A. B.
C. D.
ugcnetcse-june2013-paper3 programming-in-c

Answer key ☟

39.21.8 Programming In C: UGC NET CSE | June 2013 | Part 3 | Question: 52

Match the following

A. B.
C. D.
ugcnetcse-june2013-paper3 programming-in-c

Answer key ☟

39.21.9 Programming In C: UGC NET CSE | June 2014 | Part 2 | Question: 42

When we pass an array as an argument to a function, what actually gets passed ?

A. Address of the array B. Values of the elements of the array
C. Base address of the array D. Number of elements of the array
ugcnetcse-june2014-paper2 programming programming-in-c

Answer key ☟

39.21.10 Programming In C: UGC NET CSE | June 2014 | Part 2 | Question: 43

While (87) printf(“computer”); The above statement will

A. print “computer” times B. print “computer” times
C. print “computer” times D. print “computer” infinite times
 ugcnetcse-june2014-paper2 programming-in-c

Answer key ☟

39.21.11 Programming In C: UGC NET CSE | June 2014 | Part 3 | Question: 11

Match the following with respect to the jump statements

A. B.
C. D.
ugcnetjune2014iii programming programming-in-c

Answer key ☟

39.21.12 Programming In C: UGC NET CSE | June 2019 | Part 2 | Question: 22

Consider the following C-code fragment running on a -bit machine:

typedef struct {
union {
unsigned char a;
unsigned short b;
} U;
unsigned char c;
}S;

S B[10];
S*p=&B[4];
S*q=&B[5];
p → U.b=0x1234;
/* structure S takes 32-bits */

If M is the value of and is the value of , then is

A. B. C. D.
ugcnetcse-june2019-paper2 programming-in-c

Answer key ☟

39.21.13 Programming In C: UGC NET CSE | Junet 2015 | Part 2 | Question: 13

Given that the value of is:

A. B. C. D.
ugcnetcse-june2015-paper2 programming-in-c

Answer key ☟

39.21.14 Programming In C: UGC NET CSE | September 2013 | Part 2 | Question: 35

Assume that and are non-zero positive integers. What does the following program segment perform?
while (x!=0)
{
if(x>y)
x=x-y;
else y=y-x;
printf(“%d”, x)
}

A. Computes LCM of two numbers B. Computes GCD of two numbers

 C. Divides large number with small number D. Subtracts smaller number from larger number
ugcnetsep2013ii programming-in-c

Answer key ☟

39.21.15 Programming In C: UGC NET CSE | September 2013 | Part 3 | Question: 54

A program contains the following declarations and initial assignments.

int i=8, j=5;
double x =0.005, y=-0.1;
char c=’c’, d=’d’;
Determine the value of the following expressions which involve the use of library functions:
abs(1-2*j); log(exp(x)); toupper(d)

A. 2; 0.005; D B. 1; 0.005; D C. 2; 0.005; E D. 1; 0.005; e

ugcnetcse-sep2013-paper3 programming-in-c

Answer key ☟

39.22 Pseudocode (1)

39.22.1 Pseudocode: UGC NET CSE | June 2019 | Part 2 | Question: 21

Consider the following pseudo-code fragment in which an invariant for the loop is “ and ”
(here, and are integer variable that have been initialized):
/* Pre-conditions : */
/* Assume that overflow never occurs */
int ; int ; int ;
while {
if (k is odd) then ;
;
; /* floor */
}
Which of the following must be true ar the end of the while loop?

A. B. C. D.
ugcnetcse-june2019-paper2 pseudocode

Answer key ☟

39.23 Row Major Address Calculation (1)

39.23.1 Row Major Address Calculation: UGC NET CSE | December 2014 | Part 2 | Question: 24

Consider an array , assume words per memory cell and the base address of array is . What is the
address of ? Assume row major storage.

A. B. C. D.
ugcnetcse-dec2014-paper2 array row-major-address-calculation

Answer key ☟

39.24 Storage Classes In C (2)

39.24.1 Storage Classes In C: UGC NET CSE | June 2009 | Part 2 | Question: 16

Which of the following does not represent a valid storage class in ’c’?
 A. automatic B. static
C. union D. extern
ugcnetcse-june2009-paper2 programming-in-c storage-classes-in-c

Answer key ☟

39.24.2 Storage Classes In C: UGC NET CSE | June 2014 | Part 2 | Question: 41

Match the following

A. B.
C. D.
ugcnetcse-june2014-paper2 programming-in-c storage-classes-in-c

Answer key ☟

39.25 Tree Traversal (1)

39.25.1 Tree Traversal: UGC NET CSE | Junet 2015 | Part 2 | Question: 23

Level order Traversal of a rooted Tree can be done by starting from root and performing:
A. Breadth First Search B. Depth First Search
C. Root Search D. Deep Search
ugcnetcse-june2015-paper2 data-structures tree-traversal

Answer key ☟

39.26 Undefined Behaviour (1)

39.26.1 Undefined Behaviour: UGC NET CSE | June 2009 | Part 2 | Question: 15

What is the value of after the execution of the following code statements :

A.
B.
C.
D. None

ugcnetcse-june2009-paper2 programming-in-c undefined-behaviour bad-question

Answer key ☟

39.27 Union (1)

39.27.1 Union: UGC NET CSE | July 2018 | Part 2 | Question: 4

What is the output of the following ‘C’ program? (Assuming little – endian representation of multi-byte data in
which Least Significant Byte (LSB) is stored at the lowest memory address.)
 #include<stdio.h>
#include<stdlib.h>
/* Assume short int occupies two bytes of storage */
int main ()
{
union saving
{
short int one;
char two[2];
};
union saving m;
m.two [0] =5;
m.two [1] =2;
printf(“%d, %d, %d\n”, m.two[0], m.two[1], m.one);
}/* end of main */

A. 5, 2, 1282 B. 5, 2, 52 C. 5, 2, 25 D. 5, 2, 517
ugcnetcse-july2018-paper2 programming-in-c union

Answer key ☟

39.28 Variable Scope (4)

39.28.1 Variable Scope: UGC NET CSE | December 2008 | Part 2 | Question: 25

Which one of the following describes correctly a static variable?

A. It cannot be initialized
B. It is initialized once at the commencement of execution and cannot be changed at run time
C. It retains its value during the life of the program
D. None of the above

ugcnetcse-dec2008-paper2 programming-in-c variable-scope

Answer key ☟

39.28.2 Variable Scope: UGC NET CSE | June 2005 | Part 2 | Question: 11

After calls of the function bug ( ) below, the values of and will be :
int j = 1;
bug ()
{
static int i = 0; int j = 0;
i++; j++;
return (i);
}

A. B. C. D.
ugcnetcse-june2005-paper2 programming-in-c variable-scope

Answer key ☟

39.28.3 Variable Scope: UGC NET CSE | June 2005 | Part 2 | Question: 12

Find the output of the following code :

Main()
{ int x=20, y=35;
x=y++ + x++;
y=++y + ++x;
printf (“%d, %d\n”, x, y);
}

A. B. C. D.
ugcnetcse-june2005-paper2 programming-in-c variable-scope
 Answer key ☟

39.28.4 Variable Scope: UGC NET CSE | June 2005 | Part 2 | Question: 15

Main()
{ char *str="abcde";
printf("%c",*str);
printf("%c",*str++);
printf("%c",*(str++));
printf("%s",str);
}

The output of the above code will be :

A. B.
C. D. None of these
ugcnetcse-june2005-paper2 programming-in-c variable-scope

Answer key ☟

Answer Keys
39.0.1 B 39.0.2 A 39.0.3 C 39.0.4 A 39.0.5 C
39.0.6 X 39.0.7 C 39.0.8 B 39.0.9 C 39.0.10 A
39.0.11 A 39.0.12 D 39.0.13 A 39.0.14 D 39.0.15 C
39.0.16 D 39.0.17 Q-Q 39.0.18 Q-Q 39.0.19 C 39.0.20 Q-Q
39.0.21 A 39.0.22 Q-Q 39.0.23 Q-Q 39.0.24 Q-Q 39.0.25 Q-Q
39.0.26 Q-Q 39.1.1 Q-Q 39.2.1 A 39.2.2 D 39.2.3 C
39.3.1 C 39.4.1 B 39.5.1 Q-Q 39.5.2 Q-Q 39.6.1 D
39.7.1 D 39.8.1 A 39.9.1 Q-Q 39.10.1 D 39.11.1 C
39.12.1 Q-Q 39.13.1 B 39.13.2 Q-Q 39.13.3 C 39.13.4 A
39.14.1 C 39.15.1 Q-Q 39.16.1 B 39.16.2 B 39.16.3 B
39.16.4 B 39.17.1 Q-Q 39.17.2 Q-Q 39.17.3 Q-Q 39.18.1 Q-Q
39.19.1 Q-Q 39.20.1 X 39.20.2 Q-Q 39.21.1 Q-Q 39.21.2 B
39.21.3 D 39.21.4 B 39.21.5 C 39.21.6 A 39.21.7 D
39.21.8 A 39.21.9 C 39.21.10 D 39.21.11 A 39.21.12 C
39.21.13 A 39.21.14 B 39.21.15 A 39.22.1 B 39.23.1 A
39.24.1 Q-Q 39.24.2 B 39.25.1 A 39.26.1 Q-Q 39.27.1 Q-Q
39.28.1 Q-Q 39.28.2 Q-Q 39.28.3 Q-Q 39.28.4 Q-Q
40 Theory of Computation (143)

40.0.1 UGC NET CSE | December 2015 | Part 3 | Question: 27

There are exactly ____ different finite automata with three states , and over the alphabet where is
always the start state

A. B. C. D.
ugcnetcse-dec2015-paper3 theory-of-computation

Answer key ☟

40.0.2 UGC NET CSE | September 2013 | Part 2 | Question: 18

The number of 8-bit strings beginning with either 111 or 101 is

A. 64 B. 128 C. 265 D. None of the above

theory-of-computation ugcnetsep2013ii

Answer key ☟

40.0.3 UGC NET CSE | December 2012 | Part 3 | Question: 57

Given the following statements:

I. Recursive enumerable sets are closed under complementation.

II. Recursive sets are closed under complementation.

Which is/are the correct statement?

A. only I B. only II C. both I and II D. neither I nor II

theory-of-computation ugcnetcse-dec2012-paper3

Answer key ☟

40.0.4 UGC NET CSE | December 2012 | Part 3 | Question: 45

Which of the following regular expression identifies are true?

A. (r+s)*=r*s* B. (r+s)*=r*+s* C. (r+s)*=(r*s*)* D. r*s*=r*+s*

theory-of-computation ugcnetcse-dec2012-paper3

Answer key ☟

40.0.5 UGC NET CSE | June 2012 | Part 3 | Question: 25, UGCNET-Dec2013-III: 42

Which is not the correct statement(s)?

I. Every context sensitive language is recursive

II. There is a recursive language that is not context sensitive
A. I is true II is false B. I is true and II is true
C. I is false II is false D. I is false and II is true
ugcnetcse-june2012-paper3 ugcnetcse-dec2013-paper3 theory-of-computation

Answer key ☟

40.0.6 UGC NET CSE | June 2012 | Part 3 | Question: 52

Match the following :

 A. B.
C. D.
ugcnetcse-june2012-paper3 theory-of-computation

Answer key ☟

40.0.7 UGC NET CSE | December 2012 | Part 2 | Question: 7

The ‘C’ language is

A. Context free language B. Context sensitive language
C. Regular language D. None of the above
ugcnetcse-dec2012-paper2 theory-of-computation

Answer key ☟

40.0.8 UGC NET CSE | December 2012 | Part 3 | Question: 50

Which of the following definitions generates the same Language as , where * ?

A.
B.
C.
D.

ugcnetcse-dec2012-paper3 theory-of-computation

Answer key ☟

40.0.9 UGC NET CSE | June 2013 | Part 2 | Question: 24

Given a Non-deterministic Finite Automaton (NFA) with states and as initial and final states respectively and
transition table as given below

The minimum number of states required in Deterministic Finite Automaton (DFA) equivalent to NFA is

A. B. C. D.
ugcnetcse-june2013-paper2 theory-of-computation

Answer key ☟

40.0.10 UGC NET CSE | June 2013 | Part 3 | Question: 36

The grammar with production rules generates language given by:

A.
B.
C.
D.
 ugcnetcse-june2013-paper3 theory-of-computation

Answer key ☟

40.0.11 UGC NET CSE | June 2013 | Part 3 | Question: 39

Match the following :

Codes:
A. B.
C. D.
ugcnetcse-june2013-paper3 theory-of-computation match-the-following easy

Answer key ☟

40.0.12 UGC NET CSE | June 2013 | Part 3 | Question: 40

The statements s1 and s2 are given as:

s1: Context sensitive languages are closed under intersection, concatenation, substitution and inverse
homomorphism.
s2: Context sensitive languages are closed under concatenation, substitution and homomorphism.
Which of the following is correct statement?
A. Both s1 and s2 are correct B. s1 is correct s2 is not correct
C. s1 is not correct s2 is correct D. Both s1 and s2 are not correct
ugcnetcse-june2013-paper3 theory-of-computation

Answer key ☟

40.0.13 UGC NET CSE | December 2013 | Part 3 | Question: 21

Given the following statements:

are not equivalent.
are equivalent.
A. is correct and is not correct B. Both ad are correct
C. is not correct and is correct D. Both ad are not correct
ugcnetcse-dec2013-paper3 theory-of-computation

Answer key ☟

40.0.14 UGC NET CSE | December 2013 | Part 3 | Question: 41

The Greibach normal form grammar for the language is

A. B.
C. D.
ugcnetcse-dec2013-paper3 theory-of-computation

Answer key ☟

40.0.15 UGC NET CSE | Junet 2015 | Part 3 | Question: 63

Given the following grammars:

:
 Which of the following is correct?

A. is ambiguous and is unambiguous grammars

B. is unambiguous and is ambiguous grammars
C. both and are ambiguous grammars
D. both and are unambiguous grammars

ugcnetcse-june2015-paper3 theory-of-computation compiler-design

Answer key ☟

40.0.16 UGC NET CSE | December 2015 | Part 3 | Question: 73

Consider Language defined over the alphabet as

The expression means the floor of , or what you get by rounding down to the nearest integer.
Which of the following is not an example of a string in ?

A. B. C. D.
ugcnetcse-dec2015-paper3 theory-of-computation

Answer key ☟

40.0.17 UGC NET CSE | December 2014 | Part 3 | Question: 63

According to pumping lemma for context free languages :

Let be an infinite context free language, then there exists some positive integer m such that any with
can be decomposed as

A. With such that for all

B. With , and , such that for all
C. With , and , such that for all
D. With , and , such that for all

ugcnetcse-dec2014-paper3 theory-of-computation

Answer key ☟

40.0.18 UGC NET CSE | December 2015 | Part 2 | Question: 15

In general, in a recursive and non-recursive implementation of a problem (program):

A. Both time and space complexities are better in recursive than in non-recursive program
B. Both time and space complexities are better in non-recursive than in recursive program
C. Time complexity is better in recursive version but space complexity is better in non-recursive version of a program
D. Space complexity is better in recursive version but time complexity is better in non-recursive version of a program

ugcnetcse-dec2015-paper2 theory-of-computation

Answer key ☟

40.0.19 UGC NET CSE | December 2015 | Part 3 | Question: 23

Match the following

 A. B.
C. D.
ugcnetcse-dec2015-paper3 theory-of-computation match-the-following

Answer key ☟

40.0.20 UGC NET CSE | June 2009 | Part 2 | Question: 35

Any syntactic construct that can be described by a regular expression can also be described by a :
A. Context sensitive grammar B. Non context free grammar
C. Context free grammar D. None of the above
ugcnetcse-june2009-paper2

Answer key ☟

40.0.21 UGC NET CSE | July 2018 | Part 2 | Question: 35

To obtain a string of n Terminals from a given Chomsky normal from grammar, the number of productions to be
used is

A. B. C. D.
ugcnetcse-july2018-paper2 theory-of-computation conjunctive-normal-form

Answer key ☟

40.0.22 UGC NET CSE | December 2018 | Part 2 | Question: 35

Consider the following languages:

Which of the following is correct ?

A. Only is context free language B. Only is context free language

C. Both and are context free languages D. Both and are not context free languages
ugcnetcse-dec2018-paper2 theory-of-computation

Answer key ☟

40.0.23 UGC NET CSE | December 2018 | Part 2 | Question: 34

Consider the following two languages :

Which one of the following is correct ?

A. Only is regular language B. Only is regular language

C. Both and are regular languages D. Both and are not regular languages
 ugcnetcse-dec2018-paper2 theory-of-computation

Answer key ☟

40.0.24 UGC NET CSE | December 2004 | Part 2 | Question: 3

The context-free languages are closed for :

i. Intersection
ii. Union
iii. Complementation
iv. Kleene Star

A. (i) and (iv) B. (i) and (iii) C. (ii) and (iv) D. (ii) and (iii)
ugcnetcse-dec2004-paper2

Answer key ☟

40.0.25 UGC NET CSE | December 2006 | Part 2 | Question: 1

Which of the regular expressions corresponds to this grammar ?

A. B. C. D.

ugcnetcse-dec2006-paper2

Answer key ☟

40.0.26 UGC NET CSE | December 2007 | Part 2 | Question: 5

Consider a Moore machine whose digraph is :

Then , the language accepted by the machine M, is the set of all strings having :
A. two or more b’s B. three or more b’s
C. two or more a’s D. three or more a’s
ugcnetcse-dec2007-paper2

Answer key ☟

40.0.27 UGC NET CSE | December 2007 | Part 2 | Question: 3

A context free grammar is :

A. type B. type C. type D. type

ugcnetcse-dec2007-paper2

Answer key ☟

40.1 Closure Property (3)

40.1.1 Closure Property: UGC NET CSE | December 2012 | Part 3 | Question: 38

Which is not the correct statement?

 A. The class of regular sets is closed under homomorphisms
B. The class of regular sets is not closed under inverse homomorphisms
C. The class of regular sets is closed under quotient
D. The class of regular sets is closed under substitution

ugcnetcse-dec2012-paper3 theory-of-computation closure-property

Answer key ☟

40.1.2 Closure Property: UGC NET CSE | January 2017 | Part 3 | Question: 21

Given the following statements:

i. A class of languages that is closed under union and complementation has to be closed under intersection
ii. A class of languages that is closed under union and intersection has to be closed under complementation

Which of the following options is correct?

A. Both (i) and (ii) are false B. Both (i) and (ii) are true
C. (i) is true, (ii) is false D. (i) is false, (ii) is true
ugcnetcse-jan2017-paper3 theory-of-computation regular-language closure-property

Answer key ☟

40.1.3 Closure Property: UGC NET CSE | June 2012 | Part 2 | Question: 40

Consider the following statements:

I. Recursive languages are closed under complementation

II. Recursively enumerable languages are closed under union
III. Recursively enumerable languages are closed under complementation

Which of the above statements are true?

A. I only B. I and II C. I and III D. II and III

theory-of-computation closure-property ugcnetcse-june2012-paper2

Answer key ☟

40.2 Complement (1)

40.2.1 Complement: UGC NET CSE | August 2016 | Part 3 | Question: 23

Let and language . Then, the complement of is

A.
B.
C.
D.

ugcnetcse-aug2016-paper3 theory-of-computation complement

Answer key ☟

40.3 Context Free Grammar (9)

40.3.1 Context Free Grammar: UGC NET CSE | August 2016 | Part 3 | Question: 57

Let be a context-free grammar such that every one of its productions is of the form ,
with . The derivation tree for any string has a height such that

A. B.

C. D.
 ugcnetcse-aug2016-paper3 theory-of-computation context-free-grammar

40.3.2 Context Free Grammar: UGC NET CSE | December 2005 | Part 2 | Question: 4

Which sentence can be generated by :

A. B. C. D.
ugcnetcse-dec2005-paper2 theory-of-computation context-free-grammar grammar

Answer key ☟

40.3.3 Context Free Grammar: UGC NET CSE | December 2009 | Part 2 | Question: 34

Contex-free Grammar (CFG) can be recognized by

(A) Finite state automata

(B) 2-way linear bounded automata
(C) push down automata
(D) both (B) and (C)
ugcnetcse-dec2009-paper2 theory-of-computation context-free-grammar

Answer key ☟

40.3.4 Context Free Grammar: UGC NET CSE | December 2013 | Part 2 | Question: 27

The context free grammar for the language:

is

A.
B.
C.
D.

ugcnetcse-dec2013-paper2 theory-of-computation context-free-grammar

Answer key ☟

40.3.5 Context Free Grammar: UGC NET CSE | December 2014 | Part 2 | Question: 35

The following Context-Free Grammar (CFG) :

will generate

A. Odd numbers of and odd numbers of B. Even numbers of and even numbers of
C. Equal numbers of and D. Different numbers of and
ugcnetcse-dec2014-paper2 theory-of-computation context-free-grammar

Answer key ☟

40.3.6 Context Free Grammar: UGC NET CSE | January 2017 | Part 3 | Question: 22

Let be a context-free grammer such that every one of its productions is of the form ,
with . The derivation tree for any has a height such that

A.

B.
 C.

D.

ugcnetcse-jan2017-paper3 context-free-grammar theory-of-computation

Answer key ☟

40.3.7 Context Free Grammar: UGC NET CSE | June 2012 | Part 3 | Question: 28

Which one of the following is not a Greibach Normal form grammar?

(i)

(ii)

(iii)

A. (i) and (ii) B. (i) and (iii) C. (ii) and (iii) D. (i), (ii) and (iii)
ugcnetcse-june2012-paper3 theory-of-computation context-free-grammar

Answer key ☟

40.3.8 Context Free Grammar: UGC NET CSE | June 2013 | Part 3 | Question: 38

For every context free grammar (G) there exists an algorithm that passes any in number of steps
proportional to
A. B.
C. D.
ugcnetcse-june2013-paper3 theory-of-computation context-free-grammar

Answer key ☟

40.3.9 Context Free Grammar: UGC NET CSE | Junet 2015 | Part 3 | Question: 61

A context free grammar for is given by:

A.
B.
C.
D.

ugcnetcse-june2015-paper3 theory-of-computation context-free-grammar

Answer key ☟

40.4 Context Free Language (8)

40.4.1 Context Free Language: UGC NET CSE | December 2011 | Part 2 | Question: 38

Which one of the following statement is false ?

 A. Context-free languages are closed under union.
B. Context-free languages are closed under concatenation.
C. Context-free languages are closed under intersection.
D. Context-free languages are closed under Kleene closure.

ugcnetcse-dec2011-paper2 theory-of-computation context-free-language

Answer key ☟

40.4.2 Context Free Language: UGC NET CSE | December 2018 | Part 2 | Question: 36

Consider to be any regular language and , be any two context-free languages. Which of the following is
correct?

A. is context free B. is context free

C. is context free D. is context free
ugcnetcse-dec2018-paper2 context-free-language theory-of-computation

Answer key ☟

40.4.3 Context Free Language: UGC NET CSE | January 2017 | Part 3 | Question: 23

Given the following two languages:

Which of the following options is correct?

A. Both and are not context free language

B. Both and are context free language
C. is context free language, is not context free language
D. is not context free language, is context free language

ugcnetcse-jan2017-paper3 theory-of-computation context-free-language

Answer key ☟

40.4.4 Context Free Language: UGC NET CSE | July 2016 | Part 3 | Question: 56

Let be a context free language. Which of the following is correct?

A. is context free and is not context free for any

B. is not context free and is context free for any
C. Both and for any are context free
D. Both and for any are not context free

ugcnetcse-july2016-paper3 context-free-language

Answer key ☟

40.4.5 Context Free Language: UGC NET CSE | June 2012 | Part 3 | Question: 39

The following CFG generates strings of terminals that have

A. odd number of a’s and odd number of b’s B. even number of a’s and even number of b’s
C. equal number of a’s and b’s D. not equal number of a’s and b’s
ugcnetcse-june2012-paper3 theory-of-computation context-free-language

Answer key ☟
 40.4.6 Context Free Language: UGC NET CSE | June 2014 | Part 2 | Question: 09

The context free grammar for the language is

A.
B.
C.
D.

ugcnetcse-june2014-paper2 theory-of-computation context-free-language

Answer key ☟

40.4.7 Context Free Language: UGC NET CSE | June 2019 | Part 2 | Question: 77

How can the decision algorithm be constructed for deciding whether context-free language is finite?

i. By constructing redundant CFG G in CNF generating language

ii. By constructing non-redundant CFG G in CNF generating language
iii. By constructing non-redundant CFG G in CNF generating language ( stands for null)

Which of the following is correct?

A. i only B. ii only C. iii only D. None of i, ii and iii

ugcnetcse-june2019-paper2 context-free-language

Answer key ☟

40.4.8 Context Free Language: UGC NET CSE | October 2020 | Part 2 | Question: 29

Which of the following statements is true?

A. The union of two context free languages is context free

B. The intersection of two context free languages is context free
C. The complement of a context free language is context free
D. If a language is context free, it can always be accepted by a deterministic pushdown automaton

ugcnetcse-oct2020-paper2 theory-of-computation context-free-language

Answer key ☟

40.5 Context Sensitive (2)

40.5.1 Context Sensitive: UGC NET CSE | December 2015 | Part 3 | Question: 22

The family of context sensitive languages is _____ under union and ____ under reversal
A. closed, not closed B. not closed, not closed
C. closed, closed D. not closed, closed
ugcnetcse-dec2015-paper3 theory-of-computation closure-property context-sensitive

Answer key ☟

40.5.2 Context Sensitive: UGC NET CSE | July 2018 | Part 2 | Question: 37

Context sensitive language can be recognized by a

A. Finite state machine B. Deterministic finite automata
C. Non-deterministic finite automata D. Linear bounded automata
ugcnetcse-july2018-paper2 theory-of-computation context-sensitive

Answer key ☟

40.6 Decidability (5)

40.6.1 Decidability: UGC NET CSE | December 2018 | Part 2 | Question: 37

Consider the following problems :

A. Whether a finite state automaton halts on all inputs?

B. Whether a given context free language is regular?
C. Whether a Turing machine computes the product of two numbers?

Which one of the following is correct?

A. Only i and iii are undecidable problems

B. Only ii and iii are undecidable problems
C. Only i and ii are undecidable problems
D. i, ii and iii are undecidable problems

ugcnetcse-dec2018-paper2 decidability theory-of-computation

Answer key ☟

40.6.2 Decidability: UGC NET CSE | June 2019 | Part 2 | Question: 79

Which of the following problems is/are decidable problem(s) (recursively enumerable) on turing machine ?

i. is a CFG with
ii. There exist two TMs and such that language of all TMs​​.
iii. is a TM that accepts using at most cells of tape

A. i and ii only B. i only C. i, ii and iii D. iii only

ugcnetcse-june2019-paper2 decidability turing-machine

Answer key ☟

40.6.3 Decidability: UGC NET CSE | November 2017 | Part 3 | Question: 22

Which of the following problems is undecidable?

A. To determine if two finite automata are equivalent

B. Membership problem for context free grammar
C. Finiteness problem for finite automata
D. Ambiguity problem for context free grammar

ugcnetcse-nov2017-paper3 theory-of-computation decidability

Answer key ☟

40.6.4 Decidability: UGC NET CSE | October 2020 | Part 2 | Question: 55

Let and be arbitrary context free languages and an arbitrary regular language. Consider the following
problems:

i. Is ?
ii. Is ?
iii. Is ?

Which of the problems are undecidable?

Choose the correct answer from the options given below:

A. only B. only C. and only D. , and

ugcnetcse-oct2020-paper2 theory-of-computation decidability

Answer key ☟
 40.6.5 Decidability: UGC NET CSE | October 2020 | Part 2 | Question: 87

Given below are two statements:

Statement : The problem “Is ?” is undecidable for context sensitive languages and
Statement : The problem “Is ?” is decidable for context sensitive language . (where is a string).
In the light of the above statements, choose the correct answer from the options given below

A. Both Statement and Statement are true

B. Both Statement and Statement are false
C. Statement is correct but Statement is false
D. Statement is incorrect but Statement is true

ugcnetcse-oct2020-paper2 theory-of-computation decidability

Answer key ☟

40.7 Expression (1)

40.7.1 Expression: UGC NET CSE | December 2015 | Part 3 | Question: 26

The context free grammar given by

generates the language which is defined by regular expression:

A. B.
C. D.
theory-of-computation regular-expression finite-automata expression ugcnetcse-dec2015-paper3

Answer key ☟

40.8 Finite Automata (10)

40.8.1 Finite Automata: UGC NET CSE | December 2012 | Part 2 | Question: 44

Let L be set accepted by a non-deterministic finite automaton. The number of states in non-deterministic finite
automaton is . The maximum number of states in equivalent finite automaton that accepts L is
A. B.
C. D.
ugcnetcse-dec2012-paper2 theory-of-computation finite-automata

Answer key ☟

40.8.2 Finite Automata: UGC NET CSE | December 2012 | Part 3 | Question: 47

The minimum number of states of the non-deterministic finite automaton which accepts the language
is

A. 3 B. 4 C. 5 D. 6
ugcnetcse-dec2012-paper3 theory-of-computation finite-automata

Answer key ☟

40.8.3 Finite Automata: UGC NET CSE | December 2018 | Part 2 | Question: 32

Consider the language given by

The minimum number of states of finite automaton which accepts the language is
 A. B. C. D.
ugcnetcse-dec2018-paper2 theory-of-computation finite-automata

Answer key ☟

40.8.4 Finite Automata: UGC NET CSE | July 2018 | Part 2 | Question: 31

Two finite state machines are said to be equivalent if they:

A. Have the same number of edges B. Have the same number of states
C. Recognize the same set of tokens D. Have the same number of states and edges
ugcnetcse-july2018-paper2 theory-of-computation finite-automata

Answer key ☟

40.8.5 Finite Automata: UGC NET CSE | July 2018 | Part 2 | Question: 32

The finite state machine given in figure below recognizes:

A. any string of odd number of a's

B. any string of odd number of b's
C. any string of even number of a's and odd number of b's
D. any string of odd number of a's and odd number of b's

ugcnetcse-july2018-paper2 theory-of-computation finite-automata

Answer key ☟

40.8.6 Finite Automata: UGC NET CSE | June 2012 | Part 3 | Question: 16

Given the following statements:

I. The power of deterministic finite state machine and non- deterministic finite state machine are same.
II. The power of deterministic pushdown automaton and non- deterministic pushdown automaton are same.

Which of the above is the correct statement(s)?

A. Both I and II B. Only I C. Only II D. Neither I nor II

ugcnetcse-june2012-paper3 theory-of-computation finite-automata

Answer key ☟

40.8.7 Finite Automata: UGC NET CSE | Junet 2015 | Part 3 | Question: 19

Minimal deterministic finite automaton for the language will have:

A. 1 final state among 5 states B. 4 final states among 5 states

C. 1 final state among 6 states D. 5 final state among 6 states
ugcnetcse-june2015-paper3 theory-of-computation finite-automata

Answer key ☟
 40.8.8 Finite Automata: UGC NET CSE | Junet 2015 | Part 3 | Question: 21

The transition function for the language is given by:

;
;
;
;
The initial and final states of the automata are
A. and respectively B. and respectively
C. and respectively D. and respectively
ugcnetcse-june2015-paper3 theory-of-computation finite-automata

Answer key ☟

40.8.9 Finite Automata: UGC NET CSE | November 2017 | Part 3 | Question: 23

Finite state machine can recognize language generated by _________

A. Only context free grammar B. Only context sensitive grammar
C. Only regular grammar D. Any unambiguous grammar
ugcnetcse-nov2017-paper3 theory-of-computation finite-automata

Answer key ☟

40.8.10 Finite Automata: UGC NET CSE | September 2013 | Part 2 | Question: 13

The number of states in a minimal deterministic finite automaton corresponding to the language
is

A. 3 B. 4 C. 5 D. 6
ugcnetsep2013ii theory-of-computation finite-automata

Answer key ☟

40.9 Grammar (15)

40.9.1 Grammar: UGC NET CSE | August 2016 | Part 2 | Question: 35

Which of the following is FALSE ?

A. The grammar , where is the only non-terminal symbol, and is the null string, is ambiguous.
B. An unambiguous grammar has same left most and right most derivation.
C. An ambiguous grammar can never be for any .
D. Recursive descent parser is a top-down parser.

ugcnetcse-aug2016-paper2 theory-of-computation grammar

Answer key ☟

40.9.2 Grammar: UGC NET CSE | December 2012 | Part 3 | Question: 42

The grammar ‘GI’ and the grammar G2 is .

Which is the correct statement?
A. G1 is ambiguous, G2 is unambiguous B. G1 is unambiguous, G2 is ambiguous
C. Both G1 and G2 are ambiguous D. Both G1 and G2 are unambiguous
ugcnetcse-dec2012-paper3 theory-of-computation grammar

Answer key ☟
40.9.3 Grammar: UGC NET CSE | December 2014 | Part 3 | Question: 62

Match the following

A. B.
C. D.
ugcnetcse-dec2014-paper3 theory-of-computation grammar

Answer key ☟

40.9.4 Grammar: UGC NET CSE | July 2018 | Part 2 | Question: 36

Consider the following two Grammars:

Which one of the folloeing options is correct?

A. Only is ambiguous B. Only is ambiguous
C. Both and are ambiguous D. Both and are not ambiguous
ugcnetcse-july2018-paper2 theory-of-computation grammar

Answer key ☟

40.9.5 Grammar: UGC NET CSE | July 2018 | Part 2 | Question: 38

The set is an example of a grammar that is

A. Context sensitive B. Context free
C. Regular D. None of the above
ugcnetcse-july2018-paper2 theory-of-computation grammar

Answer key ☟

40.9.6 Grammar: UGC NET CSE | June 2012 | Part 3 | Question: 32

The equivalent grammar corresponding to the grammar is

A.
B.
C.
D.

theory-of-computation grammar context-free-language ugcnetcse-june2012-paper3

Answer key ☟

40.9.7 Grammar: UGC NET CSE | June 2013 | Part 3 | Question: 35

Which of the following is/are the fundamental semantic model(s) of parameter passing?

A. in mode B. out mode C. in-out mode D. all of the above

ugcnetcse-june2013-paper3 theory-of-computation grammar

Answer key ☟
40.9.8 Grammar: UGC NET CSE | June 2014 | Part 3 | Question: 73

Given the following two grammars :

Which statement is correct ?

A. is unambiguous and is unambiguous.

B. is unambiguous and is ambiguous.
C. is ambiguous and is unambiguous.
D. is ambiguous and is ambiguous.

ugcnetjune2014iii theory-of-computation grammar

Answer key ☟

40.9.9 Grammar: UGC NET CSE | June 2014 | Part 3 | Question: 74

Match the following

A. B.
C. D.
ugcnetjune2014iii theory-of-computation grammar

Answer key ☟

40.9.10 Grammar: UGC NET CSE | Junet 2015 | Part 2 | Question: 33

If all the production rules have single non-terminal symbol on the left side, the grammar defined is:
A. Context free grammar B. Context sensitive grammar
C. Unrestricted grammar D. Phase grammar
ugcnetcse-june2015-paper2 theory-of-computation grammar

Answer key ☟

40.9.11 Grammar: UGC NET CSE | November 2017 | Part 2 | Question: 34

Which of the following statements is/are TRUE?

i. The grammar is ambiguous. (Where is the start symbol)

ii. The grammar is ambiguous. (The special symbol represents the empty string) (Where is the
start symbol)
iii. The grammar (Where is the start symbol)
S -> T/U$
T -> x S y | xy | ϵ
U -> yT

generates a language consisting of the string .

 A. Only (i) and (ii) are TRUE. B. Only (i) and (iii) are TRUE.
C. Only (ii) and (iii) are TRUE. D. All of (i), (ii) and (iii) are TRUE.
ugcnetcse-nov2017-paper2 grammar context-free-language ambiguous

Answer key ☟

40.9.12 Grammar: UGC NET CSE | October 2020 | Part 2 | Question: 57

Which of the following grammars is(are) ambiguous?

i.
ii.
iii.

Choose the correct answer from the options given below:

A. and only B. only C. and only D. and only

ugcnetcse-oct2020-paper2 theory-of-computation grammar ambiguous

Answer key ☟

40.9.13 Grammar: UGC NET CSE | September 2013 | Part 2 | Question: 16

LL grammar for the language is

A.
B.
C.
D.

ugcnetsep2013ii theory-of-computation grammar

Answer key ☟

40.9.14 Grammar: UGC NET CSE | September 2013 | Part 2 | Question: 17

Assume the statements and given as:

: Given a context free grammar G, there exists an algorithm for determining whether L(G) is infinite.
: There exists an algorithm to determine whether two context free grammars generate the same language.
Which one of the following is true?
A. is correct and is not correct B. Both and are correct
C. Both and are not correct D. is not correct and is correct
ugcnetsep2013ii theory-of-computation grammar

Answer key ☟

40.9.15 Grammar: UGC NET CSE | September 2013 | Part 3 | Question: 18

Given the following production of a grammar:

;
;
;

Which of the following is true?

A. The language corresponding to the given grammar is a set of even number of a’s
B. The language corresponding to the given grammar is a set of odd number of a’s
 C. The language corresponding to the given grammar is a set of even number of a’s followed by odd number of b’s
D. The language corresponding to the given grammar is a set of odd number of a’s followed by even number of b’s

ugcnetcse-sep2013-paper3 theory-of-computation grammar

Answer key ☟

40.10 Identify Class Language (8)

40.10.1 Identify Class Language: UGC NET CSE | December 2015 | Part 3 | Question: 28

Given the following two languages:

Which of the following is correct?

A. is context free language and is not context free language

B. is not context free language and is context free language
C. Both and are context free languages
D. Both and are not context free languages

identify-class-language context-free-language ugcnetcse-dec2015-paper3

Answer key ☟

40.10.2 Identify Class Language: UGC NET CSE | December 2019 | Part 2 | Question: 48

Consider the following languages:

Where represents reversible operation.

Which one of the following is (are) inherently ambiguous languages(s)?

A. Only B. Only C. both and D. neither nor

ugcnetcse-dec2019-paper2 identify-class-language

Answer key ☟

40.10.3 Identify Class Language: UGC NET CSE | January 2017 | Part 3 | Question: 61

Given the following two statements:

i. is deterministic context free language, but not linear.

ii. is linear, but not deterministic context free language.

Which of the following options is correct?

A. Both (i) and (ii) are false. B. Both (i) and (ii) are true.
C. (i) is true, (ii) is false. D. (i) is false, (ii) is true.
ugcnetcse-jan2017-paper3 identify-class-language

Answer key ☟

40.10.4 Identify Class Language: UGC NET CSE | June 2014 | Part 3 | Question: 75

Given the following two languages :

Which statement is correct ?

 A. Both and are not deterministic.
B. is not deterministic and is deterministic.
C. is deterministic and is not deterministic.
D. Both and are deterministic.

ugcnetjune2014iii theory-of-computation identify-class-language

Answer key ☟

40.10.5 Identify Class Language: UGC NET CSE | October 2020 | Part 2 | Question: 71

Match with
Regular language, : Context free language
Recursive langauge, : Recursively enumerable language.

Choose the correct answer from the options given below:

A. B.
C. D.
ugcnetcse-oct2020-paper2 theory-of-computation identify-class-language

Answer key ☟

40.10.6 Identify Class Language: UGC NET CSE | September 2013 | Part 3 | Question: 19

The language accepted by the non-deterministic pushdown automaton

with transitions
;

is

A. B. C. D.
ugcnetcse-sep2013-paper3 theory-of-computation identify-class-language

Answer key ☟

40.10.7 Identify Class Language: UGC NET CSE | September 2013 | Part 3 | Question: 20

The language is
A. Context free but not linear B. Context free and linear
C. Not context free and not linear D. Not context free but linear
ugcnetcse-sep2013-paper3 theory-of-computation identify-class-language

Answer key ☟

40.10.8 Identify Class Language: UGC NET CSE | September 2013 | Part 3 | Question: 21

Assume statements and defined as:

: is recursive enumerable where and are recursive and recursive enumerable respectively.
: The set of all Turing machines is countable.
Which of the following is true?
A. is correct and is not correct B. Both and are correct
 C. Both and are not correct D. is not correct and is correct
ugcnetcse-sep2013-paper3 identify-class-language theory-of-computation

Answer key ☟

40.11 Language (1)

40.11.1 Language: UGC NET CSE | November 2017 | Part 3 | Question: 24

The language over the alphabet is

A. regular language
B. Not a deterministic context free language but a context free language
C. Recursive and is a deterministic context free language
D. Not recursive

ugcnetcse-nov2017-paper3 theory-of-computation language

Answer key ☟

40.12 Languages Classification (1)

40.12.1 Languages Classification: UGC NET CSE | June 2019 | Part 2 | Question: 76

Match with :
where Regular language
Context-free language
Recursive language
Recursively enumerable language

Choose the correct option from those given below :

A. B.
C. D.
ugcnetcse-june2019-paper2 languages-classification cfl-recusive-re

Answer key ☟

40.13 Languages Relationships (1)

40.13.1 Languages Relationships: UGC NET CSE | December 2014 | Part 3 | Question: 61

Given the recursively enumerable language , the context sensitive language , the recursive language
, the context free language and deterministic context free language . The relationship
between these families is given by

A.
B.
C.
D.

ugcnetcse-dec2014-paper3 languages-relationships

Answer key ☟

40.14 Minimal State Automata (1)

 40.14.1 Minimal State Automata: UGC NET CSE | June 2019 | Part 2 | Question: 75

How many states are there in a minimum state automata equivalent to regular expression given below?
Regular expression is

A. B. C. D.
ugcnetcse-june2019-paper2 finite-automata minimal-state-automata

Answer key ☟

40.15 Parsing (1)

40.15.1 Parsing: UGC NET CSE | December 2012 | Part 2 | Question: 35

Which of the following is the most powerful parsing method?

A. LL(I) B. Canonical LR C. SLR D. LALR

ugcnetcse-dec2012-paper2 compiler-design parsing

Answer key ☟

40.16 Pumping Lemma (3)

40.16.1 Pumping Lemma: UGC NET CSE | December 2013 | Part 3 | Question: 40

Pumping lemma for context-free languages states:

Let be an infinite context free language. Then there exists some positive integer m such that any with
can be decomposed as with ______ and ________ such that for all

A. B.
C. D.
ugcnetcse-dec2013-paper3 theory-of-computation context-free-language pumping-lemma

Answer key ☟

40.16.2 Pumping Lemma: UGC NET CSE | November 2017 | Part 3 | Question: 19

The logic of pumping lemma is an example of _________

A. Iteration B. Recursion
C. The divide and conquer principle D. The pigeon – hole principle
ugcnetcse-nov2017-paper3 theory-of-computation pumping-lemma

Answer key ☟

40.16.3 Pumping Lemma: UGC NET CSE | November 2017 | Part 3 | Question: 21

Pumping lemma for regular language is generally used for proving

A. Whether two given regular expressions are equivalent B. A given grammar is ambiguous
C. A given grammar is regular D. A given grammar is not regular
ugcnetcse-nov2017-paper3 theory-of-computation pumping-lemma

Answer key ☟

40.17 Pushdown Automata (5)

40.17.1 Pushdown Automata: UGC NET CSE | December 2014 | Part 3 | Question: 22

The pushdown automation with

 Accepts the language
A. B.
C. D.
ugcnetcse-dec2014-paper3 theory-of-computation pushdown-automata

Answer key ☟

40.17.2 Pushdown Automata: UGC NET CSE | July 2018 | Part 2 | Question: 33

A pushdown automata behaves like a Turing machine when the number of auxiliary memory is

A. 0 B. 1 C. 1 or more D. 2 or more
ugcnetcse-july2018-paper2 theory-of-computation pushdown-automata

Answer key ☟

40.17.3 Pushdown Automata: UGC NET CSE | July 2018 | Part 2 | Question: 34

Pushdown automata can recognize language generated by _______

A. Only context free grammar B. Only regular grammar

C. Context free grammar or regular grammar D. Only context sensitive grammar
ugcnetcse-july2018-paper2 theory-of-computation pushdown-automata

Answer key ☟

40.17.4 Pushdown Automata: UGC NET CSE | June 2013 | Part 3 | Question: 37

A pushdown automation is set to be deterministic subject to which of the following

condition(s), for every
(s1) contains at most one element
(s2) if is not empty then must be empty for every

A. only s1 B. only s2 C. both s1 and s2 D. neither s1 nor s2

ugcnetcse-june2013-paper3 theory-of-computation pushdown-automata

Answer key ☟

40.17.5 Pushdown Automata: UGC NET CSE | September 2013 | Part 3 | Question: 22

Non-deterministic pushdown automaton that accepts the language generated by the grammar: is

A.
B.
C.
D.

ugcnetcse-sep2013-paper3 theory-of-computation pushdown-automata

40.18 Recursive and Recursively Enumerable Languages (3)

40.18.1 Recursive and Recursively Enumerable Languages: UGC NET CSE | January 2017 | Part 3 | Question: 63

Which of the following statements is false?

A. Every context-sensitive language is recursive

B. The set of all languages that are not recursively enumerable is countable
 C. The family of recursively enumerable language is closed under union
D. The families of recursively enumerable and recursive languages are closed under reversal

ugcnetcse-jan2017-paper3 theory-of-computation recursive-and-recursively-enumerable-languages

Answer key ☟

40.18.2 Recursive and Recursively Enumerable Languages: UGC NET CSE | Junet 2015 | Part 3 | Question: 62

Given the following two statements:

: If and are recursively enumerable languages over , then and are also recursively
enumerable.
: The set of recursively enumerable languages is countable.
Which of the following is true?
A. is correct and is not correct B. is not correct and is correct
C. Both and are not correct D. Both and are correct
ugcnetcse-june2015-paper3 theory-of-computation recursive-and-recursively-enumerable-languages

Answer key ☟

40.18.3 Recursive and Recursively Enumerable Languages: UGC NET CSE | October 2020 | Part 2 | Question: 27

Consider where

Then, the language is

A. Recursively enumerable but not context free B. Regular
C. Context free but not regular D. Not recursive

ugcnetcse-oct2020-paper2 theory-of-computation recursive-and-recursively-enumerable-languages

Answer key ☟

40.19 Regular Expression (18)

40.19.1 Regular Expression: UGC NET CSE | August 2016 | Part 2 | Question: 31

The number of strings of length 4 that are generated by the regular expression , where | is an
alternation character and are quantification characters, is :

A. B. C. D.
ugcnetcse-aug2016-paper2 theory-of-computation regular-expression

Answer key ☟

40.19.2 Regular Expression: UGC NET CSE | August 2016 | Part 3 | Question: 24

Consider the following identities for regular expressions :

(a) (r + s)* = (s + r)*
(b) (r*)* = r*
(c) (r* s*)* = (r + s)*
Which of the above identities are true ?

A. (a) and (b) only B. (b) and (c) only C. (c) and (a) only D. (a), (b) and (c)
ugcnetcse-aug2016-paper3 theory-of-computation regular-expression

Answer key ☟
40.19.3 Regular Expression: UGC NET CSE | December 2005 | Part 2 | Question: 5

Regular expression denotes the set :

A. { } B. { } C. { } D. None of these
ugcnetcse-dec2005-paper2 theory-of-computation regular-expression

Answer key ☟

40.19.4 Regular Expression: UGC NET CSE | December 2014 | Part 3 | Question: 24

Regular expression for the complement of language is

A. B.
C. D. None of the above
ugcnetcse-dec2014-paper3 theory-of-computation regular-expression regular-language

Answer key ☟

40.19.5 Regular Expression: UGC NET CSE | January 2017 | Part 2 | Question: 31

Which of the following strings would match the regular expression : ?

I.
II.
III.
IV.
V.
VI.

A. I, IlI and VI only B. IV, V and VI only

C. II, IV and V only D. I, IV and V only
ugcnetjan2017ii regular-expression theory-of-computation

Answer key ☟

40.19.6 Regular Expression: UGC NET CSE | July 2016 | Part 2 | Question: 31

The number of strings of length 4 that are generated by the regular expression

, where is an alternation character, are quantification characters, and is the null string, is:

A. 08 B. 10 C. 11 D. 12
ugcnetcse-july2016-paper2 theory-of-computation regular-expression

Answer key ☟

40.19.7 Regular Expression: UGC NET CSE | July 2016 | Part 3 | Question: 23

The regular expression for the complement of the language is:

A.
B.
C.
D.

ugcnetcse-july2016-paper3 theory-of-computation regular-expression

Answer key ☟
40.19.8 Regular Expression: UGC NET CSE | July 2016 | Part 3 | Question: 24

Consider the following two languages:

is any subset of 0*
Which of the following is correct?
A. is regular and is not regular B. is not regular and is regular
C. Both and are regular languages D. Both and are not regular languages
ugcnetcse-july2016-paper3 regular-language regular-expression

Answer key ☟

40.19.9 Regular Expression: UGC NET CSE | July 2016 | Part 3 | Question: 55

Let L be the language generated by regular expression 0*10* and accepted by the deterministic finite automata
M. Consider the relation defined by M as all states that are reachable from the start state. has ___
equivalence classes.

A. 2 B. 4 C. 5 D. 6
ugcnetcse-july2016-paper3 theory-of-computation regular-expression regular-language

Answer key ☟

40.19.10 Regular Expression: UGC NET CSE | June 2010 | Part 2 | Question: 3

"My Laughter Machine (MLM) recognizes the following strings :

(i)
(ii)
(iii)
(iv)
Using this as an information, how would you compare the following regular expressions ?
(i)
(ii)
(iii)
A. and are same, is different. B. and are not same.
C. and are different. D. and are same.
ugcnetcse-june2010-paper2 theory-of-computation regular-expression

Answer key ☟

40.19.11 Regular Expression: UGC NET CSE | June 2012 | Part 3 | Question: 35

Consider the regular expression (a+b)(a+b) ..... (a+b) (n-times). The minimum number of states in finite
automaton that recognizes the language represented by this regular expression contains

A. n states B. n+1 states C. n+2 states D. 2 states

ugcnetcse-june2012-paper3 theory-of-computation regular-expression

Answer key ☟

40.19.12 Regular Expression: UGC NET CSE | June 2012 | Part 3 | Question: 43

The regular expression for the following DFA

 A. ab*(b+aa*b)* B. a*b(b+aa*b)* C. a*b(b*+aa*b) D. a*b(b+aa*b)*
ugcnetcse-june2012-paper3 theory-of-computation regular-expression

Answer key ☟

40.19.13 Regular Expression: UGC NET CSE | Junet 2015 | Part 3 | Question: 20

The regular expression corresponding to the language L where

is
A. (1+01)* (10+01) B. (1+01)* 01
C. (1+01)* (1+01) D. (10+01)* 01
ugcnetcse-june2015-paper3 theory-of-computation regular-expression

Answer key ☟

40.19.14 Regular Expression: UGC NET CSE | November 2017 | Part 2 | Question: 33

Which of the following regular expressions, each describing a language of binary numbers (MSB to LSB) that
represents non-negative decimal values, does not include even values?
A. B.
C. D.
Where are quantification characters.

ugcnetcse-nov2017-paper2 regular-expression regular-language

Answer key ☟

40.19.15 Regular Expression: UGC NET CSE | October 2020 | Part 2 | Question: 28

Let and be languages over represented by the regular expressions and

respectively.
Which of the following is true with respect to the two languages?
A. B.
C. D.
ugcnetcse-oct2020-paper2 theory-of-computation regular-expression

Answer key ☟

40.19.16 Regular Expression: UGC NET CSE | October 2020 | Part 2 | Question: 79

Consider the following regular expressions:

i.
ii.
iii.

Choose the correct answer from the options given below based on the relation between the languages generated by the
regular expressions above:
A. B.
C. D.
ugcnetcse-oct2020-paper2 theory-of-computation regular-expression

Answer key ☟

40.19.17 Regular Expression: UGC NET CSE | September 2013 | Part 2 | Question: 14

Regular expression for the language has no pair of consecutive zeros is

A. B.
C. D.
ugcnetsep2013ii theory-of-computation regular-expression
 Answer key ☟

40.19.18 Regular Expression: UGC NET CSE | September 2013 | Part 2 | Question: 15

Consider the following two languages:

Which one of the following is true?

A. is regular language and is not regular language

B. Both and are regular language
C. Both and are not regular language
D. is not regular language and is regular language

ugcnetsep2013ii theory-of-computation regular-expression regular-language

Answer key ☟

40.20 Regular Grammar (4)

40.20.1 Regular Grammar: Doubt UGC NET

https://gateoverflow.in/13365/ugcnet-dec2014-iii-24
i’ve a small doubt in the solution of this question
how is (a+b)*ba(a+b)* complement of the given language?

regular-language regular-grammar query

Answer key ☟

40.20.2 Regular Grammar: UGC NET CSE | August 2016 | Part 3 | Question: 22

The regular grammar for the language ={ | is even} is given by

(1)

(2)

(3)
 (4)

ugcnetcse-aug2016-paper3 theory-of-computation regular-grammar

Answer key ☟

40.20.3 Regular Grammar: UGC NET CSE | June 2014 | Part 2 | Question: 10

The regular grammar for the language L= { (w) and are both even, * } is given by :
(Assume, and are states)

A. , and are initial and final states.

B. , and are initial and final states.
C. is both initial and final states.
D. is both initial and final states.

ugcnetcse-june2014-paper2 theory-of-computation regular-grammar

Answer key ☟

40.20.4 Regular Grammar: UGC NET CSE | September 2013 | Part 3 | Question: 17

A regular grammar for the language is given by

A.
B.
C.
D.

ugcnetcse-sep2013-paper3 theory-of-computation regular-grammar

Answer key ☟

40.21 Regular Language (9)

40.21.1 Regular Language: UGC NET CSE | August 2016 | Part 3 | Question: 55

Given the following two languages :

Which of the following is correct ?

A. is regular language and is not regular language.

B. is not regular language and is regular language.
C. Both and are regular languages.
D. Both and are not regular languages.

ugcnetcse-aug2016-paper3 theory-of-computation regular-language

 Answer key ☟

40.21.2 Regular Language: UGC NET CSE | December 2013 | Part 2 | Question: 28

Given the following statements:

: If is a regular language then the language is also regular.
: is regular language.
Which of the following is true?
A. is not correct and is not correct B. is not correct and is correct
C. is correct and is not correct D. is correct and is correct
ugcnetcse-dec2013-paper2 theory-of-computation regular-language

Answer key ☟

40.21.3 Regular Language: UGC NET CSE | December 2014 | Part 3 | Question: 23

Given two languages :

Using pumping lemma for regular language, it can be shown that

A. is regular and is not regular.

B. is not regular and is regular.
C. is regular and is regular.
D. is not regular and is not regular.

ugcnetcse-dec2014-paper3 theory-of-computation regular-language

Answer key ☟

40.21.4 Regular Language: UGC NET CSE | January 2017 | Part 3 | Question: 19

Which of the following are not regular?

i. Strings of even number of a’s

ii. Strings of a’s , whose length is a prime number.
iii. Set of all palindromes made up of a’s and b’s.
iv. Strings of a’s whose length is a perfect square.

A. (i) and (ii) only B. (i), (ii) and (iii) only

C. (ii),(iii) and (iv) only D. (ii) and (iv) only
ugcnetcse-jan2017-paper3 theory-of-computation regular-language

Answer key ☟

40.21.5 Regular Language: UGC NET CSE | January 2017 | Part 3 | Question: 20

Consider the languages and . Which one of the following represents ?

A. B. C. D.
ugcnetcse-jan2017-paper3 theory-of-computation regular-language

Answer key ☟

40.21.6 Regular Language: UGC NET CSE | July 2016 | Part 3 | Question: 22

The symmetric differences of two sets and is defined as:

The nor of two languages is defined as

 Which of the following is correct?

A. The family of regular languages is closed under symmetric difference but not closed under nor
B. The family of regular languages is closed under nor but not closed under symmetric difference
C. The family of regular languages are closed under both symmetric difference and nor
D. The family of regular languages are not closed under both symmetric difference and nor

ugcnetcse-july2016-paper3 theory-of-computation regular-language

Answer key ☟

40.21.7 Regular Language: UGC NET CSE | June 2014 | Part 3 | Question: 15

Let be any language. Define as the strings obtained by extracting from the letters in the even-
numbered positions and We define another language by removing
the two leftmost symbols of every string in given by with If is regular
language then
A. is regular and is not regular B. Both and are regular
C. is not regular and is regular D. Both and are not regular
ugcnetjune2014iii theory-of-computation regular-language

Answer key ☟

40.21.8 Regular Language: UGC NET CSE | October 2020 | Part 2 | Question: 56

Consider the following languages:

Which of the languages is(are) regular?

Choose the correct answer from the options given below:

A. and only B. and only C. only D. only

ugcnetcse-oct2020-paper2 theory-of-computation regular-language

Answer key ☟

40.21.9 Regular Language: UGC NET CSE | September 2013 | Part 3 | Question: 16

Assume, is regular language. Let statements and be defined as:

is regular.
is regular.
Which of the following is true?
A. is correct and is not correct B. Both and are correct
C. Both and are not correct D. is not correct and is correct
ugcnetcse-sep2013-paper3 theory-of-computation regular-language

Answer key ☟

40.22 Right Quotient (1)

40.22.1 Right Quotient: UGC NET CSE | June 2013 | Part 2 | Question: 20

Given L1=L(a*baa*) L2=L(ab*). The regular expression corresponding to language L3=L1/L2 (right quotient)
is given by

A. a*b B. a*baa* C. a*ba* D. None of the above

ugcnetcse-june2013-paper2 theory-of-computation right-quotient
 Answer key ☟

40.23 Strings (1)

40.23.1 Strings: UGC NET CSE | June 2019 | Part 2 | Question: 78

Consider the following grammar:

Which of the following statements is/are true about the above grammar?​​

i. Strings produced by the grammar can have consecutive three ’s.

ii. Every string produced by the grammar have alternate and .
iii. Every string produced by the grammar have at least two ’s.
iv. Every string produced by the grammar have ’s in multiple of .

A. i only B. ii and iii only C. iv only D. iii and iv only

ugcnetcse-june2019-paper2 grammar strings

Answer key ☟

40.24 Turing Machine (5)

40.24.1 Turing Machine: UGC NET CSE | August 2016 | Part 3 | Question: 56

Given a Turing Machine

Where δ is a transition function defined as

The language accepted by Turing machine is given as :

A. B. C. D.
ugcnetcse-aug2016-paper3 theory-of-computation turing-machine

Answer key ☟

40.24.2 Turing Machine: UGC NET CSE | January 2017 | Part 3 | Question: 62

Which of the following pairs have different expressive power?

A. Single-tape-turing machine and multi-dimensional turing machine

B. Multi-tape-turing machine and multi-dimensional turing machine
C. Deterministic push down automata and non-deterministic push down automata
D. Deterministic finite automata and non-deterministic finite automata

ugcnetcse-jan2017-paper3 theory-of-computation turing-machine

Answer key ☟

40.24.3 Turing Machine: UGC NET CSE | July 2016 | Part 3 | Question: 57

Given a Turing Machine

where is a atransaction function defined as

 The language L(M) accepted by the Turing machine is given as:

A. aa*b B. abab C. aba*b D. aba*

ugcnetcse-july2016-paper3 theory-of-computation turing-machine

Answer key ☟

40.24.4 Turing Machine: UGC NET CSE | July 2018 | Part 2 | Question: 40

Consider the following statements( ):

: There exist no algorithm for deciding if any two Turing machine and accept the same language
: The problem of determining whether a Turing machine halts on any input is undecidable
Which one of the following options is correct?
A. Both and are correct B. Both and are not correct
C. Only is correct D. Only is correct
ugcnetcse-july2018-paper2 theory-of-computation turing-machine

Answer key ☟

40.24.5 Turing Machine: UGC NET CSE | June 2019 | Part 2 | Question: 80

For a statement
A language is recursive if there exists some turing machine . Which of the following conditions is
satisfied for any string ?

A. If , then accepts and will not halt

B. If , then accepts and will halt by reaching at final state
C. If , then halts without reaching to acceptable state
D. If , then halts without reaching to an acceptable state

ugcnetcse-june2019-paper2 turing-machine

Answer key ☟

Answer Keys
40.0.1 D 40.0.2 A 40.0.3 B 40.0.4 C 40.0.5 B
40.0.6 B 40.0.7 B 40.0.8 B 40.0.9 C 40.0.10 A
40.0.11 C 40.0.12 B 40.0.13 A 40.0.14 C 40.0.15 C
40.0.16 C 40.0.17 B 40.0.18 B 40.0.19 D 40.0.20 Q-Q
40.0.21 Q-Q 40.0.22 A 40.0.23 Q-Q 40.0.24 Q-Q 40.0.25 Q-Q
40.0.26 A 40.0.27 Q-Q 40.1.1 B 40.1.2 C 40.1.3 B
40.2.1 D 40.3.1 Q-Q 40.3.2 Q-Q 40.3.3 Q-Q 40.3.4 D
40.3.5 X 40.3.6 D 40.3.7 C 40.3.8 D 40.3.9 C
40.4.1 Q-Q 40.4.2 Q-Q 40.4.3 C 40.4.4 C 40.4.5 C
40.4.6 D 40.4.7 C 40.4.8 A 40.5.1 B 40.5.2 Q-Q
40.6.1 Q-Q 40.6.2 C 40.6.3 D 40.6.4 D 40.6.5 A
40.7.1 B 40.8.1 D 40.8.2 C 40.8.3 Q-Q 40.8.4 Q-Q
40.8.5 Q-Q 40.8.6 B 40.8.7 D 40.8.8 D 40.8.9 C
40.8.10 C 40.9.1 Q-Q 40.9.2 B 40.9.3 B 40.9.4 Q-Q

40.9.5 Q-Q 40.9.6 D 40.9.7 D 40.9.8 D 40.9.9 C

40.9.10 A 40.9.11 D 40.9.12 D 40.9.13 C 40.9.14 A
40.9.15 B 40.10.1 X 40.10.2 Q-Q 40.10.3 B 40.10.4 D
40.10.5 C 40.10.6 B 40.10.7 A 40.10.8 B 40.11.1 C
40.12.1 B 40.13.1 D 40.14.1 C 40.15.1 B 40.16.1 B
40.16.2 D 40.16.3 D 40.17.1 B 40.17.2 Q-Q 40.17.3 Q-Q
40.17.4 C 40.17.5 B 40.18.1 B 40.18.2 D 40.18.3 C
40.19.1 Q-Q 40.19.2 Q-Q 40.19.3 Q-Q 40.19.4 D 40.19.5 D
40.19.6 D 40.19.7 D 40.19.8 B 40.19.9 D 40.19.10 Q-Q
40.19.11 B 40.19.12 D 40.19.13 C 40.19.14 C 40.19.15 C
40.19.16 B 40.19.17 D 40.19.18 A 40.20.1 Q-Q 40.20.2 Q-Q
40.20.3 C 40.20.4 D 40.21.1 Q-Q 40.21.2 C 40.21.3 D
40.21.4 C 40.21.5 D 40.21.6 C 40.21.7 B 40.21.8 X
40.21.9 B 40.22.1 C 40.23.1 D 40.24.1 Q-Q 40.24.2 C
40.24.3 C 40.24.4 Q-Q 40.24.5 C
41 Unknown Category (197)

41.0.1 UGC NET CSE | November 2017 | Part 2 | Question: 2

Let and . Find the base expansion of .

A. B. C. D.
ugcnetcse-nov2017-paper2

Answer key ☟

41.0.2 UGC NET CSE | November 2017 | Part 2 | Question: 4

How many distinguishable permutations of the letters in the word of BANANA are there?

A. B. C. D.
ugcnetcse-nov2017-paper2

Answer key ☟

41.0.3 UGC NET CSE | November 2017 | Part 2 | Question: 3

Let and Find the boolean product of the two matrices.

A.

B.

C.

D.

ugcnetcse-nov2017-paper2

41.0.4 UGC NET CSE | November 2017 | Part 2 | Question: 9

Negation of the proposition is

A. B.
C. D.
ugcnetcse-nov2017-paper2
 Answer key ☟

41.0.5 UGC NET CSE | November 2017 | Part 2 | Question: 11

is a pointer to a data type. The expression is evaluated as (in C++)

A. B.
C. D. Depends on compiler
ugcnetcse-nov2017-paper2

Answer key ☟

41.0.6 UGC NET CSE | November 2017 | Part 2 | Question: 12

The associativity of which of the following operators is Left to Right, in C++?

A. Unary Operator B. Logical not
C. Array element access D. addressof
ugcnetcse-nov2017-paper2

Answer key ☟

41.0.7 UGC NET CSE | November 2017 | Part 2 | Question: 13

A member function can always access the data in, (in C++)
A. the class of which it is member B. the object of which it is a member
C. the public part of its class D. the private part of its class
ugcnetcse-nov2017-paper2

Answer key ☟

41.0.8 UGC NET CSE | November 2017 | Part 2 | Question: 14

Which of the following is not correct for virtual function in C++?

A. Must be declared in public section of class

B. Virtual function can be static
C. Virtual function should be accessed using pointers
D. Virtual function is defined in base class

ugcnetcse-nov2017-paper2

Answer key ☟

41.0.9 UGC NET CSE | November 2017 | Part 2 | Question: 16

Which of the following is/are true with reference to ‘view’ in DBMS?

i. A ‘view’ is a special stored procedure executed when certain event occurs

ii. A ‘view’ is a virtual table, which occurs after executing a pre-compiled query

A. Only (i) is true B. Only (ii) is true

C. Both (i) and (ii) are true D. Neither (i) nor (ii) are true
ugcnetcse-nov2017-paper2

Answer key ☟

41.0.10 UGC NET CSE | November 2017 | Part 2 | Question: 15

Which of the following is not correct (in C++)?

A. Class templates and function templates are instantiated in the same way
B. Class templates differ from function templates in the way they are initiated
C. Class template is initiated by defining an object using the template argument
D. Class templates are generally used for storage classes
 ugcnetcse-nov2017-paper2

Answer key ☟

41.0.11 UGC NET CSE | November 2017 | Part 2 | Question: 21

Consider an array representation of an element binary heap where the elements are stored from index to
index of the array. For the element stored at index of the array , the index of the parent is
A. B.
C. D.
ugcnetcse-nov2017-paper2

Answer key ☟

41.0.12 UGC NET CSE | November 2017 | Part 2 | Question: 19

In RDBMS, different classes of relations are created using ________ technique to prevent modification
anomolies.
A. Functional Dependencies B. Data integrity
C. Referential integrity D. Normal Forms
ugcnetcse-nov2017-paper2

Answer key ☟

41.0.13 UGC NET CSE | November 2017 | Part 2 | Question: 20

_________ SQL command changes one or more fields in a record

A. LOOK-UP B. INSERT C. MODIFY D. CHANGE

ugcnetcse-nov2017-paper2

Answer key ☟

41.0.14 UGC NET CSE | November 2017 | Part 2 | Question: 18

Match the following with respect to RDBMS :

A. B.
C. D.
ugcnetcse-nov2017-paper2 databases

Answer key ☟

41.0.15 UGC NET CSE | November 2017 | Part 2 | Question: 22

The following numbers are inserted into an empty binary search tree in the given order: .
What is the height of the binary search tree?

A. B. C. D.
ugcnetcse-nov2017-paper2

Answer key ☟
41.0.16 UGC NET CSE | November 2017 | Part 2 | Question: 25

Post-order traversal of a given binary search tree produces following sequence of keys:
. Which one of the following sequences of keys can be the result of an in-order
traversal of the tree ?
A. B.
C. D.
ugcnetcse-nov2017-paper2

Answer key ☟

41.0.17 UGC NET CSE | November 2017 | Part 2 | Question: 26

Which of the following devices takes data sent from one network device and forwards it to the destination node
based on MAC address?

A. Hub B. Modem C. Switch D. Gateway

ugcnetcse-nov2017-paper2

Answer key ☟

41.0.18 UGC NET CSE | November 2017 | Part 2 | Question: 27

_________ do not take their decisions on measurements or estimates of the current traffic and topology.
A. Static algorithms B. Adaptive algorithms
C. Non-Adaptive algorithms D. Recursive algorithms.
ugcnetcse-nov2017-paper2

Answer key ☟

41.0.19 UGC NET CSE | November 2017 | Part 2 | Question: 23

Let be an undirected connected graph with distinct edge weight. Let be the edge with maximum weight
and the edge with minimum weight. Which of the following statements is false?

A. Every minimum spanning tree of must contain

B. If is in minimum spanning tree, then its removal must disconnect
C. No minimum spanning tree contains
D. has a unique minimum spanning tree

ugcnetcse-nov2017-paper2

Answer key ☟

41.0.20 UGC NET CSE | November 2017 | Part 2 | Question: 24

A list of n strings, each of length n, is sorted into lexicographic order using merge - sort algorithm. The worst
case running time of this computation is:

A. B. C. D.
ugcnetcse-nov2017-paper2

41.0.21 UGC NET CSE | November 2017 | Part 2 | Question: 36

In Distributed system, the capacity of a system to adapt the increased service load is called

A. Tolerance B. Scalability C. Capability D. Loading

ugcnetcse-nov2017-paper2

Answer key ☟
41.0.22 UGC NET CSE | November 2017 | Part 2 | Question: 39

Which module gives control of the CPU to the process selected by the short-term schedular?

A. Dispatcher B. Interrupt C. Schedular D. Threading

ugcnetcse-nov2017-paper2 operating-system

Answer key ☟

41.0.23 UGC NET CSE | November 2017 | Part 2 | Question: 41

Software does not wear-out in the traditional sense of the term, but software does tend to deteriorate as it
evolves, because

A. Software suffers from exposure to hostile environments

B. Defects are more likely to arise after software has been used often
C. Multiple change requests introduce errors in component interactions
D. Software spare parts become harder to order

ugcnetcse-nov2017-paper2

Answer key ☟

41.0.24 UGC NET CSE | November 2017 | Part 2 | Question: 40

Two atomic operations permissible on Semaphores are _________ and ________.

A. wait, stop B. wait, hold C. hold, signal D. wait, signal

ugcnetcse-nov2017-paper2

Answer key ☟

41.0.25 UGC NET CSE | November 2017 | Part 2 | Question: 42

Software re-engineering is concerned with

A. Re-constructing the original source code from the existing machine (low-level) code program and modifying it ti
make it more user-friendly
B. Scrapping the source code of a software and re-writing it entirely from scratch
C. Re-organising and modifying existing software systems to make them more maintainable
D. Translating source code of an existing software to a new machine (low-level) language

ugcnetcse-nov2017-paper2

Answer key ☟

41.0.26 UGC NET CSE | November 2017 | Part 2 | Question: 38

Suppose there are six files with corresponding sizes KB, KB, KB KB,
KB and KB respectively. The files are to be stored on a sequential device in such a way that optimizes access
time. In what order should the files be stored?

A. B.
C. D.
ugcnetcse-nov2017-paper2

Answer key ☟

41.0.27 UGC NET CSE | November 2017 | Part 2 | Question: 43

Which of the following is not a key issue stressed by an agile philosophy of software engineering?

A. The importance of self-organizing teams as well as communication and collaboration between team members and
customers
 B. Recognition that change represents opportunity
C. Emphasis on rapid delivery of software that satisfies the customer
D. Having a separate testing phase after a build phase

ugcnetcse-nov2017-paper2

Answer key ☟

41.0.28 UGC NET CSE | November 2017 | Part 2 | Question: 44

What is the normal order of activities in which traditional software testing is organized?
a. Integration Testing b. System Testing
c. Unit Testing d. Validation Testing
A. (c), (a), (b), (d) B. (c), (a), (d), (b)
C. (d), (c), (b), (a) D. (b), (d), (a), (c)
ugcnetcse-nov2017-paper2

Answer key ☟

41.0.29 UGC NET CSE | November 2017 | Part 2 | Question: 49

Which of the given wireless technologies used in IoT, consumes the least amount of power?

A. Zigbee B. Bluetooth C. Wi-Fi D. GSM/CDMA

ugcnetcse-nov2017-paper2 computer-networks

Answer key ☟

41.0.30 UGC NET CSE | November 2017 | Part 3 | Question: 16

Find the equation of the circle in terms of coordinates, assuming that the coordinate system
results from a scaling of units in the direction and units in the direction.
A.
B.
C.
D.
ugcnetcse-nov2017-paper3

Answer key ☟

41.0.31 UGC NET CSE | November 2017 | Part 3 | Question: 17

Find the normalization transformation that maps a window whose lower left corner is at and upper right
corner is at onto a viewpoint that is the entire normalized device screen

A.

B.

C.
 D.

ugcnetcse-nov2017-paper3

Answer key ☟

41.0.32 UGC NET CSE | November 2017 | Part 3 | Question: 32

You are given a sequence of elements to sort. The input sequence consists of subsequences, each
containing elements. The elements in a given subsequence are all smaller than the elements in the succeeding
subsequence and larger than the elements in the preceding subsequence. Thus, all that is needed to sort the whole
sequence of length is to sort the elements in each of the subsequences.
The lower bound on the number of comparisons needed to solve this variant of the sorting problem is
A.
B.
C.
D.
ugcnetcse-nov2017-paper3

Answer key ☟

41.0.33 UGC NET CSE | November 2017 | Part 3 | Question: 33

Consider the recurrence relation:

Where and are constants.

The order of the algorithm corresponding to above recurrence relation is

A. B. C. D.
ugcnetcse-nov2017-paper3

Answer key ☟

41.0.34 UGC NET CSE | November 2017 | Part 3 | Question: 34

Consider the following two sequences:

and
The length of longest common subsequence of and is

A. B. C. D.
ugcnetcse-nov2017-paper3

Answer key ☟
41.0.35 UGC NET CSE | November 2017 | Part 3 | Question: 35

A text is made up of the characters each occuring with the probability and
respectively. The optimal Huffman coding technique will have the average length of

A. B. C. D.
ugcnetcse-nov2017-paper3

Answer key ☟

41.0.36 UGC NET CSE | November 2017 | Part 3 | Question: 36

An undirected graph contains nodes named . Two nodes and are

connected if and only if . Each edge is assigned a weight . The cost of the minimum
spanning tree of such a graph with nodes is

A. B. C. D.
ugcnetcse-nov2017-paper3

Answer key ☟

41.0.37 UGC NET CSE | November 2017 | Part 3 | Question: 37

An XML document that adheres to syntax rules specified by XML specification in that it must satisfy both
physical and logical structured, is called

A. Well-formed B. Reasonable C. Valid D. Sophisticated

ugcnetcse-nov2017-paper3

Answer key ☟

41.0.38 UGC NET CSE | November 2017 | Part 3 | Question: 38

Which of the following statement(s) is/are TRUE regarding Java Servelets?

i. A Java Servelet is a server-side component that runs on the web server and extends the capabilities of a server.
ii. A servelet can use the user interface classes like AWT or Swing.

A. Only (i) is TRUE B. Only (ii) is TRUE

C. Both (i) and (ii) are TRUE D. Neither (i) nor (ii) is TRUE
ugcnetcse-nov2017-paper3

Answer key ☟

41.0.39 UGC NET CSE | November 2017 | Part 3 | Question: 39

Consider the following HTML table definition:

<table border =1>
<tr>
<td colspan=2> Text A </td>
</tr>
<tr>
<td> Text B </td>
<td>zText C </td>
</tr>
<tr>
<td> rowspan =2> Text D </td>
<td> Text E </td>
</tr>
<tr>
<td> Text F </td>
</tr>
</table>

The above HTML code will render on screen as

 A.

B.

C.

D.

ugcnetcse-nov2017-paper3

Answer key ☟

41.0.40 UGC NET CSE | November 2017 | Part 3 | Question: 41

Which of the following statements is/are TRUE regarding JAVA?

i. Constants that cannot be changed are declared using ‘static’ keyword.

ii. A class can only inherit one class but can implement multiple interfaces.

A. Only (i) is TRUE B. Only (ii) is TRUE

C. Both (i) and (ii) are TRUE D. Neither (i) nor (ii) is TRUE
ugcnetcse-nov2017-paper3

Answer key ☟

41.0.41 UGC NET CSE | November 2017 | Part 3 | Question: 42

What is the output of the following JAVA program?

Class Test
{
public static void main (String [] args)
{
Test obj=new Test ();
obj.start ();
}
void start()
{
String stra="do";
String strb=method (stra);
System.out.print(":" +stra +strb);
}
String method (String stra)
{
stra=stra+"good";
System.out.print(stra);
return "good";
}
}

A. dogood : dogoodgood B. dogood : gooddogood

C. dogood : dodogood D. dogood : dogood
ugcnetcse-nov2017-paper3

Answer key ☟
41.0.42 UGC NET CSE | November 2017 | Part 3 | Question: 40

Which of the following statements is/are TRUE?

i. In HTML, character entitites are used to incorporate external content into a web page, such as images.
ii. Once a web server returns a cookie to a browser, the cookie will be included in all future requests from the browser
to the same server.

A. Only (i) is TRUE B. Only (ii) is TRUE

C. Both (i) and (ii) are TRUE D. Neither (i) nor (ii) is TRUE
ugcnetcse-nov2017-paper3

41.0.43 UGC NET CSE | November 2017 | Part 3 | Question: 47

A simple stand – alone software utility is to be developed in ‘C’ programming by a team of software experts for
a computer running Linux and the overall size of this software is estimated to be lines of code.
Considering as multiplicative and exponention factor for the basic COCOMO effort estimation
equation and as multiplicative and exponention factor for the basic COCOMO development time
estimation equation, approximately how long does the software project take to complete?

A. months B. months C. months D. months

ugcnetcse-nov2017-paper3

Answer key ☟

41.0.44 UGC NET CSE | November 2017 | Part 3 | Question: 43

Statistical software quality assurance in software engineering involves __________

A. using sampling in place of exhaustive testing of software

B. surveying customers to find out their opinions about product quality
C. tracing each defect to its underlying cause, isolating the vital few causes, and moving to correct them
D. tracing each defect to its underlying causes, and using the Pareto principle to correct each problem found

ugcnetcse-nov2017-paper3

Answer key ☟

41.0.45 UGC NET CSE | November 2017 | Part 3 | Question: 46

Consider the method mcq ();

int mcq (boolean a, boolean b, boolean c, boolean d)
{
int ans=1;
if (a) {ans=2;}
else if (b) {ans=3;}
else if (c) {
if (d) {ans=4;}
}
return ans;
}

If
Number of tests to exhaustively test mcq();
Minimum number of tests to achieve full statement coverage for mcq (); and
Minimum number of tests to achieve full branch coverage for mcq ( );
then ______________

A. B. C. D.
ugcnetcse-nov2017-paper3

Answer key ☟
41.0.46 UGC NET CSE | November 2017 | Part 3 | Question: 44

Which of the following statements is/are FALSE with respect to software testing?
: White-box tests are based on specifications; better at telling whether program meets specification, better at
finding errors of ommission.
: Black-box tests are based on code; better for finding crashes, out of bounds errors, file not closed errors.
: Alpha testing is conducted at the developer’s site by a team of highly skilled testers for software that is developed as
a product to be used by many customers.
A. Only and are FALSE B. Only and are FALSE
C. Only and are FALSE D. All of , and are FALSE
ugcnetcse-nov2017-paper3

41.0.47 UGC NET CSE | November 2017 | Part 3 | Question: 45

A signal processor software is expected to operate for days after repair, and the mean software repair time
is expected to be minutes. Then, the availability of the software is

A. B. C. D.
ugcnetcse-nov2017-paper3

41.0.48 UGC NET CSE | November 2017 | Part 3 | Question: 49

Consider the following four processes with the arrival time and length of CPU burst given in milliseconds:

The average waiting time for preemptive SJF scheduling algorithm is ____________

A. ms B. ms C. ms D. ms
ugcnetcse-nov2017-paper3

Answer key ☟

41.0.49 UGC NET CSE | November 2017 | Part 3 | Question: 48

In Software Configuration Management (SCM), which of the following is a use-case supported by standard
version control systems?
a. Managing several versions or release of a software b. Filing bug reports and tracking their progress
c. Allowing team members to work in parallel d. Identifying when and where a regression occurred
A. Only (a), (c), and (d) B. Only (a), (b), and (c)
C. Only (a), (b), and (d) D. Only (b), (c), and (d)
ugcnetcse-nov2017-paper3

Answer key ☟

41.0.50 UGC NET CSE | November 2017 | Part 3 | Question: 51

User level threads are threads that are visible to the programmer and are unknown to the kernel. The operating
system kernel supports and manages kernel level threads. Three different types of models relate user and kernel
level threads.
Which of the following statements is/are true?

i.
i. The Many – to – one model maps many user threads to one kernel thread
ii. The one – to – one model maps one user thread to one kernel thread
iii. The many – to – many model maps many user threads to smaller or equal kernel threads
 ii.
i. Many – to – one model maps many kernel threads to one user thread
ii. One – to – one model maps one kernel thread to one user thread
iii. Many – to – many model maps many kernel threads to smaller or equal user threads

A. (i) is true; (ii) is false B. (i) is false; (ii) is true

C. Both (i) and (ii) are true D. Both (i) and (ii) are false
ugcnetcse-nov2017-paper3

Answer key ☟

41.0.51 UGC NET CSE | November 2017 | Part 3 | Question: 50

Consider a virtual page reference string . Suppose a demand paged

virtual memory system running on a computer system such that the main memory has page frames. Then
______ page replacement algorithm has minimum number of page faults.

A. FIFO B. LIFO C. LRU D. Optimal

ugcnetcse-nov2017-paper3

Answer key ☟

41.0.52 UGC NET CSE | November 2017 | Part 3 | Question: 54

The Bounded buffer problem is also known as ___________

A. Producer – consumer problem B. Reader – writer problem
C. Dining Philosophers problem D. Both and
ugcnetcse-nov2017-paper3

Answer key ☟

41.0.53 UGC NET CSE | November 2017 | Part 3 | Question: 56

If is the branching factor and is the maximum depth of the search tree, what is the space complexity of
greedy search?

A. B. C. D.
ugcnetcse-nov2017-paper3

Answer key ☟

41.0.54 UGC NET CSE | November 2017 | Part 3 | Question: 53

Consider a disk queue with requests for I/O to blocks on cylinders . Suppose
SSTF disk scheduling algorithm implemented to meet the requests then the total number of head movements are
________ if the disk head is initially at .

A. B. C. D.
ugcnetcse-nov2017-paper3

41.0.55 UGC NET CSE | November 2017 | Part 3 | Question: 55

In Artificial Intelligence (AI), which agent deals with happy and unhappy state?
A. Simple reflex agent B. Model based agent
C. Learning agent D. Utility based agent
ugcnetcse-nov2017-paper3

41.0.56 UGC NET CSE | November 2017 | Part 3 | Question: 57

Let and be Propositions. Assume that the equivalences and hold. Then the
truth value of the formula is always
 A. True B. False
C. Same as truth table of D. Same as truth table of
ugcnetcse-nov2017-paper3

Answer key ☟

41.0.57 UGC NET CSE | November 2017 | Part 3 | Question: 58

“If , then unless ” is represented by which of the following formulae in propositional logic?
A. B.
C. D.
ugcnetcse-nov2017-paper3

Answer key ☟

41.0.58 UGC NET CSE | November 2017 | Part 3 | Question: 59

Consider the following two well-formed formulas in prepositional logic.

Which of the following statements is correct?

A. is Satisfiable, is valid B. is unsatisfiable, is Satisfiable
C. is unsatisfiable, is valid D. and both are Satisfiable
ugcnetcse-nov2017-paper3

Answer key ☟

41.0.59 UGC NET CSE | November 2017 | Part 3 | Question: 60

Standard planning algorithms assume environment to be ______

A. Both deterministic and fully observable

B. Neither deterministic nor fully observable
C. Deterministic but not fully observable
D. Not deterministic but fully observable

ugcnetcse-nov2017-paper3

Answer key ☟

41.0.60 UGC NET CSE | November 2017 | Part 3 | Question: 61

Which of the following statements is not correct?

A. Every recursive language is recursively enumerable

B. is recursively enumerable
C. Recursive languages are closed under intersection
D. Recursive languages are not closed under intersection

ugcnetcse-nov2017-paper3

41.0.61 UGC NET CSE | November 2017 | Part 3 | Question: 64

A DFT matrix is given by

 Where the values of and are ______, _____ respectively.

A. B. C. D.
ugcnetcse-nov2017-paper3

Answer key ☟

41.0.62 UGC NET CSE | November 2017 | Part 3 | Question: 62

Context free grammar is not closed under

A. Concatenation B. Complementation C. Kleene Star D. Union

ugcnetcse-nov2017-paper3

Answer key ☟

41.0.63 UGC NET CSE | November 2017 | Part 3 | Question: 63

Consider the following languages:

Which one of the following statements is correct?

A. Only and are context free languages

B. Only and are context free languages
C. Only and are context free languages
D. , and are context free languages

ugcnetcse-nov2017-paper3

41.0.64 UGC NET CSE | November 2017 | Part 3 | Question: 65

Entropy of a discrete random variable with possible values and probability density function
is

The value of gives the units of entropy. The unit for is

A. bits B. bann C. nats D. deca

ugcnetcse-nov2017-paper3

41.0.65 UGC NET CSE | November 2017 | Part 3 | Question: 66

For any binary linear code with minimum distance or greater where
is

A. B. C. D.
ugcnetcse-nov2017-paper3

41.0.66 UGC NET CSE | November 2017 | Part 3 | Question: 69

Consider the following LPP:

Min
Subject to:
 The solution of this LPP using Dual Simplex Method is
A. and B. and
C. and D. and
ugcnetcse-nov2017-paper3

Answer key ☟

41.0.67 UGC NET CSE | November 2017 | Part 3 | Question: 67

Which of the following is a valid reason for causing degeneracy in a transportation problem? Here is number
of rows and is number of columns in transportation table.

A. When the number of allocations is

B. When two or more occupied cells become unoccupied simultaneously
C. When the number of allocations is less than
D. When a loop cannot be drawn without using unoccupied cells, except the starting cell of the loop

ugcnetcse-nov2017-paper3

Answer key ☟

41.0.68 UGC NET CSE | November 2017 | Part 3 | Question: 68

Consider the following LPP:

Max
Subject to the constraints

The solution of the LPP using Graphical solution technique is

A. and B. and
C. and D. and
ugcnetcse-nov2017-paper3

Answer key ☟

41.0.69 UGC NET CSE | November 2017 | Part 3 | Question: 70

Consider a Takagi-Sugeno – Kang (TSK) Model consisting of rules of the form:

If is and and is
THEN
assume, is the matching degree of rule , then the total output of the model is given by:

A.

B.
 C.

D.

ugcnetcse-nov2017-paper3

Answer key ☟

41.0.70 UGC NET CSE | November 2017 | Part 3 | Question: 71

Consider a single perceptron with sign activation function. The perceptron is represented by weight vector
and a bias . If the input vector to the perceptron is then the
output of the perceptron is

A. B. C. D.
ugcnetcse-nov2017-paper3

Answer key ☟

41.0.71 UGC NET CSE | November 2017 | Part 3 | Question: 72

The Sigmoid activation function is defined as

B.
A.

C. D.
ugcnetcse-nov2017-paper3

Answer key ☟

41.0.72 UGC NET CSE | November 2017 | Part 3 | Question: 73

Consider the following statements:

i. UNIX provides three types of permissions

Read
Write
Execute
ii. UNIX provides three sets of permissions
permission for owner
permission for group
permission for others

Which of the above statement/s is/are true?

A. Only (i) B. Only (ii)
C. Both (i) and (ii) D. Neither (i) nor (ii)
ugcnetcse-nov2017-paper3

Answer key ☟

41.0.73 UGC NET CSE | November 2017 | Part 3 | Question: 74

Which of the following routing technique / techniques is/are used in distributed systems?

a. Fixed Routing b. Virtual Routing c. Dynamic Routing

A. (a) only B. (a) and (b) only C. (c) only D. All (a), (b), (c)
ugcnetcse-nov2017-paper3
 Answer key ☟

41.0.74 UGC NET CSE | December 2018 | Part 2 | Question: 99

​Consider the sentence below:

“There is a country that borders both India and Nepal”
Which of the following represents the above sentence correctly?

A.
B.
C.
D.

ugcnetcse-dec2018-paper2

Answer key ☟

41.0.75 UGC NET CSE | December 2018 | Part 2 | Question: 98

​Consider a vocabulary with only four propositions A, B, C and D. How many models are there for the following
sentence?

A. B. C. D.
ugcnetcse-dec2018-paper2

Answer key ☟

41.0.76 UGC NET CSE | December 2018 | Part 2 | Question: 97

Consider the following minimax game tree search

What will be the value probagated at the root?

A. B. C. D.
ugcnetcse-dec2018-paper2

Answer key ☟

41.0.77 UGC NET CSE | December 2018 | Part 2 | Question: 96

​Consider the following statements related to Search algorithm.

S1 : A solution is a subtree that has a goal node at every leaf.
S2 : nodes are analogous to the branching in a deterministic environment.
S3 : nodes are analogous to the branching in a non-deterministic environment.
Which of the following is true referencing the above statements ?
Choose the correct answer from the code given below :
 A.
B.
C.
D.

ugcnetcse-dec2018-paper2

Answer key ☟

41.0.78 UGC NET CSE | December 2018 | Part 2 | Question: 95

​Consider the following statements :

S1: A heuristic is admissible if it never overestimates the cost to reach the goal.
S2: A heuristic is monotonous if it follows triangle inequality property.
Which of the following is true referencing the above statements ?
Choose the correct answer from the code given below :

A. Neither of the statements S1 and S2 are true

B. Statement S1 is false but statement S2 is true
C. Statement S1 is true but statement S2 is false
D. Both the statements S1 and S2 are true

ugcnetcse-dec2018-paper2

Answer key ☟

41.0.79 UGC NET CSE | December 2018 | Part 2 | Question: 94

Match List I with List II and choose the correct answer from the code given below.
List I List II
Selects a node for
Greedy Best- expansion if optimal
(a) (i)
First Search path to that node has
been found
Avoids substantial
overhead associated
(b) A* Search (ii)
with keeping the sorted
queue of nodes
Recursive Best- Suffers from excessive
(c) (iii)
First Search node generation
Iterative- Time complexity
(d) deepening A* (iv) depends on the quality
Search of heuristic
Code:

1. (a) – (i), (b)-(ii), (c)-(iii), (d)-(iv)

2. (a) – (iv), (b)-(i), (c)-(ii), (d)-(iii)
3. (a) – (iv), (b)-(iii), (c)-(ii), (d)-(i)
4. (a) – (i), (b)-(iv), (c)-(iii), (d)-(ii)

ugcnetcse-dec2018-paper2

41.0.80 UGC NET CSE | December 2018 | Part 2 | Question: 93

Consider the following terminology and match List I with List II and choose the correct answer from the code
 given below.
b= branching factor
d = depth of the shallowest solution
m= maximum depth of the search tree
l=depth limit

Code:

A. (a) – (i), (b)-(ii), (c)-(iv), (d)-(iii)

B. (a) – (ii), (b)-(iii), (c)-(iv), (d)-(i)
C. (a) – (iii), (b)-(ii), (c)-(iv), (d)-(i)
D. (a) – (i), (b)-(iii), (c)-(iv), (d)-(ii)

ugcnetcse-dec2018-paper2

Answer key ☟

41.0.81 UGC NET CSE | December 2018 | Part 2 | Question: 92

​Which of the following is true for semi-dynamic environment?

A. The environment may change while the agent is deliberating

B. The environment itself does not change with the passage of time but the agent’s performance score does
C. Even if the environment changes with the passage of time while deliberating, the performance score does not
change.
D. Environment and performance score, both change simultaneously

ugcnetcse-dec2018-paper2

Answer key ☟

41.0.82 UGC NET CSE | December 2018 | Part 2 | Question: 91

​An agent can improve its performance by

A. Perceiving B. Responding C. Learning D. Observing

ugcnetcse-dec2018-paper2

Answer key ☟

41.0.83 UGC NET CSE | December 2018 | Part 2 | Question: 88

Consider the following two statements:

S1 : TCP handles both congestion and flow control
S2 : UDP handles congestion but not flow control
Which of the following options is correct with respect to the above statements (S1) and (S2)?
Choose the correct answer from the code given below:
A. Neither S1 nor S2 is correct B. S1 is not correct but S2 is correct
C. S1 is correct but S2 is not correct D. Both, S1 and S2 are correct
ugcnetcse-dec2018-paper2

Answer key ☟
41.0.84 UGC NET CSE | December 2018 | Part 2 | Question: 84

Consider the following tables (relations):

Students
Roll-No Name
18CS101 Ramesh
18CS102 Mukesh
18CS103 Ramesh

Performance
Roll-No Course Marks
18CS101 DBMS 60
18CS101 Compiler Design 65
18CS102 DBMS 80
18CS103 DBMS 85
18CS102 Compiler Design 75
18CS103 Operating System 70

Primary keys in the tables are shown using underline. Now, consider the following query:
SELECT S.Name, Sum (P.Marks) FROM Students, Performance P WHERE S.Roll-No=P.Roll-No GROUP BY S.Name

The number of rows returned by the above query is

A. B. C. D.
ugcnetcse-dec2018-paper2 databases

Answer key ☟

41.0.85 UGC NET CSE | December 2018 | Part 2 | Question: 81

​Data scrubbing is

A. A process to reject data from the data warehouse and to create the necessary indexes.
B. A process to load the data in the data warehouse and to create the necessary indexes.
C. A process to upgrade the quality of data after it is moved into a data warehouse
D. A process to upgrade the quality of data before it is moved into a data warehouse

ugcnetcse-dec2018-paper2

Answer key ☟

41.0.86 UGC NET CSE | December 2018 | Part 2 | Question: 80

​Which of the following statement/s is/are true ?

i. Facebook has the world’s largest Hadoop Cluster.

ii. Hadoop allows live stream processing of Real time data.

Choose the correct answer from the code given below :

A. (i) only B. (ii) only

C. Both (i) and (ii) D. Neither (i) nor (ii)
ugcnetcse-dec2018-paper2

Answer key ☟
41.0.87 UGC NET CSE | December 2018 | Part 2 | Question: 79

​_______ command is used to remove a relation from SQL database.

A. Drop table B. Delete table
C. Remove table D. Update table
ugcnetcse-dec2018-paper2

Answer key ☟

41.0.88 UGC NET CSE | December 2018 | Part 2 | Question: 78

​Data warehouse contains _____ data that is never found in operational environment.

A. Summary B. Encoded C. Encrypted D. Scripted

ugcnetcse-dec2018-paper2

Answer key ☟

41.0.89 UGC NET CSE | December 2018 | Part 2 | Question: 77

​An attribute of datatype varchar( ) has the value , and the attribute of datatype char( ) has the value
, then the attribute has _____ spaces and attribute has ____ spaces.

A. B. C. D.
ugcnetcse-dec2018-paper2

Answer key ☟

41.0.90 UGC NET CSE | December 2018 | Part 2 | Question: 76

​______ system call creates new process in Unix.

A. create B. create new C. fork D. fork new

ugcnetcse-dec2018-paper2

Answer key ☟

41.0.91 UGC NET CSE | December 2018 | Part 2 | Question: 75

​A process residing in Main Memory and Ready and Waiting for execution, is kept on

A. Execution Queue B. Job Queue C. Ready Queue D. Wait Queue

ugcnetcse-dec2018-paper2

Answer key ☟

41.0.92 UGC NET CSE | December 2018 | Part 2 | Question: 71

​Dirty bit is used to show the

A. wrong page B. page with corrupted data
C. page with low frequency occurrence D. page that is modified after being loaded into cache
memory
ugcnetcse-dec2018-paper2

Answer key ☟

41.0.93 UGC NET CSE | December 2018 | Part 2 | Question: 68

​In Linux operating system environment ____ command is used to print a file.

A. print B. ptr C. pr D. lpr

ugcnetcse-dec2018-paper2
 Answer key ☟

41.0.94 UGC NET CSE | December 2018 | Part 2 | Question: 67

​Which of the following statements/s is/are ?

i. Windows XP supports both peer-peer and client-server networks.

ii. Windows XP implements Transport protocols as drivers that can be loaded and unloaded from the system given
dynamically.

Choose the correct answer from the code given below:

A. (i) only B. (ii) only

C. Neither (i) nor (ii) D. Both (i) and (ii)
ugcnetcse-dec2018-paper2

41.0.95 UGC NET CSE | December 2018 | Part 2 | Question: 65

The Third Generation mobile phones are digital and based on

A. B. C. D. Broadband
ugcnetcse-dec2018-paper2

Answer key ☟

41.0.96 UGC NET CSE | December 2018 | Part 2 | Question: 62

​The four byte IP address consists of

A. Network Address B. Host Address
C. Both Network and Host Addresses D. Neither Network nor Host Addresses
ugcnetcse-dec2018-paper2

Answer key ☟

41.0.97 UGC NET CSE | December 2018 | Part 2 | Question: 61

Match the following Secret Key Algorithms (list I) with Corresponding Key Lengths (List II) and choose the
correct answer from the code given below:

Code:

A. (a) – (iv), (b)-(ii), (c ) -(ii) , d-(i)

B. (a) – (iii), (b)-(iv), (c ) -(i) , d-(ii)
C. (a) – (iii), (b)-(iv), (c ) -(ii) , d-(i)
D. (a) – (ii), (b)-(iii), (c ) -(iv) , d-(i)

ugcnetcse-dec2018-paper2

Answer key ☟

41.0.98 UGC NET CSE | December 2018 | Part 2 | Question: 60

Software coupling involves dependencies among pieces of software called modules. Which of the following are
correct statements with respect to module coupling ?
P : Common coupling occurs when two modules share the same global data
 Q : Control coupling occurs when modules share a composite data structure and use only parts of it
R : Content coupling occurs when one module modifies or relies on the internal working of another module
Choose the correct answer from the code given below :

A. P and Q only B. P and R only C. Q and R only D. All of P, Q and R

ugcnetcse-dec2018-paper2

Answer key ☟

41.0.99 UGC NET CSE | December 2018 | Part 2 | Question: 59

Which of the following is not one of the principles of agile software development method?
A. Customer involvement B. Embrace change
C. Incremental delivery D. Following the plan
ugcnetcse-dec2018-paper2

Answer key ☟

41.0.100 UGC NET CSE | December 2018 | Part 2 | Question: 58

Which of the following statements is/are true ?

: Software Reengineering is preferable for software products having high failure rates, having poor design
and/or having poor code structure.
: Software Reverse Engineering is the process of analyzing software with the objective of recovering its design and
requirement specification.
Choose the correct answer from the code given below :

A. only B. only C. Both and D. Neither nor

ugcnetcse-dec2018-paper2

Answer key ☟

41.0.101 UGC NET CSE | December 2018 | Part 2 | Question: 56

Consider the following method:

int f(int m, int n, boolean x, boolean y)
{
int res=0;
if (m<0) {res=n-m;}
else if (x || y)
{
res=-1;
if(n==m){res=1;}
}
else {res=n;}
return res;
} /*end of f */

If is the minimum number of tests to achieve full statement coverage for , and is the minimum number of tests
to achieve full branch coverage for , then =

A. B. C. D.
ugcnetcse-dec2018-paper2

Answer key ☟

41.0.102 UGC NET CSE | December 2018 | Part 2 | Question: 55

Which of the following statements is/are ?

: The clean-room strategy to software engineering is based on the incremental software process model.
 : The clean-room strategy to software engineering is one of the ways to overcome “unconscious” copying of
copyrighted code.
Choose the correct answer from the code given below:

A. only B. only C. Both and D. Neither nor

ugcnetcse-dec2018-paper2

Answer key ☟

41.0.103 UGC NET CSE | December 2018 | Part 2 | Question: 54

Match each diagram in to its appropriate description in .

A. B.
C. D.
ugcnetcse-dec2018-paper2

Answer key ☟

41.0.104 UGC NET CSE | December 2018 | Part 2 | Question: 53

Software products need perfective maintenance for which of the following reasons?

A. To rectify bugs observed while the system is in use

B. When the customers need the product to run on new platforms
C. To support new features that users want it to support
D. To overcome wear and tear caused by the repeated use of the software

ugcnetcse-dec2018-paper2

Answer key ☟

41.0.105 UGC NET CSE | December 2018 | Part 2 | Question: 52

The Software Requirement Specification is said to be _____ if and only if no subset of individual
requirements described in it conflict with each other.

A. Correct B. Consistent C. Unambiguous D. Verifiable

ugcnetcse-dec2018-paper2

Answer key ☟

41.0.106 UGC NET CSE | December 2018 | Part 2 | Question: 51

Consider the function given below:

void f(char w[])
{
int x=strlen(w); //length of a string
 char c;
for (int i=0; i<x; i++)
{
c=w[i];
w[i]=w[x-i-1];
w[x-i-1] =c;
}
}

Which of the following is the purpose of ?

A. It outputs the contents of the array in reverse order

B. It outputs the contents of the array in the original order
C. It outputs the contents of the array with the characters shifted over by one position
D. It outputs the contents of the array with the characters rearranged so they are no longer recognized as the words in
the original phrase

ugcnetcse-dec2018-paper2

Answer key ☟

41.0.107 UGC NET CSE | December 2018 | Part 2 | Question: 50

Which of the following HTML5 codes will affect the horizontal as well as vertical alignment of the table content
?

A. <td halign =”middle” valign=”center”> BASH</td>

B. <td align =”middle” valign=”center”> BASH</td>
C. <td style=”horizontal-align:center; vertical-align:middle;”> BASH</td>
D. <td style=”text-align:center; vertical-align:middle;”> BASH</td>

ugcnetcse-dec2018-paper2

Answer key ☟

41.0.108 UGC NET CSE | December 2018 | Part 2 | Question: 49

What does the following Java function perform? (Assume int occupies four bytes of storage)
public static int f(int a)
{ // Pre-conditions : a > 0 and no oveflow/underflow occurs
int b=0;
for (int i=0; i<32; i++)
{
b = b<<1;
b=b | ( a & 1);
a=a >>>1; // This is a logical shift
}
return b;
}

A. Returns the int that has the binary representation of integer a

B. Return the int that has reversed binary representation of integer a
C. Return the int that represents the number of ’s in the binary representation of integer a
D. Return the int that represents the number of ’s in the binary representation of integer a

ugcnetcse-dec2018-paper2

Answer key ☟

41.0.109 UGC NET CSE | December 2018 | Part 2 | Question: 48

Consider the following recursive Java function that takes two long arguments and returns a float value :
public static float f(long m, long n)
{
float result = (float) m / (float) n;
if (m<0 || n <0)
 return 0.0f;
else
result +=f(m*2, n*3);
return result;
}

Which of the following integers best approximates the value of ?

A. B. C. D.
ugcnetcse-dec2018-paper2

41.0.110 UGC NET CSE | December 2018 | Part 2 | Question: 47

Consider the following two programs and and two statements and about these programs:

void f(int a, int *b, int

&c) double a=1, b=2;
{ double &f(double &d)
a=1; {
*b=2; d=4;
c=3; return b;
} }
int main() int main()
{ {
int i=0; f(a)=5;
f(i, &i, i); count < < a< < “:” < <
b;
count <<i;
}
}
: prints out
: prints out
What can you say about the statements and ?

A. Only is true B. Only is true

C. Both and are true D. Neither nor is true
ugcnetcse-dec2018-paper2

Answer key ☟

41.0.111 UGC NET CSE | December 2018 | Part 2 | Question: 46

Consider the following pseudo-code fragment, where is a non-negative integer that has been initialized:

while

end while
Which of the following is a loop invariant for the while statement?
(Note: a loop invariant for a while statement is an assertion that is true each time the guard is evaluated during the
execution of the while statement).

A. and B. and
C. and D. and
 ugcnetcse-dec2018-paper2

Answer key ☟

41.0.112 UGC NET CSE | December 2018 | Part 2 | Question: 45

​In Graphics, which of the following statements is/are true?

P: Back-face culling is an example of image-precision visible-surface determination procedure.
Q: Z- buffer is a -bit, -bit, or bit field associated with each pixel in a frame buffer that can be used to determine
the visible surfaces at each pixel
Choose the correct answer from the code given below :

A. P only B. Q only C. P and Q D. Neither P nor Q

ugcnetcse-dec2018-paper2

Answer key ☟

41.0.113 UGC NET CSE | December 2018 | Part 2 | Question: 44

In Graphics, which of the following statements about perspective and parallel projection is/are true?
P : In a perspective projection, the farthest an object is from the center of projection, the smaller it appears
Q : Parallel projection is equivalent to a perspective projection where the viewer is standing infinitely far away
R : Perspective projections do not preserve straight lines.
Choose the correct answer from the code given below:

A. P and Q only B. P and R only C. Q and R only D. P, Q and R

ugcnetcse-dec2018-paper2

Answer key ☟

41.0.114 UGC NET CSE | December 2018 | Part 2 | Question: 43

​Consider the midpoint (or Bresenham) algorithm for rasterizing lines given below:

1. Input and
2.
3. //f is the implicit form of a line
4. for to
5. do
6. plot
7. if
8. then
9.
10.
11. else
12.
13. end
14. end

Which statements are true?

P: For a line with slope , we should change the outer loop in line (4) to be over
Q: Lines (10) and (12) update the decision variable through an incremental evaluation of the line equation
R: The algorithm fails if is over
Choose the correct answer from the code given below:

A. P only B. P and Q only C. Q and R only D. P, Q and R

 ugcnetcse-dec2018-paper2

41.0.115 UGC NET CSE | December 2018 | Part 2 | Question: 41

If the frame buffer has -bits per pixel and -bits are allocated for each of the , and components, then
what would be the size of the color lookup table (LUT)?

A. bytes B. bytes
C. bytes D. bytes
ugcnetcse-dec2018-paper2

Answer key ☟

41.0.116 UGC NET CSE | December 2018 | Part 2 | Question: 40

The grammar is not suitable for predictive parsing because the grammar is
A. Right recursive B. Left recursive
C. Ambiguous D. An operator grammar
ugcnetcse-dec2018-paper2

Answer key ☟

41.0.117 UGC NET CSE | December 2018 | Part 2 | Question: 38

Which one of the following problems is decidable for recursive languages ?

A. Is ? B. Is , where is a string ?
C. Is ? D. Is , where is a given regular set ?
ugcnetcse-dec2018-paper2

Answer key ☟

41.0.118 UGC NET CSE | December 2018 | Part 2 | Question: 31

Let and be three regular expressions.

Consider the following :

i.
ii.

Choose the correct answer from the code given below :

A. Only i is correct B. Only ii is correct
C. Both i and ii are correct D. Neither i nor ii is correct
ugcnetcse-dec2018-paper2

Answer key ☟

41.0.119 UGC NET CSE | December 2018 | Part 2 | Question: 28

In K-coloring of an undirected graph is a function. such that

for every edge .
Which of the following is not correct?
A. is bipartite B. is -colorable
C. has cycles of odd length D. has no cycles of odd length
ugcnetcse-dec2018-paper2

41.0.120 UGC NET CSE | December 2018 | Part 2 | Question: 26

In a ternary tree, the number of internal nodes of degree and is , and respectively. The number of leaf
nodes in the ternary tree is

A. B. C. D.
 ugcnetcse-dec2018-paper2

Answer key ☟

41.0.121 UGC NET CSE | December 2018 | Part 2 | Question: 20

If a graph (G) has no loops or parallel edges, and if the number of vertices (n) the graph is , then graph G is
Hamiltonian if

i.
ii.
iii.

Choose the correct answer from the code given below:

A. (i) and (iii) only B. (ii) only C. (ii) and (iii) only D. (iii) only
ugcnetcse-dec2018-paper2

Answer key ☟

41.0.122 UGC NET CSE | December 2018 | Part 2 | Question: 19

Consider a system with level cache. Access times of Level cache, Level cache and main memory are ns,
ns and ns respectively. The hit rates of Level and Level caches are and respectively. What is the
average access time of the system ignoring the search time within the cache?

A. ns B. ns C. ns D. ns
ugcnetcse-dec2018-paper2

Answer key ☟

41.0.123 UGC NET CSE | December 2018 | Part 2 | Question: 14

A computer uses a memory unit with K words of bits each. A binary instruction code is stored in one
word of memory. The instruction has four parts: an indirect bit, an operation code and a register code part to
specify one of registers and an address part. How many bits are there in the operation code, the register code part and
the address part?

A. B. C. D.
ugcnetcse-dec2018-paper2

Answer key ☟

41.0.124 UGC NET CSE | December 2018 | Part 2 | Question: 13

Consider the following statements :

i. Auto increment addressing mode is useful in creating self-relocating code.

ii. If auto increment addressing mode is included in an instruction set architecture, then an additional ALU is required
for effective address calculation.
iii. In auto incrementing addressing mode, the amount of increment depends on the size of the data item accessed.

Which of the above statements is/are true?

A. (i) and (ii) only B. (ii) and (iii) only C. (iii) only D. (ii) only
ugcnetcse-dec2018-paper2

Answer key ☟

41.0.125 UGC NET CSE | December 2018 | Part 2 | Question: 9

Use Dual Simplex Method to solve the following problem:

 A. B.
C. D.
ugcnetcse-dec2018-paper2

41.0.126 UGC NET CSE | December 2018 | Part 2 | Question: 6

The relation and on a boolean algebra are defined as:

if and only if
means but
means and
means
Considering the above definitions, which of the following is not true in the boolean algebra?

i. If and , then
ii. If and , then
iii. If and , then
iv. If and , then

Choose the correct answer from the code given below:

A. i and ii only B. ii and iii only C. iii only D. iv only

ugcnetcse-dec2018-paper2

Answer key ☟

41.0.127 UGC NET CSE | December 2018 | Part 2 | Question: 4

A survey has been conducted on methods of commuter travel. Each respondent was asked to check Bus, Train
and Automobile as a major method of travelling to work. More than one answer was permitted. The results
reported were as follows :
Bus people; Train people; Automobile people; Bus and Train people; Bus and Automobile people; Train
and Automobile people; and all the three methods people. How many people completed the survey form?

A. B. C. D.
ugcnetcse-dec2018-paper2

Answer key ☟

41.0.128 UGC NET CSE | October 2020 | Part 1 | Question: 50

Read the passage and answer the question:

Through their work and the efforts of others, managers in all kinds of organizational settings, whether industrial,
educational, governmental, or military are attempting to run their organizations with the management by objectives
process as a basic underlying management concept. Management by objectives is basically a process where by the
seniors and the junior managers of an enterprise jointly identify its common goals, define each individual’s major areas
of responsibility in terms of the results expected… use these measures as guides for operating the unit and assessing the
contribution of each of its members. In some cases, this process has been successfully carria beyond the managerial
level to include hourly employees. The concept rests in a philosophy of management that emphasizes an integration
between external control by managers and self-control by employees. It can apply to any manager or individual no
matter what level or function, and to any organization, regardless of size. The effective functioning of this system is an
agreement between a manager and an employee about that employee’s groups performance goals during a stated time
 period. These goals can emphasise either output variables of intervening variables or some combination of both. The
important thing is that goals are jointly established and agreed upon in advance. At the end of the time period,
performance is reviewed in relation to accepted goals. Both the employee and the manager participate in this review.
The philosophy behind management by objectives is to

A. effect improvement through a joint review of achievement of performance goals within a given timeframe
B. integrate external and internal controls by managers
C. provide managers scope to review the accepted output variables
D. agree upon different performance goals for managers and employees

ugcnetcse-oct2020-paper1

Answer key ☟

41.0.129 UGC NET CSE | October 2020 | Part 1 | Question: 49

Read the passage and answer the question:

Through their work and the efforts of others, managers in all kinds of organizational settings, whether industrial,
educational, governmental, or military are attempting to run their organizations with the management by objectives
process as a basic underlying management concept. Management by objectives is basically a process where by the
seniors and the junior managers of an enterprise jointly identify its common goals, define each individual’s major areas
of responsibility in terms of the results expected… use these measures as guides for operating the unit and assessing the
contribution of each of its members. In some cases, this process has been successfully carria beyond the managerial
level to include hourly employees. The concept rests in a philosophy of management that emphasizes an integration
between external control by managers and self-control by employees. It can apply to any manager or individual no
matter what level or function, and to any organization, regardless of size. The effective functioning of this system is an
agreement between a manager and an employee about that employee’s groups performance goals during a stated time
period. These goals can emphasise either output variables of intervening variables or some combination of both. The
important thing is that goals are jointly established and agreed upon in advance. At the end of the time period,
performance is reviewed in relation to accepted goals. Both the employee and the manager participate in this review.
In this frame of reference, how does an organisation function effectively?

A. By including the hourly employees in the managerial positions

B. By identifying and executing performance targets in a collaborative mode
C. By imposing a rigid philosophy of management
D. By providing separate work environment for both managers and workers

ugcnetcse-oct2020-paper1

Answer key ☟

41.0.130 UGC NET CSE | October 2020 | Part 1 | Question: 48

Read the passage and answer the question:

Through their work and the efforts of others, managers in all kinds of organizational settings, whether industrial,
educational, governmental, or military are attempting to run their organizations with the management by objectives
process as a basic underlying management concept. Management by objectives is basically a process where by the
seniors and the junior managers of an enterprise jointly identify its common goals, define each individual’s major areas
of responsibility in terms of the results expected… use these measures as guides for operating the unit and assessing the
contribution of each of its members. In some cases, this process has been successfully carria beyond the managerical
level to include hourly employees. The concept rests in a philosophy of management that emphasizes an integration
between external control by managers and self-control by employees. It can apply to any manager or individual no
matter what level or function, and to any organization, regardless of size. The effective functioning of this system is an
agreement between a manager and an employee about that employee’s groups performance goals during a stated time
period. These goals can emphasise either output variables of intervening variables or some combination of both. The
important thing is that goals are jointly established and agreed upon in advance. At the end of the time period,
performance is reviewed in relation to accepted goals. Both the employee and the manager participate in this review.
The critical feature of the concept in this type of management is related to
 A. the assignment of responsibility to the workers
B. distinguishing the operational role between managers and workers
C. promoting of uniformity of work environment among all types of organisation
D. sharing of responsibility with an eye on results

ugcnetcse-oct2020-paper1

Answer key ☟

41.0.131 UGC NET CSE | October 2020 | Part 1 | Question: 47

Read the passage and answer the question:

Through their work and the efforts of others, managers in all kinds of organizational settings, whether industrial,
educational, governmental, or military are attempting to run their organizations with the management by objectives
process as a basic underlying management concept. Management by objectives is basically a process where by the
seniors and the junior managers of an enterprise jointly identify its common goals, define each individual’s major areas
of responsibility in terms of the results expected… use these measures as guides for operating the unit and assessing the
contribution of each of its members. In some cases, this process has been successfully carria beyond the managerical
level to include hourly employees. The concept rests in a philosophy of management that emphasizes an integration
between external control by managers and self-control by employees. It can apply to any manager or individual no
matter what level or function, and to any organization, regardless of size. The effective functioning of this system is an
agreement between a manager and an employee about that employee’s groups performance goals during a stated time
period. These goals can emphasise either output variables of intervening variables or some combination of both. The
important thing is that goals are jointly established and agreed upon in advance. At the end of the time period,
performance is reviewed in relation to accepted goals. Both the employee and the manager participate in this review.
The requisite for management by objectives is centered on
A. the control by seniors B. the guidance of juniors
C. the participatory process D. the organisational settings
ugcnetcse-oct2020-paper1

Answer key ☟

41.0.132 UGC NET CSE | October 2020 | Part 1 | Question: 46

Read the passage and answer the question:

Through their work and the efforts of others, managers in all kinds of organizational settings, whether industrial,
educational, governmental, or military are attempting to run their organizations with the management by objectives
process as a basic underlying management concept. Management by objectives is basically a process where by the
seniors and the junior managers of an enterprise jointly identify its common goals, define each individual’s major areas
of responsibility in terms of the results expected… use these measures as guides for operating the unit and assessing the
contribution of each of its members. In some cases, this process has been successfully carria beyond the managerical
level to include hourly employees. The concept rests in a philosophy of management that emphasizes an integration
between external control by managers and self-control by employees. It can apply to any manager or individual no
matter what level or function, and to any organization, regardless of size. The effective functioning of this system is an
agreement between a manager and an employee about that employee’s groups performance goals during a stated time
period. These goals can emphasise either output variables of intervening variables or some combination of both. The
important thing is that goals are jointly established and agreed upon in advance. At the end of the time period,
performance is reviewed in relation to accepted goals. Both the employee and the manager participate in this review.
In an organisation is managed through the identification of
A. competing goals B. common objectives
C. its specific characteristics D. senior and junior managers
ugcnetcse-oct2020-paper1

Answer key ☟

41.0.133 UGC NET CSE | October 2020 | Part 1 | Question: 45

What are the advantages of Choice Based Credit System (CBCS) introduces by the UGC for higher education
institutions?
 i. Focuses on student centric education
ii. Allows students to choose inter-disciplinary and intra-disciplinary courses
iii. Makes education at par with global standards
iv. Makes it easy to estimate the performance levels of students in terms of marks
v. Offers flexibility for students to undertake studies at different times and at different institutions

Choose the correct answer from the options given below:

A. only B. only
C. only D. only
ugcnetcse-oct2020-paper1

Answer key ☟

41.0.134 UGC NET CSE | October 2020 | Part 1 | Question: 44

Given below are two statements:

In the light of the above statements, choose the correct answer from the options given below:

A. Both Statement and Statement are true

B. Both Statement and Statement are false
C. Statement is correct but Statement is false
D. Statement is incorrect but Statement is true

ugcnetcse-oct2020-paper1

Answer key ☟

41.0.135 UGC NET CSE | October 2020 | Part 1 | Question: 43

Which of the following come under the mandate of the University Grants Commission (UGC)?

i. Promotion and coordination of University education

ii. Determining and monitoring standards of teaching, examination and research in Universities
iii. Organising continuous professional development programmes for college and University teachers
iv. Framing regulations on minimum standards of education
v. Disbursing and regulating grants to the universities and colleges

Choose the correct answer from the options given below:

A. only B. only
C. only D. only
ugcnetcse-oct2020-paper1

41.0.136 UGC NET CSE | October 2020 | Part 1 | Question: 42

Which of the following explain the concept of values?

i. Values are beliefs tied inextricably to human emotion and behaviour

ii. Values refer to desirable goals people strive to attain
iii. Values are conflict-free
iv. Values are ordered by importance relative to one another
v. Values are utilized primarily to effect change in knowledge of a person

Choose the correct answer from the options given below:

A. only B. only
C. only D. only
 ugcnetcse-oct2020-paper1

41.0.137 UGC NET CSE | October 2020 | Part 1 | Question: 41

Match with : consists of the Vedangas and contains subjects dealt in them.

Choose the correct answer from the options given below:

A. B.
C. D.
ugcnetcse-oct2020-paper1

41.0.138 UGC NET CSE | October 2020 | Part 1 | Question: 40

Given below are two statements: One is labelled as Assertion and the other is labelled as Reason

In the light of the above statements, choose the most appropriate answer from the options given below:

A. Both and are correct and is the correct explanation of

B. Both and are correct but is NOT the correct explanation of
C. is correct but is not correct
D. is not correct but is correct

ugcnetcse-oct2020-paper1

Answer key ☟

41.0.139 UGC NET CSE | October 2020 | Part 1 | Question: 39

During physical treatment process of waste water, what is the correct order of following operations to be
followed?
a. Flocculation b. Filtration
c. Screening d. Sedimentation
Choose the correct answer from the options given below:
A. B.
C. D.
ugcnetcse-oct2020-paper1

41.0.140 UGC NET CSE | October 2020 | Part 1 | Question: 38

Wind energy is very sensitive to the wind velocity because wind power is directly proportional to the
A. wind velocity B. square of the wind velocity
C. square root of the wind velocity D. cube of the wind velocity
ugcnetcse-oct2020-paper1

41.0.141 UGC NET CSE | October 2020 | Part 1 | Question: 37

Given below are two statements: One is labelled as Assertion and the other is labelled as Reason
 In the light of the above statements, choose the correct answer from the options given below:

A. Both and are true and is the correct explanation of

B. Both and are true but is NOT the correct explanation of
C. is true but is false
D. is false but is true

ugcnetcse-oct2020-paper1

41.0.142 UGC NET CSE | October 2020 | Part 1 | Question: 36

Which of the International Agreements/Convention/Protocols are legally binding on the member countries
(parties)?

i. Convention on Biological Diversity

ii. Kyoto Protocol
iii. Montreal Protocol
iv. Paris Agreement

Choose the most appropriate answer from the options given below:

A. only B. and only C. , , and only D. , , and only

ugcnetcse-oct2020-paper1

41.0.143 UGC NET CSE | October 2020 | Part 1 | Question: 35

Match with

Choose the correct answer from the options given below:

A. B.
C. D.
ugcnetcse-oct2020-paper1

Answer key ☟

41.0.144 UGC NET CSE | October 2020 | Part 1 | Question: 34

The word blog is derived from the word

A. My log B. We blog C. E blog D. Blogger

ugcnetcse-oct2020-paper1

Answer key ☟

41.0.145 UGC NET CSE | October 2020 | Part 1 | Question: 33

A firewall is a software tool that protects

i. Server
ii. Network
iii. Fire
iv. Individual computer

Choose the correct answer from the options given below:

A. , only B. , only
C. , , only D. , , only
ugcnetcse-oct2020-paper1

Answer key ☟

41.0.146 UGC NET CSE | October 2020 | Part 1 | Question: 32

Cloud computing has the following distinct characteristics:

i. The service is hosted on the internet

ii. It is made available by a service provider
iii. It computes and predicts rain when the weather is cloudy
iv. The service is fully managed by the provider

Choose the correct answer from the options given below:

A. , only B. , , only C. , only D. , , only

ugcnetcse-oct2020-paper1

Answer key ☟

41.0.147 UGC NET CSE | October 2020 | Part 1 | Question: 30

Which one of the following pramanas has been accepted in Buddhism?

A. Arthapatti B. Anupalabdhi C. S’abda D. Pratyaksha

ugcnetcse-oct2020-paper1

Answer key ☟

41.0.148 UGC NET CSE | October 2020 | Part 1 | Question: 31

A type of memory that holds the computer startup routine is

A. Cache B. RAM C. DRAM D. ROM

ugcnetcse-oct2020-paper1

Answer key ☟

41.0.149 UGC NET CSE | October 2020 | Part 1 | Question: 29

Match with

Choose the correct answer from the options given below:

A. B.
C. D.
ugcnetcse-oct2020-paper1

Answer key ☟
41.0.150 UGC NET CSE | October 2020 | Part 1 | Question: 28

Given below are two Statements:

The water of the pond is muddy. It must have rained last night.
What kind of Anumana (inference) has been used in the above statements. Choose the correct option from the
following.

i. S’esavat anumana
ii. Comparison
iii. Purvovat anumana
iv. Both and

Choose the appropriate answer from the options given below:

A. only B. only C. only D. only

ugcnetcse-oct2020-paper1

Answer key ☟

41.0.151 UGC NET CSE | October 2020 | Part 1 | Question: 27

Given below are two statements: One is labelled as Assertion and the other is labelled as Reason
Assertion : Substance is always the subject of all predicates
Reason : Substance is self-existent and self-conceived
In the light of the above statements, choose the correct answer from the options given below:

A. Both and are true and is the correct explanation of

B. Both and are true but is NOT the correct explanation of
C. is true but is false
D. is false but is true

ugcnetcse-oct2020-paper1

41.0.152 UGC NET CSE | October 2020 | Part 1 | Question: 26

Which one of the following schools has not accepted anumana (inference) as a valid source of knowledge?

A. Advaita Vedanta B. Visistadvaita C. Charvaka D. Sankhya

ugcnetcse-oct2020-paper1

Answer key ☟

41.0.153 UGC NET CSE | October 2020 | Part 1 | Question: 25

Three pipes fill a tank in hours. If two of them take and hours each to fill the tank, how many hours will
the third pipe take to fill the tank?

A. hours B. hours C. hours D. hours

ugcnetcse-oct2020-paper1

Answer key ☟

41.0.154 UGC NET CSE | October 2020 | Part 1 | Question: 24

In a meters race, beat by meter or second. What is the speed of ?

A. Km/h B. Km/h C. Km/h D. Km/h

ugcnetcse-oct2020-paper1

Answer key ☟
41.0.155 UGC NET CSE | October 2020 | Part 1 | Question: 23

If some pens are pencils but no pencil is sharpener then

i. All pencils are pens

ii. Some sharpeners are pencils
iii. Some pens are not sharpener
iv. Some pencils are not pens

Choose the correct answer from the options given below:

A. and only B. and only
C. and only D. and only
ugcnetcse-oct2020-paper1

Answer key ☟

41.0.156 UGC NET CSE | October 2020 | Part 1 | Question: 22

The ratio of ages of two persons and is and that of ages and is . If the average of all three is
years, what is ’s age?

A. years B. years C. years D. years

ugcnetcse-oct2020-paper1

Answer key ☟

41.0.157 UGC NET CSE | October 2020 | Part 1 | Question: 21

In a park, and are sitting. is the brother of ’s husband and son of . is the daughter of
and sister of .​​

i. is the grandson of
ii. is the daughter of
iii. is the father of
iv. There are one son and one daughter in the group
v. is the uncle of

Choose the correct answer from the options given below:

A. and only B. and only
C. and only D. and only
ugcnetcse-oct2020-paper1

Answer key ☟

41.0.158 UGC NET CSE | October 2020 | Part 1 | Question: 20

Match with

Choose the correct answer from the options given below:

A. B.
C. D.
ugcnetcse-oct2020-paper1

Answer key ☟
41.0.159 UGC NET CSE | October 2020 | Part 1 | Question: 19

Identifying the sequence of stages of message processing

i. Action
ii. Internalisation
iii. Selection
iv. Understanding
v. Perception

Choose the correct answer from the options given below

A. B.
C. D.
ugcnetcse-oct2020-paper1

41.0.160 UGC NET CSE | October 2020 | Part 1 | Question: 18

Given below are two statements:

In the light of the above statements, choose the correct answer from the options given below:

A. Both Statement and Statement are true

B. Both Statement and Statement are false
C. Statement is correct but Statement is false
D. Statement is incorrect but Statement is true

ugcnetcse-oct2020-paper1

Answer key ☟

41.0.161 UGC NET CSE | October 2020 | Part 1 | Question: 17

Which of the following are useful in positive components of classroom communication?​​

i. Restrictive actions
ii. Empathy
iii. Punctuality
iv. Follow-up
v. Scattered reflections

Choose the most appropriate answer from the options given below:
A. only B. only
C. only D. only
ugcnetcse-oct2020-paper1

41.0.162 UGC NET CSE | October 2020 | Part 1 | Question: 16

Which of the following is considered as an effective form of verbal communication?

A. Story-telling B. Sloganeering
C. Use of high pitch of voice D. Monologues
ugcnetcse-oct2020-paper1

Answer key ☟

41.0.163 UGC NET CSE | October 2020 | Part 1 | Question: 15

Given below are the two statements:

 In the light of the above statements, choose the correct answer from the options given below:

A. Both Statement and Statement are true

B. Both Statement and Statement are false
C. Statement is correct but Statement is is false
D. Statement is incorrect but Statement is true

ugcnetcse-oct2020-paper1

Answer key ☟

41.0.164 UGC NET CSE | October 2020 | Part 1 | Question: 14

Given below are two statements: One is labelled as Assertion (A) and the other is labelled as Reason (R)

In the light of the above statements, choose the most appropriate answer from the options given below:

A. Both and are correct and is the correct explanation of

B. Both and are correct but is NOT the correct explanation of
C. is correct and is not incorrect
D. is not correct and is correct

ugcnetcse-oct2020-paper1

Answer key ☟

41.0.165 UGC NET CSE | October 2020 | Part 1 | Question: 13

Which of the following are non-probability sampling methods?

1. Cluster sampling
2. Judgemental sampling
3. Systematic sampling
4. Snowball sampling
5. Quota sampling

Choose the correct answer from the options given below:

A. , and only B. , and only C. , and only D. and only

ugcnetcse-oct2020-paper1

Answer key ☟

41.0.166 UGC NET CSE | October 2020 | Part 1 | Question: 12

In conducting an empirical study, a researcher employs a non-parametric test for data analysis and finds that the
‘statistics’ arrived at is ‘significant’ at level. What decisions will be warranted thereafter?

1. Rejecting the Null hypothesis

2. Accepting the Null hypothesis
 3. Accepting the alternate hypothesis
4. Keeping the decision in abeyance
5. Rejecting the alternate hypothesis

Choose the correct answer from the options given below:

A. and only B. and only C. only D. and only

ugcnetcse-oct2020-paper1

41.0.167 UGC NET CSE | October 2020 | Part 1 | Question: 11

In which of the following, there is a greater flexibility in both the methods and process of research?
A. Ethnography and phenomenology B. Descriptive survey and impact studies
C. Experimental and observation based studies D. Expost facto and historical studies
ugcnetcse-oct2020-paper1

41.0.168 UGC NET CSE | October 2020 | Part 1 | Question: 10

Given below are two statements:

In the light of the above statements, choose the correct answer from the options given below:

A. Both Statement and Statement are true

B. Both Statement and Statement are false
C. Statement is correct but and Statement is false
D. Statement is incorrect but Statement is true

ugcnetcse-oct2020-paper1

41.0.169 UGC NET CSE | October 2020 | Part 1 | Question: 9

Match with :

Choose the correct answer from the options given below:

A. B.
C. D.
ugcnetcse-oct2020-paper1

41.0.170 UGC NET CSE | October 2020 | Part 1 | Question: 8

In which level of teaching, the teacher’s role is more active rather than being interactive?
A. Memory level B. Understanding level
C. Reflective level D. Autonomous development level
ugcnetcse-oct2020-paper1
 Answer key ☟

41.0.171 UGC NET CSE | October 2020 | Part 1 | Question: 7

Identify the teaching strategies which are employed during indirect instruction:

i. Emphasizing direct and indirect examplars

ii. Presenting the stimulus material
iii. Inquiry based question-answer session
iv. Presenting, asking and providing feed back
v. Promoting problem solving approach

Choose the correct answer from the options given below

A. , and only B. , and only
C. , and only D. , and only
ugcnetcse-oct2020-paper1

41.0.172 UGC NET CSE | October 2020 | Part 1 | Question: 6

Which of the following teacher competency belongs to the domain of personality and attitude?
A. Locus of control and self-efficacy B. Managing and Monitoring
C. Planning and instructing D. Personalising and contextualizing
ugcnetcse-oct2020-paper1

Answer key ☟

41.0.173 UGC NET CSE | October 2020 | Part 2 | Question: 62

Which of the following statements are true?

i. A sentence entails another sentence if is true in few worlds where is true

ii. Forward chaining and backward chaining are very natural reasoning algorithms for knowledge bases in Horn form
iii. Sound inference algorithms derive all sentences that are entailed
iv. Propositional logic does not scale to environments of unbounded size

Choose the correct answer from the options given below:

A. and only B. and only
C. and only D. and only
ugcnetcse-oct2020-paper2

Answer key ☟

41.1 Binary Heap (1)

41.1.1 Binary Heap: UGC NET CSE | December 2018 | Part 2 | Question: 22

The elements are inserted one by one in the given order into a max-heap. The resultant
max-heap is sorted in an array implementation as
A. B.
C. D.
ugcnetcse-dec2018-paper2 data-structures binary-heap

Answer key ☟

41.2 Binary Search Tree (1)

41.2.1 Binary Search Tree: UGC NET CSE | December 2018 | Part 2 | Question: 25

A binary search tree is constructed by inserting the following numbers in order :

The number of nodes in the left subtree is

 A. B. C. D.
ugcnetcse-dec2018-paper2 data-structures binary-search-tree

Answer key ☟

41.3 CO and Architecture (2)

41.3.1 CO and Architecture: UGC NET CSE | November 2017 | Part 2 | Question: 46

Which of the following Super Computers is the fastest Super Computer?

A. Sun-way TaihuLight B. Titan C. Piz Daint D. Sequoia

ugcnetcse-nov2017-paper2 co-and-architecture

Answer key ☟

41.3.2 CO and Architecture: UGC NET CSE | November 2017 | Part 2 | Question: 50

Which speed up could be achieved according to Amdahl's Law for infinte number of processes if of a
program is sequential and the remaining part is ideally parallel?

A. Infinite B. C. D.
ugcnetcse-nov2017-paper2 co-and-architecture

Answer key ☟

41.4 Clustering (1)

41.4.1 Clustering: UGC NET CSE | November 2017 | Part 2 | Question: 48

Which of the following is not a Clustering method?

A. K-Means method B. Self Organizing feature map method
C. K- nearest neighbor method D. Agglomerative method
ugcnetcse-nov2017-paper2 data-mining clustering

Answer key ☟

41.5 Database Normalization (1)

41.5.1 Database Normalization: UGC NET CSE | December 2018 | Part 2 | Question: 82

Consider a relation schema on which the following functional dependencies hold :

What are the candidate keys of ?

A. and B. and
C. and D. and
ugcnetcse-dec2018-paper2 databases database-normalization

Answer key ☟

41.6 Disk Scheduling (1)

41.6.1 Disk Scheduling: UGC NET CSE | November 2017 | Part 2 | Question: 37

In ________ disk scheduling algorithm, the disk head moves from one end to other end of the disk, serving the
requests along the way. When the head reaches the other end, it immediately returns to the beginning of the disk
without serving any requests on the return trip.
 A. LOOK B. SCAN C. C-LOOK D. C-SCAN
ugcnetcse-nov2017-paper2 operating-system disk-scheduling

Answer key ☟

41.7 Dynamic Programming (1)

41.7.1 Dynamic Programming: UGC NET CSE | December 2018 | Part 2 | Question: 23

Consider two sequences and :

The length of longest common subsequence between and is

A. B. C. D.
ugcnetcse-dec2018-paper2 algorithms dynamic-programming

Answer key ☟

41.8 E Technologies (1)

41.8.1 E Technologies: UGC NET CSE | November 2017 | Part 2 | Question: 47

Which of the following statements about ERP systems is true?

A. Most ERP software implementations fully achieve seamless integration

B. ERP software packages are themselves combinations of separate applications for manufacturing, materials, resource
planning, general ledger, human resources, procurement and order entry
C. Integration of ERP systems can be achieved in only one way
D. An ERP package implemented uniformly throughout an enterprise is likely to contain very flexible connections to
allow charges and software variations

ugcnetcse-nov2017-paper2 e-technologies

Answer key ☟

41.9 Ethernet (1)

41.9.1 Ethernet: UGC NET CSE | November 2017 | Part 2 | Question: 28

The number of bits used for addressing in Gigabit Ethernet is __________.

A. bits B. bits C. bits D. bits

ugcnetcse-nov2017-paper2 computer-networks ethernet

Answer key ☟

41.10 Graph Algorithms (1)

41.10.1 Graph Algorithms: UGC NET CSE | December 2018 | Part 2 | Question: 27

Match with and choose the correct answer from the code given below.

where and are the number of vertices and edged in graph respectively.
 A. B.
C. D.
ugcnetcse-dec2018-paper2 algorithms graph-algorithms time-complexity

Answer key ☟

41.11 IP Addressing (1)

41.11.1 IP Addressing: UGC NET CSE | November 2017 | Part 2 | Question: 30

The IP address _________ is used by hosts when they are being booted.

A. B. C. D.
ugcnetcse-nov2017-paper2 computer-networks ip-addressing

Answer key ☟

41.12 Indexing (1)

41.12.1 Indexing: UGC NET CSE | December 2018 | Part 2 | Question: 85

​A clustering index is defined on the fields which are of type

A. non-key and ordering B. non-key and non-ordering
C. key and ordering D. key and non-ordering
ugcnetcse-dec2018-paper2 databases indexing

Answer key ☟

41.13 Linked List (1)

41.13.1 Linked List: UGC NET CSE | December 2018 | Part 2 | Question: 29

Consider a singly linked list. What is the worst case time complexity of the best-known algorithm to delete the
node , pointer to this node is , from the list?

A. B. C. D.
ugcnetcse-dec2018-paper2 data-structures linked-list time-complexity

Answer key ☟

41.14 Microprocessors (1)

41.14.1 Microprocessors: UGC NET CSE | December 2015 | Part 3 | Question: 3

Which of the following microprocessor hardware interrupt has the lowest priority?

A. RST B. RST C. TRAP D. INTR

ugcnetcse-dec2015-paper3 microprocessors 8085-microprocessor

Answer key ☟

41.15 Minimum Spanning Tree (1)

41.15.1 Minimum Spanning Tree: UGC NET CSE | December 2018 | Part 2 | Question: 12

Consider the graph shown below:

 Use Kruskal’s algorithm to find the minimum spanning tree of the graph. The weight of this minimum spanning tree is

A. B. C. D.
ugcnetcse-dec2018-paper2 algorithms minimum-spanning-tree

Answer key ☟

41.16 Multiplexing (1)

41.16.1 Multiplexing: UGC NET CSE | June 2011 | Part 2 | Question: 26

A comparison of frequency division and time division multiplexing system shows that

A. requires a lower bandwidth, but has greater noise immunity.

B. has greater noise immunity and requires lower bandwidth than .
C. requires channel synchronization, while has greater noise immunity.
D. requires more multiplex while requires band pass filter.

ugcnetcse-june2011-paper2 computer-networks multiplexing

Answer key ☟

41.17 Osi Model (1)

41.17.1 Osi Model: UGC NET CSE | November 2017 | Part 2 | Question: 29

Which of the following layer of OSI Reference model is also called end-to-end layer ?
A. Network layer B. Datalink layer
C. Session layer D. Transport layer
ugcnetcse-nov2017-paper2 computer-networks osi-model

Answer key ☟

41.18 Physical Layer (1)

41.18.1 Physical Layer: UGC NET CSE | June 2011 | Part 2 | Question: 27

If carrier modulated by a digital bit stream, has one one of the possible phase of and degrees, then
modulation called

A. BPSK B. QPSK C. QAM D. MSK

ugcnetcse-june2011-paper2 computer-networks physical-layer

Answer key ☟

41.19 SQL (1)

41.19.1 SQL: UGC NET CSE | November 2017 | Part 2 | Question: 17

In SQL, ________ is an Aggregate function.

A. SELECT B. CREATE C. AVG D. MODIFY

 ugcnetcse-nov2017-paper2 databases sql

Answer key ☟

41.20 Software Testing (1)

41.20.1 Software Testing: UGC NET CSE | November 2017 | Part 2 | Question: 45

Which of the following testing techniques ensures that the software products runs correctly after the changes in
maintenance?
A. Path Testing B. Integration Testing
C. Unit Testing D. Regression Testing
ugcnetcse-nov2017-paper2 is&software-engineering software-testing

Answer key ☟

41.21 Sorting (1)

41.21.1 Sorting: UGC NET CSE | December 2018 | Part 2 | Question: 30

The second smallest of elements can be found with ____ comparisons in the worst case.
A. B.
C. D.
ugcnetcse-dec2018-paper2 algorithms sorting

41.22 Stack (1)

41.22.1 Stack: UGC NET CSE | December 2018 | Part 2 | Question: 24

Consider the following postfix expression with single digit operands :

The top two elements of the stack after the second is evaluated, are :

A. B. C. D.
ugcnetcse-dec2018-paper2 data-structures stack

Answer key ☟

41.23 Transaction and Concurrency (1)

41.23.1 Transaction and Concurrency: UGC NET CSE | December 2018 | Part 2 | Question: 83

Consider the following sequence of two transactions on a bank account with initial balance that
transfers to another account and then apply interest.

i. T1 start
ii. T1 A old= new
iii. T1 B old = new =
iv. T1 commit
v. T2 start
vi. T2 A old = new =
vii. T2 commit

Suppose the database system crashes just before log record (vii) is written. When the system is restarted, which one
statement is true of the recovery process?

A. We must redo log record (vi) to set to

B. We must redo log record (vi) to set to and then redo log records (ii) and (iii)
C. We need not redo log records (ii) and (iii) because transaction is committed
D. We can apply redo and undo operations in arbitrary order because they are idempotent
 ugcnetcse-dec2018-paper2 databases transaction-and-concurrency

Answer key ☟

Answer Keys
41.0.1 D 41.0.2 C 41.0.3 A 41.0.4 B 41.0.5 A
41.0.6 C 41.0.7 A 41.0.8 B 41.0.9 B 41.0.10 B;C;D
41.0.11 C 41.0.12 D 41.0.13 C 41.0.14 B 41.0.15 A
41.0.16 D 41.0.17 C 41.0.18 C 41.0.19 C 41.0.20 B
41.0.21 B 41.0.22 A 41.0.23 C 41.0.24 D 41.0.25 C
41.0.26 B 41.0.27 D 41.0.28 B 41.0.29 B 41.0.30 B
41.0.31 A 41.0.32 C 41.0.33 D 41.0.34 C 41.0.35 B
41.0.36 B 41.0.37 A 41.0.38 A 41.0.39 C 41.0.40 B
41.0.41 D 41.0.42 D 41.0.43 B 41.0.44 C 41.0.45 A
41.0.46 A 41.0.47 D 41.0.48 A 41.0.49 A 41.0.50 A
41.0.51 D 41.0.52 A 41.0.53 C 41.0.54 C 41.0.55 D
41.0.56 A 41.0.57 B 41.0.58 A 41.0.59 A 41.0.60 D
41.0.61 D 41.0.62 B 41.0.63 D 41.0.64 X 41.0.65 D
41.0.66 C 41.0.67 C 41.0.68 B 41.0.69 B 41.0.70 D
41.0.71 D 41.0.72 C 41.0.73 D 41.0.74 Q-Q 41.0.75 Q-Q
41.0.76 Q-Q 41.0.77 Q-Q 41.0.78 Q-Q 41.0.79 Q-Q 41.0.80 Q-Q
41.0.81 Q-Q 41.0.82 Q-Q 41.0.83 Q-Q 41.0.84 Q-Q 41.0.85 Q-Q
41.0.86 Q-Q 41.0.87 Q-Q 41.0.88 Q-Q 41.0.89 Q-Q 41.0.90 Q-Q
41.0.91 Q-Q 41.0.92 Q-Q 41.0.93 Q-Q 41.0.94 Q-Q 41.0.95 Q-Q
41.0.96 Q-Q 41.0.97 Q-Q 41.0.98 Q-Q 41.0.99 Q-Q 41.0.100 Q-Q
41.0.101 Q-Q 41.0.102 Q-Q 41.0.103 Q-Q 41.0.104 Q-Q 41.0.105 Q-Q
41.0.106 B 41.0.107 Q-Q 41.0.108 Q-Q 41.0.109 Q-Q 41.0.110 Q-Q
41.0.111 Q-Q 41.0.112 Q-Q 41.0.113 Q-Q 41.0.114 Q-Q 41.0.115 Q-Q
41.0.116 Q-Q 41.0.117 Q-Q 41.0.118 A 41.0.119 Q-Q 41.0.120 B
41.0.121 Q-Q 41.0.122 B 41.0.123 A 41.0.124 Q-Q 41.0.125 Q-Q
41.0.126 Q-Q 41.0.127 Q-Q 41.0.128 A 41.0.129 B 41.0.130 D
41.0.131 C 41.0.132 B 41.0.133 C 41.0.134 C 41.0.135 D
41.0.136 B 41.0.137 B 41.0.138 A 41.0.139 B 41.0.140 D
41.0.141 B 41.0.142 B 41.0.143 D 41.0.144 B 41.0.145 D
41.0.146 D 41.0.147 D 41.0.148 D 41.0.149 B 41.0.150 A
41.0.151 B 41.0.152 C 41.0.153 D 41.0.154 D 41.0.155 A
41.0.156 C 41.0.157 B 41.0.158 A 41.0.159 D 41.0.160 C
41.0.161 B 41.0.162 A 41.0.163 A 41.0.164 A 41.0.165 B
41.0.166 D 41.0.167 A 41.0.168 C 41.0.169 B 41.0.170 A
41.0.171 D 41.0.172 A 41.0.173 D 41.1.1 Q-Q 41.2.1 C
41.3.1 A 41.3.2 C 41.4.1 C 41.5.1 Q-Q 41.6.1 D

41.7.1 4 41.8.1 B 41.9.1 B 41.10.1 Q-Q 41.11.1 A

41.12.1 Q-Q 41.13.1 B 41.14.1 X 41.15.1 Q-Q 41.16.1 Q-Q
41.17.1 D 41.18.1 Q-Q 41.19.1 C 41.20.1 D 41.21.1 Q-Q
41.22.1 B 41.23.1 Q-Q