Table of Contents

Table of Contents 1
Contributors 16
1 Algorithms (99) 17
1.1 Activity Selection Problem (1) 20
1.2 Algorithm Design Techniques (1) 20
1.3 Algorithm Efficiency (1) 20
1.4 Algorithms Sorting (1) 20
1.5 Arrays (2) 20
1.6 Artificial Intelligence (2) 21
1.7 Asymptotic Notations (7) 21
1.8 B Tree (2) 22
1.9 Binary Search Tree (1) 22
1.10 Binary Tree (4) 22
1.11 Branch And Bound (1) 23
1.12 Decision Tree (1) 23
1.13 Dfs (2) 23
1.14 Dijkstras Algorithm (1) 24
1.15 Double Hashing (1) 24
1.16 Dynamic Programming (3) 24
1.17 Graph Algorithms (3) 24
1.18 Greedy Algorithms (1) 25
1.19 Hashing (1) 25
1.20 Heap (1) 25
1.21 Huffman Code (2) 26
1.22 In Place Algo (1) 26
1.23 Knapsack (2) 26
1.24 Linear Search (1) 26
1.25 Longest Common Subsequence (1) 27
1.26 Matrix Chain Ordering (3) 27
1.27 Optimal Search Tree (1) 27
1.28 Optimal Solution (1) 28
1.29 P Np Npc Nph (3) 28
1.30 Parenthesization (1) 28
1.31 Quicksort (1) 29
1.32 Recurrence (6) 29
1.33 Recursion (2) 30
1.34 Red Black Tree (1) 30
1.35 Shortest Path (2) 30
1.36 Sorting (5) 30
1.37 Space Complexity (1) 31
1.38 Time Complexity (8) 31
1.39 Tree Search Algorithm (1) 33
1.40 Tree Traversal (1) 33
1.41 Tree Traversals (1) 33
1.42 Trees (2) 33
Answer Keys 33
2 CO and Architecture (105) 35
2.1 8085 Microprocessor (6) 35
2.2 Accumultor (1) 37
2.3 Addressing Modes (11) 37
2.4 Amdahls Law (1) 39
2.5 Assembly (13) 39
2.6 Byte Addressable (1) 41
2.7 Cache Memory (4) 41
2.8 Cmos (1) 42
2.9 Co And Architecture (9) 42
2.10 Computer Architecture (3) 44
 2.11 Control Unit (2) 44
2.12 Cpu (1) 45
2.13 Data Transfer (1) 45
2.14 Disks (1) 45
2.15 Dma (1) 45
2.16 Dynamic Ram (1) 45
2.17 Flags (1) 45
2.18 Hardware Interrupt (1) 46
2.19 Instruction Format (1) 46
2.20 Integrated Circuits (1) 46
2.21 Interrupts (4) 46
2.22 Language (1) 47
2.23 Machine Instructions (2) 47
2.24 Macros (1) 47
2.25 Memory (4) 47
2.26 Memory Data Transfer (1) 48
2.27 Microprocessors (12) 48
2.28 Microprogram Control Unit (1) 50
2.29 Parallel Computing (1) 50
2.30 Parallel Processing (1) 50
2.31 Pipelining (4) 50
2.32 Priority Encoder (1) 51
2.33 Processor Address Bus (1) 51
2.34 Register (1) 51
2.35 Runtime Environments (1) 51
2.36 Speedup (1) 52
2.37 Tlb (1) 52
Answer Keys 52
3 Compiler Design (68) 53
3.1 Code Optimization (1) 57
3.2 Compilation Phases (1) 57
3.3 Compiler (1) 57
3.4 Compiler Optimization (2) 57
3.5 Constant Folding (1) 58
3.6 Control Flow Graph (1) 58
3.7 Grammar (4) 58
3.8 Infix Prefix (1) 59
3.9 Intermediate Code (1) 59
3.10 Lexical Analysis (3) 59
3.11 Linker (1) 60
3.12 Lr Parser (2) 60
3.13 Machine Instructions (1) 60
3.14 Parameter Passing (1) 60
3.15 Parsing (12) 61
3.16 Quadruple Representation (1) 63
3.17 Runtime Environments (1) 63
3.18 Shift Reduce Parser (2) 63
3.19 Symbol Table (3) 64
3.20 System Software& Compilers (1) 64
3.21 Translator (1) 64
3.22 Two Pass Assembler (1) 64
Answer Keys 65
4 Computer Networks (290) 66
4.1 Analog & Digital Transmission (1) 74
4.2 Analog Signals (1) 74
4.3 Application Layer (1) 75
4.4 Asymmetric Key Cryptography (1) 75
4.5 Binary Search Tree (1) 75
4.6 Binary Symmetric Channel (1) 75
4.7 Bit Oriented Protocol (1) 75
4.8 Bit Rate (1) 75
4.9 Bridges (1) 76
4.10 Cache Memory (1) 76
4.11 Checksum (1) 76
4.12 Classful Addressing (2) 76
4.13 Classless Addressing (1) 76
4.14 Communication (9) 77
4.15 Computer Neworks (1) 78
4.16 Crc Polynomial (2) 78
4.17 Cryptography (7) 78
4.18 Data Communication (7) 80
4.19 Data Link Layer (7) 81
4.20 Data Mining Algorithm (1) 82
4.21 Data Transmission (1) 82
4.22 Distance Vector Routing (1) 82
4.23 Edi Layers (1) 82
4.24 Electronic Payment Systems (1) 83
4.25 Encoding (2) 83
4.26 Encryption Decryption (2) 83
4.27 Entropy (1) 83
4.28 Error Correction (3) 83
4.29 Error Detection Correction (1) 84
4.30 Ethernet (5) 84
4.31 Firewall (1) 85
4.32 Hamming Code (3) 85
4.33 Hamming Distance (1) 85
4.34 Huffman Code (1) 85
4.35 Internal Memory (1) 85
4.36 Internet Security (1) 86
4.37 Internet Stack Layers (1) 86
4.38 Ip Addressing (10) 86
4.39 Ip Packet (2) 87
4.40 Ipv6 (1) 87
4.41 Lan Technologies (2) 88
4.42 Link State Routing (1) 88
4.43 Loopback Address (1) 88
4.44 Mesh Topology (3) 88
4.45 Mobile Communication (7) 89
4.46 Modulation (2) 90
4.47 Multimedia Protocol (1) 90
4.48 Multiple Access Protocol (1) 90
4.49 Multiplexing (2) 91
4.50 Network Addressing (2) 91
4.51 Network Layer (1) 91
4.52 Network Layering (5) 91
4.53 Network Protocols (10) 92
4.54 Network Security (16) 94
4.55 Network Switching (5) 96
4.56 Network Topologies (4) 97
4.57 Osi Model (11) 98
4.58 Osi Protocol (5) 99
4.59 Physical Layer (4) 100
4.60 Port Numbers (1) 101
4.61 Propagation Delay (1) 101
4.62 Propagation Time (1) 101
4.63 Protocol (1) 101
4.64 Pure Aloha (1) 102
4.65 Rarp Protocol (1) 102
4.66 Routers Bridge Hubs Switches (2) 102
4.67 Routing (4) 102
 4.68 Routing Algorithm (3) 103
4.69 Rsa (1) 103
4.70 Rsa Public Key (1) 103
4.71 Rsa Security Networks (2) 104
4.72 Serial Communication (2) 104
4.73 Session Layer (1) 104
4.74 Signalling (1) 104
4.75 Signals (1) 105
4.76 Sliding Window (4) 105
4.77 Slotted Aloha (1) 105
4.78 Subnetting (1) 106
4.79 Tcp (4) 106
4.80 Tcp Header (1) 106
4.81 Tcp Ip Model (1) 106
4.82 Tcp Ip Suit Protocols (1) 107
4.83 Tele Communication (1) 107
4.84 Token Bucket (1) 107
4.85 Transmission Media (9) 107
4.86 Transport Layer (2) 108
4.87 Unguided Media (1) 109
4.88 Wifi (1) 109
4.89 Wireless Communication (1) 109
4.90 Wireless Lan (4) 109
4.91 Wireless Networks (1) 110
4.92 Wireless Protocol (1) 110
4.93 Wireless Transmission (1) 110
Answer Keys 110
5 Databases (176) 113
5.1 Aggregation (2) 118
5.2 B Tree (3) 119
5.3 B+tree (1) 119
5.4 Candidate Keys (4) 119
5.5 Cardinality Ratio (1) 120
5.6 Circular Queue (1) 120
5.7 Concurrency Control Protocols (1) 121
5.8 Crosstabquery (1) 121
5.9 Data Dependences (2) 121
5.10 Data Integrity (1) 121
5.11 Data Mining (2) 122
5.12 Data Model (2) 122
5.13 Database Constraints (1) 122
5.14 Database Design (1) 122
5.15 Database Normalization (23) 123
5.16 Decomposition (3) 126
5.17 Dependency Preserving (1) 127
5.18 Distributed Databases (2) 127
5.19 Enhanced Er Model (1) 128
5.20 Er Diagram (15) 128
5.21 File System (1) 130
5.22 Generalization (1) 131
5.23 Granularity (1) 131
5.24 Hierarchical Database (1) 131
5.25 Indexing (2) 131
5.26 Java (1) 131
5.27 Joins (1) 131
5.28 Object Oriented Database (2) 132
5.29 Protocol (1) 133
5.30 Rdbms (9) 133
5.31 Recovery From Failure (1) 134
5.32 Referential Integrity (2) 135
 5.33 Relation (2) 135
5.34 Relational Algebra (3) 135
5.35 Relational Calculus (2) 136
5.36 Relational Model (2) 137
5.37 Relational Schema (1) 137
5.38 Relations (1) 137
5.39 Sql (31) 138
5.40 Transaction And Concurrency (9) 146
5.41 Transactions And Concurrency Control (1) 148
5.42 Tree (1) 148
5.43 Weak Entity (1) 148
Answer Keys 149
6 Digital Logic (104) 150
6.1 Adder (3) 152
6.2 Boolean Algebra (9) 153
6.3 Boolean Function (1) 154
6.4 Circuit Output (2) 154
6.5 Combinational Circuits (3) 155
6.6 Digital Circuits (11) 155
6.7 Digital Counter (2) 157
6.8 Dual Function (2) 158
6.9 Encoding (1) 158
6.10 Excess 3 (1) 158
6.11 Flip Flop (7) 158
6.12 Floating Point Representation (1) 159
6.13 Full Adder (1) 159
6.14 Ieee Representation (2) 160
6.15 K Map (3) 160
6.16 Logic Circuit Diagram (1) 161
6.17 Memory (1) 161
6.18 Multiplexer (4) 161
6.19 Number Representation (12) 162
6.20 Number System (6) 163
6.21 Number Theory (1) 164
6.22 Priority Encoder (1) 164
6.23 Ripple Counter Operation (3) 164
6.24 Rom (1) 165
6.25 Sequential Circuit (6) 165
6.26 Sum Of Product (1) 166
6.27 Unix (1) 166
Answer Keys 166
7 Discrete Mathematics: Combinatory (14) 168
7.1 Binary Tree (1) 168
7.2 Counting (2) 168
7.3 Discrete Mathematics (2) 169
7.4 Euler Phi Function (1) 169
7.5 Inclusion Exclusion (1) 169
7.6 Pigeonhole Principle (1) 169
7.7 Recurrence (1) 170
Answer Keys 170
8 Discrete Mathematics: Graph Theory (46) 171
8.1 Binary Tree (1) 174
8.2 Discrete Mathematics (2) 174
8.3 Euler Graph (2) 174
8.4 Flow Network (1) 175
8.5 Graph (1) 175
8.6 Graph Coloring (2) 175
8.7 Graph Connectivity (8) 176
8.8 Graph Isomorphism (1) 177
 8.9 Graph Planarity (2) 177
8.10 Hamiltonian Graph (1) 178
8.11 Handshaking Theorem (1) 178
8.12 Minimum Spanning Trees (1) 178
8.13 Non Planar (1) 178
8.14 Trees (2) 178
Answer Keys 179
9 Discrete Mathematics: Mathematical Logic (30) 180
9.1 Discrete Mathematics (2) 182
9.2 First Order Logic (2) 182
9.3 Functions (1) 183
9.4 Prolog (1) 183
9.5 Propositional Logic (11) 183
Answer Keys 185
10 Discrete Mathematics: Set Theory & Algebra (22) 187
10.1 Boolean (1) 187
10.2 Complement In Fuzzy Set (1) 187
10.3 Discrete Mathematics (1) 188
10.4 Euler Phi Function (1) 188
10.5 Factors (2) 188
10.6 Function Composition (1) 188
10.7 Functions (4) 188
10.8 Inclusion Exclusion (1) 189
10.9 Poset (1) 189
10.10 Power Set (1) 190
10.11 Relational Algebra (1) 190
10.12 Relations (4) 190
Answer Keys 191
11 Engineering Mathematics: Discrete Mathematics (49) 192
11.1 Boolean Function (1) 192
11.2 Discrete Mathematics (19) 192
11.3 Equivalence Classes (1) 195
11.4 First Order Logic (5) 195
11.5 Functions (2) 196
11.6 Group Theory (2) 196
11.7 Linear Programming (1) 197
11.8 Number Representation (1) 197
11.9 Partial Order (2) 197
11.10 Propositional Logic (9) 197
11.11 Quantifiers (1) 199
11.12 Relations (2) 200
11.13 Sets (3) 200
Answer Keys 200
12 Engineering Mathematics: Linear Algebra (1) 202
Answer Keys 202
13 Engineering Mathematics: Probability (11) 203
13.1 Binary Tree (1) 203
13.2 Poisson Distribution (1) 203
13.3 Probability (8) 203
Answer Keys 204
14 General Aptitude: Quantitative Aptitude (25) 205
14.1 Data Interpretation (5) 205
14.2 Number System (1) 206
14.3 Percentage (1) 207
14.4 Quadratic Equations (1) 207
14.5 Quantitative Aptitude (16) 207
Answer Keys 210
15 General Aptitude: Verbal Aptitude (8) 211
 15.1 Logical Reasoning (2) 211
15.2 Quantitative Aptitude (2) 212
Answer Keys 212
16 Non GATE: Artificial Intelligence (44) 213
16.1 Artificial Intelligence (14) 213
16.2 Artificial Neural Network (1) 216
16.3 Back Propagation (1) 216
16.4 Blocks World Problem (1) 216
16.5 Chaining (1) 216
16.6 Expert System (2) 216
16.7 Fuzzy Logic (1) 216
16.8 Genetic Algorithms (1) 217
16.9 Heuristic Search (1) 217
16.10 Linear Programming (1) 217
16.11 Machine Learning (4) 217
16.12 Map Coloring (1) 218
16.13 Means End (1) 218
16.14 Minimax Procedure (1) 218
16.15 Neural Network (4) 219
16.16 Planning (1) 219
16.17 Prolog (2) 220
16.18 Reinforcement Learning (1) 220
16.19 Searches (1) 220
16.20 Sigmoid Function (1) 221
16.21 Strips (1) 221
Answer Keys 221
17 Non GATE: Big Data Systems (1) 222
17.1 Big Data Systems (1) 222
Answer Keys 222
18 Non GATE: Cloud Computing (1) 223
18.1 Cloud Computing (1) 223
Answer Keys 223
19 Non GATE: Computer Graphics (80) 224
19.1 2d Geometry (1) 224
19.2 2d Transformation (1) 224
19.3 3d Graphics (2) 224
19.4 3d Rotation (1) 224
19.5 Animation (1) 225
19.6 Anti Aliasing (1) 225
19.7 Breshenmans Algorithm (1) 225
19.8 Color Models (1) 225
19.9 Computer Graphics (38) 225
19.10 Crt (2) 233
19.11 Digital Image Processing (5) 233
19.12 Display Devices (1) 234
19.13 Frame Buffer (1) 234
19.14 Halftoning (1) 234
19.15 Image Compression (1) 235
19.16 Image Entropy (1) 235
19.17 Line Clipping (1) 235
19.18 Line Drawing Algorithm (3) 235
19.19 Parametric Line Equation (1) 236
19.20 Phong Color Model (1) 236
19.21 Projection (8) 236
19.22 Raster Graphics (2) 238
19.23 Resolution (1) 238
19.24 Rotation (2) 238
19.25 Transformation (2) 239
Answer Keys 239
20 Non GATE: Computer Peripherals (3) 240
20.1 Computer Peripherals (1) 240
20.2 Io Devices (1) 240
20.3 Matrix Printer (1) 240
Answer Keys 240
21 Non GATE: Data Mining and Warehousing (16) 241
21.1 Data Cube (1) 241
21.2 Data Mining (1) 241
21.3 Data Mining And Warehousing (1) 241
21.4 Decision Tree (1) 241
21.5 Expert System (1) 241
21.6 Fuzzy Sets (1) 242
21.7 Group Decision Support System (1) 242
21.8 K Means Clustering (1) 242
21.9 Knowledge Representation (5) 242
21.10 Olap (1) 243
21.11 Perceptron (1) 243
Answer Keys 244
22 Non GATE: Digital Image Processing (8) 245
22.1 Discovolution (1) 245
22.2 Entropy (2) 245
22.3 Fourier Transform (1) 245
22.4 Image Compression (4) 245
Answer Keys 246
23 Non GATE: Digital Signal Processing (4) 247
23.1 Butterworth Lowpass Filter (1) 247
23.2 Digital Signal Processing (1) 247
23.3 Discrete Memoryless Channel (1) 247
23.4 Spatial Mask (1) 247
Answer Keys 247
24 Non GATE: Distributed Computing (11) 248
24.1 Computing Models (1) 248
24.2 Distributed Computing (3) 248
24.3 Distributed Databases (2) 248
24.4 Distributed System (2) 249
24.5 Message Passing (1) 249
24.6 Parallel Virtual Machine (1) 249
24.7 Rpc (1) 249
Answer Keys 250
25 Non GATE: Geometry (2) 251
25.1 Geometry (1) 251
25.2 Lines Curves (1) 251
Answer Keys 251
26 Non GATE: Integrated Circuits (1) 252
26.1 Integrated Circuits (1) 252
Answer Keys 252
27 Non GATE: IS&Software Engineering (210) 253
27.1 Adaptive Maintenance (1) 256
27.2 Artificial Intelligence (2) 256
27.3 Assignment Problem (1) 257
27.4 Cmm Model (3) 257
27.5 Cmmi (1) 258
27.6 Cocomo Model (3) 258
27.7 Coding And Testing (1) 258
27.8 Cohesion (2) 259
27.9 Cost Estimation Model (2) 259
27.10 Coupling (3) 259
27.11 Coupling Cohesion (1) 260
 27.12 Crc Polynomial (1) 260
27.13 Cyclomatic Complexity (3) 260
27.14 Data Mining (2) 261
27.15 Digital Marketing (1) 261
27.16 Dual Linear Programming (1) 262
27.17 Fan In (1) 262
27.18 Flow Chart (1) 262
27.19 Function Point Metric (2) 262
27.20 Git (1) 262
27.21 Information System (1) 262
27.22 Is&software Engineering (60) 263
27.23 Life Cycle Model (1) 274
27.24 Linear Programming (1) 274
27.25 Mis (1) 274
27.26 Model View Controller (1) 274
27.27 Object Oriented Modelling (1) 274
27.28 Project Planning (1) 274
27.29 Project Tracking (1) 275
27.30 Risk Management (3) 275
27.31 Size Metrices (1) 275
27.32 Software (1) 276
27.33 Software Configuration (1) 276
27.34 Software Cost Estimation (1) 276
27.35 Software Design (14) 276
27.36 Software Development (3) 279
27.37 Software Development Life Cycle Models (11) 279
27.38 Software Development Models (1) 281
27.39 Software Intergrity (1) 282
27.40 Software Maintenance (2) 282
27.41 Software Metrics (3) 282
27.42 Software Process (1) 283
27.43 Software Quality Assurance (2) 283
27.44 Software Quality Characteristics (1) 283
27.45 Software Reliability (8) 283
27.46 Software Requirement Specification (1) 284
27.47 Software Requirement Specifications (1) 285
27.48 Software Reuse (1) 285
27.49 Software Testing (23) 285
27.50 Software Validation (1) 288
27.51 Source Code Metric (1) 288
27.52 Uml (1) 289
27.53 Validation (1) 289
27.54 Waterfall Model (2) 289
27.55 White Box Testing (1) 289
Answer Keys 290
28 Non GATE: Java (11) 292
28.1 Abstract Method (1) 292
28.2 Applet (1) 292
28.3 Java (4) 292
28.4 Method Overriding (1) 293
28.5 Multi Threaded Programming (1) 293
28.6 Oops (1) 293
28.7 Servlet (1) 293
28.8 Wrapper Class Object (1) 294
Answer Keys 294
29 Non GATE: Numerical Methods (3) 295
29.1 Hungarian Method (1) 295
29.2 Operation Research Pert Cpm (1) 295
29.3 Simplex Method (1) 295
Answer Keys 295
30 Non GATE: Object Oriented Programming (59) 296
30.1 Abstract Class (2) 296
30.2 C++ (2) 296
30.3 Class (1) 297
30.4 Composition (1) 297
30.5 Constructor (3) 297
30.6 Cpp (1) 298
30.7 Final (1) 298
30.8 Friend Class (1) 298
30.9 Friend Function (2) 298
30.10 Inheritance (3) 299
30.11 Java (10) 299
30.12 Object Oriented Programming (24) 301
30.13 Operator Overloading (1) 305
30.14 Programming In C (1) 306
30.15 Software Design (1) 306
30.16 Template Vs Macro (1) 306
30.17 Windows (1) 306
Answer Keys 306
31 Non GATE: Optimization (17) 308
31.1 Assignment Problem (2) 308
31.2 Linear Programming (7) 308
31.3 Linear Programming Problem (1) 309
31.4 Optimization (2) 309
31.5 Transportation Problem (5) 310
Answer Keys 311
32 Non GATE: Others (51) 312
32.1 3 Puzzle (1) 313
32.2 Alpha Beta Pruning (1) 313
32.3 Alpha Cut (1) 313
32.4 Application Software (1) 313
32.5 Bigdata Hadoop (1) 314
32.6 Convex Optimization (1) 314
32.7 Data Mining (2) 314
32.8 Data Warehousing (4) 315
32.9 Debugger (1) 315
32.10 Defuzzification (1) 316
32.11 Encryption Decryption (1) 316
32.12 Fuzzy Relation (1) 316
32.13 Fuzzy Sets (5) 316
32.14 Hill Climbing Search (1) 317
32.15 Inventory (1) 318
32.16 K Mean Clustering (1) 318
32.17 Linear Programming (1) 318
32.18 Llp (1) 318
32.19 Machine Learning (1) 318
32.20 Operational Research (2) 319
32.21 Searching (1) 319
32.22 Shell (1) 319
32.23 Shell Script (2) 319
32.24 Simplex Method (2) 320
32.25 System Software& Compilers (1) 320
32.26 Transportation Problem (1) 320
32.27 Unified Modeling Language (1) 321
32.28 Unix (5) 321
32.29 Windows (1) 322
Answer Keys 322
33 Non GATE: Web Technologies (32) 323
33.1 Activex (1) 323
 33.2 Client Server Application (1) 323
33.3 Data Warehousing (1) 323
33.4 E Commerce (1) 323
33.5 Edi Layers (2) 323
33.6 Html (5) 324
33.7 Javascript (2) 324
33.8 Transmission Media (1) 325
33.9 Trojan Horse (1) 325
33.10 Web Technologies (8) 325
33.11 Xml (7) 327
33.12 Xsl (1) 328
Answer Keys 328
34 Operating System (227) 329
34.1 Applications In Windows (1) 335
34.2 Bankers Algorithm (1) 335
34.3 Binary Semaphore (1) 335
34.4 Context Switch (1) 335
34.5 Counting Semaphores (1) 335
34.6 Critical Section (1) 335
34.7 Deadlock (2) 336
34.8 Deadlock Prevention Avoidance Detection (6) 336
34.9 Delay (1) 337
34.10 Demand Paging (1) 337
34.11 Dijkstras Bankers Algorithm (1) 337
34.12 Directory Structure (1) 338
34.13 Disk Cpu Memory Interrupt (1) 338
34.14 Disk Scheduling (9) 338
34.15 Disks (7) 340
34.16 Distributed Computing (1) 341
34.17 Distributed System (1) 341
34.18 Dynamic Linking (1) 341
34.19 File System (7) 341
34.20 Fragmentation (1) 342
34.21 Hit Ratio (1) 343
34.22 Input Output (2) 343
34.23 Interrupts (2) 344
34.24 Io Handling (2) 344
34.25 Java (1) 344
34.26 Linux (1) 344
34.27 Lru (2) 345
34.28 Memory Management (8) 345
34.29 Mmu (1) 346
34.30 Monitors (1) 347
34.31 Multiprogramming Os (1) 347
34.32 Mutual Exclusion (1) 347
34.33 Os Protection (2) 347
34.34 Page Fault (6) 347
34.35 Page Replacement (5) 349
34.36 Paging (8) 349
34.37 Pipelining (1) 351
34.38 Process (2) 351
34.39 Process Model (2) 351
34.40 Process Scheduling (21) 351
34.41 Process Synchronization (2) 355
34.42 Ram (1) 356
34.43 Resource Allocation (3) 356
34.44 Runtime Environments (1) 357
34.45 Scheduling (4) 357
34.46 Seek Latency (1) 358
34.47 Semaphores (4) 358
 34.48 Shell Script (7) 359
34.49 Sjf (1) 360
34.50 Sstf (1) 360
34.51 Storage Devices (1) 360
34.52 System Call (2) 361
34.53 System Reliability (1) 361
34.54 Threads (5) 362
34.55 Tlb (2) 362
34.56 Transaction And Concurrency (1) 363
34.57 Unix (25) 363
34.58 Virtual Memory (8) 367
34.59 Vsam (1) 369
34.60 Windows (5) 369
Answer Keys 369
35 Others: Others (709) 372
35.1 Acid Properties (1) 462
35.2 Artificial Intelligence (1) 463
35.3 Assembly (1) 463
35.4 Binary Codes (1) 463
35.5 Binary Tree (1) 463
35.6 Boolean Algebra (1) 463
35.7 Compilation Phases (1) 464
35.8 Crypt Arithmetic (1) 464
35.9 Data Compression (1) 464
35.10 Data Flow Diagram (1) 464
35.11 Data Mart (1) 464
35.12 Data Mining (4) 464
35.13 Data Structures (1) 465
35.14 Data Warehousing (2) 465
35.15 Decomposition (1) 465
35.16 Digital Image Processing (3) 466
35.17 Disk Scheduling (1) 466
35.18 Disks (1) 466
35.19 Duality (1) 466
35.20 E Commerce (2) 467
35.21 E Payment (1) 467
35.22 E Technologies (3) 467
35.23 Encryption Decryption (2) 467
35.24 Enterprise Resource Planning (2) 468
35.25 Er Diagram (1) 468
35.26 File System (1) 468
35.27 Fuzzy Logic (2) 469
35.28 Fuzzy Relations (1) 469
35.29 Fuzzy Sets (2) 469
35.30 General Awareness (33) 470
35.31 Geographical Information System (1) 476
35.32 Hard Disk Drive (1) 476
35.33 Hashing (3) 477
35.34 Image Compression (1) 477
35.35 Information System (1) 477
35.36 Interpreter (1) 477
35.37 Is&software Engineering (1) 477
35.38 Java (1) 478
35.39 Job (1) 478
35.40 Linear Programming (3) 478
35.41 Linker (2) 479
35.42 Linux (1) 479
35.43 Management Information System (2) 479
35.44 Microprocessors (2) 480
35.45 Minimum Spanning Trees (1) 480
 35.46 Mis (1) 480
35.47 Mobile Communication (2) 480
35.48 Multiple Document Interface (1) 481
35.49 Natural Join (1) 481
35.50 Natural Language Processing (1) 481
35.51 Network Switching (1) 481
35.52 Neural Network (6) 482
35.53 Oops Concept (1) 483
35.54 Operator Overloading (1) 483
35.55 Pipelining (1) 483
35.56 Process Scheduling (2) 483
35.57 Prolog (1) 483
35.58 Quadratic Equations (1) 484
35.59 Queue (1) 484
35.60 Rdbms (2) 484
35.61 Relations (1) 484
35.62 Semantic Nets (1) 485
35.63 Shell (1) 485
35.64 Single Layer Perceptron (1) 485
35.65 Software Development Life Cycle Models (1) 485
35.66 Software Engineering Framework (1) 485
35.67 Software Testing (1) 486
35.68 Sql (4) 486
35.69 System Software Compilers (1) 486
35.70 Transaction And Concurrency (3) 487
35.71 Transportation Problem (3) 487
35.72 Trees (1) 488
35.73 Unix (4) 488
35.74 Virtual Memory (1) 489
35.75 Windows (4) 489
35.76 Windows Programming (2) 489
Answer Keys 490
36 Programming and DS (30) 494
36.1 Array Of Pointers (1) 494
36.2 Arrays (3) 494
36.3 Dangling Pointers (1) 494
36.4 Data Types (1) 495
36.5 Dynamic Memory Allocation (1) 495
36.6 Input Output Statement (1) 495
36.7 Operator Precedence (2) 495
36.8 Operators (2) 496
36.9 Parameter Passing (1) 496
36.10 Pointer Declaration (1) 496
36.11 Programming In C (14) 496
36.12 Storage Classes In C (1) 499
36.13 Three Dimensional Array (1) 500
Answer Keys 500
37 Programming and DS: DS (102) 501
37.1 Avl Tree (1) 503
37.2 B And Bplus Trees (1) 503
37.3 B Tree (1) 503
37.4 Bfs (1) 503
37.5 Binary Codes (1) 503
37.6 Binary Heap (1) 503
37.7 Binary Search Tree (5) 504
37.8 Binary Tree (8) 504
37.9 Cryptography (1) 506
37.10 Data Structures (6) 506
37.11 Graph Algorithms (1) 507
37.12 Graph Connectivity (1) 507
 37.13 Graphs (1) 507
37.14 Hashing (10) 508
37.15 Heap (6) 509
37.16 Heap Sort (1) 510
37.17 Infix Prefix (1) 510
37.18 Linked Lists (3) 510
37.19 Max Heap (1) 511
37.20 Priority (1) 511
37.21 Priority Queue (2) 511
37.22 Queue (4) 512
37.23 Quicksort (1) 512
37.24 Radix Sort (2) 512
37.25 Recursion (1) 513
37.26 Relational Algebra (1) 513
37.27 Spanning Tree (2) 513
37.28 Stack (12) 513
37.29 Tree Traversal (1) 515
37.30 Trees (9) 516
Answer Keys 517
38 Programming and DS: Programming (85) 518
38.1 Abstract Data Type (1) 523
38.2 Aliasing (1) 523
38.3 Arrays (2) 524
38.4 Binary Search Tree (1) 524
38.5 Bitwise Operation (1) 524
38.6 Data Types (2) 525
38.7 Evaluation Postfix (1) 525
38.8 Exception Handling (1) 525
38.9 Expression Evaluation (1) 525
38.10 File Handling (1) 525
38.11 Graphs (1) 525
38.12 Io Statement (1) 526
38.13 Java (4) 526
38.14 Linked Lists (1) 527
38.15 Loop (1) 527
38.16 Object Oriented Programming (3) 527
38.17 Operator Precedence (1) 528
38.18 Parameter Passing (1) 528
38.19 Pointers (2) 528
38.20 Programming In C (15) 529
38.21 Programming Paradigms (1) 531
38.22 Pseudocode (1) 532
38.23 Row Major Address Calculation (1) 532
38.24 Storage Classes In C (2) 532
38.25 Tree Traversal (1) 533
38.26 Undefined Behaviour (1) 533
38.27 Variable Binding (1) 533
38.28 Variable Scope (4) 533
Answer Keys 534
39 Theory of Computation (139) 536
39.1 Cfg (1) 541
39.2 Chomsky Normal Form (1) 541
39.3 Closure Property (2) 541
39.4 Cnf (1) 542
39.5 Complement (1) 542
39.6 Context Free Grammars (7) 542
39.7 Context Free Languages (7) 543
39.8 Context Sensitive (2) 544
39.9 Decidability (4) 545
39.10 Expression (1) 546
 39.11 Finite Automata (6) 546
39.12 Grammar (15) 547
39.13 Identify Class Language (7) 550
39.14 Language (1) 551
39.15 Languages Classification (1) 551
39.16 Languages Relationships (1) 552
39.17 Minimal State Automata (1) 552
39.18 Nfa Dfa (3) 552
39.19 Parsing (1) 553
39.20 Pumping Lemma (3) 553
39.21 Pushdown Automata (5) 553
39.22 Recursive And Recursively Enumerable Languages (2) 554
39.23 Regular Expressions (17) 554
39.24 Regular Grammar (3) 557
39.25 Regular Languages (11) 558
39.26 Right Quotient (1) 561
39.27 Strings (1) 561
39.28 Turing Machine (5) 561
Answer Keys 562
40 Unknown Category (235) 564
40.1 Binary Search Tree (1) 605
40.2 Cloud Computing (1) 605
40.3 Clustering (1) 605
40.4 Co And Architecture (2) 605
40.5 Computer Architecture (1) 605
40.6 Counting (1) 606
40.7 Deadlock (1) 606
40.8 Disk Scheduling (1) 606
40.9 Disks (1) 606
40.10 Dynamic Programming (1) 606
40.11 E Technologies (1) 606
40.12 Ethernet (1) 607
40.13 Finite Automata (1) 607
40.14 Floating Point Representation (1) 607
40.15 Graph Algorithms (1) 607
40.16 Heap (1) 607
40.17 Indexing (1) 608
40.18 Ip Addressing (1) 608
40.19 Linked Lists (1) 608
40.20 Microprocessors (1) 608
40.21 Minimum Spanning Trees (1) 608
40.22 Multiplexing (1) 609
40.23 Network Security (1) 609
40.24 Osi Model (1) 609
40.25 Page Fault (1) 609
40.26 Physical Layer (1) 609
40.27 Probability (1) 609
40.28 Process Synchronization (1) 610
40.29 Recurrence (1) 610
40.30 Round Robin (1) 610
40.31 Software Testing (1) 610
40.32 Sql (1) 610
40.33 Stack (1) 611
40.34 Subnetting (1) 611
40.35 Transaction And Concurrency (1) 611
Answer Keys 611
Contributors
User , Answers User Added User Done
sanjay 1082, 555 GO Editor 1398 sanjay 175
shekhar chauhan 677, 169 makhdoom ghaya 541 Arjun Suresh 145
Arjun Suresh 406, 19 Arjun Suresh 342 Sankaranarayanan P.N 84
Leen Sharma 349, 114 RISHABH KUMAR 143 RISHABH KUMAR 67
VIPIN NARAYAN 313, 175 Pooja Khatri 97 Prashant Singh 47
Prashant Singh 221, 89 soujanyareddy13 76 VIPIN NARAYAN 44
Rajarshi Sarkar 136, 2 sanjay 56 Leen Sharma 39
Mojo Jojo 127, 1 Debasmita Bhoumik 21 srestha 34
Sachin Mittal 93, 1 Kathleen Bankson 18 Debasmita Bhoumik 32
Sandeep_Uniyal 89, 1 sourav. 27
Muktinath Vishwakarma 87, 15 Manoj Kumar 24
papesh 82, 29 shekhar chauhan 18
Bikram 81, 3 Dhananjay Kumar Sharma 14
Debasmita Bhoumik 78, 58 Lakshman Patel 13
Akash Kanase 74, 1 Resmi Arjun 13
Rajesh Pradhan 72, 27 papesh 12
jayendra 65, 2 Bikram 10
Amar Vashishth 63, 1 Abhishek 10
Satbir Singh 59, 19 asutosh kumar Biswal 10
Gate Keeda 56, 2 Kapil Phulwani 10
shashi shekhar 53, 1 Satbir Singh 9
RISHABH KUMAR 44, 102 deepthi 9
Dhananjay Kumar Sharma 41, 12 Tauhin Gangwar 9
Praveen Saini 36, 4 shahidhope 9
srestha 35, 16 soujanyareddy13 8
asutosh kumar Biswal 32, 16 Hira 8
Hira 32, 43 Desert_Warrior 8
Kapil Phulwani 31, 7 Aboveallplayer 7
Don't you worry 30, 8 shivani Sharma 7
kunal chalotra 29, 20 Rajesh Pradhan 7
sumit kumar singh dixit 26, 1 Jeet Rajput 6
Sankaranarayanan P.N 26, 13 kenzou 6
Vicky rix 25, 1 Prajwal Bhat 6
Ashwani Kumar 25, 22 Rishabh Gupta 6
Prasanjeet Ghosh 25, 26 im.raj 6
Shaik Masthan 23, 19 Rishi yadav 6
Shyam Singh 22, 1 Praveen Saini 5
Sayan Bose 22, 14 Meenakshi Sharma 5
Roma Nagpal 5
Shobhit Joshi 5
Ram Swaroop1 4
Prabhanjan_1 4
Shubham Pandey 4
Debashish Deka 4
Shaik Masthan 4
Sayan Bose 4
V Sharma 3
nocturnal123 3
Prasanjeet Ghosh 3
Don't defeat anybody but yourself. 3
Subham Mishra 3
Muktinath Vishwakarma 3
Pooja Palod 3
Suvasish Dutta 2
Arnabi Bej 2
Akash Kanase 2
Akhil Nadh PC 2
saurabh rai 2
Hradesh patel 2
gatecse 2
gshivam63 2
Kuljeet Singh 2
rio 2
kunal chalotra 2
Mk Utkarsh 2
Milicevic3306 2
sushmita 2
Rohit kumar1 2
DEVWRITT ARYA 2
omveer 2
SuShrut2311 2
1 Algorithms (99)

1.0.1 UGCNET-Dec2004-II: 25 https://gateoverflow.in/335372

How much extra space is used by heapsort ?

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

ugcnetdec2004ii

1.0.2 UGCNET-Oct2020-II: 73 https://gateoverflow.in/349600

Match List I with List II

List I List II
(A) Greedy Best-First Search (I) Space complexity is O(d) where
d=depth of the deepest optimal
solution
(B) A∗ (II) Incomplete even if the search space is
finite
(C) Recursive Best-First Search (III) Optimal if optimal solution is
reachable; otherwise, returns the best
reachable optimal solution
(D) SMA* (IV ) Computation and space complexity
is too high
Choose the correct answer from the options given below:
A. A − II, B − IV , C − I, D − III B. A − II, B − III, C − I, D − IV
C. A − III, B − II, C − IV , D − I D. A − III, B − IV , C − II, D − I
ugcnet-oct2020-ii algorithms

1.0.3 UGCNET-Oct2020-II: 78 https://gateoverflow.in/349595

Consider the undirected graph below:

Using Prim’s algorithm to construct a minimum spanning tree starting with node a, 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. (a, b), (a, h), (g, h), (f, g), (c, f), (c, i), (c, d), (d, e)
B. (a, b), (b, h), (g, h), (g, i), (c, i), (c, f), (c, d), (d, e)
C. (a, b), (b, c), (c, i), (c, f), (f, g), (g, h), (c, d), (d, e)
D. (a, b), (g, h), (g, f), (c, f), (c, i), (f, e), (b, c), (d, e)

ugcnet-oct2020-ii algorithms

1.0.4 UGCNET-Oct2020-II: 90 https://gateoverflow.in/349583

Given below are two statements:

Statement I : A genetic algorithm is a stochastic hill-climbing search in which a large population of states is maintained
Statement II : 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 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

ugcnet-oct2020-ii algorithms

1.0.5 UGCNET-June2012-II: 2 https://gateoverflow.in/55603

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

ugcnetjune2012ii algorithms

1.0.6 UGCNET-Dec2006-II: 21 https://gateoverflow.in/335650

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
ugcnetdec2006ii

1.0.7 UGCNET-Dec2013-II: 25 https://gateoverflow.in/60115

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

ugcnetdec2013ii algorithms merge-sort

1.0.8 UGCNET-June2013-III: 68 https://gateoverflow.in/58894

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
ugcnetjune2013iii algorithms

1.0.9 UGCNET-Oct2020-II: 70 https://gateoverflow.in/349603

Match list I with List II

List I List II
(A) Topological sort of DAG (I) O(V + E)
(B) Kruskal’s MST algorithm (II) O(V E)
(C) Bellman-Ford’s single-source shortest (III) θ(V + E)
path algorithm
(D) Floyd-Warshall’s all pair shortest (IV ) θ(V 3 )
path algorithm
Choose the correct answer from the options given below:
A. A − I, B − III, C − IV , D − II B. A − III, B − I, C − IV , D − II
C. A − III, B − I, C − II, D − IV D. A − I, B − III, C − II, D − IV

ugcnet-oct2020-ii algorithms

1.0.10 UGCNET-Jan2017-III: 36 https://gateoverflow.in/335202

Match the following with respect to algorithm paradigms :

 List-I List-II
a. Merge sort i. Dynamic programming
b. Huffman coding ii. Greedy approach
c. Optimal polygon triangulation iii. Divide and conquer
d. Subset sum problem iv. Back tracking
Codes :
A. a-iii, b-i, c-ii, d-iv B. a-ii, b-i, c-iv, d-iii
C. a-ii, b-i, c-iii, d-iv D. a-iii, b-ii, c-i, d-iv
ugcnetjan2017iii algorithms

1.0.11 UGCNET-Oct2020-II: 69 https://gateoverflow.in/349604

Match List I with List II

With reference to CMM developed by Software Engineering Institute (SEI)
List I List II
(A) Branch-and-bound (I) Keeps track of all partial paths
which can be candidate for
further exploration.
(B) Steepest-accent hill climbing (II) Defects difference between current
state and goal state
(C) Constraint satisfaction (III) Discovers problem state(s) that satisfy
a set of constraints
(D) Means-end-analysis (IV ) Considers all moves from current state
and selects best move
Choose the correct answer from the options given below:
A. A − I, B − IV , C − III, D − II B. A − I, B − II, C − III, D − IV
C. A − II, B − I, C − III, D − IV D. A − II, B − IV , C − III, D − I
ugcnet-oct2020-ii non-gate algorithms

1.0.12 UGCNET-AUG2016-III: 36 https://gateoverflow.in/70961

Match the following :

a. Prim’s algorithm i. O(V 2 E)
b. Bellman-Ford algorithm ii. O(V ElgV )
c. Floyd-Warshall algorithm iii. O(ElgV )
d. Johnson’s algorithm iv. O(V 3 )
where V is the set of nodes and E is the set of edges in the graph.
Codes :
A. a-i, b-iii, c-iv, d-ii
B. a-i, b-iii, c-ii, d-iv
C. a-iii, b-i, c-iv, d-ii
D. a-iii, b-i, c-ii, d-iv

ugcnetaug2016iii algorithms

1.0.13 UGCNET-July-2018-II: 30 https://gateoverflow.in/225856

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

ugcnetjuly2018ii algorithms
 1.0.14 UGCNET-July-2018-II: 27 https://gateoverflow.in/225859

Match the following with respect to algorithm paradigms :

List-I List-II
(a) The 8-Queen's problem (i) Dynamic programming
(b) Single-Source shortest paths (ii) Divide and Conquer
(c) STRASSEN's Matrix multiplication (iii) Greedy approach
(d) Optimal Binary search trees (iv) Back tracking
Code :
A. (a)-(iv), (b)-(i), (c)-(iii), (d)-(ii) B. (a)-(iv), (b)-(iii), (c)-(i), (d)-(ii)
C. (a)-(iii), (b)-(iv), (c)-(ii), (d)-(i) D. (a)-(iv), (b)-(iii), (c)-(ii), (d)-(i)
ugcnetjuly2018ii algorithms

1.0.15 UGCNET-Sep2013-III: 40 https://gateoverflow.in/50831

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

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

algorithms ugcnetsep2013iii

1.1 Activity Selection Problem (1)

1.1.1 Activity Selection Problem: UGCNET-Dec2015-III: 16 https://gateoverflow.in/62467

In Activity-Selection problem, each activity i has a start time si and a finish time fi where si ≤ fi . Activities i and j
are compatible if
A. si ≥ fj B. sj ≥ fi
C. si ≥ fj or sj ≥ fi D. si ≥ fj and sj ≥ fi
ugcnetdec2015iii algorithms activity-selection-problem

1.2 Algorithm Design Techniques (1)

1.2.1 Algorithm Design Techniques: UGCNET-Dec2006-II: 22 https://gateoverflow.in/335649

Binary search tree is an example of :

A. Divide and conquer technique B. Greedy algorithm
C. Back tracking D. Dynamic Programming
ugcnetdec2006ii algorithms algorithm-design-techniques

1.3 Algorithm Efficiency (1)

1.3.1 Algorithm Efficiency: UGCNET-June2015-II: 25 https://gateoverflow.in/60979

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
ugcnetjune2015ii algorithm-efficiency

1.4 Algorithms Sorting (1)

1.4.1 Algorithms Sorting: UGCNET-June2015-II: 48 https://gateoverflow.in/61090

Which of the following algorithms sort n integers, having the range 0 to (n2 − 1), in ascending order in O(n) time?

A. Selection sort B. Bubble sort

C. Radix sort D. Insertion sort
ugcnetjune2015ii algorithms-sorting

1.5 Arrays (2)

 1.5.1 Arrays: UGCNET-Jan2017-II: 21 https://gateoverflow.in/335142

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

A. Insertion – 0(1), Deletion – 0(1), Maximum – 0(1), Minimum – 0(1)

B. Insertion – 0(1), Deletion – 0(1), Maximum – 0(n), Minimum – 0(n)
C. Insertion – 0(n), Deletion – 0(n), Maximum – 0(1), Minimum – 0(1)
D. Insertion – 0(n), Deletion – 0(n), Maximum – 0(n), Minimum – 0(n)

ugcnetjan2017ii algorithms arrays

1.5.2 Arrays: UGCNET-June2016-III: 32 https://gateoverflow.in/63954

Let A[1, . . . , n] be an array of n distinct numbers. If i < j and A[i] > A[j], then the pair (i, j) is called an inversion
of A. What is the expected number of inversions in any permutation on n elements?

A. θ(n) B. θ(lgn) C. θ(nlgn) D. θ(n2 )

ugcnetjune2016iii algorithms arrays

1.6 Artificial Intelligence (2)

1.6.1 Artificial Intelligence: UGCNET-June2014-III: 31 https://gateoverflow.in/56790

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

1.6.2 Artificial Intelligence: UGCNET-June2014-III: 33 https://gateoverflow.in/56793

________ 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

1.7 Asymptotic Notations (7)

1.7.1 Asymptotic Notations: UGCNET-Dec2013-II: 35 https://gateoverflow.in/60226

Big-O estimate for f(x) = (x + 1) log(x2 + 1) + 3x2 is given as

A. O(x log x) B. O(x2 ) C. O(x3 ) D. O(x2 log x)

ugcnetdec2013ii asymptotic-notations

1.7.2 Asymptotic Notations: UGCNET-Dec2013-III: 35 https://gateoverflow.in/60563

Let A and B be two n ×n matrices. The efficient algorithm to multiply the two matrices has the time complexity

A. O(n3 ) B. O(n2.81 ) C. O(n2.67 ) D. O(n2 )

ugcnetdec2013iii algorithms asymptotic-notations

1.7.3 Asymptotic Notations: UGCNET-Dec2013-III: 36 https://gateoverflow.in/60565

The recurrence relation T(n) = mT( n2 ) + tan2 is satisfied by

A. O(n2 ) B. O(nlg m )
C. O(n2 lg n) D. O(n lg n)
ugcnetdec2013iii algorithms asymptotic-notations recurrence
 1.7.4 Asymptotic Notations: UGCNET-Jan2017-III: 31 https://gateoverflow.in/335207

The asymptotic upper bound solution of the recurrence relation given by T(n) = 2T ( n2 ) + n
lg n
is:

A. O(n2 ) B. O(n lg n) C. O(n lg lg n) D. O(lg lg n)

ugcnetjan2017iii algorithms asymptotic-notations

1.7.5 Asymptotic Notations: UGCNET-June2014-II: 24 https://gateoverflow.in/54051

Big-O estimates for the factorial function and the logarithm of the factorial function i.e. n! and log n! is given by
A. O(n!) and O(n log n) B. O(nn ) and O(n log n)
C. O(n!) and O(log n!) D. O(nn ) and O(log n!)
ugcnetjune2014ii algorithms time-complexity asymptotic-notations

1.7.6 Asymptotic Notations: UGCNET-June2014-III: 61 https://gateoverflow.in/57269

Given the following equalities : E1 : nK+∈ + nK lg n = θ(nK+∈ ) for all fixed K and ∈, K ≥ 0 and ∈> 0.
E2 : n3 2n + 6n2 3n = O(n3 2n ) . Which of the following is true ?

1. E1 is correct and E2 is correct.

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

asymptotic-notations ugcnetjune2014iii

1.7.7 Asymptotic Notations: UGCNET-June2015-III: 35 https://gateoverflow.in/13101

Let f(n) and g(n) be asymptotically non-negative functions. Which of the following is correct?

A. θ(f(n)∗ g(n)) = min(f(n), g(n)) B. θ(f(n)∗ g(n)) = max(f(n), g(n))

C. θ(f(n) + g(n)) = min(f(n), g(n)) D. θ(f(n) + g(n)) = max(f(n), g(n))
asymptotic-notations algorithms ugcnetjune2015iii

1.8 B Tree (2)

1.8.1 B Tree: UGCNET-Dec2010-II: 21 https://gateoverflow.in/66819

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

A. 111 B. 999 C. 9999 D. None of the above

ugcnetdec2010ii algorithms b-tree

1.8.2 B Tree: UGCNET-Dec2013-II: 24 https://gateoverflow.in/60083

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

ugcnetdec2013ii algorithms b-tree

1.9 Binary Search Tree (1)

1.9.1 Binary Search Tree: UGCNET-Jan2017-II: 25 https://gateoverflow.in/335138

Which of the following statements is false?

a. Optimal binary search tree

b. Breadth-first
construction search
can be cannot
performed
c. Given
be used
efficiently
thetoprefix
findusing
connected
and postfix
dynamic
d. Depth-first-search
components
walks
programming.
of a binary
of a graph.
can
tree,
bethe
used
tree
tocannot
find thebeconnected
reconstructed
components
uniquelyo

A. a B. b C. c D. d
ugcnetjan2017ii algorithms binary-tree binary-search-tree

1.10 Binary Tree (4)

 1.10.1 Binary Tree: UGCNET-Dec2010-II: 22 https://gateoverflow.in/66821

A binary tree with 27 nodes has _______ null branches.

A. 54 B. 27 C. 26 D. None of the above

ugcnetdec2010ii algorithms binary-tree

1.10.2 Binary Tree: UGCNET-Dec2011-II: 19 https://gateoverflow.in/63555

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

A. ABFCDE B. ADBFEC C. ABDECF D. ABDCEF

ugcnetdec2011ii algorithms binary-tree

1.10.3 Binary Tree: UGCNET-Dec2011-II: 50 https://gateoverflow.in/64195

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

A. 20 + 21 + … . . 2h B. 20 + 21 + … . . 2h−1
C. 20 + 21 + … . . 2h+1 D. 21 + … . . 2h+1
ugcnetdec2011ii algorithms binary-tree

1.10.4 Binary Tree: UGCNET-Dec2014-II: 25 https://gateoverflow.in/59410

A full binary tree with n leaves contains

A. n nodes B. log2 n nodes
C. 2n– 1 nodes D. 2n nodes
ugcnetdec2014ii algorithms binary-tree

1.11 Branch And Bound (1)

1.11.1 Branch And Bound: UGCNET-June2015-III: 58 https://gateoverflow.in/61342

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

ugcnetjune2015iii algorithms branch-and-bound tree-search-algorithm graph-search

1.12 Decision Tree (1)

1.12.1 Decision Tree: UGCNET-Dec2014-III: 31 https://gateoverflow.in/60623

Any decision tree that sorts n elements has height

A. Ω(n) B. Ω(lgn) C. Ω(nlgn) D. Ω(n2 )

ugcnetdec2014iii algorithms decision-tree

1.13 Dfs (2)

1.13.1 Dfs: UGCNET-Dec2015-II: 36 https://gateoverflow.in/62283

In the following graph, discovery time stamps and finishing time stamps of Depth First Search (DFS) are shown as
x/y, where x is discovery time stamp and y 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}
ugcnetdec2015ii algorithms dfs

1.13.2 Dfs: UGCNET-June-2019-II: 65 https://gateoverflow.in/316214

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

ugcnetjune2019ii dfs

1.14 Dijkstras Algorithm (1)

1.14.1 Dijkstras Algorithm: UGCNET-Jan2017-III: 35 https://gateoverflow.in/335203

Dijkstra’s algorithm is based on

A. Divide and conquer paradigm B. Dynamic programming
C. Greedy approach D. Backtracking paradigm
ugcnetjan2017iii algorithms dijkstras-algorithm

1.15 Double Hashing (1)

1.15.1 Double Hashing: UGCNET-June-2019-II: 66 https://gateoverflow.in/316213

Consider double hashing of the form

h(k, i) = (h1 (k) + ih2 (k))mod m where h1 (k) = k mod m , h2 (k) = 1 + (k mod n) where n = m − 1 and
m = 701. For k = 123456, what is the difference between first and second probes in terms of slots?

A. 255 B. 256 C. 257 D. 258

ugcnetjune2019ii double-hashing

1.16 Dynamic Programming (3)

1.16.1 Dynamic Programming: UGCNET-AUG2016-III: 31 https://gateoverflow.in/70941

Consider the problem of a chain < A1 , A2 , A3 , A4 > of four matrices. Suppose that the dimensions of the matrices
A1 , A2 , A3 and A4 are 30 × 35, 35 × 15, 15 × 5 and 5 × 10 respectively. The minimum number of scalar
multiplications needed to compute the product A1 A2 A3 A4 is ____.

A. 14875 B. 21000 C. 9375 D. 11875

ugcnetaug2016iii algorithms dynamic-programming numerical-answers matrices

1.16.2 Dynamic Programming: UGCNET-Dec2013-III: 37 https://gateoverflow.in/60569

The longest common subsequence of the sequences X =< A, B, C, B, D, A, B > and Y =< B, D, C, A, B, A >
has length

A. 2 B. 3 C. 4 D. 5
ugcnetdec2013iii algorithms dynamic-programming

1.16.3 Dynamic Programming: UGCNET-June2016-III: 36 https://gateoverflow.in/63960

A triangulation of a polygon is a set of T chords that divide the polygon into disjoint triangles. Every triangulation of n
vertex convex polygon has ____ chords and divides the polygon into ____ triangles

A. n − 2, n − 1 B. n − 3, n − 2 C. n − 1, n D. n − 2, n − 2
ugcnetjune2016iii algorithms dynamic-programming

1.17 Graph Algorithms (3)

 1.17.1 Graph Algorithms: GATE IT 2007 | Question: 3, UGCNET-June2012-III: 34 https://gateoverflow.in/3434

Consider a weighted, undirected graph with positive edge weights and let uv be an edge in the graph. It is known that
the shortest path from the source vertex s to u has weight 53 and the shortest path from s to v has weight 65. Which
one of the following statements is always TRUE?
A. Weight (u, v) ≤ 12 B. Weight (u, v) = 12
C. Weight (u, v) ≥ 12 D. Weight (u, v) > 12
gateit-2007 algorithms graph-algorithms normal ugcnetjune2012iii

1.17.2 Graph Algorithms: UGCNET-Dec2015-III: 20 https://gateoverflow.in/62472

Floyd-Warshall algorithm utilizes _____ to solve the all-pairs shortest paths problem on a directed graph in ____ time
A. Greedy algorithm, θ(V 3 ) B. Greedy algorithm, θ(V 2 lgn)
C. Dynamic programming, θ(V 3 ) D. Dynamic programming, θ(V 2 lgn)
ugcnetdec2015iii graph-algorithms algorithms

1.17.3 Graph Algorithms: UGCNET-June-2019-II: 61 https://gateoverflow.in/316218

Match List-I with List-II:

List-I List-II
(a) Prim’s algorithm (i) O(V 3 log V )
(b) Dijkstra’s algorithm (ii) O(V E 2 )
(c) Faster all-pairs shortest path (iii) O(ElgV )
(d) Edmonds-Karp algorithm (iv) O(V 2 )

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)

ugcnetjune2019ii graph-algorithms

1.18 Greedy Algorithms (1)

1.18.1 Greedy Algorithms: UGCNET-June2015-III: 64 https://gateoverflow.in/61454

1 1 1 2 3 5 5 12 respectively.
Given the symbols A, B, C, D, E, F, G and H with the probabilities 30 , 30 , 30 , 30 , 30 , 30 , 30 and 30 The
average Huffman code size in bits per symbol is
67 70 76 78
A. 30 B. 34 C. 30 D. 30
ugcnetjune2015iii algorithms greedy-algorithms huffman-code

1.19 Hashing (1)

1.19.1 Hashing: UGCNET-DEC2016-II: 24 https://gateoverflow.in/115845

If h is chosen from a universal collection of hash functions and is used to hash n keys into a table of size m, where
n ≤ m, the expected number of collisions involving a particular key x is less than _____

A. 1 B. 1/n C. 1/m D. n/m

ugcnetdec2016ii algorithms hashing

1.20 Heap (1)

1.20.1 Heap: UGCNET-Dec2012-III: 51 https://gateoverflow.in/57723

Suppose there are logn sorted lists of n logn element each. The time complexity of producing a sorted list of all these
elements is (use heap data structure)
 A. O(n log logn ) B. θ(n logn )
C. Ω(n logn ) D. Ω(n3/2 )
ugcnetdec2012iii algorithms time-complexity heap

1.21 Huffman Code (2)

1.21.1 Huffman Code: UGCNET-June2016-III: 34 https://gateoverflow.in/63956

Match the following :

(a) Huffman Code (i) O(n2 )
(b) Optical Polygon Triangulation (ii) θ(n2 )
(c) Activity Selection Problem (iii) O(n lg n)
(d) Quicksort (iv) θ(n)
Codes :
A. (a)-(i), (b)-(ii), (c)-(iv), (d)-(iii) B. (a)-(i), (b)-(iv), (c)-((ii), (d)-(iii)
C. (a)-(iii), (b)-(ii), (c)-(iv), (d)-(i) D. (a)-(iii), (b)-(iv), (c)-(ii), (d)-(i)
ugcnetjune2016iii algorithms huffman-code

1.21.2 Huffman Code: UGCNET-June2016-III: 59 https://gateoverflow.in/64113

Consider a source with symbols A, B, C, D with probabilities 1/2, 1/4, 1/8, 1/8 respectively. What is the average
number of bits per symbol for the Huffman code generated from above information?
A. 2 bits per symbol B. 1.75 bits per symbol
C. 1.50 bits per symbol D. 1.25 bits per symbol
ugcnetjune2016iii algorithms huffman-code probability

1.22 In Place Algo (1)

1.22.1 In Place Algo: UGCNET-June-2019-II: 62 https://gateoverflow.in/316217

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

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

C. Insertion sort, Quick sort D. Insertion sort, Merge sort
ugcnetjune2019ii in-place-algo quicksort-mergesort-insertion-sort

1.23 Knapsack (2)

1.23.1 Knapsack: UGCNET-June2014-III: 62 https://gateoverflow.in/57271

Consider the fractional knapsack instance

n = 4, (p1 , p2 , p3 , p4 ) = (10, 10, 12, 18), (w1 , w2 , w3 , w4 ) = (2, 4, 6, 9) and M = 15 .
The maximum profit is given by (Assume p and w denotes profit and weight of objects respectively)

A. 40 B. 38 C. 32 D. 30
ugcnetjune2014iii algorithms greedy-algorithm knapsack

1.23.2 Knapsack: UGCNET-Sep2013-III: 42 https://gateoverflow.in/59861

Given 0-1 knapsack problem and fractional knapsack problem and the following statements:
S1 : 0-1 knapsack is efficiently solved using Greedy algorithm.
S2 : Fractional knapsack is efficiently solved using Dynamic programming.
Which of the following is true?
A. S1 is correct and S2 is not correct B. Both S1 and S2 are correct
C. Both S1 and S2 are not correct D. S1 is not correct and S2 is correct
ugcnetsep2013iii algorithms knapsack

1.24 Linear Search (1)

 1.24.1 Linear Search: UGCNET-June2015-II: 24 https://gateoverflow.in/60976

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

ugcnetjune2015ii algorithms linear-search

1.25 Longest Common Subsequence (1)

1.25.1 Longest Common Subsequence: UGCNET-Dec2015-III: 17 https://gateoverflow.in/62469

Given two sequences X and Y :

X = ⟨a, b, c, b, d, a, b⟩
Y = ⟨b, d, c, a, b, a⟩
The longest common subsequence of X and Y is:
A. ⟨b, c, a⟩ B. ⟨c, a, b⟩
C. ⟨b, c, a, a⟩ D. ⟨b, c, b, a⟩
ugcnetdec2015iii algorithms longest-common-subsequence

1.26 Matrix Chain Ordering (3)

1.26.1 Matrix Chain Ordering: UGCNET-Dec2014-III: 35 https://gateoverflow.in/60631

Consider the problem of a chain < A1 , A2 , A3 > of three matrices. Suppose that the dimensions of the matrices are
10 × 100, 100 × 5 and 5 × 50 respectively. There are two different ways of parenthesization : (i) ((A1 A2 )A3 ) and
(ii) (A1 (A2 A3 )) . Computing the product according to the first parenthesization is ______ times faster in comparison to the
second parenthesization.

A. 5 B. 10 C. 20 D. 100
ugcnetdec2014iii algorithms matrix-chain-ordering

1.26.2 Matrix Chain Ordering: UGCNET-Jan2017-III: 34 https://gateoverflow.in/335204

The minimum number of scalar multiplication required, for parenthesization of a matrix-chain product whose
sequence of dimensions for four matrices is < 5, 10, 3, 12, 5 > is

A. 630 B. 580 C. 480 D. 405

ugcnetjan2017iii algorithms matrix-chain-ordering

1.26.3 Matrix Chain Ordering: UGCNET-Sep2013-III: 39 https://gateoverflow.in/59859

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

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

ugcnetsep2013iii algorithms dynamic-programming matrix-chain-ordering

1.27 Optimal Search Tree (1)

1.27.1 Optimal Search Tree: UGCNET-Dec2015-III: 21 https://gateoverflow.in/62473

3 3 1 1
L e tn=4 and (a1 , a2 , a3 , a4 ) =(do, if, int, while). Let p(1 : 4) = ( ,, , ) and
8 8 8 8
2 3 1 1 1
q(1 : 4) = ( , , , , ) where p(i) and q(i) denotes the probability with which we search ai and the identifier x being
8 8 8 8 8
searched satisfy ai < x < ai+1 respectively. The optimal search tree is given by:
 ugcnetdec2015iii algorithms optimal-search-tree

1.28 Optimal Solution (1)

1.28.1 Optimal Solution: UGCNET-June-2019-II: 68 https://gateoverflow.in/316211

Consider the following steps:

S1 : Characterize the structure of an optimal solution
S2 : 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 S1 B. Only S2 C. Both S1 and S2 D. Neither S1 nor S2

ugcnetjune2019ii optimal-solution dynamic-programming greedy-algorithm

1.29 P Np Npc Nph (3)

1.29.1 P Np Npc Nph: UGCNET-Dec2014-III: 33 https://gateoverflow.in/60628

We can show that the clique problem is NP -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
ugcnetdec2014iii algorithms p-np-npc-nph

1.29.2 P Np Npc Nph: UGCNET-June-2019-II: 67 https://gateoverflow.in/316212

Consider the complexity class CO − NP as the set of languages L such that ¯¯

¯¯
L ∈ NP , and the following two
statements:
S1 : P ⊆ CO − NP
S2 : If NP ≠ CO − NP , then P ≠ NP
Which of the following is/are correct?

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

ugcnetjune2019ii p-np-npc-nph

1.29.3 P Np Npc Nph: UGCNET-June2015-III: 32 https://gateoverflow.in/13100

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 ugcnetjune2015iii

1.30 Parenthesization (1)

 1.30.1 Parenthesization: UGCNET-June2016-II: 25 https://gateoverflow.in/63430

In how many ways can the string A ∩ B − A ∩ B − A be fully paranthesized to yield an infix expression?

A. 15 B. 14 C. 13 D. 12
ugcnetjune2016ii parenthesization

1.31 Quicksort (1)

1.31.1 Quicksort: UGCNET-June2014-III: 66 https://gateoverflow.in/57582

Suppose that the splits at every level of quicksort are in the proportion (1– α) to α, where 0 < α ≤ 1 is a constant.
2
The minimum depth of a leaf in the recursion tree is approximately given by
lgn lg(1−α)
A. − lg(1−α) B. − lgn
lgn lgα
C. − lgα D. − lgn
ugcnetjune2014iii data-structures sorting algorithms quicksort

1.32 Recurrence (6)

1.32.1 Recurrence: UGCNET-Dec2012-III: 14 https://gateoverflow.in/57378

Let T(n) be a function defined by T(n) = 1 and T(n) = 2T(n/2) + √−

n , which of the following is true?
−
A. T (n) = O(√n ) B. T (n) = O(log2 n)
C. T (n) = O(n) D. T (n) = O(n2 )
ugcnetdec2012iii algorithms recurrence time-complexity

1.32.2 Recurrence: UGCNET-Dec2015-III: 19 https://gateoverflow.in/62471

The solution of the reccurence relation

⎧
⎪ θ(1) if n ≤ 80
T(n) ≤ ⎨
⎩T
7n
⎪
is
( if n >)80 ( )
n
+T +6
s 10

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

ugcnetdec2015iii algorithms recurrence

1.32.3 Recurrence: UGCNET-July-2018-II: 21 https://gateoverflow.in/225865

The solution of the recurrence relation T(m) = T(3m/4) + 1 is

A. Θ(lg m) B. Θ(m)
C. Θ(m lg m) D. Θ(lg lg m)
ugcnetjuly2018ii algorithms time-complexity recurrence

1.32.4 Recurrence: UGCNET-June2013-III: 12 https://gateoverflow.in/58275

The solution of recurrence relation, T(n) = 2T(floor(√−

n)) + log n is
A. O(n log log log n) B. O(n log log n)
C. O(log log n) D. O(log n log log n)
ugcnetjune2013iii algorithms recurrence

1.32.5 Recurrence: UGCNET-June2014-III: 63 https://gateoverflow.in/57279

The solution of the recurrence relation of T(n) = 3T (floor ( n4 )) + n is

A. O(n2 ) B. O(n/gn) C. O(n) D. O(lgn)

ugcnetjune2014iii algorithms recurrence

1.32.6 Recurrence: UGCNET-Sep2013-III: 37 https://gateoverflow.in/59858

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(n2 )
ugcnetsep2013iii algorithms time-complexity recurrence

1.33 Recursion (2)

1.33.1 Recursion: UGCNET-Dec2011-II: 3 https://gateoverflow.in/62939

Which of the following is a bad example of recursion ?

A. Factorial B. Fibonacci numbers
C. Tower of Hanai D. Tree traversal
ugcnetdec2011ii algorithms recursion

1.33.2 Recursion: UGCNET-dec2009-ii-11 https://gateoverflow.in/152703

Recursive functions are executed in a

(A) First in first out-order

(B) Last in first out-order

(C) Parallel fashion

(D) Load balancing

ugcnetdec2009ii algorithms recursion

1.34 Red Black Tree (1)

1.34.1 Red Black Tree: UGCNET-Jan2017-III: 33 https://gateoverflow.in/335205

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. O(1) B. O(lg n) C. O(n) D. O(n lg n)

ugcnetjan2017iii algorithms red-black-tree

1.35 Shortest Path (2)

1.35.1 Shortest Path: UGCNET-Dec2014-III: 34 https://gateoverflow.in/60629

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

ugcnetdec2014iii algorithms shortest-path

1.35.2 Shortest Path: UGCNET-June2015-III: 31 https://gateoverflow.in/61249

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
ugcnetjune2015iii algorithms shortest-path

1.36 Sorting (5)

1.36.1 Sorting: UGCNET-Dec2013-III: 38 https://gateoverflow.in/60570

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)

 ugcnetdec2013iii algorithms sorting

1.36.2 Sorting: UGCNET-Dec2014-II: 22 https://gateoverflow.in/59405

You have to sort a list L, 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
ugcnetdec2014ii algorithms data-structures sorting

1.36.3 Sorting: UGCNET-Dec2015-III: 18 https://gateoverflow.in/62470

If there are n integers to sort, each integer had d digits and each digit is in the set {1, 2, … , k}, radix sort can sort the
numbers in

A. O(d n k) B. O(dnk ) C. O(d + n)k) D. O(d(n + k))

ugcnetdec2015iii algorithms sorting

1.36.4 Sorting: UGCNET-June-2019-II: 64 https://gateoverflow.in/316215

Which of the following is best running time to sort n integers in the range 0 to n2 − 1 ?

A. O(lg n) B. O(n) C. O(n lg n) D. O(n2 )

ugcnetjune2019ii sorting

1.36.5 Sorting: UGCNET-June2014-II: 36 https://gateoverflow.in/54597

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

ugcnetjune2014ii algorithms sorting merge-sort

1.37 Space Complexity (1)

1.37.1 Space Complexity: UGCNET-Dec2015-II: 39 https://gateoverflow.in/62310

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

A. O (log2 n) B. O (nlog2 n) C. O (1) D. O (n)

ugcnetdec2015ii algorithms sorting space-complexity

1.38 Time Complexity (8)

1.38.1 Time Complexity: UGCNET-Dec2010-II: 23 https://gateoverflow.in/66823

The time complexity to build a heap of n elements is

A. 0(1) B. 0(lgn) C. 0(n) D. 0(nlgn)

ugcnetdec2010ii algorithms time-complexity

1.38.2 Time Complexity: UGCNET-Dec2012-III: 11 https://gateoverflow.in/45258

The time complexities of some standard graph algorithms are given. Match each algorithm with its time complexity ? (
n and m are no. of nodes and edges respectively)
a. Bellman Ford algorithm i. O(m log n)
b. Kruskals algorithm ii. O(n3 )
c. Floyd Warshall algorithm iii. O(mn)
d. Topological sorting iv. O(n + m)
Codes :
A. a-iii, b-i, c-ii, d-iv B. a-ii, b-iv, c-iii, d-i
C. a-iii, b-iv, c-i, d-ii D. a-ii, b-i, c-iii, d-iv
ugcnetdec2012iii algorithms time-complexity

1.38.3 Time Complexity: UGCNET-Dec2014-III: 32 https://gateoverflow.in/60626

Match the following :

List – I List – II
a. Bucket sort i. O(n3 lg n)
b. Matrix chain multiplication ii. O(n3 )
c. Huffman codes iii. O(n lg n)
d. All pairs shortest paths iv. O(n)
Codes :
A. a-iv, b-ii, c-i, d-iii B. a-ii, b-iv, c-i, d-iii
C. a-iv, b-ii, c-iii, d-i D. a-iii, b-ii, c-iv, d-i
ugcnetdec2014iii algorithms time-complexity

1.38.4 Time Complexity: UGCNET-June2014-II: 39 https://gateoverflow.in/55184

An algorithm is made up of 2 modules M1 and M2 . If time complexity of modules M1 and M2 are h(n) and g(n)
respectively, the time complexity of the algorithm is
A. min(h(n), g(n)) B. max(h(n), g(n))
C. h(n) + g(n) D. h(n) ∗ g(n)
ugcnetjune2014ii algorithms time-complexity

1.38.5 Time Complexity: UGCNET-June2015-III: 33 https://gateoverflow.in/12692

Which of the following is asymptotically smaller?

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

algorithms ugcnetjune2015iii time-complexity

1.38.6 Time Complexity: UGCNET-Oct2020-II: 25 https://gateoverflow.in/349648

If algorithm A and another algorithm B take log2 (n) and √− n microseconds, respectively, to solve a problem, then the
largest size n of a problem these algorithms can solve, respectively, in one second are ______ and ______.
n n n n
A. 210 and 106 B. 210 and 1012 C. 210 and 6.106 D. 210 and 6.1012
ugcnet-oct2020-ii algorithms time-complexity

1.38.7 Time Complexity: UGCNET-Oct2020-II: 52 https://gateoverflow.in/349621

The running time of an algorithm is O(g(n)) if and only if

a. its worst-case running time

b. its
is worst-case
O(g(n)) andrunning
its best-case
time Ω(g(n))
c. O(g(n)) =time
is running Ω(g(n))(O
and isitsΩ(g(n))
d.=O(g(n))
best-case⋅ (O
big O)= =
running ∩ω(g(n))
time
big O)is O(g(n))Choose
⋅ (O = big
is non-empty the
set, (o =correct
O) small o)
answer from the options
given below:

A. (a) only B. (b) only C. (c) only D. (d) only

ugcnet-oct2020-ii algorithms time-complexity
 1.38.8 Time Complexity: UGCNET-Sep2013-II: 9 https://gateoverflow.in/59023

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

1.39 Tree Search Algorithm (1)

1.39.1 Tree Search Algorithm: UGCNET-Sep2013-III: 2 https://gateoverflow.in/59502

α − β cutoffs are applied to

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

1.40 Tree Traversal (1)

1.40.1 Tree Traversal: UGCNET-June2015-II: 4 https://gateoverflow.in/60897

Consider the following statements:

a. Depth-first search is used

b. toPre-order,
traverse aPost-order
rooted treeand
c. Inorder
Huffman's
are used
algorithm
to lististhe
d.
used
vertices
Topological
to findofan
anoptimal
sorting rootedWhich
orderedprovides
binary tree
tree. one
a labelling
with of
given the
such above
weights
that the parents have
statements is true?

A. a and b B. c and d C. a, b, and c D. a, b, c, and d

ugcnetjune2015ii trees tree-traversal

1.41 Tree Traversals (1)

1.41.1 Tree Traversals: UGCNET-June2012-III: 51 https://gateoverflow.in/56303

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
ugcnetjune2012iii algorithms graph-search tree-traversals

1.42 Trees (2)

1.42.1 Trees: UGCNET-Dec2015-II: 37 https://gateoverflow.in/62309

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. θ(logn h ∗ t) B. θ(logt n ∗ h)
C. θ(logh n) D. θ(logt n)
ugcnetdec2015ii algorithms trees

1.42.2 Trees: UGCNET-Jan2017-III: 32 https://gateoverflow.in/335206

Any decision tree that sorts n elements has height

A. Ω(lg n) B. Ω(n)
C. Ω(n lg n) D. Ω(n2 )
ugcnetjan2017iii algorithms trees

Answer Keys
1.0.1 A 1.0.2 A 1.0.3 A;C 1.0.4 A 1.0.5 C
1.0.6 Q-Q 1.0.7 D 1.0.8 D 1.0.9 X 1.0.10 B
1.0.11 A 1.0.12 Q-Q 1.0.13 Q-Q 1.0.14 Q-Q 1.0.15 B
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 A 1.7.5 B 1.7.6 B 1.7.7 D
1.8.1 Q-Q 1.8.2 C 1.9.1 B 1.10.1 Q-Q 1.10.2 Q-Q
1.10.3 Q-Q 1.10.4 C 1.11.1 C 1.12.1 C 1.13.1 A
1.13.2 C 1.14.1 A 1.15.1 C 1.16.1 Q-Q 1.16.2 C
1.16.3 B 1.17.1 C 1.17.2 A 1.17.3 B 1.18.1 C
1.19.1 Q-Q 1.20.1 A 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 B
1.26.2 A 1.26.3 C 1.27.1 C 1.28.1 A 1.29.1 D
1.29.2 C 1.29.3 C 1.30.1 B 1.31.1 C 1.32.1 C
1.32.2 C 1.32.3 Q-Q 1.32.4 D 1.32.5 C 1.32.6 C
1.33.1 B 1.33.2 Q-Q 1.34.1 A 1.35.1 C 1.35.2 D
1.36.1 D 1.36.2 D 1.36.3 D 1.36.4 B 1.36.5 B
1.37.1 C 1.38.1 Q-Q 1.38.2 A 1.38.3 C 1.38.4 B
1.38.5 A 1.38.6 B 1.38.7 A 1.38.8 D 1.39.1 C
1.40.1 D 1.41.1 B 1.42.1 D 1.42.2 A
2 CO and Architecture (105)

2.0.1 Microprocessor UGCNET https://gateoverflow.in/61233

A computer with 32 bit wide data bus user 4kx8 static RAM memory chips. The smallest memory this computer can
have is...?

A) 32kb

B) 16kb

C)8 KB

D)24kb

2.0.2 UGCNET-june2009-ii-34 https://gateoverflow.in/154485

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

ugcnetjune2009ii

2.0.3 UGCNET-june2009-ii-33 https://gateoverflow.in/154133

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
ugcnetjune2009ii

2.0.4 UGCNET-June-2019-II: 20 https://gateoverflow.in/316259

Suppose that a computer program takes 100 seconds of execution time on a computer with multiplication operation
responsible for 80 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. 14 times faster B. 15 times faster
C. 16 times faster D. 17 times faster
ugcnetjune2019ii

2.0.5 UGCNET-Dec2004-II: 47 https://gateoverflow.in/335581

The processing speeds of pipeline segments are usually :

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

ugcnetdec2004ii

2.0.6 UGCNET-june2009-ii-09 https://gateoverflow.in/154131

With four programs in memory and with 80% average I /O wait, the CPU utilization is ?

A. 60% B. 70%
C. 90% D. 100%
ugcnetjune2009ii

2.1 8085 Microprocessor (6)

2.1.1 8085 Microprocessor: UGCNET-Dec2014-III: 04 https://gateoverflow.in/59956

Match the following 8085 instructions with the flags :

List – I List – II
a. XCHG i. Only carry flag is affected
b. SUB ii. No flags are affected
c. STC iii. All flags other than carry are affected
d. DCR iv. All flags are affected
Codes :
A. a-iv, b-i, c-iii, d-ii B. a-iii, b-ii, c-i, d-iv
C. a-ii, b-iii, c-i, d-iv D. a-ii, b-iv, c-i, d-iii
ugcnetdec2014iii 8085-microprocessor non-gate

2.1.2 8085 Microprocessor: UGCNET-Dec2014-III: 05 https://gateoverflow.in/59958

How many times will the following loop be executed ?

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

A. 05 B. 07 C. 09 D. 00
ugcnetdec2014iii 8085-microprocessor non-gate

2.1.3 8085 Microprocessor: UGCNET-Dec2014-III: 06 https://gateoverflow.in/59960

Specify the contents of the accumulator and the status of the S, Z and CY flags when 8085 microprocessor performs
addition of 87H and 79H .

A. 11, 1, 1, 1 B. 10, 0, 1, 0 C. 01, 1, 0, 0 D. 00, 0, 1, 1

ugcnetdec2014iii 8085-microprocessor non-gate

2.1.4 8085 Microprocessor: UGCNET-June2016-III: 3 https://gateoverflow.in/57087

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

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

ugcnetjune2016iii co-and-architecture 8085-microprocessor

2.1.5 8085 Microprocessor: UGCNET-Nov2017-ii-31 https://gateoverflow.in/166265

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 ax and cx registers after the completion of the doloop ?
A. ax = FFF5 h and cx = 0 h B. ax = FFF6 h and cx = 0 h
C. ax = FFF7 h and cx = 0A h D. ax = FFF5 h and cx = 0A h
ugcnetnov2017-ii co-and-architecture 8085-microprocessor

2.1.6 8085 Microprocessor: UGCNET-Nov2017-ii-32 https://gateoverflow.in/166266

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 ax (in hexadecimal ) and the status of Carry Flag (CF) after the execution of above
instructions, are:
A. ax = 003CH; CF = 0 B. ax = 001EH; CF = 0
C. ax = 007BH; CF = 1 D. ax = 00B7H; CF = 1
ugcnetnov2017-ii 8085-microprocessor non-gate

2.2 Accumultor (1)

2.2.1 Accumultor: UGCNET-Oct2020-II: 6 https://gateoverflow.in/349667

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).
Location Instruction
210 CLA
211 ADD 217
212 INC
213 STA 217
214 LDA 218
215 CMA
216 AND 217
217 1234H
218 9CE2H

A. 1002H B. 2011H C. 2022H D. 0215H

ugcnet-oct2020-ii accumultor assembly-language co-and-architecture

2.3 Addressing Modes (11)

2.3.1 Addressing Modes: ISRO2009-21, UGCNET-Dec2012-II: 12 https://gateoverflow.in/48041

In which addressing mode, the effectives address of the operand is generated by adding a constant value to the content
of a register?
A. Absolute mode B. Indirect mode
C. Immediate mode D. Index mode
isro2009 co-and-architecture ugcnetdec2012ii addressing-modes

2.3.2 Addressing Modes: UGCNET-AUG2016-III: 5 https://gateoverflow.in/70747

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
ugcnetaug2016iii co-and-architecture addressing-modes

2.3.3 Addressing Modes: UGCNET-Dec2010-II: 34 https://gateoverflow.in/66911

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
ugcnetdec2010ii co-and-architecture addressing-modes

2.3.4 Addressing Modes: UGCNET-Dec2013-III: 49 https://gateoverflow.in/60730

Match the following:

 List -I List-II
a. Indexed addressing
i. is not used when an operand is moved
from memory into a register or from a
register to memory
b. Direct addressing ii. Memory address is computed by adding
up two registers plus an (optional) offset
c. Register addressing iii. Addressing memory by giving a register
plus a content offset
d. Base indexed addressing iv. can only be used to access global variables
whose address is known at compile time
Codes:
A. a-ii, b-i, c-iv, d-iii B. a-ii, b-iv, c-i, d-iii
C. a-iii, b-iv, c-i, d-ii D. a-iii, b-i, c-iv, d-ii
ugcnetdec2013iii co-and-architecture addressing-modes

2.3.5 Addressing Modes: UGCNET-Jan2017-III: 4 https://gateoverflow.in/335234

Match the following :

Addressing Mode Location of operand
a. Implied i. Registers which are in CPU
b. Immediate ii. Register specifies the address
of the operand
c. Register iii. Specified in the register
d. Register Indirect iv. Specified implicitly in the definition
of instruction
Codes :
A. a-iv, b-iii, c-i, d-ii B. a-iv, b-i, c-iii, d-ii
C. a-iv, b-ii, c-i, d-iii D. a-iv, b-iii, c-ii, d-i
ugcnetjan2017iii co-and-architecture addressing-modes

2.3.6 Addressing Modes: UGCNET-June-2019-II: 11 https://gateoverflow.in/316268

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

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

ugcnetjune2019ii addressing-modes

2.3.7 Addressing Modes: UGCNET-June2012-III: 27 https://gateoverflow.in/56229

Identify the addressing modes of the below instructions and match them :
(a) ADI (i) Immediate addressing
(b) STA (ii) Direct Addressing
(c) CMA (iii) Implied Addressing
(d) SUB (iv) Register addressing
A. a-i, b-ii, c-iii, d-iv B. a-ii, b-i, c-iv, d-iii
C. a-iii, b-ii, c-i, d-iv D. a-iv, b-iii, c-ii, d-i
ugcnetjune2012iii co-and-architecture addressing-modes

2.3.8 Addressing Modes: UGCNET-June2014-III: 40 https://gateoverflow.in/57016

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
 2.3.9 Addressing Modes: UGCNET-June2016-III: 5 https://gateoverflow.in/57097

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
ugcnetjune2016iii co-and-architecture addressing-modes

2.3.10 Addressing Modes: UGCNET-Nov2017-iii-4 https://gateoverflow.in/166380

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

ugcnetnov2017-iii addressing-modes co-and-architecture

2.3.11 Addressing Modes: UGCNET-dec2008-ii-38 https://gateoverflow.in/155362

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
ugcnetdec2008ii co-and-architecture addressing-modes

2.4 Amdahls Law (1)

2.4.1 Amdahls Law: UGCNET-June2015-II: 46 https://gateoverflow.in/61088

In the case of parallelization, Amdahl's law states that if P is the proportion of a program that can be made parallel and
(1 − P ) is the proportion that cannot be parallelized, then the maximum speed-up that can be achieved by using N
processors is:
1 1 1 1
A. B. C. D. (1−P)
(1 − P) + N. P (N − 1)P + P (1 − P) + P
N P+ N
ugcnetjune2015ii parallel-processing amdahls-law

2.5 Assembly (13)

2.5.1 Assembly: UGCNET-AUG2016-II: 32 https://gateoverflow.in/69959

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. 00H B. 35H C. EFH D. 2FH

ugcnetaug2016ii co-and-architecture assembly 8085-microprocessor

2.5.2 Assembly: UGCNET-Dec2010-II: 31 https://gateoverflow.in/66906

Object code is the output of ______.

A. Operating System B. Compiler or Assembler
C. Only Assembler D. Only Compiler
ugcnetdec2010ii co-and-architecture assembly
2.5.3 Assembly: UGCNET-Dec2010-II: 35 https://gateoverflow.in/66913

Macro-processors are ______.

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

ugcnetdec2010ii co-and-architecture assembly 8085-microprocessor

2.5.4 Assembly: UGCNET-Dec2015-III: 2 https://gateoverflow.in/62425

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

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

A. 37H B. 82H C. B9H D. 00H

ugcnetdec2015iii 8086 assembly co-and-architecture non-gate

2.5.5 Assembly: UGCNET-July-2018-II: 97 https://gateoverflow.in/225789

Match the items in List-I and List-II :

List-I List-II
(a) interrupts which can be delayed when a much (i) Normal
highest priority interrupt has occurred
(b) Unplanned interrupts which occur while executing (ii) Synchronous
a program
(c) Source of interrupt is in phase with the system (iii) Maskable
clock
(iv) Exception
Code :
A. (a)-(ii), (b)-(i), (c)-(iv) B. (a)-(ii), (b)-(iv), (c)-(iii)
C. (a)-(iii), (b)-(i), (c)-(ii) D. (a)-(iii), (b)-(iv), (c)-(ii)
ugcnetjuly2018ii co-and-architecture assembly interrupts

2.5.6 Assembly: UGCNET-June2013-III: 41 https://gateoverflow.in/58509

Which of the following is not an addressing mode?

A. Register indirect B. Autoincrement
C. Relative indexed D. Immediate operand
ugcnetjune2013iii co-and-architecture assembly addressing-modes

2.5.7 Assembly: UGCNET-June2013-III: 42 https://gateoverflow.in/58511

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

ugcnetjune2013iii co-and-architecture assembly

2.5.8 Assembly: UGCNET-June2013-III: 43 https://gateoverflow.in/58512

What is not a p typical program control instruction?

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

ugcnetjune2013iii co-and-architecture assembly
 2.5.9 Assembly: UGCNET-June2013-III: 44 https://gateoverflow.in/58513

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
ugcnetjune2013iii co-and-architecture assembly interrupts

2.5.10 Assembly: UGCNET-June2015-II: 31 https://gateoverflow.in/61064

Match the following:

a. Forelward Reference Table i. Assembler directive
b. Mnemonic Table ii. Uses array data structure
c. Segment Register Table iii. Contains machine OP code
d. EQU Uses linked list data structure

A. a − ii, b − iii, c − iv, d − i B. a − iii, b − iv, c − ii, d − i

C. a − iv, b − i, c − iii, d − ii D. a − iv, b − iii, c − ii, d − ii
ugcnetjune2015ii assembly

2.5.11 Assembly: UGCNET-June2016-III: 4 https://gateoverflow.in/57091

The Register that stores all interrupt requests is

Interrupt mask register

Interrupt service register

Interrupt request register

Status register
ugcnetjune2016iii co-and-architecture assembly

2.5.12 Assembly: UGCNET-Sep2013-III: 33 https://gateoverflow.in/59854

The instruction : MOV CL, [BX] [DI] + 8 represents the ____ addressing mode
A. Based Relative B. Based Indexed
C. Indexed Relative D. Register Indexed
ugcnetsep2013iii co-and-architecture assembly addressing-modes

2.5.13 Assembly: UGCNET-dec2008-ii-37 https://gateoverflow.in/155361

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

ugcnetdec2008ii co-and-architecture assembly

2.6 Byte Addressable (1)

2.6.1 Byte Addressable: UGCNET-June2014-III: 43 https://gateoverflow.in/57019

A byte addressable computer has a memory capacity of 2m Kbytes and can perform 2n operations. An instruction
involving 3 operands and one operator needs a maximum of
A. 3m bits B. m + n bits
C. 3m + n bits D. 3m + n + 30 bits
ugcnetjune2014iii co-and-architecture byte-addressable

2.7 Cache Memory (4)

 2.7.1 Cache Memory: UGCNET-Dec2014-III: 01 https://gateoverflow.in/59914

A hierarchical memory system that uses cache memory has cache access time of 50 nano seconds, main memory access
time of 300 nano seconds, 75% of memory requests are for read, hit ratio of 0.8 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. 157.5 n.sec. B. 110 n.sec.
C. 75 n.sec. D. 82.5 n.sec.
ugcnetdec2014iii co-and-architecture cache-memory

2.7.2 Cache Memory: UGCNET-July-2018-II: 98 https://gateoverflow.in/225788

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
ugcnetjuly2018ii co-and-architecture cache-memory

2.7.3 Cache Memory: UGCNET-June2016-III: 6 https://gateoverflow.in/57127

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
ugcnetjune2016iii co-and-architecture cache-memory

2.7.4 Cache Memory: UGCNET-Oct2020-II: 5 https://gateoverflow.in/349668

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

A. 8, 5, 3 B. 8, 6, 2 C. 7, 5, 4 D. 7, 6, 3
ugcnet-oct2020-ii co-and-architecture cache-memory

2.8 Cmos (1)

2.8.1 Cmos: UGCNET-July-2018-II: 91 https://gateoverflow.in/225795

CMOS is a computer chip on the motherboard, which is

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

ugcnetjuly2018ii co-and-architecture cmos

2.9 Co And Architecture (9)

2.9.1 Co And Architecture: UGCNET-Dec2010-II: 50 https://gateoverflow.in/67364

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
ugcnetdec2010ii co-and-architecture

2.9.2 Co And Architecture: UGCNET-Dec2012-III: 27 https://gateoverflow.in/30423

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 ugcnetdec2012iii
2.9.3 Co And Architecture: UGCNET-June2012-II: 3 https://gateoverflow.in/55604

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
ugcnetjune2012ii co-and-architecture

2.9.4 Co And Architecture: UGCNET-June2012-II: 46 https://gateoverflow.in/55891

A complete micro computer system consists of

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

2.9.5 Co And Architecture: UGCNET-June2012-II: 47 https://gateoverflow.in/55892

Where does a computer add and compare data?

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

co-and-architecture ugcnetjune2012ii

2.9.6 Co And Architecture: UGCNET-June2012-III: 61 https://gateoverflow.in/47598

Identify the devices given below with their IC numbers :

(a) USART (i) 8251
(b) Micro Controller (ii) 8051
(c) Interrupt C ontroller (iii) 8259
(d) DMA Controller (iv) 8257
A. (a)-(i), (b)-(ii), (c)-(iii), (d)-(iv) B. (a)-(ii), (b)-(i), (c)-(iv), (d)-(iii)
C. (a)-(iii), (b)-(iv), (c)-(i), (d)-(ii) D. (a)-(ii), (b)-(iii), (c)-(iv), (d)-(i)
ugcnetjune2012iii co-and-architecture

2.9.7 Co And Architecture: UGCNET-Oct2020-II: 44 https://gateoverflow.in/349629

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

a. Multiprocessor system is
b. controlled
In Multiprocessor
by one operating
system,
c. multiple
Multiprocessor
system computers
system
are is Choosebythe
connected
classified correct
asthe
multiple answer from
meansinstruction the and
of communication
stream options
lines given
multiple data stream sy
below:

A. (a) only B. (a) and (b) only C. (a) and (c) only D. (b) and (c) only
ugcnet-oct2020-ii co-and-architecture

2.9.8 Co And Architecture: UGCNET-Sep2013-III: 31 https://gateoverflow.in/59852

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

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

ugcnetsep2013iii co-and-architecture

2.9.9 Co And Architecture: UGCNET-dec2008-ii-39 https://gateoverflow.in/155363

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)

ugcnetdec2008ii co-and-architecture
2.10 Computer Architecture (3)

2.10.1 Computer Architecture: UGCNET-Dec2013-III: 52 https://gateoverflow.in/45448

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
ugcnetdec2013iii co-and-architecture computer-architecture

2.10.2 Computer Architecture: UGCNET-June2012-II: 32 https://gateoverflow.in/45088

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
ugcnetjune2012ii computer-architecture cache-memory

2.10.3 Computer Architecture: UGCNET-June2012-III: 3 https://gateoverflow.in/56076

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

ugcnetjune2012iii computer-architecture pipelining

2.11 Control Unit (2)

2.11.1 Control Unit: UGCNET-Jan2017-III: 3 https://gateoverflow.in/335235

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
ugcnetjan2017iii co-and-architecture control-unit

2.11.2 Control Unit: UGCNET-Oct2020-II: 81 https://gateoverflow.in/349592

Given below are two statements:

Statement I : Hardwired control unit can be optimized to produce fast mode of operation
Statement II : 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 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

ugcnet-oct2020-ii co-and-architecture control-unit

2.12 Cpu (1)

2.12.1 Cpu: UGCNET-Dec2011-II: 31 https://gateoverflow.in/63898

CPU does not perform the operation

A. Data transfer B. Logic operation
C. Arithmetic operation D. All of the above
ugcnetdec2011ii co-and-architecture cpu

2.13 Data Transfer (1)

2.13.1 Data Transfer: UGCNET-June2015-III: 2 https://gateoverflow.in/61140

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. 8 × 106 bytes/sec B. 4 × 106 bytes/sec

C. 16 × 106 bytes/sec D. 4 × 109 bytes/sec
ugcnetjune2015iii co-and-architecture data-transfer

2.14 Disks (1)

2.14.1 Disks: UGCNET-Dec2015-II: 28 https://gateoverflow.in/62271

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

ugcnetdec2015ii co-and-architecture disks

2.15 Dma (1)

2.15.1 Dma: UGCNET-Dec2015-III: 5 https://gateoverflow.in/62429

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%

ugcnetdec2015iii co-and-architecture dma

2.16 Dynamic Ram (1)

2.16.1 Dynamic Ram: UGCNET-Dec2015-III: 4 https://gateoverflow.in/32954

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

A. 0.64 B. 0.96 C. 2.00 D. 0.32

ugcnetdec2015iii co-and-architecture dynamic-ram

2.17 Flags (1)

2.17.1 Flags: UGCNET-Dec2012-III: 31 https://gateoverflow.in/57461

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

ugcnetdec2012iii computer-architecture flags

2.18 Hardware Interrupt (1)

 2.18.1 Hardware Interrupt: UGCNET-June2016-III: 2 https://gateoverflow.in/57084

8085 microprocessor has ___ hardware interrupt

A. 2 B. 3 C. 4 D. 5
ugcnetjune2016iii co-and-architecture hardware-interrupt

2.19 Instruction Format (1)

2.19.1 Instruction Format: UGCNET-Dec2013-III: 50 https://gateoverflow.in/60731

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

ugcnetdec2013iii co-and-architecture instruction-format

2.20 Integrated Circuits (1)

2.20.1 Integrated Circuits: UGCNET-Dec2011-II: 32 https://gateoverflow.in/63899

A chip having 150 gates will be classified as

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

ugcnetdec2011ii co-and-architecture integrated-circuits

2.21 Interrupts (4)

2.21.1 Interrupts: GATE CSE 2009 | Question: 8, UGCNET-June2012-III: 58 https://gateoverflow.in/1300

A CPU generally handles an interrupt by executing an interrupt service routine:

A. As soon as an interrupt is raised.

B. By checking the interrupt register at the end of fetch cycle.
C. By checking the interrupt register after finishing the execution of the current instruction.
D. By checking the interrupt register at fixed time intervals.

gatecse-2009 co-and-architecture interrupts normal ugcnetjune2012iii

2.21.2 Interrupts: UGCNET-Dec2015-III: 6 https://gateoverflow.in/62434

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

ugcnetdec2015iii interrupts co-and-architecture

2.21.3 Interrupts: UGCNET-Jan2017-III: 1 https://gateoverflow.in/335237

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
ugcnetjan2017iii interrupts co-and-architecture
 2.21.4 Interrupts: UGCNET-June2012-II: 37 https://gateoverflow.in/55881

Interrupts which are initiated by an instruction are

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

co-and-architecture interrupts ugcnetjune2012ii

2.22 Language (1)

2.22.1 Language: UGCNET-June2015-III: 3 https://gateoverflow.in/61141

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
ugcnetjune2015iii 8085-microprocessor assembly language non-gate co-and-architecture

2.23 Machine Instructions (2)

2.23.1 Machine Instructions: UGCNET-Jan2017-II: 32 https://gateoverflow.in/335131

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 ax register after execution of above instructions?

A. 0270H B. 0170H C. 01E0H D. 0370H

ugcnetjan2017ii co-and-architecture machine-instructions

2.23.2 Machine Instructions: UGCNET-Oct2020-II: 75 https://gateoverflow.in/349598

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

a. SISD b. MIMD c. SIMD Choose the correct answer from the options given
below:

A. a, b, c B. c, b, a C. b. c. a D. c, a, b
ugcnet-oct2020-ii co-and-architecture machine-instructions

2.24 Macros (1)

2.24.1 Macros: UGCNET-Dec2010-II: 32 https://gateoverflow.in/66907

'Macro' in an assembly level program is _______.

A. Sub program B. A complete program
C. A hardware portion D. Relative coding
ugcnetdec2010ii co-and-architecture assembly macros

2.25 Memory (4)

2.25.1 Memory: UGCNET-June-2019-II: 12 https://gateoverflow.in/316267

Suppose that the register A and the register K have the bit configuration. Only the three leftmost bits of A are
compared with memory words because K has 1’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
ugcnetjune2019ii memory
 2.25.2 Memory: UGCNET-June-2019-II: 19 https://gateoverflow.in/316260

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

A. 10, 4 B. 16, 16 C. 14, 16 D. 4, 16

ugcnetjune2019ii memory

2.25.3 Memory: UGCNET-Sep2013-III: 30 https://gateoverflow.in/59851

Which logic family dissipates the minimum power?

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

ugcnetsep2013iii co-and-architecture memory

2.25.4 Memory: UGCNET-Sep2013-III: 32 https://gateoverflow.in/59853

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

A. 28 B. 214 C. 26 D. 212
ugcnetsep2013iii co-and-architecture memory

2.26 Memory Data Transfer (1)

2.26.1 Memory Data Transfer: UGCNET-June2015-III: 5 https://gateoverflow.in/61144

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
ugcnetjune2015iii co-and-architecture memory-data-transfer

2.27 Microprocessors (12)

2.27.1 Microprocessors: UGCNET-AUG2016-III: 2 https://gateoverflow.in/70741

8085 microprocessor has ____ bit ALU.

A. 32 B. 16 C. 8 D. 4
ugcnetaug2016iii co-and-architecture microprocessors 8085-microprocessor

2.27.2 Microprocessors: UGCNET-AUG2016-III: 4 https://gateoverflow.in/70744

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

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

ugcnetaug2016iii co-and-architecture microprocessors 8085-microprocessor

2.27.3 Microprocessors: UGCNET-Dec2013-III: 54 https://gateoverflow.in/45447

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

ugcnetdec2013iii microprocessors
2.27.4 Microprocessors: UGCNET-Jan2017-II: 34 https://gateoverflow.in/335129

The contents of Register (BL) and Register (AL) of 8085 microprocessor are 49H and 3AH respectively. The
contents of AL, the status of carry flag (CF) and sign flag (SF) after executing ′ SUBAL, BL′ assembly language
instruction, are
A. AL = 0FH; CF = 1; SF = 1 B. AL = F0H; CF = 0; SF = 0
C. AL = F1H; CF = 1; SF = 1 D. AL = 1FH; CF = 1; SF = 1
ugcnetjan2017ii microprocessors machine-instructions co-and-architecture

2.27.5 Microprocessors: UGCNET-Jan2017-III: 5 https://gateoverflow.in/335233

In 8085 microprocessor, the digit 5 indicates that the microprocessor needs

A. −5 volts, +5 volts supply B. +5 volts supply only
C. −5 volts supply only D. 5 MHz clock
ugcnetjan2017iii co-and-architecture microprocessors

2.27.6 Microprocessors: UGCNET-Jan2017-III: 6 https://gateoverflow.in/335232

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

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

ugcnetjan2017iii co-and-architecture microprocessors

2.27.7 Microprocessors: UGCNET-July-2018-II: 100 https://gateoverflow.in/225786

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

ugcnetjuly2018ii co-and-architecture 8085-microprocessor microprocessors

2.27.8 Microprocessors: UGCNET-Nov2017-iii-1 https://gateoverflow.in/166377

In 8085 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
ugcnetnov2017-iii microprocessors 8085-microprocessor co-and-architecture

2.27.9 Microprocessors: UGCNET-Nov2017-iii-2 https://gateoverflow.in/166378

In 8085 microprocessor the address bus is of ___________ bits.

A. 4 B. 8 C. 16 D. 32
ugcnetnov2017-iii microprocessors 8085-microprocessor co-and-architecture

2.27.10 Microprocessors: UGCNET-Nov2017-iii-3 https://gateoverflow.in/166379

In the architecture of 8085 microprocessor match the following :

(a) Processing unit (i) Interrupt
(b) Instruction unit (ii) General purpose Register
(c) Storage and Interface unit (iii) ALU
(iv) Timing and Control
Code :
 A. (a)-(iv) (b)-(i) (c)-(ii) B. (a)-(iii) (b)-(iv) (c)-(ii)
C. (a)-(ii) (b)-(iii) (c)-(i) D. (a)-(i) (b)-(ii) (c)-(iv)
ugcnetnov2017-iii microprocessors 8085-microprocessor co-and-architecture

2.27.11 Microprocessors: UGCNET-Nov2017-iii-5 https://gateoverflow.in/166381

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.

ugcnetnov2017-iii microprocessors co-and-architecture

2.27.12 Microprocessors: UGCNET-Nov2017-iii-6 https://gateoverflow.in/166382

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

A. 17 bits B. 20 bits C. 24 bits D. 32 bits

ugcnetnov2017-iii microprocessors co-and-architecture

2.28 Microprogram Control Unit (1)

2.28.1 Microprogram Control Unit: UGCNET-June-2019-II: 14 https://gateoverflow.in/316265

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
ugcnetjune2019ii microprogram-control-unit

2.29 Parallel Computing (1)

2.29.1 Parallel Computing: UGCNET-June2012-III: 5 https://gateoverflow.in/44498

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 ugcnetjune2012iii

2.30 Parallel Processing (1)

2.30.1 Parallel Processing: UGCNET-dec2004-48 https://gateoverflow.in/156364

The cost of a parallel processing is primarily determined by:

(A) Time complexity
(B) Switching complexity
(C) Circuit complexity
(D) None of the above
parallel-processing

2.31 Pipelining (4)

2.31.1 Pipelining: UGCNET-June2012-II: 48 https://gateoverflow.in/55893

Pipelining strategy is called implement

A. instruction execution B. instruction prefetch
C. instruction decoding D. instruction manipulation
 co-and-architecture pipelining ugcnetjune2012ii

2.31.2 Pipelining: UGCNET-June2016-II: 48 https://gateoverflow.in/63507

Pipelining improves performance by

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

2.31.3 Pipelining: UGCNET-Oct2020-II: 43 https://gateoverflow.in/349630

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

a. Maximum speedup thatb.a pipeline

It is impossible
can provide
to achieve
is kc.theoretically
maximum
All segmentsspeed
in pipeline Choose
up k in ktake
-segment the
same timecorrect
pipeline answer from the options given
in computation
below:

A. (a) and (b) only B. (b) and (c) only C. (a) and (c) only D. (a), (b) and (c)
ugcnet-oct2020-ii co-and-architecture pipelining

2.31.4 Pipelining: UGCNET-Oct2020-II: 7 https://gateoverflow.in/349666

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

A. 6 B. 4.95 C. 5.7 D. 5.5

ugcnet-oct2020-ii co-and-architecture pipelining

2.32 Priority Encoder (1)

2.32.1 Priority Encoder: UGCNET-Dec2015-III: 1 https://gateoverflow.in/36820

The three outputs x1 x2 x3 from the 8 × 3 priority encoder are used to provide a vector address of the form
101x1 x2 x3 00 . what is the second highest priority vector address in hexadecimal if the vector addresses are starting
from the one with the highest priority?

A. BC B. A4 C. BD D. AC
ugcnetdec2015iii co-and-architecture priority-encoder

2.33 Processor Address Bus (1)

2.33.1 Processor Address Bus: UGCNET-June-2019-II: 49 https://gateoverflow.in/316230

A processor can support a maximum memory of 4 GB where memory is word addressable and a word is 2 bytes. What
will be the size of the address bus of the processor?
A. At least 28 bits B. At least 2 bytes
C. At least 31 bits D. Minimum 4 bytes
ugcnetjune2019ii processor-address-bus

2.34 Register (1)

2.34.1 Register: UGCNET-AUG2016-III: 3 https://gateoverflow.in/70742

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
ugcnetaug2016iii co-and-architecture register interrupts

2.35 Runtime Environments (1)

2.35.1 Runtime Environments: GATE CSE 2001 | Question: 1.10, UGCNET-Dec2012-III: 36 https://gateoverflow.in/703

Suppose a processor does not have any stack pointer registers, which of the following statements is true?

A. It cannot have subroutine call instruction

 B. It cannot have nested subroutines call
C. Interrupts are not possible
D. All subroutine calls and interrupts are possible

gatecse-2001 co-and-architecture normal ugcnetdec2012iii runtime-environments

2.36 Speedup (1)

2.36.1 Speedup: UGCNET-Dec2012-III: 49 https://gateoverflow.in/57719

Let f be the fraction of the computation (in terms of time) that is parallelizabl e. P the number of processors in the
system, and sp the speed up achievable in comparison with sequential execution – then the sp can be calculated using
the relation:
1 P 1 P
A. 1−f−f/P
B. P−f(P+1)
C. 1−f+f/P
D. P+f(P−1)
ugcnetdec2012iii co-and-architecture speedup

2.37 Tlb (1)

2.37.1 Tlb: UGCNET-DEC2016-II: 37 https://gateoverflow.in/117900

In a paging system, it takes 30 ns to search translation Look-aside Buffer (TLB) and 90 ns to access the main memory.
If the TLB hit ratio is 70%, the effective memory access time is

A. 48 ns B. 147 ns C. 120 ns D. 84 ns
ugcnetdec2016ii co-and-architecture tlb

Answer Keys
2.0.1 Q-Q 2.0.2 Q-Q 2.0.3 Q-Q 2.0.4 C 2.0.5 Q-Q
2.0.6 Q-Q 2.1.1 D 2.1.2 B 2.1.3 D 2.1.4 A
2.1.5 B 2.1.6 A 2.2.1 D 2.3.1 D 2.3.2 Q-Q
2.3.3 Q-Q 2.3.4 C 2.3.5 C 2.3.6 X 2.3.7 A
2.3.8 D 2.3.9 D 2.3.10 A 2.3.11 D 2.4.1 C
2.5.1 Q-Q 2.5.2 Q-Q 2.5.3 Q-Q 2.5.4 C 2.5.5 Q-Q
2.5.6 C 2.5.7 D 2.5.8 C 2.5.9 B 2.5.10 D
2.5.11 C 2.5.12 B 2.5.13 Q-Q 2.6.1 D 2.7.1 A
2.7.2 Q-Q 2.7.3 A 2.7.4 A 2.8.1 Q-Q 2.9.1 Q-Q
2.9.2 X 2.9.3 A 2.9.4 D 2.9.5 C 2.9.6 A
2.9.7 C 2.9.8 D 2.9.9 Q-Q 2.10.1 D 2.10.2 B
2.10.3 B 2.11.1 A 2.11.2 A 2.12.1 Q-Q 2.13.1 B
2.14.1 B 2.15.1 B 2.16.1 D 2.17.1 D 2.18.1 D
2.19.1 D 2.20.1 Q-Q 2.21.1 C 2.21.2 D 2.21.3 C
2.21.4 D 2.22.1 C 2.23.1 A 2.23.2 C 2.24.1 Q-Q
2.25.1 C 2.25.2 C 2.25.3 D 2.25.4 B 2.26.1 D
2.27.1 Q-Q 2.27.2 Q-Q 2.27.3 B 2.27.4 C 2.27.5 D
2.27.6 B 2.27.7 Q-Q 2.27.8 D 2.27.9 C 2.27.10 B
2.27.11 B 2.27.12 B 2.28.1 D 2.29.1 B 2.30.1 Q-Q
2.31.1 X 2.31.2 C 2.31.3 A 2.31.4 B 2.32.1 A
2.33.1 C 2.34.1 Q-Q 2.35.1 X 2.36.1 C 2.37.1 Q-Q
3 Compiler Design (68)

3.0.1 UGCNET-June2013-II: 21 https://gateoverflow.in/58010

Given the production rules of a grammar G1 as

S1 → AB ∣ aaB
A → a ∣ Aa
B→b
and the production rules of a grammar G2 as
S2 → aS2 bS2 ∣ bS2 aS2 ∣ λ
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
ugcnetjune2013ii compiler-design

3.0.2 UGCNET-Dec2004-II: 33 https://gateoverflow.in/335595

Code optimization is responsibility of :

A. Application programmer B. System programmer
C. Operating system D. All of the above
ugcnetdec2004ii

3.0.3 UGCNET-June2012-III: 73 https://gateoverflow.in/56428

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

ugcnetjune2012iii compiler-design

3.0.4 UGCNET-Dec2004-II: 35 https://gateoverflow.in/335593

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

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

ugcnetdec2004ii

3.0.5 UGCNET-DEC2016-III: 74 https://gateoverflow.in/114411

Unix command to change the case of first three lines of file "shortlist" from lower to upper

A. B.
C. $ tr head-3 shortlist '[A-Z]' '[a-z]' D. $ tr shortlist head-3 '[a-z]' '[A-Z]'
ugcnetdec2016iii compiler-design

3.0.6 UGCNET-Oct2020-II: 74 https://gateoverflow.in/349599

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

a. 001
b. 010
c. 011
d. 0001
e. 0101
Choose the correct answer from the options given below:

A. 001 < 010 < 011 < 0001 < 0101

B. 0001 < 001 < 010 < 0101 < 011
C. 0001 < 0101 < 001 < 010 < 011
D. 001 < 010 < 0001 < 0101 < 011

ugcnet-oct2020-ii compiler-design

3.0.7 UGCNET-Dec2007-II: 31 https://gateoverflow.in/335753

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

ugcnetdec2007ii

3.0.8 UGCNET-Dec2007-II: 32 https://gateoverflow.in/335752

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
ugcnetdec2007ii

3.0.9 UGCNET-Dec2007-II: 33 https://gateoverflow.in/335751

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
ugcnetdec2007ii

3.0.10 UGCNET-Dec2007-II: 34 https://gateoverflow.in/335750

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

ugcnetdec2007ii

3.0.11 UGCNET-Dec2007-II: 35 https://gateoverflow.in/335749

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

ugcnetdec2007ii

3.0.12 UGCNET-Dec2006-II: 32 https://gateoverflow.in/335639

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

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

 ugcnetdec2006ii

3.0.13 UGCNET-June2013-II: 23 https://gateoverflow.in/58013

The equivalent production rules corresponding to the production rules S → Sα1 ∣ Sα2 ∣ β1 ∣ β2 is

A. S → β1 ∣ β2 , A → α1 A ∣ α2 A ∣ λ
B. S → β1 ∣ β2 ∣ β1 A ∣ β2 A , A → α1 A ∣ α2 A
C. S → β1 ∣ β2 , A → α1 A ∣ α2 A
D. S → β1 ∣ β2 ∣ β1 A ∣ β2 A, A → α1 A ∣ α2 A ∣ λ

ugcnetjune2013ii compiler-design

3.0.14 UGCNET-Dec2006-II: 35 https://gateoverflow.in/335636

Peer-hole optimization is a form of :

A. loop optimization B. local optimization
C. constant folding D. data flow analysis
ugcnetdec2006ii

3.0.15 UGCNET-Dec2006-II: 39 https://gateoverflow.in/335632

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

A. Identifier table B. Page map table
C. Literal table D. Terminal table
ugcnetdec2006ii

3.0.16 UGCNET-Dec2006-II: 40 https://gateoverflow.in/335631

Loading operating system from secondary memory to primary memory is called ____________ .

A. Compiling B. Booting C. Refreshing D. Reassembling

ugcnetdec2006ii

3.0.17 UGCNET-Dec2006-II: 33 https://gateoverflow.in/335638

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
ugcnetdec2006ii

3.0.18 UGCNET-june2008-ii-33 https://gateoverflow.in/155622

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.

ugcnetjune2008ii

3.0.19 UGCNET-Dec2013-III: 17 https://gateoverflow.in/60400

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
ugcnetdec2013iii compiler-design
3.0.20 UGCNET-Dec2004-II: 31 https://gateoverflow.in/335548

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
ugcnetdec2004ii

3.0.21 UGCNET-June2006-II: 4 https://gateoverflow.in/335534

The logic of pumping lemma is a good example of :

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

3.0.22 UGCNET-Dec2004-II: 34 https://gateoverflow.in/335594

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
ugcnetdec2004ii

3.0.23 UGCNET-Dec2013-II: 29 https://gateoverflow.in/60212

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

ugcnetdec2013ii compiler-design

3.0.24 UGCNET-june2009-ii-32 https://gateoverflow.in/154482

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

ugcnetjune2009ii

3.0.25 UGCNET-Nov2017-ii-35 https://gateoverflow.in/166269

Match the description of several parts of a classic optimizing compiler in List-I, with the names of those parts in
List-II :
 List-I List-II
(a) A part of a compiler that is responsible (i) Optimizer
for recognizing syntax.

(b) A part of a compiler that takes as input a stream of (ii) Semantic Analysis
characters and produces as output a stream of words
along with their associated syntactic categories.

(c) A part of a compiler that understand the meanings of (iii) Parser

variable names and other symbols and checks that they
are used in ways consistent with their definitions.

(d) An IR-to-IR transformer that tries to improve the IR (iv) Scanner

program in some way (Intermediate Representation).
Code :
A. (a)-(iii); (b)-(iv); (c)-(ii); (d)-(i)
B. (a)-(iv); (b)-(iii); (c)-(ii); (d)-(i)
C. (a)-(ii); (b)-(iv); (c)-(i); (d)-(iii)
D. (a)-(ii); (b)-(iv); (c)-(iii); (d)-(i)

ugcnetnov2017-ii compiler-design

3.1 Code Optimization (1)

3.1.1 Code Optimization: UGCNET-Dec2012-II: 11 https://gateoverflow.in/47601

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 ugcnetdec2012ii compiler-design

3.2 Compilation Phases (1)

3.2.1 Compilation Phases: UGCNET-AUG2016-II: 33 https://gateoverflow.in/70296

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 P + P by 2∗ P or Replace 3 + 4 by 7.
B. Replace P ∗ 32 by P << 5
C. Replace P ∗ 0 by 0
D. Replace (P << 4) − P by P ∗ 15

ugcnetaug2016ii compiler-design compilation-phases

3.3 Compiler (1)

3.3.1 Compiler: UGCNET-June2015-II: 35 https://gateoverflow.in/61071

Which phase of compiler generates stream of atoms?

A. Syntax Analysis B. Lexical Analysis
C. Code Generation D. Code Optimization
ugcnetjune2015ii compiler-design compiler

3.4 Compiler Optimization (2)

 3.4.1 Compiler Optimization: UGCNET-Dec2015-II: 41 https://gateoverflow.in/62317

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

ugcnetdec2015ii compiler-design compiler-optimization

3.4.2 Compiler Optimization: UGCNET-June2016-II: 33 https://gateoverflow.in/63445

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
ugcnetjune2016ii compiler-design compiler-optimization

3.5 Constant Folding (1)

3.5.1 Constant Folding: UGCNET-June-2019-II: 73 https://gateoverflow.in/316206

Replacing the expression 4 ∗ 2 ⋅ 14 by 8 ⋅ 56 is known as

A. constant folding B. induction variable
C. strength reduction D. code reduction
ugcnetjune2019ii code-optimization constant-folding

3.6 Control Flow Graph (1)

3.6.1 Control Flow Graph: UGCNET-Dec2013-III: 4 https://gateoverflow.in/60386

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
ugcnetdec2013iii compiler-design control-flow-graph

3.7 Grammar (4)

3.7.1 Grammar: UGCNET-Dec2015-III: 24 https://gateoverflow.in/48605

The language of all non-null strings of a's can be defined by a context free grammar as follow :
S→aS∣Sa∣a
The word a3 can be generated by ______ different trees.

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

compiler-design grammar ugcnetdec2015iii

3.7.2 Grammar: UGCNET-June2010-II: 34 https://gateoverflow.in/68011

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

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

3.7.3 Grammar: UGCNET-dec2009-ii-32 https://gateoverflow.in/152904

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)

ugcnetdec2009ii compiler-design grammar

3.7.4 Grammar: UGCNET-dec2009-ii-35 https://gateoverflow.in/152911

Synthesized attribute can be easily simulated by a

(A) LL grammar

(B) Ambiguous grammar

(C) LR grammar

(D) None of the above

ugcnetdec2009ii compiler-design grammar

3.8 Infix Prefix (1)

3.8.1 Infix Prefix: UGCNET-June2012-II: 1 https://gateoverflow.in/55601

The postfix expression AB + CD -* can be evaluated using a

A. stack B. tree C. queue D. linked list

ugcnetjune2012ii compiler-design infix-prefix

3.9 Intermediate Code (1)

3.9.1 Intermediate Code: UGCNET-Oct2020-II: 30 https://gateoverflow.in/349643

Which of the following is not an intermediate code form?

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

3.10 Lexical Analysis (3)

3.10.1 Lexical Analysis: UGCNET-Dec2014-III: 20 https://gateoverflow.in/60181

How many tokens will be generated by the scanner for the following statement ?
x = x ∗ (a + b) − 5;

A. 12 B. 11 C. 10 D. 07
ugcnetdec2014iii compiler-design lexical-analysis

3.10.2 Lexical Analysis: UGCNET-Jan2017-II: 33 https://gateoverflow.in/335130

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
 3.10.3 Lexical Analysis: UGCNET-June2010-II: 35 https://gateoverflow.in/68014

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

ugcnetjune2010ii compiler-design lexical-analysis

3.11 Linker (1)

3.11.1 Linker: UGCNET-AUG2016-II: 34 https://gateoverflow.in/70298

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. I and II B. I and III C. II and III D. I and IV

ugcnetaug2016ii compiler-design linker

3.12 Lr Parser (2)

3.12.1 Lr Parser: UGCNET-Dec2006-II: 34 https://gateoverflow.in/335637

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

A. 0 B. 1 C. 2 D. None of these
ugcnetdec2006ii lr-parser compiler-design

3.12.2 Lr Parser: UGCNET-Dec2014-II: 32 https://gateoverflow.in/59637

Which of the following is true ?

A. Canonical LR parser is LR(1) parser with single look ahead terminal

B. All LR(K) parsers with K > 1 can be transformed into LR(1) parsers.
C. Both (A) and (B)
D. None of the above

ugcnetdec2014ii compiler-design lr-parser

3.13 Machine Instructions (1)

3.13.1 Machine Instructions: UGCNET-Dec2015-II: 42 https://gateoverflow.in/62320

What will be the hexadecimal value in the register ax (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

ugcnetdec2015ii machine-instructions compiler-design

3.14 Parameter Passing (1)

3.14.1 Parameter Passing: UGCNET-Dec2014-III: 19 https://gateoverflow.in/60180

Consider the following statements S1, S2 and S3 :

S1 : In call-by-value, anything that is passed into a function call is unchanged in the caller’s scope when the function
returns.
 S2 : In call-by-reference, a function receives implicit reference to a variable used as argument.
S3 : In call-by-reference, caller is unable to see the modified variable used as argument.
A. S3 and S2 are true. B. S3 and S1 are true.
C. S2 and S1 are true. D. S1, S2, S3 are true.
ugcnetdec2014iii compiler-design runtime-environments parameter-passing

3.15 Parsing (12)

3.15.1 Parsing: GATE CSE 2000 | Question: 1.19, UGCNET-Dec2013-II: 30 https://gateoverflow.in/642

Which of the following derivations does a top-down parser use while parsing an input string? The input is scanned
from left to right.
A. Leftmost derivation B. Leftmost derivation traced out in reverse
C. Rightmost derivation D. Rightmost derivation traced out in reverse
gatecse-2000 compiler-design parsing normal ugcnetdec2013ii

3.15.2 Parsing: UGCNET-Dec2012-II: 18 https://gateoverflow.in/56522

Given the following expressions of a grammar

E → E ∗ F /F + E/F
F → F– F /id
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 ∗
ugcnetdec2012ii compiler-design parsing

3.15.3 Parsing: UGCNET-Dec2012-II: 27 https://gateoverflow.in/56905

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
ugcnetdec2012ii compiler-design parsing

3.15.4 Parsing: UGCNET-Dec2013-II: 26 https://gateoverflow.in/43696

Given the following statements:

S1 : 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.
S2 : 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. S1 is not correct and S2 is not correct.
B. S1 is not correct and S2 is correct.
C. S1 is correct and S2 is not correct.
D. S1 is correct and S2 is correct

ugcnetdec2013ii compiler-design parsing

3.15.5 Parsing: UGCNET-Dec2015-II: 43 https://gateoverflow.in/62321

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
LR = {wR : wεL} is context-free

ugcnetdec2015ii compiler-design parsing

3.15.6 Parsing: UGCNET-July-2018-II: 39 https://gateoverflow.in/225847

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
ugcnetjuly2018ii compiler-design parsing

3.15.7 Parsing: UGCNET-June2014-II: 06 https://gateoverflow.in/49219

A grammar G is LL(1) if and only if the following conditions hold for two distinct productions A → α ∣ β
I. First (α)∩ First (β) ≠ {a} where a is some terminal symbol of the grammar.
II. First (α)∩ First (β) ≠ λ
III. First (α)∩ Follow (A) = ϕ if λ ∈ First (β)

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

ugcnetjune2014ii compiler-design grammar parsing

3.15.8 Parsing: UGCNET-June2014-II: 07 https://gateoverflow.in/49220

Which of the following suffices to convert an arbitrary CFG to an LL(1) grammar ?

A. Removing left recursion alone B. Removing the grammar alone

C. Removing left recursion and factoring the grammar D. None of the above
ugcnetjune2014ii compiler-design parsing

3.15.9 Parsing: UGCNET-June2014-II: 08 https://gateoverflow.in/49223

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

ugcnetjune2014ii compiler-design parsing

3.15.10 Parsing: UGCNET-June2015-II: 34 https://gateoverflow.in/61068

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( 1)
C. LR parser is Bottom-Up parser
D. In LL(1), the 1 indicates that there is a one symbol look-ahead

ugcnetjune2015ii compiler-design parsing

3.15.11 Parsing: UGCNET-June2016-II: 35 https://gateoverflow.in/63448

Which of the following is false?

A. The grammar S → a Sb ∣ bSa ∣ SS ∣∈ , where S 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

ugcnetjune2016ii compiler-design parsing

3.15.12 Parsing: UGCNET-dec2009-ii-33 https://gateoverflow.in/152905

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
ugcnetdec2009ii compiler-design parsing

3.16 Quadruple Representation (1)

3.16.1 Quadruple Representation: UGCNET-June-2019-II: 72 https://gateoverflow.in/316207

On translating the expression given below into quadruple representation, how many operations are required?

(i ∗ j) + (e + f) ∗ (a ∗ b + c)

A. 5 B. 6 C. 3 D. 7
ugcnetjune2019ii intermediate-code quadruple-representation

3.17 Runtime Environments (1)

3.17.1 Runtime Environments: UGCNET-Jan2017-II: 35 https://gateoverflow.in/335128

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-environments compiler-design

3.18 Shift Reduce Parser (2)

3.18.1 Shift Reduce Parser: UGCNET-Dec2014-II: 31 https://gateoverflow.in/59632

Shift-Reduce parsers perform the following :

A. Shift step that advances in the input stream by K(K > 1) 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 K(K = 2) 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.

ugcnetdec2014ii compiler shift-reduce-parser

3.18.2 Shift Reduce Parser: UGCNET-June-2019-II: 74 https://gateoverflow.in/316205

Shift-reduce parser consists of

a. input buffer b. stack c. 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
ugcnetjune2019ii shift-reduce-parser

3.19 Symbol Table (3)

3.19.1 Symbol Table: UGCNET-June-2019-II: 71 https://gateoverflow.in/316208

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

ugcnetjune2019ii symbol-table

3.19.2 Symbol Table: UGCNET-Oct2020-II: 41 https://gateoverflow.in/349632

Which of the following are applications of symbol table?

a. Storage allocation c. Suppressing duplicate errorChoose

b. Checking type compatibility the correct answer from the options given
messages
below:

A. (a) and (b) only B. (a) and (c) only C. (b) and (c) only D. (a) (b) and (c)

ugcnet-oct2020-ii compiler-design symbol-table

3.19.3 Symbol Table: UGCNET-june2007-34 https://gateoverflow.in/156055

Symbol table can be used for:

(A) Checking type compatibility
(B) Suppressing duplication of error message
(C) Storage allocation
(D) All of these above
compiler-design symbol-table

3.20 System Software& Compilers (1)

3.20.1 System Software& Compilers: UGCNET-June2010-II: 31 https://gateoverflow.in/67898

In an absolute loading scheme, which loader function is accomplished by a loader ?

A. Re-allocation B. Allocation C. Linking D. Loading

ugcnetjune2010ii system-software&-compilers compiler-design runtime-environments

3.21 Translator (1)

3.21.1 Translator: UGCNET-June2015-II: 32 https://gateoverflow.in/61066

The translator which performs macro calls expansion is called

A. Macro processor B. Micro pre-processor
C. Macro pre-processor D. Dynamic linker
ugcnetjune2015ii translator preprocessor

3.22 Two Pass Assembler (1)

3.22.1 Two Pass Assembler: UGCNET-Dec2014-II: 33 https://gateoverflow.in/59638

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
ugcnetdec2014ii two-pass-assembler

Answer Keys
3.0.1 B 3.0.2 Q-Q 3.0.3 D 3.0.4 Q-Q 3.0.5 B
3.0.6 B 3.0.7 Q-Q 3.0.8 Q-Q 3.0.9 Q-Q 3.0.10 Q-Q

3.0.11 Q-Q 3.0.12 Q-Q 3.0.13 D 3.0.14 Q-Q 3.0.15 Q-Q

3.0.16 Q-Q 3.0.17 C 3.0.18 Q-Q 3.0.19 A 3.0.20 Q-Q
3.0.21 Q-Q 3.0.22 Q-Q 3.0.23 D 3.0.24 Q-Q 3.0.25 A
3.1.1 B 3.2.1 Q-Q 3.3.1 B 3.4.1 A 3.4.2 D
3.5.1 A 3.6.1 B 3.7.1 D 3.7.2 Q-Q 3.7.3 Q-Q
3.7.4 Q-Q 3.8.1 A 3.9.1 X 3.10.1 A 3.10.2 D
3.10.3 Q-Q 3.11.1 Q-Q 3.12.1 Q-Q 3.12.2 C 3.13.1 C
3.14.1 C 3.15.1 A 3.15.2 B 3.15.3 C 3.15.4 D
3.15.5 B 3.15.6 Q-Q 3.15.7 D 3.15.8 D 3.15.9 C
3.15.10 B 3.15.11 B 3.15.12 Q-Q 3.16.1 B 3.17.1 A
3.18.1 B 3.18.2 D 3.19.1 C 3.19.2 D 3.19.3 Q-Q
3.20.1 Q-Q 3.21.1 C 3.22.1 A
4 Computer Networks (290)

4.0.1 UGCNET-Dec2013-II: 43 https://gateoverflow.in/12069

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

ugcnetdec2013ii computer-networks

4.0.2 UGCNET-Dec2007-II: 30 https://gateoverflow.in/335754

An example of an adaptive routing algorithm is :

A. distance vector routing B. flooding
C. selective flooding D. shortest path routing
ugcnetdec2007ii

4.0.3 UGCNET-June2012-II: 5 https://gateoverflow.in/55607

Networks that use different technologies can be connected by using

A. Packets B. Switches C. Bridges D. Routers

ugcnetjune2012ii computer-networks

4.0.4 UGCNET-June2010-II: 46 https://gateoverflow.in/68083

The cost of the network is usually determined by

A. Time complexity B. Switching complexity
C. circuit complexity D. none of these
ugcnetjune2010ii computer-networks

4.0.5 UGCNET-Dec2007-II: 28 https://gateoverflow.in/335756

The maximum data rate of binary signals on a noiseless 3 KHz channel is :

A. 3000 bps. B. 6000 bps. C. 9000 bps. D. 12, 000 bps.

ugcnetdec2007ii

4.0.6 UGCNET-June2010-II: 27 https://gateoverflow.in/67886

What does the URL need to access documents ?

I. Path name
II. Host name
III. DNS
IV. Retrieval method
V. Server port number

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

ugcnetjune2010ii computer-networks

4.0.7 UGCNET-June2012-II: 14 https://gateoverflow.in/55617

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

ugcnetjune2012ii computer-networks
4.0.8 UGCNET-Dec2007-II: 29 https://gateoverflow.in/335755

For pure ALOHA, the maximum channel utilization is :

A. 100% B. 50% C. 36% D. 18%

ugcnetdec2007ii

4.0.9 UGCNET-June2014-III: 67 https://gateoverflow.in/57591

Ten signals, each requiring 3000 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 300 Hz wide.
A. 30, 000 B. 32, 700
C. 33, 000 D. None of the above
ugcnetjune2014iii computer-networks

4.0.10 UGCNET-June2012-III: 54 https://gateoverflow.in/56311

What is the size (in terms of bits) of Header length field in IPV4 header?

A. 2 B. 4 C. 8 D. 16
ugcnetjune2012iii computer-networks

4.0.11 UGCNET-June2016-III: 25 https://gateoverflow.in/57158

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

ugcnetjune2016iii computer-networks

4.0.12 UGCNET-Dec2015-II: 23 https://gateoverflow.in/62257

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

ugcnetdec2015ii computer-networks

4.0.13 UGCNET-Dec2015-II: 22 https://gateoverflow.in/62255

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
ugcnetdec2015ii computer-networks

4.0.14 UGCNET-Dec2011-II: 40 https://gateoverflow.in/64065

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

4.0.15 UGCNET-Dec2011-II: 42 https://gateoverflow.in/64067

The number of bits required for an IPV6 address is

A. 16 B. 32 C. 64 D. 128
computer-networks
4.0.16 UGCNET-June2016-II: 26 https://gateoverflow.in/63433

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

ugcnetjune2016ii computer-networks

4.0.17 UGCNET-dec-2007-26 https://gateoverflow.in/155686

The best known example of a MAN is:

(A) Ethernet (B) Cable Television
(C) FDDI (D) IEEE 802.3

computer-networks

4.0.18 UGCNET-June2012-II: 34 https://gateoverflow.in/55876

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 ugcnetjune2012ii

4.0.19 UGCNET-June2016-III: 28 https://gateoverflow.in/63948

Match the following :

(a) Line Coding (i) A technique to change analog signal to
digital data
(b) Block Coding (ii) Provides synchronization without
increasing number of bits
(c) Scrambling (iii) Process of converting digital data to
digital signal
(d) Pulse code Modulation (iv) Provides redundancy to ensure
synchronization and inherits error detection
Codes :
A. (a)-(iv), (b)-(iii), (c)-(ii), (d)-(i) B. (a)-(iii), (b)-(iv), (c)-(ii), (d)-(i)
C. (a)-(i), (b)-(iii), (c)-(ii), (d)-(iv) D. (a)-(ii), (b)-(i), (c)-(iv), (d)-(iii)
ugcnetjune2016iii computer-networks

4.0.20 UGCNET-Dec2015-III: 15 https://gateoverflow.in/62465

A network device is sending out the data at the rate of 2000 bps. How long does it take to send a file of 1, 00, 000
characters?

A. 50 B. 200 C. 400 D. 800

ugcnetdec2015iii computer-networks

4.0.21 UGCNET-Dec2015-III: 11 https://gateoverflow.in/48400

A network with bandwidth of 10 Mbps can pass only an average of 15, 000 frames per minute with each
frame carrying an average of 8, 000 bits. What is the throughput of this network ?

A. 2 Mbps B. 60 Mbps C. 120 Mbps D. 10 Mbps

computer-networks ugcnetdec2015iii

4.0.22 UGCNET-June2013-II: 35 https://gateoverflow.in/58038

Give as good a big-O estimate as possible for the following functions:

(n log n + n2 )(n3 + 2) and (n! + 2n )(n3 + log(n2 + 1))

5 2 3∗ 5 3∗ n
O( +2 ) & O( n!) O( ) & O( )
 A. O(n5 + 2n2 ) & O(n3∗ n!) B. O(n5 ) & O(n3∗ 2n )
C. O(n5 ) & O(n3∗ n!) D. O(n5 + 2n2 )& O(n3∗ 2n )
ugcnetjune2013ii

4.0.23 UGCNET-Oct2020-II: 88 https://gateoverflow.in/349585

Given below are two statements:

Statement I : 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 II : Shannon’s major result about noised channel is that maximum data rate of a channel whose band width is H Hz,
S
and whose signal-to-noise ratio is S/N is given by: Maximum number of bits/sec = H log2 (1 + )
N
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

ugcnet-oct2020-ii computer-networks

4.0.24 UGCNET-June2013-II: 17 https://gateoverflow.in/57974

In classful addressing, the IP address 190.255.254.254 belongs to

A. Class A B. Class B C. Class C D. Class D

ugcnetjune2013ii computer-networks

4.0.25 UGCNET-Dec2006-II: 27 https://gateoverflow.in/335644

A 10 BASE-2 network is limited to :

A. 20 bytes per data field B. 30 stations per segment
C. 40 segments D. 50 feet of cable
ugcnetdec2006ii

4.0.26 UGCNET-Dec2006-II: 29 https://gateoverflow.in/335642

The subnet mask 255.255.255.192

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

ugcnetdec2006ii

4.0.27 UGCNET-Dec2006-II: 26 https://gateoverflow.in/335645

How many DS1 signals are transported on a DS3 signal ?

A. 24 B. 672 C. 14 D. 28
ugcnetdec2006ii

4.0.28 UGCNET-Dec2007-II: 4 https://gateoverflow.in/335780

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
ugcnetdec2007ii
4.0.29 UGCNET-Dec2004-II: 26 https://gateoverflow.in/335371

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
ugcnetdec2004ii

4.0.30 UGCNET-Dec2007-II: 26 https://gateoverflow.in/335758

The best known example of a MAN is :

A. Ethernet B. Cable Television C. FDDI D. IEEE 802.3

ugcnetdec2007ii

4.0.31 UGCNET-Dec2006-II: 28 https://gateoverflow.in/335643

The network 198.78.41.0 is a :

A. Class A Network B. Class B Network
C. Class C Network D. Class D Network
ugcnetdec2006ii

4.0.32 UGCNET-Dec2007-II: 27 https://gateoverflow.in/335757

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
ugcnetdec2007ii

4.0.33 UGCNET-Dec2004-II: 30 https://gateoverflow.in/335367

Virtual circuit is associated with a __________ service.

A. Connectionless B. Error-free
C. Segmentation D. Connection-oriented
ugcnetdec2004ii

4.0.34 UGCNET-Dec2004-II: 29 https://gateoverflow.in/335368

Which transport class should be used with residual-error network layer ?

A. T P0, T P2 B. T P1, T P3
C. T P1, T P3, T P4 D. T P0, T P1, T P2, T P3, T P4
ugcnetdec2004ii

4.0.35 UGCNET-Dec2004-II: 28 https://gateoverflow.in/335369

Which transport class should be used with a perfect network layer ?

A. T P0 and T P2 B. T P1 and T P3
C. T P0, T P1, T P3 D. T P0, T P1, T P2, T P3, T P4
ugcnetdec2004ii

4.0.36 UGCNET-Dec2004-II: 27 https://gateoverflow.in/335370

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

ugcnetdec2004ii

4.0.37 UGCNET-Dec2015-III: 68 https://gateoverflow.in/62782

Which of the following steps is/are not required for analog to digital conversion?
 a. Sensing b. Conversion c. Amplification d. Conditioning e. Quantization

A. aB.
andcC.
banda,D.
db and
Nonee of the above
ugcnetdec2015iii computer-networks

4.0.38 UGCNET-Dec2011-II: 39 https://gateoverflow.in/64063

All of the following are examples of real security and privacy risks except

A. Hackers B. Spam C. Viruses D. Identity theft

computer-networks

4.0.39 UGCNET-june2008-ii-29 https://gateoverflow.in/155615

An example of a public key encryption algorithm is:

(A) Caesar cipher algorithm
(B) DES algorithm
(C) AES algorithm
(D) Knapsack algorithm

ugcnetjune2008ii

4.0.40 UGCNET-Nov2017-iii-28 https://gateoverflow.in/166404

Match the following :

List-I List-II
(a) Data Link Layer (i) Encryption
(b) Network Layer (ii) Connection control
(c) Transport Layer (iii) Routing
(d) Presentation Layer (iv) Framing
Code :
A. (a)-(iv); (b)-(iii); (c)-(i); (d)-(ii)
B. (a)-(iii); (b)-(iv); (c)-(ii); (d)-(i)
C. (a)-(iv); (b)-(ii); (c)-(iii); (d)-(i)
D. (a)-(iv); (b)-(iii); (c)-(ii); (d)-(i)

ugcnetnov2017-iii computer-networks

4.0.41 UGCNET-june2009-ii-08 https://gateoverflow.in/154201

To employ multi-access in GSM , users are given different :

1. time slots
2. bandpass filters
3. handsets
4. frequency bands

ugcnetjune2009ii

4.0.42 UGCNET-june2008-ii-30 https://gateoverflow.in/155616

With reference to hierarchical routing, the optimum number of levels for an m router subnet is:
(A) m2 (B) m
(C) ln m (D) √m

ugcnetjune2008ii
4.0.43 UGCNET-Sep2013-II: 5 https://gateoverflow.in/59010

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

4.0.44 UGCNET-june2009-ii-29 https://gateoverflow.in/154371

X.25 protocol consists of :

A. Physical and Frame levels
B. Frame and Packet levels
C. Physical, Frame and Packet levels
D. None of the above

ugcnetjune2009ii

4.0.45 UGCNET-june2009-ii-47 https://gateoverflow.in/154827

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

ugcnetjune2009ii

4.0.46 UGCNET-june2009-ii-46 https://gateoverflow.in/154826

E-commerce includes :
A. B2C B. B2B
C. C2C D. All of the above
ugcnetjune2009ii

4.0.47 UGCNET-june2009-ii-45 https://gateoverflow.in/154825

When compared with analog cellular systems, an advantage of digital TDMA 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

ugcnetjune2009ii

4.0.48 UGCNET-june2009-ii-06 https://gateoverflow.in/154198

The throughput of pure ALOHA is given by :

A. S=G B. S=e2G
C. S=Ge2G D. Ge-2G
ugcnetjune2009ii computer-networks

4.0.49 UGCNET-june2008-ii-28 https://gateoverflow.in/155612

For a channel of 3 KHz bandwidth and signal to noise ratio of 30 dB, the maximum data rate is:
(A) 3000 bps (B) 6000 bps
(C) 15000 bps (D) 30000 bps

ugcnetjune2008ii
4.0.50 UGCNET-june2009-ii-41 https://gateoverflow.in/154821

Which one of the following ISO standard is used for software process ?
A. ISO9000 B. ISO9001
C. ISO9003 D. ISO9000 − 3
ugcnetjune2009ii

4.0.51 UGCNET-DEC2016-III: 73 https://gateoverflow.in/114409

Which of the following neural networks uses supervised learning?

a. Multilayer perceptron b. Self organizing feature map

c. Hopfield network

A. a only B. b only C. a and b only D. a and c only

computer-networks

4.0.52 UGCNET-dec2009-ii-03 https://gateoverflow.in/152692

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

ugcnetdec2009ii computer-networks

4.0.53 UGCNET-june2009-ii-31 https://gateoverflow.in/154480

Usually information security in a network is achieved by :

A. Layering
B. Cryptography
C. Grade of service
D. None of the above

ugcnetjune2009ii

4.0.54 UGCNET-june2009-ii-30 https://gateoverflow.in/154372

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

ugcnetjune2009ii

4.0.55 UGCNET-june2009-ii-07 https://gateoverflow.in/154199

The Fiber Distributed Data Interface uses :

A. single mode fibers and LEDs

B. multimode fibers and LEDs
C. single mode fibers and ILDs
D. multimode fibers and ILDs

ugcnetjune2009ii
 4.0.56 UGCNET-dec2009-ii-30 https://gateoverflow.in/152898

Match the following :

(i) Ethernet (a) Determinsitic

(ii) Token Ring N (b) Utilize the full wire speed
(iii) Cut-through switch (c) Prevent looping
(iv) Spanning tree (d) Checking Valid address Codes

A. a-ii, b-iii, c-iv, d-i B. a-i, b-iii, c-iv, d-ii

C. a-ii, b-iv, c-iii, d-i D. a-iv, b-iii, c-ii, d-i
ugcnetdec2009ii computer-networks

4.0.57 UGCNET-July-2018-II: 44 https://gateoverflow.in/225842

Which of the following statements are true?

a. Advanced Mobile Phone

b.System
IS . 95 (AMPS)
is a second
is ageneration
second
c. The
generation
cellular
Third generation
phone
cellularsysyem
phone
cellular
based
system
phone
on CDMA
system and
wil DSSS
provide universal personnel communication

A. a and b only B. b and c only C. a, b, and c D. a and c only

ugcnetjuly2018ii computer-networks

4.0.58 UGCNET-june2009-ii-02 https://gateoverflow.in/154130

In order that a code is error correcting, the minimum Hamming distance should be :

1. t
2. 2t − 1
3. 2t
4. 2t + 1

ugcnetjune2009ii

4.0.59 UGCNET-June2016-III: 26 https://gateoverflow.in/63946

Given the following statements:

a. Frequency Division Multiplexing is a technique that can b.beWavelength Division Multiplexing (WDM) is an analogue
applied when a bandwidth of a link is greater than combinedmultiplexing technique to combine optical signals
bandwidth of signals to be transmitted Which of the following is correct?
c. WDM is a digital multiplexing technique d. TDM is a digital multiplexing technique
A. a, b, c and d are true B. a, b, c and d are false
C. a, b, and d are false; c is true D. a, b, and d are true; c is false
ugcnetjune2016iii computer-networks

4.1 Analog & Digital Transmission (1)

4.1.1 Analog & Digital Transmission: UGCNET-June2015-III: 15 https://gateoverflow.in/61158

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

ugcnetjune2015iii analog-&-digital-transmission computer-networks

4.2 Analog Signals (1)

4.2.1 Analog Signals: UGCNET-Dec2014-II: 26 https://gateoverflow.in/59411

The period of a signal is 10 ms. What is its frequency in Hertz ?

A. 10 B. 100 C. 1000 D. 10000

ugcnetdec2014ii computer-networks analog-signals
4.3 Application Layer (1)

4.3.1 Application Layer: UGCNET-Jan2017-II: 27 https://gateoverflow.in/335136

The maximum size of the data that the application layer can pass on to the TCP layer below is ________.
A. 216 bytes B. 216 bytes + T CP header length
C. 216 bytes – T CP header length D. 215 bytes
ugcnetjan2017ii computer-networks application-layer

4.4 Asymmetric Key Cryptography (1)

4.4.1 Asymmetric Key Cryptography: UGCNET-Dec2014-III: 30 https://gateoverflow.in/60617

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.

ugcnetdec2014iii computer-networks asymmetric-key-cryptography

4.5 Binary Search Tree (1)

4.5.1 Binary Search Tree: UGCNET-Dec2010-II: 25 https://gateoverflow.in/66825

Which of the following can be the sequence of nodes examined in binary search tree while searching for key 88?
A. 90, 40, 65, 50, 88 B. 90, 110, 80, 85, 88
C. 190, 60, 90, 85, 88 D. 65, 140, 80, 70, 88
ugcnetdec2010ii computer-networks binary-search-tree

4.6 Binary Symmetric Channel (1)

4.6.1 Binary Symmetric Channel: UGCNET-June2013-III: 53 https://gateoverflow.in/58827

Binary symmetric channel uses

A. Half duplex protocol B. Full duplex protocol
C. Bit oriented protocol D. None of the above
ugcnetjune2013iii computer-networks binary-symmetric-channel

4.7 Bit Oriented Protocol (1)

4.7.1 Bit Oriented Protocol: UGCNET-Dec2014-III: 29 https://gateoverflow.in/60512

________ 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

ugcnetdec2014iii computer-networks bit-oriented-protocol

4.8 Bit Rate (1)

4.8.1 Bit Rate: UGCNET-Dec2014-II: 29 https://gateoverflow.in/59417

An analog signal has a bit rate of 6000 bps and a baud rate of 2000 baud. How many data elements are carried by each
signal element
A. 0.336 bits/baud B. 3 bits/baud
C. 120, 00, 000 bits/baud D. None of the above
ugcnetdec2014ii computer-networks bit-rate

4.9 Bridges (1)

4.9.1 Bridges: UGCNET-dec2008-ii-36 https://gateoverflow.in/155360

A conventional LAN bridge specifies only the functions of OSI :

 A. layers 1 and 2
B. layers 1 through 3
C. all layers
D. none of the above

ugcnetdec2008ii computer-networks osi-model bridges

4.10 Cache Memory (1)

4.10.1 Cache Memory: UGCNET-dec2008-ii-9 https://gateoverflow.in/155033

Suppose it takes 100 ns to access page table and 20 ns to access associative memory. If the average access time is 28
ns, the corresponding hit rate is:
A. 100 percent
B. 90 percent
C. 80 percent
D. 70 percent

ugcnetdec2008ii computer-networks cache-memory

4.11 Checksum (1)

4.11.1 Checksum: UGCNET-AUG2016-III: 27 https://gateoverflow.in/70934

In CRC checksum method, assume that given frame for transmission is 1101011011 and the generator polynomial is
G(x) = x4 + x + 1 . After implementing CRC encoder, the encoded word sent from sender side is _____.
A. 11010110111110 B. 11101101011011
C. 110101111100111 D. 110101111001111
ugcnetaug2016iii computer-networks crc-polynomial checksum

4.12 Classful Addressing (2)

4.12.1 Classful Addressing: UGCNET-Dec2012-III: 15 https://gateoverflow.in/57379

In classful addressing, an IP address 123.23.56.4 belongs to _____ format.

A. A B. B C. C D. D
ugcnetdec2012iii computer-networks ip-addressing classful-addressing

4.12.2 Classful Addressing: UGCNET-Dec2014-II: 27 https://gateoverflow.in/59412

In a classful addressing, first four bits in Class A IP address is

A. 1010 B. 1100 C. 1011 D. 1110

ugcnetdec2014ii computer-networks classful-addressing

4.13 Classless Addressing (1)

4.13.1 Classless Addressing: UGCNET-June2015-II: 30 https://gateoverflow.in/61062

Which of the following is/are restriction(s) in classless addressing?

A. The number of addresses needs to be a power of 2

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

ugcnetjune2015ii computer-networks classless-addressing

4.14 Communication (9)

4.14.1 Communication: UGCNET-Dec2013-III: 43 https://gateoverflow.in/60717

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
ugcnetdec2013iii computer-networks communication

4.14.2 Communication: UGCNET-Dec2013-III: 46 https://gateoverflow.in/60725

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
ugcnetdec2013iii communication computer-networks

4.14.3 Communication: UGCNET-Dec2013-III: 48 https://gateoverflow.in/60727

____ 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

ugcnetdec2013iii computer-networks communication non-gate

4.14.4 Communication: UGCNET-June2012-II: 19 https://gateoverflow.in/55839

The station to hub distance in which it is 2000 meters

A. 100 Base-T X B. 100 Base-FX C. 100 Base-T 4 D. 100 Base-T 1

ugcnetjune2012ii computer-networks communication

4.14.5 Communication: UGCNET-June2012-II: 39 https://gateoverflow.in/55883

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 ugcnetjune2012ii

4.14.6 Communication: UGCNET-June2012-II: 45 https://gateoverflow.in/55890

_____ 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 ugcnetjune2012ii

4.14.7 Communication: UGCNET-June2012-III: 64 https://gateoverflow.in/56354

Match the following with link quality measurement and handoff initiation :
(a) Networked-Controlled (i) MS connect to BS
Handoff (NCHO)
(b) Mobile-Assisted Handoff (ii) Process via channel the target
(MAHO) BS
(c) Forward Handoff (iii) First generation Analog Cellular
System
(d) Hard Handoff (iv) Second generation digital cellular
system
A. (a)-(iii), (b)-(iv), (c)-(ii), (d)-(i) B. (a)-(ii), (b)-(iii), (c)-(i), (d)-(iv)
C. (a)-(ii), (b)-(i), (c)-(iv), (d)-(iii) D. (a)-(iv), (b)-(iii), (c)-(i), (d)-(ii)
computer-networks communication ugcnetjune2012iii
 4.14.8 Communication: UGCNET-June2014-II: 01 https://gateoverflow.in/48594

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

ugcnetjune2014ii communication non-gate

4.14.9 Communication: UGCNET-June2014-III: 06 https://gateoverflow.in/55785

In a digital transmission, the receiver clock is 0.1 percent faster than the sender clock. How many extra bits per second
does the receiver receive if the data rate is 1 Mbps ?

A. 10 bps B. 100 bps C. 1000 bps D. 10000 bps

ugcnetjune2014iii computer-networks communication

4.15 Computer Neworks (1)

4.15.1 Computer Neworks: UGCNET-Oct2020-II: 60 https://gateoverflow.in/349613

Firewall is a device that filters access to the protected network from the outside network. Firewalls can filter the packets
on the basis of
a. Source IP address b. Destination IP address
c. TCP Source Port d. UDP Source Port
e. TCP Destination Port Choose the correct answer from the options given below:
A. (a), (b) and (c) only B. (b) and (e) only
C. (c) and (d) only D. (a), (b), (c), (d) and (e) only
ugcnet-oct2020-ii computer-neworks network-security

4.16 Crc Polynomial (2)

4.16.1 Crc Polynomial: UGCNET-Dec2013-III: 33 https://gateoverflow.in/60561

The message 11001001 is to be transmitted using the CRC polynomial x3 + 1 to protect it from errors. The message
that should be transmitted is

A. 110010011001 B. 11001001 C. 110010011001001 D. 11001001011

ugcnetdec2013iii computer-networks crc-polynomial

4.16.2 Crc Polynomial: UGCNET-Jan2017-III: 27 https://gateoverflow.in/335211

Let G(x) be generator polynomial used for CRC checking. The condition that should be satisfied by G(x) to correct
odd numbered error bits, will be:
A. (1 + x) is factor of G(x) B. (1 − x) is factor of G(x)
C. (1 + x2 ) is factor of G(x) D. x is factor of G(x)
ugcnetjan2017iii computer-networks crc-polynomial

4.17 Cryptography (7)

4.17.1 Cryptography: UGCNET-AUG2016-III: 30 https://gateoverflow.in/70939

The plain text message BAHI encrypted with RSA algorithm using e = 3, d = 7 and n = 33 and the characters of
the message are encoded using the values 00 to 25 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

ugcnetaug2016iii cryptography computer-networks

4.17.2 Cryptography: UGCNET-Dec2013-III: 32 https://gateoverflow.in/60559

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

ugcnetdec2013iii computer-networks cryptography

4.17.3 Cryptography: UGCNET-Dec2014-II: 30 https://gateoverflow.in/59419

How many distinct stages are there in DES algorithm, which is parameterized by a 56-bit key ?

A. 16 B. 17 C. 18 D. 19
ugcnetdec2014ii computer-networks cryptography

4.17.4 Cryptography: UGCNET-July-2018-II: 45 https://gateoverflow.in/225841

Match the following symmetric block ciphers with corresponding block and key sizes:

List-I List-II
(a) DES (i) block size 64 and key size ranges between 32 and 448
(b) IDEA (ii) block size 64 and key size 64
(c) BLOW FISH (iii) block size 128 and key sizes 128, 192, 256
(d) AES (iv) block size 64 and key size 128
A. a-iv; b-ii; c-i; d-iii B. a-ii; b-iv; c-i; d-iii
C. a-ii; b-iv; c-iii; d-i D. a-iv; b-ii; c-iii; d-i
ugcnetjuly2018ii cryptography computer-networks

4.17.5 Cryptography: UGCNET-June2014-III: 56 https://gateoverflow.in/57207

Match the following cryptographic algorithms with their design issues :

List-I List-II
a. DES i. Message Digest
b. AES ii. Public key
c. RSA iii. 56-bit key
d. SHA-1 iv. 128-bit key
A. a-ii, b-i, c-iv, d-iii B. a-iii, b-i, c-iv, d-ii
C. a-iii, b-iv, c-ii, d-i D. a-iv, b-i, c-ii, d-iii
ugcnetjune2014iii computer-networks network-security cryptography

4.17.6 Cryptography: UGCNET-Oct2020-II: 32 https://gateoverflow.in/349641

Using ‘RSA’ public key cryptosystem, if p = 3 , q = 11 and d = 7 , find the value of e and encrypt the number ′ 19′

A. 20, 19 B. 33, 11 C. 3, 28 D. 77, 28

ugcnet-oct2020-ii computer-networks network-security cryptography

4.17.7 Cryptography: UGCNET-Oct2020-II: 54 https://gateoverflow.in/349619

Which among the following statement(s) is(are) true?

a. A hash function takes a b.

message
A hashoffunction
arbitrarytakes
length
a c.
message
and
A hash
generates
offunction
fixed
a fixed
length
maylength
give Choose
code hashthe
and generates
same correct
a value
code of answerlength
forvariable
distinct from the options given
messages
below:

A. (a) only B. (b) and (c) only C. (a) and (c) only D. (b) only
ugcnet-oct2020-ii computer-networks network-security cryptography

4.18 Data Communication (7)

 4.18.1 Data Communication: UGCNET-Dec2011-II: 35 https://gateoverflow.in/64057

The cellular frequency reuse factor for the cluster size N is

1 1
A. N B. N 2 C. N D. N2
ugcnetdec2011ii computer-networks data-communication

4.18.2 Data Communication: UGCNET-Dec2011-II: 37 https://gateoverflow.in/64060

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
ugcnetdec2011ii computer-networks data-communication

4.18.3 Data Communication: UGCNET-Dec2011-II: 48 https://gateoverflow.in/64189

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
ugcnetdec2011ii computer-networks data-communication

4.18.4 Data Communication: UGCNET-June2010-II: 47 https://gateoverflow.in/68086

A leased special high-speed connection from the local telephone carrier for business users that transmits at 1.544 mbps
is known as ________ carrier.

A. T1 B. T2 C. T3 D. T4
ugcnetjune2010ii computer-networks data-communication

4.18.5 Data Communication: UGCNET-June2010-II: 48 https://gateoverflow.in/68088

CDMA Cell uses ________ carriers of 1.25 MHz.

A. 9 B. 18 C. 22 D. 64
ugcnetjune2010ii computer-networks data-communication

4.18.6 Data Communication: UGCNET-June2015-III: 29 https://gateoverflow.in/61246

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

ugcnetjune2015iii computer-networks data-communication

4.18.7 Data Communication: UGCNET-dec2009-ii-26 https://gateoverflow.in/152887

Device on one network can communicate with devices on another network via a

(A) Hub/Switch

(B) Utility server

(C) File server

(D) Gateway
ugcnetdec2009ii computer-networks data-communication

4.19 Data Link Layer (7)

4.19.1 Data Link Layer: UGCNET-June2016-III: 29 https://gateoverflow.in/63949

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

ugcnetjune2016iii computer-networks data-link-layer

4.19.2 Data Link Layer: UGCNET-Nov2017-iii-25 https://gateoverflow.in/166401

Suppose we want to download text documents at the rate of 100 pages per second. Assume that a page consists of an
average of 24 lines with 80 characters in each line. What is the required bit rate of the channel?

A. 192 kbps B. 512 kbps C. 1.248 Mbps D. 1.536 Mbps

ugcnetnov2017-iii computer-networks data-link-layer

4.19.3 Data Link Layer: UGCNET-Nov2017-iii-27 https://gateoverflow.in/166403

If a file consisting of 50, 000 characters takes 40 seconds to send, then the data rate is _________

A. 1 kbps B. 1.25 kbps C. 2 kbps D. 10 kbps

ugcnetnov2017-iii computer-networks data-link-layer

4.19.4 Data Link Layer: UGCNET-Sep2013-II: 2 https://gateoverflow.in/59007

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

4.19.5 Data Link Layer: UGCNET-Sep2013-III: 7 https://gateoverflow.in/59508

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

ugcnetsep2013iii computer-networks data-link-layer

4.19.6 Data Link Layer: UGCNET-dec2008-ii-16 https://gateoverflow.in/155174

The throughput of slotted ALOHA is given by:

A. S = G B. S = GeG
C. S = Ge − G D. S = eG
ugcnetdec2008ii computer-networks data-link-layer

4.19.7 Data Link Layer: UGCNET-dec2009-ii-28 https://gateoverflow.in/152891

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
ugcnetdec2009ii computer-networks data-link-layer

4.20 Data Mining Algorithm (1)

4.20.1 Data Mining Algorithm: UGCNET-dec2008-ii-49 https://gateoverflow.in/155373

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

ugcnetdec2008ii neural-network data-mining-algorithm

4.21 Data Transmission (1)

4.21.1 Data Transmission: UGCNET-Dec2014-III: 26 https://gateoverflow.in/60504

How many characters per second ( 7 bits + 1 parity) can be transmitted over a 3200 bps line if the transfer is
asynchronous ? (Assuming 1 start bit and 1 stop bit)

A. 300 B. 320 C. 360 D. 400

ugcnetdec2014iii computer-networks data-transmission asynchronous-transmission

4.22 Distance Vector Routing (1)

4.22.1 Distance Vector Routing: UGCNET-Jan2017-II: 29 https://gateoverflow.in/335134

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

4.23 Edi Layers (1)

4.23.1 Edi Layers: UGCNET-dec2008-ii-48 https://gateoverflow.in/155372

E-commerce involves :

A. Electronic Data Interchange

B. Electronic mail
C. Electronic Bulletin Boards
D. All of the above

ugcnetdec2008ii e-commerce e-technologies edi-layers

4.24 Electronic Payment Systems (1)

4.24.1 Electronic Payment Systems: UGCNET-Dec2015-II: 50 https://gateoverflow.in/62329

____ 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

ugcnetdec2015ii e-technologies electronic-payment-systems mobile-computing computer-networks non-gate

4.25 Encoding (2)

 4.25.1 Encoding: UGCNET-Dec2012-III: 68 https://gateoverflow.in/42661

An example of a dictionary-based coding technique is

A. Run-length coding B. Huffman coding
C. Predictive coding D. LZW coding
ugcnetdec2012iii computer-networks network-security encoding

4.25.2 Encoding: UGCNET-June2013-III: 55 https://gateoverflow.in/13111

Given code word 1110001010 is to be transmitted with even parity check bit. The encoded word to be transmitted for
this code is

A. 11100010101 B. 11100010100 C. 1110001010 D. 111000101

computer-networks ugcnetjune2013iii encoding

4.26 Encryption Decryption (2)

4.26.1 Encryption Decryption: UGCNET-July-2018-II: 50 https://gateoverflow.in/225836

Encrypt the Message "HELLO MY DEARZ" using Transposition Cipher with

Key {
Plain Text 2413
Cipher Text 1234
A. HLLEO YM AEDRZ B. EHOLL ZYM RAED
C. ELHL MDOY AZER D. ELHL DOMY ZAER
ugcnetjuly2018ii cryptography encryption-decryption computer-networks

4.26.2 Encryption Decryption: UGCNET-June-2019-II: 86 https://gateoverflow.in/316193

In the TCP/IP model, encryption and decryption are functions of ____ layer.

A. data link B. network C. transport D. application

ugcnetjune2019ii encryption-decryption

4.27 Entropy (1)

4.27.1 Entropy: UGCNET-Dec2011-II: 9 https://gateoverflow.in/63072

The amount of uncertainty in a system of symbol is called

A. Bandwidth B. Entropy C. Loss D. Quantum

ugcnetdec2011ii computer-networks entropy

4.28 Error Correction (3)

4.28.1 Error Correction: UGCNET-Dec2011-II: 12 https://gateoverflow.in/63076

Start and stop bits are used in serial communications for

A. Error detection B. Error correction
C. Synchronization D. Slowing down the communication
ugcnetdec2011ii computer-networks error-correction

4.28.2 Error Correction: UGCNET-July-2018-II: 49 https://gateoverflow.in/225837

To guarantee correction of upto t errors, the minimum Hamming distance dmin in a block code must be ______

A. t + 1 B. t − 2 C. 2t − 1 D. 2t + 1
ugcnetjuly2018ii computer-networks error-correction error-detection

4.28.3 Error Correction: UGCNET-Sep2013-III: 56 https://gateoverflow.in/59926

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
ugcnetsep2013iii computer-networks error-correction crc-polynomial

4.29 Error Detection Correction (1)

4.29.1 Error Detection Correction: UGCNET-June2014-III: 57 https://gateoverflow.in/57214

Consider a code with five valid code words of length ten :

0000000000, 0000011111, 1111100000, 1110000011, 1111111111
Hamming distance of the code is

A. 5 B. 10 C. 8 D. 9
ugcnetjune2014iii computer-networks error-detection-correction hamming-distance

4.30 Ethernet (5)

4.30.1 Ethernet: UGCNET-June2013-III: 17 https://gateoverflow.in/58282

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

ugcnetjune2013iii computer-networks ethernet

4.30.2 Ethernet: UGCNET-June2013-III: 22 https://gateoverflow.in/58291

What is the baud rate of standard 10 Mbps Ethernet?

A. 10 megabaud B. 20 megabaud C. 30 megabaud D. 40 megabaud

ugcnetjune2013iii computer-networks ethernet

4.30.3 Ethernet: UGCNET-June2014-II: 03 https://gateoverflow.in/48597

The minimum frame length for 10 Mbps Ethernet is ________ bytes and maximum is _______ bytes.
A. 64 & 128 B. 128 & 1518
C. 1518 & 3036 D. 64 & 1518
ugcnetjune2014ii computer-networks ethernet

4.30.4 Ethernet: UGCNET-Sep2013-II: 1 https://gateoverflow.in/59001

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

4.30.5 Ethernet: UGCNET-Sep2013-II: 4 https://gateoverflow.in/59009

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

4.31 Firewall (1)

4.31.1 Firewall: UGCNET-Sep2013-III: 58 https://gateoverflow.in/59928

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
ugcnetsep2013iii computer-networks firewall

4.32 Hamming Code (3)

 4.32.1 Hamming Code: UGCNET-Dec2010-II: 10 https://gateoverflow.in/66537

Encoding of data bits 0011 into 7-bit even Parity Hamming Code is

A. 0011110 B. 0101110 C. 0010110 D. 0011100

ugcnetdec2010ii computer-networks hamming-code

4.32.2 Hamming Code: UGCNET-June2015-III: 66 https://gateoverflow.in/61460

In a binary Hamming Code the number of check digits is r then number of message digits is equal to

A. 2r − 1 B. 2r − r − 1 C. 2r − r + 1 D. 2r + r − 1
ugcnetjune2015iii computer-networks hamming-code

4.32.3 Hamming Code: UGCNET-Oct2020-II: 31 https://gateoverflow.in/349642

Consider a code with only four valid code words: 0000000000, 0000011111, 1111100000, and 1111111111. This
code has distance 5. If the code word arrived is 0000000111 then the original code word must be _______

A. 0000011111 B. 0000000000 C. 1111100000 D. 1111111111

ugcnet-oct2020-ii computer-networks hamming-code

4.33 Hamming Distance (1)

4.33.1 Hamming Distance: UGCNET-June2013-III: 54 https://gateoverflow.in/58828

Hamming distance between 100101000110 and 110111101101 is

A. 3 B. 4 C. 5 D. 6
ugcnetjune2013iii computer-networks hamming-distance

4.34 Huffman Code (1)

4.34.1 Huffman Code: UGCNET-June2013-III: 14 https://gateoverflow.in/58279

A data file of 1, 00, 000 characters contains only the characters g-1, with the frequencies as indicated in table:
g h i j k l
Frequency 45 13 12 16 9 5
in thousand
using the variable-length code by Huffman codes, the file can be encoded with
A. 2, 52, 000 bits B. 2, 64, 000 bits
C. 2, 46, 000 bits D. 2, 24, 000 bits
ugcnetjune2013iii computer-networks huffman-code data-link-layer

4.35 Internal Memory (1)

4.35.1 Internal Memory: UGCNET-June2015-III: 1 https://gateoverflow.in/19183

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

ugcnetjune2015iii computer-architecture internal-memory

4.36 Internet Security (1)

4.36.1 Internet Security: UGCNET-July-2018-II: 47 https://gateoverflow.in/225839

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
ugcnetjuly2018ii computer-networks internet-security
4.37 Internet Stack Layers (1)

4.37.1 Internet Stack Layers: UGCNET-June-2019-II: 87 https://gateoverflow.in/316192

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

ugcnetjune2019ii internet-stack-layers

4.38 Ip Addressing (10)

4.38.1 Ip Addressing: UGCNET-Dec2013-III: 44 https://gateoverflow.in/60720

In IPV 4, the IP address 200.200.200.200 belongs to

A. Class A B. Class B C. Class C D. Class D

ugcnetdec2013iii computer-networks ip-addressing

4.38.2 Ip Addressing: UGCNET-July-2018-II: 43 https://gateoverflow.in/225843

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
ugcnetjuly2018ii computer-networks ip-addressing

4.38.3 Ip Addressing: UGCNET-June-2019-II: 88 https://gateoverflow.in/316191

What percentage (%) of the IPv4, IP address space do all class C addresses consume?

A. 12.5% B. 25% C. 37.5% D. 50%

ugcnetjune2019ii ip-addressing

4.38.4 Ip Addressing: UGCNET-June2012-III: 29 https://gateoverflow.in/56261

Which of the following IP address class is a multicast address?

A. Class A B. Class B C. Class C D. Class D

ugcnetjune2012iii computer-networks ip-addressing

4.38.5 Ip Addressing: UGCNET-June2014-III: 71 https://gateoverflow.in/57598

A network on the Internet has a subnet mask of 255.255.240.0. What is the maximum number of hosts it can handle ?

A. 1024 B. 2048 C. 4096 D. 8192

ugcnetjune2014iii computer-networks ip-addressing

4.38.6 Ip Addressing: UGCNET-June2015-II: 29 https://gateoverflow.in/61061

What is the size of the 'total length' field in IP v4 diagram?

A. 4 bits B. 8 bits C. 16 bits D. 32 bits

ugcnetjune2015ii computer-networks ip-addressing

4.38.7 Ip Addressing: UGCNET-Nov2017-iii-29 https://gateoverflow.in/166405

The address of a class B host is to be split into subnets with a 6– bit subnet number. What is the maximum number of
subnets and maximum number of hosts in each subnet?
 A. 62 subnets and 1022 hosts B. 64 subnets and 1024 hosts
C. 62 subnets and 254 hosts D. 64 subnets and 256 hosts
ugcnetnov2017-iii ip-addressing computer-networks

4.38.8 Ip Addressing: UGCNET-Sep2013-III: 12 https://gateoverflow.in/59514

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

ugcnetsep2013iii computer-networks ip-addressing

4.38.9 Ip Addressing: UGCNET-Sep2013-III: 8 https://gateoverflow.in/59509

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
ugcnetsep2013iii computer-networks ip-addressing

4.38.10 Ip Addressing: UGCNET-dec2008-ii-20 https://gateoverflow.in/155180

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
ugcnetdec2008ii computer-networks ip-addressing

4.39 Ip Packet (2)

4.39.1 Ip Packet: UGCNET-Dec2012-II: 9 https://gateoverflow.in/56512

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

ugcnetdec2012ii computer-networks ip-packet

4.39.2 Ip Packet: UGCNET-June2014-III: 69 https://gateoverflow.in/57594

Which of the following is used in the options field of IP v4?

A. Strict source routing B. Loose source routing
C. Time stamp D. All of the above
ugcnetjune2014iii computer-networks ip-packet routing

4.40 Ipv6 (1)

4.40.1 Ipv6: UGCNET-Nov2017-iii-30 https://gateoverflow.in/166406

Which of the following statements are true?

a. The fragmentation fieldsb.inThe

the authentication
base header section
extension
c.ofThe
header
record
IPv4 have
isroute
new
movedin
option
to the
IPv6 is. fragmentation
not implemented
extension
in IPv6header
. in IPv6 .

A. (a) and (b) Only B. (b) and (c) Only C. (a) and (c) Only D. (a), (b) and (c)
ugcnetnov2017-iii computer-networks ip-addressing ipv6

4.41 Lan Technologies (2)

4.41.1 Lan Technologies: UGCNET-Dec2010-II: 27 https://gateoverflow.in/66898

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
 ugcnetdec2010ii computer-networks lan-technologies

4.41.2 Lan Technologies: UGCNET-Jan2017-III: 25 https://gateoverflow.in/335213

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. nP(1 − P)n−1 B. nP C. P(1 − P)n−1 D. nP (1 − P )n−1

ugcnetjan2017iii computer-networks lan-technologies

4.42 Link State Routing (1)

4.42.1 Link State Routing: UGCNET-Jan2017-II: 30 https://gateoverflow.in/335133

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

4.43 Loopback Address (1)

4.43.1 Loopback Address: UGCNET-June-2019-II: 85 https://gateoverflow.in/316194

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
ugcnetjune2019ii ip-addressing loopback-address

4.44 Mesh Topology (3)

4.44.1 Mesh Topology: UGCNET-Dec2014-III: 25 https://gateoverflow.in/60460

For n devices in a network, ________ number of duplex-mode links are required for a mesh topology.
A. n(n + 1) B. n(n– 1)
C. n(n + 1)/2 D. n(n– 1)/2
ugcnetdec2014iii computer-networks network-topologies mesh-topology

4.44.2 Mesh Topology: UGCNET-June-2019-II: 81 https://gateoverflow.in/316198

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 n nodes, the number of direct links as a function of n can be expressed as
n(n+1) (n+1) n n(n−1)
A. 2 B. 2 C. 2 D. 2
ugcnetjune2019ii mesh-topology

4.44.3 Mesh Topology: UGCNET-June2016-II: 27 https://gateoverflow.in/63434

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

ugcnetjune2016ii computer-networks mesh-topology

4.45 Mobile Communication (7)

4.45.1 Mobile Communication: UGCNET-Dec2012-II: 3 https://gateoverflow.in/56501

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
ugcnetdec2012ii computer-networks communication mobile-communication

4.45.2 Mobile Communication: UGCNET-Dec2012-III: 26 https://gateoverflow.in/57394

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
ugcnetdec2012iii mobile-communication computer-networks

4.45.3 Mobile Communication: UGCNET-Dec2012-III: 30 https://gateoverflow.in/57460

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

ugcnetdec2012iii mobile-communication computer-networks non-gate

4.45.4 Mobile Communication: UGCNET-Dec2014-II: 46 https://gateoverflow.in/59831

Consider the following statements S1 and S2 :

S1 : 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.
S2 : 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. S1 is true and S2 is not true. B. S1 is not true and S2 is true.
C. Both S1 and S2 are true. D. Both S1 and S2 are not true.
ugcnetdec2014ii mobile-communication

4.45.5 Mobile Communication: UGCNET-Dec2015-II: 24 https://gateoverflow.in/62262

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

ugcnetdec2015ii mobile-communication computer-networks non-gate

4.45.6 Mobile Communication: UGCNET-June2012-III: 60 https://gateoverflow.in/47599

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

ugcnetjune2012iii computer-networks transmission-media mobile-communication

4.45.7 Mobile Communication: UGCNET-June2014-II: 26 https://gateoverflow.in/54055

Match the following with respect to the mobile computing technologies :

 List-I List-II
a. GPRS i. An Integrated digital radio standard
b. GSM ii. 3G wireless/Mobile technology
c. UMTS iii. Nine different schemes for modulation
and error correction
d. EDGE iv. An emerging wireless service that offeres
a mobile data
Codes :
A. a-iii; b-iv; c-ii; d-i B. a-iv; b-i; c-ii; d-iii
C. a-ii; b-iii; c-iv; d-i D. a-ii; b-i; c-iv; d-iii
ugcnetjune2014ii computer-networks mobile-communication

4.46 Modulation (2)

4.46.1 Modulation: UGCNET-Nov2017-iii-26 https://gateoverflow.in/166402

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
ugcnetnov2017-iii computer-networks modulation physical-layer

4.46.2 Modulation: UGCNET-Sep2013-III: 10 https://gateoverflow.in/59511

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

ugcnetsep2013iii computer-networks modulation

4.47 Multimedia Protocol (1)

4.47.1 Multimedia Protocol: UGCNET-Dec2015-III: 14 https://gateoverflow.in/62440

In electronic mail, which of the following protocols allows the transfer of multimedia messages?

A. IMAP B. SMTP C. POP 3 D. MIME

ugcnetdec2015iii computer-networks multimedia-protocol

4.48 Multiple Access Protocol (1)

4.48.1 Multiple Access Protocol: UGCNET-AUG2016-III: 28 https://gateoverflow.in/70936

A slotted ALOHA network transmits 200 bits frames using a shared channel with 200 kbps bandwidth. If the system
(all stations put together) produces 1000 frames per second, then the throughput of the system is _______.

A. 0.268 B. 0.468 C. 0.368 D. 0.568

ugcnetaug2016iii computer-networks multiple-access-protocol transmission-media

4.49 Multiplexing (2)

4.49.1 Multiplexing: UGCNET-Dec2010-II: 30 https://gateoverflow.in/66903

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.

ugcnetdec2010ii computer-networks multiplexing

 4.49.2 Multiplexing: UGCNET-dec2008-ii-35 https://gateoverflow.in/155359

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

ugcnetdec2008ii computer-networks multiplexing network-switching

4.50 Network Addressing (2)

4.50.1 Network Addressing: UGCNET-Dec2015-III: 10 https://gateoverflow.in/48399

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 ugcnetdec2015iii

4.50.2 Network Addressing: UGCNET-Dec2015-III: 13 https://gateoverflow.in/48619

In a classful addressing the IP address with 0(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 ugcnetdec2015iii

4.51 Network Layer (1)

4.51.1 Network Layer: UGCNET-Dec2015-II: 40 https://gateoverflow.in/62313

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
ugcnetdec2015ii computer-networks network-layer

4.52 Network Layering (5)

4.52.1 Network Layering: UGCNET-Dec2012-II: 17 https://gateoverflow.in/56520

The design issue of Datalink layer in OSI Reference Model is

A. Framing B. Representation of bits
C. Synchronization of bits D. Connection control
ugcnetdec2012ii computer-networks network-layering

4.52.2 Network Layering: UGCNET-Dec2013-III: 45 https://gateoverflow.in/60722

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

ugcnetdec2013iii computer-networks network-layering

4.52.3 Network Layering: UGCNET-June2012-II: 15 https://gateoverflow.in/55834

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
ugcnetjune2012ii computer-networks network-layering

4.52.4 Network Layering: UGCNET-June2012-II: 6 https://gateoverflow.in/55608

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)
ugcnetjune2012ii computer-networks network-layering

4.52.5 Network Layering: UGCNET-June2014-II: 05 https://gateoverflow.in/49214

Match the following :

List – I List – II
a. Physical layer i. Allow resources to network access
b. Datalink layer ii. Move packets from one destination to other
c. Network layer iii. Process to process message delivery
d. Transport layer iv. Transmission of bit stream
e. Application Layer v. Formation of frames
Codes :
A. a-iv; b-v; c-ii; d-iii; e-i B. a-v; b-iv; c-i; d-ii; e-iii
C. a-i; b-iii; c-ii; d-v; e-iv D. a-i; b-ii; c-iv; d-iii; e-v
ugcnetjune2014ii computer-networks network-layering

4.53 Network Protocols (10)

4.53.1 Network Protocols: UGCNET-AUG2016-II: 30 https://gateoverflow.in/69954

Which of the following protocols is used by email server to maintain a central repository that can be accessed from any
machine ?

A. POP3 B. IMAP C. SMT P D. DMSP

ugcnetaug2016ii computer-networks network-protocols

4.53.2 Network Protocols: UGCNET-AUG2016-III: 26 https://gateoverflow.in/70933

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 P P P 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 P P P frames.
Which of the following is correct ?
A. A and B are true; C and D are false. B. A and B are false; C and D are true.
C. A, B, C and D are true. D. A, B, C and D are false.
ugcnetaug2016iii computer-networks ethernet network-protocols

4.53.3 Network Protocols: UGCNET-Dec2010-II: 29 https://gateoverflow.in/66902

Which of the following file transfer protocols use TCP and establishes two virtual circuits between the local and
remote server ?

A. FT P B. T FT P C. T ELNET D. NFS
ugcnetdec2010ii computer-networks network-protocols

4.53.4 Network Protocols: UGCNET-Dec2012-II: 8 https://gateoverflow.in/56511

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)
ugcnetdec2012ii computer-networks network-protocols

4.53.5 Network Protocols: UGCNET-June2010-II: 26 https://gateoverflow.in/67884

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

 ugcnetjune2010ii computer-networks network-protocols

4.53.6 Network Protocols: UGCNET-Oct2020-II: 33 https://gateoverflow.in/349640

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
ugcnet-oct2020-ii computer-networks network-protocols

4.53.7 Network Protocols: UGCNET-Oct2020-II: 59 https://gateoverflow.in/349614

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?
a. POP has two modes, Delete mode and keep b. In Delete mode, mail is deleted from mail box after each retrival
c. In Delete mode, mail is deleted from mail box before each
d. In keep mode, mail is deleted before retrival
retriveal Choose the correct answer from the options given below:
e. In keep mode, mail remains in mail box after retrival
A. (a) and (b) only B. (a) , (d) and (e) only
C. (a), (b), (c) and (d) only D. (a), (b) and (e) only
ugcnet-oct2020-ii computer-networks network-protocols

4.53.8 Network Protocols: UGCNET-Oct2020-II: 72 https://gateoverflow.in/349601

Match List I with List II

List I List II
(A) Serial Line IP (SLIP) (I) Application layer
(B) Border Gateway Protocol (BGP) (II) Transport layer
(C) User Data Protocol (UDP) (III) Data Link layer
(D) Simple Network Management (IV ) Network layer
Protocol
Choose the correct answer from the options given below:
A. A − I, B − II, C − III, D − IV B. A − III, B − IV , C − II, D − I
C. A − II, B − III, C − IV , D − I D. A − III, B − I, C − IV , D − II
ugcnet-oct2020-ii computer-networks network-protocols

4.53.9 Network Protocols: UGCNET-Sep2013-II: 42 https://gateoverflow.in/59253

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

4.53.10 Network Protocols: UGCNET-Sep2013-III: 11 https://gateoverflow.in/59513

Match the following :

(a) UDP (i) Message Transfer Protocol
(b) OSPF (ii) Bit Oriented Protocol
(c) SMTP (iii) Interior Gateway Routing Protocol
(d) HDLC (iv) Connectionless Transport Protocol
Codes:
A. (a)-(iii), (b)-(iv), (c)-(ii), (d)-(i) B. (a)-(iv), (b)-(iii), (c)-(ii), (d)-(i)
C. (a)-(iv), (b)-(iii), (c)-(i), (d)-(ii) D. (a)-(iii), (b)-(iv), (c)-(i), (d)-(ii)
ugcnetsep2013iii computer-networks network-protocols

4.54 Network Security (16)

4.54.1 Network Security: UGCNET-AUG2016-II: 46 https://gateoverflow.in/70367

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
ugcnetaug2016ii computer-networks network-security

4.54.2 Network Security: UGCNET-Dec2010-II: 20 https://gateoverflow.in/66818

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
ugcnetdec2010ii computer-networks network-security

4.54.3 Network Security: UGCNET-Dec2012-II: 37 https://gateoverflow.in/45257

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

ugcnetdec2012ii computer-networks network-security

4.54.4 Network Security: UGCNET-Dec2012-III: 72 https://gateoverflow.in/57832

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
ugcnetdec2012iii computer-networks network-security

4.54.5 Network Security: UGCNET-Dec2012-III: 8 https://gateoverflow.in/57365

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
ugcnetdec2012iii computer-networks network-security

4.54.6 Network Security: UGCNET-Dec2015-II: 25 https://gateoverflow.in/62263

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
ugcnetdec2015ii computer-networks network-security

4.54.7 Network Security: UGCNET-June-2019-II: 89 https://gateoverflow.in/316190

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
ugcnetjune2019ii network-security

4.54.8 Network Security: UGCNET-June2010-II: 5 https://gateoverflow.in/67749

For your ATM debit card, you have a 4-decimal-digit personal secret code. In the absence of any clue, a brute-force
attack takes time-′ t′ to crack the code on an ATM terminal. Therefore ′ t′ 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 ′ t′ ?

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.

ugcnetjune2010ii computer-networks network-security

4.54.9 Network Security: UGCNET-June2014-II: 30 https://gateoverflow.in/54072

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
ugcnetjune2014ii computer-networks network-security

4.54.10 Network Security: UGCNET-June2015-III: 27 https://gateoverflow.in/61240

Which are two modes of IP security?

A. Transport and certificate B. Transport and tunnel
C. Certificate and tunnel D. Preshared and transport
ugcnetjune2015iii computer-networks network-security

4.54.11 Network Security: UGCNET-June2015-III: 28 https://gateoverflow.in/61242

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
ugcnetjune2015iii computer-networks network-security

4.54.12 Network Security: UGCNET-June2016-II: 29 https://gateoverflow.in/63437

If there are N people in the world and are using secret key encryption and decryption for privacy purpose, then the
number of secret keys required will be
N(N−1) N(N+1)
A. N B. (N − 1) C. 2 D. 2
ugcnetjune2016ii computer-networks network-security

4.54.13 Network Security: UGCNET-June2016-II: 46 https://gateoverflow.in/58159

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
ugcnetjune2016ii computer-networks network-security

4.54.14 Network Security: UGCNET-June2016-III: 30 https://gateoverflow.in/63951

Encrypt the plain text message ‘‘EXTRANET " using Transposition cipher technique with the following key :
3 5 2 1 4 (Cipher text)
1 2 3 4 5 (Plain text)
Using ‘Z' as bogus character.

A. TAXERTZENZ B. EXTRANETZZ C. EZXZTRZANZET D. EXTZRANZETZ

ugcnetjune2016iii computer-networks network-security
 4.54.15 Network Security: UGCNET-Oct2020-II: 89 https://gateoverflow.in/349584

Given below are two statements:

Statement I : In Ceasar Cipher each letter of Plain text is replaced by another letter for encryption
Statement II : 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 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

ugcnet-oct2020-ii computer-networks network-security

4.54.16 Network Security: UGCNET-june2009-ii-48 https://gateoverflow.in/154828

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

ugcnetjune2009ii network-security

4.55 Network Switching (5)

4.55.1 Network Switching: UGCNET-AUG2016-III: 25 https://gateoverflow.in/70929

Suppose transmission rate of a channel is 32 kbps. If there are ‘8′ routes from source to destination and each packet p
contains 8000 bits. Total end to end delay in sending packet P is _____.

A. 2 sec B. 3 sec C. 4 se D. 1 sec

ugcnetaug2016iii computer-networks network-switching

4.55.2 Network Switching: UGCNET-Dec2011-II: 10 https://gateoverflow.in/63073

Which of the following network access standard disassembler is used for connection station to a packet switched
network ?

A. X.3 B. X.21 C. X.25 D. X.75

ugcnetdec2011ii computer-networks network-switching

4.55.3 Network Switching: UGCNET-Jan2017-III: 28 https://gateoverflow.in/335210

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

ugcnetjan2017iii computer-networks network-switching

4.55.4 Network Switching: UGCNET-July-2018-II: 46 https://gateoverflow.in/225840

Which of the following statements are true?

a. Three broad categories of

b. Networks
Circuit Switched
are Network
c. In
resources
packet switching
need not be
there
reserved
is no resource
during the
allocation
set up phase
for packets

i. Circuit
ii. Packet
iii.Switched
Message
Switched
Networks
Switched
Networks
Networks

A. a and b only B. b and c only C. a and c only D. a, b and c

 ugcnetjuly2018ii computer-networks network-switching

4.55.5 Network Switching: UGCNET-June2012-II: 16 https://gateoverflow.in/55835

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

ugcnetjune2012ii computer-networks network-switching

4.56 Network Topologies (4)

4.56.1 Network Topologies: UGCNET-Dec2011-II: 8 https://gateoverflow.in/63070

Hub is a term used with

A. A Star Networks B. A Ring Networks C. A Router D. A Bridge

ugcnetdec2011ii computer-networks network-topologies

4.56.2 Network Topologies: UGCNET-June2013-III: 16 https://gateoverflow.in/58281

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

ugcnetjune2013iii computer-networks network-topologies

4.56.3 Network Topologies: UGCNET-dec2009-ii-29 https://gateoverflow.in/152896

In case of Bus/Tree topology signal balancing issue is overcome by

(A) Modulation

(B) Polling

(C) Segmentation

(D) Strong transmitter

ugcnetdec2009ii computer-networks network-topologies

4.56.4 Network Topologies: UGCNET-dec2009-ii-46 https://gateoverflow.in/152941

The single stage network is also called

(A) one sided network

(B) two sided network

(C) recirculating network

(D) pipeline network

ugcnetdec2009ii computer-networks network-topologies

4.57 Osi Model (11)

4.57.1 Osi Model: UGCNET-AUG2016-II: 29 https://gateoverflow.in/69953

Match the following :

List-I List-II
a. Session layer i. Virtual terminal software
b. Application layer ii. Semantics of the information transmitted
c. Presentation layer iii. Flow Control
d. Transport Layer iv. Manage dialogue Control
Codes :
 A. a-iv, b-i, c-ii, d-iii B. a-i, b-iv, c-ii, d-iii
C. a-iv, b-i, c-iii, d-ii D. a-iv, b-ii, c-i, d-iii
ugcnetaug2016ii computer-networks osi-model

4.57.2 Osi Model: UGCNET-Dec2012-II: 43 https://gateoverflow.in/57102

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
ugcnetdec2012ii computer-networks osi-model

4.57.3 Osi Model: UGCNET-Dec2013-II: 1 https://gateoverflow.in/60024

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
ugcnetdec2013ii computer-networks osi-model

4.57.4 Osi Model: UGCNET-Dec2013-II: 2 https://gateoverflow.in/60025

Encryption and decryption is the responsibility of ____ Layer

A. Physical B. Network C. Application D. Datalink

ugcnetdec2013ii computer-networks osi-model

4.57.5 Osi Model: UGCNET-June2010-II: 28 https://gateoverflow.in/67889

End-to-End connectivity is provided from Last-to-Last in

A. Network layer B. Session layer
C. Transport layer D. Data link layer
ugcnetjune2010ii computer-networks osi-model

4.57.6 Osi Model: UGCNET-June2010-II: 29 https://gateoverflow.in/67891

What services does the internet layer provide ?

1. Quality of service
2. Routing
3. Addressing
4. Connection oriented delivery
5. Framing bits

A. 1, 2, 3 B. 2, 3, 4 C. 1, 3, 4, 5 D. 2, 3, 4, 5
ugcnetjune2010ii computer-networks osi-model

4.57.7 Osi Model: UGCNET-June2013-III: 18 https://gateoverflow.in/58286

Match the following :

a. Data link Layer i. Flow Control
b. Network Layer ii. Node to node delivery
c. Transport Layer iii. Mail services
d. Application Layer iv. Routing
Codes :
A. a-ii, b-i, c-iv, d-iii B. a-ii, b-iv, c-i, d-iii
C. a-ii, b-i, c-iii, d-iv D. a-ii, b-iv, c-iii, d-i
ugcnetjune2013iii computer-networks osi-model
 4.57.8 Osi Model: UGCNET-June2014-III: 70 https://gateoverflow.in/57597

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

4.57.9 Osi Model: UGCNET-dec2008-ii-17 https://gateoverflow.in/155176

Congestion control is done by :

A. Network layer
B. Physical layer
C. Presentation layer
D. Application layer

ugcnetdec2008ii computer-networks osi-model

4.57.10 Osi Model: UGCNET-dec2008-ii-18 https://gateoverflow.in/155177

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

ugcnetdec2008ii computer-networks osi-model

4.57.11 Osi Model: UGCNET-dec2008-ii-6 https://gateoverflow.in/155030

An example of a layer that is absent in broadcast networks is :

A. Physical layer
B. Presentation layer
C. Network layer
D. Application layer

ugcnetdec2008ii computer-networks osi-model network-layer

4.58 Osi Protocol (5)

4.58.1 Osi Protocol: UGCNET-Dec2012-III: 10 https://gateoverflow.in/57372

Match the following :

List-I List-II
a. Application layer i. TCP
b. Transport Layer ii. HDLC
c. Network Layer iii. HTTP
d. Data Link Layer iv. BGP
Codes :
A. a-ii, b-i, c-iv, d-iii B. a-iii, b-iv, c-i, d-ii
C. a-iii, b-i, c-iv, d-ii D. a-ii, b-iv, c-i, d-iii
ugcnetdec2012iii computer-networks osi-protocol
 4.58.2 Osi Protocol: UGCNET-Jan2017-II: 26 https://gateoverflow.in/335137

Match the following Layers and Protocols for a user browsing with SSL :

a. Application of layer i. TCP

b. Transport layer ii. IP
c. Network layer iii. PPP
d. Datalink layer iv. HTTP
Code :
A. a-iv, b-i, c-ii, d-iii B. a-iii, b-ii, c-i, d-iv
C. a-ii, b-iii, c-iv, d-i D. a-iii, b-i, c-iv, d-ii
ugcnetjan2017ii computer-networks osi-protocol

4.58.3 Osi Protocol: UGCNET-June2012-III: 11 https://gateoverflow.in/56092

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
ugcnetjune2012iii computer-networks osi-protocol

4.58.4 Osi Protocol: UGCNET-June2012-III: 41 https://gateoverflow.in/56276

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
ugcnetjune2012iii computer-networks osi-protocol

4.58.5 Osi Protocol: UGCNET-June2015-II: 26 https://gateoverflow.in/61058

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
ugcnetjune2015ii osi-protocol computer-networks

4.59 Physical Layer (4)

4.59.1 Physical Layer: UGCNET-Dec2010-II: 28 https://gateoverflow.in/66900

How much bandwidth is there in 1 micron of spectrum at a wavelength of 1 micron ?

A. 300 MHz B. 3 GHz C. 300 THz D. 30 KHz

ugcnetdec2010ii computer-networks physical-layer

4.59.2 Physical Layer: UGCNET-Dec2013-II: 3 https://gateoverflow.in/60028

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
ugcnetdec2013ii computer-networks osi-model physical-layer

4.59.3 Physical Layer: UGCNET-July-2018-II: 42 https://gateoverflow.in/225844

The period of a signal is 100 ms. Its frequency is ____

A. 1003 Hertz B. 10−2 KHz C. 10−3 KHz D. 105 Hertz

ugcnetjuly2018ii computer-networks physical-layer
 4.59.4 Physical Layer: UGCNET-June2013-III: 21 https://gateoverflow.in/58290

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
ugcnetjune2013iii computer-networks physical-layer

4.60 Port Numbers (1)

4.60.1 Port Numbers: UGCNET-June2015-II: 27 https://gateoverflow.in/61059

Match the following port numbers with their uses:

List – I List – II
a. 23 i. World wide web
b. 25 ii. Remote login
c. 80 iii. USENET news
d. 119 iv. E-mail

A. a − iv, b − i, c − ii, d − iii B. a − ii, b − i, c − iv, d − iii

C. a − ii, b − iv, c − iii, d − i D. a − ii, b − iv, c − i, d − iii
ugcnetjune2015ii computer-networks port-numbers

4.61 Propagation Delay (1)

4.61.1 Propagation Delay: UGCNET-June-2019-II: 83 https://gateoverflow.in/316196

You are designing a link layer protocol for a link with bandwidth of 1 Gbps ( 109 bits/second) over a fiber link with
length of 800 km. Assume the speed of light in this medium is 200000 km/second. What is the propagation delay in
this link?
A. 1 millisecond B. 2 milliseconds
C. 3 milliseconds D. 4 milliseconds
ugcnetjune2019ii propagation-delay

4.62 Propagation Time (1)

4.62.1 Propagation Time: UGCNET-Dec2014-III: 28 https://gateoverflow.in/60510

What is the propagation time if the distance between the two points is 48, 000 ? Assume the propagation speed to be
2.4 × 108 metre/second in cable.

A. 0.5 ms B. 20 ms C. 50 ms D. 200 ms
ugcnetdec2014iii computer-networks propagation-time

4.63 Protocol (1)

4.63.1 Protocol: UGCNET-Dec2014-II: 50 https://gateoverflow.in/59912

Match the following :

List – I List – II
a. Call Control protocol i. Interface between Base Transceiver Station
(BTS) and Base Station Controller (BSC)
b. A-bis ii. Spread spectrum
c. BSMAP iii. Connection management
d. CDMA iv. Works between Mobile Switching Centre
( MSC) and Base Station Subsystem (BSS)
Codes :
A. a-iii, b-iv, c-i, d-ii B. a-iii, b-i, c-iv, d-ii
C. a-i, b-ii, c-iii, d-iv D. a-iv, b-iii, c-ii, d-i
ugcnetdec2014ii computer-networks protocol
4.64 Pure Aloha (1)

4.64.1 Pure Aloha: UGCNET-June2016-III: 27 https://gateoverflow.in/58721

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

ugcnetjune2016iii computer-networks pure-aloha

4.65 Rarp Protocol (1)

4.65.1 Rarp Protocol: UGCNET-June-2019-II: 82 https://gateoverflow.in/316197

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

ugcnetjune2019ii rarp-protocol

4.66 Routers Bridge Hubs Switches (2)

4.66.1 Routers Bridge Hubs Switches: UGCNET-June2014-II: 02 https://gateoverflow.in/48595

A bridge has access to ________ address in the same network.

A. Physical B. Network
C. Datalink D. Application
ugcnetjune2014ii routers-bridge-hubs-switches

4.66.2 Routers Bridge Hubs Switches: UGCNET-june2009-ii-49 https://gateoverflow.in/154829

The device which connects dissimilar LANs 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

ugcnetjune2009ii computer-networks routers-bridge-hubs-switches

4.67 Routing (4)

4.67.1 Routing: UGCNET-Dec2011-II: 12 https://gateoverflow.in/63074

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
ugcnetdec2011ii computer-networks routing

4.67.2 Routing: UGCNET-Dec2015-III: 12 https://gateoverflow.in/48618

Consider a subnet with 720 routers. If a three level hierarchy is chosen with 8 clusters, each containing 9 regions of 10
routers, then total number of entries in the routing table is _______

A. 25 B. 27 C. 53 D. 72
computer-networks routing ugcnetdec2015iii

4.67.3 Routing: UGCNET-June2012-II: 17 https://gateoverflow.in/55837

In which routing method do all the routers have a common database?

A. Distance vector B. Link state
 C. Link vector D. Dijikstra method
ugcnetjune2012ii computer-networks routing

4.67.4 Routing: UGCNET-June2012-II: 41 https://gateoverflow.in/55886

What is the routing algorithm used by RIP and IGRP?

A. OSPF B. Link-state C. Dynamic D. Dijikstra vector

computer-networks routing ugcnetjune2012ii

4.68 Routing Algorithm (3)

4.68.1 Routing Algorithm: UGCNET-Dec2014-II: 28 https://gateoverflow.in/59413

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
ugcnetdec2014ii computer-networks routing-algorithm

4.68.2 Routing Algorithm: UGCNET-Sep2013-II: 6 https://gateoverflow.in/59011

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

4.68.3 Routing Algorithm: UGCNET-dec2008-ii-19 https://gateoverflow.in/155178

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

ugcnetdec2008ii computer-networks routing-algorithm

4.69 Rsa (1)

4.69.1 Rsa: UGCNET-June2013-II: 33 https://gateoverflow.in/11981

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 ugcnetjune2013ii

4.70 Rsa Public Key (1)

4.70.1 Rsa Public Key: UGCNET-Dec2013-II: 5 https://gateoverflow.in/60031

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

ugcnetdec2013ii computer-networks network-security rsa-public-key

4.71 Rsa Security Networks (2)

4.71.1 Rsa Security Networks: UGCNET-Jan2017-III: 29 https://gateoverflow.in/335209

In RSA public key cryptosystem suppose n = p ∗ q where p and q are primes. (e, n) and (d, n) are public and private
keys respectively. Let M be an integer such that o < M < n and ϕ(n) = (p − 1)(q − 1).
Which of the following equations represent RSA public key cryptosystem?
 C ≡ M e (mod n)
I.
M ≡ C d (mod n)
II. ed ≡ 1(mod n)
III. ed ≡ 1(mod ϕ(n))
C ≡ M e (mod ϕ(n))
IV.
M ≡ C d (mod ϕ(n))
A. I and II B. I and III
C. II and III D. I and IV
ugcnetjan2017iii computer-networks rsa-security-networks

4.71.2 Rsa Security Networks: UGCNET-June-2019-II: 90 https://gateoverflow.in/316189

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
ugcnetjune2019ii network-security rsa-security-networks computer-networks

4.72 Serial Communication (2)

4.72.1 Serial Communication: UGCNET-Dec2013-III: 47 https://gateoverflow.in/60726

The start and stop bits are used in serial communication for
A. error detection B. error correction
C. synchronization D. slowing down the communication
ugcnetdec2013iii computer-networks serial-communication

4.72.2 Serial Communication: UGCNET-June2014-II: 04 https://gateoverflow.in/48598

The bit rate of a signal is 3000 bps. If each signal unit carries 6 bits, the baud rate of the signal is _________.
A. 500 baud/sec B. 1000 baud/sec
C. 3000 baud/sec D. 18000 baud/sec.
ugcnetjune2014ii computer-networks serial-communication

4.73 Session Layer (1)

4.73.1 Session Layer: UGCNET-June2015-II: 28 https://gateoverflow.in/61060

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
ugcnetjune2015ii computer-networks session-layer

4.74 Signalling (1)

4.74.1 Signalling: UGCNET-AUG2016-III: 59 https://gateoverflow.in/71617

Which of the following is a source coding technique ?

A. Huffman coding B. Arithmetic coding
C. Run-length coding D. DPCM
ugcnetaug2016iii computer-networks signalling

4.75 Signals (1)

4.75.1 Signals: UGCNET-June2013-III: 20 https://gateoverflow.in/58289

The ______ measure the relative strengths of two signals or a signal at two different points.

A. frequency B. attenuation C. throughput D. decibel

ugcnetjune2013iii computer-networks signals

4.76 Sliding Window (4)

 4.76.1 Sliding Window: UGCNET-Dec2012-III: 4 https://gateoverflow.in/57361

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

ugcnetdec2012iii computer-networks sliding-window

4.76.2 Sliding Window: UGCNET-Jan2017-III: 26 https://gateoverflow.in/335212

Station A uses 32 byte packets t transmit messages to station B using sliding window protocol. The round trip delay
between A and B is 40 milliseconds and the bottleneck bandwidth on the path between A and B is 64 kbps. The
optimal window size of A is

A. 20 B. 10 C. 30 D. 40
ugcnetjan2017iii computer-networks sliding-window

4.76.3 Sliding Window: UGCNET-June2014-III: 72 https://gateoverflow.in/101344

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

4.76.4 Sliding Window: UGCNET-dec2009-ii-27 https://gateoverflow.in/152889

What is the maximum window size in sliding window protocol used in a computer
network ?

(A) 4

(B) 8

(C) 15

(D) 16
ugcnetdec2009ii computer-networks sliding-window

4.77 Slotted Aloha (1)

4.77.1 Slotted Aloha: UGCNET-July-2018-II: 41 https://gateoverflow.in/225845

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

ugcnetjuly2018ii computer-networks slotted-aloha

4.78 Subnetting (1)

4.78.1 Subnetting: UGCNET-June-2019-II: 84 https://gateoverflow.in/316195

You need 500 subnets, each with about 100 usable host address per subnet. What network mask will you assign using
a class B network address?
A. 255.255.255.252 B. 255.255.255.128
C. 255.255.255.0 D. 255.255.254.0
ugcnetjune2019ii subnetting

4.79 Tcp (4)

 4.79.1 Tcp: UGCNET-Jan2017-II: 28 https://gateoverflow.in/335135

A packet whose destination is outside the local TCP /IP network segment is sent to ________.

A. File server B. DNS server C. DHCP server D. Default gateway

ugcnetjan2017ii computer-networks tcp

4.79.2 Tcp: UGCNET-June2015-III: 26 https://gateoverflow.in/61239

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

ugcnetjune2015iii computer-networks tcp

4.79.3 Tcp: UGCNET-June2015-III: 30 https://gateoverflow.in/61248

The minimum payload of a TCP segment is

A. 65,535 B. 65,515 C. 65,495 D. 65,475

ugcnetjune2015iii computer-networks tcp

4.79.4 Tcp: UGCNET-Sep2013-III: 9 https://gateoverflow.in/59510

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
ugcnetsep2013iii computer-networks tcp

4.80 Tcp Header (1)

4.80.1 Tcp Header: UGCNET-Dec2014-III: 27 https://gateoverflow.in/60506

Which of the following is not a field in TCP header ?

A. Sequence number B. Fragment offset
C. Checksum D. Window size
ugcnetdec2014iii computer-networks tcp-header

4.81 Tcp Ip Model (1)

4.81.1 Tcp Ip Model: UGCNET-June2016-II: 28 https://gateoverflow.in/63436

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

ugcnetjune2016ii computer-networks tcp-ip-model

4.82 Tcp Ip Suit Protocols (1)

4.82.1 Tcp Ip Suit Protocols: UGCNET-Dec2012-III: 22 https://gateoverflow.in/57389

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
ugcnetdec2012iii computer-networks tcp-ip-suit-protocols

4.83 Tele Communication (1)

4.83.1 Tele Communication: UGCNET-June2015-III: 25 https://gateoverflow.in/61238

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
ugcnetjune2015iii computer-networks data-communication tele-communication

4.84 Token Bucket (1)

4.84.1 Token Bucket: UGCNET-Jan2017-III: 30 https://gateoverflow.in/335208

A node X on a 10 Mbps network is regulated by a token bucket. The token bucket is filled at a rate of 2 Mbps. Token
bucket is initially filled with 16 megabits. The maximum duration taken by X to transmit at full rate of 10 Mbps is
______secs.

A. 1 B. 2 C. 3 D. 4
ugcnetjan2017iii computer-networks token-bucket

4.85 Transmission Media (9)

4.85.1 Transmission Media: UGCNET-AUG2016-II: 26 https://gateoverflow.in/69947

Which of the following statements is not true with respect to microwaves ?

A. Electromagnetic waves with frequencies from 300 GHz to 400 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.

ugcnetaug2016ii computer-networks transmission-media

4.85.2 Transmission Media: UGCNET-AUG2016-II: 27 https://gateoverflow.in/69948

In a fast Ethernet cabling, 100 Base-TX uses ______ cable and maximum segment size is ______.
A. Twisted pair, 100 metres B. Twisted pair, 200 metres
C. Fibre optics, 1000 metres D. Fibre optics, 2000 metres
ugcnetaug2016ii computer-networks transmission-media

4.85.3 Transmission Media: UGCNET-AUG2016-II: 28 https://gateoverflow.in/69950

A network with bandwidth of 10 Mbps can pass only an average of 12, 000 frames per minute with each frame
carrying an average of 10, 000 bits. What is the throughput of this network ?

A. 1 Mbps B. 2 Mbps C. 10 Mbps D. 12 Mbps

ugcnetaug2016ii computer-networks transmission-media

4.85.4 Transmission Media: UGCNET-AUG2016-III: 29 https://gateoverflow.in/70937

An analog signal has a bit rate of 8000 bps and a baud rate of 1000. Then analog signal has _____ signal elements and
carry _____ data elements in each signal.

A. 256, 8 bits B. 128, 4 bits C. 256, 4 bits D. 128, 8 bits

ugcnetaug2016iii computer-networks transmission-media

4.85.5 Transmission Media: UGCNET-Dec2010-II: 26 https://gateoverflow.in/66896

Frequency shift keying is used mostly in

A. Radio transmission B. Telegraphy
C. Telephone D. None of the above
ugcnetdec2010ii computer-networks transmission-media

4.85.6 Transmission Media: UGCNET-Dec2012-II: 23 https://gateoverflow.in/56840

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
ugcnetdec2012ii computer-networks transmission-media

4.85.7 Transmission Media: UGCNET-June2016-II: 30 https://gateoverflow.in/63439

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
ugcnetjune2016ii computer-networks transmission-media

4.85.8 Transmission Media: UGCNET-dec2008-ii-10 https://gateoverflow.in/155034

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

ugcnetdec2008ii computer-networks transmission-media

4.85.9 Transmission Media: UGCNET-dec2008-ii-7 https://gateoverflow.in/155031

The ATM cell is:

1. 48 bytes long
2. 53 bytes long
3. 64 bytes long
4. 69 bytes long

ugcnetdec2008ii computer-networks transmission-media

4.86 Transport Layer (2)

4.86.1 Transport Layer: UGCNET-dec2004-26 https://gateoverflow.in/156345

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 sequence delivery
(D) from packet losses
tcp transport-layer

4.86.2 Transport Layer: UGCNET-dec2004-27 https://gateoverflow.in/156346

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

transport-layer tcp

4.87 Unguided Media (1)

4.87.1 Unguided Media: UGCNET-Dec2013-II: 4 https://gateoverflow.in/60029

The VLF and LF bauds use _____ propagation for communication

A. Ground B. Sky C. Line of sight D. Space

ugcnetdec2013ii computer-networks unguided-media

4.88 Wifi (1)

 4.88.1 Wifi: UGCNET-dec2009-ii-49 https://gateoverflow.in/152944

Another name of IEEE 802.11 a is ____________

(A) Wi-Max

(B) Fast Ethernet

(C) Wi-Fi

(D) 802.11 g
ugcnetdec2009ii computer-networks wifi

4.89 Wireless Communication (1)

4.89.1 Wireless Communication: UGCNET-June2012-II: 28 https://gateoverflow.in/45089

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
ugcnetjune2012ii computer-networks mobile-communication wireless-communication

4.90 Wireless Lan (4)

4.90.1 Wireless Lan: UGCNET-Dec2015-II: 21 https://gateoverflow.in/62254

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
ugcnetdec2015ii computer-networks wireless-lan

4.90.2 Wireless Lan: UGCNET-June2010-II: 30 https://gateoverflow.in/67893

What is the maximum operating rate of a wireless LAN using infrared communication ?

A. 1 mbps B. 2 mbps C. 5 mbps D. 11 mbps

ugcnetjune2010ii computer-networks wireless-lan

4.90.3 Wireless Lan: UGCNET-dec2009-ii-48 https://gateoverflow.in/152943

Which technology is sometime referred to as wireless cable ?

(A) MMDS

(B) ATM

(C) LMDS

(D) CDMA
ugcnetdec2009ii computer-networks wireless-lan

4.90.4 Wireless Lan: UGCNET-dec2009-ii-50 https://gateoverflow.in/152945

The unlicensed National Information Infrastructure band operates at the _________ frequency

(A) 2.4 GHz

(B) 5 GHz

(C) 33 MHz

(D) 5 MHz
 ugcnetdec2009ii computer-networks wireless-lan

4.91 Wireless Networks (1)

4.91.1 Wireless Networks: UGCNET-dec2008-ii-47 https://gateoverflow.in/155370

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

ugcnetdec2008ii computer-networks wireless-networks

4.92 Wireless Protocol (1)

4.92.1 Wireless Protocol: UGCNET-Dec2013-II: 42 https://gateoverflow.in/60251

Match the following :

List – I List – II
a. Wireless Application Environment i. HTTP
b. Wireless Transaction protocol ii. IP
c. Wireless Datagram Protocol iii. Scripts
d. Wireless iv. UDP
Codes :
A. a-ii, b-iv, c-i, d-iii B. a-iv, b-iii, c-ii, d-i
C. a-iv, b-iii, c-i, d-ii D. a-iii, b-i, c-iv, d-ii
ugcnetdec2013ii computer-networks wireless-protocol

4.93 Wireless Transmission (1)

4.93.1 Wireless Transmission: UGCNET-June2012-III: 66 https://gateoverflow.in/56421

If the period of a signal is 1000 ms, then what is its frequency in kiliohertz?

A. 10−3 KHz B. 10−2 KHz C. 10−1 KHz D. 1 KHz

ugcnetjune2012iii computer-networks data-communication wireless-transmission

Answer Keys
4.0.1 B 4.0.2 Q-Q 4.0.3 D 4.0.4 Q-Q 4.0.5 Q-Q
4.0.6 Q-Q 4.0.7 X 4.0.8 Q-Q 4.0.9 B 4.0.10 B
4.0.11 C 4.0.12 D 4.0.13 A 4.0.14 Q-Q 4.0.15 D
4.0.16 C 4.0.17 Q-Q 4.0.18 D 4.0.19 B 4.0.20 B
4.0.21 D 4.0.22 C 4.0.23 A 4.0.24 B 4.0.25 Q-Q
4.0.26 Q-Q 4.0.27 Q-Q 4.0.28 Q-Q 4.0.29 Q-Q 4.0.30 Q-Q
4.0.31 Q-Q 4.0.32 Q-Q 4.0.33 Q-Q 4.0.34 Q-Q 4.0.35 Q-Q
4.0.36 Q-Q 4.0.37 C 4.0.38 Q-Q 4.0.39 Q-Q 4.0.40 D
4.0.41 Q-Q 4.0.42 Q-Q 4.0.43 D 4.0.44 Q-Q 4.0.45 Q-Q
4.0.46 Q-Q 4.0.47 Q-Q 4.0.48 Q-Q 4.0.49 Q-Q 4.0.50 Q-Q
4.0.51 D 4.0.52 Q-Q 4.0.53 Q-Q 4.0.54 Q-Q 4.0.55 Q-Q
4.0.56 Q-Q 4.0.57 Q-Q 4.0.58 Q-Q 4.0.59 D 4.1.1 D
4.2.1 B 4.3.1 X 4.4.1 A 4.5.1 Q-Q 4.6.1 A
4.7.1 B 4.8.1 B 4.9.1 Q-Q 4.10.1 Q-Q 4.11.1 Q-Q
4.12.1 A 4.12.2 X 4.13.1 D 4.14.1 C 4.14.2 D
4.14.3 A 4.14.4 B 4.14.5 C 4.14.6 D 4.14.7 A
4.14.8 C 4.14.9 C 4.15.1 D 4.16.1 D 4.16.2 A
4.17.1 Q-Q 4.17.2 C 4.17.3 D 4.17.4 Q-Q 4.17.5 C
4.17.6 C 4.17.7 C 4.18.1 Q-Q 4.18.2 Q-Q 4.18.3 Q-Q
4.18.4 Q-Q 4.18.5 Q-Q 4.18.6 C 4.18.7 Q-Q 4.19.1 B
4.19.2 D 4.19.3 D 4.19.4 D 4.19.5 C 4.19.6 Q-Q
4.19.7 Q-Q 4.20.1 Q-Q 4.21.1 B 4.22.1 C 4.23.1 Q-Q
4.24.1 B 4.25.1 D 4.25.2 A 4.26.1 C 4.26.2 D
4.27.1 Q-Q 4.28.1 C 4.28.2 Q-Q 4.28.3 C 4.29.1 X
4.30.1 A 4.30.2 B 4.30.3 D 4.30.4 B 4.30.5 A
4.31.1 A 4.32.1 Q-Q 4.32.2 B 4.32.3 A 4.33.1 D
4.34.1 D 4.35.1 B 4.36.1 Q-Q 4.37.1 A 4.38.1 C
4.38.2 Q-Q 4.38.3 A 4.38.4 D 4.38.5 C 4.38.6 C
4.38.7 A 4.38.8 B 4.38.9 A 4.38.10 Q-Q 4.39.1 A
4.39.2 D 4.40.1 D 4.41.1 Q-Q 4.41.2 C 4.42.1 B
4.43.1 B 4.44.1 D 4.44.2 D 4.44.3 C 4.45.1 A
4.45.2 C 4.45.3 B 4.45.4 D 4.45.5 A 4.45.6 B
4.45.7 B 4.46.1 C 4.46.2 C 4.47.1 C 4.48.1 Q-Q
4.49.1 Q-Q 4.49.2 Q-Q 4.50.1 B 4.50.2 D 4.51.1 A
4.52.1 A 4.52.2 C 4.52.3 C 4.52.4 A 4.52.5 A
4.53.1 Q-Q 4.53.2 Q-Q 4.53.3 Q-Q 4.53.4 C 4.53.5 Q-Q
4.53.6 C 4.53.7 D 4.53.8 B 4.53.9 D 4.53.10 C
4.54.1 Q-Q 4.54.2 Q-Q 4.54.3 B 4.54.4 C 4.54.5 D
4.54.6 X 4.54.7 D 4.54.8 Q-Q 4.54.9 A 4.54.10 B
4.54.11 C 4.54.12 C 4.54.13 B 4.54.14 A 4.54.15 A
4.54.16 Q-Q 4.55.1 Q-Q 4.55.2 Q-Q 4.55.3 A 4.55.4 Q-Q
4.55.5 B 4.56.1 A 4.56.2 A 4.56.3 Q-Q 4.56.4 Q-Q
4.57.1 Q-Q 4.57.2 A 4.57.3 B 4.57.4 C 4.57.5 Q-Q
4.57.6 Q-Q 4.57.7 B 4.57.8 A 4.57.9 Q-Q 4.57.10 Q-Q
4.57.11 Q-Q 4.58.1 C 4.58.2 A 4.58.3 A 4.58.4 C
4.58.5 D 4.59.1 Q-Q 4.59.2 D 4.59.3 Q-Q 4.59.4 C
4.60.1 D 4.61.1 D 4.62.1 X 4.63.1 B 4.64.1 B
4.65.1 C 4.66.1 A 4.66.2 Q-Q 4.67.1 Q-Q 4.67.2 A
4.67.3 B 4.67.4 D 4.68.1 X 4.68.2 C 4.68.3 Q-Q
4.69.1 A 4.70.1 B 4.71.1 C 4.71.2 B 4.72.1 C
4.72.2 A 4.73.1 C 4.74.1 Q-Q 4.75.1 D 4.76.1 B
4.76.2 A 4.76.3 C 4.76.4 Q-Q 4.77.1 Q-Q 4.78.1 B
4.79.1 D 4.79.2 A 4.79.3 D 4.79.4 B 4.80.1 B
4.81.1 X 4.82.1 X 4.83.1 D 4.84.1 A 4.85.1 Q-Q
4.85.2 Q-Q 4.85.3 Q-Q 4.85.4 Q-Q 4.85.5 Q-Q 4.85.6 A
4.85.7 C 4.85.8 Q-Q 4.85.9 Q-Q 4.86.1 Q-Q 4.86.2 Q-Q
4.87.1 A 4.88.1 Q-Q 4.89.1 B 4.90.1 C 4.90.2 Q-Q
4.90.3 Q-Q 4.90.4 Q-Q 4.91.1 Q-Q 4.92.1 D 4.93.1 A
5 Databases (176)

5.0.1 UGCNET-Dec2004-II: 18 https://gateoverflow.in/335379

The completeness constraint has rules :

A. Supertype, Subtype B. Total specialization, Partial specialization
C. Specialization, Generalization D. All of the above
ugcnetdec2004ii

5.0.2 UGCNET-Dec2015-II: 14 https://gateoverflow.in/61439

Match the following database terms to their functions :

List – I List – II
(a) Normalization(i) Enforces match of primary key
to foreign key
(b) Data Dictionary (ii) Reduces data redundancy in
a database
(c) Referential Integrity (iii) Defines view(s) of the database for
particular user(s)
(d) External Schema (iv) Contains metadata describing
database structure
Codes :
A. (a)-(iv), (b)-(iii), (c)-(i), (d)-(ii) B. (a)-(ii), (b)-(iv), (c)-(i), (d)-(iii)
C. (a)-(ii), (b)-(iv), (c)-(iii), (d)-(i) D. (a)-(iv), (b)-(iii), (c)-(ii), (d)-(i)
ugcnetdec2015ii databases

5.0.3 UGCNET-Dec2012-II: 32 https://gateoverflow.in/57069

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
ugcnetdec2012ii databases

5.0.4 UGCNET-AUG2016-III: 12 https://gateoverflow.in/70825

Which one of the following pairs is correctly matched in the context of database design ?
List-I(Database term) List-II(Definition)
I. Specialization A. Result of taking the union of two or more
disjoint (lower-level) entity sets to produce
a higher-level entity set.
II. Generalization B. Express the number of entities to which
another entity can be associated via a
relationship set.
III. Aggregation C. Result of taking a subset of a higher-level
entity set to form a lower-level entity set.
IV. Mapping cardinality D. An abstraction in which relationship sets
(along with their associated entity sets) are
treated as higher-level entity sets, and can
participate in relationships.
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
ugcnetaug2016iii

5.0.5 UGCNET-dec2009-ii-18 https://gateoverflow.in/152836

Match the following :

(1) Determinants (a) No attribute can be added
(2) Candidate key (b) Uniquely identified a row
(3) Non-redundancy (c) A constraint between two attribute
(4) Functional Dependency (d) Group of attributes on the left hand
side of arrow of function dependency.
A. 1-d, 2-b, 3-a, 4-c B. 2-d, 3-a, 1-b, 4-c
C. 4-a, 3-b, 2-c, 1-d D. 3-a, 4-b, 1-c, 2-d
ugcnetdec2009ii databases

5.0.6 UGCNET-June2016-III: 10 https://gateoverflow.in/63615

Which of the following statements is true?

D1 : The decomposition of the schema R(A, B, C) into R 1 (A,B) and R 2 (A,C) is always lossless
D2 : The decomposition of the schema R(A, B, C, D, E) having AD → B, C → DE, B → AE, and AE → C, into R 1 (A,B, D)
and R2 (A, C, C, D, E) is lossless

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

ugcnetjune2016iii databases

5.0.7 UGCNET-Dec2007-II: 16 https://gateoverflow.in/335768

A primary key for an entity is :

A. a candidate key B. any attribute
C. a unique attribute D. a superkey
ugcnetdec2007ii

5.0.8 UGCNET-Dec2004-II: 17 https://gateoverflow.in/335380

Specialization is a __________ process.

A. Top - down B. Bottom - up C. Both (A) and (B) D. None of the above
ugcnetdec2004ii

5.0.9 UGCNET-June2014-II: 46 https://gateoverflow.in/55196

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
ugcnetjune2014ii databases

5.0.10 UGCNET-June2014-II: 50 https://gateoverflow.in/55204

Match the following :

List – I List – II
a. DDL i. LOCK TABLE
b. DML ii. COMMIT
c. TCL iii. Natural Differece
d. BINARY iv. REVOKE
Operation
Codes :
A. a-ii; b-i; c-iii; d-iv B. a-i; b-ii; c-iv; d-iii
 C. a-ii; b-iii; c-i; d-iv D. a-iv; b-i; c-ii; d-iii
ugcnetjune2014ii databases

5.0.11 UGCNET-June2012-II: 7 https://gateoverflow.in/55611

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

ugcnetjune2012ii databases

5.0.12 UGCNET-Dec2004-II: 16 https://gateoverflow.in/335381

The E-R 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
ugcnetdec2004ii

5.0.13 UGCNET-june2009-ii-18 https://gateoverflow.in/154277

(i) DML includes a query language based on both relation algebra and tuple calculus
(ii) DML includes a query language based on tuple calculus
(iii) DML includes a query language based on relational algebra
(iv) DML 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

ugcnetjune2009ii

5.0.14 UGCNET-Dec2006-II: 20 https://gateoverflow.in/335651

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

ugcnetdec2006ii

5.0.15 UGCNET-Dec2015-II: 18 https://gateoverflow.in/62251

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

ugcnetdec2015ii databases
5.0.16 UGCNET-July-2018-II: 68 https://gateoverflow.in/225818

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

ugcnetjuly2018ii databases

5.0.17 UGCNET-June2013-III: 47 https://gateoverflow.in/58522

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
ugcnetjune2013iii databases

5.0.18 UGCNET-Dec2013-II: 12 https://gateoverflow.in/60043

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
ugcnetdec2013ii databases

5.0.19 UGCNET-june2009-ii-21 https://gateoverflow.in/154362

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

ugcnetjune2009ii

5.0.20 UGCNET-june2009-ii-22 https://gateoverflow.in/154363

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

ugcnetjune2009ii

5.0.21 UGCNET-Dec2004-II: 19 https://gateoverflow.in/335378

The entity type on which the __________ type depends is called the identifying owner.

A. Strong entity B. Relationship C. Weak entity D. E - R

ugcnetdec2004ii
5.0.22 UGCNET-Dec2004-II: 20 https://gateoverflow.in/335377

Match the following :

(i) 2NF (a) Transitive dependencies eliminated
(ii) 3NF (b) Multivalued attribute removed
(iii) 3NF (c) Contains no partial functional dependencies
(iv) 5NF (d) Contains no join dependency
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
ugcnetdec2004ii

5.0.23 UGCNET-Dec2007-II: 17 https://gateoverflow.in/335767

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
ugcnetdec2007ii

5.0.24 UGCNET-June2012-III: 9 https://gateoverflow.in/56090

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
ugcnetjune2012iii databases

5.0.25 UGCNET-Dec2015-II: 19 https://gateoverflow.in/62252

A data which improves the performance and accessibility of the database are called:
A. Indexes B. User Data
C. Application Metadata D. Data Dictionary
ugcnetdec2015ii databases

5.0.26 UGCNET-Dec2007-II: 19 https://gateoverflow.in/335765

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 (;)
ugcnetdec2007ii

5.0.27 UGCNET-Dec2007-II: 20 https://gateoverflow.in/335764

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 100 marks in mathematics

B. the names of all students of all classes in which at least one student has 100 marks in mathematics
C. the names of all students in all classes having 100 marks in mathematics
D. the names and class of all students whose marks in mathematics is 100

ugcnetdec2007ii

5.0.28 UGCNET-Dec2006-II: 17 https://gateoverflow.in/335654

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

ugcnetdec2006ii

5.0.29 UGCNET-Dec2013-III: 60 https://gateoverflow.in/60782

Match the following :

List – I List – II
a. Secondary Index i. Functional Dependency
b. Non-procedural Query language ii. B-tree
c. Closure of set of attributes iii. Relational Algebric Operation
d. Natural JOIN iv. Domain Calculas
Codes :
A. a-i, b-ii, c-iv, d-iii B. a-ii, b-i, c-iv, d-iii
C. a-i, b-iii, c-iv, d-ii D. a-ii, b-iv, c-i, d-iii
ugcnetdec2013iii databases

5.0.30 UGCNET-June2016-II: 17 https://gateoverflow.in/63122

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
ugcnetjune2016ii databases

5.0.31 UGCNET-AUG2016-III: 11 https://gateoverflow.in/222981

Consider the following ORACLE relations:

One (x, y) = {<2, 5>, <1, 6>, <1, 6>, <1, 6>, <4, 8>, <4, 8>}
Two (x, y) = {<2, 55>, <1, 1>, <4, 4>, <1, 6>, <4, 8>, <4, 8>, <9, 9>, <1, 6>}
Consider the following two SQL queries SQ1 and SQ2:

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

5.1 Aggregation (2)

 5.1.1 Aggregation: UGCNET-June2016-III: 39 https://gateoverflow.in/63965

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

ugcnetjune2016iii databases aggregation

5.1.2 Aggregation: UGCNET-dec2008-ii-31 https://gateoverflow.in/155355

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

ugcnetdec2008ii databases aggregation

5.2 B Tree (3)

5.2.1 B Tree: GATE CSE 2000 | Question: 1.22, UGCNET-June2012-II: 11 https://gateoverflow.in/646

B+-trees are preferred to binary trees in databases because

A. Disk capacities are greater than memory capacities

B. Disk access is much slower than memory access
C. Disk data transfer rates are much less than memory data transfer rates
D. Disks are more reliable than memory

gatecse-2000 databases b-tree normal ugcnetjune2012ii

5.2.2 B Tree: GATE CSE 2002 | Question: 2.23, UGCNET-June2012-II: 26 https://gateoverflow.in/853

A B+ - tree index is to be built on the Name attribute of the relation STUDENT. Assume that all the student names are
of length 8 bytes, disk blocks are of size 512 bytes, and index pointers are of size 4 bytes. Given the scenario, what
would be the best choice of the degree (i.e. number of pointers per node) of the B+ - tree?

A. 16 B. 42 C. 43 D. 44
gatecse-2002 databases b-tree normal ugcnetjune2012ii

5.2.3 B Tree: UGCNET-June2014-II: 22 https://gateoverflow.in/54041

The upper bound and lower bound for the number of leaves in a B-tree of degree K with height h is given by :

A. K h and 2⌈ k2 ⌉h−1 B. K ∗ h and 2⌊ k2 ⌋h−1

C. K h and 2⌊ k2 ⌋h−1 D. K ∗ h and 2⌈ k2 ⌉h−1
ugcnetjune2014ii databases b-tree

5.3 B+tree (1)

5.3.1 B+tree: UGCNET-Jan2017-II: 20 https://gateoverflow.in/335143

The order of a leaf node in a B+ tree is the maximum number of children it can have. Suppose that block size is 1
kilobytes, the child pointer takes 7 bytes long and search field value takes 14 bytes long. The order of the leaf node is
_________.

A. 16 B. 63 C. 64 D. 65
ugcnetjan2017ii databases b+tree

5.4 Candidate Keys (4)

 5.4.1 Candidate Keys: UGCNET-Jan2017-III: 8 https://gateoverflow.in/335230

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

ugcnetjan2017iii database-normalization candidate-keys

5.4.2 Candidate Keys: UGCNET-June-2019-II: 35 https://gateoverflow.in/316244

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

ugcnetjune2019ii candidate-keys

5.4.3 Candidate Keys: UGCNET-June-2019-II: 36 https://gateoverflow.in/316243

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

ugcnetjune2019ii candidate-keys

5.4.4 Candidate Keys: UGCNET-June2016-II: 20 https://gateoverflow.in/63426

Consider the following database table having A, B, C and D as its four attributes and four possible candidate keys
(I, II, III and IV) for this table :
A B C D
a1 b1 c1 d1
a2 b3 c3 d1
a1 b2 c1 d2
I : {B} II : {B, C} III : {A, D} IV : {C, D}
If different symbols stand for different values in the table (e.g., d1 is definitely not equal to d2 ), then which of the above could
not be the candidate key for the database table?

A. I and III only B. III and IV only C. II only D. I only

ugcnetjune2016ii databases candidate-keys

5.5 Cardinality Ratio (1)

5.5.1 Cardinality Ratio: UGCNET-Dec2013-II: 14 https://gateoverflow.in/60046

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

ugcnetdec2013ii databases cardinality-ratio

5.6 Circular Queue (1)

5.6.1 Circular Queue: UGCNET-dec2008-ii-34 https://gateoverflow.in/155358

If (rear == maxsize − 1) rear = 0; else rear = rear + 1; is required in :

A. circular queue
B. linear queue
C. stack
 D. deque

ugcnetdec2008ii data-structures circular-queue

5.7 Concurrency Control Protocols (1)

5.7.1 Concurrency Control Protocols: UGCNET-dec2009-ii-20 https://gateoverflow.in/152840

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

ugcnetdec2009ii concurrency-control-protocols

5.8 Crosstabquery (1)

5.8.1 Crosstabquery: UGCNET-Sep2013-II: 41 https://gateoverflow.in/59252

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

5.9 Data Dependences (2)

5.9.1 Data Dependences: UGCNET-Dec2006-II: 18 https://gateoverflow.in/335653

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

ugcnetdec2006ii databases data-dependences

5.9.2 Data Dependences: UGCNET-Oct2020-II: 14 https://gateoverflow.in/349659

Consider a relational schema S = (U, V , W, X, Y , Z) on which the following functional dependencies hold:
(U → V , V W → X, Y → W, X → U)
Which are the candidate keys among following options?

A. UY , V Y B. UY , V Y , XY C. UY Z, V Y Z, V W Z D. UY Z, V Y Z, XY Z
ugcnet-oct2020-ii databases data-dependences

5.10 Data Integrity (1)

5.10.1 Data Integrity: UGCNET-Dec2013-II: 15 https://gateoverflow.in/60048

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

ugcnetdec2013ii databases data-integrity

5.11 Data Mining (2)

5.11.1 Data Mining: UGCNET-Jan2017-II: 47 https://gateoverflow.in/335116

__________ 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

5.11.2 Data Mining: UGCNET-dec2009-ii-47 https://gateoverflow.in/152942

Analysis of large database to retrieve information is called

(A) OLTP

(B) OLAP

(C) OLDP

(D) OLPP
ugcnetdec2009ii databases data-mining

5.12 Data Model (2)

5.12.1 Data Model: UGCNET-June2012-III: 8, UGCNET-Dec2012-III: 59 https://gateoverflow.in/56089

Which level of abstraction describes what data are stored in the database?
A. Physical level B. View level
C. Abstraction level D. Logical level
ugcnetjune2012iii databases data-model ugcnetdec2012iii

5.12.2 Data Model: UGCNET-Sep2013-II: 39 https://gateoverflow.in/59250

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

5.13 Database Constraints (1)

5.13.1 Database Constraints: UGCNET-Dec2013-II: 11 https://gateoverflow.in/12060

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 ugcnetdec2013ii

5.14 Database Design (1)

5.14.1 Database Design: UGCNET-Jan2017-II: 16 https://gateoverflow.in/335147

An attribute A of datatype varchar (20) has value 'Ram' and the attribute B of datatype char (20) has value 'Sita' in
oracle. The attribute A has ________ memory spaces and B has _______ memory spaces.

A. 20, 20 B. 3, 20 C. 3, 4 D. 20, 4
ugcnetjan2017ii databases database-design
5.15 Database Normalization (23)

5.15.1 Database Normalization: GATE CSE 1999 | Question: 2.7, UGCNET-June2014-III: 25

https://gateoverflow.in/1485
Consider the schema R = (S, T, U, V ) and the dependencies S → T, T → U, U → V and
V → S . Let R = (R1 and R2) be a decomposition such that R1 ∩ R2 ≠ ϕ . The decomposition is
A. not in 2NF B. in 2NF but not 3NF
C. in 3NF but not in 2NF D. in both 2NF and 3NF
gate1999 databases database-normalization normal ugcnetjune2014iii

5.15.2 Database Normalization: GATE CSE 2005 | Question: 29, UGCNET-June2015-III: 9 https://gateoverflow.in/1365

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

A. BCNF is stricter than 3NF

B. Lossless, dependency-preserving decomposition into 3NF is always possible
C. Lossless, dependency-preserving decomposition into BCNF is always possible
D. Any relation with two attributes is in BCNF

gatecse-2005 databases database-normalization easy ugcnetjune2015iii

5.15.3 Database Normalization: GATE CSE 2007 | Question: 62, UGCNET-June2014-II: 47 https://gateoverflow.in/1260

Which one of the following statements is FALSE?

A. Any relation with two attributes is in BCNF

B. A relation in which every key has only one attribute is in 2NF
C. A prime attribute can be transitively dependent on a key in a 3 NF relation
D. A prime attribute can be transitively dependent on a key in a BCNF relation

gatecse-2007 databases database-normalization normal ugcnetjune2014ii

5.15.4 Database Normalization: GATE2001-1.23, UGCNET-June2012-III: 18 https://gateoverflow.in/716

Consider a schema R(A, B, C, D) and functional dependencies A → B and C → D. Then the decomposition of R
into R1 (A, B) and R2 (C, D) is

A. dependency preserving and lossless join

B. lossless join but not dependency preserving
C. dependency preserving but not lossless join
D. not dependency preserving and not lossless join

gate1998 databases ugcnetjune2012iii database-normalization

5.15.5 Database Normalization: UGCNET-Dec2010-II: 17 https://gateoverflow.in/66814

The dependency preservation decomposition is a property to decompose database schema D, in which each functional
dependency X → Y specified in F ,

A. Appeared directly in one of the relation schemas Ri in the decomposed D.

B. Could be inferred from dependencies that appear in some Ri.
C. Both (A) and (B)
D. None of these

ugcnetdec2010ii databases database-normalization

5.15.6 Database Normalization: UGCNET-Dec2012-II: 13 https://gateoverflow.in/50863

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 ugcnetdec2012ii database-normalization

5.15.7 Database Normalization: UGCNET-Dec2012-III: 63 https://gateoverflow.in/57736

The third normal form is based on the concept of_____

A. Closure Dependency B. Transitive Dependency
C. Normal Dependency D. Functional Dependency
ugcnetdec2012iii databases database-normalization

5.15.8 Database Normalization: UGCNET-Dec2013-III: 59 https://gateoverflow.in/60752

Armstrong (1974) proposed systematic approach to derive functional dependencies. Match the following w.r.t
functional dependencies:
List-I List -II
a. Decomposition Rule i. If X → Y and Z → W then {X, Z} → {Y , W}
b. Union rule ii. If X → Y and {Y , W} → Z then {X, W} → Z
c. Composition rule iii. If X → Y and X → Z then X → {Y , Z}
d. Psedudo transitivity rule iv. If X → {Y , Z} then X → Y and X → Z
Codes:
A. a-iii, b-ii, c-iv, d-i B. a-i, b-iii, c-iv, d-ii
C. a-ii, b-i, c-iii, d-iv D. a-iv, b-iii, c-i, d-ii
ugcnetdec2013iii databases database-normalization

5.15.9 Database Normalization: UGCNET-Dec2014-II: 19 https://gateoverflow.in/59142

The best normal form of relation scheme R(A, B, C, D) along with the set of functional dependencies
F = {AB → C, AB → D, C → A, D → B} is
A. Boyce-Codd Normal form B. Third Normal form
C. Second Normal form D. First Normal form
ugcnetdec2014ii databases database-normalization

5.15.10 Database Normalization: UGCNET-Dec2014-II: 20 https://gateoverflow.in/59143

Identify the minimal key for relational scheme R(A, B, C, D, E) with functional dependencies
F = {A → B, B → C, AC → D}

A. A B. AE C. BE D. CE
ugcnetdec2014ii databases database-normalization

5.15.11 Database Normalization: UGCNET-Dec2014-III: 10 https://gateoverflow.in/60109

Let R = ABCDE is a relational scheme with functional dependency set F = {A → B, B → C, AC → D} . The

attribute closures of A and E are
A. ABCD, ϕ B. ABCD, E
C. Φ, ϕ D. ABC, E
ugcnetdec2014iii databases database-normalization

5.15.12 Database Normalization: UGCNET-Dec2014-III: 12 https://gateoverflow.in/60112

Which of the following is false ?

A. Every binary relation is never be in BCNF .

B. Every BCNF relation is in 3NF .
C. 1NF, 2NF, 3NF and BCNF are based on functional dependencies.
D. Multivalued Dependency (MV D) is a special case of Join Dependency (JD)

ugcnetdec2014iii databases database-normalization

5.15.13 Database Normalization: UGCNET-Dec2015-II: 20 https://gateoverflow.in/46878

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
ugcnetdec2015ii databases database-normalization

5.15.14 Database Normalization: UGCNET-Jan2017-III: 10 https://gateoverflow.in/335228

For database relation R(A, B, C, D) where the domains of A, B, C and D include only atomic values, only the
following functional dependencies and those that can be inferred from them are:
A→C
B→D
The relation R 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.

ugcnetjan2017iii databases database-normalization

5.15.15 Database Normalization: UGCNET-June-2019-II: 34 https://gateoverflow.in/316245

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
ugcnetjune2019ii database-normalization

5.15.16 Database Normalization: UGCNET-June2010-II: 18 https://gateoverflow.in/67844

Match the following :

a. 2 NF i. Transitive dependencies eliminated
b. 3 NF ii. Multivalued attribute removed
c. 4 NF iii. Contain no partial Functional dependencies
d. 5 NF iv. Contains no join dependencies
Codes :
A. a-i, b-iii, c-ii, d-iv B. a-ii, b-iii, c-iv, d-i
C. a-iii, b-iv, c-i, d-ii D. a-iii, b-ii, c-iv, d-i
ugcnetjune2010ii databases database-normalization

5.15.17 Database Normalization: UGCNET-June2013-III: 9 https://gateoverflow.in/58264

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

ugcnetjune2013iii databases database-normalization

5.15.18 Database Normalization: UGCNET-June2014-II: 49 https://gateoverflow.in/55201

Let R = {A, B, C, D, E, F} be a relation schema with the following dependencies C → F , E → A , EC → D ,

A → B . Which of the following is a key for R ?

A. CD B. EC C. AE D. AC
ugcnetjune2014ii databases database-normalization
 5.15.19 Database Normalization: UGCNET-June2014-III: 22 https://gateoverflow.in/56753

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 3NF.
C. Book is in 2NF and Collection in 3NF. D. Both Book and Collection are in 2NF.
ugcnetjune2014iii databases database-normalization

5.15.20 Database Normalization: UGCNET-June2015-III: 10 https://gateoverflow.in/61151

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

ugcnetjune2015iii databases database-normalization

5.15.21 Database Normalization: UGCNET-Nov2017-iii-9 https://gateoverflow.in/166385

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
ugcnetnov2017-iii database-normalization

5.15.22 Database Normalization: UGCNET-dec2008-ii-32 https://gateoverflow.in/155356

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+

ugcnetdec2008ii databases database-normalization

5.15.23 Database Normalization: UGCNET-dec2009-ii-19 https://gateoverflow.in/152837

A function that has no partial functional dependencies is in __________ form.

(A) 3 NF

(B) 2 NF

(C) 4 NF

(D) BCNF
ugcnetdec2009ii databases database-normalization

5.16 Decomposition (3)

5.16.1 Decomposition: UGCNET-AUG2016-III: 10 https://gateoverflow.in/70771

Consider the table R with attributes A, B and C . The functional dependencies that hold on R are : A → B, C → AB .
Which of the following statements is/are True ?
 I. The decomposition of R into R1(C, A) and R2(A, B) is lossless.
II. The decomposition of R into R1(A, B) and R2(B, C) is lossy.

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

ugcnetaug2016iii databases database-normalization decomposition

5.16.2 Decomposition: UGCNET-Dec2012-III: 56 https://gateoverflow.in/57731

If a relation with a Schema R is decomposed into two relations R1 and R2 such that (R1 ∪ R2 ) = R1 then which one
of the following is to be satisfied for a lossless joint decomposition (→ indicates functional independency)

A. (R1 ∩ R2 ) → R1 or R1 ∩ R2 → R2
B. R1 ∩ R2 → R1
C. R1 ∩ R2 → R2
D. (R1 ∩ R2 ) → R1 and R1 ∩ R2 → R2

ugcnetdec2012iii databases decomposition

5.16.3 Decomposition: UGCNET-June2015-III: 11 https://gateoverflow.in/61154

The relation schemas R1 and R2 form a Lossless join decomposition of R if and only if

a. R1 ∩ R2 ↠ (R1 − R2 )b. R1 → R2 c. R1 ∩ R2 ↠ (R2 − R1 )d. R2 → R1 ∩ R2

A. aB.
andaC.
band
happen
aD.
dand
happen
b cand
happen
c happen
ugcnetjune2015iii databases decomposition database-normalization

5.17 Dependency Preserving (1)

5.17.1 Dependency Preserving: UGCNET-Jan2017-II: 19 https://gateoverflow.in/335144

Consider a schema R(MNP Q) and functional dependencies M → N, P → Q . Then the decomposition of R into
R1 (MN) and R2 (P Q) 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

5.18 Distributed Databases (2)

5.18.1 Distributed Databases: UGCNET-AUG2016-III: 8 https://gateoverflow.in/70761

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
ugcnetaug2016iii databases distributed-databases

5.18.2 Distributed Databases: UGCNET-June2016-III: 8 https://gateoverflow.in/57132

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

ugcnetjune2016iii databases distributed-databases

5.19 Enhanced Er Model (1)

 5.19.1 Enhanced Er Model: UGCNET-June2014-III: 23 https://gateoverflow.in/56756

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

5.20 Er Diagram (15)

5.20.1 Er Diagram: UGCNET-Dec2010-II: 16 https://gateoverflow.in/66812

In generalisation, the differences between members of an entity is

A. Maximized B. Minimized C. Both (A) & (B) D. None of these

ugcnetdec2010ii databases er-diagram

5.20.2 Er Diagram: UGCNET-Dec2013-II: 13 https://gateoverflow.in/60045

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
ugcnetdec2013ii databases er-diagram

5.20.3 Er Diagram: UGCNET-Dec2013-III: 55 https://gateoverflow.in/60743

Consider the following ER diagram:

The minimum number of tables required to represent M, N, P, R 1 , R 2 is

A. 2 B. 3 C. 4 D. 5
ugcnetdec2013iii databases er-diagram

5.20.4 Er Diagram: UGCNET-Dec2013-III: 57 https://gateoverflow.in/45449

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.

ugcnetdec2013iii databases er-diagram

5.20.5 Er Diagram: UGCNET-Dec2014-II: 18 https://gateoverflow.in/59141

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
ugcnetdec2014ii databases er-diagram
5.20.6 Er Diagram: UGCNET-Dec2014-III: 38 https://gateoverflow.in/60653

How to express that some person keeps animals as pets?

A. B. C. D.
ugcnetdec2014iii databases er-diagram

5.20.7 Er Diagram: UGCNET-Dec2019-II: 23 https://gateoverflow.in/360810

Find minimum number of tables required for converting the following entity relationship diagram into relational
database?

A. 2 B. 4 C. 3 D. 5
ugcnetdec2019ii er-diagram

5.20.8 Er Diagram: UGCNET-Jan2017-II: 18 https://gateoverflow.in/335145

Let M and N be two entities in an E − R diagram with simple single value attributes. R1 and R2 are two relationship
between M and N , where as R1 , is one-to-many and R2 , is many-to-many.
The minimum number of tables required to represent M, N, R1 , and R2 , in the relational model are ___________.

A. 4 B. 6 C. 7 D. 3
ugcnetjan2017ii databases er-diagram

5.20.9 Er Diagram: UGCNET-July-2018-II: 64 https://gateoverflow.in/1595

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 ugcnetjuly2018ii

5.20.10 Er Diagram: UGCNET-June2010-II: 16 https://gateoverflow.in/67841

An entity instance is a single occurrence of an ______.

A. Entity type B. Relationship type
C. Entity and relationship type D. None of these
ugcnetjune2010ii databases er-diagram

5.20.11 Er Diagram: UGCNET-June2015-II: 49 https://gateoverflow.in/61091

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

ugcnetjune2015ii er-diagram databases

5.20.12 Er Diagram: UGCNET-June2015-III: 7 https://gateoverflow.in/12789

Let E1 and E2 be two entities in E-R diagram with simple single valued attributes. R1 and R2 are two relationships
between E1 and E2 where R1 is one-many and R2 is many-many. R1 and R2 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 ugcnetjune2015iii

5.20.13 Er Diagram: UGCNET-dec2008-ii-30 https://gateoverflow.in/155354

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

ugcnetdec2008ii databases er-diagram

5.20.14 Er Diagram: UGCNET-dec2009-ii-16 https://gateoverflow.in/152832

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

ugcnetdec2009ii databases er-diagram

5.20.15 Er Diagram: UGCNET-dec2009-ii-17 https://gateoverflow.in/152834

Specialization is __________ process.

(A) top-down

(B) bottom up

(C) both (A) and (B)

(D) none of these

ugcnetdec2009ii databases er-diagram

5.21 File System (1)

5.21.1 File System: UGCNET-June2015-II: 19 https://gateoverflow.in/60966

Database application were directly built on top of file system to overcome the following drawbacks of using file-
systems:

a. Data redundancy and inconsistency

b. Difficulty in accessing data
c. Data isolation d. Integrity problems

A. a B. a and d C. a, b, and c D. a, b, c, and d

ugcnetjune2015ii databases file-system
5.22 Generalization (1)

5.22.1 Generalization: UGCNET-June2010-II: 17 https://gateoverflow.in/67842

Generalization is _______ process.

A. Top-down B. Bottom up C. Both (A) & (B) D. None of these

ugcnetjune2010ii databases generalization

5.23 Granularity (1)

5.23.1 Granularity: UGCNET-June2012-III: 4 https://gateoverflow.in/56077

What is Granularity?
A. The size of database B. The size of data item
C. The size of record D. The size of file
ugcnetjune2012iii databases granularity

5.24 Hierarchical Database (1)

5.24.1 Hierarchical Database: UGCNET-July-2018-II: 63 https://gateoverflow.in/225823

In a Hierarchical database, a hashing function is used to locate the ____

A. Collision B. Root C. Foreign Key D. Records

ugcnetjuly2018ii databases hierarchical-database

5.25 Indexing (2)

5.25.1 Indexing: UGCNET-DEC2016-III: 12 https://gateoverflow.in/113777

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.
ugcnetdec2016iii b-tree indexing

5.25.2 Indexing: UGCNET-June2014-II: 48 https://gateoverflow.in/55199

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
ugcnetjune2014ii databases indexing

5.26 Java (1)

5.26.1 Java: UGCNET-Dec2012-II: 22 https://gateoverflow.in/56839

In DML, RECONNCT command cannot be used with

A. OPTIONAL Set B. FIXED Set C. MANDATOR Set D. All of the above

ugcnetdec2012ii programming java bad-question

5.27 Joins (1)

5.27.1 Joins: UGCNET-Dec2015-III: 63 https://gateoverflow.in/62734

Consider the following three tables R, S and T. In this question, all the join operations are natural joins (⋈). (π) is the
projection operation of a relation:
 R S T
A B B C A C
1 2 6 2 7 1
3 2 2 4 1 2
5 6 8 1 9 3
7 8 8 3 5 4
9 8 2 5 3 5
Possible answer tables for this question are also given as below:
A B C
1 2 4
1 2 5 A B C A B C
3 2 4 1 2 2 1 6 2 A B C
3 2 5 3 2 5 3 2 5 3 2 5
5 6 2 5 6 4 5 2 4 7 8 1
7 8 1 7 8 1 7 8 1 9 8 3
7 8 3 9 8 3 9 8 3 (d)

9 8 1 (b) (c)

9 8 3
(a)

A. (a) B. (b) C. (c) D. (d)

ugcnetdec2015iii databases joins

5.28 Object Oriented Database (2)

5.28.1 Object Oriented Database: UGCNET-Dec2015-III: 58 https://gateoverflow.in/62725

Which of the following statements regarding the features of the object-oriented approach to databases are true?

a. The ability to develop more

b. The
realistic
abilitymodels
to represent
of thec.
the
real
The
world
world
ability
in a to
non-geometric
develop databases
d. way
The need
using
to natural
split objects
language
e.into
Theapproaches
their
ability
component
to develop
parts
database models

A. a,B.b and
b,C.c cand
a,D.d,dc,
andd, eand e
ugcnetdec2015iii databases object-oriented-database

5.28.2 Object Oriented Database: UGCNET-June2016-III: 7 https://gateoverflow.in/57130

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

ugcnetjune2016iii databases object-oriented-database

5.29 Protocol (1)

 5.29.1 Protocol: UGCNET-June2014-III: 27, UGCNET-June2015-II: 17 https://gateoverflow.in/56776

Which of the following concurrency protocol ensues both conflict serializability and freedom from deadlock:

I. 2-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 ugcnetjune2015ii

5.30 Rdbms (9)

5.30.1 Rdbms: UGCNET-July-2018-II: 61 https://gateoverflow.in/225825

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
ugcnetjuly2018ii databases rdbms joins

5.30.2 Rdbms: UGCNET-July-2018-II: 62 https://gateoverflow.in/225824

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

ugcnetjuly2018ii databases rdbms sql

5.30.3 Rdbms: UGCNET-July-2018-II: 66 https://gateoverflow.in/225820

For a database relation R(a, b, c, d) 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:
a→c
b→d
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
ugcnetjuly2018ii databases rdbms

5.30.4 Rdbms: UGCNET-July-2018-II: 67 https://gateoverflow.in/225819

A many-to-one relationship exists between entity sets r1 and r2 . How will it be represented using functional
dependencies if P k(r) denotes the primary key attribute of relation r?

A. Pk(r1 ) → Pk(r2 ) B. Pk(r2 ) → Pk(r1 )

C. Pk(r2 ) → Pk(r1 ) and Pk(r1 ) → Pk(r2 ) D. Pk(r2 ) → Pk(r1 ) or Pk(r1 ) → Pk(r2 )
ugcnetjuly2018ii databases rdbms

5.30.5 Rdbms: UGCNET-June2013-III: 34 https://gateoverflow.in/58493

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

ugcnetjune2013iii databases rdbms

5.30.6 Rdbms: UGCNET-June2013-III: 7 https://gateoverflow.in/58260

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

ugcnetjune2013iii databases rdbms

5.30.7 Rdbms: UGCNET-June2016-II: 16 https://gateoverflow.in/63120

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
ugcnetjune2016ii databases rdbms sql

5.30.8 Rdbms: UGCNET-June2016-II: 18 https://gateoverflow.in/63125

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

ugcnetjune2016ii rdbms sql databases

5.30.9 Rdbms: UGCNET-Nov2017-iii-10 https://gateoverflow.in/166386

Consider a relation R(A, B, C, D, E, F, G, H) where each attribute is atomic, and following functional dependencies
exist.

CH → G
A → BC
B → CFH
E→A
F → EG
The relation R is ________
A. In 1NF but not in 2NF B. In 2NF but not in 3NF
C. In 3NF but not in BCNF D. In BCNF
ugcnetnov2017-iii databases rdbms database-normalization

5.31 Recovery From Failure (1)

5.31.1 Recovery From Failure: UGCNET-Dec2014-III: 09 https://gateoverflow.in/60010

_________ 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
ugcnetdec2014iii databases transaction-and-concurrency recovery-from-failure

5.32 Referential Integrity (2)

 5.32.1 Referential Integrity: UGCNET-June-2019-II: 39 https://gateoverflow.in/316240

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:

Employee_id Manager_id
20 40
25 40
30 35
35 20
40 45
45 25

On deleting the table (20, 40), the set of other tuples that must be deleted to maintain the referential integrity of table is

A. (30, 35) only B. (30, 35) and (35, 20) only

C. (35, 20) only D. (40, 45) and (25, 40) only
ugcnetjune2019ii referential-integrity

5.32.2 Referential Integrity: UGCNET-Sep2013-III: 24 https://gateoverflow.in/59696

____ 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
ugcnetsep2013iii databases referential-integrity

5.33 Relation (2)

5.33.1 Relation: UGCNET-July-2018-II: 69 https://gateoverflow.in/225817

Let R1 (a, b, c) and R2 (x, y, z) be two relations in which a is the foreign key of R1 that refers to the primary key of
R2 . Consider the following four options.
a. Insert into R1 b. Insert into R2
c. Delete from R1 d. Delete from R2
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
ugcnetjuly2018ii databases relation

5.33.2 Relation: UGCNET-Sep2013-III: 48 https://gateoverflow.in/59868

Match the following :

(a) Create (i) The ER model
(b) Select (ii) Relationship model
(c) Rectangle (iii) DDL
(d) Record (iv) DML
Codes :
A. (a)-(iii), (b)-(iv), (c)-(i), (d)-(ii) B. (a)-(iv), (b)-(iii), (c)-(ii), (d)-(i)
C. (a)-(iv), (b)-(iii), (c)-(i), (d)-(ii) D. (a)-(iii), (b)-(iv), (c)-(ii), (d)-(i)
ugcnetsep2013iii databases er-diagram relation

5.34 Relational Algebra (3)

5.34.1 Relational Algebra: UGCNET-Dec2013-III: 56 https://gateoverflow.in/60745

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. πcustomer−name(σbalance>10000(Deposit))
B. σcustomer−name(σbalance>10000(Deposit))
C. πcustomer−name(σbalance>10000(Borrow) )
D. σcustomer−name(πbalance>10000(Borrow) )

ugcnetdec2013iii databases relational-algebra

5.34.2 Relational Algebra: UGCNET-Jan2017-III: 9 https://gateoverflow.in/335229

Let pk(R) denotes primary key of relation R. A many-to-one relationship that exists between two relation R1 and R2
can be expressed as follows:
A. pk(R2 ) → pk(R1 ) B. pk(R1 ) → pk(R2 )
C. pk(R2 ) → R1 ∩ R2 D. pk(R1 ) → R1 ∩ R2
ugcnetjan2017iii databases relational-algebra

5.34.3 Relational Algebra: UGCNET-June-2019-II: 33 https://gateoverflow.in/316246

With respect to relational algebra, which of the following operations are included from mathematical set theory?

a. Join b. Intersection c. Cartisian product d. Project

A. aB.
andbC.
dandcD.
candb dand d
ugcnetjune2019ii relational-algebra

5.35 Relational Calculus (2)

5.35.1 Relational Calculus: UGCNET-June-2019-II: 31 https://gateoverflow.in/316248

Which of the following has same expressive power with regard to relational query language?

a. Rational algebra and domain

b. Relational
relationalalgebra
calculus
and tuples
c. Relational
relational
algebra
calculus
and domain
d. Relational
relational
algebra
calculus
and tuples
restricted
relational
to safecalculus
expression
restricted to safe e

A. a and b only B. c and d only C. a and c only D. b and d only

ugcnetjune2019ii relational-calculus

5.35.2 Relational Calculus: UGCNET-Sep2013-III: 47 https://gateoverflow.in/59866

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}

ugcnetsep2013iii databases relational-calculus

5.36 Relational Model (2)

5.36.1 Relational Model: UGCNET-June-2019-II: 32 https://gateoverflow.in/316247

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
ugcnetjune2019ii relational-model

5.36.2 Relational Model: UGCNET-Oct2020-II: 67 https://gateoverflow.in/349606

Match List I with List II

Choose the correct answer from the options given below:

A. A − II, B − IV , C − III, D − I B. A − IV , B − I, C − II, D − III
C. A − II, B − I, C − IV , D − III D. A − III, B − IV , C − I, D − II
ugcnet-oct2020-ii databases relational-model

5.37 Relational Schema (1)

5.37.1 Relational Schema: UGCNET-Nov2017-iii-12 https://gateoverflow.in/166388

Consider a schema R(A, B, C, D) and following functional dependencies.

A→B
B→C
C→D
D→B
Then decomposition of R into R1(A, B), R2(B, C) and R3(B, D) 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
ugcnetnov2017-iii databases relational-schema rdbms

5.38 Relations (1)

5.38.1 Relations: UGCNET-Sep2013-III: 49 https://gateoverflow.in/59870

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
ugcnetsep2013iii databases relations

5.39 Sql (31)

5.39.1 Sql: UGCNET-AUG2016-II: 20 https://gateoverflow.in/69558

Consider a database table R with attributes A and B. Which of the following SQL 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;
ugcnetaug2016ii databases sql

5.39.2 Sql: UGCNET-AUG2016-III: 11 https://gateoverflow.in/70775

Consider the following ORACLE relations : One (x, y) = , , , , , Two (x, y) = , , , , , , , Consider the following two
SQL queries SQ1 and SQ2 :
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
ugcnetaug2016iii databases sql

5.39.3 Sql: UGCNET-Dec2012-II: 50 https://gateoverflow.in/57213

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 p1 .posting-No, p2 .posting-No from position p 1 , position p 2 where p 1 .skill=p2 .skill
C. Select p1 .posting-No, p2 .posting-No from position p 1 , position p 2 where p 1 .skill=p2 .skill and p 1 .posting.No < p 2 .posting-
No
D. Select p1 .posting-No, p2 .posting-No from position p 1 , position p 2 where p 1 .skill=p2 .skill and p 1 .posting.No = p 2 .posting-
No

ugcnetdec2012ii databases sql

5.39.4 Sql: UGCNET-Dec2012-III: 70 https://gateoverflow.in/57829

Referential integrity is directly related to

A. Relation key B. Foreign key C. Primary key D. Candidate key

ugcnetdec2012iii databases sql

5.39.5 Sql: UGCNET-Dec2013-III: 58 https://gateoverflow.in/60751

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
ugcnetdec2013iii databases sql

5.39.6 Sql: UGCNET-Dec2014-II: 16 https://gateoverflow.in/59139

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
 ugcnetdec2014ii databases sql

5.39.7 Sql: UGCNET-Dec2014-II: 17 https://gateoverflow.in/59140

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. I and II are correct. B. II and III are correct.
C. Only III is correct. D. Only I is correct.
ugcnetdec2014ii databases sql

5.39.8 Sql: UGCNET-Dec2015-II: 13 https://gateoverflow.in/62239

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';

ugcnetdec2015ii databases sql

5.39.9 Sql: UGCNET-Dec2015-III: 59 https://gateoverflow.in/33100

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. 5 B. 10 C. 15 D. 50
ugcnetdec2015iii databases sql

5.39.10 Sql: UGCNET-Dec2015-III: 60 https://gateoverflow.in/62728

Suppose ORACLE relation R(A, B) currently has tuples {(1, 2), (1, 3), (3, 4)} and relation S(B, C) currently has
{(2, 5), (4, 6), (7, 8)}.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. 2 and 6 respectively B. 6 and 2 respectively
C. 2 and 4 respectively D. 4 and 2 respectively
ugcnetdec2015iii databases sql

5.39.11 Sql: UGCNET-Dec2015-III: 61 https://gateoverflow.in/62731

Consider the following three SQL queries (Assume the data in the people table):

a. Select Name from people SelectAge

b. where Name>from
21 ; people SelectHeight
c. where > 180
Name from people
; If the (Age
where SQL queries and b above,
> 21) ora(Height > 180)return
; 10 rows
a n d 7 rows in the result set respectively, then
what is one possible number of rows returned by the SQL query c?

A. 3 B. 7 C. 10 D. 21
ugcnetdec2015iii databases sql

5.39.12 Sql: UGCNET-Dec2019-II: 22 https://gateoverflow.in/360811

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 D1 and D2

B. Total number of employees of department D1 and D2 if their total is > 5
C. Display total number of employees in both departments D1 and D2
D. The output of the query must have at least two rows

ugcnetdec2019ii sql

5.39.13 Sql: UGCNET-Jan2017-II: 17 https://gateoverflow.in/335146

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?
a. An instructor Id. No. cannot be null, provided Instructor Id No.
b. No two citizens have same Adhar-ld.
being primary key.
c. 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

5.39.14 Sql: UGCNET-Jan2017-III: 11 https://gateoverflow.in/335227

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.

ugcnetjan2017iii databases sql

5.39.15 Sql: UGCNET-June-2019-II: 37 https://gateoverflow.in/316242

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

ugcnetjune2019ii sql

5.39.16 Sql: UGCNET-June2010-II: 19 https://gateoverflow.in/67849

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

ugcnetjune2010ii databases sql

5.39.17 Sql: UGCNET-June2010-II: 20 https://gateoverflow.in/67851

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
ugcnetjune2010ii databases sql

5.39.18 Sql: UGCNET-June2013-III: 8 https://gateoverflow.in/58261

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

ugcnetjune2013iii databases sql

5.39.19 Sql: UGCNET-June2015-II: 16 https://gateoverflow.in/60961

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
ugcnetjune2015ii databases sql

5.39.20 Sql: UGCNET-June2015-II: 18 https://gateoverflow.in/60963

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
ugcnetjune2015ii databases sql

5.39.21 Sql: UGCNET-June2015-III: 8 https://gateoverflow.in/61150

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

ugcnetjune2015iii sql databases

5.39.22 Sql: UGCNET-June2016-II: 19 https://gateoverflow.in/63129

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
ugcnetjune2016ii databases sql

5.39.23 Sql: UGCNET-June2016-III: 11 https://gateoverflow.in/63620

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:
SQ1 ; SELECT R.B, AVG(S.B) FROM R, S WHERE R.A=S.C AND S.D<7 GROUP BY R.B
SQ2 : 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 1 and If N is the number of tuples returned by SQ 2 then

A. M=4, N=2 B. M=5, N=3 C. M=2, N=2 D. M=3, N=3

ugcnetjune2016iii databases sql

5.39.24 Sql: UGCNET-June2016-III: 9 https://gateoverflow.in/63614

Consider teh relations R(A, B) and S(B, C) and the following four relational algebra queries over R ans S

I. πA,B (R ⋈ S)
II. R ⋈ πB (S)
III. R ∩ (πA (R) × πB (S))
IV. ΠA.R.B (R × S) where R. B 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
ugcnetjune2016iii databases sql

5.39.25 Sql: UGCNET-Nov2017-iii-11 https://gateoverflow.in/166387

Given two relations R1 (A, B) and R2 (C, D), 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. R1 has no duplicates and R2 is empty. B. R1 has no duplicates and R2 is non-empty.

C. Both R1 and R2 have no duplicates. D. R2 has no duplicates and R1 is non – empty.
ugcnetnov2017-iii databases sql

5.39.26 Sql: UGCNET-Oct2020-II: 100 https://gateoverflow.in/349573

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 20% rise in
salary. Which of the following query/queries will compute the above results?

Choose the correct answer from the options given

a. b. c. below:

UPDATE
SETWHERE
SALARY
EMPLOYEE
DEPT
= SALARY*1.20
NO.
UPDATE
SET
IN (SELECT
SALARY
TABLE EMPLOYEE
=
DID
SALARY*1.20
ALTER
FROM
SETDEPARTMENT
WHERE
TABLE
SALARY=SALARY*1.20
WHERE
DEPTNO.
EMPLOYEE
DNAME=’SCIENCE’;
WHERE
IN DNAME
(SELECT
= ‘SCIENCE’);
DNAME FROM DEPARTMENT WHERE D

A. a and b only B. a only C. b and c only D. c only

ugcnet-oct2020-ii databases sql

5.39.27 Sql: UGCNET-Oct2020-II: 96 https://gateoverflow.in/349577

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. 20, 30 and 40

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;

ugcnet-oct2020-ii databases sql

5.39.28 Sql: UGCNET-Oct2020-II: 97 https://gateoverflow.in/349576

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 I :
SELECT SUM (SALARY) MAX(SALARY) MIN(SALARY),
AVG (SALARY) FROM EMPLOYEE, DEPARTMENT
WHERE DEPTNO=DID AND DNAME=’ENGLISH’

STATEMENT II :
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 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

ugcnet-oct2020-ii databases sql

5.39.29 Sql: UGCNET-Oct2020-II: 98 https://gateoverflow.in/349575

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 20 of university. Order result by employee ID (refer table structures given above).

Choose the correct answer from the options given

a. b. SELECT
FROM
WHERE
EID,
EMPLOYEE
ORDER below:
SALARY
NAME
BY EID
> ALL(SELECT SALARY FROM EMPLOYEE WHERE D
c.
SELECT
FROM
WHERE
EID,
EMPLOYEE
ORDER
SALARY>(SELECT
NAME
BY EID
SELECT
FROM
WHERE
EID,
EMPLOYEE
SALARY
SALARY>(SELECT
NAMEFROM EMPLOYEE
SALARY
WHERE
FROM
DEPTNO=20)
EMPLOYEE WHERE DEPTNO=20);

A. a and b only B. a and c only C. b only D. c only

ugcnet-oct2020-ii databases sql

5.39.30 Sql: UGCNET-Oct2020-II: 99 https://gateoverflow.in/349574

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?

Choose the correct answer from the options given

a. b. c. below:

ALTER TABLE EMPLOYEE

ALTER
DROP
TABLE
SALARY
EMPLOYEE
CASCADE
ALTER
DROP
EMPLOYEE
SALARY DROP
RESTRICT
SALARY

A. a and b only B. a and c only C. b and c only D. a only

ugcnet-oct2020-ii databases sql

5.39.31 Sql: UGCNET-Sep2013-III: 25 https://gateoverflow.in/59697

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

ugcnetsep2013iii databases sql

5.40 Transaction And Concurrency (9)

5.40.1 Transaction And Concurrency: UGCNET-Dec2010-II: 18 https://gateoverflow.in/66815

Which of the following is an optimistic concurrency control method ?

A. Validation based B. Time stamp ordering
C. Lock-based D. None of these
ugcnetdec2010ii databases transaction-and-concurrency

5.40.2 Transaction And Concurrency: UGCNET-Dec2014-III: 08 https://gateoverflow.in/60008

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. I and III B. II and IV C. I and IV D. II and III
ugcnetdec2014iii databases transaction-and-concurrency

5.40.3 Transaction And Concurrency: UGCNET-Jan2017-III: 7 https://gateoverflow.in/335231

Consider following schedules involving two transactions:

S1 : r1 (X); r1 (Y ); r2 (X); r2 (Y ); w2 (Y ); w1 (X)
S2 : r1 (X); r2 (X); r2 (Y ); w2 (Y ); r1 (Y ); w1 (X)
Which of the following statement is true?

A. Both S1 and S2 are conflict serializable.

B. S1 is conflict serializable and S2 is not conflict serializable
C. S1 is not conflict serializable and S2 is conflict serializable
D. Both S1 and S2 are not conflict serializable

ugcnetjan2017iii databases transaction-and-concurrency

5.40.4 Transaction And Concurrency: UGCNET-July-2018-II: 65 https://gateoverflow.in/225821

Consider the following schedules involving two transactions.

S1 : r1 (X); r1 (Y ); r2 (X); r2 (Y ); w2 (Y ); w1 (X)
S2 : r1 (X); r2 (X); r2 (Y ); w2 (Y ); r1 (Y ); w1 (X)
Which one of the following statements is correct with respect to above?

A. Both S1 and S2 are conflict serializable

B. Both S1 and S2 are not conflict serializable
C. ​ 1 is conflict serializable and S2 is not conflict serializable​​
S
D. ​ 1 is not conflict serializable and S2 is conflict serializable​​
S

ugcnetjuly2018ii databases transaction-and-concurrency

5.40.5 Transaction And Concurrency: UGCNET-June2012-II: 12 https://gateoverflow.in/55616

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
ugcnetjune2012ii databases transaction-and-concurrency

5.40.6 Transaction And Concurrency: UGCNET-Nov2017-iii-7 https://gateoverflow.in/166383

Consider the following four schedules due to three transactions (indicated by the subscript) using read and write on a
data item X , denoted by r(X) and w(X) respectively. Which one of them is conflict serializable?
S1 : r1(X); r2(X); w1(X); r3(X); w2(X)
S2 : r2(X); r1(X); w2(X); r3(X); w1(X)
S3 : r3(X); r2(X); r1(X); w2(X); w1(X)
S4 : r2(X); w2(X); r3(X); r1(X); w1(X)

A. S1 B. S2 C. S3 D. S4
ugcnetnov2017-iii databases transaction-and-concurrency

5.40.7 Transaction And Concurrency: UGCNET-Nov2017-iii-8 https://gateoverflow.in/166384

Suppose a database schedule S involves transactions T1, T2, … , Tn . Consider the precedence graph of S with
vertices representing the transactions and edges representing the conflicts. If S 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
ugcnetnov2017-iii databases transaction-and-concurrency
 5.40.8 Transaction And Concurrency: UGCNET-Sep2013-II: 37 https://gateoverflow.in/59245

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

5.40.9 Transaction And Concurrency: UGCNET-Sep2013-II: 43 https://gateoverflow.in/59257

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

5.41 Transactions And Concurrency Control (1)

5.41.1 Transactions And Concurrency Control: UGCNET-Oct2020-II: 48 https://gateoverflow.in/349625

In the context of concurrency control, a given pair of operations in a schedule is called conflict schedule if
a. At least one of the operations is write operation b. Both the operations are performed on the same data item
c. Both the operations are performed by different transactions d. Both the operations are performed on different data items
Choose the correct answer from the options given below:
A. (a) and (b) only B. (a), (b) and (c) only
C. (a), (c) and (d) only D. (c) and (d) only
ugcnet-oct2020-ii databases transactions-and-concurrency-control

5.42 Tree (1)

5.42.1 Tree: UGCNET-Jan2017-III: 12 https://gateoverflow.in/335226

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.

ugcnetjan2017iii databases b-tree tree

5.43 Weak Entity (1)

5.43.1 Weak Entity: UGCNET-June2015-II: 20 https://gateoverflow.in/60968

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
ugcnetjune2015ii databases weak-entity

Answer Keys
5.0.1 Q-Q 5.0.2 B 5.0.3 C 5.0.4 Q-Q 5.0.5 Q-Q
5.0.6 D 5.0.7 Q-Q 5.0.8 Q-Q 5.0.9 C 5.0.10 D
5.0.11 D 5.0.12 Q-Q 5.0.13 Q-Q 5.0.14 Q-Q 5.0.15 D
5.0.16 Q-Q 5.0.17 B 5.0.18 B 5.0.19 Q-Q 5.0.20 Q-Q
5.0.21 Q-Q 5.0.22 Q-Q 5.0.23 Q-Q 5.0.24 C 5.0.25 A
5.0.26 Q-Q 5.0.27 Q-Q 5.0.28 Q-Q 5.0.29 D 5.0.30 D
5.0.31 Q-Q 5.1.1 C 5.1.2 Q-Q 5.2.1 B 5.2.2 C
5.2.3 A 5.3.1 X 5.4.1 C 5.4.2 B 5.4.3 C

5.4.4 C 5.5.1 B 5.6.1 A 5.7.1 Q-Q 5.8.1 B

5.9.1 Q-Q 5.9.2 D 5.10.1 B 5.11.1 A 5.11.2 Q-Q
5.12.1 D 5.12.2 A 5.13.1 A 5.14.1 B 5.15.1 D
5.15.2 C 5.15.3 D 5.15.4 A 5.15.5 Q-Q 5.15.6 A
5.15.7 B 5.15.8 D 5.15.9 B 5.15.10 B 5.15.11 B
5.15.12 A 5.15.13 D 5.15.14 D 5.15.15 D 5.15.16 Q-Q
5.15.17 A 5.15.18 B 5.15.19 C 5.15.20 A 5.15.21 C
5.15.22 D 5.15.23 Q-Q 5.16.1 Q-Q 5.16.2 A 5.16.3 C
5.17.1 A 5.18.1 Q-Q 5.18.2 B 5.19.1 B 5.20.1 Q-Q
5.20.2 A 5.20.3 B 5.20.4 C 5.20.5 D 5.20.6 A
5.20.7 Q-Q 5.20.8 D 5.20.9 A 5.20.10 Q-Q 5.20.11 B
5.20.12 B 5.20.13 Q-Q 5.20.14 Q-Q 5.20.15 Q-Q 5.21.1 D
5.22.1 Q-Q 5.23.1 B 5.24.1 Q-Q 5.25.1 B 5.25.2 A
5.26.1 B 5.27.1 B 5.28.1 B 5.28.2 C 5.29.1 B
5.30.1 Q-Q 5.30.2 Q-Q 5.30.3 Q-Q 5.30.4 Q-Q 5.30.5 D
5.30.6 C 5.30.7 C 5.30.8 A 5.30.9 A 5.31.1 B
5.32.1 B 5.32.2 B 5.33.1 Q-Q 5.33.2 A 5.34.1 A
5.34.2 A 5.34.3 B 5.35.1 B 5.35.2 C 5.36.1 C
5.36.2 C 5.37.1 A 5.38.1 C 5.39.1 Q-Q 5.39.2 Q-Q
5.39.3 C 5.39.4 B 5.39.5 B 5.39.6 B 5.39.7 D
5.39.8 C 5.39.9 B 5.39.10 B 5.39.11 D 5.39.12 Q-Q
5.39.13 C 5.39.14 D 5.39.15 C 5.39.16 Q-Q 5.39.17 Q-Q
5.39.18 D 5.39.19 A 5.39.20 C 5.39.21 B 5.39.22 C
5.39.23 A 5.39.24 D 5.39.25 B 5.39.26 B 5.39.27 C
5.39.28 C 5.39.29 D 5.39.30 A 5.39.31 A 5.40.1 Q-Q
5.40.2 D 5.40.3 A 5.40.4 Q-Q 5.40.5 D 5.40.6 D
5.40.7 A 5.40.8 B 5.40.9 B 5.41.1 B 5.42.1 A
5.43.1 C
6 Digital Logic (104)

6.0.1 UGCNET-Oct2020-II: 34 https://gateoverflow.in/349639

The period of a signal is 100 ms, then the frequency of this signal in kilohertz is ______

A. 10 B. 10−1 C. 10−2 D. 10−3

ugcnet-oct2020-ii digital-logic

6.0.2 UGCNET-Dec2007-II: 7 https://gateoverflow.in/335777

Simplified form of Boolean expression xy+(~x)z+yz is :

A. xy+(~x)z B. (~x)y+(~x)z C. (~x)y+xz D. xy+xz

ugcnetdec2007ii

6.0.3 UGCNET-Dec2006-II: 6 https://gateoverflow.in/335665

The hexadecimal equivalent of (10111)2 × (1110)2 is :

A. 150 B. 241 C. 142 D. 101011110

ugcnetdec2006ii

6.0.4 UGCNET-Dec2006-II: 7 https://gateoverflow.in/335664

An example of a self complementing code is :

A. 8421 code B. Gray code C. Excess-3 code D. 7421 code

ugcnetdec2006ii

6.0.5 UGCNET-Dec2006-II: 9 https://gateoverflow.in/335662

The characteristic equation of the D flip-flop is :

A. B. Q=D C. Q=1 D. Q=0

ugcnetdec2006ii

6.0.6 UGCNET-Dec2004-II: 10 https://gateoverflow.in/335387

The characteristic equation of a T flip-flop is :

¯¯¯¯ ¯¯
¯¯ B. Qn+1 = T + Qn
A. Qn+1 = T Qn + T Qn
D. The
Qn+1symbols
= T Qnused have the usual meaning.
C. Qn+1 = T Qn ¯¯ ¯¯¯¯
¯¯

ugcnetdec2004ii

6.0.7 UGCNET-dec2004-7 https://gateoverflow.in/156340

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

digital-logic
6.0.8 UGCNET-June2013-III: 46 https://gateoverflow.in/58518

Match the following :

a. TTL i. High component density
b. ECL ii. Low power consumption
c. MOS iii. Evaluation of "diode-transistor-logic"
d. CMOS iv. High Speed digital circuits
Codes :
A. a-iii, b-ii, c-i, d-iv B. a-i, b-iv, c-iii, d-ii
C. a-iii, b-iv, c-i, d-ii D. a-i, b-ii, c-iii, d-iv
ugcnetjune2013iii digital-logic

6.0.9 UGCNET-Sep2013-II: 26 https://gateoverflow.in/59224

Match the following identities/laws to their corresponding name :

(a) x+x = x i. Dominance
x ⋅ x=x
(b) x+0 = x ii. Absorption
x ⋅ 1=x
(c) x+1 = 1 iiii. Idempotent
x ⋅ 1=x
(d) x ⋅ (x+y)=
iv. xIdentity
Codes :
A. (a)-iii, (b)-iv, (c)-i, (d)-ii B. (a)-iv, (b)-iii, (c)-i, (d)-ii
C. (a)-iv, (b)-iii, (c)-ii, (d)-i D. (a)-iii, (b)-iv, (c)-ii, (d)-i
ugcnetsep2013ii digital-logic

6.0.10 UGCNET-June2016-II: 9 https://gateoverflow.in/63107

The simplified form of the Boolean equation (AB̄ + AB̄ + AC)(ĀC̄ + B̄) is

A. AB̄ B. AB̄C C. ĀB D. ABC

ugcnetjune2016ii digital-logic

6.0.11 UGCNET-june2009-ii-04 https://gateoverflow.in/154139

The characteristic equation of a JK flip-flop is :

A. Qn+1 = J ⋅ Qn + K ⋅ Qn B. Qn+1 = J ⋅ Q̄n + K̄ ⋅ Qn
C. Qn+1 = Qn + J ⋅ K D. Qn+1 = (J + K) Qn
ugcnetjune2009ii

6.0.12 UGCNET-June2016-II: 8 https://gateoverflow.in/63106

Simplified Boolean equation for the following truth table is :

x y z F
0 0 0 0
0 0 1 1
0 1 0 0
0 1 1 1
1 0 0 1
1 0 1 0
1 1 0 1
1 1 1 0

A. F = yz̄ + ȳ z B. F = xȳ + x̄y

C. F = x̄z + xz̄ D. F = x̄z + xz̄ + xyz
 ugcnetjune2016ii digital-logic

6.0.13 UGCNET-June2016-II: 6 https://gateoverflow.in/63104

Which of the following logic expression is incorrect ?

A. 1 ⊕ 0 = 1 B. 1 ⊕ 1 ⊕ 1 = 1
C. 1 ⊕ 1 ⊕ 0 = 1 D. 1 ⊕ 1 = 0
ugcnetjune2016ii digital-logic

6.0.14 UGCNET-Dec2013-III: 53 https://gateoverflow.in/60739

What will be output of the following logic diagram ?

A. x OR y B. x AND y C. x XOR y D. x XNOR y

ugcnetdec2013iii digital-logic

6.0.15 UGCNET-Dec2013-III: 51 https://gateoverflow.in/60733

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
ugcnetdec2013iii digital-logic

6.0.16 UGCNET-Dec2013-II: 6 https://gateoverflow.in/60034

FAN IN of a component A is defined as

A. Number of components that can call or pass control to component A.
B. Number of components that are called by component A.
C. Number of components related to component A.
D. Number of components dependent on component A.

ugcnetdec2013ii digital-logic

6.0.17 UGCNET-Dec2007-II: 8 https://gateoverflow.in/335776

In order to build a MOD - 18 counter, the minimum number of flip flops needed is equal to :

A. 18 B. 9 C. 5 D. 4
ugcnetdec2007ii

6.1 Adder (3)

6.1.1 Adder: UGCNET-AUG2016-II: 10 https://gateoverflow.in/69386

Match the following :

List-I List-II
a. Controlled inverter i. a circuit that can add 3 bits
b. Full adder ii. a circuit that can add two binary numbers
c. Half adder iii. a circuit that transmits a binary word or
its 1’s complement
d. Binary adder iv. a logic circuit that adds 2 bits
Codes :
A. a-iii, b-ii, c-iv, d-i B. a-ii, b-iv, c-i, d-ii
C. a-iii, b-iv, c-i, d-ii D. a-iii, b-i, c-iv, d-ii
ugcnetaug2016ii digital-logic adder
 6.1.2 Adder: UGCNET-Dec2013-II: 40 https://gateoverflow.in/60246

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
ugcnetdec2013ii digital-logic adder

6.1.3 Adder: UGCNET-Dec2014-II: 06 https://gateoverflow.in/58785

The BCD adder to add two decimal digits needs minimum of

A. 6 full adders and 2 half adders B. 5 full adders and 3 half adders
C. 4 full adders and 3 half adders D. 5 full adders and 2 half adders
ugcnetdec2014ii digital-logic adder

6.2 Boolean Algebra (9)

6.2.1 Boolean Algebra: UGCNET-June2011-II: 4 https://gateoverflow.in/64339

The absorption law in Boolean algebra say that

A. X + X = X B. X. X = X
C. X + X. Y = X D. None of the above
digital-logic boolean-algebra ugcnetjune2011ii

6.2.2 Boolean Algebra: UGCNET-June2013-II: 41 https://gateoverflow.in/58043

How many different Boolean functions of degree 4 are there?

A. 24 B. 28 C. 212 D. 216
ugcnetjune2013ii digital-logic boolean-algebra

6.2.3 Boolean Algebra: UGCNET-June2014-II: 16 https://gateoverflow.in/53490

How many different truth tables of the compound propositions are there that involve the propositions p & q ?

A. 2 B. 4 C. 8 D. 16
ugcnetjune2014ii digital-logic boolean-algebra

6.2.4 Boolean Algebra: UGCNET-June2014-II: 17 https://gateoverflow.in/53491

A Boolean function F is called self dual if and only if F(x1 , x2 , . . . . . xn ) = F(x̄1 , x̄2 , . . . . x̄n ) . How many Boolean
functions of degree n are self-dual ?
n 2 n−1
A. 2n B. (2)2 C. (2)n D. (2)2
ugcnetjune2014ii digital-logic boolean-algebra

6.2.5 Boolean Algebra: UGCNET-June2015-II: 6 https://gateoverflow.in/60905

Consider the following statements:

a. Boolean expressions and

b.logic
Optimal
gatesboolean
networks
expressions
correspond
c. Choosing
may
to labelled
notessential
correspond
acyclic
blocks
to Which
digraphs in aof
simplest
first these statement(s)
networks.
Karnaugh is/are
map and then correct?
greedily choosing the largest rem

A. a only B. b only C. a and b D. a, b, and c

ugcnetjune2015ii digital-logic boolean-algebra

6.2.6 Boolean Algebra: UGCNET-Oct2020-II: 42 https://gateoverflow.in/349631

Simplified expression/s for following Boolean function

F(A, B, C, D) = Σ(0, 1, 2, 3, 6, 12, 13, 14, 15) is/are
 a. A′ B′ + AB + A′ C ′ D′ b. A′ B′ + AB + A′ C D′ c. A′ B′ + AB + BC ′ D′ d. A′ B′ + AB + BC D′ Choose the correct
answer from the options
given below:

A. (a) only B. (b) only C. (a) and (b) only D. (b) and (d) only

ugcnet-oct2020-ii digital-logic boolean-algebra

6.2.7 Boolean Algebra: UGCNET-dec2009-ii-06 https://gateoverflow.in/152695

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
ugcnetdec2009ii digital-logic boolean-algebra

6.2.8 Boolean Algebra: UGCNET-june2007-9 https://gateoverflow.in/155853

If A⊕B=C, then:
(A) A⊕C=B (B) B⊕C=A
(C) A⊕B⊕C=1 (D) A⊕B⊕C=0

boolean-algebra

6.2.9 Boolean Algebra: UGCNET-june2009-ii-03 https://gateoverflow.in/154138

The Boolean expression x̄ȳ z + yz + xz is equivalent to :

A. x B. y C. z D. x + y + z
ugcnetjune2009ii digital-logic boolean-algebra

6.3 Boolean Function (1)

6.3.1 Boolean Function: UGCNET-June2013-III: 45 https://gateoverflow.in/58514

The simplified function in product of sums of Boolean function F(W, X, Y , Z) = Σ(0, 1, 2, 5, 8, 9, 10) is

A. (W ′ + X ′ )(Y ′ + Z ′ )(X ′ + Z) B. (W ′ + X ′ )(Y ′ + Z ′ )(X ′ + Z ′ )

C. (W ′ + X ′ )(Y ′ + Z)(X ′ + Z) D. (W ′ + X ′ )(Y + Z ′ )(X ′ + Z)
ugcnetjune2013iii digital-logic boolean-function

6.4 Circuit Output (2)

6.4.1 Circuit Output: ISRO2014-21, UGCNET-Dec2012-III: 23, UGCNET-Dec2013-III: 22 https://gateoverflow.in/13385

What are the final values of Q1 and Q0 after 4 clock cycles, if initial values are 00 in the sequential circuit shown
below:

A. 11 B. 01 C. 10 D. 00
isro2014 digital-logic circuit-output ugcnetdec2012iii ugcnetdec2013iii
 6.4.2 Circuit Output: UGCNET-Dec2012-II: 1 https://gateoverflow.in/56500

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. A=0, B=0, C=1 B. A=0, B=C=1 C. A=1, B=C=0 D. A= B=1, C=1

ugcnetdec2012ii digital-logic circuit-output

6.5 Combinational Circuits (3)

6.5.1 Combinational Circuits: UGCNET-AUG2016-II: 9 https://gateoverflow.in/69385

Which of the following logic operations is performed by the following given combinational circuit ?

A. EXCLUSIVE-OR B. EXCLUSIVE-NOR C. NAND D. NOR

ugcnetaug2016ii digital-logic combinational-circuits

6.5.2 Combinational Circuits: UGCNET-AUG2016-III: 6 https://gateoverflow.in/70748

The output of the following combinational circuit

is :
A. X. Y B. X + Y
C. X ⨁ Y D. X ⨁ Y
ugcnetaug2016iii digital-logic combinational-circuits

6.5.3 Combinational Circuits: UGCNET-July-2018-II: 93 https://gateoverflow.in/225793

Match the terms in List-I with the options given in List-II :

List-I List-II
(a) Decoder (i) 1 line to 2n lines
(b) Multiplexer (ii) n lines to 2n lines
(c) De multiplexer (iii) 2n lines to 1 line
(iv) 2n lines to 2n−1 lines
Code :
A. (a)-(ii); (b)-(i); (c)-(iii) B. (a)-(ii); (b)-(iii); (c)-(i)
C. (a)-(ii); (b)-(i); (c)-(iv) D. (a)-(iv);(b)-(ii); (c)-(i)
ugcnetjuly2018ii digital-logic combinational-circuits

6.6 Digital Circuits (11)

6.6.1 Digital Circuits: UGCNET-AUG2016-III: 65 https://gateoverflow.in/71661

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)
ugcnetaug2016iii digital-logic digital-circuits

6.6.2 Digital Circuits: UGCNET-Dec2010-II: 7 https://gateoverflow.in/66530

¯ B) is equivalent to
AB + (A +
A. A ⨁ B B. A ⨀ B
C. (A ⨁ B) ⨀ A D. (A ⨀ B) ⨁ A
ugcnetdec2010ii digital-logic digital-circuits

6.6.3 Digital Circuits: UGCNET-Dec2012-II: 38 https://gateoverflow.in/57075

Match the following IC families with their basic circuits :

a. TTL i. NAND
b. ECL ii. NOR
c. CMOS iii. Inverter
Code :
A. a-i, b-ii, c-iii B. a-iii, b-ii, c-i
C. a-ii, b-iii, c-i D. a-ii, b-i, c-iii
ugcnetdec2012ii digital-logic digital-circuits

6.6.4 Digital Circuits: UGCNET-Dec2012-II: 47 https://gateoverflow.in/57210

Match the following :

a. TTL i. High fan out
b. ECL ii. Low propagation delay
d. CMOS iii. High power dissipation
Code :
A. a-iii, b-ii, c-i B. a-i, b-ii, c-iii
C. a-i, b-iii, c-ii D. a-iii, b-i, c-ii
ugcnetdec2012ii digital-logic digital-circuits

6.6.5 Digital Circuits: UGCNET-Dec2012-II: 49 https://gateoverflow.in/57212

Identify the operation which is commutative but not associative?

A. OR B. NOR C. EX-OR D. NAND

ugcnetdec2012ii digital-logic digital-circuits

6.6.6 Digital Circuits: UGCNET-Jan2017-II: 7 https://gateoverflow.in/335156

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

6.6.7 Digital Circuits: UGCNET-June2010-II: 6 https://gateoverflow.in/67751

The logic expression for the output of the circuit shown in the figure is
 A. ĀC̄ + B̄C̄ + CD B. AC̄ + BC̄ + C̄ D
C. ABC + C̄D̄ D. ĀB̄ + B̄C̄ + C̄D̄
ugcnetjune2010ii digital-logic digital-circuits

6.6.8 Digital Circuits: UGCNET-June2010-II: 8 https://gateoverflow.in/67819

What is the transitive voltage for the voltage input of a CMOS operating from 10V supply ?

A. 1V B. 2V C. 5V D. 10V
ugcnetjune2010ii digital-logic digital-circuits

6.6.9 Digital Circuits: UGCNET-Sep2013-II: 23 https://gateoverflow.in/59075

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

6.6.10 Digital Circuits: UGCNET-dec2008-ii-4 https://gateoverflow.in/155028

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
ugcnetdec2008ii digital-logic digital-circuits

6.6.11 Digital Circuits: UGCNET-dec2008-ii-5 https://gateoverflow.in/155029

An example of a universal building block is:

1. X − OR gate
2. AND gate
3. OR gate
4. NOR gate

ugcnetdec2008ii digital-logic digital-circuits

6.7 Digital Counter (2)

6.7.1 Digital Counter: UGCNET-DEC2016-II: 8 https://gateoverflow.in/115607

A binary 3 − bit down counter uses J − K flip-flops, FFi with inputs Ji , Ki and outputs Qi , i = 0, 1, 2
respectively. The minimized expression for the input from following is

I. J0 = K0 =0
II. J0 = K0 =1
III. J1 = K1 = Q0
IV. J1 = K1 = Q′0
V. J2 = K2 = Q1 Q0
VI. J2 = K2 = Q′1 Q′0

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

ugcnetdec2016ii digital-logic digital-counter
 6.7.2 Digital Counter: UGCNET-June-2019-II: 15 https://gateoverflow.in/316264

What will be the number of states when a MOD- 2 counter is followed by a MOD- 5 counter?

A. 5 B. 10 C. 15 D. 20
ugcnetjune2019ii digital-counter

6.8 Dual Function (2)

6.8.1 Dual Function: UGCNET-Dec2013-II: 31 https://gateoverflow.in/60218

The dual of a Boolean expression is obtained by interchanging

A. Boolean sums and Boolean products

B. Boolean sums and Boolean products or interchanging 0′ s and 1′ s
C. Boolean sums and Boolean products and interchanging 0′ s and 1′ s
D. Interchanging 0′ s and 1′ s

ugcnetdec2013ii digital-logic dual-function

6.8.2 Dual Function: UGCNET-dec2008-ii-13 https://gateoverflow.in/155036

The dual of the switching function x + yz is :

A. x + yz B. x′ + y ′ z ′
C. x(y + z) D. x′ (y ′ + z ′ )
ugcnetdec2008ii digital-logic dual-function

6.9 Encoding (1)

6.9.1 Encoding: UGCNET-June2014-II: 37 https://gateoverflow.in/54599

A text is made up of the characters α, β, γ, δ and σ with the probability 0.12, 0.40, 0.15, 0.08 and 0.25 respectively.
The optimal coding technique will have the average length of

A. 1.7 B. 2.15 C. 3.4 D. 3.8

ugcnetjune2014ii computer-networks encoding

6.10 Excess 3 (1)

6.10.1 Excess 3: UGCNET-Dec2014-II: 07 https://gateoverflow.in/58786

The Excess-3 decimal code is a self-complementing code because

A. The binary sum of a code and its 9′ s complement is equal to 9.

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 10′ s complement is equal to 9.

ugcnetdec2014ii digital-logic excess-3

6.11 Flip Flop (7)

6.11.1 Flip Flop: UGCNET-Dec2010-II: 8 https://gateoverflow.in/66533

An Astable multivibrator has :

A. One stable state B. Two stable states
C. No stable states D. None of these
ugcnetdec2010ii digital-logic flip-flop

6.11.2 Flip Flop: UGCNET-Jan2017-II: 8 https://gateoverflow.in/335155

A binary 3-bit down counter uses J -K flip-flops, FFi with inputs Ji , Ki and outputs Qi , i = 0, 1, 2 respectively. The
minimized expression for the input from following is :
 I. J0 = K0 =0
II. J0 = K0 =1
III. J1 = K1 = Q0
IV. J1 = K1 = ¯Q
¯¯¯
0
V. J2 = K2 = Q1 Q0
VI. J2 = K2 = ¯Q
¯¯¯ ¯¯¯¯
1 Q0

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

ugcnetjan2017ii digital-logic flip-flop

6.11.3 Flip Flop: UGCNET-July-2018-II: 92 https://gateoverflow.in/225794

In RS flip-flop, the output of the flip-flop at time (t + 1) same as the output at time t, after the occurrence of a clock
pulse if :

A. S = R = 1 B. S = 0, R = 1 C. S = 2, R = 0 D. S = R = 0
ugcnetjuly2018ii digital-logic flip-flop

6.11.4 Flip Flop: UGCNET-June2016-II: 10 https://gateoverflow.in/57057

In a positive edge triggered J -K flip flop , if J and K both are high then the output will be ______on the rising edge
of the clock :

A. No change B. Set C. Reset D. Toggle

ugcnetjune2016ii digital-logic flip-flop

6.11.5 Flip Flop: UGCNET-Sep2013-III: 34 https://gateoverflow.in/59855

The power dissipation of a flip-flop is 3 mW. The power dissipation of a digital system with 4 flip-flops is given by :

A. 34 mW B. 43 mW C. 4/3 mW D. 12 mW
ugcnetsep2013iii digital-logic flip-flop

6.11.6 Flip Flop: UGCNET-Sep2013-III: 35 https://gateoverflow.in/59856

An Astable multi vibrator using the 555 timer to generate a square wave of 5 KHz with 70% duty cycle will have :

A. RA = 40.4KΩ, RB = 17.25KΩ, C = 2000pF

B. RA = 17.25KΩ, RB = 40.4KΩ, C = 2000pF
C. RA = 40.4KΩ, RB = 17.25KΩ, C = 5000pF
D. RA = 17.25KΩ, RB = 40.4KΩ, C = 5000pF

ugcnetsep2013iii digital-logic flip-flop

6.11.7 Flip Flop: UGCNET-dec2008-ii-14 https://gateoverflow.in/155037

The characteristics equation of D flip-flop is :

A. Q=1 B. Q=0 C. Q=D̄ D. Q=D

ugcnetdec2008ii digital-logic flip-flop

6.12 Floating Point Representation (1)

6.12.1 Floating Point Representation: UGCNET-Dec2014-II: 09 https://gateoverflow.in/58789

The range of representable normalized numbers in the floating point binary fractional representation in a 32-bit word
with 1-bit sign, 8-bit excess 128 biased exponent and 23-bit mantissa is :

A. 2−128 to (1 − 2−23 ) × 2127 B. (1 − 2−23 ) × 2−127 to 2128

C. (1 − 2−23 ) × 2−127 to 223 D. 2−129 to (1 − 2−23 ) × 2127
ugcnetdec2014ii digital-logic floating-point-representation

6.13 Full Adder (1)

 6.13.1 Full Adder: UGCNET-June2015-II: 7 https://gateoverflow.in/60909

Consider a full-adder with the following input values :

a. x = 1, y = 0 and Ci (carry input)= 0 b. x = 0, y = 1 and Ci = 1
Compute the value of S(sum) and Co (carry output) for the above input values :
A. S = 1, Co = 0 and S = 0, Co = 1 B. S = 0, Co = 0 and S = 1, Co = 1
C. S = 1, Co = 1 and S = 0, Co = 0 D. S = 0, Co = 1 and S = 1, Co = 0
ugcnetjune2015ii digital-logic full-adder

6.14 Ieee Representation (2)

6.14.1 Ieee Representation: UGCNET-June2016-II: 7 https://gateoverflow.in/57058

The IEEE-754 double precision format to represent floating point numbers, has a length of ______ bits.

A. 16 B. 32 C. 48 D. 64
ugcnetjune2016ii digital-logic ieee-representation

6.14.2 Ieee Representation: UGCNET-Sep2013-II: 7 https://gateoverflow.in/59012

The IEEE single-precision and double-precision format to represent floating-point numbers, has a length of ______
and ________ respectively.
A. 8 bits and 16 bits B. 16 bits and 32 bits
C. 32 bits and 64 bits D. 64 bits and 128 bits
ugcnetsep2013ii digital-logic ieee-representation

6.15 K Map (3)

6.15.1 K Map: UGCNET-AUG2016-II: 8 https://gateoverflow.in/69384

The Karnaugh map for a Boolean function is given as

The simplified Boolean equation for the above Karnaugh Map is

A. AB + CD + AB̄ + AD B. AB + AC + AD + BCD
C. AB + AD + BC + ACD D. AB + AC + BC + BCD
ugcnetaug2016ii digital-logic k-map

6.15.2 K Map: UGCNET-July-2018-II: 99 https://gateoverflow.in/225787

Simplify the following using K – map :

F(A, B, C, D) = Σ(0, 1, 2, 8, 9, 12, 13)
d(A, B, C, D) = Σ(10, 11, 14, 15)
d stands for don't care condition.
A. A + B̄D̄ + BC B. A + B̄D̄ + B̄C̄
C. Ā + B̄C̄ D. Ā + B̄C̄ + B̄D̄
ugcnetjuly2018ii digital-logic k-map

6.15.3 K Map: UGCNET-June2010-II: 10 https://gateoverflow.in/67823

The function represented by the k-map given below is

 A. A ⋅ B B. AB + BC + CA
¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯ D. A ⋅ B ⋅ C
C. B ⨁ C
ugcnetjune2010ii digital-logic k-map

6.16 Logic Circuit Diagram (1)

6.16.1 Logic Circuit Diagram: UGCNET-Sep2013-II: 49 https://gateoverflow.in/59284

What type of logic circuit is represented by the figure shown below ?

A. XOR B. XNOR C. XAND D. XNAND

ugcnetsep2013ii digital-logic logic-circuit-diagram

6.17 Memory (1)

6.17.1 Memory: UGCNET-dec2009-ii-08 https://gateoverflow.in/152698

The highest noise margin is offered by

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

ugcnetdec2009ii digital-logic memory

6.18 Multiplexer (4)

6.18.1 Multiplexer: UGCNET-June2012-III: 53 https://gateoverflow.in/56310

Consider the below circuit and find the output function f(x, y, z)

A. xz̄ + xy + ȳ z B. xz̄ + xy + ȳz̄

C. xz + xy + ȳz̄ D. xz + xȳ + ȳ z
ugcnetjune2012iii digital-logic multiplexer

6.18.2 Multiplexer: UGCNET-June2014-III: 68 https://gateoverflow.in/57593

A terminal multiplexer has six 1200 bps terminals and ′ n′ 300 bps terminals connected to it. If the outgoing line is
9600 bps, what is the value of n?

A. 4 B. 8 C. 16 D. 28
ugcnetjune2014iii digital-logic multiplexer

6.18.3 Multiplexer: UGCNET-dec2008-ii-15 https://gateoverflow.in/155038

If 4 input multiplexers drive a 4 input multiplexer, we get a:

A. 16 input MUX
B. 8 input MUX
C. 4 input MUX
D. 2 input MUX

ugcnetdec2008ii digital-logic multiplexer

6.18.4 Multiplexer: UGCNET-june2009-ii-05 https://gateoverflow.in/154140

In order to implement a n variable switching function, a MUX must have :

A. 2n inputs B. 2n + 1 inputs C. 2n−1 inputs D. 2n − 1 inputs

 ugcnetjune2009ii digital-logic multiplexer

6.19 Number Representation (12)

6.19.1 Number Representation: UGCNET-AUG2016-II: 6 https://gateoverflow.in/69381

The octal number 326.4 is equivalent to

A. (214.2)10 and (D6.8)16 B. (212.5)10 and (D6.8)16
C. (214.5)10 and (D6.8)16 D. (214.5)10 and (D6.4)16
ugcnetaug2016ii digital-logic number-representation

6.19.2 Number Representation: UGCNET-AUG2016-II: 7 https://gateoverflow.in/69383

Which of the following is the most efficient to perform arithmetic operations on the numbers ?
A. Sign-magnitude B. 1′ s complement
C. 2′ s complement D. 9′ s complement
ugcnetaug2016ii digital-logic number-representation

6.19.3 Number Representation: UGCNET-Dec2010-II: 6 https://gateoverflow.in/66497

The decimal number equivalent of (4057.06)8 is

A. 2095.75 B. 2095.075 C. 2095.937 D. 2095.0937

ugcnetdec2010ii digital-logic number-representation

6.19.4 Number Representation: UGCNET-Dec2010-II: 9 https://gateoverflow.in/66534

12-bit 2′ s complement of −73.75 is

A. 01001001.1100 B. 11001001.1100
C. 10110110.0100 D. 10110110.1100
ugcnetdec2010ii digital-logic number-representation

6.19.5 Number Representation: UGCNET-July-2018-II: 95 https://gateoverflow.in/225791

The hexadecimal equivalent of the binary integer number 110101101 is

A. D24 B. 1 B D C. 1 A E D. 1 A D
ugcnetjuly2018ii digital-logic number-representation

6.19.6 Number Representation: UGCNET-July-2018-II: 96 https://gateoverflow.in/225790

Perform the following operation for the binary equivalent of the decimal numbers (−14)10 + (−15)10 . The solution in
8 bit representation is

A. 11100011 B. 00011101 C. 10011101 D. 11110011

ugcnetjuly2018ii digital-logic number-representation

6.19.7 Number Representation: UGCNET-June2012-II: 35 https://gateoverflow.in/55878

If an integer needs two bytes of storage, then the maximum value of signed integer is

A. 216 − 1 B. 215 − 1 C. 216 D. 215

digital-logic number-representation ugcnetjune2012ii

6.19.8 Number Representation: UGCNET-June2014-II: 18 https://gateoverflow.in/53494

Which of the following statement(s) is (are) not correct ?

i. The 2’s complement of 0 is 0.
ii. In 2’s complement, the left most bit cannot be used to express a quantity.
iii. For an n-bit word ( 2’s complement) which includes the sign bit, there are 2n−1 positive integers, 2n+1 negative integers
 and one 0 for a total of 2n unique states.
iv. In 2’s complement the significant information is contained in the 1’s of positive numbers and 0’s of the negative numbers.

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

ugcnetjune2014ii digital-logic number-representation

6.19.9 Number Representation: UGCNET-Nov2017-ii-7 https://gateoverflow.in/166241

The octal equivalent of the binary number 1011101011 is

A. 7353 B. 1353 C. 5651 D. 5657

ugcnetnov2017-ii number-representation

6.19.10 Number Representation: UGCNET-dec2009-ii-09 https://gateoverflow.in/152700

The answer of the operation (10111)2 * (1110)2 in hex equivalence is

(A) 150

(B) 241

(C) 142

(D) 101011110
ugcnetdec2009ii digital-logic number-representation

6.19.11 Number Representation: UGCNET-dec2009-ii-10 https://gateoverflow.in/152702

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
ugcnetdec2009ii digital-logic number-representation

6.19.12 Number Representation: UGCNET-june2009-ii-13 https://gateoverflow.in/154272

The octal equivalent of hexadecimal (A.B)16 is :

A. 47.21 B. 12.74 C. 12.71 D. 17.21

ugcnetjune2009ii number-representation

6.20 Number System (6)

6.20.1 Number System: UGCNET-Dec2013-II: 32 https://gateoverflow.in/60220

Given that (292)10 = (1204)x in some number system x. The base x of that number system is

A. 2 B. 8 C. 10 D. None of the above

ugcnetdec2013ii digital-logic number-system

6.20.2 Number System: UGCNET-Jan2017-II: 10 https://gateoverflow.in/335153

The hexadecimal equivalent of the octal number 2357 is :

A. 2EE B. 2FF C. 4EF D. 4FE

ugcnetjan2017ii digital-logic number-system
 6.20.3 Number System: UGCNET-Jan2017-II: 15 https://gateoverflow.in/335148

If X is a binary number which is power of 2, then the value of X&(X − 1) is :

A. 11 … 11 B. 00 … 00 C. 100 … 0 D. 000 … 1
ugcnetjan2017ii digital-logic number-system

6.20.4 Number System: UGCNET-Jan2017-II: 9 https://gateoverflow.in/335154

Convert the octal number 0.4051 into its equivalent decimal number.

A. 0.5100098 B. 0.2096 C. 0.52 D. 0.4192

ugcnetjan2017ii digital-logic number-system

6.20.5 Number System: UGCNET-June-2019-II: 18 https://gateoverflow.in/316261

Consider the equation (146)b + (313)b−2 = (246)8 . Which of the following is the value of b?

A. 8 B. 7 C. 10 D. 16
ugcnetjune2019ii number-system

6.20.6 Number System: UGCNET-June2015-III: 4 https://gateoverflow.in/61142

The equivalent hexadecimal notation for octal number 2550276 is

A. FADED B. AEOBE C. ADOBE D. ACABE

ugcnetjune2015iii digital-logic number-system

6.21 Number Theory (1)

6.21.1 Number Theory: UGCNET-June2010-II: 9 https://gateoverflow.in/67821

What is decimal equivalent of BCD 11011.1100?

A. 22.0 B. 22.2 C. 20.2 D. 21.2

ugcnetjune2010ii digital-logic number-theory

6.22 Priority Encoder (1)

6.22.1 Priority Encoder: UGCNET-June-2019-II: 17 https://gateoverflow.in/316262

The parallel bus arbitration technique uses an external priority encoder and a decoder. Suppose, a parallel arbiter has 5
bus arbiters. What will be the size of priority encoder and decoder respectively?
A. 4 × 2, 2 × 4 B. 2 × 4, 4 × 2
C. 3 × 8, 8 × 3 D. 8 × 3, 3 × 8
ugcnetjune2019ii priority-encoder

6.23 Ripple Counter Operation (3)

6.23.1 Ripple Counter Operation: UGCNET-AUG2016-III: 1 https://gateoverflow.in/70739

A ripple counter is a (n) :

A. Synchronous Counter B. Asynchronous counter

C. Parallel counter D. None of the above
ugcnetaug2016iii digital-logic ripple-counter-operation

6.23.2 Ripple Counter Operation: UGCNET-July-2018-II: 94 https://gateoverflow.in/225792

What does the following logic diagram represent?

 A. Synchronous Counter B. Ripple Counter
C. Combinational Circuit D. Mod 2 Counter
ugcnetjuly2018ii digital-logic ripple-counter-operation

6.23.3 Ripple Counter Operation: UGCNET-Sep2013-III: 36 https://gateoverflow.in/59857

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

ugcnetsep2013iii digital-logic ripple-counter-operation

6.24 Rom (1)

6.24.1 Rom: UGCNET-Dec2014-II: 10 https://gateoverflow.in/58790

The size of the ROM 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. 216 × 8 B. 218 × 10
C. 216 × 10 D. 218 × 8
ugcnetdec2014ii digital-logic rom

6.25 Sequential Circuit (6)

6.25.1 Sequential Circuit: UGCNET-June2010-II: 7 https://gateoverflow.in/67813

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
ugcnetjune2010ii digital-logic sequential-circuit

6.25.2 Sequential Circuit: UGCNET-June2014-III: 42 https://gateoverflow.in/57018

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

6.25.3 Sequential Circuit: UGCNET-June2014-III: 44 https://gateoverflow.in/57021

Which of the following flip-flops is free from race condition ?

A. T flip-flop B. SR flip-flop
C. Master-slave JK flip-flop D. None of the above
ugcnetjune2014iii digital-logic sequential-circuit flip-flop

6.25.4 Sequential Circuit: UGCNET-June2015-III: 6 https://gateoverflow.in/61147

The number of flip-flops required to design a modulo -272 counter is

A. 8 B. 9 C. 27 D. 11
ugcnetjune2015iii digital-logic sequential-circuit flip-flop

6.25.5 Sequential Circuit: UGCNET-June2016-III: 1 https://gateoverflow.in/63863

Which of the following is a sequential circuit?

A. Multiplexer B. Decoder C. Full adder D. Counter

ugcnetjune2016iii digital-logic sequential-circuit

6.25.6 Sequential Circuit: UGCNET-june2009-ii-14 https://gateoverflow.in/154273

A reduced state table has 18 rows. The minimum number of Flip-flops needed to implement the sequential machine is :
 A. 18 B. 9 C. 5 D. 4
ugcnetjune2009ii digital-logic sequential-circuit

6.26 Sum Of Product (1)

6.26.1 Sum Of Product: UGCNET-Dec2013-II: 33 https://gateoverflow.in/60223

The sum of products expansion for the function F(x, y, z) = (x + y)z̄¯ is given as

A. x̄¯¯ ȳ¯ z + xyz̄¯ + x̄¯¯yz̄¯

B. xyz + xyz̄¯ + xȳ¯ z̄¯
C. xȳ¯ z̄¯ + x̄¯¯ ȳ¯ z̄¯ + xyz̄¯
D. xyz̄¯ + xȳ¯ z̄¯ + x̄¯¯yz̄¯

ugcnetdec2013ii digital-logic sum-of-product

6.27 Unix (1)

6.27.1 Unix: UGCNET-Dec2015-III: 40 https://gateoverflow.in/62683

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

ugcnetdec2015iii unix

Answer Keys
6.0.1 C 6.0.2 Q-Q 6.0.3 Q-Q 6.0.4 Q-Q 6.0.5 Q-Q
6.0.6 Q-Q 6.0.7 Q-Q 6.0.8 C 6.0.9 A 6.0.10 A
6.0.11 Q-Q 6.0.12 C 6.0.13 C 6.0.14 C 6.0.15 A
6.0.16 A 6.0.17 Q-Q 6.1.1 Q-Q 6.1.2 D 6.1.3 D
6.2.1 C 6.2.2 D 6.2.3 D 6.2.4 D 6.2.5 D
6.2.6 D 6.2.7 Q-Q 6.2.8 Q-Q 6.2.9 Q-Q 6.3.1 A
6.4.1 D 6.4.2 A;D 6.5.1 Q-Q 6.5.2 Q-Q 6.5.3 Q-Q
6.6.1 Q-Q 6.6.2 Q-Q 6.6.3 A 6.6.4 A 6.6.5 B;D
6.6.6 B 6.6.7 Q-Q 6.6.8 Q-Q 6.6.9 C 6.6.10 Q-Q
6.6.11 Q-Q 6.7.1 Q-Q 6.7.2 B 6.8.1 C 6.8.2 Q-Q
6.9.1 B 6.10.1 A OR C 6.11.1 Q-Q 6.11.2 D 6.11.3 Q-Q
6.11.4 D 6.11.5 D 6.11.6 X 6.11.7 Q-Q 6.12.1 D
6.13.1 A 6.14.1 D 6.14.2 C 6.15.1 Q-Q 6.15.2 Q-Q
6.15.3 Q-Q 6.16.1 B 6.17.1 Q-Q 6.18.1 A 6.18.2 B
6.18.3 Q-Q 6.18.4 Q-Q 6.19.1 Q-Q 6.19.2 Q-Q 6.19.3 Q-Q
6.19.4 Q-Q 6.19.5 Q-Q 6.19.6 Q-Q 6.19.7 B 6.19.8 C
6.19.9 B 6.19.10 Q-Q 6.19.11 Q-Q 6.19.12 Q-Q 6.20.1 D
6.20.2 C 6.20.3 B 6.20.4 A 6.20.5 B 6.20.6 C
6.21.1 Q-Q 6.22.1 D 6.23.1 Q-Q 6.23.2 Q-Q 6.23.3 D
6.24.1 B 6.25.1 Q-Q 6.25.2 C 6.25.3 C 6.25.4 B
6.25.5 C 6.25.6 Q-Q 6.26.1 D 6.27.1 D
7 Discrete Mathematics: Combinatory (14)

7.0.1 UGCNET-Dec2012-III: 25 https://gateoverflow.in/47411

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
ugcnetdec2012iii

7.0.2 UGCNET-June2014-II: 25 https://gateoverflow.in/54053

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. 50, 50, 14, 5 B. 51, 51, 15, 7

C. 52, 52, 14, 5 D. 51, 51, 14, 5
ugcnetjune2014ii combinatory

7.0.3 UGCNET-Dec2015-II: 1 https://gateoverflow.in/61435

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 ugcnetdec2015ii

7.0.4 UGCNET-Jan2017-II: 4 https://gateoverflow.in/158417

How many multiples of 6 are there between the following pairs of numbers ?

0 and 100 and –6 and 34

(1) 16 and 6

(2) 17 and 6

(3) 17 and 7

(4) 16 and 7

7.0.5 UGCNET-June-2019-II: 2 https://gateoverflow.in/316277

How many ways are there to place 8 indistinguishable balls into four distinguishable bins?

A. 70 B. 165 C. 8 C4 D. 8 P4
ugcnetjune2019ii combinatory

7.1 Binary Tree (1)

7.1.1 Binary Tree: UGCNET-June2016-III: 31 https://gateoverflow.in/63952

The number of different binary trees with 6 nodes is

A. 6 B. 42 C. 132 D. 256
ugcnetjune2016iii combinatory binary-tree

7.2 Counting (2)

 7.2.1 Counting: UGCNET-June2015-II: 1 https://gateoverflow.in/60894

How many strings of 5 digits have the property that the sum of their digits is 7?

A. 66 B. 330 C. 495 D. 99
ugcnetjune2015ii discrete-mathematics counting

7.2.2 Counting: UGCNET-June2015-II: 3 https://gateoverflow.in/60896

In how many ways can 15 indistinguishable fish be placed into 5 different ponds, so that each pond contains at least
one fish?

A. 1001 B. 3876 C. 775 D. 200

ugcnetjune2015ii combinatory counting

7.3 Discrete Mathematics (2)

7.3.1 Discrete Mathematics: UGCNET-Dec2013-II: 38 https://gateoverflow.in/60231

If n and r are non-negative integers and n ≥ r, then p(n+1, r) equals to

P(n,r)(n+1) P(n,r)(n+1)
A. (n+1−r)
B. (n−1+r)
P(n,r)(n−1) P(n,r)(n+1)
C. (n+1−r)
D. (n+1+r)
ugcnetdec2013ii discrete-mathematics combinatory

7.3.2 Discrete Mathematics: UGCNET-Oct2020-II: 2 https://gateoverflow.in/349671

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. 4 B. 6 C. 7 D. 9
ugcnet-oct2020-ii discrete-mathematics combinatory

7.4 Euler Phi Function (1)

7.4.1 Euler Phi Function: UGCNET-June-2019-II: 63 https://gateoverflow.in/316216

Consider the Euler’s phi function given by

1
ϕ(n) = n Π ( (1– ) )
p/n p

where p runs over all the primes dividing n. What is the value of ϕ(45)?

A. 3 B. 12 C. 6 D. 24
ugcnetjune2019ii euler-phi-function

7.5 Inclusion Exclusion (1)

7.5.1 Inclusion Exclusion: UGCNET-June-2019-II: 3 https://gateoverflow.in/316276

How many bit strings of length ten either start with a 1 bit or end with two bits 00 ?

A. 320 B. 480 C. 640 D. 768

ugcnetjune2019ii combinatory inclusion-exclusion

7.6 Pigeonhole Principle (1)

7.6.1 Pigeonhole Principle: UGCNET-June-2019-II: 7 https://gateoverflow.in/316272

How many cards must be selected from a standard deck of 52 cards to guarantee that at least three hearts are present
among them?

A. 9 B. 13 C. 17 D. 42
 ugcnetjune2019ii combinatory pigeonhole-principle

7.7 Recurrence (1)

7.7.1 Recurrence: UGCNET-Dec2012-II: 10 https://gateoverflow.in/56513

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
ugcnetdec2012ii combinatory recurrence

Answer Keys
7.0.1 C 7.0.2 A 7.0.3 B 7.0.4 Q-Q 7.0.5 B
7.1.1 C 7.2.1 B 7.2.2 A 7.3.1 A 7.3.2 D
7.4.1 D 7.5.1 C 7.6.1 D 7.7.1 D
8 Discrete Mathematics: Graph Theory (46)

8.0.1 UGCNET-Dec2007-II: 2 https://gateoverflow.in/335782

The number of edges in a complete graph with ‘n′ vertices is equal to :

n(n−1)
A. n(n − 1) B. 2 C. n2 D. 2n − 1
ugcnetdec2007ii

8.0.2 UGCNET-June-2019-II: 5 https://gateoverflow.in/316274

For which values of m and n does the complete bipartite graph km,n have a Hamiltonian circuit ?

A. m ≠ n, m, n ≥ 2 B. m ≠ n, m, n ≥ 3
C. m = n, m, n ≥ 2 D. m = n, m, n ≥ 3
ugcnetjune2019ii graph-theory

8.0.3 UGCNET-Dec2015-II: 2 https://gateoverflow.in/61437

Which of the following statement(s) is/are false?

a. A connected multigraphb.has
A an
connected
Euler Circuit
multigraph
if andc.has
only
A an
complete
if Euler
each of
Path
graph
its but
vertices
(Knot
n) has
d.
an
has
Euler
Aa even
Hamilton
cycle
Circuit
degree.
overCircuit
six
if and
vertices
only if(CCodes
whenever n≥
it6)has
is :3.a bipartite
not
exactly two vertices
graph but
of odd
a comple
degre

A. a only B. b and c C. c only D. d only

graph-theory ugcnetdec2015ii

8.0.4 UGCNET-Dec2014-II: 03 https://gateoverflow.in/58444

Consider the Graph shown below :

This graph is a _________.

A. Complete Graph B. Bipartite Graph
C. Hamiltonian Graph D. All of the above
ugcnetdec2014ii graph-theory

8.0.5 UGCNET-Dec2015-II: 4 https://gateoverflow.in/61658

Consider the graph given below:

The two distinct set of vertices, which make the graph bipartite are

A. (v1 , v4 , v6 ); (v2 , v3 , v5 , v7 , v8 )
B. (v1 , v7 , v8 ); (v2 , v3 , v5 , v6 )
C. (v1 , v4 , v6 , v7 ); (v2 , v3 , v5 , v8 )
D. (v1 , v4 , v6 , v7 , v8 ); (v2 , v3 , v5 )

ugcnetdec2015ii graph-theory

8.0.6 UGCNET-June2013-II: 45 https://gateoverflow.in/58051

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
ugcnetjune2013ii

8.0.7 UGCNET-June2013-II: 5 https://gateoverflow.in/57859

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

ugcnetjune2013ii graph-theory

8.0.8 UGCNET-June2014-III: 65 https://gateoverflow.in/57580

Given the following statements :

S1 : The subgraph-isomorphism problem takes two graphs G1 and G2 and asks whether G1 is a subgraph of G2 .
S2 : The set-partition problem takes as input a set S of numbers and asks whether the numbers can be partitioned into two sets
A and Ā = S − A such that
∑x ∑x
=
x∈A x ∈ Ā
Which of the following is true ?

A. S1 is NP problem and S2 is P problem.

B. S1 is NP problem and S2 is NP problem.
C. S1 is P problem and S2 is P problem.
D. S1 is P problem and S2 is NP problem.

ugcnetjune2014iii graph-theory

8.0.9 UGCNET-June2013-II: 37 https://gateoverflow.in/50044

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 ugcnetjune2013ii

8.0.10 UGCNET-June2013-II: 43 https://gateoverflow.in/58047

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

ugcnetjune2013ii

8.0.11 UGCNET-dec2008-ii-2 https://gateoverflow.in/155026

The graph K3,4 has:

A. 3 edges B. 4 edges
C. 7 edges D. 12 edges
ugcnetdec2008ii graph-theory

8.0.12 UGCNET-Dec2006-II: 3 https://gateoverflow.in/335668

The number of edges in a complete graph with N vertices is equal to :

A. N(N − 1) B. 2N − 1 C. N − 1 D. N(N − 1)/2

ugcnetdec2006ii
8.0.13 UGCNET-Dec2004-II: 4 https://gateoverflow.in/335393

The following lists are the degrees of all the vertices of a graph :

i. 1, 2, 3, 4, 5
ii. 3, 4, 5, 6, 7
iii. 1, 4, 5, 8, 6
iv. 3, 4, 5, 6

A. (i) and (ii) B. (iii) and (iv) C. (iii) and (ii) D. (ii) and (iv)
ugcnetdec2004ii

8.0.14 UGCNET-Dec2004-II: 23 https://gateoverflow.in/335374

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
ugcnetdec2004ii

8.0.15 UGCNET-June2013-II: 38 https://gateoverflow.in/45085

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

ugcnetjune2013ii

8.0.16 UGCNET-june2009-ii-12 https://gateoverflow.in/154270

The complete graph with four vertices has k edges where k is :

A. 3
B. 4
C. 5
D. 6

ugcnetjune2009ii

8.0.17 UGCNET-July-2018-II: 81 https://gateoverflow.in/225805

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. O (E ∗ f) B. O (E 2 ∗ f) C. O (E ∗ f 2 ) D. O (E 2 ∗ f 2 )
ugcnetjuly2018ii graph-theory

8.0.18 UGCNET-dec2009-ii-02 https://gateoverflow.in/152689

Circle has ____________

(A) No vertices

(B) Only 1 vertex

(C) ∞ vertices

(D) None of these

ugcnetdec2009ii graph-theory
 8.0.19 UGCNET-june2008-ii-4 https://gateoverflow.in/155561

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

ugcnetjune2008ii

8.0.20 UGCNET-june2009-ii-23 https://gateoverflow.in/154364

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)
ugcnetjune2009ii

8.1 Binary Tree (1)

8.1.1 Binary Tree: UGCNET-Nov2017-iii-31 https://gateoverflow.in/166407

Consider a full binary tree with n internal nodes, internal path length I , and external path length e. 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. e = i + n B. e = i + 2n C. e = 2i + n D. e = 2n + i
ugcnetnov2017-iii data-structures binary-tree

8.2 Discrete Mathematics (2)

8.2.1 Discrete Mathematics: UGCNET-Dec2013-III: 39 https://gateoverflow.in/60572

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
ugcnetdec2013iii engineering-mathematics discrete-mathematics graph-theory

8.2.2 Discrete Mathematics: UGCNET-June2015-II: 5 https://gateoverflow.in/60900

Consider a Hamiltonian Graph(G) with no loops and parallel edges. Which of the following is true with respect to this
graph (G)?

a. deg(v) ≥ n/2 for eachb.vertex

∣E(G) ∣≥ 1/2(n − 1)(n
of G c. −
deg(v)
2) + 2+ edges
deg(w) ≥ n for every v and ω not connected by an edge

A. a and b B. b and c C. a and c D. a, b, and c

ugcnetjune2015ii discrete-mathematics graph-theory

8.3 Euler Graph (2)

8.3.1 Euler Graph: UGCNET-AUG2016-II: 5 https://gateoverflow.in/69380

Given the following graphs :

(G1 ) (G2 )
 Which of the following is correct ?

A. G1 contains Euler circuit and (G2 ) does not contain Euler circuit.
B. (G1 ) does not contain Euler circuit and (G2 ) contains Euler circuit.
C. Both (G1 ) and (G2 ) do not contain Euler circuit.
D. Both (G1 ) and (G2 ) contain Euler circuit.

ugcnetaug2016ii graph-theory euler-graph

8.3.2 Euler Graph: UGCNET-Dec2010-II: 2 https://gateoverflow.in/66493

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
ugcnetdec2010ii graph-theory euler-graph

8.4 Flow Network (1)

8.4.1 Flow Network: UGCNET-June-2019-II: 69 https://gateoverflow.in/316210

Consider the following properties with respect to a flow network G = (V , E) in which a flow is a real-valued function
f : V × V → R:
P1 : For all u, v, ∈ V , f(u, v) = −f(v, u)
P2 : Σ f(u, v) = 0 for all u ∈ V
v∈V
Which one of the following is/are correct?

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

ugcnetjune2019ii flow-network

8.5 Graph (1)

8.5.1 Graph: UGCNET-dec2009-ii-22 https://gateoverflow.in/152858

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
ugcnetdec2009ii graph graph-theory

8.6 Graph Coloring (2)

8.6.1 Graph Coloring: UGCNET-Jan2017-II: 5 https://gateoverflow.in/335158

Consider a Hamiltonian Graph G with no loops or parallel edges and with |V (G)| = n ≥ 3 . The which of the
following is true?

A. deg (v) ≥ n2 for each vertex v

B. |E (G)| ≥ 12 (n − 1) (n − 2) + 2
C. deg (v) + deg (w) ≥ n whenever v and w are not connected by an edge
D. All of the above

ugcnetjan2017ii graph-theory graph-coloring

8.6.2 Graph Coloring: UGCNET-June2012-II: 4 https://gateoverflow.in/55606

The number of colours required to properly colour the vertices of every planer graph is
 A. 2 B. 3 C. 4 D. 5
ugcnetjune2012ii graph-theory graph-coloring

8.7 Graph Connectivity (8)

8.7.1 Graph Connectivity: UGCNET-AUG2016-II: 22 https://gateoverflow.in/69567

Consider an undirected graph G where self-loops are not allowed. The vertex set of G is
(i, j)|1 ≤ i ≤ 12, 1 ≤ j ≤ 12 . There is an edge between (a, b) and (c, d) if |a– c| ≤ 1 or |b– d| ≤ 1 . The number of
edges in this graph is

A. 726 B. 796 C. 506 D. 616

ugcnetaug2016ii graph-theory graph-connectivity

8.7.2 Graph Connectivity: UGCNET-DEC2016-II: 5 https://gateoverflow.in/115602

Consider a Hamiltonian Graph G with no loops or parallel edges and with |V (G)| = n ≥ 3. Then which of the
following is true?

A. deg(v) ≥ n/2 for each vertex v

B. |E(G)| ≥ 1/2(n − 1)(n − 2) + 2
C. deg(v) + deg(w) ≥ n whenever v and w are not connected by an edge
D. All of the above

ugcnetdec2016ii graph-theory graph-connectivity

8.7.3 Graph Connectivity: UGCNET-Dec2010-II: 4 https://gateoverflow.in/66495

The minimum number of edges in a connected graph with ‘n′ vertices is equal to
n(n−1)
A. n(n– 1) B. 2 C. n2 D. n– 1
ugcnetdec2010ii graph-theory graph-connectivity

8.7.4 Graph Connectivity: UGCNET-Dec2011-II: 5 https://gateoverflow.in/62941

Maximum number of edges in a n -Node undirected graph without self loop is

A. n2 B. n(n– 1)
C. n(n + 1) D.
n(n−1)
2
ugcnetdec2011ii graph-theory graph-connectivity

8.7.5 Graph Connectivity: UGCNET-Dec2014-II: 15 https://gateoverflow.in/63079

McCabe’s cyclomatic metric V (G) of a graph G with n vertices, e edges and p connected component is

A. e B. n
C. e– n + p D. e– n + 2p
ugcnetdec2011ii graph-theory graph-connectivity

8.7.6 Graph Connectivity: UGCNET-June2013-III: 15 https://gateoverflow.in/58280

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

A. Each pair of vertices in V1 is connected by an edge

B. If (u, v) ∈ E then u ∈ V1 and v ∈ V1
C. If (u, v) ∈ E then u ∈ V1 or v ∈ V1
D. All pair of vertices in V1 are not connected by an edge

ugcnetjune2013iii graph-theory graph-connectivity

8.7.7 Graph Connectivity: UGCNET-Sep2013-II: 22 https://gateoverflow.in/59074

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. Σki=1 C(ni , 2) edges
ugcnetsep2013ii graph-theory graph-connectivity

8.7.8 Graph Connectivity: UGCNET-Sep2013-II: 8 https://gateoverflow.in/59014

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

8.8 Graph Isomorphism (1)

8.8.1 Graph Isomorphism: UGCNET-June2014-II: 21 https://gateoverflow.in/54036

Consider the graph given below as :

Which one of the following graph is isomorphic to the above graph ?

C. D.
A. B.
ugcnetjune2014ii graph-theory non-gate graph-isomorphism

8.9 Graph Planarity (2)

8.9.1 Graph Planarity: UGCNET-Dec2012-III: 46 https://gateoverflow.in/57708

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
ugcnetdec2012iii graph-theory graph-planarity

8.9.2 Graph Planarity: UGCNET-June2012-III: 72 https://gateoverflow.in/56427

 G1 and G2 are two graphs as shown:
A. Both G1 and G2 are planar graphs B. Both G1 and G2 are not planar graphs
C. G1 is planar and G2 is not planar D. G1 is not planar and G2 is planar
ugcnetjune2012iii graph-theory graph-planarity

8.10 Hamiltonian Graph (1)

8.10.1 Hamiltonian Graph: UGCNET-June2014-II: 23 https://gateoverflow.in/54046

Consider a complete bipartite graph km,n . For which values of m and n does this, complete graph have a Hamilton
circuit
A. m = 3, n = 2 B. m = 2, n = 3
C. m = n > 2 D. m = n > 3
ugcnetjune2014ii graph-theory hamiltonian-graph

8.11 Handshaking Theorem (1)

8.11.1 Handshaking Theorem: UGCNET-June-2019-II: 4 https://gateoverflow.in/316275

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. 6 B. 8 C. 12 D. 20
ugcnetjune2019ii graph-planarity handshaking-theorem

8.12 Minimum Spanning Trees (1)

8.12.1 Minimum Spanning Trees: UGCNET-June2015-II: 21 https://gateoverflow.in/60973

Consider the given graph

Its Minimum Cost Spanning Tree is ______

A.
B. C. D.
ugcnetjune2015ii graph-theory minimum-spanning-trees

8.13 Non Planar (1)

8.13.1 Non Planar: UGCNET-Dec2013-II: 39 https://gateoverflow.in/60240

A graph is non-planar if and only if it contains a subgraph homomorphic to

A. K3,2 or K5 B. K3,3 or K6
C. K3,3 or K5 D. K2,3 or K5
ugcnetdec2013ii graph-theory non-planar

8.14 Trees (2)

8.14.1 Trees: UGCNET-Dec2012-II: 33 https://gateoverflow.in/57070

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

ugcnetdec2012ii graph-theory trees graph-connectivity

8.14.2 Trees: UGCNET-Dec2013-II: 36 https://gateoverflow.in/12063

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. nt
ugcnetdec2013ii data-structures trees

Answer Keys
8.0.1 Q-Q 8.0.2 C 8.0.3 D 8.0.4 C 8.0.5 C
8.0.6 A 8.0.7 B 8.0.8 B 8.0.9 D 8.0.10 B
8.0.11 Q-Q 8.0.12 Q-Q 8.0.13 Q-Q 8.0.14 Q-Q 8.0.15 C
8.0.16 Q-Q 8.0.17 Q-Q 8.0.18 Q-Q 8.0.19 Q-Q 8.0.20 Q-Q
8.1.1 B 8.2.1 C 8.2.2 D 8.3.1 Q-Q 8.3.2 Q-Q
8.4.1 A 8.5.1 Q-Q 8.6.1 D 8.6.2 C 8.7.1 Q-Q
8.7.2 Q-Q 8.7.3 Q-Q 8.7.4 D 8.7.5 D 8.7.6 C
8.7.7 B 8.7.8 C 8.8.1 C 8.9.1 A 8.9.2 D
8.10.1 C 8.11.1 B 8.12.1 B 8.13.1 C 8.14.1 D
8.14.2 B
9 Discrete Mathematics: Mathematical Logic (30)

9.0.1 UGCNET-June2013-II: 39 https://gateoverflow.in/12017

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. (p ∨ q∧⌉r) ∨ (p ∧ q ∧ r) ∧ (⌉p ∧ q ∨ r)
B. (p ∧ q ∨ r) ∧ (p ∧ q ∧ r) ∨ (⌉q∧⌉q∧⌉r)
C. (p ∧ q∧⌉r) ∨ (p∧⌉q ∧ r) ∨ (⌉p ∧ q ∧ r)
D. (p ∨ r ∧ q) ∨ (p ∧ q ∧ r) ∨ (⌉p ∧ q ∧ r)

ugcnetjune2013ii

9.0.2 UGCNET-Dec2014-III: 57 https://gateoverflow.in/61013

The resolvent of the set of clauses (A ∨ B, ∼ A ∨ D, C∨ ∼ B) is

A. A∨ B B. C∨ D
C. A∨ C D. A∨ D
ugcnetdec2014iii mathematical-logic

9.0.3 UGCNET-Jan2017-II: 2 https://gateoverflow.in/335161

Match the following :

List – I List – II
a. Absurd i. Clearly impossible being contrary to some evident truth.
b. Ambiguous ii. Capable of more than one interpretation or meaning.
c. Axiom iii. An assertion that is accepted and used without a proof.
d. Conjecture iv. An opinion preferably based on some experience or wisdom.

Codes:

a b c d
A. i ii iii iv
B. i iii iv ii
C. ii iii iv i
D. ii i iii iv
ugcnetjan2017ii mathematical-logic

9.0.4 UGCNET-June2013-II: 40 https://gateoverflow.in/47607

The truth value of the statements:

∃!xP (x) → ∃xP (x) and ∃!x⌉P (x) →⌉∀xP (x), (where the notation ∃!xP (x) denotes the proposition “There exists a
unique x such that P (x) is true”) are:

A. True and False B. False and True C. False and False D. True and True
ugcnetjune2013ii

9.0.5 UGCNET-Sep2013-III: 67 https://gateoverflow.in/47609

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
ugcnetsep2013iii
9.0.6 UGCNET-Nov-2017-III: 70 https://gateoverflow.in/221692

Consider a Takagi - Sugeno - Kang (TSK) Model consisting of rules of the form :
If x1 is A i1 and ... and xr is A ir
THEN y =fi (x1, x 2, ..., x r) = b i0+bi1 x1+.....+birxr assume, αi is the matching degree of rule i, then the total output of the model
is given by :
(1) y = ∑L
i=1 α i fi (x1, x2,....., xr)
(2) y = ∑L L
i=1 α i fi (x1,x2,....., xr)/∑i=1 α i
(3) y = ∑L L
i=1 fi (x1,x2,....., xr)/∑i=1 α i
(4) y = maxi [αi fi (x1,x2,....., xr)]

9.0.7 UGCNET-june2009-ii-25 https://gateoverflow.in/154368

The prepositional formula given by the tree :

is :

A. ˄˅x2˅x1¬x1¬x1 B. (x2˅¬x2)˄(x1˅x2)
C. (¬x1˅x2)˄(¬x1˅x2) D. None
ugcnetjune2009ii

9.0.8 UGCNET-Dec2012-III: 60 https://gateoverflow.in/57734

The transform which posses ‘multi-resolution’ property is

A. Fourier transform B. Short-time Fourier transform
C. Wavelet transform D. Karhunen-Loere transform
ugcnetdec2012iii engineering-mathematics

9.0.9 UGCNET-DEC2016-II: 2 https://gateoverflow.in/115597

Match the following :

List-I List-II
a. Absurd i.
Clearly impossible being contrary to
some evident truth
b. Ambiguous ii. Capable of more than one interpretation
or meaning
c. Axiom iii. An assertion that is accepted and
used without a proof
d. Conjecture iv. An opinion preferably based on some
experience or wisdom
Codes :
A. a-i; b-ii; c-iii; d-iv B. a-i; b-iii; c-iv; d-ii
C. a-ii; b-iii; c-iv; d-i D. a-ii; b-i; c-iii; d-iv
ugcnetdec2016ii mathematical-logic

9.0.10 UGCNET-June2015-II: 8 https://gateoverflow.in/60946

"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 c, b, r, p for propositions of computations, electric bills, out of
money and the power respectively. (Where ¬ means NOT).

A. if (c ∧ b) → r and ¬b → ¬p, then (¬r ∧ p) → ¬c

B. if (c ∨ b) → rand ¬b → ¬p, then (r ∧ p) → c
C. if (c ∧ b) → r and ¬p → ¬b, then (¬r ∨ p) → ¬c
 D. if (c ∨ b) → r and ¬b → ¬p, then (¬r ∧ p) → ¬c

ugcnetjune2015ii mathematical-logic

9.0.11 UGCNET-Dec2014-III: 55 https://gateoverflow.in/61010

Equivalent logical expression for the Well Formed Formula (WFF) ,

∼ (∀x)F [x]
is
A. ∀x(∼ F [x]) B. ∼ (∃x)F [x]
C. ∃x(∼ F [x]) D. ∀xF [x]
ugcnetdec2014iii mathematical-logic

9.0.12 UGCNET-June2015-III: 22 https://gateoverflow.in/61234

The casual form of the disjunctive normal form ¬A ∨ ¬B ∨ ¬C ∨ D is:

A. A∧B∧C ⇒D
B. A ∨ B ∨ C ∨ D ⇒ true
C. A ∧ B ∧ C ∧ D ⇒ true
D. A ∧ B ∧ C ∧ D ⇒ false

ugcnetjune2015iii mathematical-logic

9.0.13 UGCNET-Dec2015-II: 9 https://gateoverflow.in/62228

Consider the compund propositions given below as:

a. p∨ ∼ (p ∧ q) b. (p∧ ∼ q)∨ ∼ (p ∧ q) c. p ∧ (q ∨ r) Which of the above propositions are tautologies

A. a and c B. b and c C. a and b D. a, b, and c

ugcnetdec2015ii mathematical-logic

9.1 Discrete Mathematics (2)

9.1.1 Discrete Mathematics: UGCNET-June2014-III: 32 https://gateoverflow.in/56792

________ 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

9.1.2 Discrete Mathematics: UGCNET-Nov2017-ii-8 https://gateoverflow.in/166242

Let P and Q be two propositions ¬(P ↔ Q) is equivalent to

A. P ↔ ¬Q B. ¬P ↔ Q
C. ¬P ↔ ¬Q D. Q → P
ugcnetnov2017-ii discrete-mathematics mathematical-logic

9.2 First Order Logic (2)

9.2.1 First Order Logic: UGCNET-June2014-II: 19 https://gateoverflow.in/53497

The notation ∃!xP (x) denotes the proposition “there exists a unique x such that P (x) is true”. Give the truth values of
the following statements :
I.∃!xP (x) → ∃xP (x)
II.∃!x¬P (x) → ¬∀xP (x)

A. Both I & II are true. B. Both I & II are false.

C. I - false, II - true D. I - true, II - false
ugcnetjune2014ii mathematical-logic first-order-logic
 9.2.2 First Order Logic: UGCNET-Sep2013-III: 1 https://gateoverflow.in/43111

Which of the following is a correct predicate logic statement for “Every Natural number has one successor”?

A. ∀x∃y(succ(x, y) ∧ (∃z succ(x, z) ⇒ equal(y, z)))

B. ∀x∃y(succ(x, y) ∨ (∃z succ(x, z) ⇒ equal(y, z)))
C. ∃x∀y(succ(x, y) ∧ (∃z succ(x, z) ⇒ equal(y, z)))
D. ∀x∃y(succ(x, y))

first-order-logic ugcnetsep2013iii

9.3 Functions (1)

9.3.1 Functions: UGCNET-July-2018-II: 87 https://gateoverflow.in/225799

Match the following in List-I and List-II, for a function f :

List-I List-II
(a) ∀ x ∀ y (f(x) = f(y) → x = y) (i) Constant
(b) ∀ y ∃ x (f(x) = y) (ii) Injective
(c) ∀ x f(x) = k (iii) Surjective
Code :
A. (a)-(i), (b)-(ii), (c)-(iii) B. (a)-(iii), (b)-(ii), (c)-(i)
C. (a)-(ii), (b)-(i), (c)-(iii) D. (a)-(ii), (b)-(iii), (c)-(i)
ugcnetjuly2018ii discrete-mathematics functions

9.4 Prolog (1)

9.4.1 Prolog: UGCNET-Dec2015-III: 7 https://gateoverflow.in/62437

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. 1 B. 2 C. 3 D. 4
ugcnetdec2015iii mathematical-logic prolog non-gate

9.5 Propositional Logic (11)

9.5.1 Propositional Logic: UGCNET-DEC2016-II: 6 https://gateoverflow.in/115604

In propositional logic, if (P → Q) ∧ (R → S) and (P ∨ R) are two premises such that Y is the premise:
(P → Q) ∧ (R → S)
P ∨R

A. P ∨ R B. P ∨ S C. Q ∨ R D. Q ∨ S
ugcnetdec2016ii mathematical-logic propositional-logic
9.5.2 Propositional Logic: UGCNET-Dec2006-II: 2 https://gateoverflow.in/335669

The proposition ~ q ∨ p is equivalent to :

A. B. C. D.

ugcnetdec2006ii mathematical-logic propositional-logic

9.5.3 Propositional Logic: UGCNET-Dec2013-II: 34 https://gateoverflow.in/60224

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. ∀m∀nP (m, n),

II. ∃m∀nP (m, n)
A. Both I and II are true B. Both I and II are false
C. I-false & II-true D. I-true& II-false
ugcnetdec2013ii discrete-mathematics propositional-logic

9.5.4 Propositional Logic: UGCNET-Dec2015-III: 44 https://gateoverflow.in/62690

In propositional logic, given P and P → Q , we can infer ________

A. ∼ Q B. Q
C. P ∧ Q D. ∼ P ∧ Q
ugcnetdec2015iii propositional-logic mathematical-logic

9.5.5 Propositional Logic: UGCNET-Jan2017-II: 6 https://gateoverflow.in/335157

In propositional logic if (P → Q) ∧ (R → S) and (P ∨ R) are two premises such that

(P → Q) ∧ (R → S)
P ∨R
Y

Y is the premise :

A. P ∨ R B. P ∨ S C. Q ∨ R D. Q ∨ S
ugcnetjan2017ii discrete-mathematics propositional-logic

9.5.6 Propositional Logic: UGCNET-June-2019-II: 6 https://gateoverflow.in/316273

Which of the following is principal conjunctive normal form for [(p ∨ q) ∧ ¬p → ¬q] ?

A. p ∨ ¬q B. p ∨ q
C. ¬p ∨ q D. ¬p ∨ ¬q
ugcnetjune2019ii propositional-logic

9.5.7 Propositional Logic: UGCNET-June-2019-II: 8 https://gateoverflow.in/316271

Match List-I with List-II:

List-I List-II
(a) p→q (i) ⌉(q →⌉p)
(b) p∨q (ii) p∧⌉q
(c) p∧q (iii) ⌉p → q
(d) ⌉(p → q) (iv) ⌉p ∨ q

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)

ugcnetjune2019ii propositional-logic

9.5.8 Propositional Logic: UGCNET-June2014-II: 20 https://gateoverflow.in/53503

Give a compound proposition involving propositions p, q and r that is true when exactly two of p, q and r are true and
is false otherwise

A. (p ∨ q ∧ ¬r) ∧ (p ∧ ¬q ∧ r) ∧ (¬p ∧ q ∧ r)
B. (p ∧ q ∧ ¬r) ∧ (p ∨ q ∧ ¬r) ∧ (¬p ∧ q ∧ r)
C. (p ∧ q ∧ ¬r) ∨ (p ∧ ¬q ∧ r) ∧ (¬p ∧ q ∧ r)
D. (p ∧ q ∧ ¬r) ∨ (p ∧ ¬q ∧ r) ∨ (¬p ∧ q ∧ r)

ugcnetjune2014ii mathematical-logic propositional-logic

9.5.9 Propositional Logic: UGCNET-June2015-II: 10 https://gateoverflow.in/60952

Consider a proposition given as:

x ≥ 6 , if x2 ≥ 25 and and its proof as:
If x ≥ 6 , then x2 = x. x ≥ 6.6 = 36 ≥ 25
Which of the following is correct with respect to the given proposition and its proof?

a. The proof shows the converse

b. The proof starts by assuming
c. Thewhat
proof
is is
to correct
be shownand there is nothing wrong

A. a only B. c only C. a and b D. b only

ugcnetjune2015ii discrete-mathematics propositional-logic

9.5.10 Propositional Logic: UGCNET-June2015-II: 9 https://gateoverflow.in/60948

Match the following :

List-I List-II
(a) (p → q) ⇔ (¬q → ¬p) (i) Contrapositive
(b) [(p ∧ q) → r] ⇔ [p → (q → r)] (ii) Exportation law
(c) (p → q) ⇔ [(p ∧ ¬q) → o] (iii) Reduction as absurdum
(d) (p ↔ q) ⇔ [(p → q) ∧ (q → p)] (iv) Equivalence
Codes :
A. (a)-(i), (b)-(ii), (c)-(iii), (d)-(iv) B. (a)-(ii), (b)-(iii), (c)-(i), (d)-(iv)
C. (a)-(iii), (b)-(ii), (c)-(iv), (d)-(i) D. (a)-(iv), (b)-(ii), (c)-(iii), (d)-(i)
ugcnetjune2015ii mathematical-logic propositional-logic

9.5.11 Propositional Logic: UGCNET-Sep2013-II: 24 https://gateoverflow.in/59076

The quantification ∃!xP (x) 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. ∃xP (x) ∨ ∀x∀y((P (x) ∨ P (y)) → x = y)

B. ∀xP (x) ∧ ∀x∀y((P (x) ∨ P (y)) → x = y)
C. ∃xP (x) ∧ ∀x∀y((P (x) ∧ P (y)) → x = y)
D. ∃xP (x) ∧ ∀x∀y((P (x) ∨ P (y)) → x = y)

ugcnetsep2013ii discrete-mathematics propositional-logic

Answer Keys
9.0.1 C 9.0.2 B 9.0.3 A 9.0.4 D 9.0.5 D
9.0.6 Q-Q 9.0.7 Q-Q 9.0.8 C 9.0.9 Q-Q 9.0.10 A
9.0.11 C 9.0.12 A 9.0.13 X 9.1.1 B 9.1.2 A;B
9.2.1 A 9.2.2 A 9.3.1 Q-Q 9.4.1 A 9.5.1 Q-Q
9.5.2 Q-Q 9.5.3 C 9.5.4 B 9.5.5 D 9.5.6 A
9.5.7 D 9.5.8 D 9.5.9 C 9.5.10 A 9.5.11 C
10 Discrete Mathematics: Set Theory & Algebra (22)

10.0.1 UGCNET-June-2019-II: 9 https://gateoverflow.in/316270

Find the zero-one matrix of the transitive closure of the relation given by the matrix A :

⎡1 0 1⎤
A = ⎢0 1 0⎥
⎣1 1 0⎦

⎡1 1 1⎤
A. ⎢ 0 1 0⎥
⎣1 1 1⎦
⎡1 0 1⎤
B. ⎢ 0 1 0⎥
⎣1 1 0⎦
⎡1 0 1⎤
C. ⎢ 0 1 0⎥
⎣1 0 1⎦
⎡1 1 1⎤
D. ⎢ 0 1 0⎥
⎣1 0 1⎦

ugcnetjune2019ii set-theory&algebra

10.0.2 UGCNET-Dec2004-II: 2 https://gateoverflow.in/335395

If f(x) = x + 1 and g(x) = x + 3 then f0f0f0f is :

A. g B. g + 1 C. g 4 D. None of these
ugcnetdec2004ii

10.0.3 UGCNET-june2006-5 https://gateoverflow.in/156107

Let A = {x | -1<x<1} = B. The function f(x)=x/2 from A to B is:

(A) injective
(B) surjective
(C) both injective and surjective
(D) neither injective nor surjective
set-theory&algebra

10.1 Boolean (1)

10.1.1 Boolean: UGCNET-June-2019-II: 13 https://gateoverflow.in/316266

How many different Boolean functions of degree n are the

n n
A. 22 B. (22 )n C. 22 − 1 D. 2n
ugcnetjune2019ii boolean function

10.2 Complement In Fuzzy Set (1)

10.2.1 Complement In Fuzzy Set: UGCNET-June2014-III: 07 https://gateoverflow.in/101046

Given
U = {1, 2, 3, 4, 5, 6, 7}A = {(3, 0.7), (5, 1), (6, 0.8)}
~
then A will be: (where ∼→ complement)
 A. {(4, 0.7), (2, 1), (1, 0.8)} B. {(4, 0.3), (5, 0), (6, 0.2)}
C. {(1, 1), (2, 1), (3, 0.3), (4, 1), (6, 0.2), (7, 1)} D. {(3, 0.3), (6, 0.2)}
ugcnetjune2014iii fuzzy-sets complement-in-fuzzy-set

10.3 Discrete Mathematics (1)

10.3.1 Discrete Mathematics: UGCNET-June2016-II: 1 https://gateoverflow.in/63098

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
ugcnetjune2016ii discrete-mathematics set-theory&algebra

10.4 Euler Phi Function (1)

10.4.1 Euler Phi Function: UGCNET-June-2019-II: 70 https://gateoverflow.in/316209

Consider the following statements:

S1 : For any integer n > 1, aϕ(n) ≡ 1(mod n) for all a ∈ Zn∗ , where ϕ(n) is Euler’s phi function.
S2 : If p is prime, then ap ≡ 1(mod p) for all a ∈ Zp∗ .
Which one of the following is/are correct?

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

ugcnetjune2019ii euler-phi-function set-theory&algebra

10.5 Factors (2)

10.5.1 Factors: UGCNET-DEC2016-II: 4 https://gateoverflow.in/115601

How many multiples of 6 are there between the following pairs of numbers?
0 and 100 and −6 and 34

A. 16 and 6 B. 17 and 6 C. 17 and 7 D. 16 and 7

ugcnetdec2016ii set-theory&algebra factors

10.5.2 Factors: UGCNET-Jan2017-II: 4 https://gateoverflow.in/335159

How many multiples of 6 are there between the following pairs of numbers?

0 and 100 and −6 and 34

A. 1 and 6 B. 17 and 6 C. 17 and 7 D. 16 and 7

ugcnetjan2017ii set-theory&algebra factors

10.6 Function Composition (1)

10.6.1 Function Composition: UGCNET-Dec2013-II: 37 https://gateoverflow.in/60229

Let f and g be the functions from the set of integers defined by f(x) = 2x + 3 and g(x) = 3x + 2 . 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
ugcnetdec2013ii algebra function-composition

10.7 Functions (4)

10.7.1 Functions: UGCNET-DEC2016-II: 3 https://gateoverflow.in/115600

The functions mapping R into R are defined as:

f(x) = x3 − 4x, g(x) = 1/(x2 + 1) and h(x) = x4
Then find the value of the following composite functions: hog(x) and hogof(x)
2 4 3
( +1 [( − 4x 2 + 1 4
( 2
+1 4
[( 3
− 4x 2 + 1 −4
 A. (x2 + 1)4 and [(x3 − 4x)2 + 1]4 B. (x2 + 1)4 and [(x3 − 4x)2 + 1]−4
C. (x2 + 1)−4 and [(x3 − 4x)2 + 1]4 D. (x2 + 1)−4 and [(x3 − 4x)2 + 1]−4
ugcnetdec2016ii functions set-theory&algebra

10.7.2 Functions: UGCNET-Dec2014-II: 05 https://gateoverflow.in/58783

If we define the functions f , g and h that map R into R by :

−−−−−
f(x) = x4 , g(x) = √x2 + 1, h(x) = x2 + 72 , then the value of the composite functions ho(gof) and (hog)of are
given as
A. x8 − 71 and x8 − 71 B. x8 − 73 and x8 − 73
C. x8 + 71 and x8 + 71 D. x8 + 73 and x8 + 73
ugcnetdec2014ii discrete-mathematics functions

10.7.3 Functions: UGCNET-Jan2017-II: 3 https://gateoverflow.in/335160

The functions mapping R into R are defined as :

f (x) = x3 − 4x, g (x) = 1
x2 +1
and h (x) = x4 .
Then find the value of the following composite functions :
ho g (x) and ho go f (x)
4
A. (x2 + 1) and [(x3 − 4x) + 1]
4 2

−4
B. (x2 + 1) and [(x3 − 4x) + 1]
4 2

4
and [(x2 − 4x) + 1]
−4 2
C. (x2 + 1)
−4
and [(x3 − 4x) + 1]
−4 2
D. (x2 + 1)

ugcnetjan2017ii functions set-theory&algebra

10.7.4 Functions: UGCNET-Sep2013-II: 25 https://gateoverflow.in/41920

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

10.8 Inclusion Exclusion (1)

10.8.1 Inclusion Exclusion: UGCNET-Oct2020-II: 1 https://gateoverflow.in/349672

The number of positive integers not exceeding 100 that are either odd or the square of an integer is _______

A. 63 B. 59 C. 55 D. 50
ugcnet-oct2020-ii discrete-mathematics inclusion-exclusion

10.9 Poset (1)

10.9.1 Poset: UGCNET-June-2019-II: 1 https://gateoverflow.in/316278

Consider the poset ({3, 5, 9, 15, 24, 45}, ∣).

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

ugcnetjune2019ii poset set-theory&algebra

10.10 Power Set (1)

 10.10.1 Power Set: UGCNET-Dec2012-II: 4 https://gateoverflow.in/56502

The power set of the set {Φ} is

A. {Φ} B. {Φ, {Φ}}

C. {0} D. {0, Φ, {Φ}}
ugcnetdec2012ii set-theory&algebra sets power-set

10.11 Relational Algebra (1)

10.11.1 Relational Algebra: UGCNET-dec2008-ii-12 https://gateoverflow.in/155035

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:

1. reflexive
2. symmetric
3. transitive
4. not reflexive, not symmetric and not transitive

ugcnetdec2008ii set-theory&algebra relational-algebra

10.12 Relations (4)

10.12.1 Relations: UGCNET-Dec2009-ii-01 https://gateoverflow.in/152685

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

ugcnetdec2009ii set-theory&algebra relations

10.12.2 Relations: UGCNET-June2010-II: 1 https://gateoverflow.in/67601

"x1 is a clone of x" means x1 is identical to x 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
ugcnetjune2010ii set-theory&algebra relations

10.12.3 Relations: UGCNET-June2013-II: 34 https://gateoverflow.in/58037

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
ugcnetjune2013ii relations set-theory&algebra

10.12.4 Relations: UGCNET-June2016-II: 3 https://gateoverflow.in/57078

Suppose that R1 and R2 are reflecive relations on a set A. Which of the following statements is correct?

A. R1 ∩ R2 is reflexive and R1 ∪ R2 is irreflexive

B. R1 ∩ R2 is irreflexive and R1 ∪ R2 is reflexive
C. Both R1 ∩ R2 and R1 ∪ R2 are reflexive
D. Both R1 ∩ R2 and R1 ∪ R2 are irreflexive
 ugcnetjune2016ii discrete-mathematics relations

Answer Keys
10.0.1 A 10.0.2 Q-Q 10.0.3 Q-Q 10.1.1 A 10.2.1 C
10.3.1 C 10.4.1 A 10.5.1 Q-Q 10.5.2 C 10.6.1 A
10.7.1 Q-Q 10.7.2 D 10.7.3 D 10.7.4 A 10.8.1 C
10.9.1 D 10.10.1 B 10.11.1 Q-Q 10.12.1 Q-Q 10.12.2 Q-Q
10.12.3 B 10.12.4 C
11 Engineering Mathematics: Discrete Mathematics (49)

11.1 Boolean Function (1)

11.1.1 Boolean Function: UGCNET-AUG2016-II: 1 https://gateoverflow.in/69030

The Boolean function [∼ (∼ p ∧ q)∧ ∼ (∼ p∧ ∼ q)] ∨ (p ∧ r) is equal to the Boolean function :

A. q B. p ∧ r C. p ∨ q D. p
ugcnetaug2016ii discrete-mathematics boolean-function

11.2 Discrete Mathematics (19)

11.2.1 Discrete Mathematics: UGCNET-Dec2012-III: 20 https://gateoverflow.in/57386

The number of ways to distribute n distinguishable objects into k distinguishable boxes, so that ni objects are placed
into box i, i = 1, 2, … k equals which of the following?
n! n1 !+n2 !+⋯+nk !
A. n1 !+n2 !+⋯+nk ! B. n1 !n2 !…nk !
n1 ! n1 !n2 !…nk !
C. n1 !n2 !…nk ! D. n1 !−n2 !–n3 !⋯−nk !
ugcnetdec2012iii discrete-mathematics combinatory

11.2.2 Discrete Mathematics: UGCNET-Dec2012-III: 21 https://gateoverflow.in/57388

How many solutions do the following equations have?

x1 + x2 + x3 = 11
where x1 ≥ 1, x2 ≥ 2, x3 ≥ 3

A. C(7, 11) B. C(11, 3) C. C(14, 11) D. C(7, 5)

ugcnetdec2012iii discrete-mathematics combinatory

11.2.3 Discrete Mathematics: UGCNET-Dec2013-III: 24 https://gateoverflow.in/60442

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
ugcnetdec2013iii discrete-mathematics mathematical-logic

11.2.4 Discrete Mathematics: UGCNET-Dec2014-II: 01 https://gateoverflow.in/58202

Consider a set A = {1, 2, 3, … … . . , 1000} .

How many members of A shall be divisible by 3 or by 5 or by both 3 and 5?

A. 533 B. 599 C. 467 D. 66

ugcnetdec2014ii discrete-mathematics set-theory&algebra

11.2.5 Discrete Mathematics: UGCNET-Dec2015-II: 48 https://gateoverflow.in/62327

How many solutions are there for the equation x + y + z + u = 29 subject to the constraints that
x ≥ 1, y ≥ 2 z ≥ 3 and u ≥ 0 ?

A. 4960 B. 2600 C. 23751 D. 8855

ugcnetdec2015ii discrete-mathematics combinatory

11.2.6 Discrete Mathematics: UGCNET-Dec2015-II: 6 https://gateoverflow.in/55853

Which of the following arguments are not valid ?

2
a. "If Gora gets the job andb.works
"Either
hard,
Puneet
thenishenot
will
guilty
be
c. promoted.
IfornPankaj
is a real
ifisGora
number
telling
gets
the
such n >then
promotion,
truth. 1 ,isthen
thatPankaj he
notwill >
be 1happy.
telling
n the
. Suppose
truth, n2 >
Hetherefore,
will
that not 1happy,
bePuneet
, thenisn > guilty."
1
therefore,
not eith

A. aB.
andbC.
canda,b,
D.
c and
a and
cb
 ugcnetdec2015ii discrete-mathematics mathematical-logic

11.2.7 Discrete Mathematics: UGCNET-Dec2015-II: 7 https://gateoverflow.in/62224

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:
a. ∀m∀nP(m, n) , b. ∀nP(1, n)
c. ∃m∀nP(m, n)
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
ugcnetdec2015ii discrete-mathematics mathematical-logic

11.2.8 Discrete Mathematics: UGCNET-Jan2017-III: 59 https://gateoverflow.in/335179

Which of the following statements is true?

A. The sentence S is a logical consequence of S1 , … , Sn if and only if S1 ∧ S2 ∧ ⋯ ∧ Sn → S is satisfiable.

B. The sentence S is a logical consequence of S1 , … , Sn if and only if S1 ∧ S2 ∧ ⋯ ∧ Sn → S is valid.
C. The sentence S is a logical consequence of S1 , … , Sn if and only if S1 ∧ S2 ∧ ⋯ ∧ Sn ¬S is consistent.
D. The sentence S is a logical consequence of S1 , … , Sn if and only if S1 ∧ S2 ∧ ⋯ ∧ Sn ∧ S is inconsistent.

ugcnetjan2017iii discrete-mathematics mathematical-logic

11.2.9 Discrete Mathematics: UGCNET-July-2018-II: 86 https://gateoverflow.in/225800

If Ai = {−i, … , −2, −1, 0, 1, 2, … , i} then ∪∞

i=1 Ai is

A. Z B. Q C. R D. C
ugcnetjuly2018ii discrete-mathematics

11.2.10 Discrete Mathematics: UGCNET-June2012-III: 17 https://gateoverflow.in/56099

Let Q(x, y) denote “x+y=0” and let there be two quantifications given as

I. ∃y∀xQ(x, y)
II. ∀x∃yQ(x, y)

where x and y 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
ugcnetjune2012iii discrete-mathematics mathematical-logic

11.2.11 Discrete Mathematics: UGCNET-June2012-III: 50 https://gateoverflow.in/56301

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. 2n(n+1)/2 and 2n .3n(n−1)/2 B. 3n(n−1)/2 and 2n(n−1)

C. 2n(n+1)/2 and 3n(n−1)/2 D. 2n(n+1)/2 and 2n(n−1)/2
ugcnetjune2012iii discrete-mathematics set-theory&algebra

11.2.12 Discrete Mathematics: UGCNET-June2015-III: 24 https://gateoverflow.in/61237

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

ugcnetjune2015iii discrete-mathematics mathematical-logic

11.2.13 Discrete Mathematics: UGCNET-Oct2020-II: 26 https://gateoverflow.in/349647

Let G be a directed graph whose vertex set is the set of numbers from 1 to 100. There is an edge from a vertex i to a
vertex j if and only if either j = i + 1 or j = 3i. The minimum number of edges in a path in G from vertex 1 to
vertex 100 is ______

A. 23 B. 99 C. 4 D. 7
ugcnet-oct2020-ii discrete-mathematics graph-theory

11.2.14 Discrete Mathematics: UGCNET-Oct2020-II: 3 https://gateoverflow.in/349670

Which of the following pairs of propositions are not logically equivalent?

A. ((p → r) ∧ (q → r)) and ((p ∨ q) → r)

B. p ↔ q and (¬p ↔ ¬q)
C. ((p ∧ q) ∨ (¬p ∧ ¬q)) and p ↔ q
D. ((p ∧ q) → r) and ((p → r) ∧ (q → r))

ugcnet-oct2020-ii discrete-mathematics mathematical-logic

11.2.15 Discrete Mathematics: UGCNET-Oct2020-II: 37 https://gateoverflow.in/349636

I f f(x) = x is my friend, and p(x) = x is perfect, then correct logical translation of the statement “some of my
friends are not perfect” is ______
A. ∀x (f(x) ∧ ¬p(x)) B. ∃x (f(x) ∧ ¬p(x))
C. ¬(f(x) ∧ ¬p(x)) D. ∃x (¬f(x) ∧ ¬p(x))
ugcnet-oct2020-ii discrete-mathematics mathematical-logic

11.2.16 Discrete Mathematics: UGCNET-Oct2020-II: 38 https://gateoverflow.in/349635

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
ugcnet-oct2020-ii discrete-mathematics mathematical-logic

11.2.17 Discrete Mathematics: UGCNET-Oct2020-II: 53 https://gateoverflow.in/349620

Consider the following statements:

a. Any tree is 2-colorable b. A graph G has no cycles of even length if it is bipartite
c. A graph G is 2-colorable if is bipartite d. A graph G can be colored with d + 1 colors if d is the maximum
degree of any vertex in the graph G
e. A graph G can be colored with O(log ∣ v ∣) colors if it has Choose the correct answer from the options given below:
O(∣ v ∣) edges.
A. (c) and (e) are incorrect B. (b) and (c) are incorrect
C. (b) and (e) are incorrect D. (a) and (d) are incorrect
ugcnet-oct2020-ii discrete-mathematics graph-theory

11.2.18 Discrete Mathematics: UGCNET-Oct2020-II: 86 https://gateoverflow.in/349587

Let G be a simple undirected graph, TD be a DFS tree on G, and TB be the BFS tree on G. Consider the following
statements.
Statement I : No edge of G is a cross with respect to TD
Statement II : For every edge (u, v) of G, if u is at depth i and v is at depth j in TB then ∣i − j ∣= 1
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
 ugcnet-oct2020-ii discrete-mathematics graph-theory

11.2.19 Discrete Mathematics: UGCNET-dec2009-ii-04 https://gateoverflow.in/152693

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

ugcnetdec2009ii discrete-mathematics mathematical-logic

11.3 Equivalence Classes (1)

11.3.1 Equivalence Classes: UGCNET-July-2018-II: 89 https://gateoverflow.in/225797

Which of the following is an equivalence relation on the set of all functions from Z to Z?

A. {f, g) ∣ f(x) − g(x) = 1 ∀ x ∈ Z}

B. {f, g) ∣ f(0) = g(0) or f(1) = g(1)}
C. {f, g) ∣ f(0) = g(1) and f(1) = g(0)}
D. {f, g) ∣ f(x) − g(x) = k for some k ∈ Z}

ugcnetjuly2018ii discrete-mathematics equivalence-classes

11.4 First Order Logic (5)

11.4.1 First Order Logic: UGCNET-Dec2012-III: 58 https://gateoverflow.in/57733

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

ugcnetdec2012iii engineering-mathematics discrete-mathematics first-order-logic

11.4.2 First Order Logic: UGCNET-Jan2017-III: 60 https://gateoverflow.in/335178

The first order logic (FOL) statement ((R ∨ Q) ∧ (P ∨ ¬Q)) is equivalent to which of the following?

A. ((R ∨ ¬Q) ∧ (P ∨ ¬Q) ∧ (R ∨ P ))

B. ((R ∨ Q) ∧ (P ∨ ¬Q) ∧ (R ∨ P ))
C. ((R ∨ Q) ∧ (P ∨ ¬Q) ∧ (R ∨ ¬P ))
D. ((R ∨ Q) ∧ (P ∨ ¬Q) ∧ (¬R ∨ P ))

ugcnetjan2017iii discrete-mathematics first-order-logic

11.4.3 First Order Logic: UGCNET-July-2018-II: 77 https://gateoverflow.in/225809

Consider the following English sentence:

"Agra and Gwalior are both in India".
A sudent 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

ugcnetjuly2018ii discrete-mathematics first-order-logic

11.4.4 First Order Logic: UGCNET-June2013-III: 69 https://gateoverflow.in/58895

If we convert ∃u∀v∀x∃y(P (f(u), v, x, y) → Q(u, v, y)) to ∀v∀x(P (f(a), v, x, g(v, x)) → Q(a, v, g(v, x))). This
process is known as

A. Simplification B. Unification C. Skolemization D. Resolution

ugcnetjune2013iii discrete-mathematics first-order-logic

11.4.5 First Order Logic: UGCNET-Oct2020-II: 40 https://gateoverflow.in/349633

Consider the following argument with premise ∀x (P (x) ∨ Q(x)) and conclusion (∀x P (x)) ∧ (∀x Q(x))
(A) ∀x (P (x) ∨ Q(x)) Premise
(B) P (c) ∨ Q(c) Universal instantiation from (A)
(C) P (c) Simplification from (B)
(D) ∀x P (x) Universal Generalization of (C)
(E) Q(c) Simplification from (B)
(F) ∀x Q(x) Universal Generalization of (E)
(G) (∀x P (x)) ∧ (∀x Q(x)) Conjuction of (D) and (F)

A. This is a valid argument B. Steps (C) and (E) are not correct inferences
C. Steps (D) and (F) are not correct inferences D. Step (G) is not a correct inference
ugcnet-oct2020-ii discrete-mathematics first-order-logic

11.5 Functions (2)

11.5.1 Functions: UGCNET-Dec2011-II: 4 https://gateoverflow.in/62940

−−−−−−−
Domain and Range of the function Y = −√−2x + 3 is
3 3
A. x ≥ 2,y ≥0 B. x > 2,y ≤0
3 3
C. x ≥ 2,y ≤0 D. x ≤ 2,y ≤0
ugcnetdec2011ii discrete-mathematics functions

11.5.2 Functions: UGCNET-Dec2012-III: 19 https://gateoverflow.in/57384

Identify the following activation function:

Φ(V ) = Z + 1 , Z, X, Y are parameters.
1+exp(−x∗V +Y )

A. Step function B. Ramp function

C. Sigmoid function D. Gaussian function
ugcnetdec2012iii discrete-mathematics functions

11.6 Group Theory (2)

11.6.1 Group Theory: UGCNET-Dec2015-II: 10 https://gateoverflow.in/62230

Which of the following property/ies a Group G must hold, in order to be an Abelian group?

a. The distributive property

b. The commutative property
c. The symmetric property

A. aB.
andbC.
bandaD.
conly
b only
ugcnetdec2015ii discrete-mathematics set-theory&algebra group-theory

11.6.2 Group Theory: UGCNET-June2012-III: 67 https://gateoverflow.in/56422

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
ugcnetjune2012iii discrete-mathematics set-theory&algebra group-theory

11.7 Linear Programming (1)

11.7.1 Linear Programming: UGCNET-June2016-III: 70 https://gateoverflow.in/57163

Consider the statement

"Either −2 ≤ x ≤ −1 or 1 ≤ x ≤ 2 "
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
ugcnetjune2016iii linear-programming

11.8 Number Representation (1)

11.8.1 Number Representation: UGCNET-Dec2011-II: 34 https://gateoverflow.in/63901

Negative numbers cannot be represented in

A. Signed magnitude form B. 1′ s complement form
C. 2′ s complement form D. None of the above
ugcnetdec2011ii discrete-mathematics number-representation

11.9 Partial Order (2)

11.9.1 Partial Order: UGCNET-Dec2010-II: 3 https://gateoverflow.in/66494

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 (A) and (B) D. None of the above
ugcnetdec2010ii discrete-mathematics partial-order

11.9.2 Partial Order: UGCNET-July-2018-II: 90 https://gateoverflow.in/225796

Which of the following statements is true?

A. (Z, ≤) is not totally ordered

B. The set inclusion relation ⊆ is a partial ordering on the power set of a set S
C. (Z, ≠) is a poset
D. The directed graph is not a partial order

ugcnetjuly2018ii discrete-mathematics partial-order

11.10 Propositional Logic (9)

11.10.1 Propositional Logic: UGCNET-AUG2016-II: 2 https://gateoverflow.in/69033

Let us assume that you construct ordered tree to represent the compound proposition (∼ (p ∧ q)) ↔ (∼ p∨ ∼ q) .
Then, the prefix expression and post-fix expression determined using this ordered tree are given as _____ and
______ respectively.

A. ↔∼ ∧pq∨ ∼∼ pq, pq∧ ∼ p ∼ q ∼ ∨ ↔

B. ↔∼ ∧pq∨ ∼ p ∼ q, pq∧ ∼ p ∼ q ∼ ∨ ↔
C. ↔∼ ∧pq∨ ∼∼ pq, pq∧ ∼ p ∼∼ q∨ ↔
D. ↔∼ ∧pq∨ ∼ p ∼ q, pq∧ ∼ p ∼∼ q∨ ↔

ugcnetaug2016ii discrete-mathematics propositional-logic

11.10.2 Propositional Logic: UGCNET-AUG2016-III: 70 https://gateoverflow.in/71692

Let ν(x) mean x is a vegetarian, m(y) for y is meat, and e(x, y) for x eats y. Based on these, consider the following
sentences :
I. ∀x ∨ (x) ⇔ (∀ye(x, y) ⟹ ¬m(y))
II.∀x ∨ (x) ⇔ (¬(∃ym(y) ∧ e(x, y)))
III.∀x(∃ym(y) ∧ e(x, y)) ⇔ (x) ⇔ ¬ ∨ (x)
One can determine that
A. Only I and II are equivalent sentences B. Only II and III are equivalent sentences.
C. Only I and III are equivalent sentence . D. I, II, and III are equivalent sentences.
ugcnetaug2016iii discrete-mathematics propositional-logic

11.10.3 Propositional Logic: UGCNET-AUG2016-III: 74 https://gateoverflow.in/71707

Consider the following logical inferences :

I1 : If it is Sunday then school will not open.
The school was open.
Inference : It was not Sunday.
I2 : 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 I1 and I2 are correct inferences.

B. I1 is correct but I2 is not a correct inference.
C. I1 is not correct but I2 is a correct inference.
D. Both I1 and I2 are not correct inferences.

ugcnetaug2016iii discrete-mathematics propositional-logic

11.10.4 Propositional Logic: UGCNET-Dec2011-II: 43 https://gateoverflow.in/64180

The proposition ∼ qvp is equivalent to

A. p → q B. q → p
C. p ↔ q D. p ∨ q
ugcnetdec2011ii discrete-mathematics propositional-logic

11.10.5 Propositional Logic: UGCNET-Dec2012-III: 75 https://gateoverflow.in/57839

Let θ(x, y, z) be the statement “x+y=z” and let there be two quantification given as

I. ∀x∀y∃zθ(x, y, z)
II. ∃z∀x∀yθ(x, y, z)

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
ugcnetdec2012iii discrete-mathematics propositional-logic

11.10.6 Propositional Logic: UGCNET-Dec2015-II: 8 https://gateoverflow.in/62226

Match the following :

 List-I List-II
(a) Vacuous (i) A proof that the implication p → q is true based
proof on the fact that p is false.
(b) Trivial (ii) A proof that the implication p → q is true based
proof on the fact that q is true.
(c) Direct (iii) A proof that the implication p → q is true that proceeds
proof by showing that q must be true when p is true.
(d) Indirect (iv) A proof that the implication p → q is true that proceeds
proof by showing that p must be false when q is false.
Codes :
A. (a)-(i), (b)-(ii), (c)-(iii), (d)-(iv) B. (a)-(ii), (b)-(iii), (c)-(i), (d)-(iv)
C. (a)-(iii), (b)-(ii), (c)-(iv), (d)-(i) D. (a)-(iv), (b)-(iii), (c)-(ii), (d)-(i)
ugcnetdec2015ii discrete-mathematics propositional-logic

11.10.7 Propositional Logic: UGCNET-July-2018-II: 76 https://gateoverflow.in/225810

Consider the following statements:

a. False ⊨ True
b. If α ⊨ (β ∧ γ then α ⊨ γ

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

ugcnetjuly2018ii discrete-mathematics propositional-logic

11.10.8 Propositional Logic: UGCNET-June2015-III: 57 https://gateoverflow.in/61338

In propositional language P ↔ Q is equivalent to (where ∼ denotes NOT)

A. ∼ (P ∨ Q)∧ ∼ (Q ∨ P) B. (∼ P ∨ Q) ∧ (∼ Q ∨ P)
C. (P ∨ Q) ∧ (Q ∨ P) D. ∼ (P ∨ Q) →∼ (Q ∨ P)
ugcnetjune2015iii discrete-mathematics propositional-logic

11.10.9 Propositional Logic: UGCNET-Oct2020-II: 61 https://gateoverflow.in/349612

Consider the statement below.

A person who is radical (R) is electable (E) if he/she is conservative (C), but otherwise not electable.
Few probable logical assertions of the above sentence are given below.

A. (R ∧ E) ⇔ C B. R → (E ↔ C) D. (¬R ∨ ¬E ∨ C) ∧ (¬R ∨Which

C. R ⇒ ((C ⇒ E) ∨ ¬E) ¬C ∨ E)of the above
logical assertions are
true?
Choose the correct answer from the options given below:

A. (B) only B. (C) only C. (A) and (C) only D. (B) and (D) only
ugcnet-oct2020-ii discrete-mathematics propositional-logic

11.11 Quantifiers (1)

11.11.1 Quantifiers: UGCNET-July-2018-II: 85 https://gateoverflow.in/225801

The equivalence of ¬ ∃ x Q (x) is

A. ∃ x ¬ Q (x)
B. ∀ x ¬ Q (x)
C. ¬ ∃ x ¬ Q (x)
 ¬ ∃ x ¬ Q (x)
D. ∀ x Q (x)

ugcnetjuly2018ii discrete-mathematics quantifiers

11.12 Relations (2)

11.12.1 Relations: UGCNET-July-2018-II: 88 https://gateoverflow.in/225798

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)

ugcnetjuly2018ii discrete-mathematics relations

11.12.2 Relations: UGCNET-Oct2020-II: 39 https://gateoverflow.in/349634

Consider the following properties:

a. Reflexive b. Antisymmetric c. Symmetric L e t A = {a, b, c, d, e, f, g} and

R = {(a, a), (b, b), (c, d), (c, g), (d, g), (e, e), (f, f), (g, g)} be a relation on A. Which of the following property
(properties) is (are) satisfied by the relation R?

A. Only a B. Only c C. Both a and b D. b and not a

ugcnet-oct2020-ii discrete-mathematics set-theory&algebra relations

11.13 Sets (3)

11.13.1 Sets: UGCNET-AUG2016-II: 3 https://gateoverflow.in/69376

Let A and B be sets in a finite universal set U . Given the following : |A − B|, |A ⨁ B|, |A| + |B| and |A ∪ B|
Which of the following is in order of increasing size ?

A. |A − B| < |A ⨁ B| < |A| + |B| < |A ∪ B|

B. |A ⨁ B| < |A − B| < |A ∪ B| < |A| + |B|
C. |A ⨁ B| < |A| + |B| < |A − B| < |A ∪ B|
D. |A − B| < |A ⨁ B| < |A ∪ B| < |A| + |B|

ugcnetaug2016ii discrete-mathematics sets

11.13.2 Sets: UGCNET-Dec2012-III: 34 https://gateoverflow.in/57465

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
ugcnetdec2012iii engineering-mathematics discrete-mathematics sets

11.13.3 Sets: UGCNET-Dec2015-II: 3 https://gateoverflow.in/61438

Which of the following is/are not true ?

a. The set of negative integers

b. The
is countable.
set of integers that are
c. The
multiples
set of of
even
7 isintegers
countable.
d.is The
countable.
set of real numbers between 0 and 1⁄2 is countable.

A. aB.
andbC.
candbD.
donly
d only
ugcnetdec2015ii discrete-mathematics sets

Answer Keys
11.1.1 Q-Q 11.2.1 C 11.2.2 D 11.2.3 B 11.2.4 C
11.2.5 B 11.2.6 B 11.2.7 A 11.2.8 B 11.2.9 Q-Q

11.2.10 B 11.2.11 D 11.2.12 B 11.2.13 D 11.2.14 D

11.2.15 B 11.2.16 A 11.2.17 C 11.2.18 C 11.2.19 Q-Q
11.3.1 Q-Q 11.4.1 C 11.4.2 D 11.4.3 Q-Q 11.4.4 C
11.4.5 B 11.5.1 Q-Q 11.5.2 C 11.6.1 D 11.6.2 C
11.7.1 A 11.8.1 Q-Q 11.9.1 Q-Q 11.9.2 Q-Q 11.10.1 Q-Q
11.10.2 Q-Q 11.10.3 Q-Q 11.10.4 Q-Q 11.10.5 B 11.10.6 A
11.10.7 Q-Q 11.10.8 B 11.10.9 D 11.11.1 Q-Q 11.12.1 Q-Q
11.12.2 D 11.13.1 Q-Q 11.13.2 B 11.13.3 D
12 Engineering Mathematics: Linear Algebra (1)

12.0.1 UGCNET-Dec2004-II: 1 https://gateoverflow.in/335396

AV A = A is called :
A. Identity law B. De Morgan’s law
C. Idempotent law D. Complement law
ugcnetdec2004ii

Answer Keys
12.0.1 Q-Q
13 Engineering Mathematics: Probability (11)

13.0.1 UGCNET-Dec2007-II: 1 https://gateoverflow.in/335783

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 ?
3 4 5 6
A. 7 B. 7 C. 7 D. 7
ugcnetdec2007ii

13.1 Binary Tree (1)

13.1.1 Binary Tree: UGCNET-July-2018-II: 25 https://gateoverflow.in/225861

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

ugcnetjuly2018ii probability binary-tree data-structures

13.2 Poisson Distribution (1)

13.2.1 Poisson Distribution: UGCNET-Dec2011-II: 27 https://gateoverflow.in/63681

The multiuser operating system, 20 requests are made to use a particular resource per hour, on an average the
probability that no request are made in 45 minutes is

A. e−15 B. e−5 C. 1– e−5 D. 1– e−10

ugcnetdec2011ii probability poisson-distribution

13.3 Probability (8)

13.3.1 Probability: UGCNET-AUG2016-II: 4 https://gateoverflow.in/69377

What is the probability that a randomly selected bit string of length 10 is a palindrome ?
1 1 1 1
A. 64 B. 32 C. 8 D. 4
ugcnetaug2016ii probability

13.3.2 Probability: UGCNET-AUG2016-III: 54 https://gateoverflow.in/71602

An experimental file server is up 75% of the time and down for 25% of the time due to bugs. How many times does
this file server have to be replicated to give an availability of at least 99% ?

A. 2 B. 4 C. 8 D. 16
ugcnetaug2016iii probability

13.3.3 Probability: UGCNET-Dec2011-II: 49 https://gateoverflow.in/64192

What is the probability of choosing correctly an unknown integer between 0 and 9 with 3 chances ?
963 973 983 953
A. 1000 B. 1000 C. 1000 D. 1000
ugcnetdec2011ii probability

13.3.4 Probability: UGCNET-July-2018-II: 80 https://gateoverflow.in/225806

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

ugcnetjuly2018ii probability
 13.3.5 Probability: UGCNET-July-2018-II: 84 https://gateoverflow.in/225802

Digital data received from a sensor can fill up 0 to 32 buffers. Let the sample space be S = {0, 1, 2, … , 32} where
1 (33 − i) . Let A denote the event that the even number
the sample j denote that j of the buffers are full and p(i) = 562
of buffers are full. Then P (A) is

A. 0.515 B. 0.785 C. 0.758 D. 0.485

ugcnetjuly2018ii probability

13.3.6 Probability: UGCNET-June2015-II: 2 https://gateoverflow.in/60895

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?
22 12 14 6
A. B. C. D.
36 36 36 36
ugcnetjune2015ii probability

13.3.7 Probability: UGCNET-June2016-II: 4 https://gateoverflow.in/63101

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

ugcnetjune2016ii engineering-mathematics probability

13.3.8 Probability: UGCNET-Sep2013-III: 38 https://gateoverflow.in/44620

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 ugcnetsep2013iii

Answer Keys
13.0.1 Q-Q 13.1.1 Q-Q 13.2.1 A 13.3.1 Q-Q 13.3.2 Q-Q
13.3.3 Q-Q 13.3.4 Q-Q 13.3.5 Q-Q 13.3.6 C 13.3.7 B
13.3.8 A
14 General Aptitude: Quantitative Aptitude (25)

14.0.1 UGCNET-Nov2017-ii-1 https://gateoverflow.in/166235

If the time is now 4 O' clock, what will be the time 101 hours from now?

A. 9 O' clock B. 8 O' clock C. 5 O' clock D. 4 O' clock

ugcnetnov2017-ii

14.1 Data Interpretation (5)

14.1.1 Data Interpretation: UGCNET-Oct2020-I: 1 https://gateoverflow.in/349572

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:
Department Total No. of Percentage of Percentage of
Students Female Male
Computer 840 45 55
Civil 220 35 65
Mech. 900 23 77
Electrical 360 65 35
Electronics 450 44 56
Mining 540 40 60
What is the respective ratio of the number of females in Mechanical Department to the number of females in Electronics
Department?

A. 4 : 3 B. 23 : 22 C. 24 : 21 D. 23 : 21
ugcnet-oct2020-i general-aptitude quantitative-aptitude data-interpretation

14.1.2 Data Interpretation: UGCNET-Oct2020-I: 2 https://gateoverflow.in/349571

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:
Department Total No. of Percentage of Percentage of
Students Female Male
Computer 840 45 55
Civil 220 35 65
Mech 900 23 77
Electrical 360 65 35
Electronics 450 44 56
Mining 540 40 60
What is the total number of students in all the Departments?

A. 2210 B. 3210 C. 3400 D. 3310

ugcnet-oct2020-i general-aptitude quantitative-aptitude data-interpretation

14.1.3 Data Interpretation: UGCNET-Oct2020-I: 3 https://gateoverflow.in/349570

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:
 Department Total No. of Percentage of Percentage of
Students Female Male
Computer 840 45 55
Civil 220 35 65
Mech 900 23 77
Electrical 360 65 35
Electronics 450 44 56
Mining 540 40 60
What is the total number of male students in Computer and Mining Department together?

A. 266 B. 886 C. 786 D. 686

ugcnet-oct2020-i general-aptitude quantitative-aptitude data-interpretation

14.1.4 Data Interpretation: UGCNET-Oct2020-I: 4 https://gateoverflow.in/349569

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:
Department Total No. of Percentage of Percentage of
Students Female Male
Computer 840 45 55
Civil 220 35 65
Mech 900 23 77
Electrical 360 65 35
Electronics 450 44 56
Mining 540 40 60
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. 311 : 270 B. 329 : 261 C. 411 : 469 D. 311 : 269

ugcnet-oct2020-i general-aptitude quantitative-aptitude data-interpretation

14.1.5 Data Interpretation: UGCNET-Oct2020-I: 5 https://gateoverflow.in/349568

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:
Department Total No. of Percentage of Percentage of
Students Female Male
Computer 840 45 55
Civil 220 35 65
Mech 900 23 77
Electrical 360 65 35
Electronics 450 44 56
Mining 540 40 60
What is the average percentage of female students in the whole institute?

A. 42.0% B. 41.0% C. 43.0% D. 41.5%

ugcnet-oct2020-i general-aptitude quantitative-aptitude data-interpretation

14.2 Number System (1)

14.2.1 Number System: UGCNET-June2011-II: 1 https://gateoverflow.in/64198

Any integer composed of 3n identical digits divisible by

A. 2n B. 3n C. 5n D. 7n
 ugcnetdec2011ii quantitative-aptitude number-system

14.3 Percentage (1)

14.3.1 Percentage: UGCNET-Dec2015-II: 32 https://gateoverflow.in/62278

Suppose that from given statistics, it is known that meningitis causes stiff neck 50% of the time, that the proportion of
1 , and that the proportion od people having stiff neck is 1 . Then the percentage of
persons having meningitis is 50000 20
people who had meningtis and complain about stiff neck is:

A. 0.01% B. 0.02% C. 0.04% D. 0.05%

ugcnetdec2015ii quantitative-aptitude percentage

14.4 Quadratic Equations (1)

14.4.1 Quadratic Equations: UGCNET-Oct2020-II: 8 https://gateoverflow.in/349665

What is the radix of the numbers if the solution to the quadratic equation x2 − 10x + 26 = 0 is x = 4 and x = 7 ?

A. 8 B. 9 C. 10 D. 11
ugcnet-oct2020-ii quadratic-equations

14.5 Quantitative Aptitude (16)

14.5.1 Quantitative Aptitude: UGCNET-Dec2010-II: 1 https://gateoverflow.in/66492

The number of integers between 1 and 250 that are divisible by 2, 5 and 7 is

A. 2 B. 3 C. 5 D. 8
ugcnetdec2010ii quantitative-aptitude

14.5.2 Quantitative Aptitude: UGCNET-Dec2010-II: 5 https://gateoverflow.in/66496

Consider the problem of connecting 19 lamps to a single electric outlet by using extension cords each of which has
four outlets. The number of extension cords required is

A. 4 B. 5 C. 6 D. 7
ugcnetdec2010ii quantitative-aptitude

14.5.3 Quantitative Aptitude: UGCNET-Dec2012-II: 25 https://gateoverflow.in/11850

Suppose that someone starts with a chain letter. Each person who receives the letter is asked to send it on to 4 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. 122 & 22 B. 111 & 11 C. 133 & 33 D. 144 & 44

ugcnetdec2012ii quantitative-aptitude

14.5.4 Quantitative Aptitude: UGCNET-Dec2012-III: 29 https://gateoverflow.in/57453

58 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. 28 B. 29 C. 20 D. 19
ugcnetdec2012iii quantitative-aptitude

14.5.5 Quantitative Aptitude: UGCNET-Dec2014-II: 04 https://gateoverflow.in/58446

A computer program selects an integer in the set {k : 1 ≤ k ≤ 10, 00, 000} 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. 0.5 B. 0.704 C. 0.632121 D. 0.68

 ugcnetdec2014ii quantitative-aptitude

14.5.6 Quantitative Aptitude: UGCNET-July-2018-II: 75 https://gateoverflow.in/225811

Consider a vocabulary with only four propositions A, B, C and D. How many models are there for the following
sentence?
B∨C

A. 10 B. 12 C. 15 D. 16
ugcnetjuly2018ii quantitative-aptitude

14.5.7 Quantitative Aptitude: UGCNET-June-2019-I-22 https://gateoverflow.in/316157

For all integers y > 1, ⟨y⟩ = 2y + (2y − 1) + (2y − 2) + ⋯ + 1.

What is the value of ⟨3⟩ × ⟨2⟩? Where × is a multiplication operator?

A. 116 B. 210 C. 263 D. 478

ugcnetjune2019-i general-aptitude quantitative-aptitude

14.5.8 Quantitative Aptitude: UGCNET-June-2019-I-23 https://gateoverflow.in/316156

If 152 is divided into four parts proportional to 3, 4, 5 and 7, then the smallest part is

A. 29 B. 26 C. 25 D. 24
ugcnetjune2019-i general-aptitude quantitative-aptitude

14.5.9 Quantitative Aptitude: UGCNET-June-2019-I-24 https://gateoverflow.in/316155

In a new budget, the price of petrol rose by 25%. By how much percent must a person reduce his consumption so that
his expenditure on it does not increase?

A. 10% B. 15% C. 20% D. 25%

ugcnetjune2019-i general-aptitude quantitative-aptitude

14.5.10 Quantitative Aptitude: UGCNET-June-2019-I-25 https://gateoverflow.in/316154

A sum of money doubles at compound interest in 6 years. In how many years it will become 16 times?

A. 16 years B. 24 years C. 48 years D. 96 years

ugcnetjune2019-i general-aptitude quantitative-aptitude

14.5.11 Quantitative Aptitude: UGCNET-June-2019-I-27 https://gateoverflow.in/316152

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
ugcnetjune2019-i general-aptitude quantitative-aptitude

14.5.12 Quantitative Aptitude: UGCNET-June-2019-I-31 https://gateoverflow.in/316148

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 2012 to 2018. Answer the question based on the data contained in the table:
Sale of LED Television sets (in lakhs) of different sizes (in inches)
What was the approximate percentage increase/decrease in the sales of 32-inch LED Television sets in 2017 compared to that
in 2013?

A. 36% B. 56% C. 57% D. 64%

ugcnetjune2019-i general-aptitude quantitative-aptitude

14.5.13 Quantitative Aptitude: UGCNET-June-2019-I-32 https://gateoverflow.in/316147

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 2012 to 2018. Answer the question based on the data contained in the table:
Sale of LED Television sets (in lakhs) of different sizes (in inches)

For which size LED Television sets in the total sales of all seven years the maximum?
A. 22 – inch Television B. 24 – inch Television
C. 32 – inch Television D. 49 – inch Television
ugcnetjune2019-i general-aptitude quantitative-aptitude

14.5.14 Quantitative Aptitude: UGCNET-June-2019-I-33 https://gateoverflow.in/316146

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 2012 to 2018. Answer the question based on the data contained in the table:
Sale of LED Television sets (in lakhs) of different sizes (in inches)

What is the difference in the number of 40-inch Television sets sold in 2013 and 2018

A. 1, 600, 000 B. 1, 500, 000 C. 15, 000, 000 D. 16, 000, 000
ugcnetjune2019-i general-aptitude quantitative-aptitude

14.5.15 Quantitative Aptitude: UGCNET-June-2019-I-34 https://gateoverflow.in/316145

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 2012 to 2018. Answer the question based on the data contained in the table:
Sale of LED Television sets (in lakhs) of different sizes (in inches)
 What is the total sale of Television sets of size 49-inches (in lakhs) over all the seven years?

A. 912 B. 896 C. 879 D. 869

ugcnetjune2019-i general-aptitude quantitative-aptitude

14.5.16 Quantitative Aptitude: UGCNET-June-2019-I-35 https://gateoverflow.in/316144

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 2012 to 2018. Answer the question based on the data contained in the table:
Sale of LED Television sets (in lakhs) of different sizes (in inches)

For which LED Television set is the total sales of all the seven years the minimum?
A. 22 - inch Television B. 24 - inch Television
C. 49 - inch Television D. 40 - inch Television
ugcnetjune2019-i general-aptitude quantitative-aptitude

Answer Keys
14.0.1 A 14.1.1 B 14.1.2 D 14.1.3 C 14.1.4 D
14.1.5 A 14.2.1 Q-Q 14.3.1 B 14.4.1 D 14.5.1 B
14.5.2 Q-Q 14.5.3 C 14.5.4 D 14.5.5 C 14.5.6 Q-Q
14.5.7 B 14.5.8 D 14.5.9 C 14.5.10 B 14.5.11 C
14.5.12 B 14.5.13 C 14.5.14 A 14.5.15 D 14.5.16 D
15 General Aptitude: Verbal Aptitude (8)

15.0.1 UGCNET-July-2018-II: 79 https://gateoverflow.in/225807

A knowledge base contains just one sentence, ∃x AsHighAs (x, Everest). 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

ugcnetjuly2018ii verbal-aptitude

15.0.2 UGCNET-June-2019-I-28 https://gateoverflow.in/316151

‘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

ugcnetjune2019-i general-aptitude verbal-aptitude

15.0.3 UGCNET-June-2019-I-26 https://gateoverflow.in/316153

If the proposition ‘Houses are not bricks’ is taken to be False then which of the following propositions can be True?

A. All houses are bricks B. No house is brick C. Some houses are bricksD. Some houses are not bricksSelect the correct answer
from the options given
below:

A. b and c B. a and d C. b only D. c only

ugcnetjune2019-i general-aptitude verbal-aptitude

15.0.4 UGCNET-June-2019-I-21 https://gateoverflow.in/316158

Oar is to rowboat as foot is to

A. running B. sneaker C. skateboard D. jumping

ugcnetjune2019-i general-aptitude verbal-aptitude

15.1 Logical Reasoning (2)

15.1.1 Logical Reasoning: UGCNET-June-2019-I-29 https://gateoverflow.in/316150

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

ugcnetjune2019-i general-aptitude logical-reasoning

15.1.2 Logical Reasoning: UGCNET-June-2019-I-30 https://gateoverflow.in/316149

 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

ugcnetjune2019-i general-aptitude logical-reasoning

15.2 Quantitative Aptitude (2)

15.2.1 Quantitative Aptitude: UGCNET-June2013-III: 70 https://gateoverflow.in/58898

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
ugcnetjune2013iii quantitative-aptitude general-aptitude

15.2.2 Quantitative Aptitude: UGCNET-Oct2020-II: 80 https://gateoverflow.in/349593

Given below are two statements:

Statement I : 5 divides n5 − n wherever n is a nonnegative integer
Statement II : 6 divides n3 − n whenever n is a nonnegative integer
In the light of the above statements, choose the correct 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

ugcnet-oct2020-ii general-aptitude quantitative-aptitude

Answer Keys
15.0.1 Q-Q 15.0.2 B 15.0.3 D 15.0.4 C 15.1.1 B
15.1.2 A 15.2.1 D 15.2.2 A
16 Non GATE: Artificial Intelligence (44)

16.0.1 UGCNET-June2016-III: 66 https://gateoverflow.in/360640

A perceptron has input weights W1 = −3.9 and W2 = 1.1 with threshold value T = 0.3. What output does it give
for the input x1 = 1.3 and x2 = 2.2?

A. −2.65 B. −2.30 C. 0 D. 1
ugcnetjune2016iii

16.0.2 UGCNET-June2016-III: 75 https://gateoverflow.in/360639

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
ugcnetjune2016iii

16.1 Artificial Intelligence (14)

16.1.1 Artificial Intelligence: UGCNET-Dec2013-III: 26 https://gateoverflow.in/60548

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
ugcnetdec2013iii artificial-intelligence

16.1.2 Artificial Intelligence: UGCNET-Dec2015-III: 46 https://gateoverflow.in/62695

Language model used in LISP is

A. Functional programming B. Logic programming
C. Object oriented programming D. All of the above
ugcnetdec2015iii artificial-intelligence

16.1.3 Artificial Intelligence: UGCNET-Dec2015-III: 64 https://gateoverflow.in/62736

Consider the two class classification task that consists of the following points:
Class C1 : [−1, −1], [−1, 1], [1, −1]
Class C2 : [1, 1]
The decision boundary between the two classes C1 and C2 using single perception is given by:
A. x1 − x2 − 0.5 = 0 B. −x1 − x2 − 0.5 = 0
C. 0.5(x1 + x2 ) − 1.5 = 0 D. x1 + x2 − 0.5 = 0
ugcnetdec2015iii artificial-intelligence

16.1.4 Artificial Intelligence: UGCNET-July-2018-II: 71 https://gateoverflow.in/225815

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

ugcnetjuly2018ii artificial-intelligence
16.1.5 Artificial Intelligence: UGCNET-July-2018-II: 72 https://gateoverflow.in/225814

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

ugcnetjuly2018ii artificial-intelligence

16.1.6 Artificial Intelligence: UGCNET-July-2018-II: 73 https://gateoverflow.in/225813

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

available for a problem and none of them dominates any of the others, which should we choose?
A. h(n) = max{h1 (n), … , hm (n)} B. h(n) = min{h1 (n), … , hm (n)}
C. h(n) = avg{h1 (n), … , hm (n)} D. h(n) = sum{h1 (n), … , hm (n)}
ugcnetjuly2018ii artificial-intelligence

16.1.7 Artificial Intelligence: UGCNET-July-2018-II: 74 https://gateoverflow.in/225812

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

a. A∗ expands all nodes with f(n) < C ∗

b. A∗ expands no nodes with f(n) ≥ C ∗
c. Pruning is integral to A∗

Here, C ∗ 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

ugcnetjuly2018ii artificial-intelligence

16.1.8 Artificial Intelligence: UGCNET-June2012-III: 21 https://gateoverflow.in/56218

A∗ algorithm uses f ′ = g + h′ to estimate the cost of getting from the initial state to the goal state, where g is a
measure of cost getting from initial state to the current node and the function h′ 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. g = 1 B. g = 0 C. h′ = 0 D. h′ = 1
ugcnetjune2012iii artificial-intelligence

16.1.9 Artificial Intelligence: UGCNET-June2014-III: 28 https://gateoverflow.in/56783

Match the following :

List – I List – II
a. Expert systems i. Pragmatics
b. Planning ii. Resolution
c. Prolog iii. means-end analysis
d. Natural language processing iv. Explanation facility
Codes :
A. a-iii, b-iv, c-i, d-ii B. a-iii, b-iv, c-ii, d-i
C. a-i, b-ii, c-iii, d-iv D. a-iv, b-iii, c-ii, d-i
ugcnetjune2014iii artificial-intelligence

16.1.10 Artificial Intelligence: UGCNET-June2014-III: 30 https://gateoverflow.in/56788

Slots and facets are used in

 A. Semantic Networks B. Frames C. Rules D. All of these
ugcnetjune2014iii artificial-intelligence

16.1.11 Artificial Intelligence: UGCNET-June2015-III: 23 https://gateoverflow.in/61235

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

ugcnetjune2015iii artificial-intelligence

16.1.12 Artificial Intelligence: UGCNET-June2015-III: 56 https://gateoverflow.in/61337

Match the following knowledge representation techniques with their applications :

List – I List – II
(a) Frames (i) Pictorial representation of objects, their
attributes and relationships
(b) Conceptual (ii) To describe real world stereotype events
dependencies
(c) Associative (iii) Record like structures for grouping
networks closely related knowledge
(d) Scripts (iv) Structures and primitives to
represent sentences
Codes :
A. (a)-(ii), (b)-(iv), (c)-(i), (d)-(ii) B. (a)-(iii), (b)-(iv), (c)-(ii), (d)-(i)
C. (a)-(iv), (b)-(iii), (c)-(i), (d)-(ii) D. (a)-(iv), (b)-(iii), (c)-(ii), (d)-(i)
ugcnetjune2015iii artificial-intelligence

16.1.13 Artificial Intelligence: UGCNET-June2015-III: 59 https://gateoverflow.in/61345

Match the following with respect to heuristic search techniques :

List – I List – II
(a) Steepest-acccent Hill
(i) Keeps track of all partial paths which can
Climbing be candiadate for further explaination
(b) Branch-and-bound(ii) Discover problem state(s) that satisfy
a set of constraints
(c) Constraint satisfaction (iii) Detects difference between current state
and goal state
(d) Means-end-analysis (iv) Considers all moves from current state
and selects best move
Codes :
A. (a)-(i), (b)-(iv), (c)-(iii), (d)-(ii) B. (a)-(iv), (b)-(i), (c)-(ii), (d)-(iii)
C. (a)-(iii), (b)-(iv), (c)-(i), (d)-(ii) D. (a)-(iv), (b)-(ii), (c)-(i), (d)-(iii)
ugcnetjune2015iii artificial-intelligence

16.1.14 Artificial Intelligence: UGCNET-Oct2020-II: 36 https://gateoverflow.in/349637

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
ugcnet-oct2020-ii non-gate artificial-intelligence

16.2 Artificial Neural Network (1)

 16.2.1 Artificial Neural Network: UGCNET-Dec2013-III: 30 https://gateoverflow.in/60556

An artificial neuron receives n inputs x1 , x2 , … , xn with weights w1 , w2 , … , wn 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. Σ wi B. Σ xi
C. Σ wi + Σ xi D. Σ wi ⋅ Σ xi
ugcnetdec2013iii machine-learning artificial-neural-network

16.3 Back Propagation (1)

16.3.1 Back Propagation: UGCNET-Dec2012-II: 46 https://gateoverflow.in/57131

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
ugcnetdec2012ii machine-learning data-mining back-propagation

16.4 Blocks World Problem (1)

16.4.1 Blocks World Problem: UGCNET-Sep2013-III: 5 https://gateoverflow.in/59505

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
ugcnetsep2013iii artificial-intelligence blocks-world-problem

16.5 Chaining (1)

16.5.1 Chaining: UGCNET-Dec2015-III: 8 https://gateoverflow.in/62438

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
ugcnetdec2015iii artificial-intelligence chaining

16.6 Expert System (2)

16.6.1 Expert System: UGCNET-Dec2012-III: 67 https://gateoverflow.in/57740

An expert system shell is an expert system without

A. domain knowledge B. explanation facility
C. reasoning with knowledge D. all of the above
ugcnetdec2012iii artificial-intelligence expert-system

16.6.2 Expert System: UGCNET-Dec2015-III: 45 https://gateoverflow.in/62693

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

ugcnetdec2015iii artificial-intelligence expert-system

16.7 Fuzzy Logic (1)

16.7.1 Fuzzy Logic: UGCNET-June-2019-II: 94 https://gateoverflow.in/316185

A fuzzy conjunction operator denoted as t(x, y) and a fuzzy disjunction operator denoted as s(x, y) form a dual pair if
they satisfy the condition:
A. t(x, y) = 1 − s(x, y) B. t(x, y) = s(1 − x, 1 − y)
 C. t(x, y) = 1 − s(1 − x, 1 − y) D. t(x, y) = s(1 + x, 1 + y)
ugcnetjune2019ii artificial-intelligence fuzzy-logic

16.8 Genetic Algorithms (1)

16.8.1 Genetic Algorithms: UGCNET-June-2019-II: 97 https://gateoverflow.in/316182

Consider the following:

a. Evolution b. Selection c. Reproduction d. 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

ugcnetjune2019ii artificial-intelligence genetic-algorithms

16.9 Heuristic Search (1)

16.9.1 Heuristic Search: UGCNET-Dec2013-III: 25 https://gateoverflow.in/60444

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
ugcnetdec2013iii artificial-intelligence heuristic-search

16.10 Linear Programming (1)

16.10.1 Linear Programming: UGCNET-Sep2013-III: 13 https://gateoverflow.in/59515

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
ugcnetsep2013iii artificial-intelligence linear-programming

16.11 Machine Learning (4)

16.11.1 Machine Learning: UGCNET-Dec2012-III: 73 https://gateoverflow.in/57836

Match the following:

1. The decision system receives
a. Supervised
rewards for its action at the end
learning
of 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

ugcnetdec2012iii machine-learning

16.11.2 Machine Learning: UGCNET-Dec2014-III: 72 https://gateoverflow.in/61526

Match the following learning modes w. r. t. 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. Reinforcement iii. Partial information about desired responses, or only “right” or “wrong” evaluative information
d. Unsupervised iv. No information about desired responses
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

ugcnetdec2014iii artificial-intelligence machine-learning

16.11.3 Machine Learning: UGCNET-June2012-III: 2 https://gateoverflow.in/56075

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

ugcnetjune2012iii artificial-intelligence machine-learning

16.11.4 Machine Learning: UGCNET-June2014-III: 09 https://gateoverflow.in/55793

Perceptron learning, Delta learning and LMS 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

16.12 Map Coloring (1)

16.12.1 Map Coloring: UGCNET-June2013-III: 71 https://gateoverflow.in/58899

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
ugcnetjune2013iii artificial-intelligence map-coloring

16.13 Means End (1)

16.13.1 Means End: UGCNET-Sep2013-III: 6 https://gateoverflow.in/59507

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

ugcnetsep2013iii artificial-intelligence means-end analysis

16.14 Minimax Procedure (1)

16.14.1 Minimax Procedure: UGCNET-June-2019-II: 91 https://gateoverflow.in/316188

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. 4 B. 7 C. 11 D. 12
ugcnetjune2019ii artificial-intelligence minimax-procedure

16.15 Neural Network (4)

16.15.1 Neural Network: UGCNET-Dec2012-III: 9 https://gateoverflow.in/57366

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

ugcnetdec2012iii artificial-intelligence neural-network

16.15.2 Neural Network: UGCNET-Jan2017-III: 72 https://gateoverflow.in/335166

T
A neuron with 3 inputs has the weight vector [ 0.2 −0.1 0.1 ] and a bias θ = 0. If the input vector is
T
X = [ 0.2 0.4 0.2 ] then the total input to the neuron is:

A. 0.20 B. 1.0 C. 0.02 D. −1.0

ugcnetjan2017iii artificial-intelligence neural-network

16.15.3 Neural Network: UGCNET-June-2019-II: 98 https://gateoverflow.in/316181

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
ugcnetjune2019ii artificial-intelligence neural-network

16.15.4 Neural Network: UGCNET-Sep2013-III: 28 https://gateoverflow.in/59848

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

A. w(n + 1) = w(n) + η[d(n) − y(n)] B. w(n + 1) = w(n) − η[d(n) − y(n)]
C. w(n + 1) = w(n) + η[d(n) − y(n)] ∗ x(n) D. w(n + 1) = w(n) − η[d(n) − y(n)] ∗ x(n)
ugcnetsep2013iii neural-network machine-learning

16.16 Planning (1)

16.16.1 Planning: UGCNET-July-2018-II: 78 https://gateoverflow.in/225808

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

ugcnetjuly2018ii planning

16.17 Prolog (2)

16.17.1 Prolog: UGCNET-June2013-III: 67 https://gateoverflow.in/58893

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):- !.
ugcnetjune2013iii artificial-intelligence prolog

16.17.2 Prolog: UGCNET-June2014-III: 14 https://gateoverflow.in/101050

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

16.18 Reinforcement Learning (1)

16.18.1 Reinforcement Learning: UGCNET-June-2019-II: 100 https://gateoverflow.in/316179

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
ugcnetjune2019ii artificial-intelligence reinforcement-learning

16.19 Searches (1)

16.19.1 Searches: UGCNET-June-2019-II: 92 https://gateoverflow.in/316187

Math List-I with List-II:

List-I List-II
(a) Greedy best-first (i) Minimal cost (p) + h(p)
(b) Lowest cost-first (ii) Minimal h(p)
(c) ∗
A algorithm (iii) Minimal cost (p)

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)
 ugcnetjune2019ii artificial-intelligence searches

16.20 Sigmoid Function (1)

16.20.1 Sigmoid Function: UGCNET-June-2019-II: 99 https://gateoverflow.in/316180

1
The value of the derivative of Sigmoid function given by f(x) = at x = 0 is
1 + e−2x
1 1
A. 0 B. 2 C. 4 D. ∞
ugcnetjune2019ii artificial-intelligence sigmoid-function

16.21 Strips (1)

16.21.1 Strips: UGCNET-June-2019-II: 93 https://gateoverflow.in/316186

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

ugcnetjune2019ii artificial-intelligence strips

Answer Keys
16.0.1 C 16.0.2 C 16.1.1 C 16.1.2 C 16.1.3 B
16.1.4 B 16.1.5 Q-Q 16.1.6 Q-Q 16.1.7 Q-Q 16.1.8 A
16.1.9 D 16.1.10 B 16.1.11 B 16.1.12 A 16.1.13 B
16.1.14 D 16.2.1 D 16.3.1 B 16.4.1 B 16.5.1 D
16.6.1 A 16.6.2 B 16.7.1 C 16.8.1 C 16.9.1 C
16.10.1 B 16.11.1 D 16.11.2 A 16.11.3 B 16.11.4 A
16.12.1 B 16.13.1 D 16.14.1 B 16.15.1 D 16.15.2 C
16.15.3 D 16.15.4 C 16.16.1 Q-Q 16.17.1 B 16.17.2 C
16.18.1 C 16.19.1 D 16.20.1 B 16.21.1 B
17 Non GATE: Big Data Systems (1)

17.1 Big Data Systems (1)

17.1.1 Big Data Systems: UGCNET-Oct2020-II: 13 https://gateoverflow.in/349660

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
ugcnet-oct2020-ii non-gate big-data-systems

Answer Keys
17.1.1 A
18 Non GATE: Cloud Computing (1)

18.1 Cloud Computing (1)

18.1.1 Cloud Computing: UGCNET-Oct2020-II: 58 https://gateoverflow.in/349615

Which of the following cloud concept/s is/are related to pooling and sharing of resources?

a. Virtual Memory b. Service c. Virtualization Choose the correct answer from the options given
below:

A. (c) only B. (a) and (b) only C. (a) only D. (b) only
ugcnet-oct2020-ii non-gate cloud-computing

Answer Keys
18.1.1 A
19 Non GATE: Computer Graphics (80)

19.1 2d Geometry (1)

19.1.1 2d Geometry: UGCNET-July-2018-II: 10 https://gateoverflow.in/225876

⎡2 0 2⎤
Consider the matrix M = ⎢ 0 1 1 ⎥ representing a set of planar (2D) geometric transformations in homogeneous
⎣0 0 1⎦
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)

ugcnetjuly2018ii computer-graphics 2d-geometry

19.2 2d Transformation (1)

19.2.1 2d Transformation: UGCNET-June-2019-II: 28 https://gateoverflow.in/316251

Consider the following statements regarding 2D transforms in computer graphics:

1 0
S1 : [ ] is a 2 × 2 matrix that reflects (mirrors) only 2D point about the X-axis.
0 −1
S2 : A 2 × 2 matrix which mirrors any 2D point about the X -axis, is a rotation matrix.
What can you say about the statements S1 and S2 ?
A. Both S1 and S2 are true B. Only S1 is true
C. Only S2 is true D. Both S1 and S2 are false
ugcnetjune2019ii 2d-transformation

19.3 3d Graphics (2)

19.3.1 3d Graphics: UGCNET-July-2018-II: 9 https://gateoverflow.in/225877

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

ugcnetjuly2018ii computer-graphics 3d-graphics

19.3.2 3d Graphics: UGCNET-June-2019-II: 29 https://gateoverflow.in/316250

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

ugcnetjune2019ii 3d-graphics

19.4 3d Rotation (1)

19.4.1 3d Rotation: UGCNET-Sep2013-III: 64 https://gateoverflow.in/59937

Consider the following transformation matrix for rotation(clockwise):

⎡ ⎤
[T] = ⎢
⎢
⎥
⎥
⎢ ⎥
 ⎡ cos θ sin θ 0 0⎤

[T] = ⎢
0⎥
⎢ ⎥
− sin θ cos θ 0
⎢ 0 0 1 0⎥
⎣ 0 0 0 1⎦
This matrix rotates an object by an angle θ about:

A. X-axis B. Y-axis C. Z-axis D. All of the above

ugcnetsep2013iii computer-graphics 3d-rotation

19.5 Animation (1)

19.5.1 Animation: UGCNET-Dec2014-III: 13 https://gateoverflow.in/60114

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
ugcnetdec2014iii computer-graphics animation non-gate

19.6 Anti Aliasing (1)

19.6.1 Anti Aliasing: UGCNET-Sep2013-III: 61 https://gateoverflow.in/59932

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
ugcnetsep2013iii computer-graphics anti-aliasing

19.7 Breshenmans Algorithm (1)

19.7.1 Breshenmans Algorithm: UGCNET-June2016-III: 13 https://gateoverflow.in/63712

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 (xi , yi ) and decision parameter is pi then what will be the next point (xi+1 , yi+1 ) and
updates decision parameter pi+1 for p ≥ 0 ?

A. xi+1 = xi + 1; yi+1 = yi ; pi+1 = pi + 4xi + 6

B. xi+1 = xi + 1; yi+1 = yi − 1; pi+1 = pi + 4(xi − yi ) + 10
C. xi+1 = xi ; yi+1 = yi − 1; pi+1 = pi + 4(xi − yi ) + 6
D. xi+1 = xi − 1; yi+1 = yi ; pi+1 = pi + 4xi + 10

ugcnetjune2016iii computer-graphics breshenmans-algorithm

19.8 Color Models (1)

19.8.1 Color Models: UGCNET-Sep2013-III: 62 https://gateoverflow.in/59933

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

ugcnetsep2013iii computer-graphics color-models

19.9 Computer Graphics (38)

19.9.1 Computer Graphics: UGCNET-Dec2012-III: 12 https://gateoverflow.in/57376

Let V1 = 2I − J + k and V2 = I + J − K , then the angle between V1 and V2 and a vector perpendicular to both V1
and V2 shall be
A. 90o and (−2I + J − 3K) B. 60o and (2I + J + 3K)
C. 90o and (2I + J − 3K) D. 90o and (−2I − J + 3K)
ugcnetdec2012iii computer-graphics

19.9.2 Computer Graphics: UGCNET-Dec2012-III: 33 https://gateoverflow.in/57463

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
ugcnetdec2012iii computer-graphics

19.9.3 Computer Graphics: UGCNET-Dec2012-III: 6 https://gateoverflow.in/57363

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

ugcnetdec2012iii computer-graphics

19.9.4 Computer Graphics: UGCNET-Dec2013-III: 62 https://gateoverflow.in/60785

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
ugcnetdec2013iii computer-graphics non-gate

19.9.5 Computer Graphics: UGCNET-Dec2013-III: 63 https://gateoverflow.in/60786

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

ugcnetdec2013iii computer-graphics non-gate

19.9.6 Computer Graphics: UGCNET-Dec2013-III: 64 https://gateoverflow.in/60787

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)

ugcnetdec2013iii computer-graphics non-gate

19.9.7 Computer Graphics: UGCNET-Dec2013-III: 65 https://gateoverflow.in/60789

The transformation required for conversion of CMY colour model to RGB colour model is given as:

⎡R⎤ ⎡C⎤ ⎡1⎤

A. ⎢ G ⎥ = ⎢ M ⎥ − ⎢ 2 ⎥
⎣B⎦ ⎣Y ⎦ ⎣3⎦

⎡ ⎤ ⎡ ⎤ ⎡ ⎤
⎢ ⎥=⎢ ⎥−⎢ ⎥
⎣ ⎦ ⎣ ⎦ ⎣ ⎦
 ⎡R⎤ ⎡C⎤ ⎡1⎤
B. ⎢ G ⎥ = ⎢ M ⎥ − ⎢ 2 ⎥
⎣B⎦ ⎣ Y ⎦ ⎣3⎦
⎡R⎤ ⎡1⎤ ⎡ C ⎤
C. ⎢ G ⎥ = ⎢ 1 ⎥ − ⎢ M ⎥
⎣B⎦ ⎣1⎦ ⎣ Y ⎦
⎡ R ⎤ ⎡ C ⎤ ⎡ 0.5 ⎤
D. ⎢ G ⎥ = ⎢ M ⎥ − ⎢ 0.5 ⎥
⎣ B ⎦ ⎣ Y ⎦ ⎣ 0.5 ⎦

ugcnetdec2013iii computer-graphics non-gate

19.9.8 Computer Graphics: UGCNET-Dec2013-III: 66 https://gateoverflow.in/60794

What steps shall be required to rotate an object from point P1 (as shown in fig. 1) and its placement such that what was
at P1 is now reduced and is at P2 (as shown in fig. 2)?

I. Translate P1 to origin
II. Scale as required
III. Rotate
IV. Translate to the final position P2
A. I, II and III B. II, III and IV C. I, III and IV D. All of the above
ugcnetdec2013iii computer-graphics non-gate

19.9.9 Computer Graphics: UGCNET-Dec2014-III: 15 https://gateoverflow.in/60120

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
ugcnetdec2014iii computer-graphics non-gate

19.9.10 Computer Graphics: UGCNET-Dec2015-III: 33 https://gateoverflow.in/62592

Which of the following graphic primitives are considered as the basic building blocks of computer graphics?

a. Points b. Lines c. Polylines d. Polygons

A. aB.
only
a,C.b, aand
D.
andac band c
ugcnetdec2015iii computer-graphics

19.9.11 Computer Graphics: UGCNET-Dec2015-III: 50 https://gateoverflow.in/62707

Which of the following is not a lossy compression technique?

A. JPEG B. MPEG C. FFT D. Arithmetic coding

ugcnetdec2015iii computer-graphics

19.9.12 Computer Graphics: UGCNET-Dec2015-III: 67 https://gateoverflow.in/62781

Which of the following is/are the principle components of a memory-tube display?

a. Flooding gun b. Collector c. Phosphorus grains d. Ground

A. aB.
andcC.
bonly
dD.only
All of the above
ugcnetdec2015iii computer-graphics
19.9.13 Computer Graphics: UGCNET-Dec2015-III: 69 https://gateoverflow.in/62784

Which raster locations would be chosen by Bresenham's algorithm when scan converting a line from (1, 1) to (8, 5)?

x y
1 1
2 2
3 3
A. 4 3
5 4
6 4
7 5
8 6
x y
1 1
2 2
3 2
B. 4 3
5 4
6 5
7 6
8 7
x y
1 1
2 2
3 2
C. 4 3
5 3
6 4
7 4
8 5
x y
1 1
2 2
3 2
D. 4 3
5 5
6 4
7 5
8 5

ugcnetdec2015iii computer-graphics

19.9.14 Computer Graphics: UGCNET-Dec2015-III: 70 https://gateoverflow.in/62785

1
Consider a unit square centered at origin. The coordinates at the square are translated by a factor ( , 1) and rotated
2
by an angle of 90∘ . What shall be the coordinates of the new square?

−1 −1 −3 −3
A. ( , 0), ( , 1), ( , 1), ( , 0)
2 2 2 2
−1 1 3 3
B. ( , 0), ( , 1), ( , 1), ( , 0)
2 2 2 2
( , 0), ( , 0), ( , 1), ( , 0)
 −1 1 −3 −3
C. ( , 0), ( , 0), ( , 1), ( , 0)
2 2 2 2
−1 1 −3 −3
D. ( , 0), ( , 1), ( , 1), ( , 0)
2 2 2 2

ugcnetdec2015iii computer-graphics

19.9.15 Computer Graphics: UGCNET-Jan2017-III: 16 https://gateoverflow.in/335222

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 d = 3 − 2r (where r is radius) B. Stop if x > y
C. If d < 0 , then d = 4x + 6 and x = x + 1 D. If d ≥ 0 , then d = 4 ∗ (x − y) + 10, x = x + 1 and y = y + 1
ugcnetjan2017iii non-gate computer-graphics

19.9.16 Computer Graphics: UGCNET-Jan2017-III: 17 https://gateoverflow.in/335221

Which of the following is/are side effects of scan conversion?

a. Aliasing b. Unequal intensity of diagonal

c. Overstriking
lines in photographic
d. Local
applications
or Global aliasing

A. a and b B. a,b and c C. a,c and d D. a,b,c and d

ugcnetjan2017iii non-gate computer-graphics

19.9.17 Computer Graphics: UGCNET-Jan2017-III: 18 https://gateoverflow.in/335220

Consider a line AB with A = (0, 0) and B = (8, 4) . Apply a simple DDA algorithm and compute the first four plots
on this line.
A. [(0, 0), (1, 1), (2, 1), (3, 2)] B. [(0, 0), (1, 1.5), (2, 2), (3, 3)]
C. [(0, 0), (1, 1), (2, 2.5), (3, 3)] D. [(0, 0), (1, 2), (2, 2), (3, 2)]
ugcnetjan2017iii non-gate computer-graphics

19.9.18 Computer Graphics: UGCNET-July-2018-II: 8 https://gateoverflow.in/225878

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
ugcnetjuly2018ii computer-graphics

19.9.19 Computer Graphics: UGCNET-June2012-III: 14 https://gateoverflow.in/56097

If the pixels of an image are shuffled then the parameter that may change is

A. Histogram B. Mean C. Entropy D. Covariance

ugcnetjune2012iii computer-graphics

19.9.20 Computer Graphics: UGCNET-June2012-III: 63 https://gateoverflow.in/56352

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-gate ugcnetjune2012iii

19.9.21 Computer Graphics: UGCNET-June2014-III: 01 https://gateoverflow.in/55773

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-gate computer-graphics

19.9.22 Computer Graphics: UGCNET-June2014-III: 02 https://gateoverflow.in/55775

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-gate computer-graphics

19.9.23 Computer Graphics: UGCNET-June2014-III: 03 https://gateoverflow.in/55776

Given below are certain output primitives and their associated attributes. Match each primitive with its corresponding
attributes :
List – I List – II
a. Line i. Type, Size, Color
b. Fill Area ii. Color, Size, Font
c. Text iii. Style, Color, Pattern
d. Marker iv. Type, Width, Color
Codes :
A. a-i, b-ii, c-iii, d-iv B. a-ii, b-i, c-iii, d-iv
C. a-iv, b-iii, c-ii, d-i D. a-iii, b-i, c-iv, d-ii
ugcnetjune2014iii non-gate computer-graphics

19.9.24 Computer Graphics: UGCNET-June2014-III: 04 https://gateoverflow.in/55781

Consider a window bounded by the lines : x = 0; y = 0; x = 5 and y = 3 . The line segment joining (−1, 0) and
(4, 5), if clipped against this window will connect the points
A. (0, 1) and (2, 3) B. (0, 1) and (3, 3)
C. (0, 1) and (4, 3) D. (0, 1) and (3, 2)
ugcnetjune2014iii non-gate geometry computer-graphics

19.9.25 Computer Graphics: UGCNET-June2014-III: 05 https://gateoverflow.in/55782

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-gate computer-graphics

19.9.26 Computer Graphics: UGCNET-June2015-III: 16 https://gateoverflow.in/61159

Which of the following is not a basic primitive of the Graphics Kernel System (GKS)?

A. POLYLINE B. POLYDRAW C. FILL AREA D. POLYMARKER

ugcnetjune2015iii computer-graphics
19.9.27 Computer Graphics: UGCNET-June2015-III: 17 https://gateoverflow.in/61161

Which of the following statements is/are incorrect?

a. Mapping the co-ordinates

b. of
Thetheright-handed
points and lines
cartesian
that
c. form
The
co-ordinates
co-ordinate
the picture
system
system
into the
in d.
whose
that
appropriate
Left-handed
corresponds
co-ordinates
co-ordinates
co-ordinate
to the
we describe
device
onsystem
the
orthe
device
workstation
inpicture
which
or workstation
isthe
where
known
display
the
asisworld
area
image
known
ofco-ord
isthe
as
to vi
b

A. aB.
only
aC.andcD.
bonly
d only
ugcnetjune2015iii computer-graphics

19.9.28 Computer Graphics: UGCNET-June2015-III: 18 https://gateoverflow.in/61164

Match the following :

List-I List-II
(a) Flood Gun (i)
An electron gun designed to flood the
entire screen with electrons.
(b) Collector (ii) Partly energized by flooding gun, stores
the charge generated by the writing gun.
(c) Ground (iii) Used to discharge the collector.
(d) Phosphorous Grains (iv) Used in memory - tube display and similar
to those used in standard CRT.
(e) Writing Gun System (v) Used in memory - tube display and basically
the same as the electron gun used in a
conventional CRT.
Codes :
A. (a)-(i), (b)-(ii), (c)-(iii), (d)-(iv), (e)-(v)
B. (a)-(ii), (b)-(iii), (c)-(i), (d)-(iv), (e)-(v)
C. (a)-(iii), (b)-(i), (c)-(ii), (d)-(v), (e)-(iv)
D. (a)-(iv), (b)-(v), (c)-(i), (d)-(ii), (e)-(iii)

ugcnetjune2015iii computer-graphics

19.9.29 Computer Graphics: UGCNET-June2016-III: 15 https://gateoverflow.in/63716

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
ugcnetjune2016iii computer-graphics

19.9.30 Computer Graphics: UGCNET-June2016-III: 17 https://gateoverflow.in/63937

Let us consider that the original point is (x,y) and new transformed point is (x’,y’). Further Sh x and Sh y are shearing
factors in x and y directions. If we perform the y direction shear relative to x=sref then the transformed point is given
by
A. x′ = x + Shx . (y − yref ); y ′ = y B. x′ = x; y ′ = y. Shx
C. x′ = x; y ′ = Shy (x − xref ) + y D. x′ = Shy . y; y ′ = y. (x − xref )
ugcnetjune2016iii computer-graphics

19.9.31 Computer Graphics: UGCNET-June2016-III: 18 https://gateoverflow.in/63939

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
ugcnetjune2016iii computer-graphics

19.9.32 Computer Graphics: UGCNET-Nov2017-iii-13 https://gateoverflow.in/166389

Which of the following is not a component of Memory tube display?

A. Flooding gun B. Collector C. Ground D. Liquid Crystal

ugcnetnov2017-iii computer-graphics

19.9.33 Computer Graphics: UGCNET-Oct2020-II: 46 https://gateoverflow.in/349627

In the context of 3D Computer graphics, which of the following statements is/are correct?

a. Under perspective projection,

b. Applying
each set
a perspective
of parallel lines
c.
transformation
Perspective
in the object
transformation
in do
thenot
graphics Choose
stay parallel
is inthe
pipeline
a linearto
the acorrect answerthose
transformation
image
vertex (except
involves from theare
dividing
that options
by its ′ ′ given
parallel
z coordinate
to the viewplane
below:

A. (a) and (b) only B. (a) and (c) only C. (b) and (c) only D. (a), (b) and (c)
ugcnet-oct2020-ii non-gate computer-graphics

19.9.34 Computer Graphics: UGCNET-Oct2020-II: 47 https://gateoverflow.in/349626

Concerning phong shading and Gouraud shading in a 3D scene, which of the following statements are true?

a. Gouraud shading requires

b. more
Gouraud
computation
shading linearly
than phong
c. interpolates
Phong
shading
shading
the color
interpolatesChoose
of an interior the
over thepixelcorrect
normal theanswer
fromvectors
color atfrom
specified thetheoptions
the vertices
at verticesgiven
below:

A. (a) and (b) only B. (a) and (c) only C. (b) and (c) only D. (a), (b) and (c)
ugcnet-oct2020-ii non-gate computer-graphics

19.9.35 Computer Graphics: UGCNET-Oct2020-II: 66 https://gateoverflow.in/349607

Match List I with List II. List I gives 3 × 3 matrices representing 2D transformations and List II shows the
corresponding transformation diagrams.

Choose the correct answer from the options given below:

A. A − IV , B − II, C − III, D − I B. A − IV , B − III, C − II, D − I
C. A − III, B − II, C − IV , D − I D. A − II, B − IV , C − III, D − I
ugcnet-oct2020-ii non-gate computer-graphics

19.9.36 Computer Graphics: UGCNET-Oct2020-II: 76 https://gateoverflow.in/349597

Given below are different properties of 3D projections from A − D. Identify the correct order on the basis of property
true of (i) a perspective projection only, (ii) an orthographic projection only, (iii) both orthographic and projective
transformations and (iv) neither orthographic nor projective transformation, respectively.

a. Straight lines are mapped

b. toDistances
straight lines
and angles arec.(inFar
general)
away objects
preserved
appeard.theRequires
same size
homogeneous
as closer ones Choose in order
coordinates the forcorrect
it to be encoded in
 answer from the options given below:

A. d,c,b,a B. b,c,d,a C. d,c,a,b D. c,d,b,a

ugcnet-oct2020-ii non-gate computer-graphics

19.9.37 Computer Graphics: UGCNET-Oct2020-II: 82 https://gateoverflow.in/349591

Given below are two statements:

Statement I : Bezier curves are curves that interpolate all of their control points
Statement II : 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 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

ugcnet-oct2020-ii non-gate computer-graphics

19.9.38 Computer Graphics: UGCNET-Sep2013-III: 59 https://gateoverflow.in/59930

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
ugcnetsep2013iii computer-graphics

19.10 Crt (2)

19.10.1 Crt: UGCNET-Dec2015-III: 71 https://gateoverflow.in/61459

Which of the following is/are the components of a CRT ?

a. Electron Gun b. Control Electrode c. Focusing Electrode d. Phosphor Coated Screen

A. aB.
anda,C.
db and
a,D.b,da,
c and
c and
dd
ugcnetdec2015iii computer-graphics crt

19.10.2 Crt: UGCNET-Nov2017-iii-15 https://gateoverflow.in/166391

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

ugcnetnov2017-iii computer-graphics crt

19.11 Digital Image Processing (5)

19.11.1 Digital Image Processing: UGCNET-June2013-III: 19 https://gateoverflow.in/58288

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
ugcnetjune2013iii computer-graphics digital-image-processing
 19.11.2 Digital Image Processing: UGCNET-June2013-III: 31 https://gateoverflow.in/58489

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
ugcnetjune2013iii computer-graphics digital-image-processing

19.11.3 Digital Image Processing: UGCNET-June2013-III: 56 https://gateoverflow.in/58829

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. 2M+N D. 2MN

ugcnetjune2013iii computer-graphics digital-image-processing

19.11.4 Digital Image Processing: UGCNET-June2013-III: 57 https://gateoverflow.in/58830

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
ugcnetjune2013iii computer-graphics digital-image-processing

19.11.5 Digital Image Processing: UGCNET-Nov2017-iii-18 https://gateoverflow.in/166394

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

ugcnetnov2017-iii computer-graphics digital-image-processing

19.12 Display Devices (1)

19.12.1 Display Devices: UGCNET-June2013-III: 28 https://gateoverflow.in/58486

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
ugcnetjune2013iii computer-graphics display-devices

19.13 Frame Buffer (1)

19.13.1 Frame Buffer: UGCNET-AUG2016-III: 14 https://gateoverflow.in/70827

Consider a N -bit plane frame buffer with W -bit wide lookup table with W > N . How many intensity levels are
available at a time ?

A. 2N B. 2W C. 2N+W D. 2N−1
ugcnetaug2016iii computer-graphics frame-buffer

19.14 Halftoning (1)

19.14.1 Halftoning: UGCNET-June2012-III: 75 https://gateoverflow.in/56430

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
 ugcnetjune2012iii computer-graphics halftoning

19.15 Image Compression (1)

19.15.1 Image Compression: UGCNET-Sep2013-III: 55 https://gateoverflow.in/59924

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

ugcnetsep2013iii computer-graphics digital-image-processing image-compression

19.16 Image Entropy (1)

19.16.1 Image Entropy: UGCNET-Dec2012-III: 71 https://gateoverflow.in/57830

You are given four images to represent as

0 0 0 1 0 1 1 1
I1 = [ ] , I2 = [ ] , I3 = [ ] , I4 = [ ]
0 0 0 0 1 0 1 0
The value of entropy is maximum for image

A. I1 B. I2 C. I3 D. I4
ugcnetdec2012iii computer-graphics image-entropy

19.17 Line Clipping (1)

19.17.1 Line Clipping: UGCNET-Dec2014-III: 17 https://gateoverflow.in/60178

In Cyrus-Beck algorithm for line clipping the value of t parameter is computed by the relation:
(Here P1 and P2 are the two end points of the line, f is a point on the boundary, n1 is inner normal).
(P1 −fi ).ni (fi −P1 ).ni
A. (P2 −P1 ).ni
B. (P2 −P1 ).ni
(P2 −fi ).ni (fi −P2 ).ni
C. (P1 −P2 ).ni
D. (P1 −P2 ).ni
ugcnetdec2014iii non-gate computer-graphics line-clipping

19.18 Line Drawing Algorithm (3)

19.18.1 Line Drawing Algorithm: UGCNET-AUG2016-III: 15 https://gateoverflow.in/70828

Consider the Breshenham’s line generation algorithm for a line with gradient greater than one, current point (xi , yi )
and decision parameter, di . The next point to be plotted (xi+1 , yi+1 ) and updated decision parameter, di+1 , for di < 0
are given as _______.

A. xi+1 = xi+1 yi+1 = yi di+1 = di + 2dy

B. xi+1 = xi yi+1 = yi+1 di+1 = di + 2dx
C. xi+1 = xi yi+1 = yi+1 di+1 = di + 2(dx– dy)
D. xi+1 = xi+1 yi+1 = yi+1 di+1 = di + 2(dy– dx)

ugcnetaug2016iii computer-graphics line-drawing-algorithm

19.18.2 Line Drawing Algorithm: UGCNET-AUG2016-III: 18 https://gateoverflow.in/70835

The Liang-Barsky line clipping algorithm uses the parametric equation of a line from (x1 , y1 ) to (x2 , y2 ) along with its
infinite extension which is given as :
x = x1 + Δx. u
y = y1 + Δy. u
Where Δx = x2 – x1 , Δy = y2 – y1 , and u is the parameter with 0 ≤ u ≤ 1 . A line AB with end points A(– 1, 7) and
B(11, 1) is to be clipped against a rectangular window with xmin = 1, xmax = 9, ymin = 2 , and ymax = 8 . The lower and
upper bound values of the parameter u for the clipped line using Liang-Barsky algorithm is given as :

A. (0, 23 ) B. ( 16 , 56 ) C. (0, 13 ) D. (0, 1)

 ugcnetaug2016iii computer-graphics line-drawing-algorithm

19.18.3 Line Drawing Algorithm: UGCNET-June2013-III: 27 https://gateoverflow.in/58484

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
ugcnetjune2013iii computer-graphics line-drawing-algorithm

19.19 Parametric Line Equation (1)

19.19.1 Parametric Line Equation: UGCNET-Sep2013-III: 63 https://gateoverflow.in/59934

The parametric representation of the line segment between the position vectors P1 (2, 3) and P2 (5, 4) is given as

A. x(t) = 2 + 7t, y(t) = 0 ≤ t ≤ ∞ 3 + 7t

B. x(t) = 2 + 10t, y(t) = 0 ≤ t ≤ 1 3 + 7t
C. x(t) = 2 + 3t, y(t) = 0 ≤ t ≤ 1 y(t) = 3 + t
D. t(x, y) = 14t 0 ≤ t ≤ 1

ugcnetsep2013iii computer-graphics parametric-line-equation

19.20 Phong Color Model (1)

19.20.1 Phong Color Model: UGCNET-June-2019-II: 30 https://gateoverflow.in/316249

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
ugcnetjune2019ii phong-color-model

19.21 Projection (8)

19.21.1 Projection: UGCNET-AUG2016-III: 16 https://gateoverflow.in/70831

A point P (2, 5) is rotated about a pivot point (1, 2) by 60°. What is the new transformed point P ′ ?

A. (1, 4) B. (– 1, 4) C. (1, – 4) D. (– 4, 1)
ugcnetaug2016iii computer-graphics projection

19.21.2 Projection: UGCNET-AUG2016-III: 17 https://gateoverflow.in/70834

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
ugcnetaug2016iii computer-graphics projection

19.21.3 Projection: UGCNET-Dec2014-III: 18 https://gateoverflow.in/60179

Match the following :

 List – I List – II
a. Cavalier i. The direction of projection is chosen so
Projection that there is no foreshortening of lines
perpendicular to the xy plane.
b. Cabinet ii. The direction of projection is chosen so
Projection that lines perpendicular to the xy planes
are foreshortened by half their lengths.
c. Isometric iii. The direction of projection makes equal
Projection angles with all of the principal axis.
d. Orthographic iv. Projections are characterized by the fact
Projection that the direction of projection is
perpendicular to the view plane.
Codes :
A. a-i, b-iii, c-iv, d-ii B. a-ii, b-iii, c-i, d-iv
C. a-iv, b-ii, c-iii, d-i D. a-i, b-ii, c-iii, d-iv
ugcnetdec2014iii computer-graphics projection non-gate

19.21.4 Projection: UGCNET-June2012-III: 59 https://gateoverflow.in/56319

The perspective projection matrix, on the view plan z=d where the centre of projection is the origin (0, 0, 0) shall be

⎡0 0 0 d⎤
⎢0 d 0⎥
⎢ ⎥
0
⎢0 0 0⎥
A.
⎣d 0 1⎦
d
0
⎡d 0 0 0⎤
⎢0 0 0⎥
⎢ ⎥
d
⎢0 d 0⎥
B.
0
⎣0 0 1 0⎦
⎡0 0 0 d⎤
⎢0 d 0⎥
⎢ ⎥
0
⎢0 0 0⎥
C.
⎣1 0 0⎦
d
0
⎡d 0 0 0⎤
⎢0 0 0⎥
⎢ ⎥
d
⎢0 d 0⎥
D.
0
⎣0 0 0 1⎦

ugcnetjune2012iii computer-graphics projection

19.21.5 Projection: UGCNET-June2013-III: 29 https://gateoverflow.in/58487

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
ugcnetjune2013iii computer-graphics projection

19.21.6 Projection: UGCNET-June2016-III: 16 https://gateoverflow.in/63010

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
ugcnetjune2016iii computer-graphics projection
 19.21.7 Projection: UGCNET-Nov2017-iii-14 https://gateoverflow.in/166390

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

ugcnetnov2017-iii computer-graphics projection

19.21.8 Projection: UGCNET-Sep2013-III: 60 https://gateoverflow.in/59931

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

ugcnetsep2013iii computer-graphics projection

19.22 Raster Graphics (2)

19.22.1 Raster Graphics: UGCNET-AUG2016-III: 13 https://gateoverflow.in/70826

Consider a raster grid having XY -axes in positive X -direction and positive upward Y -direction with Xmax = 10 ,
Xmin =– 5 , Ymax = 11 , and Ymin = 6 . What is the address of memory pixel with location (5, 4) in raster grid
assuming base address 1 (one) ?

A. 150 B. 151 C. 160 D. 161

ugcnetaug2016iii computer-graphics raster-graphics

19.22.2 Raster Graphics: UGCNET-June-2019-II: 27 https://gateoverflow.in/316252

Consider a raster system with resolution 640 by 480. What size is frame buffer (in bytes) for this system to store 12
bits per pixel?
A. 450 kilobytes B. 500 kilobytes
C. 350 kilobytes D. 400 kilobytes
ugcnetjune2019ii raster-graphics

19.23 Resolution (1)

19.23.1 Resolution: UGCNET-June2013-III: 30 https://gateoverflow.in/58488

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
ugcnetjune2013iii computer-graphics resolution

19.24 Rotation (2)

19.24.1 Rotation: UGCNET-June2015-III: 14 https://gateoverflow.in/61157

Consider a triangle A(0,0), B(1, 1) and C(5, 2). The triangle has to be rotated by an angle of 45 o about the point P(-1, -
1). What shall be the coordinates of new triangle?
– – – –
A. A′ = (1, √2 − 1), B′ (−1, 2√2 − 1) and C ′ = ((3√2 − 1, 92 √2 − 1))
– – – –
B. A′ = (1, √2 − 1), B′ (2√2 − 1, −1) and C ′ = ((3√2 − 1, 92 √2 − 1))
– – – –
C. A′ = (−1, √2 − 1), B′ (−1, 2√2 − 1) and C ′ = ((3√2 − 1, 92 √2 − 1))
– – – –
D. A′ = (√2 − 1, −1)B′ (−1, 2√2 − 1) and C ′ = ((3√2 − 1, 92 √2 − 1))
 ugcnetjune2015iii computer-graphics rotation

19.24.2 Rotation: UGCNET-June2016-III: 14 https://gateoverflow.in/63013

A point P(5,1) is rotated by 90 o 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)

ugcnetjune2016iii computer-graphics rotation

19.25 Transformation (2)

19.25.1 Transformation: UGCNET-Dec2012-III: 16 https://gateoverflow.in/57380

The Mandelbrot set used for the construction of beautiful images is based on the following transformation.
xn+1 = x2n + z . Here,
A. Both x and z are real numbers B. Both x and z are complex numbers
C. x is real and z is complex D. x is complex and z is real
ugcnetdec2012iii computer-graphics transformation

19.25.2 Transformation: UGCNET-June2015-III: 13 https://gateoverflow.in/61156

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
ugcnetjune2015iii computer-graphics transformation

Answer Keys
19.1.1 Q-Q 19.2.1 B 19.3.1 Q-Q 19.3.2 A 19.4.1 C
19.5.1 D 19.6.1 A 19.7.1 B 19.8.1 A 19.9.1 X
19.9.2 B 19.9.3 A 19.9.4 D 19.9.5 C 19.9.6 D
19.9.7 C 19.9.8 X 19.9.9 B 19.9.10 D 19.9.11 X
19.9.12 B 19.9.13 C 19.9.14 D 19.9.15 B 19.9.16 D
19.9.17 B 19.9.18 Q-Q 19.9.19 D 19.9.20 D 19.9.21 C
19.9.22 D 19.9.23 C 19.9.24 A 19.9.25 D 19.9.26 B
19.9.27 D 19.9.28 A 19.9.29 D 19.9.30 C 19.9.31 D
19.9.32 D 19.9.33 A 19.9.34 C 19.9.35 D 19.9.36 C
19.9.37 D 19.9.38 D 19.10.1 C 19.10.2 A 19.11.1 C
19.11.2 B 19.11.3 D 19.11.4 A 19.11.5 C 19.12.1 C
19.13.1 Q-Q 19.14.1 B 19.15.1 D 19.16.1 C 19.17.1 B
19.18.1 Q-Q 19.18.2 Q-Q 19.18.3 B 19.19.1 C 19.20.1 D
19.21.1 Q-Q 19.21.2 Q-Q 19.21.3 D 19.21.4 B 19.21.5 D
19.21.6 C 19.21.7 D 19.21.8 C 19.22.1 Q-Q 19.22.2 A
19.23.1 A 19.24.1 C 19.24.2 A 19.25.1 B 19.25.2 A
20 Non GATE: Computer Peripherals (3)

20.1 Computer Peripherals (1)

20.1.1 Computer Peripherals: UGCNET-Dec2013-III: 61 https://gateoverflow.in/60784

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
ugcnetdec2013iii non-gate computer-peripherals

20.2 Io Devices (1)

20.2.1 Io Devices: UGCNET-Dec2014-III: 14 https://gateoverflow.in/60117

Match the following :

List – I List – II
a. Tablet, Joystick i. Continuous devices
b. Light pen, Touch screen ii. Direct devices
c. Locator, keyboard iii. Logical devices
d. Data Globe, Sonic pen iv. 3D interaction devices
Codes :
A. a-ii, b-i, c-iv, d-iii B. a-i, b-iv, c-iii, d-ii
C. a-i, b-ii, c-iii, d-iv D. a-iv, b-iii, c-ii, d-i
ugcnetdec2014iii non-gate computer-peripherals io-devices

20.3 Matrix Printer (1)

20.3.1 Matrix Printer: UGCNET-Dec2014-III: 03 https://gateoverflow.in/59955

In a dot matrix printer the time to print a character is 6 m.sec., time to space in between characters is 2 m.sec., and the
number of characters in a line are 200. 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. 125 chars/second and 0.8 seconds B. 250 chars/second and 0.6 seconds
C. 166 chars/second and 0.8 seconds D. 250 chars/second and 0.4 seconds
ugcnetdec2014iii computer-peripherals non-gate matrix-printer io-devices

Answer Keys
20.1.1 D 20.2.1 C 20.3.1 X
21 Non GATE: Data Mining and Warehousing (16)

21.0.1 UGCNET-Dec2004-II: 49 https://gateoverflow.in/335579

A data warehouse is always _________.

A. Subject oriented B. Object oriented
C. Program oriented D. Compiler oriented
ugcnetdec2004ii

21.1 Data Cube (1)

21.1.1 Data Cube: UGCNET-Dec2015-II: 31 https://gateoverflow.in/62275

A data cube C, has n dimensions, and each dimensions has exactly p 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, C?

A. pn B. p C. (2n − 1)(p + 1) D. (p + 1)n

ugcnetdec2015ii data-cube data-modelling

21.2 Data Mining (1)

21.2.1 Data Mining: UGCNET-Oct2020-II: 35 https://gateoverflow.in/349638

The process of removing details from a given state representation is called _____

A. Extraction B. Mining C. Selection D. Abstraction

ugcnet-oct2020-ii non-gate data-mining

21.3 Data Mining And Warehousing (1)

21.3.1 Data Mining And Warehousing: UGCNET-Dec2015-II: 34 https://gateoverflow.in/62280

____ 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
ugcnetdec2015ii data-warehousing data-mining-and-warehousing

21.4 Decision Tree (1)

21.4.1 Decision Tree: UGCNET-Sep2013-II: 40 https://gateoverflow.in/59251

The decision tree classifier is a widely used technique for

A. Classification B. Association C. Partition D. Clustering

ugcnetsep2013ii machine-learning decision-tree

21.5 Expert System (1)

21.5.1 Expert System: UGCNET-Dec2014-III: 59 https://gateoverflow.in/61026

Match the following components of an expert system :

List – I List – II
a. I/O Interface
i. Accepts user’s queries and responds to question
through I/O interface
b. Explanation Module ii. Contains facts and rules about the domain
c. Inference Engine iii. Gives the user, the ability to follow inferencing
steps at any time during consultation
d. Knowledge Base iv. Permits the user to communicate with the
system in a natural way
Codes :
 A. a-i, b-iii, c-iv, d-ii B. a-iv, b-iii, c-i, d-ii
C. a-i, b-iii, c-ii, d-iv D. a-iv, b-i, c-iii, d-ii
ugcnetdec2014iii artificial-intelligence expert-system

21.6 Fuzzy Sets (1)

21.6.1 Fuzzy Sets: UGCNET-June2012-III: 6 https://gateoverflow.in/56080

If two fuzzy set A and B are given with membership functions

μA (x) = {0.2, 0.4, 0.8, 0.5, 0.1}
μB (x) = {0.1, 0.3, 0.6, 0.3, 0.2}
Then the value of μ¯A∩B
¯¯¯¯¯¯¯¯¯¯ will be

A. {0.9, 0.7, 0.4, 0.8, 0.9} B. {0.2, 0.4, 0.8, 0.5, 0.2}
C. {0.1, 0.3, 0.6, 0.3, 0.1} D. {0.7, 0.3, 0.4, 0.2, 0.7}
ugcnetjune2012iii fuzzy-sets

21.7 Group Decision Support System (1)

21.7.1 Group Decision Support System: UGCNET-AUG2016-III: 73 https://gateoverflow.in/71701

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
ugcnetaug2016iii artificial-intelligence group-decision-support-system

21.8 K Means Clustering (1)

21.8.1 K Means Clustering: UGCNET-Oct2020-II: 83 https://gateoverflow.in/349590

Given below are two statements:

If two variables V1 and V2 are used for clustering, then consider the following statements for k means clustering with
k = 3:
Statement I: If V1 and V2 have correlation of 1 the cluster centroid will be in straight line
Statement II: If V1 and V2 have correlation of 0 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

ugcnet-oct2020-ii k-means-clustering

21.9 Knowledge Representation (5)

21.9.1 Knowledge Representation: UGCNET-Dec2013-III: 23 https://gateoverflow.in/60438

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

ugcnetdec2013iii artificial-intelligence knowledge-representation

21.9.2 Knowledge Representation: UGCNET-Dec2014-III: 58 https://gateoverflow.in/61014

Match the following :

 List – I List – II
a. Script
i. Directed graph with labelled nodes for graphical
representation of knowledge
b. Conceptual ii. Knowledge about objects and events is stored in
Dependencies record-like structures consisting of slots and
slot values.
c. Frames iii. Primitive concepts and rules to represent natural
language statements
d. Associative iv. Frame like structures used to represent
Network stereotypical patterns for commonly occurring
events in terms of actors, roles, props and scenes.
Codes :
A. a-iv, b-ii, c-i, d-iii B. a-iv, b-iii, c-ii, d-i
C. a-ii, b-iii, c-iv, d-i D. a-i, b-iii, c-iv, d-ii
ugcnetdec2014iii artificial-intelligence knowledge-representation

21.9.3 Knowledge Representation: UGCNET-June2010-II: 2 https://gateoverflow.in/67605

'R is a robot of M ’ means R can perform some of the tasks that otherwise M would do and R is unable to
do anything else.Which of the following is the most appropriate representation to model this situation?

D. None of these
A. B. C.
ugcnetjune2010ii knowledge-representation non-gate

21.9.4 Knowledge Representation: UGCNET-June2013-III: 72 https://gateoverflow.in/58900

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

ugcnetjune2013iii artificial-intelligence knowledge-representation

21.9.5 Knowledge Representation: UGCNET-June2014-III: 08 https://gateoverflow.in/55788

Consider a fuzzy set old as defined below

Old = {(20, 0.1), (30, 0.2), (40, 0.4), (50, 0.6), (60, 0.8), (70, 1), (80, 1)}.
Then the alpha-cut for alpha = 0.4 for the set old will be

A. {(40, 0.4)}
B. {50, 60, 70, 80}
C. {(20, 0.1), (30, 0.2)}
D. {(20, 0), (30, 0), (40, 1), (50, 1), (60, 1), (70, 1), (80, 1)}

ugcnetjune2014iii knowledge-representation fuzzy-sets

21.10 Olap (1)

21.10.1 Olap: UGCNET-Dec2015-II: 33 https://gateoverflow.in/62279

____ 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

ugcnetdec2015ii data-warehousing olap data-mining-and-warehousing

21.11 Perceptron (1)

 21.11.1 Perceptron: UGCNET-Dec2014-III: 70 https://gateoverflow.in/61522

Consider the following statements about a perception :

I . Feature detector can be any function of the input parameters.
II . Learning procedure only adjusts the connection weights to the output layer. Identify the correct statement out of the
following :
A. I is false and II is false. B. I is true and II is false.
C. I is false and II is true. D. I is true and II is true.
ugcnetdec2014iii neural-network perceptron

Answer Keys
21.0.1 Q-Q 21.1.1 D 21.2.1 D 21.3.1 A 21.4.1 A
21.5.1 B 21.6.1 X 21.7.1 Q-Q 21.8.1 C 21.9.1 D
21.9.2 B 21.9.3 Q-Q 21.9.4 C 21.9.5 D 21.10.1 B
21.11.1 D
22 Non GATE: Digital Image Processing (8)

22.1 Discovolution (1)

22.1.1 Discovolution: UGCNET-Dec2015-III: 51 https://gateoverflow.in/62708

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
ugcnetdec2015iii digital-image-processing discovolution

22.2 Entropy (2)

22.2.1 Entropy: UGCNET-Dec2014-III: 65 https://gateoverflow.in/61511

Given a simple image of size 10 × 10 whose histogram models the symbol probabilities and is given by
P1 P2 P3 P4
a b c d
The first order estimate of image entropy is maximum when
1
A. a = 0, b = 0, c = 0, d = 1 B. a = 2,b = 12 , c = 0, d = 0
C. a = 13 , b = 13 , c = 13 , d = 0 D. a = 1
4,b = 14 , c = 14 , d = 14
ugcnetdec2014iii digital-image-processing entropy

22.2.2 Entropy: UGCNET-Dec2015-III: 49 https://gateoverflow.in/62705

Consider the conditional entropy and mutual information for the binary symmetric channel. The input source has
1 1 1−p
, . The channel matrix is ( ) wgere p is the
p
alphabet X = {0, 1} and associated probabilities
2 2 p 1−p
transition probability. Then the conditional entropy is given by:
A. 1 B. −p log(p) − (1 − p) log(1 − p)
C. 1 + p log(p) + (1 − p) log(1 − p) D. 0
ugcnetdec2015iii digital-image-processing entropy

22.3 Fourier Transform (1)

22.3.1 Fourier Transform: UGCNET-Dec2012-III: 64 https://gateoverflow.in/42663

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
1 m n 1 1 1 m n
A. 4 F( 2 , 2 ) B. 4 F(2m, 2n) C. 4 F(m, n) D. 4 F( 4 , 4 )
ugcnetdec2012iii fourier-transform digital-image-processing

22.4 Image Compression (4)

22.4.1 Image Compression: UGCNET-June2012-III: 10 https://gateoverflow.in/56091

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
ugcnetjune2012iii image-compression

22.4.2 Image Compression: UGCNET-June2012-III: 19 https://gateoverflow.in/56103

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
 ugcnetjune2012iii image-compression

22.4.3 Image Compression: UGCNET-June2014-III: 55 https://gateoverflow.in/57204

Given an image of size 1024 × 1024 pixels in which intensity of each pixel is an 8-bit quality. It requires _______ of
storage space if the image is not compressed.
A. One Terabyte B. One Megabyte
C. 8 Megabytes D. 8 Terabytes
ugcnetjune2014iii image-compression computer-graphics

22.4.4 Image Compression: UGCNET-June2016-III: 60 https://gateoverflow.in/64114

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

ugcnetjune2016iii image-compression computer-graphics

Answer Keys
22.1.1 D 22.2.1 D 22.2.2 D 22.3.1 A 22.4.1 X
22.4.2 A 22.4.3 B 22.4.4 D
23 Non GATE: Digital Signal Processing (4)

23.1 Butterworth Lowpass Filter (1)

23.1.1 Butterworth Lowpass Filter: UGCNET-Dec2014-III: 66 https://gateoverflow.in/61517

A Butterworth lowpass filter of order n, with a cutoff frequency at distance D0 from the origin, has the transfer
function H(u, v) given by
1 1
A. D(u,v) 2n
B. D(u,v) n
1+[ ] 1+[ D0
]
D0
1 1
C. 2n D. n
]
D
]
D
0 0
1+[ D(u,v) 1+[ D(u,v)

ugcnetdec2014iii digital-image-processing butterworth-lowpass-filter

23.2 Digital Signal Processing (1)

23.2.1 Digital Signal Processing: UGCNET-June2012-II: 18 https://gateoverflow.in/55838

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

ugcnetjune2012ii non-gate digital-signal-processing

23.3 Discrete Memoryless Channel (1)

23.3.1 Discrete Memoryless Channel: UGCNET-June2016-III: 58 https://gateoverflow.in/64112

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)
ugcnetjune2016iii digital-image-processing discrete-memoryless-channel

23.4 Spatial Mask (1)

23.4.1 Spatial Mask: UGCNET-Dec2014-III: 64 https://gateoverflow.in/61509

Given two spatial masks

⎡0 1 0⎤
S1 = ⎢ 1 −4 0⎥
⎣0 1 0⎦
⎡1 1 1⎤
S2 = ⎢ 1 −8 1⎥
⎣1 1 1⎦
The Laplacian of an image at all points (x, y) can be implemented by convolving the image with spatial mask. Which of the
following can be used as the spatial mask ?
A. only S1 B. only S2
C. Both S1 and S2 D. None of these
ugcnetdec2014iii digital-image-processing spatial-mask

Answer Keys
23.1.1 A 23.2.1 A 23.3.1 D 23.4.1 B
24 Non GATE: Distributed Computing (11)

24.1 Computing Models (1)

24.1.1 Computing Models: UGCNET-Dec2014-III: 75 https://gateoverflow.in/61536

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
ugcnetdec2014iii distributed-computing computing-models

24.2 Distributed Computing (3)

24.2.1 Distributed Computing: UGCNET-Dec2014-III: 11 https://gateoverflow.in/60111

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. I B. II
C. Both are correct D. None of the statements are correct.
ugcnetdec2014iii distributed-computing non-gate

24.2.2 Distributed Computing: UGCNET-Dec2014-III: 54 https://gateoverflow.in/60967

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

ugcnetdec2014iii distributed-computing

24.2.3 Distributed Computing: UGCNET-June2014-II: 27 https://gateoverflow.in/54059

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. I , II & III B. I & II
C. II & III D. I only
ugcnetjune2014ii non-gate distributed-computing

24.3 Distributed Databases (2)

24.3.1 Distributed Databases: UGCNET-Dec2014-III: 07 https://gateoverflow.in/60005

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. I, II and III B. I and II only C. II and III only D. II only

ugcnetdec2014iii distributed-databases non-gate

24.3.2 Distributed Databases: UGCNET-June2016-III: 12 https://gateoverflow.in/57219

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

ugcnetjune2016iii non-gate distributed-computing distributed-databases

24.4 Distributed System (2)

24.4.1 Distributed System: UGCNET-Dec2015-III: 62 https://gateoverflow.in/62732

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

ugcnetdec2015iii distributed-system

24.4.2 Distributed System: UGCNET-Sep2013-III: 68 https://gateoverflow.in/59941

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.

ugcnetsep2013iii distributed-system

24.5 Message Passing (1)

24.5.1 Message Passing: UGCNET-June2015-II: 50 https://gateoverflow.in/61092

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

ugcnetjune2015ii parallel-computing message-passing

24.6 Parallel Virtual Machine (1)

24.6.1 Parallel Virtual Machine: UGCNET-June2015-II: 47 https://gateoverflow.in/61089

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

ugcnetjune2015ii distributed-computing parallel-virtual-machine

24.7 Rpc (1)

 24.7.1 Rpc: UGCNET-June2016-III: 54 https://gateoverflow.in/63979

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

ugcnetjune2016iii distributed-computing rpc

Answer Keys
24.1.1 B 24.2.1 D 24.2.2 B 24.2.3 D 24.3.1 A
24.3.2 C 24.4.1 B 24.4.2 D 24.5.1 C 24.6.1 D
24.7.1 B
25 Non GATE: Geometry (2)

25.1 Geometry (1)

25.1.1 Geometry: UGCNET-Dec2014-III: 16 https://gateoverflow.in/60173

Consider a triangle represented by A(0, 0), B(1, 1), C(5, 2). The triangle is rotated by 45 degrees about a point
P (−1, −1). The co ordinates of the new triangle obtained after rotation shall be ________.
– – – 9 √–
A. A′ (−1, √2 − 1), B′ (−1, 2√2 − 1), C ′ ( 32 √2 − 1, 2 2 − 1)
– – – 9 √–
B. A′ (√2 − 1, −1), B′ (2√2 − 1, −1), C ′ ( 32 √2 − 1, 2 2 − 1)
– – – 9 √–
C. A′ (−1, √2 − 1), B′ (2√2 − 1, −1), C ′ ( 32 √2 − 1, 2 2 − 1)
– – – 3 √–
D. A′ (−1, √2 − 1), B′ (2√2 − 1, −1), C ′ ( 92 √2 − 1, 2 2 − 1)

ugcnetdec2014iii geometry non-gate

25.2 Lines Curves (1)

25.2.1 Lines Curves: UGCNET-Dec2015-III: 32 https://gateoverflow.in/62591

The end points of a given line are (0, 0) and (6, 18). Compute each value of y as x steps from 0 to 3, by using equation
of straight line:

A. For x = 0, y = 0; x = 1, y = 3; x = 2, y = 6; x = 3, y = 9
B. For x = 0, y = 1; x = 1, y = 3; x = 2, y = 4; x = 3, y = 9
C. For x = 0, y = 2; x = 1, y = 3; x = 2, y = 6; x = 3, y = 9
D. For x = 0, y = 0; x = 1, y = 3; x = 2, y = 4; x = 3, y = 6

ugcnetdec2015iii geometry lines-curves

Answer Keys
25.1.1 A 25.2.1 C
26 Non GATE: Integrated Circuits (1)

26.1 Integrated Circuits (1)

26.1.1 Integrated Circuits: UGCNET-June2012-II: 36 https://gateoverflow.in/55879

Which of the following logic families is well suited for high-speed operations?

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

non-gate integrated-circuits ugcnetjune2012ii

Answer Keys
26.1.1 B
27 Non GATE: IS&Software Engineering (210)

27.0.1 UGCNET-Dec2004-II: 42 https://gateoverflow.in/335586

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

ugcnetdec2004ii

27.0.2 UGCNET-Dec2007-II: 45 https://gateoverflow.in/335739

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
ugcnetdec2007ii

27.0.3 UGCNET-Dec2006-II: 16 https://gateoverflow.in/335655

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

ugcnetdec2006ii

27.0.4 UGCNET-Dec2007-II: 41 https://gateoverflow.in/335743

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

ugcnetdec2007ii

27.0.5 UGCNET-Dec2004-II: 41 https://gateoverflow.in/335587

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

ugcnetdec2004ii

27.0.6 UGCNET-Dec2004-II: 43 https://gateoverflow.in/335585

Reliability of software is dependent on :

A. Number of errors present in software B. Documentation
 C. Testing suites D. Development Processes
ugcnetdec2004ii

27.0.7 UGCNET-Dec2006-II: 19 https://gateoverflow.in/335652

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

ugcnetdec2006ii

27.0.8 UGCNET-june2008-ii-42 https://gateoverflow.in/155628

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.

ugcnetjune2008ii

27.0.9 UGCNET-Dec2006-II: 30 https://gateoverflow.in/335641

The LAPB frame structure and the frame structure of SDLC are :

A. Opposite B. Identical C. Reversed D. Non-identical

ugcnetdec2006ii

27.0.10 UGCNET-DEC2018-II: 57 https://gateoverflow.in/288320

A legacy software system has 940 modules. The latest release required that 90 of these modules be changed. In
addition, 40 new modules were added and 12 old modules were removed. Compute the software maturity index for the
system.

A. 0.849 B. 0.524 C. 0.725 D. 0.923

ugcnetdec2018ii

27.0.11 UGCNET-Dec2006-II: 41 https://gateoverflow.in/335630

Software Cost Performance index (CPI) is given by :

BCWP
A. ACWP B. C. BCWP-ACWP D. BCWP-BCWS Where :
BCWP stands for Budgeted Co
BCWS stands for Budget Cos
ACWP stands for Actual Cos

ugcnetdec2006ii

27.0.12 UGCNET-june2009-ii-40 https://gateoverflow.in/154490

In the light of software engineering software consists of :

A. Programs
B. Data
C. Documentation
D. All of the above
 ugcnetjune2009ii

27.0.13 UGCNET-june2009-ii-39 https://gateoverflow.in/154489

Capability Maturity Model is meant for :

A. Product
B. Process
C. Product and Process
D. None of the above

ugcnetjune2009ii

27.0.14 UGCNET-june2009-ii-42 https://gateoverflow.in/154136

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
ugcnetjune2009ii

27.0.15 UGCNET-june2009-ii-43 https://gateoverflow.in/154822

Reverse engineering is the process which deals with :

A. Size measurement
B. Cost measurement
C. Design recovery
D. All of the above

ugcnetjune2009ii

27.0.16 UGCNET-Dec2006-II: 42 https://gateoverflow.in/335629

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.

ugcnetdec2006ii

27.0.17 UGCNET-Dec2006-II: 43 https://gateoverflow.in/335628

In a object oriented software design, ‘Inheritance’ is a kind of __________ .

A. relationship. B. module. C. testing. D. optimization.

ugcnetdec2006ii

27.0.18 UGCNET-Dec2006-II: 44 https://gateoverflow.in/335627

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.
 ugcnetdec2006ii

27.0.19 UGCNET-Dec2006-II: 45 https://gateoverflow.in/335626

‘Abstraction’ is ____________ step of Attribute in a software design.

A. First B. Final C. Last D. Middle

ugcnetdec2006ii

27.0.20 UGCNET-Dec2004-II: 45 https://gateoverflow.in/335583

The Function Point (FP ) 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
ugcnetdec2004ii

27.0.21 UGCNET-Dec2007-II: 42 https://gateoverflow.in/335742

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

ugcnetdec2007ii

27.0.22 UGCNET-Dec2007-II: 44 https://gateoverflow.in/335740

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
ugcnetdec2007ii

27.1 Adaptive Maintenance (1)

27.1.1 Adaptive Maintenance: UGCNET-June-2019-II: 58 https://gateoverflow.in/316221

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

ugcnetjune2019ii adaptive-maintenance

27.2 Artificial Intelligence (2)

 27.2.1 Artificial Intelligence: UGCNET-Dec2012-III: 74 https://gateoverflow.in/57838

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
ugcnetdec2012iii artificial-intelligence

27.2.2 Artificial Intelligence: UGCNET-June2012-III: 23 https://gateoverflow.in/56220

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

ugcnetjune2012iii artificial-intelligence

27.3 Assignment Problem (1)

27.3.1 Assignment Problem: UGCNET-June2012-III: 62 https://gateoverflow.in/56350

The optimal solution of the following assignment problem using Hungarian method is
I II III IV
A 8 26 17 11
B 13 28 4 26
C 38 19 18 15
D 19 26 24 10

A. (A)-(I), (B)-(II), (C)-(III), (D)-(IV) B. (A)-(I), (B)-(III), (C)-(II), (D)-(IV)

C. (A)-(I), (B)-(III), (C)-(IV), (D)-(II) D. (A)-(I), (B)-(IV), (C)-(II), (D)-(III)
ugcnetjune2012iii optimization assignment-problem

27.4 Cmm Model (3)

27.4.1 Cmm Model: UGCNET-Dec2014-II: 42 https://gateoverflow.in/59827

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

ugcnetdec2014ii is&software-engineering cmm-model

27.4.2 Cmm Model: UGCNET-June2014-III: 21 https://gateoverflow.in/56748

Which one of the following is not a key process area in CMM level 5 ?
A. Defect prevention B. Process change management
C. Software product engineering D. Technology change management
ugcnetjune2014iii is&software-engineering cmm-model

27.4.3 Cmm Model: UGCNET-June2016-III: 47 https://gateoverflow.in/63976

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

ugcnetjune2016iii is&software-engineering cmm-model

27.5 Cmmi (1)

27.5.1 Cmmi: UGCNET-July-2018-II: 15 https://gateoverflow.in/225871

Match the 5 CMM Maturity levels /CMMI staged representations in List-I with their characterizations in List-II :
List-I List-II
(a) Initial
(i) Processes are improved quantitatively
and continually.
(b) Repeatable (ii) The plan for a project comes from a
template for plans.
(c) Defined (iii) The plan uses processes that can be
measured quantitatively.
(d) Managed (iv) There may not exist a plan or it may
be abandoned.
(e) Optimizing (v) There’s a plan and people stick to it.
Code :
A. (a)-(iv); (b)-(v); (c)-(i); (d)-(iii); (e)-(ii)
B. (a)-(i); (b)-(ii); (c)-(iv); (d)-(v); (e)-(iii)
C. (a)-(v); (b)-(iv); (c)-(ii); (d)-(iii); (e)-(i)
D. (a)-(iv); (b)-(v); (c)-(ii); (d)-(iii); (e)-(i)

ugcnetjuly2018ii is&software-engineering cmmi software-development-life-cycle-models

27.6 Cocomo Model (3)

27.6.1 Cocomo Model: UGCNET-Dec2010-II: 44 https://gateoverflow.in/67038

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
ugcnetdec2010ii is&software-engineering cocomo-model

27.6.2 Cocomo Model: UGCNET-Jan2017-III: 48 https://gateoverflow.in/335190

A software company needs to develop a project that is estimated as 1000 function points and is planning to use JAVA
as the programming language whose approximate lines of code per function point is accepted as 50. Considering
a = 1.4 as multiplicative factor, b = 1.0 as exponention factor for the basic COCOMO effort equation and c = 3.0 as
multiplicative factor, d = 0.33 as exponention factor for the basic COCOMO duration equation, approximately how long does
project take to complete?
A. 11.2 months B. 12.2 months
C. 13.2 months D. 10.2 months
ugcnetjan2017iii is&software-engineering cocomo-model

27.6.3 Cocomo Model: UGCNET-dec2008-ii-45 https://gateoverflow.in/155369

COCOMO model is used for:

A. product quality estimation
B. product complexity estimation
C. product cost estimation
D. all of the above

ugcnetdec2008ii is&software-engineering cocomo-model

27.7 Coding And Testing (1)

27.7.1 Coding And Testing: UGCNET-June2016-III: 46 https://gateoverflow.in/63975

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

ugcnetjune2016iii is&software-engineering coding-and-testing

27.8 Cohesion (2)

27.8.1 Cohesion: UGCNET-Dec2014-III: 48 https://gateoverflow.in/60804

Temporal cohesion means

A. Coincidental cohesion B. Cohesion between temporary variables
C. Cohesion between local variables D. Cohesion with respect to time
ugcnetdec2014iii is&software-engineering cohesion

27.8.2 Cohesion: UGCNET-June2015-II: 44 https://gateoverflow.in/61086

Cohesion is an extension of:

A. Abstraction concept B. Refinment concept
C. Information hiding concept D. Modularity
ugcnetjune2015ii is&software-engineering cohesion

27.9 Cost Estimation Model (2)

27.9.1 Cost Estimation Model: UGCNET-Dec2013-III: 5 https://gateoverflow.in/60387

Function points can be calculated by

A. UFP * CAF B. UFP * FAC C. UFP * Cost D. UFP * Productivity

ugcnetdec2013iii is&software-engineering cost-estimation-model

27.9.2 Cost Estimation Model: UGCNET-dec2009-ii-43 https://gateoverflow.in/152936

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)
ugcnetdec2009ii is&software-engineering cost-estimation-model

27.10 Coupling (3)

27.10.1 Coupling: UGCNET-Dec2013-III: 6 https://gateoverflow.in/60388

Match the following :

List – I List – II
a. Data Coupling
i. Module A and Module B have shared data
b. Stamp Coupling
ii. Dependency between modules is based on the
fact they communicate by only passing of data.
c. Common Coupling iii. When complete data structure is passed from
one module to another
d. Content Coupling iv. When the control is passed from one module to
the middle of another
 Codes :
A. a-iii, b-ii, c-i, d-iv B. a-ii, b-iii, c-i, d-iv
C. a-ii, b-iii, c-iv, d-i D. a-iii, b-ii, c-iv, d-i
ugcnetdec2013iii is&software-engineering coupling

27.10.2 Coupling: UGCNET-July-2018-II: 16 https://gateoverflow.in/225870

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

ugcnetjuly2018ii is&software-engineering coupling

27.10.3 Coupling: UGCNET-Sep2013-III: 46 https://gateoverflow.in/59865

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
ugcnetsep2013iii is&software-engineering coupling

27.11 Coupling Cohesion (1)

27.11.1 Coupling Cohesion: UGCNET-June-2019-II: 51 https://gateoverflow.in/316228

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

ugcnetjune2019ii coupling-cohesion defect

27.12 Crc Polynomial (1)

27.12.1 Crc Polynomial: UGCNET-Dec2015-III: 31 https://gateoverflow.in/62589

In CRC based design, a CRC Team consists of

a. one or two users representatives

b. several programmers c. project co-ordinators d. one or two system analysts

A. aB.
anda,C.
cb, a,
cD.and
c, a,
anddb, dand d
ugcnetdec2015iii is&software-engineering crc-polynomial

27.13 Cyclomatic Complexity (3)

27.13.1 Cyclomatic Complexity: GATE IT 2007 | Question: 55, UGCNET-June2012-III: 40 https://gateoverflow.in/3497

Consider the following pseudo-code:

IF ((A > B) AND (C > D)) THEN
A = A + 1
B = B + 1
ENDIF

The cyclomatic complexity of the pseudo-code is

A. 2
B. 3
 C. 4
D. 5

gateit-2007 is&software-engineering cyclomatic-complexity normal ugcnetjune2012iii

27.13.2 Cyclomatic Complexity: UGCNET-Dec2014-II: 45 https://gateoverflow.in/59830

Which one of the following is used to compute cyclomatic complexity ?

A. The number of regions −1

B. E– N + 1 , where E is the number of flow graph edges and N is the number of flow graph nodes.
C. P – 1, where P is the number of predicate nodes in the flow graph G.
D. P + 1, where P is the number of predicate nodes in the flow graph G.

ugcnetdec2014ii is&software-engineering cyclomatic-complexity

27.13.3 Cyclomatic Complexity: UGCNET-June2016-II: 44 https://gateoverflow.in/63486

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)

ugcnetjune2016ii cyclomatic-complexity

27.14 Data Mining (2)

27.14.1 Data Mining: UGCNET-Dec2012-III: 5 https://gateoverflow.in/57362

______ 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

ugcnetdec2012iii data-mining

27.14.2 Data Mining: UGCNET-June2012-III: 12 https://gateoverflow.in/56093

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
ugcnetjune2012iii data-mining

27.15 Digital Marketing (1)

27.15.1 Digital Marketing: UGCNET-Dec2012-III: 1 https://gateoverflow.in/57331

Eco system is a framework for

A. Building a Computer System B. Building Internet Market
C. Building Offline Market D. Building Market
ugcnetdec2012iii e-technologies digital-marketing

27.16 Dual Linear Programming (1)

27.16.1 Dual Linear Programming: UGCNET-Dec2012-III: 24 https://gateoverflow.in/57390

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
ugcnetdec2012iii optimization dual-linear-programming

27.17 Fan In (1)

 27.17.1 Fan In: UGCNET-Dec2014-III: 47 https://gateoverflow.in/60799

′ FANI N ′ of a component A is defined as

A. Count of the number of components that can call, or pass control, to a component A
B. Number of components related to component A
C. Number of components dependent on component A
D. None of the above

ugcnetdec2014iii is&software-engineering fan-in

27.18 Flow Chart (1)

27.18.1 Flow Chart: UGCNET-Dec2010-II: 45 https://gateoverflow.in/67039

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
ugcnetdec2010ii is&software-engineering flow-chart

27.19 Function Point Metric (2)

27.19.1 Function Point Metric: UGCNET-Dec2014-III: 44 https://gateoverflow.in/60788

To compute function points (FP ), the following relationship is used FP = Count - total ×(0.65 + 0.01 × ∑(Fi ))
where Fi (i = 1 to n) are value adjustment factors (V AF) based on n questions. The value of n is

A. 12 B. 14 C. 16 D. 18
ugcnetdec2014iii is&software-engineering function-point-metric

27.19.2 Function Point Metric: UGCNET-June2014-II: 14 https://gateoverflow.in/53484

In function point analysis, the number of complexity adjustment factors is

A. 10 B. 12 C. 14 D. 20
ugcnetjune2014ii is&software-engineering function-point-metric

27.20 Git (1)

27.20.1 Git: UGCNET-June-2019-II: 55 https://gateoverflow.in/316224

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
ugcnetjune2019ii git

27.21 Information System (1)

27.21.1 Information System: UGCNET-Dec2014-III: 60 https://gateoverflow.in/61028

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. I and $II B. III and IV C. II and III D. II and IV

ugcnetdec2014iii information-system

27.22 Is&software Engineering (60)

27.22.1 Is&software Engineering: UGCNET-AUG2016-III: 47 https://gateoverflow.in/71568

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.

ugcnetaug2016iii is&software-engineering

27.22.2 Is&software Engineering: UGCNET-AUG2016-III: 48 https://gateoverflow.in/71574

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

ugcnetaug2016iii is&software-engineering

27.22.3 Is&software Engineering: UGCNET-DEC2016-III: 45 https://gateoverflow.in/113846

Match the terms related to Software Configuration Management (SCM) in List-I with the description in List-II.
List-I List-II
I. Version
A. An instance of a system that is described
to customers
II. Release B. An instance of a system which is functionally
identical to other instances, but designed for
different hardware/software instances.
III. Variant C. An instance of a system that differs, in some
way, from other instances
Codes :
A. I-B; II-C; III-A B. I-C; II-A; III-B
C. I-C; II-B; III-A D. I-B; II-A; III-C
ugcnetdec2016iii is&software-engineering

27.22.4 Is&software Engineering: UGCNET-Dec2011-II: 14 https://gateoverflow.in/63078

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.

ugcnetdec2011ii is&software-engineering

27.22.5 Is&software Engineering: UGCNET-Dec2011-II: 17 https://gateoverflow.in/63552

Design recovery from source code is done during

A. reverse engineering B. re-engineering
C. reuse D. all of the above
ugcnetdec2011ii is&software-engineering
27.22.6 Is&software Engineering: UGCNET-Dec2012-II: 19 https://gateoverflow.in/56524

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

ugcnetdec2012ii non-gate is&software-engineering

27.22.7 Is&software Engineering: UGCNET-Dec2012-II: 6 https://gateoverflow.in/56504

Component level design is concerned with

A. Flow oriented analysis B. Class based analysis
C. Both of the above D. None of the above
ugcnetdec2012ii non-gate is&software-engineering

27.22.8 Is&software Engineering: UGCNET-Dec2013-II: 10 https://gateoverflow.in/60040

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
ugcnetdec2013ii is&software-engineering

27.22.9 Is&software Engineering: UGCNET-Dec2013-II: 7 https://gateoverflow.in/60035

The relationship of data elements in a module is called

A. Coupling B. Modularity C. Cohesion D. Granularity

ugcnetdec2013ii is&software-engineering

27.22.10 Is&software Engineering: UGCNET-Dec2013-II: 8 https://gateoverflow.in/60038

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

ugcnetdec2013ii is&software-engineering

27.22.11 Is&software Engineering: UGCNET-Dec2013-II: 9 https://gateoverflow.in/60039

Which one of the following is not a step of requirement engineering?

A. Requirement elicitation B. Requirement analysis
C. Requirement design D. Requirement documentation
ugcnetdec2013ii is&software-engineering

27.22.12 Is&software Engineering: UGCNET-Dec2013-III: 9 https://gateoverflow.in/60391

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.

ugcnetdec2013iii is&software-engineering
27.22.13 Is&software Engineering: UGCNET-Dec2015-III: 25 https://gateoverflow.in/62481

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

ugcnetdec2015iii is&software-engineering

27.22.14 Is&software Engineering: UGCNET-Dec2015-III: 72 https://gateoverflow.in/61456

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.

ugcnetdec2015iii is&software-engineering

27.22.15 Is&software Engineering: UGCNET-Dec2015-III: 74 https://gateoverflow.in/61453

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.

ugcnetdec2015iii is&software-engineering

27.22.16 Is&software Engineering: UGCNET-Jan2017-II: 41 https://gateoverflow.in/335122

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

27.22.17 Is&software Engineering: UGCNET-Jan2017-II: 42 https://gateoverflow.in/335121

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

27.22.18 Is&software Engineering: UGCNET-Jan2017-II: 43 https://gateoverflow.in/335120

Which of the following statement(s) is/are true with respect to software architecture?
S1 : Coupling is a measure of how well the things grouped together in a module belong together logically.
S2 : Cohesion is a measure of the degree of interaction between software modules.
S3 : If coupling is low and cohesion is high then it is easier to change one module without affecting others.

A. Only S1 and S2 B. Only S3 C. All of S1 , S2 and S3 D. Only S1

ugcnetjan2017ii is&software-engineering

27.22.19 Is&software Engineering: UGCNET-Jan2017-II: 44 https://gateoverflow.in/335119

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

27.22.20 Is&software Engineering: UGCNET-Jan2017-III: 45 https://gateoverflow.in/335193

Match the terms related to Software Configuration Management (​​SCM) in List-Ⅰ with the descriptions in List-II.

List-I List-II
I. Version
A. An instance of a system that is distributed
to customers
II. Release B. An instance of a system which is functionally
identical to other instances but designed for
different hardware/software instances.
III. Variant C. An instance of a system that differs, in some
way, from other instances

Codes:
A. I-B; II-C; III-C B. I-C; II-A; III-B
C. I-C; II-B; III-A D. I-B; II-A; III-C
ugcnetjan2017iii is&software-engineering

27.22.21 Is&software Engineering: UGCNET-Jan2017-III: 46 https://gateoverflow.in/335192

A software project was estimated at 352 Function Points(FP). 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 ₹80, 000 per month, the
programmer ₹60, 000 per month and the tester ₹50, 000 per month. The average productivity for the team is 8 FP per
person month. Which of the following represents the projected cost of the project?
A. ₹28, 16, 000 B. ₹20, 90, 000
C. ₹26, 95, 000 D. ₹27, 50, 000
ugcnetjan2017iii is&software-engineering

27.22.22 Is&software Engineering: UGCNET-Jan2017-III: 47 https://gateoverflow.in/335191

Complete each of the following sentences in List- I on the left hand side by filling in the word or phase from the
List- II on the right hand side that best completes the sentences :
List-I List-II
I. Determining whether you have built A. Software testing
the right system is called ________
II. Determining whether you have built B. Software verification
the system right is called _______
III. _______ is the process of demonstrating C. Software debugging
the existence of defects or providing
confidence that they do not appear to
be present.
IV. _______ is the process of discovering D. Software validation
the causes of a defect and fixing it.
Codes :
A. I-B; II-D; III-A; IV-C B. I-B; II-D; III-C; IV-A
C. I-D; II-B; III-C; IV-A D. I-D; II-B; III-A; IV-C
ugcnetjan2017iii is&software-engineering
27.22.23 Is&software Engineering: UGCNET-July-2018-II: 12 https://gateoverflow.in/225874

Match the following in Software Engineering :

List-I List-II
(a) Product Complexity (i) Software Requirement Definition
(b) Structured System Analysis (ii) Software Design
(c) Coupling and Cohesion (iii) Validation Technique
(d) Symbolic Execution (iv) Software Cost Estimation
Code :
A. (a)-(ii); (b)-(iii); (c)-(iv); (d)-(i) B. (a)-(iii); (b)-(i); (c)-(iv); (d)-(ii)
C. (a)-(iv); (b)-(i); (c)-(ii); (d)-(iii) D. (a)-(iii); (b)-(iv); (c)-(i); (d)-(ii)
ugcnetjuly2018ii is&software-engineering

27.22.24 Is&software Engineering: UGCNET-July-2018-II: 13 https://gateoverflow.in/225873

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
ugcnetjuly2018ii is&software-engineering

27.22.25 Is&software Engineering: UGCNET-July-2018-II: 14 https://gateoverflow.in/225872

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%

ugcnetjuly2018ii is&software-engineering

27.22.26 Is&software Engineering: UGCNET-July-2018-II: 18 https://gateoverflow.in/225868

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

ugcnetjuly2018ii is&software-engineering

27.22.27 Is&software Engineering: UGCNET-July-2018-II: 19 https://gateoverflow.in/225867

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
ugcnetjuly2018ii is&software-engineering

27.22.28 Is&software Engineering: UGCNET-July-2018-II: 20 https://gateoverflow.in/225866

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

ugcnetjuly2018ii is&software-engineering
27.22.29 Is&software Engineering: UGCNET-June2010-II: 41 https://gateoverflow.in/68039

Software engineering primarily aims on

A. Reliable software B. Cost effective software
C. Reliable and cost effective software D. None of the above
ugcnetjune2010ii is&software-engineering

27.22.30 Is&software Engineering: UGCNET-June2012-II: 20 https://gateoverflow.in/55840

Main aim of software engineering is to produce

A. program B. software
C. within budget D. software within budget in the given schedule
ugcnetjune2012ii non-gate is&software-engineering

27.22.31 Is&software Engineering: UGCNET-June2012-II: 21 https://gateoverflow.in/55842

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

ugcnetjune2012ii non-gate is&software-engineering

27.22.32 Is&software Engineering: UGCNET-June2012-II: 22 https://gateoverflow.in/55843

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
ugcnetjune2012ii is&software-engineering non-gate

27.22.33 Is&software Engineering: UGCNET-June2012-II: 23 https://gateoverflow.in/55844

If a process is under statistical control, then it is

A. Maintainable B. Measurable C. Predictable D. Verifiable

ugcnetjune2012ii non-gate is&software-engineering

27.22.34 Is&software Engineering: UGCNET-June2012-II: 24 https://gateoverflow.in/55845

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
ugcnetjune2012ii non-gate is&software-engineering

27.22.35 Is&software Engineering: UGCNET-June2012-II: 25 https://gateoverflow.in/55846

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-gate is&software-engineering ugcnetjune2012ii

27.22.36 Is&software Engineering: UGCNET-June2012-II: 43 https://gateoverflow.in/55888

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-gate is&software-engineering ugcnetjune2012ii

27.22.37 Is&software Engineering: UGCNET-June2012-III: 37 https://gateoverflow.in/56268

Are we building the right product? – This statement refers to

A. Verification B. Validation
 C. Testing D. Software quality assurance
ugcnetjune2012iii is&software-engineering

27.22.38 Is&software Engineering: UGCNET-June2013-II: 3 https://gateoverflow.in/42600

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 ugcnetjune2013ii

27.22.39 Is&software Engineering: UGCNET-June2014-II: 11 https://gateoverflow.in/53475

KP A in CMM stands for

A. Key Process Area B. Key Product Area
C. Key Principal Area D. Key Performance Area
ugcnetjune2014ii is&software-engineering

27.22.40 Is&software Engineering: UGCNET-June2014-II: 13 https://gateoverflow.in/53481

_________ 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
ugcnetjune2014ii is&software-engineering

27.22.41 Is&software Engineering: UGCNET-June2014-II: 28 https://gateoverflow.in/54065

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. I B. II
C. III D. All of the above
ugcnetjune2014ii is&software-engineering

27.22.42 Is&software Engineering: UGCNET-June2014-III: 19 https://gateoverflow.in/56741

Match the following :

List – I List – II
a. Correctness i.
The extent to which a software tolerates
the unexpected problems.
b. Accuracy ii. The extent to which a software meets its
specification
c. Robustness iii. The extent to which a software has the
specified functions
d. Completeness iv. Meeting specifications with precision
Codes :
A. a-ii, b-iv, c-i, d-iii B. a-i, b-ii, c-iii, d-iv
C. a-ii, b-i, c-iv, d-iii D. a-iv, b-ii, c-i, d-iii
ugcnetjune2014iii is&software-engineering

27.22.43 Is&software Engineering: UGCNET-June2014-III: 20 https://gateoverflow.in/56743

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

27.22.44 Is&software Engineering: UGCNET-June2015-III: 44 https://gateoverflow.in/12766

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-gate ugcnetjune2015iii

27.22.45 Is&software Engineering: UGCNET-June2015-III: 45 https://gateoverflow.in/12744

Requirements prioritization and negotiation belongs to

A. Requirements validation B. Requirements elicitation
C. Feasibility study D. Requirements reviews
is&software-engineering non-gate ugcnetjune2015iii

27.22.46 Is&software Engineering: UGCNET-June2015-III: 60 https://gateoverflow.in/61422

Match the following :

List-I List-II
(a) Joint Application (i)
Delivers functionality in rapid iteration
Design (JAD) measured in weeks and needs frequent
communication, development, testing and
delivery
(b) Computer Aided (ii) Reusable applications generally with one
Software specific function. It is closely linked with
Engineering idea of web services and service oriented
architecture
(c) Agile development (iii) Tools to automate many tasks of SDLC
(d) Component (iv) A group based tool for collecting user
Based requirements and creating system design.
Technology Mostly used in analysis and design stages
of SDLC
Codes :
A. (a)-(i), (b)-(iii), (c)-(ii), (d)-(iv) B. (a)-(iv), (b)-(iii), (c)-(i), (d)-(ii)
C. (a)-(iii), (b)-(iv), (c)-(i), (d)-(ii) D. (a)-(iii), (b)-(i), (c)-(iv), (d)-(ii)
ugcnetjune2015iii is&software-engineering

27.22.47 Is&software Engineering: UGCNET-June2016-II: 41 https://gateoverflow.in/63483

I f S1 is total number of modules defined in the program architecture, S3 is the number of modules whose correct
function depends on prior processing then the number of modules not dependent on prior processing is:
S3 S3 S1 S1
A. 1 + S1 B. 1 − S1 C. 1 + S3 D. 1 − S3
ugcnetjune2016ii is&software-engineering

27.22.48 Is&software Engineering: UGCNET-June2016-III: 44 https://gateoverflow.in/63973

Match the software maintenance activities in List-I to its meaning in List-II.

 List-I List-II
a. Corrective
i. Concerning with performing activities to reduce
the software complexity thereby improving
program understandability and increasing
software maintainability
b. Adaptive ii. Concerned with fixing errors that are observed
when the software is in use
c. Perfective iii. Concerned with the change in the software that
takes place to make the software adaptable to
new environment (both hardware and software).
d. Preventive iv. Concerned with the change in the software that
takes place to make the software adaptable to
changing user requirements
Codes :
A. a-iv, b-i, c-iii, d-ii B. a-iv, b-i, c-ii, d-iii
C. a-iv, b-ii, c-i, d-iii D. a-i, b-iii, c-iv, d-ii
ugcnetjune2016iii is&software-engineering

27.22.49 Is&software Engineering: UGCNET-Oct2020-II: 19 https://gateoverflow.in/349654

Which of the following UML diagrams has a static view?

A. Collaboration diagram B. Use-Case diagram
C. State chart diagram D. Activity diagram
ugcnet-oct2020-ii non-gate is&software-engineering

27.22.50 Is&software Engineering: UGCNET-Oct2020-II: 20 https://gateoverflow.in/349653

Modifying the software by restructuring is called

A. Adaptive maintenance B. Corrective maintenance
C. Perfective maintenance D. Preventive maintenance
ugcnet-oct2020-ii non-gate is&software-engineering

27.22.51 Is&software Engineering: UGCNET-Oct2020-II: 21 https://gateoverflow.in/349652

A company has a choice of two languages L1 and L2 to develop a software for their client. Number of LOC required to
develop an application in L2 is thrice the LOC in language L1 . Also, software has to be maintained for next 10 years.
Various parameters for two languages are given below to decide which language should be preferred for development.
PARAMETER L1 L2
Man-year needed for development LOC / LOC
1000 / 1000
Development cost Rs. 70, 000 Rs. 90, 000
Cost of Maintenance per year Rs.1, 00, 000 Rs.40, 000
Total cost of project include cost of development and maintenance. What is the LOC for L1 for which cost of developing the
software with both languages must be same?

A. 2000 B. 6000 C. 3000 D. 5000

ugcnet-oct2020-ii non-gate is&software-engineering

27.22.52 Is&software Engineering: UGCNET-Oct2020-II: 22 https://gateoverflow.in/349651

A Software project was estimated at 864 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
Rs. 70, 000 per month, requirement gatherer is Rs. 50, 000 per month, programmer is Rs. 60, 000 per month and a tester is
Rs. 60, 000 per month. Average productivity for the team is 12 FP per person month. Which of the following represents the
projected cost of the project
A. Rs. 33, 20, 000 B. Rs. 43, 20, 000
C. Rs. 33, 10, 000 D. Rs. 22, 10, 000
 ugcnet-oct2020-ii non-gate is&software-engineering

27.22.53 Is&software Engineering: UGCNET-Oct2020-II: 45 https://gateoverflow.in/349628

Which of the following statements regarding XML is/are True?

a. XML is a set of tags designed

b. XML to defines
tell browsers
a syntax
howfor
c.torepresenting
<Letter>,
display text
<LETTER>
data,
and images
but the
and Choose
inmeaning
a<letter>
web page
ofthe
are correct
data
three
variesanswer
different from the options
from application
tags in XML given
to application
below:

A. (a) and (b) only B. (a) and (c) only C. (b) and (c) only D. (a) (b) and (c)
ugcnet-oct2020-ii non-gate is&software-engineering

27.22.54 Is&software Engineering: UGCNET-Oct2020-II: 49 https://gateoverflow.in/349624

Software reliability is described with respect to

a. Execution Time b. Calender Time c. Clock Time Choose the correct answer from the options given
below:

A. (a) and (b) only B. (b) and (c) only C. (a), (b) and (c) D. (a) and (c) only
ugcnet-oct2020-ii non-gate is&software-engineering

27.22.55 Is&software Engineering: UGCNET-Oct2020-II: 50 https://gateoverflow.in/349623

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 accuracy and
d. Identifies events that do not derive the interaction sequence
consistency Choose the correct answer from the options given below:
A. (a), (b) and (c) only B. (a), (b) and (d) only
C. (b), (c) and (d) only D. (a), (c) and (d) only
ugcnet-oct2020-ii non-gate is&software-engineering

27.22.56 Is&software Engineering: UGCNET-Oct2020-II: 51 https://gateoverflow.in/349622

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. (b) and (d) only B. (a), (b) and (c) only
C. (d) and (e) only D. (a), (c) and (e) only
ugcnet-oct2020-ii non-gate is&software-engineering

27.22.57 Is&software Engineering: UGCNET-Oct2020-II: 68 https://gateoverflow.in/349605

Match list I with List II

With reference to CMM developed by Software Engineering Institute (SEI)
List I List II
(A) INITIAL (I) Process measurement
(B) REPEATABLE (II) Process definition
(C) DEFINED (III) Project management
(D) MANAGED (IV ) ADHOC
Choose the correct answer from the options given below:
A. A − III, B − IV , C − II, D − I B. A − IV , B − III, C − I, D − II
C. A − IV , B − III, C − II, D − I D. A − III, B − IV , C − I, D − II
ugcnet-oct2020-ii non-gate is&software-engineering
 27.22.58 Is&software Engineering: UGCNET-Oct2020-II: 77 https://gateoverflow.in/349596

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. a→d→e→c→b
B. a→e→d→c→b
C. b→e→c→d→a
D. b→c→e→d→a

ugcnet-oct2020-ii non-gate is&software-engineering

27.22.59 Is&software Engineering: UGCNET-Oct2020-II: 85 https://gateoverflow.in/349588

Statement I : 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 II : 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 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

ugcnet-oct2020-ii non-gate is&software-engineering

27.22.60 Is&software Engineering: UGCNET-Sep2013-II: 28 https://gateoverflow.in/59226

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

27.23 Life Cycle Model (1)

27.23.1 Life Cycle Model: UGCNET-June2015-II: 43 https://gateoverflow.in/61085

Which process model is also called as classic life cycle model?

A. Waterfall model B. RAD model
C. Prototyping model D. Incremental model
ugcnetjune2015ii is&software-engineering life-cycle-model

27.24 Linear Programming (1)

27.24.1 Linear Programming: UGCNET-June2012-III: 49 https://gateoverflow.in/56300

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
ugcnetjune2012iii optimization linear-programming
27.25 Mis (1)

27.25.1 Mis: UGCNET-June2016-III: 71 https://gateoverflow.in/64125

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

ugcnetjune2016iii mis is&software-engineering

27.26 Model View Controller (1)

27.26.1 Model View Controller: UGCNET-June-2019-II: 52 https://gateoverflow.in/316227

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

ugcnetjune2019ii model-view-controller

27.27 Object Oriented Modelling (1)

27.27.1 Object Oriented Modelling: UGCNET-Dec2014-III: 41 https://gateoverflow.in/60690

What is true about UML stereotypes ?

A. Stereotype is used for extending the UML language.

B. Stereotyped class must be abstract
C. The stereotype indicates that the UML element cannot be changed
D. UML profiles can be stereotyped for backward compatibility

ugcnetdec2014iii object-oriented-modelling uml

27.28 Project Planning (1)

27.28.1 Project Planning: UGCNET-June2015-II: 45 https://gateoverflow.in/61087

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

ugcnetjune2015ii is&software-engineering project-planning

27.29 Project Tracking (1)

27.29.1 Project Tracking: UGCNET-June-2019-II: 59 https://gateoverflow.in/316220

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

 ugcnetjune2019ii project-tracking risk-monitoring

27.30 Risk Management (3)

27.30.1 Risk Management: UGCNET-Dec2014-III: 45 https://gateoverflow.in/60790

Assume that the software team defines a project risk with 80% probability of occurrence of risk in the following
manner: Only 70 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 60 reusable components were planned with average component
size as 100 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

ugcnetdec2014iii is&software-engineering risk-management

27.30.2 Risk Management: UGCNET-June2014-II: 12 https://gateoverflow.in/53478

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
ugcnetjune2014ii is&software-engineering risk-management

27.30.3 Risk Management: UGCNET-Sep2013-III: 50 https://gateoverflow.in/59871

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
ugcnetsep2013iii is&software-engineering risk-management

27.31 Size Metrices (1)

27.31.1 Size Metrices: UGCNET-June2015-II: 41 https://gateoverflow.in/61083

Match the following:

a. Size-oriented i. uses number of external interfaces as one of

metrics the measurement parameters
b. Function-oriented ii. originally designed to be applied to
metrics business information systems
c. Extended function iii. derived by normalizing quality and/or productivity
point metrics measures by considering the size of the software
d. Function point iv. uses algorithm characteristics as one of
the measurement parameter

A. a − iii, b − iv, c − i, d − ii B. a − ii, b − i, c − iv, d − iii

C. a − iv, b − ii, c − iii, d − i D. a − iii, b − i, c − iv, d − ii
ugcnetjune2015ii size-metrices is&software-engineering

27.32 Software (1)

27.32.1 Software: UGCNET-Jan2017-II: 45 https://gateoverflow.in/335118

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-gate is&software-engineering

27.33 Software Configuration (1)

 27.33.1 Software Configuration: UGCNET-Dec2013-III: 7 https://gateoverflow.in/60389

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
ugcnetdec2013iii is&software-engineering software-configuration

27.34 Software Cost Estimation (1)

27.34.1 Software Cost Estimation: UGCNET-June2014-III: 18 https://gateoverflow.in/56737

Consider a project with the following functional units :

Number of user inputs = 50
Number of user outputs = 40
Number of user enquiries = 35
Number of user files = 06
Number of external interfaces = 04
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

27.35 Software Design (14)

27.35.1 Software Design: UGCNET-AUG2016-II: 43 https://gateoverflow.in/70355

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
ugcnetaug2016ii is&software-engineering software-design

27.35.2 Software Design: UGCNET-Dec2011-II: 41 https://gateoverflow.in/64066

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
ugcnetdec2011ii is&software-engineering software-design

27.35.3 Software Design: UGCNET-Dec2014-II: 43 https://gateoverflow.in/59828

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
ugcnetdec2014ii is&software-engineering software-design

27.35.4 Software Design: UGCNET-July-2018-II: 17 https://gateoverflow.in/225869

A software design pattern often used to restrict access to an object is

A. adapter B. decorator C. delegation D. proxy

ugcnetjuly2018ii is&software-engineering software-design

27.35.5 Software Design: UGCNET-June2010-II: 42 https://gateoverflow.in/68041

Top-down design does not require

 A. Step-wise refinement B. Loop invariants
C. Flow charting D. Modularity
ugcnetjune2010ii is&software-engineering software-design

27.35.6 Software Design: UGCNET-June2010-II: 44 https://gateoverflow.in/68043

Design phase will usually be

A. Top-down B. Bottom-up C. Random D. Centre fringing

ugcnetjune2010ii is&software-engineering software-design

27.35.7 Software Design: UGCNET-June2013-III: 1 https://gateoverflow.in/58248

The Software Maturity Index (SMI) is defined as SMI = [Mf – (Fa + Fc + Fd )]/Mf
where Mf = number of modules in current release
Fa =the number of module in the current release that have been added
Fc = the number of module in the current release that have been changed
Fd = 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
ugcnetjune2013iii is&software-engineering software-design non-gate

27.35.8 Software Design: UGCNET-June2013-III: 10 https://gateoverflow.in/58272

Match the following :

a. RAID 0 i. Bit interleaved parity
b. RAID 1 ii. Non redundant stripping
c. RAID 2 iii. Mirrored disks
d. RAID 3 iv. Error correcting codes
Codes:
A. a-iv, b-i, c-ii, d-iii B. a-iii, b-iv, c-i, d-ii
C. a-iii, b-i, c-iv, d-ii D. a-iii, b-ii, c-iv, d-i
ugcnetjune2013iii is&software-engineering software-design

27.35.9 Software Design: UGCNET-June2013-III: 3 https://gateoverflow.in/47604

______ 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
ugcnetjune2013iii is&software-engineering software-design

27.35.10 Software Design: UGCNET-June2013-III: 5 https://gateoverflow.in/58257

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
ugcnetjune2013iii is&software-engineering software-design

27.35.11 Software Design: UGCNET-June2015-III: 42 https://gateoverflow.in/61279

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
ugcnetjune2015iii software-design is&software-engineering

27.35.12 Software Design: UGCNET-June2015-III: 47 https://gateoverflow.in/61316

A Design Concept Refinement is a

A. Top-down approach B. Complementary of abstraction concept
C. process of elaboration D. All of the above
ugcnetjune2015iii software-design is&software-engineering

27.35.13 Software Design: UGCNET-June2015-III: 48 https://gateoverflow.in/61317

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

ugcnetjune2015iii is&software-engineering software-design

27.35.14 Software Design: UGCNET-June2016-III: 45 https://gateoverflow.in/63974

Match each application/software design concept in List-I to its definition in List-II.

List-I List-II
I. Coupling (a)
Easy to visually inspect the design of the
software and understand its purpose
II. Cohesion (b) Easy to add functionability to a software
without having to redesign it
III. Scalable (c) Focus of a code upon a single goal
IV. Readable (d) Relaince of a code module upon other code
modules
Codes :
A. I-b, II-a, III-d, IV-c B. I-c, II-d, III-a, IV-b
C. I-d, II-c, III-b, IV-a D. I-d, II-a, III-c, IV-b
ugcnetjune2016iii is&software-engineering software-design

27.36 Software Development (3)

27.36.1 Software Development: UGCNET-July-2018-II: 11 https://gateoverflow.in/225875

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)

ugcnetjuly2018ii is&software-engineering software-development

27.36.2 Software Development: UGCNET-Sep2013-II: 27 https://gateoverflow.in/59225

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

27.36.3 Software Development: UGCNET-dec2009-ii-43 https://gateoverflow.in/152934

Software Engineering is a discipline that integrates _________ for the development of computer software.

(A) Process

(B) Methods

(C) Tools

(D) All
ugcnetdec2009ii is&software-engineering software-development

27.37 Software Development Life Cycle Models (11)

27.37.1 Software Development Life Cycle Models: UGCNET-AUG2016-III: 44 https://gateoverflow.in/71565

Match each software lifecycle model in List – I to its description in List – II :

List-I List-II
I. Code-and-Fix a. Assess risks at each step; do most critical
action first
II. Evolutionary b. Build an initial small requirement specifications,
code it, then “evolve” the specifications and code
Prototyping as needed
III. Spiral c. Build initial requirement specification for several
releases, then design-and-code in sequence
IV. Stagged delivery d. Standard phases (requirements, design, code, test)
in order
V. Waterfall e. Write some code,debug it, repeat(i.e. ad-hoc)
Codes :
A. I-e, II-b, III-a, IV-c, V-d B. I-e,II-c, III-a IV-b, V-d
C. I-d, II-a, III-b, IV-c, V-e D. I-c, II-e, III-a, IV-b, V-d
ugcnetaug2016iii is&software-engineering software-development-life-cycle-models

27.37.2 Software Development Life Cycle Models: UGCNET-Dec2010-II: 42 https://gateoverflow.in/67033

Which one of these are not software maintenance activity ?

A. Error correction B. Adaptation
C. Implementation of Enhancement D. Establishing scope
ugcnetdec2010ii is&software-engineering software-development-life-cycle-models

27.37.3 Software Development Life Cycle Models: UGCNET-Dec2010-II: 43 https://gateoverflow.in/67034

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
ugcnetdec2010ii is&software-engineering software-development-life-cycle-models

27.37.4 Software Development Life Cycle Models: UGCNET-Dec2011-II: 13 https://gateoverflow.in/63077

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
ugcnetdec2011ii is&software-engineering software-development-life-cycle-models
27.37.5 Software Development Life Cycle Models: UGCNET-Dec2012-II: 24 https://gateoverflow.in/56841

RAD stands for

A. Rapid and Design B. Rapid Aided Development
C. Rapid Application Development D. Rapid Application Design
ugcnetdec2012ii is&software-engineering software-development-life-cycle-models

27.37.6 Software Development Life Cycle Models: UGCNET-Dec2012-II: 48 https://gateoverflow.in/57139

_____ is an “umbrella” activity that is applied throughout the software engineering process.
A. Debugging B. Testing
C. Designing D. Software quality assurance
ugcnetdec2012ii is&software-engineering software-development-life-cycle-models

27.37.7 Software Development Life Cycle Models: UGCNET-Dec2015-II: 47 https://gateoverflow.in/62325

Which of the following is not a software process model?

A. Prototyping B. Iterative C. Timeboxiing D. Glassboxing

ugcnetdec2015ii is&software-engineering software-development-life-cycle-models

27.37.8 Software Development Life Cycle Models: UGCNET-June-2019-II: 57 https://gateoverflow.in/316222

Match List-I with List-II:

List-I
(Software
Process
Models) List-II
(Software Systems)
(a) Waterfall model (i) e-business software that starts with only the
basic functionalities and then moves on to
more advanced features
(b) Incremental
development (ii) An inventory control system for super-
market to be developed within three months
(c) Prototyping (iii) A virtual reality system for simulating
vehicle nevigation in a highway
(d) RAD (iv) Automate the manual system for student
record maintenance in a school

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
ugcnetjune2019ii software-development-life-cycle-models

27.37.9 Software Development Life Cycle Models: UGCNET-June2016-II: 42 https://gateoverflow.in/63484

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
ugcnetjune2016ii is&software-engineering software-development-life-cycle-models
 27.37.10 Software Development Life Cycle Models: UGCNET-Sep2013-II: 29 https://gateoverflow.in/59227

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

27.37.11 Software Development Life Cycle Models: UGCNET-dec2008-ii-44 https://gateoverflow.in/155368

Which level is called as “ defined” in capability maturity model?

A. level 0 B. level 3
C. level 4 D. level 1
ugcnetdec2008ii is&software-engineering software-development-life-cycle-models

27.38 Software Development Models (1)

27.38.1 Software Development Models: UGCNET-June2010-II: 43 https://gateoverflow.in/68042

Which model is simplest model in Software Development ?

A. Waterfall model B. Prototyping C. Iterative D. None of these

ugcnetjune2010ii is&software-engineering software-development-models

27.39 Software Intergrity (1)

27.39.1 Software Intergrity: UGCNET-June-2019-II: 56 https://gateoverflow.in/316223

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 30 percent. The application does not contain sensitive or controversial
information, so the threat probability is 25 percent. What is the integrity of the web application?

A. 0.625 B. 0.725 C. 0.775 D. 0.825

ugcnetjune2019ii software-intergrity

27.40 Software Maintenance (2)

27.40.1 Software Maintenance: UGCNET-June2015-III: 46 https://gateoverflow.in/61315

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

ugcnetjune2015iii software-maintenance is&software-engineering

27.40.2 Software Maintenance: UGCNET-Sep2013-III: 45 https://gateoverflow.in/59864

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
ugcnetsep2013iii is&software-engineering software-maintenance

27.41 Software Metrics (3)

27.41.1 Software Metrics: UGCNET-Dec2014-II: 44 https://gateoverflow.in/59829

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
ugcnetdec2014ii is&software-engineering software-metrics
 27.41.2 Software Metrics: UGCNET-June2012-III: 33 https://gateoverflow.in/56265

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 G is V (G) = N − E + 2 , where E is the number of edges and N is the number
of nodes in flow graph.
C. Cyclomatic complexity for a flow graph G is V (G) = E − N + 2 , where E is the number of edges and N is the number
of nodes in flow graph.
D. Cyclomatic complexity for a flow graph G is V (G) = P + 1 , where P is the number of predicate nodes contained in the
flow graph G.

ugcnetjune2012iii is&software-engineering software-metrics

27.41.3 Software Metrics: UGCNET-June2016-III: 48 https://gateoverflow.in/63977

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)b
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
ugcnetjune2016iii is&software-engineering software-metrics

27.42 Software Process (1)

27.42.1 Software Process: UGCNET-Dec2014-II: 41 https://gateoverflow.in/59826

_________ are applied throughout the software process.

A. Framework activities B. Umbrella activities
C. Planning activities D. Construction activities
ugcnetdec2014ii is&software-engineering software-process

27.43 Software Quality Assurance (2)

27.43.1 Software Quality Assurance: UGCNET-AUG2016-III: 46 https://gateoverflow.in/71567

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
ugcnetaug2016iii is&software-engineering software-quality-assurance

27.43.2 Software Quality Assurance: UGCNET-Dec2012-III: 55 https://gateoverflow.in/57730

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

ugcnetdec2012iii is&software-engineering software-quality-assurance

27.44 Software Quality Characteristics (1)

27.44.1 Software Quality Characteristics: UGCNET-June2016-II: 45 https://gateoverflow.in/63487

The extent to which a software tolerates the unexpected problems, is termed as

A. Accuracy B. Reliability C. Correctness D. Robustness

ugcnetjune2016ii software-quality-characteristics

27.45 Software Reliability (8)

27.45.1 Software Reliability: UGCNET-AUG2016-II: 45 https://gateoverflow.in/70361

The extent to which a software performs its intended functions without failures, is termed as

A. Robustness B. Correctness C. Reliability D. Accuracy

ugcnetaug2016ii is&software-engineering software-reliability

27.45.2 Software Reliability: UGCNET-Dec2011-II: 16 https://gateoverflow.in/63551

Emergency fixes known as patches are result of

A. Adaptive maintenance B. Perfective maintenance
C. Corrective maintenance D. None of the above
ugcnetdec2011ii is&software-engineering software-reliability

27.45.3 Software Reliability: UGCNET-Dec2014-III: 46 https://gateoverflow.in/60795

Maximum possible value of reliability is

A. 100 B. 10 C. 1 D. 0
ugcnetdec2014iii is&software-engineering software-reliability

27.45.4 Software Reliability: UGCNET-June2013-III: 2 https://gateoverflow.in/58255

Match the following :

a. Watson-Felix model i. Failure intensity
b. Ouick-Fix model ii. Cost estimation
c. Putnam resouce allocation model iii. Project planning
d. Logarithmetic Poission Model iv. Maintainace
Codes :
A. a-ii, b-i, c-iv, d-iii B. a-i, b-ii, c-iv, d-iii
C. a-ii, b-i, c-iii, d-iv D. a-ii, b-iv, c-iii, d-i
ugcnetjune2013iii is&software-engineering software-reliability non-gate

27.45.5 Software Reliability: UGCNET-June2013-III: 6 https://gateoverflow.in/58258

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
ugcnetjune2013iii is&software-engineering software-reliability

27.45.6 Software Reliability: UGCNET-June2014-III: 17 https://gateoverflow.in/101341

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

27.45.7 Software Reliability: UGCNET-June2016-III: 43 https://gateoverflow.in/63970

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%

ugcnetjune2016iii is&software-engineering software-reliability
 27.45.8 Software Reliability: UGCNET-Sep2013-III: 44 https://gateoverflow.in/59863

The failure intensity for a basic model as a function of failures experienced is given as λ(μ) − λ0 [1 − (μ)/(V0 )]
where λ0 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 V0 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
ugcnetsep2013iii is&software-engineering software-reliability

27.46 Software Requirement Specification (1)

27.46.1 Software Requirement Specification: UGCNET-Sep2013-II: 31 https://gateoverflow.in/59230

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

27.47 Software Requirement Specifications (1)

27.47.1 Software Requirement Specifications: UGCNET-AUG2016-II: 41 https://gateoverflow.in/70320

Which of the following is used to determine the specificity of requirements ?

A.
n1
B.
n1
C. n1 + n2 D. n1 − n2 Where n1 is the number
n2 n2
of requirements for
which all reviewers have identical interpretations, n2 is number of requirements in a specification.

ugcnetaug2016ii is&software-engineering software-requirement-specifications

27.48 Software Reuse (1)

27.48.1 Software Reuse: UGCNET-June-2019-II: 54 https://gateoverflow.in/316225

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

ugcnetjune2019ii software-reuse

27.49 Software Testing (23)

27.49.1 Software Testing: ISRO-2013-69, UGCNET-Dec2012-III: 62 https://gateoverflow.in/45563

If a program P calls two subprograms P 1 and P 2 and P 1 can fail 50% of the time and P 2 can fail 40% of the time,
what is the failure rate of program P ?

A. 50% B. 60% C. 70% D. 10%

isro2013 is&software-engineering software-testing non-gate ugcnetdec2012iii
27.49.2 Software Testing: UGCNET-AUG2016-II: 44 https://gateoverflow.in/70357

For a program of k variables, boundary value analysis yields ______ test cases.

A. 4k– 1 B. 4k C. 4k + 1 D. 2k – 1
ugcnetaug2016ii is&software-engineering software-testing

27.49.3 Software Testing: UGCNET-Dec2010-II: 15 https://gateoverflow.in/66605

“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
ugcnetdec2010ii is&software-engineering software-testing

27.49.4 Software Testing: UGCNET-Dec2010-II: 41 https://gateoverflow.in/67032

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
ugcnetdec2010ii is&software-engineering software-testing

27.49.5 Software Testing: UGCNET-Dec2011-II: 18 https://gateoverflow.in/63554

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
ugcnetdec2011ii is&software-engineering software-testing

27.49.6 Software Testing: UGCNET-Dec2012-II: 31 https://gateoverflow.in/57068

Basis path testing falls under

A. system testing B. white box testing
C. black box testing D. unit testing
ugcnetdec2012ii is&software-engineering software-testing

27.49.7 Software Testing: UGCNET-Dec2013-III: 8 https://gateoverflow.in/60390

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
ugcnetdec2013iii is&software-engineering software-testing

27.49.8 Software Testing: UGCNET-Dec2015-II: 46 https://gateoverflow.in/62324

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

ugcnetdec2015ii is&software-engineering software-testing

27.49.9 Software Testing: UGCNET-Jan2017-III: 43 https://gateoverflow.in/335195

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
ugcnetjan2017iii is&software-engineering software-testing

27.49.10 Software Testing: UGCNET-Jan2017-III: 44 https://gateoverflow.in/335194

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
ugcnetjan2017iii is&software-engineering software-testing

27.49.11 Software Testing: UGCNET-June2012-III: 30 https://gateoverflow.in/56262

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
ugcnetjune2012iii is&software-engineering software-testing

27.49.12 Software Testing: UGCNET-June2013-III: 4 https://gateoverflow.in/58256

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
ugcnetjune2013iii is&software-engineering software-testing non-gate

27.49.13 Software Testing: UGCNET-June2014-II: 15 https://gateoverflow.in/53486

Regression testing is primarily related to

A. Functional testing B. Development testing
C. Data flow testing D. Maintenance testing
ugcnetjune2014ii is&software-engineering software-testing

27.49.14 Software Testing: UGCNET-June2014-III: 16 https://gateoverflow.in/101338

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

27.49.15 Software Testing: UGCNET-June2015-II: 42 https://gateoverflow.in/61084

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
ugcnetjune2015ii software-testing is&software-engineering

27.49.16 Software Testing: UGCNET-Sep2013-II: 30 https://gateoverflow.in/59229

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

27.49.17 Software Testing: UGCNET-Sep2013-III: 29 https://gateoverflow.in/59849

____ 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

ugcnetsep2013iii is&software-engineering software-testing

27.49.18 Software Testing: UGCNET-Sep2013-III: 43 https://gateoverflow.in/59862

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

ugcnetsep2013iii is&software-engineering software-testing

27.49.19 Software Testing: UGCNET-dec2005-41 https://gateoverflow.in/156272

The testing of software against SRS is called:

(A) Acceptance testing (B) Integration testing
(C) Regression testing (D) Series testing
software-testing

27.49.20 Software Testing: UGCNET-dec2005-44 https://gateoverflow.in/156279

Successive layer of design in software using bottom-up design is called:

(A) Layer of Refinement (B) Layer of Construction
(C) Layer of abstraction (D) None of the above
software-testing

27.49.21 Software Testing: UGCNET-dec2008-ii-43 https://gateoverflow.in/155367

Software Quality Assurance ( SQA ) encompasses :

A. verification
B. validation
C. both verification and validation
D. none of the above

ugcnetdec2008ii is&software-engineering software-testing

27.49.22 Software Testing: UGCNET-dec2009-ii-42 https://gateoverflow.in/152935

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

ugcnetdec2009ii is&software-engineering software-testing
 27.49.23 Software Testing: UGCNET-dec2009-ii-47 https://gateoverflow.in/152937

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.
ugcnetdec2009ii is&software-engineering software-testing

27.50 Software Validation (1)

27.50.1 Software Validation: UGCNET-Dec2012-III: 65 https://gateoverflow.in/57738

_____ 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
ugcnetdec2012iii is&software-engineering software-validation

27.51 Source Code Metric (1)

27.51.1 Source Code Metric: UGCNET-Dec2014-III: 43 https://gateoverflow.in/60783

Which one of the following is not a source code metric ?

A. Halstead metric B. Function point metric
C. Complexity metric D. Length metric
ugcnetdec2014iii is&software-engineering source-code-metric

27.52 Uml (1)

27.52.1 Uml: UGCNET-June2013-III: 26 https://gateoverflow.in/58483

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

ugcnetjune2013iii is&software-engineering uml

27.53 Validation (1)

27.53.1 Validation: UGCNET-June-2019-II: 60 https://gateoverflow.in/316219

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
ugcnetjune2019ii validation

27.54 Waterfall Model (2)

27.54.1 Waterfall Model: UGCNET-AUG2016-II: 42 https://gateoverflow.in/70321

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.

ugcnetaug2016ii is&software-engineering waterfall-model

27.54.2 Waterfall Model: UGCNET-June2016-II: 43 https://gateoverflow.in/63485

Which of the following is not included in the waterfall model?

 A. Requirement analysis B. Risk analysis
C. Design D. Coding
ugcnetjune2016ii waterfall-model

27.55 White Box Testing (1)

27.55.1 White Box Testing: UGCNET-June-2019-II: 53 https://gateoverflow.in/316226

In the context of software testing, which of the following statements is/are NOT correct?
P: A minimal test set that achieves 100% path coverage will also achieve 100% statement coverage.
Q: A minimal test set that achieves 100% path coverage will generally detect more faults than one that achieves 100%
statement coverage.
R: A minimal test set that achieves 100% statement coverage will generally detect more faults than one that achieves 100%
branch coverage.

A. R only B. Q only C. P and Q only D. Q and R only

ugcnetjune2019ii white-box-testing statement-coverage-branch-coverage-path-coverage

Answer Keys
27.0.1 Q-Q 27.0.2 Q-Q 27.0.3 Q-Q 27.0.4 Q-Q 27.0.5 Q-Q
27.0.6 Q-Q 27.0.7 Q-Q 27.0.8 Q-Q 27.0.9 Q-Q 27.0.10 Q-Q
27.0.11 Q-Q 27.0.12 Q-Q 27.0.13 Q-Q 27.0.14 Q-Q 27.0.15 Q-Q
27.0.16 Q-Q 27.0.17 Q-Q 27.0.18 Q-Q 27.0.19 Q-Q 27.0.20 Q-Q
27.0.21 Q-Q 27.0.22 Q-Q 27.1.1 B 27.2.1 C 27.2.2 B
27.3.1 B 27.4.1 C 27.4.2 C 27.4.3 B 27.5.1 Q-Q
27.6.1 Q-Q 27.6.2 A 27.6.3 Q-Q 27.7.1 B 27.8.1 D
27.8.2 C 27.9.1 A 27.9.2 Q-Q 27.10.1 B 27.10.2 Q-Q
27.10.3 B 27.11.1 B 27.12.1 C 27.13.1 B 27.13.2 D
27.13.3 A 27.14.1 C 27.14.2 C 27.15.1 B 27.16.1 A
27.17.1 A 27.18.1 Q-Q 27.19.1 B 27.19.2 C 27.20.1 C
27.21.1 B 27.22.1 Q-Q 27.22.2 Q-Q 27.22.3 B 27.22.4 Q-Q
27.22.5 Q-Q 27.22.6 A 27.22.7 C 27.22.8 B 27.22.9 C
27.22.10 D 27.22.11 C 27.22.12 D 27.22.13 D 27.22.14 A
27.22.15 A 27.22.16 C 27.22.17 D 27.22.18 B 27.22.19 B
27.22.20 D 27.22.21 A 27.22.22 A 27.22.23 Q-Q 27.22.24 Q-Q
27.22.25 Q-Q 27.22.26 Q-Q 27.22.27 Q-Q 27.22.28 Q-Q 27.22.29 Q-Q
27.22.30 D 27.22.31 C 27.22.32 B 27.22.33 C 27.22.34 B
27.22.35 B 27.22.36 B 27.22.37 B 27.22.38 B 27.22.39 A
27.22.40 C 27.22.41 B 27.22.42 A 27.22.43 C 27.22.44 B
27.22.45 B 27.22.46 B 27.22.47 B 27.22.48 B 27.22.49 B
27.22.50 C 27.22.51 C 27.22.52 B 27.22.53 C 27.22.54 C
27.22.55 A 27.22.56 B 27.22.57 C 27.22.58 D 27.22.59 A
27.22.60 C 27.23.1 A 27.24.1 B 27.25.1 B 27.26.1 C
27.27.1 A 27.28.1 C 27.29.1 D 27.30.1 B 27.30.2 D
27.30.3 B 27.31.1 D 27.32.1 B 27.33.1 B 27.34.1 D
27.35.1 Q-Q 27.35.2 Q-Q 27.35.3 B 27.35.4 Q-Q 27.35.5 Q-Q
27.35.6 Q-Q 27.35.7 A 27.35.8 X 27.35.9 C 27.35.10 B

27.35.11 C 27.35.12 D 27.35.13 A 27.35.14 C 27.36.1 Q-Q

27.36.2 C 27.36.3 Q-Q 27.37.1 Q-Q 27.37.2 Q-Q 27.37.3 Q-Q
27.37.4 Q-Q 27.37.5 C 27.37.6 D 27.37.7 D 27.37.8 D
27.37.9 C 27.37.10 A 27.37.11 Q-Q 27.38.1 Q-Q 27.39.1 D
27.40.1 B 27.40.2 B 27.41.1 D 27.41.2 B 27.41.3 C
27.42.1 B 27.43.1 Q-Q 27.43.2 D 27.44.1 D 27.45.1 Q-Q
27.45.2 Q-Q 27.45.3 C 27.45.4 D 27.45.5 B 27.45.6 B
27.45.7 C 27.45.8 C 27.46.1 D 27.47.1 Q-Q 27.48.1 B
27.49.1 C 27.49.2 Q-Q 27.49.3 Q-Q 27.49.4 Q-Q 27.49.5 Q-Q
27.49.6 B 27.49.7 B 27.49.8 C 27.49.9 D 27.49.10 C
27.49.11 C 27.49.12 B 27.49.13 D 27.49.14 D 27.49.15 A
27.49.16 B 27.49.17 D 27.49.18 B 27.49.19 Q-Q 27.49.20 Q-Q
27.49.21 Q-Q 27.49.22 B 27.49.23 Q-Q 27.50.1 D 27.51.1 B
27.52.1 A 27.53.1 C 27.54.1 Q-Q 27.54.2 B 27.55.1 A
28 Non GATE: Java (11)

28.1 Abstract Method (1)

28.1.1 Abstract Method: UGCNET-AUG2016-III: 40 https://gateoverflow.in/70968

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.

ugcnetaug2016iii java abstract-method

28.2 Applet (1)

28.2.1 Applet: UGCNET-Dec2014-III: 42 https://gateoverflow.in/60691

Which method is called first by an applet program ?

A. start( ) B. run( ) C. init( ) D. begin( )

ugcnetdec2014iii java applet

28.3 Java (4)

28.3.1 Java: UGCNET-AUG2016-III: 42 https://gateoverflow.in/71558

Java uses threads to enable the entire environment to be ______.

A. Symmetric B. Asymmetric C. Synchronous D. Asynchronous

ugcnetaug2016iii java threads

28.3.2 Java: UGCNET-DEC2016-III: 39 https://gateoverflow.in/113833

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. 59 B. 95 C. 69 D. 99
ugcnetdec2016iii java programming recursion

28.3.3 Java: UGCNET-July-2018-II: 3 https://gateoverflow.in/225883

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

ugcnetjuly2018ii java

28.3.4 Java: UGCNET-June-2019-II: 23 https://gateoverflow.in/316256

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
ugcnetjune2019ii java

28.4 Method Overriding (1)

28.4.1 Method Overriding: UGCNET-AUG2016-III: 38 https://gateoverflow.in/70966

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.
ugcnetaug2016iii java method-overriding

28.5 Multi Threaded Programming (1)

28.5.1 Multi Threaded Programming: UGCNET-Dec2014-III: 37 https://gateoverflow.in/60634

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
ugcnetdec2014iii java multi-threaded-programming

28.6 Oops (1)

28.6.1 Oops: UGCNET-June2016-III: 40 https://gateoverflow.in/63966

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

ugcnetjune2016iii oops java

28.7 Servlet (1)

 28.7.1 Servlet: UGCNET-June2014-III: 52 https://gateoverflow.in/57198

Match the following interfaces of Java. Servlet package :

List – I List – II
a. Servlet config i Enables Servlets to log events
b. Servlet Context ii. Read data from a client
c. Servlet Request iii. Write data to a client
d. Servlet Response iv. To get initialization parameters
Codes :
A. a-iii, b-iv, c-ii, d-i B. a-iii, b-ii, c-iv, d-i
C. a-ii, b-iii, c-iv, d-i D. a-iv, b-i, c-ii, d-iii
ugcnetjune2014iii java servlet

28.8 Wrapper Class Object (1)

28.8.1 Wrapper Class Object: UGCNET-Dec2014-III: 39 https://gateoverflow.in/60687

Converting a primitive type data into its corresponding wrapper class object instance is called

A. Boxing B. Wrapping C. Instantiation D. Autoboxing

ugcnetdec2014iii java wrapper-class-object

Answer Keys
28.1.1 Q-Q 28.2.1 C 28.3.1 Q-Q 28.3.2 B 28.3.3 Q-Q
28.3.4 X 28.4.1 Q-Q 28.5.1 B 28.6.1 B;C 28.7.1 D
28.8.1 D
29 Non GATE: Numerical Methods (3)

29.1 Hungarian Method (1)

29.1.1 Hungarian Method: UGCNET-Dec2014-III: 69 https://gateoverflow.in/61521

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. 5 B. 11 C. 13 D. 15
ugcnetdec2014iii assignment-problem hungarian-method

29.2 Operation Research Pert Cpm (1)

29.2.1 Operation Research Pert Cpm: UGCNET-DEC2018-II: 8 https://gateoverflow.in/288369

In PERT/CPM, the merge event represents _____ of two or more events.

A. completion B. beginning C. splitting D. joining

ugcnetdec2018ii operation-research-pert-cpm

29.3 Simplex Method (1)

29.3.1 Simplex Method: UGCNET-June-2019-II: 10 https://gateoverflow.in/316269

Consider an LPP given as

Max Z = 2x1 − x2 + 2x3
subject to the constraints

2x1 + x2 ≤ 10x1 + 2x2 − 2x3 ≤ 20x1 + 2x3 ≤ 5x1 , x2 x3 ≥ 0

What shall be the solution of the LLP after applying first iteration of the Simplex Method?

A. x1 = 52 , x2 = 0, x3 = 0, Z = 5 B. x1 = 0, x2 = 0, x3 = 52 , Z = 5
C. x1 = 0, x2 = 52 , x3 = 0, Z = − 52 D. x1 = 0, x2 = 0, x3 = 10, Z = 20
ugcnetjune2019ii simplex-method

Answer Keys
29.1.1 C 29.2.1 Q-Q 29.3.1 B
30 Non GATE: Object Oriented Programming (59)

30.0.1 UGCNET-Dec2007-II: 14 https://gateoverflow.in/335770

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.

ugcnetdec2007ii

30.0.2 UGCNET-Dec2004-II: 15 https://gateoverflow.in/335382

Polymorphism means :
A. A template function B. Runtime type identification within a class hierarchy
C. Another name for operator overloading D. Virtual inheritance
ugcnetdec2004ii

30.0.3 UGCNET-Dec2007-II: 15 https://gateoverflow.in/335769

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.

ugcnetdec2007ii

30.1 Abstract Class (2)

30.1.1 Abstract Class: UGCNET-Dec2015-III: 29 https://gateoverflow.in/62486

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

ugcnetdec2015iii object-oriented-programming abstract-class

30.1.2 Abstract Class: UGCNET-Dec2015-III: 36 https://gateoverflow.in/62596

Which of the following is/are correct with reference to Abstract class and interface?
a. A class can inherit only one Abstract class but may inherit several
b. An abstract class can provide complete and default code but an
interfaces interface has no code
A. a is true B. b is true
C. Both a and b are true D. Neitehr a nor b are true
ugcnetdec2015iii object-oriented-programming abstract-class

30.2 C++ (2)

30.2.1 C++: UGCNET-AUG2016-II: 15 https://gateoverflow.in/69526

A function template in C++ provides _____ level of generalization.

 A. 4 B. 3 C. 2 D. 1
ugcnetaug2016ii object-oriented-programming c++ function

30.2.2 C++: UGCNET-Dec2014-II: 13 https://gateoverflow.in/59136

Which of the following is not a member of class ?

A. Static function B. Friend function
C. Const function D. Virtual function
ugcnetdec2014ii object-oriented-programming c++

30.3 Class (1)

30.3.1 Class: UGCNET-June2016-II: 13 , OOPS https://gateoverflow.in/63100

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

oops class

30.4 Composition (1)

30.4.1 Composition: UGCNET-AUG2016-III: 39 https://gateoverflow.in/70967

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.

ugcnetaug2016iii object-oriented-programming composition

30.5 Constructor (3)

30.5.1 Constructor: UGCNET-AUG2016-III: 37 https://gateoverflow.in/70963

Constructors have _____ return type.

A. void B. char C. int D. no

ugcnetaug2016iii object-oriented-programming constructor

30.5.2 Constructor: UGCNET-dec2008-ii-27 https://gateoverflow.in/155188

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

ugcnetdec2008ii object-oriented-programming constructor

30.5.3 Constructor: UGCNET-dec2008-ii-29 https://gateoverflow.in/155190

How many constructors can a class have ?

A. zero
B. 1
C. 2
 D. any number

ugcnetdec2008ii object-oriented-programming constructor

30.6 Cpp (1)

30.6.1 Cpp: UGCNET-june2008-ii-15 https://gateoverflow.in/155602

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.

ugcnetjune2008ii non-gate cpp object-oriented-programming

30.7 Final (1)

30.7.1 Final: UGCNET-July-2018-II: 6 https://gateoverflow.in/225880

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

ugcnetjuly2018ii object-oriented-programming java final

30.8 Friend Class (1)

30.8.1 Friend Class: UGCNET-June2016-II: 13 https://gateoverflow.in/360624

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 the 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

ugcnetjune2016ii object-oriented-programming friend-class

30.9 Friend Function (2)

30.9.1 Friend Function: UGCNET-AUG2016-II: 13 https://gateoverflow.in/69524

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.

ugcnetaug2016ii object-oriented-programming friend-function c++

30.9.2 Friend Function: UGCNET-June2014-II: 44 https://gateoverflow.in/55192

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

ugcnetjune2014ii object-oriented-programming friend-function

30.10 Inheritance (3)

30.10.1 Inheritance: UGCNET-Dec2013-II: 19 https://gateoverflow.in/60073

_____ 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

ugcnetdec2013ii inheritance

30.10.2 Inheritance: UGCNET-June2015-II: 12 https://gateoverflow.in/60956

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

ugcnetjune2015ii oops inheritance

30.10.3 Inheritance: UGCNET-June2015-II: 15 https://gateoverflow.in/60960

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

ugcnetjune2015ii oops inheritance

30.11 Java (10)

30.11.1 Java: UGCNET-Dec2012-III: 69 https://gateoverflow.in/57741

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 ( )
ugcnetdec2012iii object-oriented-programming java

30.11.2 Java: UGCNET-Jan2017-III: 38 https://gateoverflow.in/335200

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
ugcnetjan2017iii object-oriented-programming java

30.11.3 Java: UGCNET-Jan2017-III: 39 https://gateoverflow.in/335199

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. 59 B. 95
C. 69 D. 99
ugcnetjan2017iii object-oriented-programming java

30.11.4 Java: UGCNET-Jan2017-III: 40 https://gateoverflow.in/335198

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
ugcnetjan2017iii object-oriented-programming java

30.11.5 Java: UGCNET-June2012-III: 70, UGCNET-Sep2013-III: 52 https://gateoverflow.in/56425

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

ugcnetjune2012iii ugcnetsep2013iii object-oriented-programming java programming-in-c

30.11.6 Java: UGCNET-June2015-III: 37 https://gateoverflow.in/61268

In Java, when we implement an interface method, it must be declared as

A. Private B. Protected C. Public D. Friend

ugcnetjune2015iii object-oriented-programming java

30.11.7 Java: UGCNET-June2015-III: 38 https://gateoverflow.in/61271

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)
ugcnetjune2015iii object-oriented-programming java

30.11.8 Java: UGCNET-June2015-III: 39 https://gateoverflow.in/61272

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

ugcnetjune2015iii object-oriented-programming java

30.11.9 Java: UGCNET-June2016-III: 38 https://gateoverflow.in/63964

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
ugcnetjune2016iii object-oriented-programming java

30.11.10 Java: UGCNET-June2016-III: 42 https://gateoverflow.in/63968

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

ugcnetjune2016iii object-oriented-programming java

30.12 Object Oriented Programming (24)

30.12.1 Object Oriented Programming: UGCNET-Dec2012-III: 48 https://gateoverflow.in/57718

Functions defined with class name are called as

A. Inline Function B. Friend Function
C. Constructor D. Static Function
ugcnetdec2012iii object-oriented-programming functions

30.12.2 Object Oriented Programming: UGCNET-Dec2013-III: 10 https://gateoverflow.in/60392

Match the following with respect to relationship objects and classes :

List – I List – II
a. State diagram
i. Useful for both abstract modelling and for
designing actual program
b. Object diagram ii. Describe object classes
c. Class diagram iii. Useful for documenting test cases
d. Instance diagram iv. Describing the behaviour of a single class of
the obeiects
Codes :
A. a-iv, b-i, c-ii, d-iii B. a-ii, b-iii, c-iv, d-i
C. a-iii, b-iv, c-ii, d-i D. a-ii, b-iv, c-i, d-iii
ugcnetdec2013iii object-oriented-programming

30.12.3 Object Oriented Programming: UGCNET-Dec2013-III: 11 https://gateoverflow.in/60393

Match the following style rules for reusability :

List – I List – II
a. Keep methods coherenti. Write a method to get the last
element of a list
b. Keep methods small ii. Maintain a parallel structure
when possible
c. Keep methods consistent iii. Breaking a method into smaller parts
d. Provide uniform coverage iv. Performs a single function or a group
of a closely related functions
Codes :
A. a-iv, b-iii, c-ii, d-i B. a-ii, b-i, c-iv, d-iii
C. a-iii, b-iv, c-ii, d-i D. a-ii, b-iii, c-iv, d-i
ugcnetdec2013iii object-oriented-programming

30.12.4 Object Oriented Programming: UGCNET-Dec2013-III: 18 https://gateoverflow.in/60406

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
ugcnetdec2013iii object-oriented-programming

30.12.5 Object Oriented Programming: UGCNET-Dec2013-III: 19 https://gateoverflow.in/60409

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
ugcnetdec2013iii object-oriented-programming

30.12.6 Object Oriented Programming: UGCNET-Dec2014-II: 15 https://gateoverflow.in/59138

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.

ugcnetdec2014ii object-oriented-programming

30.12.7 Object Oriented Programming: UGCNET-Dec2015-II: 12 https://gateoverflow.in/62236

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
ugcnetdec2015ii object-oriented-programming

30.12.8 Object Oriented Programming: UGCNET-Dec2015-III: 30 https://gateoverflow.in/62588

Match the following with reference to object oriented modelling :

List-I List-II
(a) Polymorphism (i) Picking both operator and attributes with
operations appropriate to model an object
(b) Inheritance (ii) Hiding implementation details of
methods from users of objects
(c) Encapsulation (iii) Using similar operations
to do similar things
(d) Abstraction (iv) Create new classes from
existing class
Codes:
A. (a)-(iv), (b)-(iii), (c)-(i), (d)-(ii) B. (a)-(iii), (b)-(iv), (c)-(i), (d)-(ii)
C. (a)-(iii), (b)-(i), (c)-(ii), (d)-(iv) D. (a)-(iv), (b)-(iii), (c)-(ii), (d)-(i)
ugcnetdec2015iii object-oriented-programming

30.12.9 Object Oriented Programming: UGCNET-Jan2017-II: 11 https://gateoverflow.in/335152

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
30.12.10 Object Oriented Programming: UGCNET-Jan2017-II: 12 https://gateoverflow.in/335151

Which one of the following is correct for overloaded functions in C + +?

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

30.12.11 Object Oriented Programming: UGCNET-Jan2017-II: 14 https://gateoverflow.in/335149

Which of the following operators cannot be overloaded in C /C + + ?

A. Bitwise right shift assignment B. Address of

C. Indirection D. Structure reference
ugcnetjan2017ii object-oriented-programming

30.12.12 Object Oriented Programming: UGCNET-Jan2017-III: 37 https://gateoverflow.in/335201

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
ugcnetjan2017iii object-oriented-programming

30.12.13 Object Oriented Programming: UGCNET-July-2018-II: 5 https://gateoverflow.in/225881

Given below are three implementations of the swap() function in C++ :

(a) (b) (c)
void swap (int a, int b) void swap (int &a, int &b) void swap (int *a, int *b)
{ { {
int temp; int temp; int *temp;
temp = a; temp = a; temp = a;
a = b; a = b; a = b;
b = temp; b = temp; b = temp;
} } }
int main() int main() int main()
int p = 0,q = 1; int p = 0, int q = 1; int p = 0 , q = 1;
swap(p,q); swap(p,q); swap(p,q);
} } }
Which of these would actually swap the contents of the two integer variables p and q?

A. (a) only B. (b) only C. (c) only D. (b) and (c) only
ugcnetjuly2018ii object-oriented-programming

30.12.14 Object Oriented Programming: UGCNET-June2010-II: 13 https://gateoverflow.in/67834

Member of a class specified as ______ are accessible only to method of the class.

A. Private B. Public C. Protected D. Derive

ugcnetjune2010ii object-oriented-programming
30.12.15 Object Oriented Programming: UGCNET-June2010-II: 14 https://gateoverflow.in/67836

Match the following :

(a) Garbage collection in 1. Java
(b) Nameless Object 2. generic programming
(c) Template support 3. defines a class
(d) A forward reference 4. member function
(e) Derived class inherits from base class 5 within a statement
Codes :
A. (a)-1, (b)-5, (c)-4, (d)-2, (e)-3
B. (a)-1, (b)-5, (c)-2, (d)-3, (e)-4
C. (a)-5, (b)-1, (c)-2, (d)-4, (e)-4
D. (a)-5, (b)-4, (c)-3, (d)-1, (e)-2

ugcnetjune2010ii object-oriented-programming

30.12.16 Object Oriented Programming: UGCNET-June2014-III: 12 https://gateoverflow.in/55802

The control string in C++ 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

30.12.17 Object Oriented Programming: UGCNET-June2014-III: 13 https://gateoverflow.in/55804

Match the following with respect to I/O classes in object oriented programming :
List – I List – II
a. fopen() i. returns end of file
b. fclose() ii. return for any problem report
c. ferror() iii. return 0
d. feof() iv. returns a file pointer
Codes :
A. a-iv, b-i, c-ii, d-iii B. a-iii, b-i, c-iv, d-ii
C. a-ii, b-iii, c-iv, d-i D. a-iv, b-iii, c-i, d-ii
ugcnetjune2014iii object-oriented-programming programming-in-c

30.12.18 Object Oriented Programming: UGCNET-June2014-III: 49 https://gateoverflow.in/57191

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

30.12.19 Object Oriented Programming: UGCNET-June2014-III: 50 https://gateoverflow.in/57193

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

30.12.20 Object Oriented Programming: UGCNET-June2014-III: 51 https://gateoverflow.in/57196

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

30.12.21 Object Oriented Programming: UGCNET-June2016-II: 14 https://gateoverflow.in/63108

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

ugcnetjune2016ii object-oriented-programming

30.12.22 Object Oriented Programming: UGCNET-June2016-III: 37 https://gateoverflow.in/63961

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
ugcnetjune2016iii object-oriented-programming non-gate

30.12.23 Object Oriented Programming: UGCNET-Oct2020-II: 12 https://gateoverflow.in/349661

Consider the following recursive Java function f 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 f(1, 3)?

A. 0.2 B. 0.4 C. 0.6 D. 0.8

ugcnet-oct2020-ii non-gate object-oriented-programming

30.12.24 Object Oriented Programming: UGCNET-dec2008-ii-28 https://gateoverflow.in/155189

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

ugcnetdec2008ii object-oriented-programming

30.13 Operator Overloading (1)

30.13.1 Operator Overloading: UGCNET-Dec2013-II: 18 https://gateoverflow.in/60072

Which of the following operators cannot be overloaded in C++?

A. * B. += C. == D. : :
ugcnetdec2013ii programming-in-c operator-overloading

30.14 Programming In C (1)

30.14.1 Programming In C: UGCNET-June-2019-II: 24 https://gateoverflow.in/316255

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 0’s B. number of bits
C. number of consecutive 1’s D. number of 1’s
ugcnetjune2019ii programming-in-c

30.15 Software Design (1)

30.15.1 Software Design: UGCNET-Dec2012-III: 54 https://gateoverflow.in/57724

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

ugcnetdec2012iii software-design object-oriented-programming

30.16 Template Vs Macro (1)

30.16.1 Template Vs Macro: UGCNET-June2015-II: 14 https://gateoverflow.in/60958

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

ugcnetjune2015ii oops template-vs-macro

30.17 Windows (1)

30.17.1 Windows: UGCNET-June2014-III: 53 https://gateoverflow.in/57200

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 Keys
30.0.1 Q-Q 30.0.2 Q-Q 30.0.3 Q-Q 30.1.1 B 30.1.2 C
30.2.1 Q-Q 30.2.2 B 30.3.1 Q-Q 30.4.1 Q-Q 30.5.1 Q-Q
30.5.2 Q-Q 30.5.3 Q-Q 30.6.1 Q-Q 30.7.1 Q-Q 30.8.1 B
30.9.1 Q-Q 30.9.2 C 30.10.1 B 30.10.2 C 30.10.3 A
30.11.1 A 30.11.2 C 30.11.3 A 30.11.4 A 30.11.5 B
30.11.6 C 30.11.7 X 30.11.8 D 30.11.9 A 30.11.10 B
30.12.1 C 30.12.2 A 30.12.3 A 30.12.4 B 30.12.5 D
30.12.6 B 30.12.7 A 30.12.8 A 30.12.9 D 30.12.10 A
30.12.11 D 30.12.12 B 30.12.13 Q-Q 30.12.14 Q-Q 30.12.15 Q-Q

30.12.16 C 30.12.17 A 30.12.18 C 30.12.19 B 30.12.20 A

30.12.21 D 30.12.22 B 30.12.23 A 30.12.24 Q-Q 30.13.1 D
30.14.1 D 30.15.1 B 30.16.1 X 30.17.1 C
31 Non GATE: Optimization (17)

31.1 Assignment Problem (2)

31.1.1 Assignment Problem: UGCNET-June2014-III: 59 https://gateoverflow.in/57223

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

31.1.2 Assignment Problem: UGCNET-June2015-III: 67 https://gateoverflow.in/61461

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
ugcnetjune2015iii assignment-problem optimization

31.2 Linear Programming (7)

31.2.1 Linear Programming: UGCNET-Dec2012-III: 18 https://gateoverflow.in/57383

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
ugcnetdec2012iii optimization linear-programming

31.2.2 Linear Programming: UGCNET-Dec2013-III: 2 https://gateoverflow.in/60383

Given the problem to maximize f(x), X = (x1 , x2 , … , xn ) subject to m number of in equality constraints.
gi (x) ≤ bi , i=1, 2, .... m including the non-negativity constrains x ≥ 0 . Which of the following conditions is a Kuhn-
Tucker necessary condition for a local maxima at x̄?
∂L(X̄,λ̄,S̄ )
A. ∂xj
= 0, j = 1, 2 … m
B. λ̄i [gi (X̄) − bi ] = 0, i = 1, 2 … m
C. gi (X̄) ≤ bi , i = 1, 2 … m
D. All of these

ugcnetdec2013iii optimization linear-programming

31.2.3 Linear Programming: UGCNET-Dec2013-III: 3 https://gateoverflow.in/60385

The following Linear Programming problem has:

Max Z = x1 + x2
Subject to x1 − x2 ≥ 0
3x1 − x2 ≤ −3
and x1 , x2 ≥ 0
A. Feasible solution B. No feasible solution
C. Unbounded solution D. Single point as solution
ugcnetdec2013iii optimization linear-programming

31.2.4 Linear Programming: UGCNET-Dec2015-III: 52 https://gateoverflow.in/62709

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

ugcnetdec2015iii optimization linear-programming

31.2.5 Linear Programming: UGCNET-June2012-III: 46 https://gateoverflow.in/56296

The feasible region represented by the constraints x1 − x2 ≤ 1, x1 + x2 ≥ 3, x1 ≥ 0, x2 ≥ 0 of the objective

function Max Z = 3x1 + 2x2 is
A. A polygon B. Unbounded feasible region
C. A point D. None of these
ugcnetjune2012iii optimization linear-programming

31.2.6 Linear Programming: UGCNET-June2015-III: 69 https://gateoverflow.in/61463

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

ugcnetjune2015iii optimization linear-programming

31.2.7 Linear Programming: UGCNET-Oct2020-II: 4 https://gateoverflow.in/349669

Consider the following linear programming (LP):

Max. z = 2x1 + 3x2
Such that 2x1 + x2 ≤ 4
x1 + 2x2 ≤ 5
x1 , x2 ≥ 0
The optimum value of the LP is

A. 23 B. 9.5 C. 13 D. 8
ugcnet-oct2020-ii non-gate linear-programming

31.3 Linear Programming Problem (1)

31.3.1 Linear Programming Problem: UGCNET-Dec2013-III: 1 https://gateoverflow.in/60382

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
ugcnetdec2013iii optimization linear-programming-problem

31.4 Optimization (2)

31.4.1 Optimization: UGCNET-Dec2015-III: 47 https://gateoverflow.in/62699

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

ugcnetdec2015iii optimization
 31.4.2 Optimization: UGCNET-June2014-III: 58 https://gateoverflow.in/57216

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

31.5 Transportation Problem (5)

31.5.1 Transportation Problem: UGCNET-Dec2012-III: 28 https://gateoverflow.in/57452

The initial basic feasible solution to the following transportation problem using Vogel’s approximation method is
D1 D2 D3 D4 Supply
S1 1 2 1 4 30
S2 3 3 2 1 50
S3 4 2 5 9 20
Demand 20 40 30 10

A. x11 = 20, x13 = 10, x21 = 20, x23 = 20, x24 = 10, x32 = 10 , Total cost = 180
B. x11 = 20, x12 = 20, x13 = 10, x22 = 20, x23 = 20, x24 = 10 , Total cost = 180
C. x11 = 20, x13 = 10, x22 = 20, x23 = 20, x24 = 10, x32 = 10 , Total cost = 180
D. None of the above

ugcnetdec2012iii optimization transportation-problem

31.5.2 Transportation Problem: UGCNET-Dec2015-III: 53 https://gateoverflow.in/62713

Consider the following conditions:

a. The solution must be feasible,

b. Thei.e.
number
it must
of satisfy
positiveallc.
allocations
the
Allsupply
the positive
must
and demand
beallocationsThe
+ ninitial
equalconstraints
to mmust be solution
where m of
− 1in, independent apositions
is the transportation
number of rowsproblem
and n isisthe number o
said to be non-degenerate basic feasible solution
if it satisfies:

A. a and b only B. a and c only C. b and c only D. a, b and c

ugcnetdec2015iii optimization transportation-problem

31.5.3 Transportation Problem: UGCNET-Dec2015-III: 54 https://gateoverflow.in/62716

Consider the following transportation problem:

The transportation cost in the initial basic feasible solution of the above transportation problem using Vogel's Approximation
method is

A. 1450 B. 1465 C. 1480 D. 1520

ugcnetdec2015iii optimization transportation-problem

31.5.4 Transportation Problem: UGCNET-June2014-III: 60 https://gateoverflow.in/57224

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

31.5.5 Transportation Problem: UGCNET-June2015-III: 68 https://gateoverflow.in/61462

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
ugcnetjune2015iii transportation-problem optimization

Answer Keys
31.1.1 B 31.1.2 A 31.2.1 C 31.2.2 D 31.2.3 B
31.2.4 A 31.2.5 B 31.2.6 D 31.2.7 D 31.3.1 C
31.4.1 A 31.4.2 A 31.5.1 D 31.5.2 A 31.5.3 B
31.5.4 A 31.5.5 B
32 Non GATE: Others (51)

32.0.1 UGCNET-Dec2007-II: 49 https://gateoverflow.in/335735

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 B2C did not begin with billboardware
D. The e-commerce model G2C began with billboardware

ugcnetdec2007ii

32.0.2 UGCNET-Dec2004-II: 46 https://gateoverflow.in/335582

Data Mining can be used as _________ Tool.

A. Software B. Hardware C. Research D. Process

ugcnetdec2004ii

32.0.3 UGCNET-Dec2006-II: 50 https://gateoverflow.in/335621

The maximum size of SMS in IS − 95 is ______ octets.

A. 120 B. 95 C. 128 D. 64

ugcnetdec2006ii

32.0.4 UGCNET-Dec2006-II: 49 https://gateoverflow.in/335622

Link analysis operation in data mining uses ___________ technique.

A. Classification. B. Association discovery.
C. Visualisation. D. Neural clustering.

ugcnetdec2006ii

32.0.5 UGCNET-Dec2007-II: 50 https://gateoverflow.in/335734

Identify the incorrect statement :

A. ATM provides both real time and non-real time service

B. ATM provides faster packet switching than X.25
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

ugcnetdec2007ii

32.0.6 UGCNET-june2009-ii-37 https://gateoverflow.in/154487

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

ugcnetjune2009ii

32.0.7 UGCNET-Dec2004-II: 50 https://gateoverflow.in/335578

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
ugcnetdec2004ii

32.1 3 Puzzle (1)

32.1.1 3 Puzzle: UGCNET-June2016-III: 74 https://gateoverflow.in/64131

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

ugcnetjune2016iii artificial-intelligence 3-puzzle

32.2 Alpha Beta Pruning (1)

32.2.1 Alpha Beta Pruning: UGCNET-June2016-III: 73 https://gateoverflow.in/57286

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. I B. HI C. CHI D. GHI
ugcnetjune2016iii artificial-intelligence alpha-beta-pruning

32.3 Alpha Cut (1)

32.3.1 Alpha Cut: UGCNET-June-2019-II: 95 https://gateoverflow.in/316184

Let Aα0 denotes the α-cut of a fuzzy set A at α0 . If α1 < α2 , then

A. Aα1 ⊇ Aα2 B. Aα1 ⊃ Aα2

C. Aα1 ⊆ Aα2 D. Aα1 ⊂ Aα2
ugcnetjune2019ii fuzzy-sets alpha-cut

32.4 Application Software (1)

32.4.1 Application Software: UGCNET-June2010-II: 45 https://gateoverflow.in/68080

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
ugcnetjune2010ii application-software

32.5 Bigdata Hadoop (1)

32.5.1 Bigdata Hadoop: UGCNET-June-2019-II: 38 https://gateoverflow.in/316241

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
ugcnetjune2019ii bigdata-hadoop

32.6 Convex Optimization (1)

32.6.1 Convex Optimization: UGCNET-July-2018-II: 82 https://gateoverflow.in/225804

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

ugcnetjuly2018ii convex-optimization

32.7 Data Mining (2)

32.7.1 Data Mining: UGCNET-June2010-II: 50 https://gateoverflow.in/68098

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

(i), (ii) and (iv)

(ii), (iv) and (v)

(i), (v) and (vi)

(ii), (iii) and (v)

ugcnetjune2010ii data-mining

32.7.2 Data Mining: UGCNET-June2016-II: 50 https://gateoverflow.in/63510

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
 ugcnetjune2016ii data-mining

32.8 Data Warehousing (4)

32.8.1 Data Warehousing: UGCNET-June2012-III: 20 https://gateoverflow.in/56107

Data Warehouse provides

A. Transaction Responsiveness B. Storage, Functionality Responsiveness to queries
C. Demand and Supply Responsiveness D. None of the above
ugcnetjune2012iii data-warehousing

32.8.2 Data Warehousing: UGCNET-June2012-III: 7 https://gateoverflow.in/56083

Match the following :

(i) OLAP (a) Regression
(ii) OLTP (b) Data Warehouse
(iii) Decision tree (c) RDBMS
(iv) Neural Network (d) Classification
A. (i)-(b), (ii)-(c), (iii)-(a), (iv)-(d) B. (i)-(b), (ii)-(c), (iii)-(d), (iv)-(a)
C. (i)-(c), (ii)-(b), (iii)-(a), (iv)-(d) D. (i)-(b), (ii)-(c), (iii)-(d), (iv)-(a)
ugcnetjune2012iii data-mining data-warehousing

32.8.3 Data Warehousing: UGCNET-June2016-II: 47 https://gateoverflow.in/63506

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
ugcnetjune2016ii data-warehousing

32.8.4 Data Warehousing: UGCNET-June2016-II: 49 https://gateoverflow.in/63509

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
ugcnetjune2016ii data-warehousing

32.9 Debugger (1)

32.9.1 Debugger: UGCNET-Dec2014-II: 34 https://gateoverflow.in/59639

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

ugcnetdec2014ii debugger

32.10 Defuzzification (1)

 32.10.1 Defuzzification: UGCNET-June-2019-II: 96 https://gateoverflow.in/316183

Consider the following methods:

M1 : Mean of maximum
M2 : Centre of area
M3 : Height method
Which of the following is/are defuzzification method(s)?

A. Only M2 B. Only M1 and M2 C. Only M2 and M3 D. M1 , M2 and M3

ugcnetjune2019ii fuzzy-sets defuzzification

32.11 Encryption Decryption (1)

32.11.1 Encryption Decryption: UGCNET-July-2018-II: 48 https://gateoverflow.in/225838

Decrypt the message "WTAAD" using the Caesar Cipher with key =15

A. LIPPS B. HELLO C. PLLEH D. DAATW

ugcnetjuly2018ii cryptography encryption-decryption

32.12 Fuzzy Relation (1)

32.12.1 Fuzzy Relation: UGCNET-June2016-III: 64 https://gateoverflow.in/64119

Let R and S be two fuzzy relations defined as

y1 y2
0.7 0.5
[ ]
R= x1
x2 0.8 0.4
and
z1
z2 z3
S= y1 0.9 0.6 0.2
[ ]
y2 0.1 0.7 0.5
Then, the resulting relation T, which related elements of universe xto elements of universe z using max-min composition is
given by
z1 z2 z3
A. T= x1 .5 .7 .5
[ ]
x2 .8 .8 .8
z1 z2 z3
B. T= x1 .5 .7 .5
[ ]
x2 .9 .6 .5
z1 z2 z3
C. T= x1 0.7 0.6 0.5
[ ]
x2 0.8 0.6 0.4
z1 z2 z3
D. T= x1 0.7 0.6 0.5
[ ]
x2 0.8 0.8 0.8
ugcnetjune2016iii fuzzy-sets fuzzy-relation

32.13 Fuzzy Sets (5)

32.13.1 Fuzzy Sets: UGCNET-Dec2012-III: 13 https://gateoverflow.in/57377

Consider a fuzzy set A defined on the interval X=[0, 10]of integers by the membership Junction μA (x) = x
x+2 . Then
the α cut corresponding to $\alpha =0.5 will be
A. {0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10} B. {1, 2, 3, 4, 5, 6, 7, 8, 9, 10}
C. {2, 3, 4, 5, 6, 7, 8, 9, 10} D. {}
ugcnetdec2012iii fuzzy-sets
 32.13.2 Fuzzy Sets: UGCNET-Dec2014-III: 71 https://gateoverflow.in/61524

A ________ point of a fuzzy set A is a point x ∈ X at which μA (x) = 0.5

A. Core B. Support C. Crossover D. α -cut

ugcnetdec2014iii fuzzy-sets

32.13.3 Fuzzy Sets: UGCNET-Dec2015-III: 65 https://gateoverflow.in/62738

Consider a standard additive model consisting of rules of the form of

If x is Ai AND y is Bi THEN z is Ci . Given crisp inputs x = x0 , y = y0 the output of the model is

A. z = Σi μAi (x0 )μBi (y0 )μCi (z)

B. z = Σi μAi (x0 )μBi (y0 )
C. z = centroid (Σi μAi (x0 )μBi (y0 )μCi (z))
D. z = centroid (Σi μAi (x0 )μBi (y0 )

ugcnetdec2015iii fuzzy-sets

32.13.4 Fuzzy Sets: UGCNET-Dec2015-III: 66 https://gateoverflow.in/62739

A bell shaped membership function is specified by three parameters (a, b, c) as follows:

1 1
A. B.
x−c b
x − c 2b
1+( )) 1+( ))
a a
x−c b x − c 2b
C. 1 + ( )) D. 1 + ( ))
a a
ugcnetdec2015iii fuzzy-sets

32.13.5 Fuzzy Sets: UGCNET-June2016-III: 65 https://gateoverflow.in/64120

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
μA+B (z) = maxx+y=z(min(μA (x), μb (x)))
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)}

ugcnetjune2016iii fuzzy-sets

32.14 Hill Climbing Search (1)

32.14.1 Hill Climbing Search: UGCNET-June2016-III: 72 https://gateoverflow.in/64128

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

ugcnetjune2016iii artificial-intelligence hill-climbing-search

32.15 Inventory (1)

 32.15.1 Inventory: UGCNET-Dec2014-II: 49 https://gateoverflow.in/59836

________ 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
ugcnetdec2014ii optimization inventory

32.16 K Mean Clustering (1)

32.16.1 K Mean Clustering: UGCNET-June-2019-II: 40 https://gateoverflow.in/316239

K-mean clustering algorithm has clustered the given 8 observations into 3 clusters after 1st iteration as follows:
C1 : {(3, 3), (5, 5), (7, 7)}
C2 : {(0, 6), (6, 0), (3, 0)}
C3 : {(8, 8), (4, 4)}
What will be the Manhattan distance for observation (4, 4) from cluster centroid C1 in the second iteration?
–
A. 2 B. √2 C. 0 D. 18
ugcnetjune2019ii k-mean-clustering data-mining

32.17 Linear Programming (1)

32.17.1 Linear Programming: UGCNET-June2016-III: 61 https://gateoverflow.in/64115

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

ugcnetjune2016iii optimization linear-programming

32.18 Llp (1)

32.18.1 Llp: UGCNET-July-2018-II: 83 https://gateoverflow.in/225803

The following LLP

Maximize z = 100x1 + 2x2 + 5x3
Subject to
14x1 + x2 − 6x3 3 + 3x4 = 7
32x1 + x2 − 12x3 ≤ 10
3x1 − x2 − x3 ≤ 0
x1 , x2 , x3 , x4 ≥ 0 has
A. Solution : x1 = 100, x2 = 0, x3 = 0 B. Unbounded solution
C. No solution D. Solution : x1 = 50, x2 = 70, x3 = 60
ugcnetjuly2018ii llp linear-programming

32.19 Machine Learning (1)

32.19.1 Machine Learning: UGCNET-June2014-II: 29 https://gateoverflow.in/54070

Match the following :

List – I List – II
a. Classification i. Principal component analysis
b. Clustering ii. Branch and Bound
c. Feature Extraction iii. K-nearest neighbour
d. Feature Selection iv. K-means
Codes :
 A. a-iii; b-iv; c-ii; d-i B. a-iv; b-iii; c-i; d-ii
C. a-iii; b-iv; c-i; d-ii D. a-iv; b-iii; c-ii; d-i
ugcnetjune2014ii machine-learning

32.20 Operational Research (2)

32.20.1 Operational Research: UGCNET-Dec2014-III: 68 https://gateoverflow.in/61519

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
ugcnetdec2014iii operational-research transportation-problem

32.20.2 Operational Research: UGCNET-Sep2013-III: 14 https://gateoverflow.in/59516

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
ugcnetsep2013iii operational-research assignment-problem

32.21 Searching (1)

32.21.1 Searching: UGCNET-Dec2014-III: 56 https://gateoverflow.in/61012

An A∗ 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

ugcnetdec2014iii artificial-intelligence searching

32.22 Shell (1)

32.22.1 Shell: UGCNET-June2012-III: 71 https://gateoverflow.in/56426

Which one of the following is not a shell in UNIX system?

A. Bourne Shell B. C Shell C. Not Shell D. Korn Shell

ugcnetjune2012iii unix shell

32.23 Shell Script (2)

32.23.1 Shell Script: UGCNET-June2014-II: 35 https://gateoverflow.in/54588

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}

ugcnetjune2014ii non-gate unix shell-script

32.23.2 Shell Script: UGCNET-June2014-III: 39 https://gateoverflow.in/57015

Match the following with reference to Unix shell scripts :

 List – I List – II
a. $? i. File name of the current script
b. $# ii. List of arguments
c. $0 iii. The number of arguments
d. $* iv. Exit status of last command
Codes :
A. a-iii, b-ii, c-i, d-iv B. a-ii, b-iii, c-i, d-iv
C. a-iv, b-iii, c-i, d-ii D. a-i, b-iii, c-i, d-iv
ugcnetjune2014iii unix shell-script

32.24 Simplex Method (2)

32.24.1 Simplex Method: UGCNET-Dec2014-III: 67 https://gateoverflow.in/61518

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
ugcnetdec2014iii linear-programming simplex-method

32.24.2 Simplex Method: UGCNET-June2016-III: 62 https://gateoverflow.in/64116

Consider the following statements:

a. Revised simplex methodb.requires

Revisedlesser
simplex
computations
methodc.automatically
Less
thannumber
the simplex
generates
of entries
methods
the Which
areinverse of
needed of these
in the
each statements
current
table of
basis is true?
the matrix
revised simplex method than usual sim

A. a and b only B. a and c only C. b and c only D. a, b, and c

ugcnetjune2016iii optimization simplex-method

32.25 System Software& Compilers (1)

32.25.1 System Software& Compilers: UGCNET-June2016-II: 32 https://gateoverflow.in/63444

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
ugcnetjune2016ii system-software&-compilers

32.26 Transportation Problem (1)

32.26.1 Transportation Problem: UGCNET-June2016-III: 63 https://gateoverflow.in/64118

The following transportation problem :

A B C Supply
I 50 30 220 1
II 90 45 170 3
III 250 200 50 4
Demand 4 2 2 0
Has a solution
 A B C
I 1
II 3 0
III 2 2
The above solution of a given transportation problem is
A. Infeasible solution B. optimum solution
C. non-optimum solution D. unbounded solution
ugcnetjune2016iii optimization transportation-problem

32.27 Unified Modeling Language (1)

32.27.1 Unified Modeling Language: UGCNET-June2012-III: 44 https://gateoverflow.in/56294

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
ugcnetjune2012iii unified-modeling-language

32.28 Unix (5)

32.28.1 Unix: UGCNET-June2010-II: 49 https://gateoverflow.in/68089

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

ugcnetjune2010ii unix

32.28.2 Unix: UGCNET-June2016-II: 39 https://gateoverflow.in/63457

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
ugcnetjune2016ii unix

32.28.3 Unix: UGCNET-June2016-III: 52 https://gateoverflow.in/63978

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

ugcnetjune2016iii unix

32.28.4 Unix: UGCNET-June2016-III: 67 https://gateoverflow.in/64122

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

ugcnetjune2016iii unix
 32.28.5 Unix: UGCNET-june2008-ii-24 https://gateoverflow.in/155609

Files that are related to input/output and are used to model serial I/O devices such as terminals, printers and
networks are called :
(A) regular files (B) character special files
(C) directories (D) block special files

ugcnetjune2008ii unix

32.29 Windows (1)

32.29.1 Windows: UGCNET-June2012-III: 69 https://gateoverflow.in/56424

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

ugcnetjune2012iii windows

Answer Keys
32.0.1 Q-Q 32.0.2 Q-Q 32.0.3 Q-Q 32.0.4 Q-Q 32.0.5 Q-Q
32.0.6 Q-Q 32.0.7 Q-Q 32.1.1 C 32.2.1 B 32.3.1 A
32.4.1 Q-Q 32.5.1 C 32.6.1 Q-Q 32.7.1 Q-Q 32.7.2 B
32.8.1 B 32.8.2 B 32.8.3 B 32.8.4 A 32.9.1 C
32.10.1 D 32.11.1 Q-Q 32.12.1 C 32.13.1 C 32.13.2 C
32.13.3 D 32.13.4 A 32.13.5 D 32.14.1 C 32.15.1 D
32.16.1 A 32.17.1 B 32.18.1 Q-Q 32.19.1 C 32.20.1 C
32.20.2 A 32.21.1 B 32.22.1 C 32.23.1 C 32.23.2 C
32.24.1 B 32.24.2 D 32.25.1 C 32.26.1 B 32.27.1 A
32.28.1 Q-Q 32.28.2 C 32.28.3 D 32.28.4 B 32.28.5 Q-Q
32.29.1 D
33 Non GATE: Web Technologies (32)

33.0.1 UGCNET-June2012-II: 9 https://gateoverflow.in/55614

What deletes the entire file except the file structure?

A. ERASE B. DELETE C. ZAP D. PACK

ugcnetjune2012ii databases non-gate

33.1 Activex (1)

33.1.1 Activex: UGCNET-Dec2013-II: 41 https://gateoverflow.in/60248

Active X controls are Pentium binary programs that can be embedded in

A. Word pages B. URL pages
C. Script pages D. Web pages
ugcnetdec2013ii web-technologies activex

33.2 Client Server Application (1)

33.2.1 Client Server Application: UGCNET-June2014-III: 26 https://gateoverflow.in/56770

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

33.3 Data Warehousing (1)

33.3.1 Data Warehousing: UGCNET-Dec2014-II: 47 https://gateoverflow.in/59832

Fact-less fact table in a data warehouse contains

A. Only measures B. Only dimensions
C. Keys and measures D. Only surrogate keys
ugcnetdec2014ii data-warehousing

33.4 E Commerce (1)

33.4.1 E Commerce: UGCNET-Dec2014-II: 48 https://gateoverflow.in/59833

Which e-business model allows consumers to name their own price for products and services ?

A. B2B B. B2G C. C2C D. C2B

ugcnetdec2014ii e-commerce

33.5 Edi Layers (2)

33.5.1 Edi Layers: UGCNET-Dec2013-II: 44 https://gateoverflow.in/60256

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

ugcnetdec2013ii e-commerce edi-layers

33.5.2 Edi Layers: UGCNET-Dec2013-II: 45 https://gateoverflow.in/60258

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
 ugcnetdec2013ii e-commerce edi-layers

33.6 Html (5)

33.6.1 Html: UGCNET-AUG2016-III: 41 https://gateoverflow.in/71555

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>
ugcnetaug2016iii web-technologies html

33.6.2 Html: UGCNET-Dec2012-III: 66 https://gateoverflow.in/57739

Match the following with respect to HTML tags and usage

a. CITE i. Italic representation
b. EM ii. Represents output from programmes
c. VAR iii. Represents to other source
d. SAMP iv. Argument to a programme
Codes :
A. a-iii, b-i, c-iv, d-ii B. a-ii, b-iii, c-i, d-iv
C. a-iv, b-ii, c-iii, d-i D. a-i, b-iii, c-iv, d-i
ugcnetdec2012iii web-technologies html

33.6.3 Html: UGCNET-Jan2017-III: 41 https://gateoverflow.in/335197

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>

ugcnetjan2017iii web-technologies html

33.6.4 Html: UGCNET-June2012-III: 68 https://gateoverflow.in/56423

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

ugcnetjune2012iii web-technologies html

33.6.5 Html: UGCNET-June2016-III: 41 https://gateoverflow.in/63967

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

ugcnetjune2016iii html web-technologies

33.7 Javascript (2)

 33.7.1 Javascript: UGCNET-Dec2015-III: 34 https://gateoverflow.in/62593

Javascript and Java have similar name because

a. Jabascripts syntax is loosely

b. Javascript
based onisJava's
stripped
syntax
down
c. Java
version
and of
Javascript
Java are originated from island of Java

A. aB.
only
a,C.b, aand
D.
andac band c
ugcnetdec2015iii web-technologies javascript

33.7.2 Javascript: UGCNET-July-2018-II: 1 https://gateoverflow.in/225884

Consider the JavaScript Code:

var y=”12”
function f() {
var y=”6”;
alert (this.y);
function g() {alert (y); }
g();
}
f();

I f M is the number of alert dialog boxes generated by this JavaScript code and D1, D2, …, DM represents the content
displayed in the each of the M 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”

ugcnetjuly2018ii javascript web-technologies

33.8 Transmission Media (1)

33.8.1 Transmission Media: UGCNET-Dec2012-II: 28 https://gateoverflow.in/56844

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
ugcnetdec2012ii computer-networks transmission-media

33.9 Trojan Horse (1)

33.9.1 Trojan Horse: UGCNET-Dec2014-III: 74 https://gateoverflow.in/61534

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

ugcnetdec2014iii trojan-horse

33.10 Web Technologies (8)

33.10.1 Web Technologies: UGCNET-Dec2013-III: 13 https://gateoverflow.in/60395

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
ugcnetdec2013iii web-technologies
33.10.2 Web Technologies: UGCNET-Dec2015-III: 75 https://gateoverflow.in/61452

__________ tag is an extension to HTML that can enclose any number of Javascript statements.
A. <SCRIPT> B. <BODY>
C. <HEAD> D. <TITLE>
ugcnetdec2015iii web-technologies

33.10.3 Web Technologies: UGCNET-Jan2017-III: 42 https://gateoverflow.in/335196

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
ugcnetjan2017iii web-technologies programming

33.10.4 Web Technologies: UGCNET-June-2019-II: 25 https://gateoverflow.in/316254

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

ugcnetjune2019ii web-technologies

33.10.5 Web Technologies: UGCNET-June2012-II: 42 https://gateoverflow.in/55887

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-gate web-technologies ugcnetjune2012ii

33.10.6 Web Technologies: UGCNET-June2012-II: 44 https://gateoverflow.in/55889

_______ is not an E-Commerce application

A. House banking B. Buying stocks
C. Conducting an auction D. Evaluating an employee
non-gate web-technologies ugcnetjune2012ii

33.10.7 Web Technologies: UGCNET-June2014-III: 54 https://gateoverflow.in/57202

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

33.10.8 Web Technologies: UGCNET-Oct2020-II: 10 https://gateoverflow.in/349663

In HTML, < map > 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
 ugcnet-oct2020-ii non-gate web-technologies

33.11 Xml (7)

33.11.1 Xml: UGCNET-Dec2014-III: 40 https://gateoverflow.in/60689

The behaviour of the document elements in XML can be defined by

A. Using document object B. Registering appropriate event handlers
C. Using element object D. All of the above
ugcnetdec2014iii web-technologies xml

33.11.2 Xml: UGCNET-Dec2015-III: 35 https://gateoverflow.in/62594

Which of the following statements are true with reference to the way of describing XML data?

a. XML uses DTD to describe

b. XML
the data
uses XSL to describe
c. XML
the data
uses a description node to describe the data

A. aB.
only
bC.only
aD.
anda band c
ugcnetdec2015iii web-technologies xml

33.11.3 Xml: UGCNET-July-2018-II: 2 https://gateoverflow.in/225885

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

ugcnetjuly2018ii xml web-technologies

33.11.4 Xml: UGCNET-June-2019-II: 26 https://gateoverflow.in/316253

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

ugcnetjune2019ii xml

33.11.5 Xml: UGCNET-June2015-III: 40 https://gateoverflow.in/61276

In XML we can specify the frequency of an element by using the symbols:

A. +*! B. #*! C. +*? D. -*?

ugcnetjune2015iii web-technologies xml

33.11.6 Xml: UGCNET-June2015-III: 41 https://gateoverflow.in/61278

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
ugcnetjune2015iii web-technologies xml

33.11.7 Xml: UGCNET-Sep2013-II: 38 https://gateoverflow.in/59246

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
33.12 Xsl (1)

33.12.1 Xsl: UGCNET-Dec2012-III: 61 https://gateoverflow.in/57735

Which one is a collection of templates and rules?

A. XML B. CSS C. DHTML D. XSL

ugcnetdec2012iii web-technologies xsl

Answer Keys
33.0.1 C 33.1.1 D 33.2.1 B 33.3.1 B 33.4.1 D
33.5.1 B 33.5.2 B 33.6.1 Q-Q 33.6.2 A 33.6.3 B
33.6.4 B 33.6.5 D 33.7.1 C 33.7.2 Q-Q 33.8.1 D
33.9.1 A 33.10.1 C 33.10.2 B 33.10.3 B 33.10.4 A
33.10.5 D 33.10.6 D 33.10.7 C 33.10.8 B 33.11.1 D
33.11.2 B 33.11.3 Q-Q 33.11.4 A 33.11.5 C 33.11.6 A
33.11.7 A 33.12.1 D
34 Operating System (227)

34.0.1 UGCNET-Jan2017-III: 66 https://gateoverflow.in/335172

Names of some of the Operating Systems are given below:

a. MS-DOS b. XENIX c. OS/2 In the above list, following operating systems

didn’t provide multiuser facility.

A. (a) only B. (a) and (b)only C. (b) and (c) only D. (a),(b) and (c)
ugcnetjan2017iii operating-system

34.0.2 UGCNET-Dec2015-III: 39 https://gateoverflow.in/62682

Consider a system with twelve magnetic tape drives and three processes P1 , P2 and P3 . process P1 requires maximum
ten tape drives, process P2 may need as many as four tape drives and P3 may need upto nine tape drives. Suppose that
at time t1 , process P1 is holding five tape drives, process P2 is holding two tape drives and process P3 is holding three tape
drives, At time t1 , system is in:
A. safe state B. unsafe state
C. deadlocked state D. starvation state
ugcnetdec2015iii operating-system

34.0.3 UGCNET-June2015-III: 49 https://gateoverflow.in/61318

Match the following for operating system techniques with the most appropriate advantage :
List-I List-II
(a) Spooling (i) Allows several jobs to improve CPU utilization
(b) Multiprogramming
(ii) Access to shared resources among geographically
dispersed computers in a transparant way
(c) Time sharing (iii) Overlapping I/O and computations
(d) Distributed computing (iv) Allows many users to share a computer
simultaneously by switching processor frequently
Codes :
A. (a)-(iii), (b)-(i), (c)-(ii), (d)-(iv) B. (a)-(iii), (b)-(i), (c)-(iv), (d)-(ii)
C. (a)-(iv), (b)-(iii), (c)-(ii), (d)-(i) D. (a)-(ii), (b)-(iii), (c)-(iv), (d)-(i)
ugcnetjune2015iii operating-system

34.0.4 UGCNET-Dec2006-II: 38 https://gateoverflow.in/335633

A software to create a Job Queue is called ____________ .

A. Linkage editor B. Interpreter C. Driver D. Spooler

ugcnetdec2006ii

34.0.5 UGCNET-Dec2004-II: 36 https://gateoverflow.in/335592

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
ugcnetdec2004ii

34.0.6 UGCNET-Dec2004-II: 37 https://gateoverflow.in/335591

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

 ugcnetdec2004ii

34.0.7 UGCNET-Dec2004-II: 38 https://gateoverflow.in/335590

Remote computing system involves the use of timesharing systems and :

A. Real time processing B. Batch processing
C. Multiprocessing D. All of the above
ugcnetdec2004ii

34.0.8 UGCNET-NOV2017-III: 51 https://gateoverflow.in/222097

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 ?
(a) (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
(b) (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
Code :
(a) is true; (b) is (a) is false; (b) is
(1) (2)
false true
Both (a) and (b) are Both (a) and (b) are
(3) (4)
true false

34.0.9 UGCNET-Dec2004-II: 40 https://gateoverflow.in/335588

Match the following

(a) Disk scheduling (1) Round robin
(b) Batch processing (2) Scan
(c) Time sharing (3) LIFO
(d) Interrupt processing (4) FIFO
A. a − 3, b − 4, c − 2, d − 1 B. a − 4, b − 3, c − 2, d − 1
C. a − 2, b − 4, c − 1, d − 3 D. a − 3, b − 4, c − 1, d − 2
ugcnetdec2004ii

34.0.10 UGCNET-Dec2007-II: 37 https://gateoverflow.in/335747

A program has five virtual pages, numbered from 0 to 4. If the pages are referenced in the order 012301401234, with
three page frames, the total number of page faults with FIFO will be equal to :

A. 0 B. 4 C. 6 D. 9
ugcnetdec2007ii

34.0.11 UGCNET-Dec2010-II: 19 https://gateoverflow.in/66816

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.

ugcnetdec2010ii operating-system
34.0.12 UGCNET-Dec2015-II: 29 https://gateoverflow.in/62273

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
ugcnetdec2015ii operating-system

34.0.13 UGCNET-Nov-2017-III: 52 https://gateoverflow.in/221694

Consider a system with five processes P0 through P4 and three resource types A, B and C. Resource type A has seven
instances, resource type B has two instances and resource type C has six instances suppose at time T0 we have the
following allocation.

Process Allocation Request Available

A B C A B C A B C
P0 0 1 0 0 0 0 0 0 0
P1 2 0 0 2 0 2
P2 3 0 3 0 0 0
P3 2 1 1 1 0 0
P4 0 2 2 0 0 2

If we implement Deadlock Detection Algorithm we claim that system is __________.

A. Semaphore B. Deadlock State
C. Circular Wait D. Not in Deadlock State

34.0.14 UGCNET-June2010-II: 40 https://gateoverflow.in/68036

Remote Computing Service involves the use of time sharing and _______.

Multi-processing

Interactive processing

Batch processing

Real-time processing
ugcnetjune2010ii operating-system

34.0.15 UGCNET-June2016-II: 37 https://gateoverflow.in/63453

Suppose there are 4 processes in execution with 12 instances of a Resource R in a system.

The maximum need of each process and current allocation are given below :
Process Max Need Current
Allocation
P1 8 3
P2 9 4
P3 5 2
P4 3 1
With reference to current allocation, is system safe? If so, what is the safe sequence?
A. No B. Yes, P1 P2 P3 P4
C. Yes, P4 P3 P1 P2 D. Yes, P2 P1 P3 P4
 ugcnetjune2016ii operating-system

34.0.16 UGCNET-Dec2015-III: 42 https://gateoverflow.in/33805

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
ugcnetdec2015iii operating-system

34.0.17 UGCNET-June2010-II: 36 https://gateoverflow.in/68024

Match the following :

(a) Disk scheduling 1. Robin-round
(b) Batch processing 2. SCAN
(c) Time sharing 3. LIFO
(d) Interrupt processing 4. FIFO
Codes :
A. (a)-3, (b)-4, (c)-2, (d)-1 B. (a)-4, (b)-3, (c)-2, (d)-1
C. (a)-2, (b)-4, (c)-1, (d)-3 D. (a)-1, (b)-4, (c)-3, (d)-2
ugcnetjune2010ii operating-system

34.0.18 UGCNET-June2014-II: 45 https://gateoverflow.in/55195

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.
ugcnetjune2014ii operating-system

34.0.19 UGCNET-Dec2006-II: 37 https://gateoverflow.in/335634

____________ is one of pre-emptive scheduling algorithm.

A. Shortest-Job-first B. Round-robin
C. Priority based D. Shortest-Job-next
ugcnetdec2006ii

34.0.20 UGCNET-Dec2006-II: 36 https://gateoverflow.in/335635

An operating system is :
A. Collection of hardware components B. Collection of input-output devices
C. Collection of software routines D. All the above
ugcnetdec2006ii

34.0.21 UGCNET-Dec2007-II: 40 https://gateoverflow.in/335744

The aging algorithm with a = 0.5 is used to predict run times. The previous four runs from oldest to most recent are
40, 20, 20, and 15 msec. The prediction for the next time will be :

A. 15 msec. B. 25 msec. C. 39 msec. D. 40 msec.

ugcnetdec2007ii

34.0.22 UGCNET-Dec2007-II: 25 https://gateoverflow.in/335759

The performance of a file system depends upon the cache hit rate. If it takes 1 msec to satisfy a request from the cache
but 10 msec to satisfy a request if a disk read is needed, then the mean time (ms) required for a hit rate ′ h′ is given by :

A. 1 B. h + 10(1 − h) C. (1 − h) + 10h D. 10
ugcnetdec2007ii
34.0.23 UGCNET-Jan2017-II: 40 https://gateoverflow.in/335123

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

34.0.24 UGCNET-June2014-III: 24 https://gateoverflow.in/56762

Match the following :

List – I List – II
a. Timeout ordering protocol i. Wait for graph
b. Deadlock prevention ii. Roll back
c. Deadlock detection iii. Wait-die scheme
d. Deadlock recovery iv. Thomas Write Rule
Codes :
A. a-iv; b-iii; c-i; d-ii B. a-iii; b-ii; c-iv; d-i
C. a-ii; b-i; c-iv; d-iii D. a-iii; b-i; c-iv; d-iii
ugcnetjune2014iii operating-system

34.0.25 UGCNET-June2012-III: 56 https://gateoverflow.in/56317

____ 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
ugcnetjune2012iii operating-system

34.0.26 UGCNET-July-2018-II: 53 https://gateoverflow.in/225833

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. e−15 B. 1 − e−15 C. 1 − e−20 D. e−20

ugcnetjuly2018ii operating-system

34.0.27 UGCNET-Dec2012-III: 3 https://gateoverflow.in/57360

Match the following :

List-I List-II
a. Critical region i. Hoares Monitor
b. Wait/signal ii. Mutual Exclusion
c. Working set iii. Principal of locality
d. Dead lock iv. Circular wait
Codes :
A. a-ii, b-i, c-iii, d-iv B. a-i, b-ii, c-iv, d-iii
C. a-ii, b-iii, c-i, d-iv D. a-i, b-iii, c-ii, d-iv
ugcnetdec2012iii operating-system

34.0.28 UGCNET-June2015-III: 52 https://gateoverflow.in/61327

Dining Philosopher's problem is a

A. Producer - consumer problem B. Classical IPC problem
C. Starvation problem D. Synchronization primitive
 ugcnetjune2015iii operating-system

34.0.29 UGCNET-Dec2012-III: 40 https://gateoverflow.in/57673

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

ugcnetdec2012iii operating-system computer-networks non-gate

34.0.30 UGCNET-Dec2007-II: 36 https://gateoverflow.in/335748

How many states can a process be in ?

A. 2 B. 3 C. 4 D. 5
ugcnetdec2007ii

34.0.31 UGCNET-june2009-ii-10 https://gateoverflow.in/154202

Assume N segments in memory and a page size of P bytes. The wastage on account of internal fragmentation is :

1. NP /2 bytes
2. P /2 bytes
3. N /2 bytes
4. NP bytes

ugcnetjune2009ii

34.0.32 UGCNET-june2009-ii-38 https://gateoverflow.in/154488

Variable partition memory management technique with compaction results in :

A. Reduction of fragmentation B. Minimal wastage
C. Segment sharing D. None of the above
ugcnetjune2009ii

34.0.33 UGCNET-Dec2013-III: 69 https://gateoverflow.in/60801

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

ugcnetdec2013iii operating-system non-gate

34.0.34 UGCNET-Dec2007-II: 38 https://gateoverflow.in/335746

Average process size = s bytes. Each page entry requires e bytes. The optimum page size is given by :
−−− −−−−
A. √(se) B. √(2se) C. s D. e
ugcnetdec2007ii

34.0.35 UGCNET-Dec2015-III: 41 https://gateoverflow.in/48613

Match the following in Unix file system :

List-I List-II
(a) Boot block (i) Information about file system
(b) Super block (ii) Information about file
(c) Inode table (iii) Storage space
(d) Data block (iv) Code for making OS ready
Codes :
A. (a)-(iv), (b)-(i), (c)-(ii), (d)-(iii) B. (a)-(i), (b)-(iii), (c)-(ii), (d)-(iv)
C. (a)-(iii), (b)-(i), (c)-(ii), (d)-(iv) D. (a)-(iv), (b)-(ii), (c)-(i), (d)-(iii)
operating-system ugcnetdec2015iii
34.1 Applications In Windows (1)

34.1.1 Applications In Windows: UGCNET-Dec2012-III: 35 https://gateoverflow.in/57669

In Win32, which function is used to create Windows Applications?

A. Win APP B. Win API C. Win Main D. Win Void

ugcnetdec2012iii applications-in-windows operating-system non-gate

34.2 Bankers Algorithm (1)

34.2.1 Bankers Algorithm: UGCNET-June2013-III: 61 https://gateoverflow.in/58888

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
ugcnetjune2013iii operating-system bankers-algorithm deadlock-prevention-avoidance-detection

34.3 Binary Semaphore (1)

34.3.1 Binary Semaphore: UGCNET-June2010-II: 39 https://gateoverflow.in/68034

In order to allow only one process to enter its critical section, binary semaphore are initialized to

A. 0 B. 1 C. 2 D. 3
ugcnetjune2010ii operating-system binary-semaphore

34.4 Context Switch (1)

34.4.1 Context Switch: GATE CSE 2011 | Question: 6, UGCNET-June2013-III: 62 https://gateoverflow.in/2108

Let the time taken to switch from user mode to kernel mode of execution be T1 while time taken to switch between
two user processes be T2. Which of the following is correct?
A. T 1 > T 2 B. T 1 = T 2
C. T 1 < T 2 D. Nothing can be said about the relation between T 1 and T 2
gatecse-2011 operating-system context-switch easy ugcnetjune2013iii

34.5 Counting Semaphores (1)

34.5.1 Counting Semaphores: UGCNET-June-2019-II: 46 https://gateoverflow.in/316233

At a particular time of computation, the value of a counting semaphore is 7. Then 20 P (wait) operations and 15 V
(signal) operations are completed on this semaphore. What is the resulting value of the semaphore?

A. 28 B. 12 C. 2 D. 42
ugcnetjune2019ii counting-semaphores

34.6 Critical Section (1)

34.6.1 Critical Section: UGCNET-Dec2014-II: 38 https://gateoverflow.in/59644

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 CP U '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.
 ugcnetdec2014ii operating-system critical-section

34.7 Deadlock (2)

34.7.1 Deadlock: UGCNET-Dec2010-II: 40 https://gateoverflow.in/67031

A Dead-lock in an Operating System is

A. Desirable process B. Undesirable process
C. Definite waiting process D. All of the above
ugcnetdec2010ii operating-system deadlock

34.7.2 Deadlock: UGCNET-Dec2011-II: 26 https://gateoverflow.in/63677

Dijikstra banking algorithm in an operating system, solves the problem of

A. Deadlock avoidance B. Deadlock recovery
C. Mutual exclusion D. Context switching
ugcnetdec2011ii operating-system deadlock

34.8 Deadlock Prevention Avoidance Detection (6)

34.8.1 Deadlock Prevention Avoidance Detection: UGCNET-AUG2016-II: 36 https://gateoverflow.in/70303

Consider a system with seven processes A through G and six resources R through W .
Resource ownership is as follows :
process A holds R and wants T
process B holds nothing but wants T
process C holds nothing but wants S
process D holds U and wants S & T
process E holds T and wants V
process F holds W and wants S
process G holds V and wants U
Is the system deadlocked ? If yes, _______ processes are deadlocked.

A. No B. Yes, A, B, C C. Yes, D, E, G D. Yes, A, B, F

ugcnetaug2016ii operating-system deadlock-prevention-avoidance-detection

34.8.2 Deadlock Prevention Avoidance Detection: UGCNET-AUG2016-II: 38 https://gateoverflow.in/70309

Consider a system having ‘m’ resources of the same type. These resources are shared by three processes P1 , P2 and P3
which have peak demands of 2, 5 and 7 resources respectively. For what value of ′ m′ deadlock will not occur ?

A. 70 B. 14 C. 13 D. 7
ugcnetaug2016ii operating-system deadlock-prevention-avoidance-detection

34.8.3 Deadlock Prevention Avoidance Detection: UGCNET-AUG2016-III: 50 https://gateoverflow.in/71579

Consider a system which have ‘n′ number of processes and ‘m′ 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. O(mn) B. O(m2 n2 ) C. O(m2 n) D. O(mn2 )

ugcnetaug2016iii operating-system deadlock-prevention-avoidance-detection

34.8.4 Deadlock Prevention Avoidance Detection: UGCNET-Dec2013-III: 71 https://gateoverflow.in/60810

Simplest way of deadlock recovery is

A. Roll back B. Preempt resource
C. Lock one of the processes D. Kill one of the processes
ugcnetdec2013iii operating-system deadlock-prevention-avoidance-detection
 34.8.5 Deadlock Prevention Avoidance Detection: UGCNET-Dec2014-III: 52 https://gateoverflow.in/60959

An operating system has 13 tape drives. There are three processes P 1, P 2 & P 3. Maximum requirement of P 1 is 11
tape drives, P 2 is 5 tape drives and P 3 is 8 tape drives. Currently, P 1 is allocated 6 tape drives, P 2 is allocated 3
tape drives and P 3 is allocated 2 tape drives. Which of the following sequences represent a safe state?

1. P 2P 1P 3
2. P 2P 3P 1
3. P 1P 2P 3
4. P 1P 3P 2

ugcnetdec2014iii operating-system deadlock-prevention-avoidance-detection

34.8.6 Deadlock Prevention Avoidance Detection: UGCNET-June-2019-II: 48 https://gateoverflow.in/316231

A computer has six tape drives with n processes competing for them. Each process may need two drives. What is the
maximum value of n for the system to be deadlock free?

A. 5 B. 4 C. 3 D. 6
ugcnetjune2019ii deadlock-prevention-avoidance-detection

34.9 Delay (1)

34.9.1 Delay: UGCNET-June2016-III: 53 https://gateoverflow.in/57161

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
ugcnetjune2016iii operating-system delay

34.10 Demand Paging (1)

34.10.1 Demand Paging: UGCNET-Dec2014-II: 40 https://gateoverflow.in/59825

In a demand paging memory system, page table is held in registers. The time taken to service a page fault is 8 m.sec. if
an empty frame is available or if the replaced page is not modified, and it takes 20 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 70% of the
time ?
A. 11.6 m.sec. B. 16.4 m.sec.
C. 28 m.sec. D. 14 m.sec.
ugcnetdec2014ii operating-system demand-paging

34.11 Dijkstras Bankers Algorithm (1)

34.11.1 Dijkstras Bankers Algorithm: UGCNET-Sep2013-III: 69 https://gateoverflow.in/59944

A system contains 10 units of resource of same type. The resource requirement and current allocation of these
resources for three processes P, Q and R are as follows :
P Q R
Maximum requirement 8 7 5
Current allocation 4 1 3
Now, consider the following resource requests:

i. P makes a request for 2 resource units

ii. Q makes request for 2 resource units
iii. R makes a request for 2 resource units

For a safe state, which of the following options must be satisfied?

A. Only request i B. Only request ii
C. Only request iii D. Request i and ii
ugcnetsep2013iii operating-system dijkstras-bankers-algorithm
34.12 Directory Structure (1)

34.12.1 Directory Structure: UGCNET-Dec2014-II: 23 https://gateoverflow.in/59407

The directory can be viewed as _______ that translates filenames into their directory entries.

A. Symbol table B. Partition C. Swap space D. Cache

ugcnetdec2014ii operating-system file-system directory-structure

34.13 Disk Cpu Memory Interrupt (1)

34.13.1 Disk Cpu Memory Interrupt: UGCNET-June-2019-II: 42 https://gateoverflow.in/316237

Match List-I with List-II:

List-I List-II
(a) Disk (i) Thread
(b) CPU (ii) Signal
(c) Memory (iii) File system
(d) Interrupt (iv) Virtual address space

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
ugcnetjune2019ii disk-cpu-memory-interrupt

34.14 Disk Scheduling (9)

34.14.1 Disk Scheduling: UGCNET-Dec2012-II: 5 UGCNET-June2013-II: 47 https://gateoverflow.in/56503

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

ugcnetdec2012ii operating-system disk-scheduling ugcnetjune2013ii

34.14.2 Disk Scheduling: UGCNET-Dec2013-II: 48 https://gateoverflow.in/60273

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
ugcnetdec2013ii operating-system disk-scheduling

34.14.3 Disk Scheduling: UGCNET-Dec2014-III: 51 https://gateoverflow.in/60954

Consider an imaginary disk with 40 cylinders. A request come to read a block on cylinder 11. While the seek to
cylinder 11 is in progress, new requests come in for cylinders 1, 36, 16, 34, 9 and 12 in that order. The number of arm
motions using shortest seek first algorithm is

A. 111 ​ B. 112 C. 60 D. 61
ugcnetdec2014iii operating-system disk-scheduling

34.14.4 Disk Scheduling: UGCNET-Jan2017-III: 50 https://gateoverflow.in/335188

Consider a disk queue with I/O requests on the following cylinders in their arriving order:
6, 10, 12, 54, 97, 73, 128, 15, 44, 110, 34, 45 . The disk head is assumed to be at cylinder 23 and moving in the
direction of decreasing number of cylinders. Total number of cylinders in the disk is 150. The disk head movement using
SCAN –scheduling algorithm is:
A. 172 B. 173
 C. 227 D. 228
ugcnetjan2017iii operating-system disk-scheduling

34.14.5 Disk Scheduling: UGCNET-June2012-III: 74 https://gateoverflow.in/56429

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

ugcnetjune2012iii operating-system disk-scheduling

34.14.6 Disk Scheduling: UGCNET-June2015-II: 36 https://gateoverflow.in/61072

A disk drive has 100 cylinders, numbered 0 to 99. Disk requests come to the disk driver for cylinders
12, 26, 24, 4, 42, 8 and 50 in that order. The driver is currently serving a request at a cylinder 24. A seek takes 6 msec
per cylinder moved. How much seek time is needed for shortest seek time first (SSTF) algorithm?

A. 0.984 sec B. 0.396 sec C. 0.738 sec D. 0.42 sec

ugcnetjune2015ii operating-system disk-scheduling

34.14.7 Disk Scheduling: UGCNET-June2016-II: 38 https://gateoverflow.in/63455

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

ugcnetjune2016ii operating-system disk-scheduling

34.14.8 Disk Scheduling: UGCNET-Oct2020-II: 16 https://gateoverflow.in/349657

Consider a disk system having 60 cylinders. Disk requests are received by a disk drive for cylinders
10, 22, 20, 2, 40, 6 and 38, in that order. Assuming the disk head is currently at cylinder 20, what is the time taken to
satisfy all the requests if it takes 2 milliseconds to move from one cylinder to adjacent one and Shortest Seek Time First
(SSTF) algorithm is used?
A. 240 milliseconds B. 96 milliseconds
C. 120 milliseconds D. 112 milliseconds
ugcnet-oct2020-ii operating-system disk-scheduling

34.14.9 Disk Scheduling: UGCNET-Sep2013-II: 46 https://gateoverflow.in/59275

Consider the input/output (I/O) request made at different instants of time directed at a hypothetical disk having 200
tracks as given in the following table :
Serial No. 1 2 3 4 5
TranckNo. 12 85 40 100 75
Time of Arrival 65 80 110 100 175
Assume that :
Current head position is at track no. 65
Direction of last movement is towards higher number of tracks.
Current clock time is 160 milliseconds
Head movement time per track is 1 millisecond
‘‘look” is a variant of ‘‘SCAN” 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 ‘‘look” disk-arm scheduling
algorithms respectively are :
A. 144 and 123 milliseconds B. 143 and 123 milliseconds
C. 149 and 124 milliseconds D. 256 and 186 milliseconds
ugcnetsep2013ii operating-system disk-scheduling
34.15 Disks (7)

34.15.1 Disks: UGCNET-Dec2013-II: 49 https://gateoverflow.in/12059

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 disks ugcnetdec2013ii

34.15.2 Disks: UGCNET-Oct2020-II: 17 https://gateoverflow.in/349656

Suppose you have a Linux file system where the block size is 2K bytes, a disk address is 32 bits, and an i−node
contains the disk addresses of the first 12 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 i−node?

A. 513 Kbytes B. 513 MBytes C. 537 Mbytes D. 537 KBytes

ugcnet-oct2020-ii operating-system disks

34.15.3 Disks: UGCNET-Oct2020-II: 91 https://gateoverflow.in/349582

Comprehension:
For the question given below: concern a disk with a sector size of 512 bytes, 2000 tracks per surface, 50 sectors per
track, five double-sided platters, and average seek time of 10 milliseconds.
If T is the capacity of a track in bytes, and S is the capacity of each surface in bytes, then (T, S) = _______

A. (50K, 50000K) B. (25K, 25000K)

C. (25K, 50000K) D. (40K, 36000K)
ugcnet-oct2020-ii operating-system disks

34.15.4 Disks: UGCNET-Oct2020-II: 92 https://gateoverflow.in/349581

Comprehension:
For the question given below: concern a disk with a sector size of 512 bytes, 2000 tracks per surface, 50 sectors per
track, five double-sided platters, and average seek time of 10 milliseconds.
What is the capacity of the disk, in bytes?

A. 25, 000K B. 500, 000K C. 250, 000K D. 50, 000K

ugcnet-oct2020-ii operating-system disks

34.15.5 Disks: UGCNET-Oct2020-II: 93 https://gateoverflow.in/349580

Comprehension:
For the question given below: concern a disk with a sector size of 512 bytes, 2000 tracks per surface, 50 sectors per
track, five double-sided platters, and average seek time of 10 milliseconds.
Given below are two statements:
Statement I : The disk has a total number of 2000 cylinders.
Statement II : 51200 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 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

ugcnet-oct2020-ii operating-system disks

 34.15.6 Disks: UGCNET-Oct2020-II: 94 https://gateoverflow.in/349579

Comprehension:
For the question given below, concern a disk with a sector size of 512 bytes, 2000 tracks per surface, 50 sectors per
track, five double-sided platters, and average seek time of 10 milliseconds.
If the disk platters rotate at 5400 rpm (revolutions per minute), then approximately what is the maximum rotational delay?
A. 0.011 seconds B. 0.11 seconds
C. 0.0011 seconds D. 1.1 seconds
ugcnet-oct2020-ii operating-system disks

34.15.7 Disks: UGCNET-Oct2020-II: 95 https://gateoverflow.in/349578

For the question given below, concern a disk with a sector size of 512 bytes, 2000 tracks per surface, 50 sectors per
track, five double-sided platters, and average seek time of 10 milliseconds.
If one track of data can be transferred per revolution, then what is the data transfer rate?
A. 2, 850 KBytes/second B. 4, 500 KBytes/second
C. 5, 700 KBytes/second D. 2, 250 KBytes/second
ugcnet-oct2020-ii operating-system disks

34.16 Distributed Computing (1)

34.16.1 Distributed Computing: UGCNET-Dec2012-III: 2 https://gateoverflow.in/57358

The efficiency (E) and speed up (sp) for Multiprocessor with p processors satisfies:
A. E ≤ p and sp ≤ p B. E ≤ 1 and sp ≤ p
C. E ≤ p and sp ≤ 1 D. E ≤ 1 and sp ≤ 1
ugcnetdec2012iii operating-system distributed-computing

34.17 Distributed System (1)

34.17.1 Distributed System: UGCNET-dec2008-ii-24 https://gateoverflow.in/155184

An example of distributed OS is:

A. Amoeba B. UNIX
C. MS-DOS D. MULTICS
ugcnetdec2008ii operating-system distributed-system

34.18 Dynamic Linking (1)

34.18.1 Dynamic Linking: UGCNET-June2016-II: 34 https://gateoverflow.in/63447

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
ugcnetjune2016ii operating-system dynamic-linking

34.19 File System (7)

34.19.1 File System: UGCNET-AUG2016-III: 53 https://gateoverflow.in/71600

Consider a file currently consisting of 50 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 I /O operations are required for indexed (single-level) allocation strategy ?

A. 1 B. 101 C. 27 D. 0
ugcnetaug2016iii operating-system file-system
 34.19.2 File System: UGCNET-Dec2013-III: 72 https://gateoverflow.in/60811

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
ugcnetdec2013iii operating-system file-system

34.19.3 File System: UGCNET-Dec2014-III: 50 https://gateoverflow.in/60819

How many disk blocks are required to keep list of free disk blocks in a 16 GB hard disk with 1 kB block size using
linked list of free disk blocks ? Assume that the disk block number is stored in 32 bits.
A. 1024 blocks B. 16794 blocks
C. 20000 blocks D. 1048576 blocks
ugcnetdec2014iii operating-system file-system

34.19.4 File System: UGCNET-June2012-II: 10 https://gateoverflow.in/55615

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
ugcnetjune2012ii operating-system file-system

34.19.5 File System: UGCNET-June2014-II: 34 https://gateoverflow.in/54583

Match the following :

List – I List – II
a. Contiguous allocation i.This scheme supports very large
file sizes.
b. Linked allocation ii. This allocation technique supports
only sequential files.
c. Indexed allocation iii. The number of disks required to
access file is minimal.
d. Multi-level indexed iv. This technique suffers from maximum
wastage of space in storing pointers.
Codes :
A. a-iii; b-iv; c-ii; d-i B. a-iii; b-ii; c-iv; d-i
C. a-i; b-ii; c-iv; d-iii D. a-i; b-iv; c-ii; d-iii
ugcnetjune2014ii operating-system file-system

34.19.6 File System: UGCNET-June2015-III: 12 https://gateoverflow.in/61155

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
ugcnetjune2015iii operating-system file-system

34.19.7 File System: UGCNET-June2015-III: 53 https://gateoverflow.in/61331

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

ugcnetjune2015iii operating-system file-system

34.20 Fragmentation (1)

34.20.1 Fragmentation: UGCNET-July-2018-II: 56 https://gateoverflow.in/225830

Which of the following statements are true?

 a. External Fragmentationb.exists
Memory
whenFragmentation
there is enough
c.can
total
One
bememory
internal
solution as
space
to well
external
toassatisfy
external
Fragmentation
a request but
is compaction
the available space is contiguous.

A. a and b only B. a and c only C. b and c only D. a, b and c

ugcnetjuly2018ii operating-system fragmentation

34.21 Hit Ratio (1)

34.21.1 Hit Ratio: UGCNET-Sep2013-II: 45 https://gateoverflow.in/59268

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

34.22 Input Output (2)

34.22.1 Input Output: UGCNET-Jan2017-II: 38 https://gateoverflow.in/335125

Match the following w.r.t Input/Output management :

List – I List – II
a. Device controller i. Extracts information from the controller register and store it in data buffer
b. Device driver ii. I/O scheduling
c. Interrupt handler iii. Performs data transfer
d. Kernel I/O subsystem iv. Processing of I/O request

a b c d
A. iii iv i ii
B. ii i iv iii
C. iv i ii iii
D. i iii iv ii
ugcnetjan2017ii operating-system input-output

34.22.2 Input Output: UGCNET-Oct2020-II: 65 https://gateoverflow.in/349608

Match List I with List II

List I List II
(A) Handshaking (I) I/O interface informs the CPU
that device is ready for the transfer
(B) Programmed I/O (II) requires two control signals working
in opposite directions
(C) Interrupt-initiated I/O (III) has local memory & control large set
of I/O devices
(D) I/O processor (IV ) require CPU to check the I/O flag
& perform transfer
Choose the correct answer from the options given below:
A. A − I, B − II, C − III, D − IV B. A − II, B − IV , C − III, D − I
C. A − II, B − IV , C − I, D − III D. A − IV , B − III, C − II, D − I
Match $

ugcnet-oct2020-ii operating-system input-output

34.23 Interrupts (2)

 34.23.1 Interrupts: UGCNET-Dec2011-II: 28 https://gateoverflow.in/63889

On receiving an interrupt from an I /O device, the CP U

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.

ugcnetdec2011ii operating-system interrupts

34.23.2 Interrupts: UGCNET-Dec2014-III: 02 https://gateoverflow.in/59922

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
ugcnetdec2014iii operating-system interrupts

34.24 Io Handling (2)

34.24.1 Io Handling: UGCNET-DEC2016-II: 38 https://gateoverflow.in/117901

Match the following w.r.t. Input/Output management :

List-I List-II
a. Device Controller
i. Extracts information from the controller
register and store it in data buffer
b. Device driver ii. I/O scheduling
c. Interrupt handler iii. Perform data transfer
d. Kernel I/O subsytem iv. Processing of I/O request
Codes :
A. a-iii; b-iv; c-i; d-ii B. a-ii; b-i; c-iv; d-iii
C. a-iv; b-i; c-ii; d-iii D. a-i; b-iii; c-iv; d-ii
ugcnetdec2016ii operating-system io-handling

34.24.2 Io Handling: UGCNET-July-2018-II: 54 https://gateoverflow.in/225832

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

ugcnetjuly2018ii operating-system io-handling

34.25 Java (1)

34.25.1 Java: UGCNET-June2012-III: 13 https://gateoverflow.in/56095

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

ugcnetjune2012iii operating-system java deadlock

34.26 Linux (1)

34.26.1 Linux: UGCNET-July-2018-II: 55 https://gateoverflow.in/225831

Which UNIX/Linux command is used to mae 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
ugcnetjuly2018ii unix linux operating-system non-gate

34.27 Lru (2)

34.27.1 Lru: UGCNET-AUG2016-II: 37 https://gateoverflow.in/70306

Suppose that the virtual Address space has eight pages and physical memory with four page frames. If LRU page
replacement algorithm is used, ______ number of page faults occur with the reference string.
021354637473355311172341

A. 11 B. 12 C. 10 D. 9
ugcnetaug2016ii operating-system lru page-replacement

34.27.2 Lru: UGCNET-June-2019-II: 43 https://gateoverflow.in/316236

Consider that a process has been allocated 3 frames and has a sequence of page referencing as 1, 2, 1, 3, 7, 4, 5, 6, 3, 1 .
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. 2 B. 0 C. 1 D. 3
ugcnetjune2019ii page-replacement lru

34.28 Memory Management (8)

34.28.1 Memory Management: UGCNET-Dec2011-II: 30 https://gateoverflow.in/63892

Consider a logical address space of 8 pages of 1024 words mapped with memory of 32 frames. How many bits are
there in the physical address ?

1. 9 bits
2. 11 bits
3. 13 bits
4. 15 bits

ugcnetdec2011ii operating-system memory-management

34.28.2 Memory Management: UGCNET-Dec2012-II: 14 https://gateoverflow.in/56517

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

ugcnetdec2012ii operating-system memory-management

34.28.3 Memory Management: UGCNET-Dec2012-II: 30 https://gateoverflow.in/57067

Which of the following memory allocation scheme suffers from external fragmentation?

A. Segmentation B. Pure demand paging C. Swapping D. Paging

ugcnetdec2012ii operating-system memory-management

34.28.4 Memory Management: UGCNET-Dec2015-III: 37 https://gateoverflow.in/48611

Match the following with respect to various memory management algorithms :

List-I List-II
(a) Demand paging (i) degree of multiprogramming
(b) Segmentation (ii) working set
(c) Dynamic partitions (iii) supports user view of memory
(d) Fixed partitions (iv) compaction
Codes :
 A. (a)-(iii), (b)-(iv), (c)-(ii), (d)-(i) B. (a)-(ii), (b)-(iii), (c)-(i), (d)-(iv)
C. (a)-(iv), (b)-(iii), (c)-(ii), (d)-(i) D. (a)-(ii), (b)-(iii), (c)-(iv), (d)-(i)
operating-system memory-management ugcnetdec2015iii

34.28.5 Memory Management: UGCNET-Jan2017-III: 49 https://gateoverflow.in/335189

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

ugcnetjan2017iii operating-system memory-management

34.28.6 Memory Management: UGCNET-June2015-III: 51 https://gateoverflow.in/61323

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

ugcnetjune2015iii operating-system memory-management

34.28.7 Memory Management: UGCNET-dec2008-ii-40 https://gateoverflow.in/155364

Which of the following OS treats hardware as a file system?

A. UNIX
B. DOS
C. Windows NT
D. None of the above

ugcnetdec2008ii operating-system memory-management

34.28.8 Memory Management: UGCNET-dec2009-ii-39 https://gateoverflow.in/152932

A program is located in the smallest available hole in the memory is _________

(A) best – fit

(B) first – bit

(C) worst – fit

(D) buddy
ugcnetdec2009ii operating-system memory-management

34.29 Mmu (1)

34.29.1 Mmu: UGCNET-Dec2015-III: 38 https://gateoverflow.in/33806

Function of memory management unit is :

A. Address translation B. Memory Allocation
C. Cache management D. All of the above
ugcnetdec2015iii operating-system mmu

34.30 Monitors (1)

34.30.1 Monitors: UGCNET-Dec2014-III: 53 https://gateoverflow.in/60964

Monitor is an Interprocess Communication (IP C) 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 IP C primitives implemented as system calls to block the process when they are not allowed to enter
critical region to save CP U time.

ugcnetdec2014iii operating-system monitors

34.31 Multiprogramming Os (1)

34.31.1 Multiprogramming Os: UGCNET-Dec2012-III: 7 https://gateoverflow.in/57364

Which of the following features will characterize an OS as multi-programmed OS?

a. More than one programb.loaded

If a program
into mainwaits
memory
for certain
c.
at the
If the
event
same
execution
time.
anotherofprogram
a program
is immediately
terminates, another
scheduled
program is immediately scheduled

A. aB.
only
aC.andaD.
band
only
a,cb,only
and c only
ugcnetdec2012iii operating-system multiprogramming-os

34.32 Mutual Exclusion (1)

34.32.1 Mutual Exclusion: UGCNET-June2012-III: 65 https://gateoverflow.in/56420

Consider the methods used by processes P1 and P2 for accessing their critical sections. The initial values of shared
Boolean variables S1 and S2 are randomly assigned,
P1 P2
while ( S1 ==S2 ); while ( S1 ==S2);
critical section critical section
S1 =S2 ; S1 =S2 ;
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
ugcnetjune2012iii operating-system mutual-exclusion critical-section

34.33 Os Protection (2)

34.33.1 Os Protection: GATE CSE 1999 | Question: 1.11, UGCNET-Dec2015-II: 44 https://gateoverflow.in/1464

System calls are usually invoked by using

A. a software interrupt B. polling
C. an indirect jump D. a privileged instruction
gate1999 operating-system normal ugcnetdec2015ii os-protection

34.33.2 Os Protection: GATE IT 2005 | Question: 19, UGCNET-June2012-III: 57 https://gateoverflow.in/3764

A user level process in Unix traps the signal sent on a Ctrl-C input, and has a signal handling routine that saves
appropriate files before terminating the process. When a Ctrl-C input is given to this process, what is the mode in which
the signal handling routine executes?

A. User mode B. Kernel mode C. Superuser mode D. Privileged mode

gateit-2005 operating-system os-protection normal ugcnetjune2012iii

34.34 Page Fault (6)

34.34.1 Page Fault: UGCNET-AUG2016-III: 52 https://gateoverflow.in/71582

Consider the following page reference string :

1, 2, 3, 4, 2, 1, 5, 6, 2, 1, 2, 3, 7, 6, 3, 2, 1, 2, 3, 6
Which of the following options, gives the correct number of page faults related to LRU, FIFO, and optimal page replacement
algorithms respectively, assuming 05 page frames and all frames are initially empty ?

A. 10, 14, 8 B. 8, 10, 7 C. 7, 10, 8 D. 7, 10, 7

 ugcnetaug2016iii operating-system page-fault

34.34.2 Page Fault: UGCNET-Dec2015-II: 27 https://gateoverflow.in/62269

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

ugcnetdec2015ii operating-system page-fault

34.34.3 Page Fault: UGCNET-July-2018-II: 58 https://gateoverflow.in/225828

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
ugcnetjuly2018ii operating-system page-fault paging

34.34.4 Page Fault: UGCNET-June2016-II: 36 https://gateoverflow.in/63450

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
ugcnetjune2016ii operating-system page-replacement page-fault

34.34.5 Page Fault: UGCNET-Sep2013-III: 23 https://gateoverflow.in/59532

Match the following :

(a) Dangling pointer (i) Buffer replacement policy
(b) Page fault (ii) Variable-length records
(c) List representation (iii) Object identifier
(d) Toss-immediate (iv) Pointer-swizzling
Codes :
A. (a)-(iii), (b)-(iv), (c)-(ii), (d)-(i) B. (a)-(iv), (b)-(iii), (c)-(ii), (d)-(i)
C. (a)-(iv), (b)-(iii), (c)-(i), (d)-(ii) D. (a)-(iii), (b)-(iv), (c)-(i), (d)-(ii)
ugcnetsep2013iii operating-system page-fault

34.34.6 Page Fault: UGCNET-dec2009-ii-37 https://gateoverflow.in/152929

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
ugcnetdec2009ii operating-system page-fault

34.35 Page Replacement (5)

34.35.1 Page Replacement: UGCNET-June2012-II: 33 https://gateoverflow.in/55870

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 ugcnetjune2012ii

34.35.2 Page Replacement: UGCNET-June2014-III: 35 https://gateoverflow.in/56800

Consider a program that consists of 8 pages (from 0 to 7) and we have 4 page frames in the physical memory for the
pages. The page reference string is :
123256346373153634243451
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. 9 and 6 B. 10 and 7 C. 9 and 7 D. 10 and 6

ugcnetjune2014iii operating-system page-replacement

34.35.3 Page Replacement: UGCNET-June2015-II: 38 https://gateoverflow.in/61077

A LRU page replacement is used with 4 page frames and eight pages. How many page faults will occur with the
reference string 0172327103 if the four frames are initially empty?

A. 6 B. 7 C. 5 D. 8
ugcnetjune2015ii operating-system page-replacement

34.35.4 Page Replacement: UGCNET-Oct2020-II: 15 https://gateoverflow.in/349658

Consider a hypothetical machine with 3 pages of physical memory, 5 pages of virtual memory, and
< A, B, C, D, A, B, E, A, B, C, D, E, B, A, B > as the stream of page reference by an application. If P and Q are
the number of page faults that the application would incur with FIFO and LRU page replacement algorithms respectively, then
(P , Q) = _______(Assuming enough space for storing 3 page frames)

A. (11, 10) B. (12, 11) C. (10, 11) D. (11, 12)

ugcnet-oct2020-ii operating-system page-replacement

34.35.5 Page Replacement: UGCNET-Sep2013-III: 71 https://gateoverflow.in/59946

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

ugcnetsep2013iii operating-system page-replacement

34.36 Paging (8)

34.36.1 Paging: UGCNET-AUG2016-III: 51 https://gateoverflow.in/71580

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 1000 words, and the
paging device is a drum that rotates at 3000 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,
80% accessed a page already in memory and when a new page was required, the replaced page was modified 50% 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. 30 microseconds B. 34 microseconds
C. 60 microseconds D. 68 microseconds
ugcnetaug2016iii operating-system paging
 34.36.2 Paging: UGCNET-Dec2010-II: 39 https://gateoverflow.in/67022

Page making process from main memory to disk is called

A. Interruption B. Termination C. Swapping D. None of the above

ugcnetdec2010ii operating-system paging

34.36.3 Paging: UGCNET-Dec2014-II: 39 https://gateoverflow.in/59824

For the implementation of a paging scheme, suppose the average process size be x bytes, the page size be y bytes, and
each page entry requires z bytes. The optimum page size that minimizes the total overhead due to the page table and
the internal fragmentation loss is given by
−−− √xz
A. x
2 B. xz
2 C. √2xz D. 2
ugcnetdec2014ii operating-system paging

34.36.4 Paging: UGCNET-Jan2017-II: 37 https://gateoverflow.in/335126

In a paging system, it takes 30 ns to search translation Look-a-side Buffer (TLB) and 90 ns to access the main memory.
If the TLB hit ratio is 70%, the effective memory access time is :

A. 48 ns B. 147ns C. 120ns D. 84ns

ugcnetjan2017ii operating-system paging

34.36.5 Paging: UGCNET-July-2018-II: 52 https://gateoverflow.in/225834

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
ugcnetjuly2018ii operating-system paging

34.36.6 Paging: UGCNET-July-2018-II: 57 https://gateoverflow.in/225829

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
ugcnetjuly2018ii operating-system paging

34.36.7 Paging: UGCNET-June-2019-II: 47 https://gateoverflow.in/316232

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
ugcnetjune2019ii virtual-memory paging

34.36.8 Paging: UGCNET-June2013-III: 59 https://gateoverflow.in/58832

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

ugcnetjune2013iii operating-system paging

34.37 Pipelining (1)

 34.37.1 Pipelining: UGCNET-Sep2013-II: 50 https://gateoverflow.in/59285

The speed up of a pipeline processing over an equivalent non-pipeline processing is defined by the ration:
where n → no. of tasks
tn → time of completion of each tasks
k → no. of segments of pipeline
tp → clock cycle time
S → speed up ratio
ntn ntn
A. S = (k+n−1)tp
B. S = (k+n+1)tp
ntn (k+n−1)tp
C. S = (k−n+1)tp D. S = ntn
ugcnetsep2013ii operating-system pipelining

34.38 Process (2)

34.38.1 Process: UGCNET-Dec2014-II: 37 https://gateoverflow.in/59643

A specific editor has 200K of program text, 15K of initial stack, 50K of initialized data, and 70K of bootstrap code.
If five editors are started simultaneously, how much physical memory is needed if shared text is used?

A. 1135K B. 335K C. 1065K D. 320K

ugcnetdec2014ii operating-system process

34.38.2 Process: UGCNET-June2013-III: 63 https://gateoverflow.in/58889

Working set model is used in memory management to implement the concept of

A. Swapping B. Principal of Locality
C. Segmentation D. Thrashing
ugcnetjune2013iii operating-system process

34.39 Process Model (2)

34.39.1 Process Model: UGCNET-dec2008-ii-21 https://gateoverflow.in/155181

N processes are waiting for I /O . A process spends a fraction p of its time in I /O wait state. The CP U utilization is
given by :

1. 1-p-N
2. 1-pN
3. pN
4. p-N

ugcnetdec2008ii operating-system process-model

34.39.2 Process Model: UGCNET-dec2008-ii-22 https://gateoverflow.in/155182

If holes are half as large as processes, the fraction of memory wasted in holes is :

A. 2/3
B. 1/2
C. 1/3
D. 1/5

ugcnetdec2008ii operating-system process-model

34.40 Process Scheduling (21)

34.40.1 Process Scheduling: GATE CSE 1998 | Question: 2.17, UGCNET-Dec2012-III: 43 https://gateoverflow.in/1690

Consider n processes sharing the CPU in a round-robin fashion. Assuming that each process switch takes s seconds,
what must be the quantum size q such that the overhead resulting from process switching is minimized but at the same
time each process is guaranteed to get its turn at the CPU at least every t seconds?
t−ns t−ns
q≤ q≥
 t−ns t−ns
A. q ≤ n−1 B. q ≥ n−1
t−ns t−ns
C. q ≤ n+1 D. q ≥ n+1
gate1998 operating-system process-scheduling normal ugcnetdec2012iii

34.40.2 Process Scheduling: UGCNET-AUG2016-II: 39 https://gateoverflow.in/70313

Five jobs A, B, C, D and E are waiting in Ready Queue. Their expected runtimes are 9, 6, 3, 5 and x respectively. All
jobs entered in Ready queue at time zero. They must run in _____ order to minimize average response time if
3 < x < 5.
A. B, A, D, E, C B. C, E, D, B, A
C. E, D, C, B, A D. C, B, A, E, D
ugcnetaug2016ii operating-system process-scheduling

34.40.3 Process Scheduling: UGCNET-AUG2016-II: 40 https://gateoverflow.in/70315

Consider three CPU intensive processes P 1, P 2, P 3 which require 20, 10 and 30 units of time, arrive at times 1, 3 and
7 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. 3 B. 2 C. 4 D. 5
ugcnetaug2016ii operating-system process-scheduling

34.40.4 Process Scheduling: UGCNET-Dec2012-II: 20 https://gateoverflow.in/56525

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

ugcnetdec2012ii operating-system process-scheduling

34.40.5 Process Scheduling: UGCNET-Dec2013-II: 46 https://gateoverflow.in/60271

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

ugcnetdec2013ii operating-system process-scheduling

34.40.6 Process Scheduling: UGCNET-Dec2014-II: 36 https://gateoverflow.in/59641

Consider the following justifications for commonly using the two-level CP U 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 FIFO .
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. I, III and IV B. I and II C. III and IV D. I and III

ugcnetdec2014ii operating-system process-scheduling
34.40.7 Process Scheduling: UGCNET-Jan2017-III: 52 https://gateoverflow.in/335186

Some of the criteria for calculation of priority of a process are:

a. Processor utilization by an individual process. b. Weight assigned to a user or group of users
c. Processor utilization by a user or group of processes In fair scheduler, priority is calculated based on:
A. only (a) and (b) B. only (a) and (c)
C. (a) ,(b) and (c) D. only (b) and (c)
ugcnetjan2017iii operating-system process-scheduling

34.40.8 Process Scheduling: UGCNET-July-2018-II: 60 https://gateoverflow.in/225826

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
ugcnetjuly2018ii process-scheduling operating-system

34.40.9 Process Scheduling: UGCNET-June-2019-II: 45 https://gateoverflow.in/316234

Consider three CPU intensive processes, which require 10, 20 and 30 units of time and arrive at times 0, 2 and 6
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. 4 B. 2 C. 3 D. 1
ugcnetjune2019ii process-scheduling

34.40.10 Process Scheduling: UGCNET-June2010-II: 38 https://gateoverflow.in/68032

_______ is one of pre-emptive scheduling algorithm.

A. RR B. SSN C. SSF D. Priority based

ugcnetjune2010ii operating-system process-scheduling

34.40.11 Process Scheduling: UGCNET-June2012-II: 29 https://gateoverflow.in/55863

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 ugcnetjune2012ii

34.40.12 Process Scheduling: UGCNET-June2012-II: 30 https://gateoverflow.in/46841

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

ugcnetjune2012ii operating-system process-scheduling

34.40.13 Process Scheduling: UGCNET-June2013-III: 58 https://gateoverflow.in/58831

Consider the following processes with time slice of 4 milliseconds (I/O requests are ignored):
Process A B C D
Arrival
0 1 2 3
time
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
 ugcnetjune2013iii operating-system process-scheduling

34.40.14 Process Scheduling: UGCNET-June2014-II: 32 https://gateoverflow.in/54518

Match the following :

List – I List – II
a. Multilevel feedback queue i. Time-slicing
b. FCFS ii. Criteria to move processes
between queues
c. Shortest Process next iii. Batch Processing
d. Round robin scheduling iv. Exponential smoothening
Codes :
A. a-i; b-iii; c-ii; d-iv B. a-iv; b-iii; c-ii; d-i
C. a-iii; b-i; c-iv; d-i D. a-ii; b-iii; c-iv; d-i
ugcnetjune2014ii operating-system process-scheduling

34.40.15 Process Scheduling: UGCNET-June2014-III: 34 https://gateoverflow.in/56795

Consider a uniprocessor system where new processes arrive at an average of five processes per minute and each process
needs an average of 6 seconds of service time. What will be the CPU utilization ?

A. 80 % B. 50 % C. 60 % D. 30 %
ugcnetjune2014iii operating-system process-scheduling

34.40.16 Process Scheduling: UGCNET-June2014-III: 36 https://gateoverflow.in/57009

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

34.40.17 Process Scheduling: UGCNET-June2015-III: 50 https://gateoverflow.in/61320

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

ugcnetjune2015iii operating-system process-scheduling

34.40.18 Process Scheduling: UGCNET-June2016-II: 40 https://gateoverflow.in/63482

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
ugcnetjune2016ii operating-system process-scheduling

34.40.19 Process Scheduling: UGCNET-Sep2013-II: 44 https://gateoverflow.in/59265

Match the following :

 List – I List – II
Process state Reason for transition
transition
a. Ready → i. Running
Request made by the process is satisfied or
an event for which it was waiting to occurs
b. Blocked → ii. Ready
Process wishes to wait for some action by
another process
c. Running → iii. BlockedThe process is dispatched
d. Running → iv. Ready The Process is preempted
Codes :
A. a-iii, b-i, c-ii, d-iv B. a-iv, b-i, c-iii, d-ii
C. a-iv, b-iii, c-i, d-ii D. a-iii, b-iv, c-ii, d-i
ugcnetsep2013ii operating-system process-scheduling

34.40.20 Process Scheduling: UGCNET-Sep2013-III: 70 https://gateoverflow.in/59945

Consider the following set of processes with the length of CPU burst time in milliseconds (ms) :
Process A B C D E
Burst time 6 1 2 1 5
Priority 3 1 3 4 2
Assume that processes are stored in ready queue in following order :
A–B–C–D–E
Using round robin scheduling with time slice of 1 ms, the average turn around time is

A. 8.4 ms B. 12.4 ms C. 9.2 ms D. 9.4 ms

ugcnetsep2013iii operating-system process-scheduling

34.40.21 Process Scheduling: UGCNET-dec2009-ii-36 https://gateoverflow.in/152914

In the process management Round-robin method is essentially the pre-emptive version of _________

(A) FILO

(B) FIFO

(C) SSF

(D) Longest time first

ugcnetdec2009ii operating-system process-scheduling

34.41 Process Synchronization (2)

34.41.1 Process Synchronization: ISRO2007-42, UGCNET-June2010-II: 37 https://gateoverflow.in/49517

Semaphores

A. synchronize critical resources to prevent deadlock

B. synchronize critical resources to prevent contention
C. are used to do I/O
D. are used for memory management

isro2007 operating-system process-synchronization ugcnetjune2010ii

34.41.2 Process Synchronization: UGCNET-July-2018-II: 51 https://gateoverflow.in/225835

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
ugcnetjuly2018ii operating-system process-synchronization

34.42 Ram (1)

34.42.1 Ram: UGCNET-dec2008-ii-41 https://gateoverflow.in/155365

In which of the following, ready to execute processes must be present in RAM ?

A. multiprocessing
B. multiprogramming
C. multitasking
D. all of the above

ugcnetdec2008ii operating-system ram

34.43 Resource Allocation (3)

34.43.1 Resource Allocation: GATE CSE 1993 | Question: 7.9, UGCNET-Dec2012-III: 41 https://gateoverflow.in/2297

Consider a system having m resources of the same type. These resources are shared by 3 processes A, B, and C which
have peak demands of 3, 4, and 6 respectively. For what value of m deadlock will not occur?

A. 7 B. 9 C. 10 D. 13 E. 15
gate1993 operating-system resource-allocation normal ugcnetdec2012iii multiple-selects

34.43.2 Resource Allocation: UGCNET-June2012-II: 31 https://gateoverflow.in/55866

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
ugcnetjune2012ii operating-system resource-allocation

34.43.3 Resource Allocation: UGCNET-June2014-II: 33 https://gateoverflow.in/54524

Consider a system with five processes P0 through P4 and three resource types R1 , R2 and R3 . Resource type R1 has
10 instances, R2 has 5 instances and R3 has 7 instances. Suppose that at time T0 , the following snapshot of the system
has been taken :
Allocation
R1 R2 R3
P0 0 1 0
P1 2 0 0
P2 3 0 2
P3 2 1 1
P4 0 2 2
Max
R1 R2 R3
7 5 3
3 2 2
9 0 2
2 2 2
4 3 3
Available
R1 R2 R3
3 3 2
Assume that now the process P1 requests one additional instance of type R1 and two instances of resource type R3 . The state
resulting after this allocation will be
 A. Ready state B. Safe state
C. Blocked state D. Unsafe state
ugcnetjune2014ii operating-system resource-allocation

34.44 Runtime Environments (1)

34.44.1 Runtime Environments: UGCNET-dec2009-ii-31 https://gateoverflow.in/152901

In an absolute loading scheme which loader function is accomplished by assembler ?

(A) re-allocation

(B) allocation

(C) linking

(D) loading
ugcnetdec2009ii operating-system runtime-environments

34.45 Scheduling (4)

34.45.1 Scheduling: UGCNET-Dec2010-II: 38 https://gateoverflow.in/67021

WINDOWS is a _________ operating.

A. Real time B. Multi-user C. Preemptive D. Non-preemptive

ugcnetdec2010ii operating-system scheduling

34.45.2 Scheduling: UGCNET-Jan2017-II: 39 https://gateoverflow.in/335124

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

34.45.3 Scheduling: UGCNET-July-2018-II: 59 https://gateoverflow.in/225827

Consider the following three processes with the arrival time and CPU burst time given in miliseconds:
Arrival Burst
Process
Time Time
P1 0 7
P2 1 4
P3 2 8
The Gantt Chart for preemptive SJF scheduling algorithm is _______

A. B. C. D.
ugcnetjuly2018ii operating-system scheduling process-scheduling

34.45.4 Scheduling: UGCNET-dec2008-ii-23 https://gateoverflow.in/155183

An example of a non pre-emptive scheduling algorithm is :

A. Round Robin B. Priority Scheduling
C. Shortest job first D. 2 level scheduling
ugcnetdec2008ii operating-system scheduling

34.46 Seek Latency (1)

 34.46.1 Seek Latency: UGCNET-June-2019-II: 16 https://gateoverflow.in/316263

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

ugcnetjune2019ii seek-latency

34.47 Semaphores (4)

34.47.1 Semaphores: UGCNET-DEC2016-II: 36 https://gateoverflow.in/117899

There are three processes P1, P2 and P3 sharing a semaphore for synchronising 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. P2 needs to access b. P1 needs to access c. P3 needs to access d. P2 exits critical section e. Pi exits critical section
The final value of semaphore will be:

A. 0 B. 1 C. −1 D. −2
ugcnetdec2016ii operating-system process-synchronization semaphores

34.47.2 Semaphores: UGCNET-Jan2017-II: 36 https://gateoverflow.in/335127

There are three processes P1 , P2 and P3 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. P2 needs to access

b. P1 needs to access
c. P 3 needs to access

d. P 2 exits critical section

e. P1 exits critical section The final value of semaphore will be :

A. 0 B. 1 C. −1 D. −2
ugcnetjan2017ii operating-system semaphores

34.47.3 Semaphores: UGCNET-June2013-III: 60 https://gateoverflow.in/58837

Suppose S and Q are two semaphores initialized to 1. P1 and P2 are two processes which are sharing resources.
P1 has statements P2 has statements
wait(S); wait(Q);
wait(Q); wait(S);
critical-section 1; critical-section 2;
signal(S); signal(Q);
Signal(Q); signal(S);
Their execution may sometimes lead to an undesirable situation called

A. Starvation B. Race condition C. Multithreading D. Deadlock

ugcnetjune2013iii operating-system semaphores
 34.47.4 Semaphores: UGCNET-dec2009-ii-38 https://gateoverflow.in/152930

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
ugcnetdec2009ii operating-system semaphores

34.48 Shell Script (7)

34.48.1 Shell Script: UGCNET-June-2019-II: 50 https://gateoverflow.in/316229

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 −1 B. cat ∗⋅[ c-h ] ∣ wc −1
C. cat ∗⋅[ ch ] ∣ ls −1 D. cat ∗⋅[ ch ] ∣ wc −1
ugcnetjune2019ii shell-script

34.48.2 Shell Script: UGCNET-June2015-II: 39 https://gateoverflow.in/61080

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"

ugcnetjune2015ii operating-system shell-script non-gate

34.48.3 Shell Script: UGCNET-June2015-III: 75 https://gateoverflow.in/61495

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

ugcnetjune2015iii shell-script

34.48.4 Shell Script: UGCNET-June2016-III: 68 https://gateoverflow.in/64123

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

ugcnetjune2016iii unix shell-script

34.48.5 Shell Script: UGCNET-June2016-III: 69 https://gateoverflow.in/64124

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
ugcnetjune2016iii unix shell-script

34.48.6 Shell Script: UGCNET-Sep2013-III: 72 https://gateoverflow.in/59947

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

ugcnetsep2013iii unix shell-script non-gate

34.48.7 Shell Script: UGCNET-Sep2013-III: 75 https://gateoverflow.in/59951

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.

ugcnetsep2013iii unix shell-script

34.49 Sjf (1)

34.49.1 Sjf: UGCNET-dec2008-ii-8 https://gateoverflow.in/155032

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
ugcnetdec2008ii operating-system sjf scheduling

34.50 Sstf (1)

34.50.1 Sstf: UGCNET-June-2019-II: 41 https://gateoverflow.in/316238

Consider a disk system with 100 cylinders. The requests to access the cylinders occur in the following sequences:

4, 34, 10, 7, 19, 73, 2, 15, 6, 20

Assuming that the head is currently at cylinder 50, what is the time taken to satisfy all requests if it takes 1 ms to move from
the cylinder to adjacent one and the shortest seek time first policy is used?

A. 357 ms B. 238 ms C. 276 ms D. 119 ms

ugcnetjune2019ii disk-scheduling sstf

34.51 Storage Devices (1)

34.51.1 Storage Devices: UGCNET-Dec2014-III: 49 https://gateoverflow.in/60818

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

ugcnetdec2014iii storage-devices accessing-speed

34.52 System Call (2)

34.52.1 System Call: UGCNET-Nov2017-iii-75 https://gateoverflow.in/166451

Match the following WINDOWS system calls and UNIX system calls with reference to process control and File
manipulation.

Windows UNIX
(a) Create – process ( ) (i) Open ( )
(b) WaitForSingleObject ( ) (ii) Close ( )
(c) CreateFile ( ) (iii) Fork ( )
(d) CloseHandle ( ) (iv) Wait ( )

A. (a) − (iii) (b) − (iv) (c) − (i) d − (ii)

B. (a) − (iv) (b) − (iii) (c) − (i) d − (ii)
C. (a) − (iv) (b) − (iii) (c) − (ii) d − (i)
D. (a) − (iii) (b) − (iv) (c) − (ii) d − (i)

ugcnetnov2017-iii operating-system system-call

34.52.2 System Call: UGCNET-Oct2020-II: 84 https://gateoverflow.in/349589

Assuming that the system call fork() never fails, consider the following C program P 1 and P 2 executed on a
UNIX/Linux system:
/ ∗ P1 ∗ / / ∗ P2 ∗ /
int main(){ int main(){
fork(); fork();
fork(); printf(“Happy \n”);
fork(); fork();
printf(“Happy \n”); printf(“Happy \n”);
} fork();
printf(“Happy \n”);
}
Statement I : P 1 displays “Happy” 8 times
Statement II : P 2 displays “Happy” 12 times
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

ugcnet-oct2020-ii operating-system system-call

34.53 System Reliability (1)

 34.53.1 System Reliability: UGCNET-AUG2016-III: 43 https://gateoverflow.in/71563

An Operating System (OS) 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%

ugcnetaug2016iii operating-system system-reliability

34.54 Threads (5)

34.54.1 Threads: GATE CSE 2011 | Question: 16, UGCNET-June2013-III: 65 https://gateoverflow.in/2118

A thread is usually defined as a light weight process because an Operating System (OS) maintains smaller data
structure for a thread than for a process. In relation to this, which of the following statement is correct?

A. OS maintains only scheduling and accounting information for each thread

B. OS maintains only CPU registers for each thread
C. OS does not maintain virtual memory state for each thread
D. OS does not maintain a separate stack for each thread

gatecse-2011 operating-system threads normal ugcnetjune2013iii

34.54.2 Threads: UGCNET-Dec2012-III: 32 https://gateoverflow.in/57462

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

ugcnetdec2012iii operating-system threads

34.54.3 Threads: UGCNET-Dec2013-III: 75 https://gateoverflow.in/60813

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

ugcnetdec2013iii operating-system threads non-gate

34.54.4 Threads: UGCNET-Jan2017-III: 53 https://gateoverflow.in/335185

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.

ugcnetjan2017iii operating-system threads

34.54.5 Threads: UGCNET-June-2019-II: 44 https://gateoverflow.in/316235

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

ugcnetjune2019ii threads

34.55 Tlb (2)

 34.55.1 Tlb: UGCNET-Dec2013-II: 47 https://gateoverflow.in/60272

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

ugcnetdec2013ii operating-system tlb

34.55.2 Tlb: UGCNET-Oct2020-II: 18 https://gateoverflow.in/349655

Consider a single-level page table system, with the page table stored in the memory. If the hit rate to TLB is 80%, and
it takes 15 nanoseconds to search the TLB, and 150 nanoseconds to access the main memory, then what is the
effective memory access time, in nanoseconds?

A. 185 B. 195 C. 205 D. 175

ugcnet-oct2020-ii operating-system tlb

34.56 Transaction And Concurrency (1)

34.56.1 Transaction And Concurrency: UGCNET-June2015-II: 37 https://gateoverflow.in/61075

Let P − i and Pj 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 pi and Pj which of the conditions are not true?

A. R(Pi ) ∩ W (Pj ) = Φ B. W (Pi ) ∩ R(Pj ) = Φ

C. R(Pi ) ∩ R(Pj ) = Φ D. W (Pi ) ∩ W (Pj ) = Φ
ugcnetjune2015ii transaction-and-concurrency

34.57 Unix (25)

34.57.1 Unix: UGCNET-AUG2016-III: 49 https://gateoverflow.in/71576

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.

ugcnetaug2016iii operating-system unix

34.57.2 Unix: UGCNET-Dec2012-II: 36 https://gateoverflow.in/57072

In UNIX, which of the following command is used to set the task priority?

A. init B. nice C. kill D. PS

ugcnetdec2012ii unix operating-system

34.57.3 Unix: UGCNET-Dec2012-III: 37 https://gateoverflow.in/57670

Everything below the system call interface and above the physical hardware is known as

A. Kernel B. Bus C. Shell D. Stub

ugcnetdec2012iii unix operating-system non-gate
34.57.4 Unix: UGCNET-Dec2013-II: 50 https://gateoverflow.in/60274

Linux operating system uses

A. Affinity scheduling B. Fair Preemptive Scheduling
C. Hand Shaking D. Highest Penalty Ratio Next
ugcnetdec2013ii operating-system unix

34.57.5 Unix: UGCNET-Dec2013-III: 67 https://gateoverflow.in/60796

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
ugcnetdec2013iii operating-system unix non-gate

34.57.6 Unix: UGCNET-Dec2013-III: 73 https://gateoverflow.in/45083

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

ugcnetdec2013iii operating-system unix

34.57.7 Unix: UGCNET-Dec2013-III: 74 https://gateoverflow.in/60812

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 $!
ugcnetdec2013iii operating-system non-gate unix

34.57.8 Unix: UGCNET-Dec2015-II: 30 https://gateoverflow.in/62274

In Unix, the login prompt can be changed by changing the contents of the file_____

A. contrab B. init C. gettydefs D. inittab

ugcnetdec2015ii operating-system unix

34.57.9 Unix: UGCNET-Dec2015-III: 56 https://gateoverflow.in/62719

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
ugcnetdec2015iii unix operating-system non-gate

34.57.10 Unix: UGCNET-Dec2015-III: 57 https://gateoverflow.in/62722

What will be the output of the following Unix command? $rm chap0\[1-3\]

A. Remove file chap0[1-3] B. Remove file chap01, chap02, chap03

C. Remove file chap \[1-3\] D. None of the above
ugcnetdec2015iii unix operating-system non-gate

34.57.11 Unix: UGCNET-Jan2017-III: 51 https://gateoverflow.in/335187

Match the following for Unix file system :

 List-I List-II
a. Boot block
i. Information about file system, free block list,
free inode list etc.
b. Super block ii. Contains operating system files as well as
program and data files created by users.
c. Inode block iii. Contains boot program and partition table.
d. Data block iv. Contains a table for every file in the file system.
Attributes of files are stored here.
Codes :
A. a-iii, b-i, c-ii, d-iv B. a-iii, b-i, c-iv, d-ii
C. a-iv, b-iii, c-ii, d-i D. a-iv, b-iii, c-i, d-ii
ugcnetjan2017iii operating-system unix

34.57.12 Unix: UGCNET-Jan2017-III: 54 https://gateoverflow.in/335184

Which statements is not correct about “init” process in Unix?

A. It is generally the parent of the login shell.

B. It has PID 1.
C. It is the first process in the system.
D. Init forks and execs a ‘getty’ process at every port connected to a terminal.

ugcnetjan2017iii operating-system unix

34.57.13 Unix: UGCNET-June2013-II: 50 https://gateoverflow.in/58064

The mv command changes

A. the inode B. the inode-number
C. the directory entry D. both the directory entry and the inode
ugcnetjune2013ii unix

34.57.14 Unix: UGCNET-June2013-III: 64, UGCNET-Dec2015-II: 49 https://gateoverflow.in/47427

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
ugcnetjune2013iii ugcnetdec2015ii operating-system unix non-gate

34.57.15 Unix: UGCNET-June2014-III: 37 https://gateoverflow.in/57011

__________ 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

34.57.16 Unix: UGCNET-June2014-III: 46 https://gateoverflow.in/57187

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
34.57.17 Unix: UGCNET-June2015-II: 40 https://gateoverflow.in/54282

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
ugcnetjune2015ii unix

34.57.18 Unix: UGCNET-June2015-III: 54 https://gateoverflow.in/61332

A unix file may be of the type

A. Regular file B. Directory file
C. Device file D. Any one of the above
ugcnetjune2015iii operating-system unix

34.57.19 Unix: UGCNET-June2015-III: 73 https://gateoverflow.in/61493

Match the following for UNIX system calls :

List-I List-II
(a) exec (i) Creates new process
(b) brk (ii) Invokes another program overlaying memory
space with a copy of an executable file.
(c) wait (iii) To increase or decrease the size of data region
(d) fork (iv) A process synchronizes with termination of
child process
Codes :
A. (a)-(ii), (b)-(iii), (c)-(iv), (d)-(i) B. (a)-(iii), (b)-(ii), (c)-(iv), (d)-(i)
C. (a)-(iv), (b)-(iii), (c)-(ii), (d)-(i) D. (a)-(iv), (b)-(iii), (c)-(i), (d)-(ii)
ugcnetjune2015iii operating-system unix

34.57.20 Unix: UGCNET-June2016-III: 49 https://gateoverflow.in/57160

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
ugcnetjune2016iii operating-system unix

34.57.21 Unix: UGCNET-June2016-III: 50 https://gateoverflow.in/57166

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
ugcnetjune2016iii operating-system unix

34.57.22 Unix: UGCNET-June2016-III: 51 https://gateoverflow.in/57258

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

ugcnetjune2016iii operating-system unix

 34.57.23 Unix: UGCNET-Sep2013-II: 47 https://gateoverflow.in/59276

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

34.57.24 Unix: UGCNET-Sep2013-III: 74 https://gateoverflow.in/59950

Match the following for Windows Operating System :

(a) Hardware (i)
Starting all processes, emulation of different
abstration
operating system,security functions, transform
Layer character based applications to graphical
representation
(b) Kernel (ii) Export a virtual memory interface, support for
symmetric multiprocessing, administration,
details of mapping memory, configuring I/O
buses, setting up DMA
(c) Executive (iii) Thread scheduling, interrupt and exception
handling,recovery after power failure
(d) Win32 (iv) Objet manager, virtual memory manager,
subsystem process manager, plug-and-Play and power
manager
Codes :
A. (a)-(i), (b)-(iii), (c)-(ii), (d)-(iv) B. (a)-(iv), (b)-(iii), (c)-(ii), (d)-(i)
C. (a)-(ii), (b)-(iii), (c)-(iv), (d)-(i) D. (a)-(iii), (b)-(ii), (c)-(i), (d)-(iv)
ugcnetsep2013iii operating-system unix

34.57.25 Unix: UGCNET-dec2009-ii-40 https://gateoverflow.in/152933

The Unix command used to find out the number of characters in a file is

(A) nc

(B) wc

(C) chcnt

(D) lc
ugcnetdec2009ii unix operating-system

34.58 Virtual Memory (8)

34.58.1 Virtual Memory: GATE CSE 1998 | Question: 2.18, UGCNET-June2012-III: 48 https://gateoverflow.in/1691

If an instruction takes i microseconds and a page fault takes an additional j microseconds, the effective instruction time
if on the average a page fault occurs every k instruction is:
j i+j
A. i + B. i + (j × k) C. D. (i + j ) × k
k k
gate1998 operating-system virtual-memory easy ugcnetjune2012iii

34.58.2 Virtual Memory: GATE CSE 2006 | Question: 63, UGCNET-June2012-III: 45 https://gateoverflow.in/1841

A computer system supports 32-bit virtual addresses as well as 32-bit physical addresses. Since the virtual address
space is of the same size as the physical address space, the operating system designers decide to get rid of the virtual
memory entirely. Which one of the following is true?
A. Efficient implementation of multi-user support is no longer possible
B. The processor cache organization can be made more efficient now
C. Hardware support for memory management is no longer needed
D. CPU scheduling can be made more efficient now

gatecse-2006 operating-system virtual-memory normal ugcnetjune2012iii

34.58.3 Virtual Memory: GATE CSE 2011 | Question: 20, UGCNET-June2013-II: 48 https://gateoverflow.in/2122

Let the page fault service time be 10 milliseconds(ms) in a computer with average memory access time being 20
nanoseconds (ns). If one page fault is generated every 106 memory accesses, what is the effective access time for
memory?

A. 21 ns B. 30 ns C. 23 ns D. 35 ns
gatecse-2011 operating-system virtual-memory normal ugcnetjune2013ii

34.58.4 Virtual Memory: UGCNET-Dec2013-III: 70 https://gateoverflow.in/60809

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

ugcnetdec2013iii operating-system cache-memory virtual-memory

34.58.5 Virtual Memory: UGCNET-Dec2015-II: 26 https://gateoverflow.in/62266

A virtual memory has a page size of 1K words. There are eight pages and four blocks. The associative memory page
table contains the following entries :
Page Block
0 3
2 1
5 2
7 0
Which of the following list of virtual addresses (in decimal) will not cause any page fault if referenced by the CPU?
A. 1024, 3072, 4096, 6144 B. 1234, 4012, 5000, 6200
C. 1020, 3012, 6120, 8100 D. 2021, 4050, 5112, 7100
ugcnetdec2015ii operating-system virtual-memory

34.58.6 Virtual Memory: UGCNET-Jan2017-III: 2 https://gateoverflow.in/335236

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
ugcnetjan2017iii operating-system virtual-memory

34.58.7 Virtual Memory: UGCNET-June2014-II: 31 https://gateoverflow.in/54517

In a paged memory management algorithm, the hit ratio is 70%. If it takes 30 nanoseconds to search Translation Look-
aside Buffer (TLB) and 100 nanoseconds (ns) to access memory, the effective memory access time is

A. 91 ns B. 69 ns C. 200 ns D. 160 ns
ugcnetjune2014ii operating-system virtual-memory

34.58.8 Virtual Memory: UGCNET-dec2008-ii-42 https://gateoverflow.in/155366

If the executing program size is greater than the existing RAM of a computer, it is still possible to execute the
program if the OS supports :
 A. multitasking
B. virtual memory
C. paging system
D. none of the above

ugcnetdec2008ii operating-system virtual-memory

34.59 Vsam (1)

34.59.1 Vsam: UGCNET-Dec2010-II: 36 https://gateoverflow.in/67015

The dynamic allocation of storage areas with VSAM files is accomplished by

A. Hashing B. Control splits
C. Overflow areas D. Relative recoding
ugcnetdec2010ii operating-system vsam

34.60 Windows (5)

34.60.1 Windows: UGCNET-Dec2013-III: 68 https://gateoverflow.in/60800

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
ugcnetdec2013iii operating-system windows non-gate

34.60.2 Windows: UGCNET-Dec2014-III: 73 https://gateoverflow.in/61527

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 2000
C. Windows NT D. Windows 98
ugcnetdec2014iii operating-system windows

34.60.3 Windows: UGCNET-Dec2015-III: 55 https://gateoverflow.in/62718

The character set used in Windows 2000 operating system is

A. 8 bit ASCII B. Extended ASCII
C. 16 bit UNICODE D. 12 bit UNICODE
ugcnetdec2015iii windows operating-system non-gate

34.60.4 Windows: UGCNET-June2013-III: 66 https://gateoverflow.in/58892

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
ugcnetjune2013iii operating-system windows

34.60.5 Windows: UGCNET-Sep2013-III: 73 https://gateoverflow.in/59948

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
ugcnetsep2013iii operating-system windows

Answer Keys
34.0.1 B 34.0.2 D 34.0.3 B 34.0.4 Q-Q 34.0.5 Q-Q
34.0.6 Q-Q 34.0.7 Q-Q 34.0.8 Q-Q 34.0.9 Q-Q 34.0.10 Q-Q
34.0.11 Q-Q 34.0.12 X 34.0.13 Q-Q 34.0.14 Q-Q 34.0.15 C
34.0.16 C 34.0.17 Q-Q 34.0.18 A 34.0.19 Q-Q 34.0.20 Q-Q
34.0.21 Q-Q 34.0.22 Q-Q 34.0.23 C 34.0.24 A 34.0.25 A
34.0.26 Q-Q 34.0.27 A 34.0.28 B 34.0.29 C 34.0.30 Q-Q
34.0.31 Q-Q 34.0.32 Q-Q 34.0.33 D 34.0.34 Q-Q 34.0.35 A
34.1.1 C 34.2.1 A 34.3.1 B 34.4.1 C 34.5.1 C
34.6.1 C 34.7.1 Q-Q 34.7.2 Q-Q 34.8.1 Q-Q 34.8.2 Q-Q
34.8.3 B 34.8.4 D 34.8.5 A 34.8.6 A 34.9.1 D
34.10.1 B 34.11.1 C 34.12.1 A 34.13.1 B 34.14.1 C
34.14.2 X 34.14.3 D 34.14.4 C 34.14.5 B 34.14.6 D
34.14.7 C 34.14.8 C 34.14.9 B 34.15.1 A 34.15.2 B
34.15.3 C 34.15.4 B 34.15.5 A 34.15.6 A 34.15.7 D
34.16.1 B 34.17.1 Q-Q 34.18.1 B 34.19.1 Q-Q 34.19.2 C
34.19.3 X 34.19.4 B 34.19.5 B 34.19.6 A 34.19.7 B
34.20.1 Q-Q 34.21.1 B 34.22.1 A 34.22.2 C 34.23.1 Q-Q
34.23.2 C 34.24.1 Q-Q 34.24.2 Q-Q 34.25.1 A 34.26.1 Q-Q
34.27.1 Q-Q 34.27.2 A 34.28.1 Q-Q 34.28.2 X 34.28.3 A
34.28.4 B 34.28.5 A 34.28.6 C 34.28.7 Q-Q 34.28.8 Q-Q
34.29.1 A 34.30.1 A 34.31.1 D 34.32.1 C 34.33.1 A
34.33.2 B 34.34.1 Q-Q 34.34.2 C 34.34.3 Q-Q 34.34.4 D
34.34.5 A 34.34.6 Q-Q 34.35.1 C 34.35.2 B 34.35.3 B
34.35.4 D 34.35.5 D 34.36.1 B 34.36.2 Q-Q 34.36.3 C
34.36.4 B 34.36.5 Q-Q 34.36.6 Q-Q 34.36.7 C 34.36.8 C
34.37.1 A 34.38.1 B 34.38.2 B 34.39.1 Q-Q 34.39.2 Q-Q
34.40.1 A 34.40.2 Q-Q 34.40.3 Q-Q 34.40.4 B 34.40.5 B
34.40.6 D 34.40.7 A 34.40.8 Q-Q 34.40.9 B 34.40.10 Q-Q
34.40.11 A 34.40.12 D 34.40.13 B 34.40.14 D 34.40.15 B
34.40.16 B 34.40.17 C 34.40.18 B 34.40.19 A 34.40.20 A
34.40.21 Q-Q 34.41.1 B 34.41.2 Q-Q 34.42.1 Q-Q 34.43.1 D;E
34.43.2 A 34.43.3 B 34.44.1 Q-Q 34.45.1 Q-Q 34.45.2 B
34.45.3 Q-Q 34.45.4 Q-Q 34.46.1 B 34.47.1 Q-Q 34.47.2 A
34.47.3 D 34.47.4 Q-Q 34.48.1 D 34.48.2 B 34.48.3 B
34.48.4 D 34.48.5 C 34.48.6 C 34.48.7 B 34.49.1 Q-Q
34.50.1 D 34.51.1 D 34.52.1 A 34.52.2 C 34.53.1 D
34.54.1 C 34.54.2 B 34.54.3 B 34.54.4 C 34.54.5 C
34.55.1 C 34.55.2 B 34.56.1 C 34.57.1 3 34.57.2 B
34.57.3 A 34.57.4 B 34.57.5 C 34.57.6 A 34.57.7 D
34.57.8 C 34.57.9 B 34.57.10 B 34.57.11 A 34.57.12 A;C
34.57.13 C 34.57.14 C 34.57.15 C 34.57.16 C 34.57.17 C
34.57.18 D 34.57.19 A 34.57.20 C 34.57.21 C 34.57.22 C
34.57.23 X 34.57.24 C 34.57.25 Q-Q 34.58.1 A 34.58.2 C
34.58.3 B 34.58.4 D 34.58.5 C 34.58.6 C 34.58.7 D
34.58.8 Q-Q 34.59.1 Q-Q 34.60.1 B 34.60.2 A 34.60.3 C
34.60.4 D 34.60.5 D
35 Others: Others (709)

35.0.1 UGCNET-Dec2019-II: 1 https://gateoverflow.in/360832

A basic feasible solution of an m × n transportation problem is said to be non-degenerate, if basic feasible solution
contains exactly _______ number of individual allocation in ______ positions.
A. m + n + 1 , independent B. m + n − 1 , independent
C. m + n − 1 , appropriate D. m − n + 1 , independent
ugcnetdec2019ii

35.0.2 UGCNET-DEC2016-II: 19 https://gateoverflow.in/113161

Consider a schema R(MNPQ) and functional dependencies M→N, P→Q. Then the decomposition of R into R1(MN)
and R2(PQ) 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

ugcnetdec2016ii

35.0.3 UGCNET-June2013-II: 26 https://gateoverflow.in/58017

Given an open address hash table with load factor α < 1 , the expected number of probes in a successful search is
1 1
A. Atmost 1
α In ( 1−α
α )
B. Atmost α In ( 1−α )
1 1 1 α
C. Atleast α In ( 1−α ) D. Atleast α In ( 1−α )
ugcnetjune2013ii

35.0.4 UGCNET-June2013-II: 25 https://gateoverflow.in/58016

Which is the correct statement(s) for Non Recursive predictive parser?

S1 : First(α) = {t ∣ α⇒ * tβ for some string β}⇒ * tβ
S2 : Follow(X) = {a ∣ S⇒ * αXaβ for some string αandβ}
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
ugcnetjune2013ii

35.0.5 UGCNET-June2013-II: 22 https://gateoverflow.in/58011

Given a grammar S1 → Sc, S → SA ∣ A, A → aSb ∣ ab , there is a rightmost derivation

S1 ⇒ Sc ⇒ SAC ⇒ SaSbc Thus, SaSbc is a right sentential form, and its handle is

A. SaS B. bc C. Sbc D. aSb

ugcnetjune2013ii

35.0.6 UGCNET-June2013-II: 19 https://gateoverflow.in/58008

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
ugcnetjune2013ii

35.0.7 UGCNET-June2013-II: 36 https://gateoverflow.in/58040

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.

100 100
A. P2 B. C2 C. 2100 D. 3100
 ugcnetjune2013ii

35.0.8 UGCNET-DEC2016-II: 32 https://gateoverflow.in/113174

Consider the following assembly language instructions:

mov al, 15
mov ah, 15
xor al, al
mov cl, 3
shr ax, cl
add al, 90H
adc ah, 0
What is the value in ax register after execution of above instructions?

A. 0270H B. 0170H C. 01E0H D. 0370H

ugcnetdec2016ii

35.0.9 UGCNET-June2011-II: 8 https://gateoverflow.in/64350

A latch is constructed using two cross-coupled

A. AND and OR gates B. AND gates C. NAND and NOR gatesD. NAND gates
ugcnetjune2011ii

35.0.10 UGCNET-June2011-II: 10 https://gateoverflow.in/64356

8-bit 1′ s complement form of −77.25 is

A. 01001101.0100 B. 01001101.0010
C. 10110010.1011 D. 10110010.1101
ugcnetjune2011ii

35.0.11 UGCNET-AUG2016-III: 7 https://gateoverflow.in/70750

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. II and III only B. I and IV only C. I, II, and III only D. I, III and IV only
ugcnetaug2016iii databases

35.0.12 UGCNET-AUG2016-II: 17 https://gateoverflow.in/69552

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.

ugcnetaug2016ii

35.0.13 UGCNET-DEC2016-II: 27 https://gateoverflow.in/113169

The maximum size of the data that the application layer can pass on to the TCP layer below is _____
A. 216 bytes B. 216 bytes + TCP header length
C. 216 bytes – TCP header length D. 216 bytes
ugcnetdec2016ii
35.0.14 UGCNET-DEC2016-II: 25 https://gateoverflow.in/113167

Which of the following statements is false?

1. Optimal binary search tree construction can be performed efficiently using dynamic programming
2. Breadth-first search cannot be used to find connected components of a graph
3. Given the prefix and postfix walks of a binary tree, the tree cannot be re-constructed uniquely
4. Depth-first-search can be used to find the components of a graph

A. 1 B. 2 C. 3 D. 4
ugcnetdec2016ii

35.0.15 UGCNET-DEC2016-II: 23 https://gateoverflow.in/113165

Which of the following is a valid heap?

A. A B. B C. C D. D
ugcnetdec2016ii

35.0.16 UGCNET-DEC2016-II: 22 https://gateoverflow.in/113164

The seven elements A, B, C, D, E, F and G are pushed onto a stack in reverse order, i.e., starting from G. 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. A B. B C. F D. G
ugcnetdec2016ii

35.0.17 UGCNET-DEC2016-II: 16 https://gateoverflow.in/113158

An attribute A of datatype varchar(20) has value ‘Ram’ and the attribute B of datatype char(20) has value ‘Sita’ in
oracle. The attribute A has _______ memory spaces and B has _______ memory spaces.

A. 20, 20 B. 3, 20 C. 3, 4 D. 20, 4
ugcnetdec2016ii

35.0.18 UGCNET-June2013-II: 29 https://gateoverflow.in/58019

The value of postfix expression: 834+-382/+*2$3+ is

A. 17 B. 131 C. 64 D. 52
ugcnetjune2013ii
35.0.19 UGCNET-June2011-II: 9 https://gateoverflow.in/64353

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
ugcnetjune2011ii

35.0.20 UGCNET-June2011-II: 33 https://gateoverflow.in/65519

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
ugcnetjune2011ii databases

35.0.21 UGCNET-June2011-II: 11 https://gateoverflow.in/64358

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
ugcnetjune2011ii

35.0.22 UGCNET-June2011-II: 12 https://gateoverflow.in/64359

What features make C + + so powerful ?

A. Easy implementation B. Reusing old code
C. Easy memory management D. All of the above
ugcnetjune2011ii

35.0.23 UGCNET-June2011-II: 17 https://gateoverflow.in/64564

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
ugcnetjune2011ii databases

35.0.24 UGCNET-June2011-II: 28 https://gateoverflow.in/65509

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

ugcnetjune2011ii computer-networks

35.0.25 UGCNET-June2011-II: 29 https://gateoverflow.in/65512

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
ugcnetjune2011ii computer-networks

35.0.26 UGCNET-DEC2016-II: 12 https://gateoverflow.in/113154

Which one of the following is correct for overloaded functions in C++?

A. Compiler sets up a separate function for every definition of the function.

B. The compiler does not set up a separate function for every definition of the function.
C. Overloaded functions cannot handle different types of objects.
D. Overloaded functions cannot have the a same number of arguments.

ugcnetdec2016ii

35.0.27 UGCNET-DEC2016-II: 15 https://gateoverflow.in/113157

If X is a binary number which is the power of 2, then the value of X&(X-1) is:

A. 11….11 B. 00…..00 C. 100…..0 D. 000…..1

ugcnetdec2016ii

35.0.28 UGCNET-DEC2016-II: 7 https://gateoverflow.in/113149

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

ugcnetdec2016ii

35.0.29 UGCNET-DEC2016-II: 9 https://gateoverflow.in/113151

Convert the octal number 0.4051 into its equivalent decimal number.

A. 0.5100098 B. 0.2096 C. 0.52 D. 0.4192

ugcnetdec2016ii

35.0.30 UGCNET-DEC2016-II: 10 https://gateoverflow.in/113152

The hexadecimal equivalent of the octal number 2357 is:

A. 2EE B. 2FF C. 4EF D. 4FE

ugcnetdec2016ii

35.0.31 UGCNET-DEC2016-II: 11 https://gateoverflow.in/113153

Which of the following cannot be passed to a function in C++?

A. Constant B. Structure C. Array D. Header file

ugcnetdec2016ii

35.0.32 UGCNET-DEC2016-II: 13 https://gateoverflow.in/113155

Which of the following storage classes have global visibility in C/C++?

A. Auto B. Extern C. Static D. Register

ugcnetdec2016ii

35.0.33 UGCNET-DEC2016-II: 14 https://gateoverflow.in/113156

Which of the following operators cannot be overloaded in C/C++?

A. Bitwise right shift assignment B. Address of
C. Indirection D. Structure reference
ugcnetdec2016ii

35.0.34 UGCNET-June2013-II: 27 https://gateoverflow.in/58018

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(t2 h) D. O(th)

 ugcnetjune2013ii

35.0.35 UGCNET-June2013-II: 31 https://gateoverflow.in/58021

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

ugcnetjune2013ii

35.0.36 UGCNET-June2005-II: 39 https://gateoverflow.in/335424

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
ugcnetjune2005ii

35.0.37 UGCNET-June2013-II: 8 https://gateoverflow.in/57942

What is the result of the expression(1&2)+(3/4)?

A. 1 B. 2 C. 3 D. 0
ugcnetjune2013ii

35.0.38 UGCNET-Sep2013-II: 19 https://gateoverflow.in/59072

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

35.0.39 UGCNET-Dec2013-II: 40 https://gateoverflow.in/60243

35.0.40 UGCNET-June2011-II: 6 https://gateoverflow.in/64346

The hexadecimal number equivalent to (1762.46)8 is

A. 3F2.89 B. 3F2.98 C. 2F3.89 D. 2F3.98

ugcnetjune2011ii

35.0.41 UGCNET-June2011-II: 5 https://gateoverflow.in/64343

The number of 1’s present in the binary representation of 10 × 256 + 5 × 16 + 5 is

A. 5 B. 6 C. 7 D. 8
ugcnetjune2011ii

35.0.42 UGCNET-June2011-II: 3 https://gateoverflow.in/64333

The proposition ∼ p ∨ q is equivalent to

A. p → q B. q → p
C. p ↔ q D. p ∨ q
ugcnetjune2011ii

35.0.43 UGCNET-June2011-II: 2 https://gateoverflow.in/64329

The circumference of the two concentric disks are divided into 100 sections each. For the outer disk, 100 of the
sections are painted red and 100 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. 100 or more B. 125 or more C. 150 or more D. 175 or more of the sections on the
inner disks have their
colours matched with the corresponding section on outer disk.

ugcnetjune2011ii

35.0.44 UGCNET-Dec2011-II: 23 https://gateoverflow.in/63670

Data security threats include

A. Privacy invasion B. Hardware failure
C. Fraudulent manipulation of data D. Encryption and decryption
ugcnetdec2011ii databases

35.0.45 UGCNET-Dec2011-II: 2 https://gateoverflow.in/62938

The total number of comparisons in a bubble sort is

A. 0(log n) B. 0(n log n) C. 0(n) D. None of the above

ugcnetdec2011ii

35.0.46 UGCNET-June2011-II: 7 https://gateoverflow.in/64348

¯ is equivalent to
(A + B)AB
A. A ⨁ B B. A ⨀ B
C. (A ⨁ B) ⨀ A D. (A ⨀ B) ⨁ A
ugcnetjune2011ii

35.0.47 UGCNET-June2013-II: 13 https://gateoverflow.in/57970

Which normal form is considered as adequate for usual database design?

A. 2NF B. 3NF C. 4NF D. 5NF

ugcnetjune2013ii

35.0.48 UGCNET-June2013-II: 12 https://gateoverflow.in/57969

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
ugcnetjune2013ii

35.0.49 UGCNET-June2013-II: 11 https://gateoverflow.in/57946

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
ugcnetjune2013ii

35.0.50 UGCNET-June2013-II: 10 https://gateoverflow.in/57945

Which of the following is not a type of Database Management System?

A. Hierarchical B. Network C. Relational D. Sequential

ugcnetjune2013ii

35.0.51 UGCNET-June2013-II: 9 https://gateoverflow.in/57943

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
ugcnetjune2013ii

35.0.52 UGCNET-June2013-II: 7 https://gateoverflow.in/57941

How many values can be held by an array A(-1, m; 1, m)?

A. m B. m2 C. m(m+1) D. m(m+2)
ugcnetjune2013ii

35.0.53 UGCNET-June2013-II: 32 https://gateoverflow.in/58023

The task of correcting and preprocessing data is called as

A. Data streaming B. Data cleaning
C. Data mining D. Data storming
ugcnetjune2013ii

35.0.54 UGCNET-June2013-II: 18 https://gateoverflow.in/57976

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
ugcnetjune2013ii

35.0.55 UGCNET-June2013-II: 42 https://gateoverflow.in/58044

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
ugcnetjune2013ii

35.0.56 UGCNET-June2013-II: 16 https://gateoverflow.in/57973

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
ugcnetjune2013ii

35.0.57 UGCNET-June2013-II: 44 https://gateoverflow.in/58049

A set of processors P 1, P 2, … P k can execute in parallel if Bernstein’s conditions are satisfied on a pairwise basis;
that is P 1 ∥ P 2 ∥ P 3 ∥ ⋯ ∥ P k if and only if:

A. Pi ∥ Pj for all i ≠ j B. Pi ∥ Pj for all i = j + 1

C. Pi ∥ Pj for all i ≤ j D. Pi ∥ Pj for all i ≥ j
ugcnetjune2013ii

35.0.58 UGCNET-June2013-II: 46 https://gateoverflow.in/58053

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
ugcnetjune2013ii
35.0.59 UGCNET-June2013-II: 49 https://gateoverflow.in/58059

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.

ugcnetjune2013ii

35.0.60 UGCNET-June2013III: 55 https://gateoverflow.in/58833

35.0.61 UGCNET-June2013-II: 15 https://gateoverflow.in/57972

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

ugcnetjune2013ii

35.0.62 UGCNET-June2013-II: 6 https://gateoverflow.in/57860

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
ugcnetjune2013ii

35.0.63 UGCNET-June2013-II: 2 https://gateoverflow.in/57857

Match the following :

a. Good Quality i. Program does not fail for a specified time
in a given environment
b. Correctness ii. Meets the functional Requirement
c. Predictable iii. Meets Both functional and non-functional
requirements
d. Reliable iv. Process is under statistical control
Codes :
A. a-iii; b-ii; c-iv; d-i B. a-ii; b-iii; c-iv; d-i
C. a-i; b-ii; c-iv; d-iii D. a-i; b-ii; c-iii; d-iv
ugcnetjune2013ii

35.0.64 UGCNET-June2012-III: 42 https://gateoverflow.in/56279

Which of the following binary tree is optimal, if probabilities of successful search and unsuccessful search are same?

D.
B. C.
A.
ugcnetjune2012iii
35.0.65 UGCNET-June2012-III: 47 https://gateoverflow.in/56298

The colour of an object is largely determined by its diffuse reflection coefficient. If Kd = (0.8, 0.4, 0) , 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
ugcnetjune2012iii

35.0.66 UGCNET-June2013-II: 1 https://gateoverflow.in/57845

COCOMO stands for

A. COmposite COst MOdel B. COnstructive COst MOdel
C. COnstructive COmposite MOdel D. COmprehensive COnstruction MOdel
ugcnetjune2013ii

35.0.67 UGCNET-June2013-II: 4 https://gateoverflow.in/57858

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

ugcnetjune2013ii

35.0.68 UGCNET-June2013-II: 14 https://gateoverflow.in/57971

If D1 , D2 , … Dn are domains in a relational model, then the relation is a table, which is a subset of
A. D1 + D2 + ⋯ + Dn B. D1 × D2 × ⋯ × Dn
C. D1 ∪ D2 ∪ ⋯ ∪ Dn D. D1 − D2 − ⋯ − Dn
ugcnetjune2013ii

35.0.69 UGCNET-June2006-II: 47 https://gateoverflow.in/335600

Bluetooth technology uses the transmission media.

A. Radio links B. Microwave links
C. VSAT communication D. Optical fiber links
ugcnetjune2006ii

35.0.70 UGCNET-Dec2019-I: 15 https://gateoverflow.in/360718

Given below are two Statements – One is labelled as Assertion (A) and other is labelled as Reason (R):
Assertion (A): Use of slang in formal teaching makes communication lively and interesting.
Reasons (R): Academic decency demands the avoidance of slang in the classroom environment.
In the light of the above statements, choose the correct option:

A. Both (A) and (R) are true and (R) is the correct explanation of (A)
B. Both (A) and (R) are true and (R) is not the correct explanation of (A)
C. (A) is true, but (R) is false
D. (A) is false, but (R) is true

ugcnetdec2019i

35.0.71 UGCNET-Dec2013-III: 12 https://gateoverflow.in/60394

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)

ugcnetdec2013iii

35.0.72 UGCNET-June2007-II: 7 https://gateoverflow.in/335726

Which of the following expression remove hazard form : xy + zx̄?

A. xy + zx̄ B. xy + zx̄ C. xy + zx̄ + yz D. xy + zx̄ + wz

ugcnetjune2007ii

35.0.73 UGCNET-Dec2019-I: 8 https://gateoverflow.in/360725

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
ugcnetdec2019i

35.0.74 UGCNET-Dec2019-I: 9 https://gateoverflow.in/360724

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
ugcnetdec2019i

35.0.75 UGCNET-Dec2019-I: 10 https://gateoverflow.in/360723

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
ugcnetdec2019i

35.0.76 UGCNET-Dec2019-I: 2 https://gateoverflow.in/360731

Which of the following statements differentiate teaching from learning?

a. Teaching is a social act while learning is a personal act b. Teaching implies learning
c. Teaching is like selling while learning is like buying d. Teaching can occur without learning taking place
e. In teaching, influence is directed towards learning and learner,Choose the correct answer from the following options:
while in learning it is usually towards oneself
A. (a), (c) and (e) B. (a), (b) and (c)
C. (b), (c) and (d) D. (c) , (d) and (e)
ugcnetdec2019i

35.0.77 UGCNET-Dec2019-II: 92 https://gateoverflow.in/360741

A flow graph F with entry node (1) and exit node (11) is shown below:

What is the cyclomatic complexity of flowgraph F ?

 A. 2 B. 3 C. 4 D. 5
ugcnetdec2019ii

35.0.78 UGCNET-Dec2019-I: 35 https://gateoverflow.in/360698

The national agency for responding to computer security incidents as and when they occur, is

A. CAT B. CDAC C. CCA D. ICERT

ugcnetdec2019i

35.0.79 UGCNET-Dec2019-I: 37 https://gateoverflow.in/360696

Under Green India Mission, how many hectares of degraded forest land is to be brought under afforestation?
A. 02 million hectares B. 06 million hectares
C. 08 million hectares D. 20 million hectares
ugcnetdec2019i

35.0.80 UGCNET-Dec2007-II: 48 https://gateoverflow.in/335736

Consider a typical mobile communication system. If 840 frequencies are available, how many can be used in a given
cell ?

A. 140 B. 120 C. 84 D. 60
ugcnetdec2007ii

35.0.81 UGCNET-June2007-II: 1 https://gateoverflow.in/335732

The following determiniotic finite automata recognizes:

A. Set of all strings containing ′ ab′ B. Set of all strings containing ′ aab′
C. Set of all strings ending in ′ abab′ D. None of the above
ugcnetjune2007ii

35.0.82 UGCNET-June2007-II: 2 https://gateoverflow.in/335731

Depth ion travels of the following directed graph is:

A. A B C D E F B. A B D E F C
C. A C E B D F D. None of the above
ugcnetjune2007ii

35.0.83 UGCNET-June2007-II: 3 https://gateoverflow.in/335730

The maximum number of nodes in a binary tree of depth 10:

A. 1024 B. 210 − 1 C. 1000 D. None of the above

ugcnetjune2007ii

35.0.84 UGCNET-June2007-II: 4 https://gateoverflow.in/335729

The regular expression given below describes:

r = (1 + 01)*(0 + λ)

A. Set of all string not containing ′ 11′

B. Set of all string not containing ′ 00′
′ ′
C. Set of all string containing ′ 01′
D. Set of all string ending in ′ 0′

ugcnetjune2007ii

35.0.85 UGCNET-June2007-II: 5 https://gateoverflow.in/335728

Which of the following language is regular:

A. L ={an bn |n ≥ 1 } B. L ={an bm cn d m |n, m ≥ 1 }
C. L ={an bm |n, m ≥ 1 } D. L ={an bm cn |n, m ≥ 1 }
ugcnetjune2007ii

35.0.86 UGCNET-June2007-II: 6 https://gateoverflow.in/335727

2’s complement of −100 is:

A. 00011100 B. 10011101 C. 10011100 D. 11100100

ugcnetjune2007ii

35.0.87 UGCNET-Dec2007-II: 47 https://gateoverflow.in/335737

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

ugcnetdec2007ii

35.0.88 UGCNET-Dec2019-I: 6 https://gateoverflow.in/360727

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
ugcnetdec2019i

35.0.89 UGCNET-June2007-II: 18 https://gateoverflow.in/335715

A subclass having more than one super class is called:

A. Category B. Classification
C. Combination D. Partial Participation
ugcnetjune2007ii

35.0.90 UGCNET-Dec2019-I: 39 https://gateoverflow.in/360694

The most dominant source of Benzene emissions in ambient air is

A. Cement industry B. Cigarettes
C. Car exhausts D. Paints and varnish
ugcnetdec2019i

35.0.91 UGCNET-Dec2019-I: 38 https://gateoverflow.in/360695

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
ugcnetdec2019i

35.0.92 UGCNET-Dec2007-II: 39 https://gateoverflow.in/335745

An example of a directory found in most UNIX system is :

A. usr B. waitpid C. brk D. unmap

ugcnetdec2007ii

35.0.93 UGCNET-Dec2007-II: 46 https://gateoverflow.in/335738

Given a parallel algorithm A with computation time t, if parallel algorithm A performs m computational operation,
then p processors can execute algorithm A in time given by :

A. t/p B. mt/p C. t + (m − t)/p D. (m − t)/p

ugcnetdec2007ii

35.0.94 UGCNET-Dec2019-I: 36 https://gateoverflow.in/360697

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

ugcnetdec2019i

35.0.95 UGCNET-June2007-II: 9 https://gateoverflow.in/335724

If A ⊕ B = C, then:
A. A ⊕ C = B B. B ⊕ C = A
C. A ⊕ B ⊕ C = 1 D. A ⊕ B ⊕ C = 0
ugcnetjune2007ii

35.0.96 UGCNET-June2007-II: 17 https://gateoverflow.in/335716

A recursive foreign key is a :

A. references a relation B. references a table
C. references its own relation D. references a foreign key
ugcnetjune2007ii

35.0.97 UGCNET-June2007-II: 8 https://gateoverflow.in/335725

How many 1’s are present in the binary representation of 15 × 256 + 5 × 16 + 3:

A. 8 B. 9 C. 10 D. 11
ugcnetjune2007ii

35.0.98 UGCNET-June2007-II: 16 https://gateoverflow.in/335717

Which of the following statements is wrong?

A. 2− 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 2−phase locking Protocol donot.
D. None of these

ugcnetjune2007ii
35.0.99 UGCNET-June2007-II: 15 https://gateoverflow.in/335718

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

ugcnetjune2007ii

35.0.100 UGCNET-June2007-II: 13 https://gateoverflow.in/335720

What keyboard in class specification helps to hide data:

A. Public B. Private C. Static D. Void

ugcnetjune2007ii

35.0.101 UGCNET-June2007-II: 12 https://gateoverflow.in/335721

In case of right shift bitwise operator in ′ C ′ language, after shifting n bits, the leftmost n 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
ugcnetjune2007ii

35.0.102 UGCNET-June2007-II: 11 https://gateoverflow.in/335722

The following loop in ′ C ′ :

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
ugcnetjune2007ii

35.0.103 UGCNET-June2007-II: 10 https://gateoverflow.in/335723

What is the maximum counting speed of a 4-bit binary counter which is composed of Flip-Flop with a propagation
delay of 25 ns?

A. 1MHz B. 10MHz C. 100MHz D. 4MHz

ugcnetjune2007ii

35.0.104 UGCNET-Dec2019-I: 7 https://gateoverflow.in/360726

A researcher intends to make use of ICT in his/her research. What considerations should weigh most in such a
decision?
a. Appropriateness of the tool used b. Cost involved in procuring it
c. Availability of tools in the department where research is to d.be Willingness of his/her supervisor to offer help
undertaken Choose your answer from the following options:
e. The company from which the ICT equipment has been procured
A. (a), (b) and (c) B. (c) , (d) and (e)
C. (a), (c) and (d) D. (b), (c) and (e)
ugcnetdec2019i

35.0.105 UGCNET-Dec2019-I: 5 https://gateoverflow.in/360728

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
ugcnetdec2019i
35.0.106 UGCNET-Dec2019-I: 16 https://gateoverflow.in/360717

In a certain coding language, ‘AEIOU’ is written as ‘TNHDZ’. Using the same coding language, ‘BFJPV’ will be
written as

A. UOIEA B. AEIOU C. CGKQW D. WQKGC

ugcnetdec2019i

35.0.107 UGCNET-Dec2019-I: 14 https://gateoverflow.in/360719

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)
ugcnetdec2019i

35.0.108 UGCNET-Dec2019-I: 30 https://gateoverflow.in/360703

The following table gives the percentage of marks obtained by 6 students in 5 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:

In which subject the performance of the students is worst in terms of percentage of marks?

A. Chemistry B. Physics C. Biology D. English

ugcnetdec2019i

35.0.109 UGCNET-Dec2019-I: 29 https://gateoverflow.in/360704

The following table gives the percentage of marks obtained by 6 students in 5 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 60% and above marks in all the subjects?

A. Three B. Two C. One D. Zero

ugcnetdec2019i

35.0.110 UGCNET-Dec2019-I: 28 https://gateoverflow.in/360705

The following table gives the percentage of marks obtained by 6 students in 5 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. 86.66 B. 76.66 C. 66.66 D. 60.00

ugcnetdec2019i

35.0.111 UGCNET-Dec2019-I: 27 https://gateoverflow.in/360706

The following table gives the percentage of marks obtained by 6 students in 5 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. 375 B. 395 C. 455 D. 475

ugcnetdec2019i

35.0.112 UGCNET-Dec2019-I: 26 https://gateoverflow.in/360707

The following table gives the percentage of marks obtained by 6 students in 5 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. 70% B. 72% C. 60% D. 58.33%

ugcnetdec2019i

35.0.113 UGCNET-Dec2019-I: 24 https://gateoverflow.in/360709

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
ugcnetdec2019i
35.0.114 UGCNET-Dec2019-I: 23 https://gateoverflow.in/360710

Which of the following is converse of “Some S is P ”?

A. Some S is not P B. Some P is not S
C. Some P is S D. No P is S
ugcnetdec2019i

35.0.115 UGCNET-Dec2019-I: 32 https://gateoverflow.in/360701

The term one gigabyte refers to:

A. 1024 petabytes B. 1024 megabytes
C. 1024 kilobytes D. 1024 bytes
ugcnetdec2019i

35.0.116 UGCNET-Dec2019-I: 22 https://gateoverflow.in/360711

Consider the following argument:

Statements: Some chairs are curtains.
All curtains are bedsheets.
Conclusion: Some chairs are bedsheets
What is the Mood of the above proposition?

A. IAI B. IAA C. IIA D. AII

ugcnetdec2019i

35.0.117 UGCNET-Dec2019-I: 21 https://gateoverflow.in/360712

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

ugcnetdec2019i

35.0.118 UGCNET-Dec2019-I: 20 https://gateoverflow.in/360713

What is the exact equivalent discount of three successive discounts of 10%, 15% and 20% by sale of an article?

A. 35.8% B. 38.5% C. 35.5% D. 38.8%

ugcnetdec2019i

35.0.119 UGCNET-Dec2019-I: 19 https://gateoverflow.in/360714

A certain principal invested at compound interest payable yearly amounts to Rs. 10816.00 in 3 years and Rs.
11248.64 in 4 years. What is the rate of interest?

A. 3% B. 4% C. 4.5% D. 5.5%
ugcnetdec2019i

35.0.120 UGCNET-Dec2019-I: 18 https://gateoverflow.in/360715

The sum of a number and its inverse is −4. The sum of their cubes is:

A. −52 B. 52 C. 64 D. −64
ugcnetdec2019i
35.0.121 UGCNET-Dec2019-I: 17 https://gateoverflow.in/360716

If 3% of (a + b) = 7% of (ab)
and 5% of (a − b) = 4% of (ab),
then what percentage of b is a?
47 23 4700 2300
A. % B. % C. % D. %
23 47 23 47
ugcnetdec2019i

35.0.122 UGCNET-Dec2019-I: 31 https://gateoverflow.in/360702

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

ugcnetdec2019i

35.0.123 UGCNET-Dec2019-I: 33 https://gateoverflow.in/360700

_________ is a wireless technology built in electronic gadgets for transferring data over short distance

A. WiFi B. Bluetooth C. Modem D. USB

ugcnetdec2019i

35.0.124 UGCNET-Dec2019-I: 4 https://gateoverflow.in/360729

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

ugcnetdec2019i

35.0.125 UGCNET-Dec2019-II: 97 https://gateoverflow.in/360736

An organization needs to maintain database having five attributes A, B, C, D, E. These attributes are functionally
dependent on each other for which functionality dependency set F is given as:
F : {A → BC, D → E, BC → D, A → D} . Consider a universal relation R(A, B, C, D, E) with functional
dependency set F. Also all attributes are simple and take atomic values only.
Identify primary key of table R with functional dependency set F

A. BC B. AD C. A D. AB
ugcnetdec2019ii

35.0.126 UGCNET-Dec2019-I: 3 https://gateoverflow.in/360730

Which of the following are classroom related factors that influence effectiveness of teaching?
a. Prior task related behavior of students b. Adherence to linear pattern of communication by the teacher
c. Socio-economic status of the family to which learners belong d. Inappropriate use of technological resources by the teacher
e. Cultural background of students Choose your answer from the following options:
A. (a), (b) and (c) B. (b), (c) and (d)
C. (a), (b) and (d) D. (c) , (d) and (e)
ugcnetdec2019i

35.0.127 UGCNET-Dec2019-I: 1 https://gateoverflow.in/360732

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

ugcnetdec2019i

35.0.128 UGCNET-Dec2019-I: 12 https://gateoverflow.in/360721

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
ugcnetdec2019i

35.0.129 UGCNET-Dec2019-II: 100 https://gateoverflow.in/360733

An organization needs to maintain database having five attributes A, B, C, D, E. These attributes are functionally
dependent on each other for which functionality dependency set F is given as:
F : {A → BC, D → E, BC → D, A → D} . Consider a universal relation R(A, B, C, D, E) with functional
dependency set F. Also all attributes are simple and take atomic values only.
Assume that given table R is decomposed in two tables
R1 (A, B, C) with functional dependency set f1 = {A → B, A → C} and
R2 (A, D, E) with FD set F2 = {A → D, D → E}
Which of the following option is true w.r.t. given decomposition?
A. Dependency preservation property is followed B. R1 and R2 are both in 2 NF
C. R2 is in 2 NF and R3 is in 3 NF D. R1 is in 3 NF and R2 is in 2 NF
ugcnetdec2019ii

35.0.130 UGCNET-Dec2019-II: 99 https://gateoverflow.in/360734

An organization needs to maintain database having five attributes A, B, C, D, E. These attributes are functionally
dependent on each other for which functionality dependency set F is given as:
F : {A → BC, D → E, BC → D, A → D} . Consider a universal relation R(A, B, C, D, E) with functional
dependency set F. Also all attributes are simple and take atomic values only.
Identify the redundant functional dependency in F
A. BC → D B. D → E
C. A → D D. A → BC
ugcnetdec2019ii

35.0.131 UGCNET-Dec2019-II: 98 https://gateoverflow.in/360735

An organization needs to maintain database having five attributes A, B, C, D, E. These attributes are functionally
dependent on each other for which functionality dependency set F is given as:
F : {A → BC, D → E, BC → D, A → D} . Consider a universal relation R(A, B, C, D, E) with functional
dependency set F. Also all attributes are simple and take atomic values only.
Identify the normal form in which relation R belong to

A. 1 NF B. 2 NF C. 3 NF D. BCNF
ugcnetdec2019ii

35.0.132 UGCNET-Dec2019-II: 96 https://gateoverflow.in/360737

An organization needs to maintain database having five attributes A, B, C, D, E. These attributes are functionally
dependent on each other for which functionality dependency set F is given as:
F : {A → BC, D → E, BC → D, A → D} . Consider a universal relation R(A, B, C, D, E) with functional
dependency set F. Also all attributes are simple and take atomic values only.
MInimal cover F′ of functional dependency set F is

A. F′ = {A → B, A → C, BC → D, D → E}
B. F′ = {A → BC, B → D, D → E}
C. F′ = {A → B, A → C, A → D, D → E}
D. F′ = {A → B, A → C, B → D, C → D, D → E}
 ugcnetdec2019ii

35.0.133 UGCNET-Dec2019-I: 25 https://gateoverflow.in/360708

According to classical Indian school of logic, what is the correct sequence of steps involved in Anum ā¯¯na (influence)?

A. Upanaya, Pratijn ~ a, Hetu, Ud ā¯¯harana, Nigmana

B. ~
Pratijna, Hetu, Upanaya, Ud ā¯¯harana, Nigmana
C. ~ a, Upanaya, Hetu, Ud ā¯¯harana, Nigmana
Pratijn
D. ~ a, Hetu, Ud ā¯¯harana, Upanaya, Nigmana
Pratijn

ugcnetdec2019i

35.0.134 UGCNET-Dec2019-II: 95 https://gateoverflow.in/360738

A flow graph F with entry node (1) and exit node (11) is shown below:

How many predicate nodes are there and what are their names?
A. Three: (1, (2, 3), 6) B. Three: (1, 4, 6)
C. Four: ((2, 3), 6, 10, 11) D. Four: ((2, 3), 6, 9, 10)
ugcnetdec2019ii

35.0.135 UGCNET-Dec2019-II: 94 https://gateoverflow.in/360739

A flow graph F with entry node (1) and exit node (11) is shown below:

How many nodes are there in the longest independent path?

A. 6 B. 7 C. 8 D. 9
ugcnetdec2019ii

35.0.136 UGCNET-Dec2019-II: 93 https://gateoverflow.in/360740

A flow graph F with entry node (1) and exit node (11) is shown below:

How many regions are there in flowgraph F ?

 A. 2 B. 3 C. 4 D. 5
ugcnetdec2019ii

35.0.137 UGCNET-Dec2019-I: 11 https://gateoverflow.in/360722

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
ugcnetdec2019i

35.0.138 UGCNET-Dec2019-I: 13 https://gateoverflow.in/360720

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
ugcnetdec2019i

35.0.139 UGCNET-Dec2019-I: 34 https://gateoverflow.in/360699

PCI stands for

A. Partial Component Interconnect B. Partial Component Interaction
C. Peripheral Component Interconnect D. Peripheral Component Interaction
ugcnetdec2019i

35.0.140 UGCNET-Dec2013-II: 23 https://gateoverflow.in/60079

______ is often used to prove the correctness of a recursive function.

A. Diagnolization B. Communitivity
C. Mathematical Induction D. Matrix Manipulation
ugcnetdec2013ii

35.0.141 UGCNET-Dec2013-III: 20 https://gateoverflow.in/60412

Match the following control strategies of protocol :

List – I List – II
a. Forward movement i. Variable can be done with a constant,
another variable or a function
b. Unification ii. The entire conjunctive goal is executed
c. Deep back-tracking iii. Previous sub goal to find alternative
solutions
d. Shallow back-tracking iv. Chooses sub goal with possible unifier
Codes :
A. a-iv, b-i, c-ii, d-iii B. a-ii, b-iv, c-i, d-iii
C. a-iii, b-i, c-iv, d-ii D. a-ii, b-iii, c-iv, d-i
ugcnetdec2013iii

35.0.142 UGCNET-Dec2019-I: 41 https://gateoverflow.in/360691

Database WOS stands for

A. Web of Science B. Web of Sources
C. World of Science D. Web of Service
ugcnetdec2019i

35.0.143 UGCNET-DEC2016-III: 3 https://gateoverflow.in/113756

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
ugcnetdec2016iii

35.0.144 UGCNET-DEC2016-III: 65 https://gateoverflow.in/114289

A t-error correcting q-nary linear code must satisfy:

M Σti=0 ( ) (q − 1)i ≤ X
n
I
Where M is the number of code words and X is

A. q n B. q t C. q −n D. q −t
ugcnetdec2016iii

35.0.145 UGCNET-DEC2016-III: 64 https://gateoverflow.in/114287

Let C be a binary linear code with minimum distance 2t+1 then it can correct upto ___ bits of error

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

ugcnetdec2016iii

35.0.146 UGCNET-DEC2016-III: 63 https://gateoverflow.in/114286

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

ugcnetdec2016iii

35.0.147 UGCNET-DEC2016-III: 62 https://gateoverflow.in/114284

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

ugcnetdec2016iii

35.0.148 UGCNET-DEC2016-III: 61 https://gateoverflow.in/114283

Given the following two statements:

L = {w ∣ na (w) = nb (w)} is deterministic context free language, but not linear.
L = {an bn } ∪ {an b2n } 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
ugcnetdec2016iii
35.0.149 UGCNET-DEC2016-III: 60 https://gateoverflow.in/114281

The fist logic order (FOL) statement ((R ∨ Q) ∧ (P ∨ ¬Q)) is equivalent to which of the following?

A. ((R ∨ ¬Q) ∧ (P ∨ ¬Q) ∧ (R ∨ P ))

B. ((R ∨ Q) ∧ (P ∨ ¬Q) ∧ (R ∨ P ))
C. ((R ∨ Q) ∧ (P ∨ ¬Q) ∧ (R ∨ ¬P ))
D. ((R ∨ Q) ∧ (P ∨ ¬Q) ∧ (¬R ∨ P ))

ugcnetdec2016iii

35.0.150 UGCNET-DEC2016-III: 68 https://gateoverflow.in/114299

With respect to a loop in the transportation table, which one of the following is not correct?

A. Every loop has an odd no. of cells and at least 5

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 at least four

ugcnetdec2016iii

35.0.151 UGCNET-DEC2016-II: 26 https://gateoverflow.in/115847

Match the following Layers and Protocols for a user browsing with SSL :
a. Application layer i. TCP
b, Transport layer ii. IP
c. Network layer iii. PPP
d. Datalink layer iv. HTTP
Codes :
A. a-iv; b-i; c-ii; d-iii B. a-iii; b-ii; c-i; d-iv
C. a-ii; b-iii; c-iv; d-i D. a-iii; b-i; c-iv; d-ii
ugcnetdec2016ii

35.0.152 UGCNET-DEC2016-III: 33 https://gateoverflow.in/113819

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. O(1) B. O( lg n) C. O(n) D. O(n lg n)

ugcnetdec2016iii

35.0.153 UGCNET-DEC2016-III: 31 https://gateoverflow.in/113816

The asymptotic upper bound solution of the recurrence relation given by T(n) = 2T (( n2 ))+ lgnnis

A. O(n2 ) B. O(n lg n)
C. O(n lg lg n) D. O(lg lg n)
ugcnetdec2016iii

35.0.154 UGCNET-DEC2016-III: 7 https://gateoverflow.in/113764

Consider the following schedules involving two transactions:

S1 : r1 (X); r1 (Y ), r2 (X); r2 (Y ); w2 (Y ); w1 (X)
S2 : r1 (X); r2 (X); r2 (Y ); w2 (Y ); r1 (Y ); w1 (X)
Which of the following statement is true?

A. Both S1 and S2 are conflict serializable

B. S1 is conflict serializable and S2 is not conflict serializable
C. S1 is not conflict serializable and S2 is conflict serializable
D. Both S1 and S2 are not conflict serializable
 ugcnetdec2016iii

35.0.155 UGCNET-DEC2016-III: 6 https://gateoverflow.in/113763

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

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

ugcnetdec2016iii

35.0.156 UGCNET-DEC2016-III: 5 https://gateoverflow.in/113761

In 8085 microprocessor, the digit 5 indicates that the microprocessor needs

A. -5 volts, +5 volts supply B. +5 volts supply only
C. -5 volts supply only D. 5 MHz clock
ugcnetdec2016iii

35.0.157 UGCNET-DEC2016-III: 4 https://gateoverflow.in/113760

Match the following :

Addressing mode Location of operand
a. Implied i. Registers which are in CPU
b. Immediate ii. Register specifies the address of the operand
c. Register iii. Specified in the register
d. Register indirect iv. Specified implicitly in the definition of the
instruction
Codes :
A. a-iv; b-iii; c-i; d-ii B. a-iv; b-i; c-iii; d-ii
C. a-iv; b-ii; c-i; d-iii D. a-iv; b-iii; c-ii; d-i
ugcnetdec2016iii

35.0.158 UGCNET-DEC2016-III: 2 https://gateoverflow.in/113754

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
ugcnetdec2016iii

35.0.159 UGCNET-DEC2016-III: 67 https://gateoverflow.in/114293

From the given data below:

abbaabbaab
Which one of the following is not a word in the dictionary created by LZ-coding (the initial words are a, b)?

A. a b B. b b C. b a D. b a a b
ugcnetdec2016iii

35.0.160 UGCNET-DEC2016-II: 43 https://gateoverflow.in/113185

Which of the following statement(s) is/are true with respect to software architecture?
S1: Coupling is a measure of how well the things grouped together in a module belong together logically.
S2: Cohesion is a measure of the degree of interaction between software modules.
S3: If coupling is low and cohesion is high then it is easier to change one module without affecting others.

A. Only S1 and S2 B. Only S3 C. All of S1, S2 and S3 D. Only S1

ugcnetdec2016ii
35.0.161 UGCNET-DEC2016-III: 9 https://gateoverflow.in/113770

Let pk(R) denotes primary key of the relation R. A many to one relationship that exists between two relations R1 and
R2 can be expressed as follows:
A. pk(R2 ) → pk(R1 ) B. pk(R1 ) → pk(R2 )
C. pk(R2 ) → R1 ∩ R2 D. pk(R1 ) → R1 ∩ R2
ugcnetdec2016iii

35.0.162 UGCNET-DEC2016-III: 32 https://gateoverflow.in/113818

Any decision tree that sorts n elements has height ____

A. Ω(lg n) B. Ω(n)
C. Ω(n lg n) D. Ω(n2 )
ugcnetdec2016iii

35.0.163 UGCNET-DEC2016-II: 48 https://gateoverflow.in/113190

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
ugcnetdec2016ii

35.0.164 UGCNET-DEC2016-II: 40 https://gateoverflow.in/113182

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

ugcnetdec2016ii

35.0.165 UGCNET-DEC2016-II: 41 https://gateoverflow.in/113183

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

ugcnetdec2016ii

35.0.166 UGCNET-DEC2016-II: 42 https://gateoverflow.in/113184

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. Adaptability to new environments
C. Operational characteristics D. Production costs and scheduling
ugcnetdec2016ii

35.0.167 UGCNET-DEC2016-II: 44 https://gateoverflow.in/113186

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.

ugcnetdec2016ii
35.0.168 UGCNET-DEC2016-III: 1 https://gateoverflow.in/113752

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
ugcnetdec2016iii

35.0.169 UGCNET-DEC2016-II: 45 https://gateoverflow.in/113187

A software design pattern used to enhance the functionality of an object at run-time is:

A. Adapter B. Decorator C. Delegation D. Proxy

ugcnetdec2016ii

35.0.170 UGCNET-DEC2016-II: 46 https://gateoverflow.in/113188

Match the following :

List-I List-II
a. Affiliate i.
Vendors ask partners to place logos on
marketing partner’s site. If customers click, come
to vendors and buy.
b. Viral ii. Spread your brand on the net by word-
marketing of-mouth.Receivers will send your
information to their friends.
c. Group iii. Aggregating the demands of small buyers
purchasing to get a large volume. Then negotiate a price.
d. Bartering iv. Exchanging surplus products and services with
online the process administered completely online by
an intermediary
Codes :
A. a-i; b-ii; c-iii; d-iv B. a-iii; b-ii; c-iv; d-i
C. a-ii; b-iii; c-iv; d-i D. a-ii; b-iii; c-i; d-iv
ugcnetdec2016ii

35.0.171 UGCNET-DEC2016-II: 47 https://gateoverflow.in/113189

_______ refers loosely to the process of semi-automatically analysing large databases to find useful patterns.

A. Datamining B. Data Warehousing C. DBMS D. Data mirroring

ugcnetdec2016ii

35.0.172 UGCNET-DEC2016-II: 49 https://gateoverflow.in/113191

In 3G network, W-CDMA is also known as UMTS. The minimum spectrum allocation required for W-CDMA is

A. 2 MHz B. 20 KHz C. 5 KHz D. 5 MHz

ugcnetdec2016ii

35.0.173 UGCNET-DEC2016-III: 8 https://gateoverflow.in/113766

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
 ugcnetdec2016iii

35.0.174 UGCNET-DEC2016-II: 50 https://gateoverflow.in/113192

Which of the following statements is/are true w.r.t. Enterprise Resource Planning (ERP)?
a. ERP automates and integrates majority of business processes. b. ERP provides access to information in a Real Time Environment.
c. ERP is inexpensive to implement.
A. a, b and c are false. B. a and b false; c true.
C. a and b true; c false D. a true; b and c are false
ugcnetdec2016ii

35.0.175 UGCNET-DEC2016-III: 66 https://gateoverflow.in/114291

Names of the some of the operating systems are given below:

a. MS-DOS b. XENIX c. OS/2 In the above list, following operating systems did
not provide multiuser facility

A. a only B. a and b only C. b and c only D. a, b, and c

ugcnetdec2016iii

35.0.176 UGCNET-DEC2016-III: 69 https://gateoverflow.in/114302

At which of the following stage(s), the degeneracy do not occur in transportation problem? (m, n represents number of
sources and destinations respectively).

a. While the values of dualb.variables

While obtaining
ui and vjancannot
initial
c.be
solution,
Atcomputed.
any stage
we may
while
have
moving
less
d. At
than
towards
a stage
m+noptimal
-1
when
allocations
the
solution,
no. of +ve
whenallocation
two or more
is exactly
occupied
m+n-1.
cells with t

A. a, b and c B. a, c and d C. a and d D. a, b, c and d

ugcnetdec2016iii

35.0.177 UGCNET-DEC2016-III: 30 https://gateoverflow.in/113814

A node X on a 10 Mbps network is regulated by a token bucket. The token bucket is filled at a rate of 2 Mbps. Token
bucket is initially filled with 16 megabits. The maximum duration taken by X to transmit at full rate of 10 Mbps is
______ secs.

A. 1 B. 2 C. 3 D. 4
ugcnetdec2016iii

35.0.178 UGCNET-DEC2016-III: 40 https://gateoverflow.in/113835

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

ugcnetdec2016iii

35.0.179 UGCNET-DEC2016-III: 55 https://gateoverflow.in/114269

Consider the following two rules R1 and R2 in logical reasoning in Artificial Intelligence (AI):
R1 : From α ⊃ β
and α is known as Modus Tollens (MT)
Inter β
R2 : From α ⊃ β
and ¬β
Inter ¬α
is known as Modus Ponens (MP)
A. Only R1 is correct B. Only R2 is correct
C. Both R1 and R2 are correct D. Neither R1 nor R2 is correct
ugcnetdec2016iii
35.0.180 UGCNET-DEC2016-III: 54 https://gateoverflow.in/114266

Which statement is not correct about “init” process in Unix?

A. It is generally the parent of the login shell

B. It has PID 1
C. It is the first process in the system
D. Init forks and execs a ‘getty’ process at every port connected to a terminal

ugcnetdec2016iii

35.0.181 UGCNET-DEC2016-III: 53 https://gateoverflow.in/113873

One of the disadvantages of user level threads compared to Kernel level threads 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 does not require kernel mode privileges
D. The library procedures invoked for thread management in user level threads are local procedures

ugcnetdec2016iii

35.0.182 UGCNET-DEC2016-III: 52 https://gateoverflow.in/113870

Some of the criteria for calculation of priority of a process are:

a. Processor utilization byb.an Weight

individual
assigned
process
to a user
c. or
Processor
group ofutilization
users In fair
by a user share
or group scheduler, priority is calculated
of processes
based on:

A. only a and b B. only a and c C. a, b and c D. only b and c

ugcnetdec2016iii

35.0.183 UGCNET-DEC2016-III: 51 https://gateoverflow.in/113867

Match the following for Unix file system :

List-I List-II
a. Boot block
i. Information about file system, free block list,
free inode list etc
b. Super block ii. Contains operating system files as well as
program and data files created by the users
c. Inode block iii. Contains boot program and partition table
d. Data block iv. Contains a table for every file in the system,
Attributes of these files are stored here
Codes :
A. a-iii, b-i, c-ii, d-iv B. a-iii, b-i, c-iv, d-ii
C. a-iv, b-iii, c-ii, d-i D. a-iv, b-iii, c-i, d-ii
ugcnetdec2016iii

35.0.184 UGCNET-DEC2016-III: 50 https://gateoverflow.in/113864

Consider a disk queue with I/O requests on the following cylinders in their arriving order:
6, 10, 12, 54, 97, 73, 128, 15, 44, 110, 34, 45
The disk head is assumed to be at cylinder 23 and moving in the direction of decreasing number of cylinders. Total number of
cylinders in the disk is 150. The disk head movement using SCAN-scheduling algorithm is:

A. 172 B. 173 C. 227 D. 228

ugcnetdec2016iii
35.0.185 UGCNET-DEC2016-III: 49 https://gateoverflow.in/113862

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

ugcnetdec2016iii

35.0.186 UGCNET-DEC2016-III: 48 https://gateoverflow.in/113860

A software company needs to develop a project that is estimated as 1000 function points and is planning to use JAVA
as the programming language whose approximate lines of code per function point is accepted as 50. Considering a=1.4
as multiplicative factor, b=1.0 as exponention factor for the basic COCOMO effort equation and c=3.0 as multiplicative factor,
d=0.33 as exponention factor for the basic COCOMO duration equation, approximately how long does the project take to
complete?

A. 11.2 months B. 12.2 months C. 13.2 months D. 10.2 months

ugcnetdec2016iii

35.0.187 UGCNET-DEC2016-III: 47 https://gateoverflow.in/113857

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 :
List-I List-II
I. Determining whether you have built A. Software testing
the right system is called ______
II. Determining whether you have built B. Software verification
the system right is called ______
III. ______ is the process of demostrating C. Software debuggingthe existence of defects
IV. _______ is the process of discovering the D. Software validation
cause of a defect and fixing it
Codes :
A. I-B, II-D, III-A, IV-C B. I-B, II-D, III-C, IV-A
C. I-D, II-B, III-C, IV-A D. I-D, II-B, III-A, IV-C
ugcnetdec2016iii

35.0.188 UGCNET-DEC2016-III: 56 https://gateoverflow.in/114271

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
ugcnetdec2016iii

35.0.189 UGCNET-DEC2016-III: 46 https://gateoverflow.in/113847

A software project was estimated at 352 Function Points (FP). 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 Rs. 80, 000 per month, the
programmer 60,000 per month and the tester 50, 000 per month. The average productivity of the team is 8 FP per person
month. Which of the following represents the projected cost of the project?
A. Rs. 28, 16, 000 B. Rs. 20, 90, 000
C. Rs. 26, 95, 000 D. Rs. 27, 50, 000
ugcnetdec2016iii
35.0.190 UGCNET-DEC2016-III: 43 https://gateoverflow.in/113841

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

ugcnetdec2016iii

35.0.191 UGCNET-DEC2016-III: 42 https://gateoverflow.in/113840

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 within 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
ugcnetdec2016iii

35.0.192 UGCNET-DEC2016-III: 41 https://gateoverflow.in/113839

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>

ugcnetdec2016iii

35.0.193 UGCNET-DEC2016-III: 38 https://gateoverflow.in/113832

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

ugcnetdec2016iii

35.0.194 UGCNET-DEC2016-III: 58 https://gateoverflow.in/114275

What is the best method to go for the game playing problem?

A. Optional Search B. Random Search
C. Heuristic Search D. Satisfied Search
ugcnetdec2016iii

35.0.195 UGCNET-DEC2016-II: 20 https://gateoverflow.in/115622

The order of a leaf node in a B+ tree is the maximum number of children it can have. Suppose that block size is 1
kilobytes, the child pointer takes 7 bytes long and search field value takes 14 bytes long. The order of the leaf node is
_________
 A. 16 B. 63 C. 64 D. 65
ugcnetdec2016ii

35.0.196 UGCNET-DEC2016-III: 70 https://gateoverflow.in/114312

Consider the following LPP:

Min. Z = x1 + x2 + x3
Subject to 3x1 + 4x3 ≤ 5
5x1 + x2 + 6x3 = 7
8x1 + 9x3 ≥ 2,
x1 , x2 , x3 ≥ 0
The standard form of this LPP shall be:

Min. Z = x1 + x2 + x3 + 0x4 + 0x5

Subject to 3x1 + 4x3 + x4 = 5;
A. 5x1 + x2 + 6x3 = 7;
8x1 + 9x3 − x5 = 2;
x1 , x2 , x3 x4 , x5 ≥ 0
Min. Z = x1 + x2 + x3 + 0x4 + 0x5 − 1(x6 ) − 1(x7 )
Subject to 3x1 + 4x3 + x4 = 5;
B. 5x1 + x2 + 6x3 + x6 = 7;
8x1 + 9x3 − x5 + x7 = 2;
x1 to x7 ≥ 0
Min. Z = x1 + x2 + x3 + 0x4 + 0x5 + 0x6
Subject to 3x1 + 4x3 + x4 = 5;
C. 5x1 + x2 + 6x3 = 7;
8x1 + 9x3 − x5 + x6 = 2;
x1 to x6 ≥ 0
Min. Z = x1 + x2 + x3 + 0x4 + 0x5 + 0x6 + 0x7
Subject to 3x1 + 4x3 + x4 = 5;
D. 5x1 + x2 + 6x3 + x6 = 7;
8x1 + 9x3 − x5 + x7 = 2;
x1 to x7 ≥ 0

ugcnetdec2016iii

35.0.197 UGCNET-DEC2016-III: 71 https://gateoverflow.in/114404

Let R and S be two fuzzy relations defined as:

Then, the resulting relaiton T, which relates elements of universe x to the elements of universe z using max-min composition is
given by:

A. B. C. D.

ugcnetdec2016iii

35.0.198 UGCNET-DEC2016-III: 72 https://gateoverflow.in/114407

T
A neuron with inputs has the weight vector [ 0.2 −0.1 0.1 ] and a bias θ = 0 . If the input vector is
T
X=
X = [ 0.2 0.4 0.2 ] T . Then the total input to the neuron is:

A. 0.20 B. 1.0 C. 0.02 D. -1.0

ugcnetdec2016iii

35.0.199 UGCNET-DEC2016-III: 75 https://gateoverflow.in/114418

Match the following vi commands in Unix :

List-I List-II
a. :w i. saves the file and quits editing mode
b. :x ii. escapes unix shell
c. :q iii. saves file and remains in editing mode
d. :sh iv. quits editing mode and no change are
saved to the file
Codes :
A. a-ii; b-iii; c-i; d-iv B. a-iv; b-iii; c-ii; d-i
C. a-iii; b-iv; c-i; d-ii D. a-iii; b-i; c-iv; d-ii
ugcnetdec2016iii

35.0.200 UGCNET-DEC2016-II: 17 https://gateoverflow.in/115619

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?

1. An instructor Id. No. cannot be null, provided Instructor Id. No. being the primary key.
2. No two citizens have same Adhar-Id.
3. The budget of a company must be zero.

A. 1, 2 and 3 are true B. 1 - false; 2 and 3 are true

C. 1 and 2 are true; 3-false D. 1, 2 and 3 are false
ugcnetdec2016ii

35.0.201 UGCNET-DEC2016-II: 18 https://gateoverflow.in/115620

Let M and N be two entities in an E-R diagram with simple single vale attributes. R1 and R2 are two relationships
between M and N, whereas R1 is one-to-many and R2 is many-to-many. The minimum number of tables required to
represent M, N, R1 and R2 in the relational model are _______

A. 4 B. 6 C. 7 D. 3
ugcnetdec2016ii

35.0.202 UGCNET-DEC2016-II: 21 https://gateoverflow.in/115840

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

A. Insertion-O(1), Deletion-O(1), Maximum-O(1), Minimum-O(1)

B. Insertion-O(1), Deletion-O(1), Maximum-O(n), Minimum-O(n)
C. Insertion-O(n), Deletion-O(n), Maximum-O(1), Minimum-O(1)
D. Insertion-O(n), Deletion-O(n), Maximum-O(n), Minimum-O(n)

ugcnetdec2016ii

35.0.203 UGCNET-DEC2016-III: 37 https://gateoverflow.in/113827

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. Bith I and II are correct
C. Only II is correct D. Only I is correct
ugcnetdec2016iii

35.0.204 UGCNET-DEC2016-III: 59 https://gateoverflow.in/114279

Which of the following statements is true?

A. The sentence S is a logical consequence of S1 , … , Sn if and only if S1 ∧ S2 ∧ ⋯ ∧ Sn → S is satisfiable.

B. The sentence S is a logical consequence of S1 , … , Sn if and only if S1 ∧ S2 ∧ ⋯ ∧ Sn → S is valid.
C. The sentence S is a logical consequence of S1 , … , Sn if and only if S1 ∧ S2 ∧ ⋯ ∧ Sn → ¬S is consistent.
D. The sentence S is a logical consequence of S1 , … , Sn if and only if S1 ∧ S2 ∧ ⋯ ∧ Sn → S is inconsistent.

ugcnetdec2016iii

35.0.205 UGCNET-DEC2016-III: 57 https://gateoverflow.in/114272

In Artificial Intelligence (AI), what is present in the planning graph?

A. Sequence of levels B. Literals
C. Variables D. Heuristic estimates
ugcnetdec2016iii

35.0.206 UGCNET-DEC2016-III: 34 https://gateoverflow.in/113820

The minimum number of scalar multiplication required, for parenthesization of a matrix-chain product whose sequence
of dimensions for four matrices is <5, 10, 3, 12, 5> is

A. 630 B. 580 C. 480 D. 405

ugcnetdec2016iii

35.0.207 UGCNET-DEC2016-III: 44 https://gateoverflow.in/113843

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

ugcnetdec2016iii

35.0.208 UGCNET-DEC2016-III: 35 https://gateoverflow.in/113821

Dijkstra’s algorithm is based on

A. Divide and conquer paradigm B. Dynamic programming
C. Greedy approach D. Backtracking paradigm
ugcnetdec2016iii

35.0.209 UGCNET-DEC2016-III: 36 https://gateoverflow.in/113824

Match the following :

List-I list-II
a. Merge sort i. Dynamic programming
b. Huffman coding ii. Greedy approach
c. Optimal polygon iii. Divide and conquer
Triangulation
d. Subset sum iv. Backtracking
Problem
Codes :
A. a-iii, b-i, c-ii, d-iv B. a-ii, b-i, c-iv, d-iii
C. a-ii, b-i, c-iii, d-iv D. a-iii, b-ii, c-i, d-iv
 ugcnetdec2016iii

35.0.210 UGCNET-DEC2016-III: 11 https://gateoverflow.in/113774

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 employees of all the companies
C. Find all employees who earn more than the average salary of all employees of all the companies
D. Find all employees who earn more than the average salary of all employees of their company

ugcnetdec2016iii

35.0.211 UGCNET-DEC2016-III: 29 https://gateoverflow.in/113813

In RSA public key cryptosystem suppose n = p ∗ q wher p and q are primes. (e, n) and (d, n) are public and private
keys respectively. Let M be an integer such that o < M < n and ϕ(n) = (p − 1)(q − 1). Which one of the
following equations represent RSA public key cryptosystem?

I. C ≡ M e (mod n); M ≡ (C )d (mod n)

II. ed ≡ 1(mod n)
III. ed ≡ 1(mod ϕ(n))
IV. C ≡ M e (mod ϕ(n)); M ≡ C d (mod ϕ(n))

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

ugcnetdec2016iii

35.0.212 UGCNET-Dec2014-III: 21 https://gateoverflow.in/60428

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.

ugcnetdec2014iii

35.0.213 UGCNET-Nov2017-III: 72 https://gateoverflow.in/221904

The Sigmoid activation function f(t) is defined as :

35.0.214 UGCNET-June2005-II: 50 https://gateoverflow.in/335413

Another name of IEEE 802.11a is :

A. W ECA B. Fast Ethernet C. Wi-Fi 5 D. 802 − 11g

 ugcnetjune2005ii

35.0.215 UGCNET-Jan2017-III: 58 https://gateoverflow.in/335180

What is the best method to go for the game playing problem?

A. Optimal Search B. Random Search
C. Heuristic Search D. Stratified Search
ugcnetjan2017iii non-gate

35.0.216 UGCNET-Dec2004-II: 5 https://gateoverflow.in/335392

If Im denotes the set of integers modulo m, then the following are fields with respect to the operations of addition
modulo m and multiplication modulo m :

i. Z23
ii. Z29
iii. Z31
iv. Z33
A. (i) only B. (i) and (ii) only
C. (i), (ii) and (iii) only D. (i), (ii), (iii) and (iv)
ugcnetdec2004ii

35.0.217 UGCNET-Dec2004-II: 7 https://gateoverflow.in/335390

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
ugcnetdec2004ii

35.0.218 UGCNET-Dec2004-II: 8 https://gateoverflow.in/335389

An example of a connective which is not associative is :

A. AND B. OR C. EX-OR D. NAND

ugcnetdec2004ii

35.0.219 UGCNET-Dec2004-II: 9 https://gateoverflow.in/335388

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

ugcnetdec2004ii

35.0.220 UGCNET-Jan2017-III: 13 https://gateoverflow.in/335225

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

ugcnetjan2017iii non-gate

35.0.221 UGCNET-Jan2017-III: 14 https://gateoverflow.in/335224

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
ugcnetjan2017iii non-gate

35.0.222 UGCNET-Jan2017-III: 15 https://gateoverflow.in/335223

Match the following :

List-I List-II
a. Glass i.
Contains liquid crystal and serves as a bonding
surface for a conductive coating
b. Conductive coating ii. Acts as a conductor so that a voltage can be
applied across the liquid crystal
c. Liquid crystal iii. A substance which will polarize light when a
voltage is applied to it
d. Polarized film iv. A transparent sheet that polarizes light
Codes :
A. a-i, b-ii, c-iii, d-iv B. a-i, b-iii, c-ii, d-iv
C. a-iv, b-iii, c-ii, d-i D. a-iv, b-ii, c-i, d-iii
ugcnetjan2017iii non-gate

35.0.223 UGCNET-Jan2017-III: 55 https://gateoverflow.in/335183

Consider following two rules R 1 and R2 in logical reasoning in Artificial Intelligence (AI):
R1: From α ⊃ β Interβ
andα is known as Modulus Tollens (MT)

and¬β
R2:From α ⊃ β Inter¬α is known as Modus Ponens(MP)

A. Only R1 is correct. B. Only R2 is correct.

C. Both R1 and R2 are correct. D. Neither R1 nor R2 is correct.

ugcnetjan2017iii non-gate

35.0.224 UGCNET-Jan2017-III: 56 https://gateoverflow.in/335182

Consider the following AO graph:

Which is the best node to expand next by AO* algorithm?

A. A B. B
C. C D. B and C
ugcnetjan2017iii non-gate

35.0.225 UGCNET-Dec2004-II: 6 https://gateoverflow.in/335391

An example of a binary number which is equal to its 2’s complement is :

A. 1100 B. 1001 C. 1000 D. 1111

ugcnetdec2004ii
35.0.226 UGCNET-DEC2016-II: 30 https://gateoverflow.in/115851

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
ugcnetdec2016ii

35.0.227 UGCNET-NOV2017-III: 69 https://gateoverflow.in/221907

Consider the following LPP :

Min Z=2x1+x2+3x3
Subject to :
x1−2x2+x3 ≥ 4
2x1+x2+x3 ≤8
x1−x3 ≥ 0
x1, x 2, x 3 ≥ 0
The solution of this LPP using Dual Simplex Method is :
(1) x1=0, x2=0, x3=3 and Z=9 (2) x 1=0, x2=6, x3=0 and Z=6
(3) x1=4, x2=0, x3=0 and Z=8 (4) x 1=2, x2=0, x3=2 and Z=10

35.0.228 UGCNET-Nov2017-III: 75 https://gateoverflow.in/221900

Match the following WINDOWS system calls and UNIX system calls with reference to process control and File
manipulation.
Windows UNIX
(a) Create – process() (i) Open()
(b) WaitForSingleObject() (ii) Close()
(c) CreateFile() (iii) Fork()
(d) CloseHandle() (iv) Wait()
Code :
A. (a)-(iii), (b)-(iv), (c)-(i), (d)-(ii) B. (a)-(iv), (b)-(iii), (c)-(i), (d)-(ii)
C. (a)-(iv), (b)-(iii), (c)-(ii), (d)-(i) D. (a)-(iii), (b)-(iv), (c)-(ii), (d)-(i)

35.0.229 UGCNET-June2005-II: 48 https://gateoverflow.in/335415

Which interim standard describes inter-switching networking ?

A. IS − 54 B. IS − 95 C. DS − 45 D. ANSI − 41
ugcnetjune2005ii

35.0.230 UGCNET-DEC2016-II: 35 https://gateoverflow.in/117898

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

ugcnetdec2016ii

35.0.231 UGCNET-Dec2013-III: 27 https://gateoverflow.in/60549

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

ugcnetdec2013iii
35.0.232 UGCNET-DEC2016-II: 28 https://gateoverflow.in/113170

A packet whose destination is outside the local TCP/IP network segment is sent to _______

A. File server B. DNS server C. DHCP server D. Default gateway

ugcnetdec2016ii

35.0.233 UGCNET-DEC2016-II: 34 https://gateoverflow.in/113176

The contents of Register (BL) and Register (AL) of 8085 microprocessor are 49H and 3AH respectively. The contents
of AL, the status of carry flag (CF) and sign flag (SF) after executing 'SUB AL, BL' assembly language instruction, are
A. AL=0FH; CF=1; SF=1 B. AL=F0H; CF=0; SF=0
C. AL=F1H; CF=1; SF=1 D. AL=1FH; CF=1; SF=1
ugcnetdec2016ii

35.0.234 UGCNET-June2005-II: 42 https://gateoverflow.in/335421

Which one of the following is not a software process model?

A. Linear sequential model B. Prototyping model
C. The spiral model D. COCOMO model
ugcnetjune2005ii

35.0.235 UGCNET-June-2019-I-20 https://gateoverflow.in/316159

Today’s media-society equation is largely

A. Mystical B. Morally bound
C. Consumer conscious D. Tradition centric
ugcnetjune2019-i

35.0.236 UGCNET-DEC2016-II: 33 https://gateoverflow.in/117896

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

ugcnetdec2016ii

35.0.237 UGCNET-Aug2016-III: 61 https://gateoverflow.in/137399

61. Consider the following linear programming problem :

Max. z = 0.50 x2 – 0.10x1 Subject to the constraints 2x1 + 5x2 < 80 x1 + x2 < 20 and x1 , x2 > 0

The total maximum profit (z) for the above problem is :

(1) 6

(2) 8

(3) 10

(4) 12

35.0.238 UGCNET-Nov2017-III: 16 https://gateoverflow.in/221897

Find the equation of the circle x 2+y2=1 in terms of x'y' coordinates, assuming that the xy coordinate system results
from a scaling of 3 units in the x' direction and 4 units in the y' direction.
(1) 3(x')2+4(y')2 = 1
( ) ( )
(2)( x3 )2 + ( 4 )2 = 1
′ y′

(3) (3x')2 + (4y') 2=1

(4) 1 (x')2 + 1 (y')2 =1
3 4

35.0.239 UGCNET-June2016-III: 66 https://gateoverflow.in/139992

66. A perceptron has input weights W1 = – 3.9 and W2 = 1.1 with threshold value T = 0.3. What output does it give for
the input x1 = 1.3 and x2 = 2.2 ?

(1) – 2.65

(2) – 2.30

(3) 0

(4) 1

35.0.240 UGCNET-june2009-ii-11 https://gateoverflow.in/154203

Assertion(A): Bit maps are not often used in memory management .

Reason(R): Searching a bitmap for a run of given length is a slow operation.

A. Both (A) and (R) are true and (R) is correct explanation for (A)
B. Both(A) and (R) are true but (R) is not correct explanation for (A)
C. (A) is true (R) is false
D. (A) is false (R) is true

ugcnetjune2009ii

35.0.241 UGCNET-june2009-ii-44 https://gateoverflow.in/154824

The spacing between character pairs is called :

A. Kerning B. x-height
C. intercap D. serif
ugcnetjune2009ii

35.0.242 UGCNET-dec2005-38 https://gateoverflow.in/156268

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

35.0.243 UGCNET-June-2019-I-48 https://gateoverflow.in/316131

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

ugcnetjune2019-i

35.0.244 UGCNET-Nov2017-III: 17 https://gateoverflow.in/221893

Find the normalization transformation that maps a window whose lower left corner is at (1, 1) and upper right corner is
at (3, 5) onto a viewport that is the entire normalized device screen.
35.0.245 UGCNET-June2005-II: 49 https://gateoverflow.in/335414

Theoretically, how many 1.25 MHz Carriers are there in a CDMA cell ?

A. 18 B. 22 C. 9 D. 64
ugcnetjune2005ii

35.0.246 UGCNET-June2005-II: 47 https://gateoverflow.in/335416

The frequency reuse plan is divided into cell grouping using how many cells, where the number of cells equals N ?

A. 3 B. 10 C. 7 D. 21
ugcnetjune2005ii

35.0.247 UGCNET-DEC2016-III: 28 https://gateoverflow.in/113810

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

ugcnetdec2016iii

35.0.248 UGCNET-DEC2016-III: 20 https://gateoverflow.in/113788

Consider the languages L1 = ϕ and L2 = {1} . Which one of the following represents L∗1 ∪ L∗2 L∗1 ?

A. {∈} B. {∈, 1} C. ϕ D. 1∗
ugcnetdec2016iii

35.0.249 UGCNET-DEC2016-III: 14 https://gateoverflow.in/113781

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. Planning and Zooming
C. Scaling and Shearing D. Translation, Rotation, Panning and Zooming
ugcnetdec2016iii

35.0.250 UGCNET-DEC2016-III: 15 https://gateoverflow.in/113782

Match the following :

a. Glass i.
Contains liquid crystal and serves as a bonding
surface for a conductive coding
b. Conductive ii. Act as a conductor so that a voltage can be
coating applied across the liquid crystal
c. Liquid crystal iii. A substance which will polarize light when a
voltage is applied to it
d. Polarized film iv. A transport sheet that polarizes light
Codes :
A. a-i, b-ii, c-iii, d-iv B. a-i, b-iii, c-ii, d-iv
C. a-iv, b-iii, c-ii, d-i D. a-iv, b-ii, c-i, d-iii
ugcnetdec2016iii

35.0.251 UGCNET-DEC2016-III: 16 https://gateoverflow.in/113783

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 d=3-2r (where r is radius) B. Stop if x > y
C. If d <0, then d=4x+6 and x=x+1 D. If d ≥ 0, then d=4*(x-y)+10, x=x+1 and y=y+1
ugcnetdec2016iii
35.0.252 UGCNET-DEC2016-III: 17 https://gateoverflow.in/113784

Which of the following is/are side effects of scan conversion?

a. Aliasing b. Unequal intensity of diagonal

c. Overstriking
lines in photographic
d. Local
applications
or Global aliasing

A. a and b B. a, b and c C. a, c and d D. a, b, c and d

ugcnetdec2016iii

35.0.253 UGCNET-DEC2016-III: 18 https://gateoverflow.in/113785

Consider a line AB with A=(0,0) and B=(8, 4). Apply a simple DDA algorithm and compute the first four plots on this
line.
A. [(0,0), (1,1), (2, 0), (3, 2)] B. [(0, 0), (1, 1.5), (2, 2), (3, 3)]
C. [(0, 0), (1, 1), (2, 2.5), (3, 3)] D. [(0, 0), (1, 2), (2, 2), (3, 2)]
ugcnetdec2016iii

35.0.254 UGCNET-DEC2016-III: 19 https://gateoverflow.in/113787

Which of the following are not regular?

a. Strings of even number b.

of a’s
Strings of a’s, whose length
c. Set
is of
a prime
all palindromes
number made
d. Strings
up of of
a’sa’s
andwhose
b’s length is a perfect square

A. a and b only B. a, b and c only C. b, c and d only D. b and d only

ugcnetdec2016iii

35.0.255 UGCNET-DEC2016-III: 22 https://gateoverflow.in/113794

Let G = (V , T, S, P ) be a context-free grammar such that every one of its production is of the form A → v , with
∣v ∣= K > 1 . The derivation tree for any W ∈ L(G) has a height h such that

A. logk ∣ W ∣≤ h ≤ logk ( )
∣W∣−1
K−1
B. logk ∣ W ∣≤ h ≤ logk (K ∣ W ∣)
C. logk ∣ W ∣≤ h ≤ K logk ∣ W∣
D. logk ∣ W ∣≤ h ≤( )
∣W∣−1
K−1

ugcnetdec2016iii

35.0.256 UGCNET-DEC2016-III: 21 https://gateoverflow.in/113790

Given the following statements:

1. A class of languages that is closed under union and complementation has to be closed under intersection
2. 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 1 and 2 are false B. Both 1 and 2 are true
C. 1 is true, 2 is false D. 1 is false, 2 is true
ugcnetdec2016iii

35.0.257 UGCNET-DEC2016-III: 10 https://gateoverflow.in/113772

For a database relation R(A,B,C,D) where the domains of A, B, C and D include only atomic values, only the following
functional dependencies and those that can be inferred from them are:
A→C
B→D
The relation R 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

ugcnetdec2016iii

35.0.258 UGCNET-DEC2016-III: 23 https://gateoverflow.in/113800

Given the following two languages:

L1 = {an bn ∣ n ≥ 0, n ≠ 100}
L2 = {w ∈ {a, b, c}∗ ∣ na (w) = nb (w) = nc (w)}
Which of the following options is correct?

A. Both L1 and L2 are not context free language

B. Both L1 and L2 are context free language
C. L1 is context free language, L2 is not context free language
D. L1 is not context free language, L2 is context free language

ugcnetdec2016iii

35.0.259 UGCNET-DEC2016-III: 24 https://gateoverflow.in/113801

A recursive function h, is defined as follows:

h(m) = k, if m = 0
= 1, if m = 1
= 2h(m − 1) + 4h(m − 2), if m ≥ 2
If the value of h(4) is 88 then the value of k is:

A. 0 B. 1 C. 2 D. -1
ugcnetdec2016iii

35.0.260 UGCNET-DEC2016-III: 25 https://gateoverflow.in/113805

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. nP(1 − P)n−1 B. nP C. P(1 − P)n−1 D. nP (1 − P )n−1

ugcnetdec2016iii

35.0.261 UGCNET-DEC2016-III: 26 https://gateoverflow.in/113807

Station A uses 32 byte packets to transmit messages to station B using sliding window protocol. The round trip delay
between A and B is 40 milliseconds and the bottleneck bandwidth on the path between A and B is 64 kbps. The optimal
window size of A is ______

A. 20 B. 10 C. 30 D. 40
ugcnetdec2016iii

35.0.262 UGCNET-DEC2016-III: 27 https://gateoverflow.in/113808

Let G(x) be generator polynomial used for CRC checking. The condition that should eb satisfied by G(x) to correct odd
numbered error bits, will be:
A. (1+x) is factor of G(x) B. (1-x) is factor of G(x)
C. (1+x2 ) is factor of G(x) D. x is factor of G(x)
ugcnetdec2016iii

35.0.263 UGCNET-DEC2016-III: 13 https://gateoverflow.in/113779

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 focussed into a narrow beam directed at the face of CRT
D. All of the above

ugcnetdec2016iii

35.0.264 UGCNET-DEC2016-II: 39 https://gateoverflow.in/113181

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

ugcnetdec2016ii

35.0.265 UGCNET-June2005-II: 46 https://gateoverflow.in/335417

P V M and MP I Library functions are implemented on the top of the :

A. Universal Message Passing (UMS) B. Network Interface Driver (NID)
C. Media Access Control (MAC) D. None of these
ugcnetjune2005ii

35.0.266 UGCNET-Jan2017-II: 46 https://gateoverflow.in/335117

Match the following :

List-I List-II
a. Affiliate Marketing i. Vendors ask partners to place logos on
partner’s site. If customers click, come to
vendors and buy.
b. Viral Marketing ii. Spread your brand on the net by
word-of-mouth. Receivers will send
your information to their friends.
c. Group Purchasing iii. Aggregating the demands of small buyers
to get a large volume. Then negotiate a price.
d. Bartering Online iv. Exchanging surplus products and services
with the process administered completely
online by an intermediary. Company receives
“points” for its contribution.

Codes :
A. a-i, b-ii, c-iii, d-iv B. a-i, b-iii, c-ii, d-iv
C. a-iii, b-ii, c-iv, d-i D. a-ii, b-iii, c-i, d-iv
ugcnetjan2017ii

35.0.267 UGCNET-June2005-II: 45 https://gateoverflow.in/335418

Which type of coupling is least preferred ?

A. Content coupling B. Data coupling
C. Control coupling D. Common coupling
ugcnetjune2005ii

35.0.268 UGCNET-June2005-II: 44 https://gateoverflow.in/335419

Which one is measure of software complexity ?

A. Number of lines of code (LOC) B. Number of man years
C. Number of function points (FP) D. All of the above
ugcnetjune2005ii
35.0.269 UGCNET-June2005-II: 43 https://gateoverflow.in/335420

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
ugcnetjune2005ii

35.0.270 UGCNET-Jan2017-III: 57 https://gateoverflow.in/335181

In Artificial Intelligence(AI), what is present in the planning graph?

A. Sequence of levels B. Literals
C. Variables D. Heuristic estimates
ugcnetjan2017iii non-gate

35.0.271 UGCNET-Jan2017-II: 50 https://gateoverflow.in/335113

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

35.0.272 UGCNET-Jan2017-III: 67 https://gateoverflow.in/335171

From the given data below:

abbaabbaab
which one of the following is not a word in the dictionary created by LZ-coding (the initial words are a,b)?

A. a b B. b b C. b a D. b a a b
ugcnetjan2017iii

35.0.273 UGCNET-Jan2017-II: 1 https://gateoverflow.in/335162

Consider a sequence F00 defined as :

F00 (0) = 1, F00 (1) = 1
10∗F00 (n−1)+100
F00 (n) = F00 (n−2)
for n ≥ 2
Then what shall be the set of values of the sequence F00 ?
A. (1, 110, 1200) B. (1, 110, 600, 1200)
C. (1, 2, 55, 110, 600, 1200) D. (1, 55, 110, 600, 1200)
ugcnetjan2017ii non-gate

35.0.274 UGCNET-DEC2016-II: 29 https://gateoverflow.in/115850

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
ugcnetdec2016ii
35.0.275 UGCNET-Jan2017-III: 75 https://gateoverflow.in/335163

Match the following ⅵcommands in Unix :

List-I List-II
a. :w i. saves the file and quits editing mode
b. :x ii. escapes unix shell
c. :q iii. saves file and remains in editing mode
d. :sh iv. quits editing mode and no change are
saved to the file
Codes :
A. a-ii, b-iii, c-i, d-iv B. a-iv, b-iii, c-ii, d-i
C. a-iii, b-iv, c-i, d-ii D. a-iii, b-i, c-iv, d-ii
ugcnetjan2017iii non-gate

35.0.276 UGCNET-Jan2017-III: 74 https://gateoverflow.in/335164

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 ]′

ugcnetjan2017iii non-gate

35.0.277 UGCNET-Jan2017-III: 73 https://gateoverflow.in/335165

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

ugcnetjan2017iii non-gate

35.0.278 UGCNET-Jan2017-III: 69 https://gateoverflow.in/335169

At which of the following stage(s), the degeneracy do not occur in transportation problem?
(m, n represents number of sources and destinations respectively)

a. While the values of dualb.variables

While obtaining
ui and vjancannot
initial
c.be
solution,
Atcomputed
any stage
we may
while
have
moving
less
d. At
than m +optimal
towards
a stage − 1 the
when
n no, of +
allocations
solution, when
ve allocation
two or more
is exactly m +cells
occupied n with
A. (a), (b) and (c) B. (a),(c) and (d) C. (a) and (d) D. (a),(b),(c) and (d)
ugcnetjan2017iii

35.0.279 UGCNET-Jan2017-III: 68 https://gateoverflow.in/335170

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 5.

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.

ugcnetjan2017iii
35.0.280 UGCNET-DEC2016-II: 31 https://gateoverflow.in/117894

Which of the following strings would match the regular expression: p +[3-5]*[xyz]?

I. p443y
II. p6y
III. 3xyz
IV. p35z
V. p353535x
VI. ppp5

A. I, III and Vl only B. IV, V and VI only C. II, IV and V only D. I, IV and V only
ugcnetdec2016ii

35.0.281 UGCNET-Dec2019-I: 40 https://gateoverflow.in/360692

The most important pollutants that cause degradation of water quality in rivers and streams are
a. Bacteria b. Nutrients
c. Metals d. Total dissolved solids
e. Algae Choose the most appropriate answer from the options given
below:
A. a, b and c B. a, b and d
C. a, b, d and e D. a, b, c, d and e
ugcnetdec2019i

35.0.282 UGCNET-June2005-II: 41 https://gateoverflow.in/335422

The capability maturity model (err) defines 5 levels :

(a) Level 1 (i) Managed

(b) Level 2 (ii) Defined
(c) Level 3 (iii) Repeatable
(d) Level 4 (iv) Initial
(e) Level 5 (v) Optimized

Correct matching is :

a b c d e
A (i) (ii) (iii) (iv) (v)
B (iv) (iii) (ii) (i) (v)
C (v) (i) (iii) (ii) (iv)
D (v) (ii) (i) (iii) (iv)
ugcnetjune2005ii

35.0.283 UGCNET-Dec2019-I: 42 https://gateoverflow.in/360690

The major barriers for access to higher education in India are:

a. more opportunities of employment for less educated b. government policies
c. language of instruction d. economic status
e. competition from foreign universities f. gender discrimination in society
Choose the correct answer from the options given below:
A. a, b and c B. b, c and e
C. c, d and f D. d, e and f
ugcnetdec2019i

35.0.284 UGCNET-June2005-II: 33 https://gateoverflow.in/335430

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
ugcnetjune2005ii

35.0.285 UGCNET-Dec2005-II: 24 https://gateoverflow.in/335484

The initial configuration of quaue is a, b, c, d. ′ a′ is at the front. To get the configuration d, c, b, a how many deletions
and additions required:
A. 2 deletions, 3 additions B. 3 deletions, 2 additions
C. 3 deletions, 4 additions D. 3 deletions, 3 additions
ugcnetdec2005ii

35.0.286 UGCNET-June2005-II: 30 https://gateoverflow.in/335433

What is the correct subnet mask to use for a class- B address to support 30 Networks and also have the most hosts
possible ?
A. 255.255.255.0 B. 255.255.192.0
C. 255.255.240.0 D. 255.255.248.0
ugcnetjune2005ii

35.0.287 UGCNET-June2005-II: 38 https://gateoverflow.in/335425

Banker's algorithm is for

A. Dead lock Prevention B. Dead lock Avoidance
C. Dead lock Detection D. Dead lock creation
ugcnetjune2005ii

35.0.288 UGCNET-June2005-II: 37 https://gateoverflow.in/335426

The principle of Locality of reference justifies the use of :

A. Virtual memory B. Interrupts
C. Cache memory D. Secondary memory
ugcnetjune2005ii

35.0.289 UGCNET-June2005-II: 36 https://gateoverflow.in/335427

Moving Process from main memory to disk is called :

A. Caching B. Termination C. Swapping D. Interruption

ugcnetjune2005ii

35.0.290 UGCNET-June2005-II: 35 https://gateoverflow.in/335428

Symbol Table can be used for :

A. Checking type compatibility B. Suppressing duplication of error message
C. Storage allocation D. All of these
ugcnetjune2005ii

35.0.291 UGCNET-June2005-II: 34 https://gateoverflow.in/335429

The dynamic binding occurs during the

A. Compile time B. Run time
C. Linking time D. Pre-processing time
ugcnetjune2005ii

35.0.292 UGCNET-June2005-II: 32 https://gateoverflow.in/335431

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

A. Regular B. Context – Sensitive
C. Context free D. None of these
ugcnetjune2005ii
35.0.293 UGCNET-June2005-II: 17 https://gateoverflow.in/335446

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
ugcnetjune2005ii

35.0.294 UGCNET-June2005-II: 31 https://gateoverflow.in/335432

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
ugcnetjune2005ii

35.0.295 UGCNET-June2005-II: 29 https://gateoverflow.in/335434

Which protocol is used to encapsulate a data pocket created of a higher OSI model layer ?

A. HDLC B. SDLC C. LAPB D. LAPD

ugcnetjune2005ii

35.0.296 UGCNET-June2005-II: 20 https://gateoverflow.in/335443

A WINDOW into a portion of a data base is :

A. Schema B. View C. Query D. Data Dictionary

ugcnetjune2005ii

35.0.297 UGCNET-June2005-II: 28 https://gateoverflow.in/335435

Which type of links are used for a connection between two DTE devices ?

A. X.21 B. Frame Relay C. AT M D. Modem

ugcnetjune2005ii

35.0.298 UGCNET-June2005-II: 27 https://gateoverflow.in/335436

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
ugcnetjune2005ii

35.0.299 UGCNET-June2005-II: 26 https://gateoverflow.in/335437

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 B. 1, 3, 5 C. 1, 3, 4, 5 D. 1, 2, 3, 4, 5
ugcnetjune2005ii

35.0.300 UGCNET-June2005-II: 25 https://gateoverflow.in/335438

The algorithm that will efficiently sort an array that is nearly sorted except for the interchange of some adjacent pairs of
numbers like {1, 3, 2, 5, 4, 6} is :

A. Quick sort B. Bubble sort C. Merge sort D. Selection sort

 ugcnetjune2005ii

35.0.301 UGCNET-June2005-II: 24 https://gateoverflow.in/335439

If the postfix form of a string is ABC+ – D∗ , the actual string is :

∗ ∗
A. (A − (B + C)) D B. ((A − B) + C) D
∗ ∗
C. ((A + B) − C) D D. (A + (B − C)) D
ugcnetjune2005ii

35.0.302 UGCNET-June2005-II: 19 https://gateoverflow.in/335444

Multi-valued dependency among attribute is checked at which level ?

A. 2 NF B. 3 NF C. 4 NF D. 5 NF
ugcnetjune2005ii

35.0.303 UGCNET-Dec2005-II: 26 https://gateoverflow.in/335482

The data unit in the TCP/IP application Layer is called a ____________ .

A. message B. segment C. datagram D. frame

ugcnetdec2005ii

35.0.304 UGCNET-June2005-II: 22 https://gateoverflow.in/335441

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 n − 1 edges D. A tree is a connected graph
ugcnetjune2005ii

35.0.305 UGCNET-June2005-II: 7 https://gateoverflow.in/335456

The logic expression x̄¯¯yz̄¯ + x̄¯¯yz + xyz̄¯ + xyz reduces to :

¯¯z
A. x̄ B. xyz C. y D. yz
ugcnetjune2005ii

35.0.306 UGCNET-June2007-II: 21 https://gateoverflow.in/335712

The time required to find the shortest path in a graph with n vertices and e edges is:

A. O(e) B. O(n) C. O(e2 ) D. O(n2 )

ugcnetjune2007ii

35.0.307 UGCNET-June2005-II: 5 https://gateoverflow.in/335458

Minimum number of individual shoes to be picked up from a dark room ( containing 10 pair of shoes) if we have to get
atleast one proper pair :

A. 2 B. 20 C. 11 D. None of these
ugcnetjune2005ii

35.0.308 UGCNET-June2005-II: 16 https://gateoverflow.in/335447

An Entity-relationship diagram is a tool to represent :

A. Data model B. Process model C. Event model D. Customer model

ugcnetjune2005ii
35.0.309 UGCNET-June2005-II: 14 https://gateoverflow.in/335449

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
ugcnetjune2005ii

35.0.310 UGCNET-June2005-II: 13 https://gateoverflow.in/335450

The data hiding is taken care by :

A. Abstraction B. Encapsulation C. Modularity D. Inheritance

ugcnetjune2005ii

35.0.311 UGCNET-June2005-II: 10 https://gateoverflow.in/335453

Identify the logic function performed by the circuit shown

A. Exclusive-OR B. AND C. Exclusive-NOR D. NOR

ugcnetjune2005ii

35.0.312 UGCNET-June2005-II: 9 https://gateoverflow.in/335454

Which of the following binary number is the same as its 2′ s complement :

A. 1010 B. 0101 C. 1000 D. 1001

ugcnetjune2005ii

35.0.313 UGCNET-June2005-II: 8 https://gateoverflow.in/335455

Which of the following logic has the maximum fan out ?

A. RT L B. ECL C. NMOS D. CMOS

ugcnetjune2005ii

35.0.314 UGCNET-June2005-II: 6 https://gateoverflow.in/335457

(101011)2 = (53)b , then ′ b′ is equal to :

A. 4 B. 8 C. 10 D. 16
ugcnetjune2005ii

35.0.315 UGCNET-Dec2005-II: 27 https://gateoverflow.in/335481

Which of following file retrieval methods use hypermedia ?

A. HTML B. Veronica C. WAIS D. HTTP

ugcnetdec2005ii

35.0.316 UGCNET-June2005-II: 4 https://gateoverflow.in/335459

Consider the relation on the set of non-negative integers defined by x ≡ y if and only if:
A. x mod 3 = 3 mod y B. 3 mod x ≡ 3 mod y
C. x mod 3 = y mod 3 D. None of the above
ugcnetjune2005ii
35.0.317 UGCNET-June2005-II: 18 https://gateoverflow.in/335445

A black hole in a DFD 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
ugcnetjune2005ii

35.0.318 UGCNET-June2005-II: 3 https://gateoverflow.in/335460

⎡0 1 0⎤
The transitive closure of a relation R on set A whose relation matrix ⎢ 0 0 1 ⎥ is :
⎣1 0 0⎦

⎡0 1 0⎤
A. ⎢0 0 1⎥
⎣1 0 0⎦
⎡1 1 0⎤
B. ⎢1 1 0⎥
⎣1 1 0⎦
⎡1 1 1⎤
C. ⎢1 1 1⎥
⎣1 1 1⎦
⎡0 1 1⎤
D. ⎢0 1 1⎥
⎣0 1 1⎦

ugcnetjune2005ii

35.0.319 UGCNET-June2005-II: 2 https://gateoverflow.in/335461

Identify the language which is not context – free.

A. L = {wwR ∣ w ∈ {0, 1} ∗} B. L = {an bn ∣ n ≥ 0}
C. L = {ww ∣ w ∈ {0, 1} ∗} D. L = {an bm cm d n ∣ n, m ≥ 0}
ugcnetjune2005ii

35.0.320 UGCNET-June2005-II: 1 https://gateoverflow.in/335462

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

ugcnetjune2005ii

35.0.321 UGCNET-Dec2005-II: 30 https://gateoverflow.in/335478

Encryption and decryption are the functions of the _________ layer of OSI model :

A. transport B. session C. router D. presentation

ugcnetdec2005ii

35.0.322 UGCNET-Dec2005-II: 29 https://gateoverflow.in/335479

__________ provide a method to recover data that has been delivered but not get used :
A. Segmentation B. Concatenation
C. Transalation D. Synchronization
 ugcnetdec2005ii

35.0.323 UGCNET-Dec2005-II: 28 https://gateoverflow.in/335480

Which of following is an example of a client - server model :

A. DNS B. FTP C. TELNET D. All the above

ugcnetdec2005ii

35.0.324 UGCNET-June2005-II: 23 https://gateoverflow.in/335440

In the balanced binary tree given below, how many nodes will become unbalanced when a node is inserted as a child of
the node “g” ?

A. 1 B. 3 C. 7 D. 8
ugcnetjune2005ii

35.0.325 UGCNET-June2005-II: 21 https://gateoverflow.in/335442

What is the time required to insert an element in a stack with linked implementation?

A. O (log2 n) B. O (n) C. O (n log2 n) D. O (1)

ugcnetjune2005ii

35.0.326 UGCNET-June2006-II: 6 https://gateoverflow.in/335532

The number of 1’s present in the binary representation of (3 × 512 + 7 × 64 + 5 × 8 + 3)10 is:

A. 8 B. 9 C. 10 D. 11
ugcnetjune2006ii

35.0.327 UGCNET-Dec2005-II: 17 https://gateoverflow.in/335491

One approach to standarolizing storing of data :

A. MIS B. CODASYL
C. Stuctured Programing D. None of the above
ugcnetdec2005ii

35.0.328 UGCNET-June2006-II: 30 https://gateoverflow.in/335508

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

ugcnetjune2006ii

35.0.329 UGCNET-Dec2005-II: 22 https://gateoverflow.in/335486

A hash function f defined as f(key) = key mod 7, with linear probing it is used to insert the key
37, 38, 72, 48, 98, 11, 56 into a table index from 0 to 6. What will be the locations of 11:

A. 3 B. 4 C. 5 D. 6
ugcnetdec2005ii

35.0.330 UGCNET-Dec2005-II: 13 https://gateoverflow.in/335495

Data members and member function of a class by default is respectively :

 A. private and public B. public C. public and private D. private
ugcnetdec2005ii

35.0.331 UGCNET-Dec2005-II: 21 https://gateoverflow.in/335487

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. AVL -tree
C. Threaded binary tree D. Complete tree
ugcnetdec2005ii

35.0.332 UGCNET-Dec2005-II: 20 https://gateoverflow.in/335488

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 B and C
ugcnetdec2005ii

35.0.333 UGCNET-Dec2005-II: 19 https://gateoverflow.in/335489

An embedded printer provides :

A. Physical record key B. An inserted Index
C. A secondary access path D. All the above
ugcnetdec2005ii

35.0.334 UGCNET-Dec2005-II: 18 https://gateoverflow.in/335490

In a relational schema, each tuple is divided in fields called :

A. Relations B. Domains C. Queries D. All the above

ugcnetdec2005ii

35.0.335 UGCNET-Dec2005-II: 16 https://gateoverflow.in/335492

A schema describes :
A. data elements B. records and files
C. record relationship D. all of the above
ugcnetdec2005ii

35.0.336 UGCNET-June2006-II: 10 https://gateoverflow.in/335528

Upto how many variables, can the Karnaugh map be used?

A. 3 B. 4 C. 5 D. 6
ugcnetjune2006ii

35.0.337 UGCNET-Dec2005-II: 15 https://gateoverflow.in/335493

What will be the value of i for the following expression:

int i=11, i=3 ;
i + = (f>3) ? i & 2:5 ;

A. 2 B. 5 C. 13 D. 12
ugcnetdec2005ii

35.0.338 UGCNET-Dec2005-II: 14 https://gateoverflow.in/335494

Function over loading done at :

A. Runtime B. Compile time
C. Linking time D. Switching from function to function
ugcnetdec2005ii
35.0.339 UGCNET-Dec2005-II: 12 https://gateoverflow.in/335496

The bitwise OR of 35 with 7 in C will be :

A. 35 B. 7 C. 42 D. 39
ugcnetdec2005ii

35.0.340 UGCNET-Dec2005-II: 1 https://gateoverflow.in/335507

T is a graph with n vertices. T is connected and has exactly n − 1 edges, then :

A. T is a tree
B. T contains no cycles
C. Every pairs of vertices in T is connected by exactly one path
D. All of these

ugcnetdec2005ii

35.0.341 UGCNET-Dec2005-II: 10 https://gateoverflow.in/335498

When an inventor is placed between both inputs of an S-R flip flop, the resulting flip flop is :

A. JK flip-flop B. D flip-flop C. T flip-flop D. None of these

ugcnetdec2005ii

35.0.342 UGCNET-Dec2005-II: 9 https://gateoverflow.in/335499

Consider the following circuit :

to make it a Tautology the ? should be :

A. NAND gate B. AND gate C. OR gate D. EX-OR gate

ugcnetdec2005ii

35.0.343 UGCNET-Dec2005-II: 8 https://gateoverflow.in/335500

Consider the following sequence of instructions :

a = a ⊕ b, b = a ⊕ b, a = b ⊕ a This Sequence
A. retains the value of the a and b B. complements the value of a and b
C. swap a and b D. negates values of a and b
ugcnetdec2005ii

35.0.344 UGCNET-Dec2005-II: 7 https://gateoverflow.in/335501

A half-adder is also known as :

A. AND Circuit B. NAND Circuit C. NOR Circuit D. EX-OR Circuit

ugcnetdec2005ii

35.0.345 UGCNET-June2006-II: 28 https://gateoverflow.in/335510

What is the difference between the Ethernet frame preamble field and the IEEE 802.3 preamble and start of
frame Delimiter fields?

A. 1 byte B. 1 bit C. 4 bits D. 16 bits

ugcnetjune2006ii
35.0.346 UGCNET-June2006-II: 11 https://gateoverflow.in/335527

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. 10 B. 9 C. 12 D. 11
ugcnetjune2006ii

35.0.347 UGCNET-Dec2005-II: 25 https://gateoverflow.in/335483

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
ugcnetdec2005ii

35.0.348 UGCNET-June2006-II: 22 https://gateoverflow.in/335516

Preorder is also known as:

A. Depth first order B. Breadth first order
C. Topological order D. Linear order
ugcnetjune2006ii

35.0.349 UGCNET-Dec2005-II: 23 https://gateoverflow.in/335485

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

A. ABCD B. BACD C. BADC D. ABDC

ugcnetdec2005ii

35.0.350 UGCNET-June2006-II: 9 https://gateoverflow.in/335529

In a weighted code with weight 6, 4, 2, −3 the decimal 5 is represented by:

A. 0101 B. 0111 C. 1011 D. 1000

ugcnetjune2006ii

35.0.351 UGCNET-June2006-II: 19 https://gateoverflow.in/335519

Which data management language component enabled the DBA to define the schema components?

A. DML B. Subschema DLL C. Schema DLL D. All of these

ugcnetjune2006ii

35.0.352 UGCNET-June2006-II: 27 https://gateoverflow.in/335511

How much bandwidth is required to send 132 voice- grade channels by FDM on an international satellite system?

A. 500 MHz B. 10 MHz C. 1320 MHz D. 50 MHz

ugcnetjune2006ii
35.0.353 UGCNET-June2006-II: 26 https://gateoverflow.in/335512

What is the transmission signal coding method for a T1 carrier called?

A. Binary B. NRZ C. Bipolar D. Manchester

ugcnetjune2006ii

35.0.354 UGCNET-June2006-II: 25 https://gateoverflow.in/335513

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
ugcnetjune2006ii

35.0.355 UGCNET-June2006-II: 24 https://gateoverflow.in/335514

If the post fix form of a string is ABC + −D*, The actual string is:

A. (A − (B + C)) *D B. ((A − B) + C) *D C. ((A + B) − C) *D D. (A + (B − C) *D)

ugcnetjune2006ii

35.0.356 UGCNET-June2006-II: 23 https://gateoverflow.in/335515

Which of the following statement is false?

A. Every tree is a bipartite graph B. A tree contains a cycle
C. A tree with n nodes contains (n − 1) edges D. A tree is connected graph
ugcnetjune2006ii

35.0.357 UGCNET-June2006-II: 21 https://gateoverflow.in/335517

In the balanced binary tree given below, how many nodes will become unbalanced when a node is inserted as a child of
the node ”g”.

A. 1 B. 3 C. 7 D. 8
ugcnetjune2006ii

35.0.358 UGCNET-Dec2019-I: 43 https://gateoverflow.in/360689

According to GATS (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
ugcnetdec2019i

35.0.359 UGCNET-June2006-II: 20 https://gateoverflow.in/335518

A subclass having more than one super class is called_________.

A. Category B. Classification
C. Combination D. Partial participation
ugcnetjune2006ii

35.0.360 UGCNET-June2006-II: 18 https://gateoverflow.in/335520

Which of the following statement is wrong?

A. 2− phase locking protocol suffers from dead locks

B. Time-Stamp protocol suffers from more abort
C. Time-Stamp protocol suffers from cascading rollbacks whereas 2− phase locking protocol do not
D. None of these

ugcnetjune2006ii

35.0.361 UGCNET-June2006-II: 29 https://gateoverflow.in/335509

What is the function of a translating bridge?

A. Connect similar remote LANs B. Connect similar local LANs
C. Connect different types of LANs D. Translate the network adresses into a layer 2 address
ugcnetjune2006ii

35.0.362 UGCNET-June2006-II: 17 https://gateoverflow.in/335521

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
ugcnetjune2006ii

35.0.363 UGCNET-June2006-II: 16 https://gateoverflow.in/335522

A relation R ={A, B, C, D, E, F } is given with following set of functional dependencies:

F = {A → B, AD → C, B → F, A → E }
Which of the following is candidate key?

A. A B. AC C. AD D. None of these
ugcnetjune2006ii

35.0.364 UGCNET-June2006-II: 15 https://gateoverflow.in/335523

The function sprintf() works like printf(), but operates on :

A. Data in a file B. stdrr C. stdin D. string

ugcnetjune2006ii

35.0.365 UGCNET-June2006-II: 14 https://gateoverflow.in/335524

# define max (x, y)x = (x > y)?x : y is a macro definition, which can find the maximum of two numbers x and y if:
A. x and y are both integers only B. x and y are both declared as float only
C. x and y are both declared as double only D. x and y are both integers, float or double
ugcnetjune2006ii

35.0.366 UGCNET-June2006-II: 13 https://gateoverflow.in/335525

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

ugcnetjune2006ii
35.0.367 UGCNET-June2006-II: 8 https://gateoverflow.in/335530

Which of the following logic has the maximum fan out?

A. RTL B. ECL C. NMOS D. CMOS

ugcnetjune2006ii

35.0.368 UGCNET-June2007-II: 45 https://gateoverflow.in/335688

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
ugcnetjune2007ii

35.0.369 UGCNET-Dec2005-II: 5 https://gateoverflow.in/335503

Regular expression a + b denotes the set :

A. {a} B. {∈, a, b } C. {a, b} D. None of these

ugcnetdec2005ii

35.0.370 UGCNET-Dec2005-II: 47 https://gateoverflow.in/335561

Which of the following is a EDI standard ?

A. ANSI X.15 B. ANSI X.14 C. ANSI X.13 D. ANSI X.12

ugcnetdec2005ii

35.0.371 UGCNET-June2006-II: 5 https://gateoverflow.in/335533

x
Let A = {x| − 1 < x < 1} = B. The function f(x) = from A to B is:
2
A. injective B. surjective
C. both injective and surjective D. neither injective nor surjective
ugcnetjune2006ii

35.0.372 UGCNET-June2006-II: 3 https://gateoverflow.in/335535

The preposition (p → q) ∧ (∼ q ∨ p) is equivalent to :

A. q → p B. p → q
C. (q → p) ∨ (p → q) D. (p → q) ∨ (q → p)
ugcnetjune2006ii

35.0.373 UGCNET-June2006-II: 2 https://gateoverflow.in/335536

For a complete graph with N vertices, the total number of spanning trees is given by:

A. 2N − 1 B. N N−1 C. N N−2 D. 2N + 1
ugcnetjune2006ii

35.0.374 UGCNET-June2006-II: 1 https://gateoverflow.in/335537

Which of the following strings is in the language defined by grammar S → OA, A → 1A/0A/1

A. 01100 B. 00101 C. 10011 D. 11111

ugcnetjune2006ii

35.0.375 UGCNET-Dec2005-II: 50 https://gateoverflow.in/335558

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
ugcnetdec2005ii

35.0.376 UGCNET-Dec2005-II: 49 https://gateoverflow.in/335559

The cost of the network is usually determined by :

A. Time complexity B. Switching complexity
C. Circuit complexity D. None of these
ugcnetdec2005ii

35.0.377 UGCNET-Dec2005-II: 48 https://gateoverflow.in/335560

Analysis of large database to retrive information is called :

A. OLTP B. OLAP C. OLDP D. TLPP

ugcnetdec2005ii

35.0.378 UGCNET-Dec2005-II: 45 https://gateoverflow.in/335563

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
ugcnetdec2005ii

35.0.379 UGCNET-June2006-II: 36 https://gateoverflow.in/335611

The first operating system of Microprocessor is_______.

A. ATLAS B. CP/M C. SAGE D. T.H.E

ugcnetjune2006ii

35.0.380 UGCNET-Dec2005-II: 36 https://gateoverflow.in/335572

Producer consumer problem can be solved using :

A. semaphores B. event counters C. monitors D. all the above

ugcnetdec2005ii

35.0.381 UGCNET-Dec2005-II: 44 https://gateoverflow.in/335564

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
ugcnetdec2005ii

35.0.382 UGCNET-Dec2005-II: 43 https://gateoverflow.in/335565

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
ugcnetdec2005ii

35.0.383 UGCNET-Dec2005-II: 42 https://gateoverflow.in/335566

The lower degree of cohesion is :

A. logical cohesion B. coincidential cohesion
C. procedural cohesion D. communicational cohesion
ugcnetdec2005ii
35.0.384 UGCNET-Dec2005-II: 41 https://gateoverflow.in/335567

The testing of software against SRS is called :

A. Acceptance testing B. Integration testing
C. Regression testing D. Series testing
ugcnetdec2005ii

35.0.385 UGCNET-Dec2005-II: 40 https://gateoverflow.in/335568

Banker's algorithm is used for __________ purpose :

A. Deadlock avoidance B. Deadlock removal
C. Deadlock prevention D. Deadlock continuations
ugcnetdec2005ii

35.0.386 UGCNET-Dec2005-II: 39 https://gateoverflow.in/335569

Nonmodifiable procedures are called :

A. Serially usable procedure B. Concurrent procedure
C. Reentrant procedure D. Topdown procedure
ugcnetdec2005ii

35.0.387 UGCNET-Dec2005-II: 38 https://gateoverflow.in/335570

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
ugcnetdec2005ii

35.0.388 UGCNET-Dec2005-II: 46 https://gateoverflow.in/335562

Which of the following transonission media is used in Blue tooth Technology :

A. Radio links B. Microwave links
C. VSAT Communication D. Fiber - optic
ugcnetdec2005ii

35.0.389 UGCNET-Dec2005-II: 35 https://gateoverflow.in/335573

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
ugcnetdec2005ii

35.0.390 UGCNET-June2006-II: 37 https://gateoverflow.in/335610

In processor management, round robin method essentially uses the preemptive version of_____.

A. FILO B. FIFO C. SJF D. Longest time first

ugcnetjune2006ii

35.0.391 UGCNET-June2006-II: 46 https://gateoverflow.in/335601

MMS (Multimedia Messaging Service) uses ______ types of messages to perform messaging transactions.

A. 4 B. 6 C. 8 D. 10
ugcnetjune2006ii

35.0.392 UGCNET-Dec2005-II: 32 https://gateoverflow.in/335576

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
ugcnetdec2005ii

35.0.393 UGCNET-Dec2005-II: 31 https://gateoverflow.in/335577

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
ugcnetdec2005ii

35.0.394 UGCNET-Dec2004-II: 48 https://gateoverflow.in/335580

The cost of a parallel processing is primarily determined by :

A. Time complexity B. Switching complexity
C. Circuit complexity D. None of the above
ugcnetdec2004ii

35.0.395 UGCNET-Dec2004-II: 44 https://gateoverflow.in/335584

In transform analysis, input portion is called :

A. Afferent branch B. Efferent branch
C. Central Transform D. None of the above
ugcnetdec2004ii

35.0.396 UGCNET-Dec2004-II: 39 https://gateoverflow.in/335589

Non modifiable procedures are called

A. Serially useable procedures B. Concurrent procedures
C. Reentrant procedures D. Topdown procedures
ugcnetdec2004ii

35.0.397 UGCNET-June2006-II: 50 https://gateoverflow.in/335597

The use of a smart card represents a form of:

A. password encryption B. user-ID encryption
C. authorization D. authentication
ugcnetjune2006ii

35.0.398 UGCNET-June2006-II: 49 https://gateoverflow.in/335598

Predictive modeling in data mining uses____technique.

A. Statistical B. Association Discovery
C. Value prediction D. None of these
ugcnetjune2006ii

35.0.399 UGCNET-June2006-II: 48 https://gateoverflow.in/335599

Downflow is the process associated with _____ and back up of data in a warehouse.

A. packaging B. archiving C. extraction D. loading

ugcnetjune2006ii

35.0.400 UGCNET-Dec2005-II: 34 https://gateoverflow.in/335574

Which of the following is not collision Resolution Technique :

A. Hash addressing​​ B. Chainning
C. Indexing D. None of these
ugcnetdec2005ii
35.0.401 UGCNET-Dec2005-II: 33 https://gateoverflow.in/335575

A general macroprocessor is an in built function of :

A. Loader B. Linker C. Editor D. Assembler

ugcnetdec2005ii

35.0.402 UGCNET-June2006-II: 45 https://gateoverflow.in/335602

The COCOMO model is used for_____.

A. software design B. software cost estimation
C. software cost approximation D. software analysis
ugcnetjune2006ii

35.0.403 UGCNET-June2006-II: 44 https://gateoverflow.in/335603

System study yields the following:

A. Requirement specifications B. Prevailing process description
C. Data source identification D. All the above
ugcnetjune2006ii

35.0.404 UGCNET-June2006-II: 43 https://gateoverflow.in/335604

In a good software design, ____coupling is desirable between modules.

A. Highest B. Lowest C. Internal D. External

ugcnetjune2006ii

35.0.405 UGCNET-June2006-II: 42 https://gateoverflow.in/335605

In Software Metrics, McCABE’S cyclomatic number is given by following formula:

A. c = e − n + 2p B. c = e − n − 2p C. c = e + n + 2p D. c = e− n*2p
ugcnetjune2006ii

35.0.406 UGCNET-June2006-II: 41 https://gateoverflow.in/335606

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

ugcnetjune2006ii

35.0.407 UGCNET-June2006-II: 40 https://gateoverflow.in/335607

The memory allocation scheme subjected to “external” fragmentation is :

A. Segmentation B. Swapping
C. Demand paging D. Multiple contiguous fixed partitions
ugcnetjune2006ii

35.0.408 UGCNET-June2006-II: 39 https://gateoverflow.in/335608

_______synchronize critical resources to prevent deadlock.

A. P - operator B. V - operator C. Semaphores D. Hard disk

ugcnetjune2006ii

35.0.409 UGCNET-June2006-II: 38 https://gateoverflow.in/335609

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

ugcnetjune2006ii

35.0.410 UGCNET-Dec2005-II: 37 https://gateoverflow.in/335571

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
ugcnetdec2005ii

35.0.411 UGCNET-June2006-II: 35 https://gateoverflow.in/335612

The dynamic binding occurs during the:

A. Compile time B. Run time
C. Linking time D. Pre-processing time
ugcnetjune2006ii

35.0.412 UGCNET-June2007-II: 46 https://gateoverflow.in/335687

Which technical concept sets cellular apart from all preceding mobile/ratio systems?
A. FM -Transmission B. Duplex Functionality
C. Frequency Reuse D. TDMA Technology
ugcnetjune2007ii

35.0.413 UGCNET-Dec2006-II: 14 https://gateoverflow.in/335657

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

ugcnetdec2006ii

35.0.414 UGCNET-Dec2006-II: 10 https://gateoverflow.in/335661

Which of the following logic is the fastest ?

A. RTL B. ECL C. HTL D. HCL

ugcnetdec2006ii

35.0.415 UGCNET-June2006-II: 33 https://gateoverflow.in/335614

YACC builds up _____parsing table.

A. LALR B. LR C. SLR D. LLR

ugcnetjune2006ii

35.0.416 UGCNET-June2006-II: 32 https://gateoverflow.in/335615

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
ugcnetjune2006ii
35.0.417 UGCNET-June2006-II: 31 https://gateoverflow.in/335616

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

ugcnetjune2006ii

35.0.418 UGCNET-Dec2006-II: 48 https://gateoverflow.in/335623

An INT file in Windows 95 is :

A. a program file. B. a message file.
C. a text file. D. link file.

ugcnetdec2006ii

35.0.419 UGCNET-Dec2006-II: 47 https://gateoverflow.in/335624

Which of the following is an EDI standard ?

A. ANSI X.15 B. ANSI X.14 C. ANSI X.13 D. ANSI X.12

ugcnetdec2006ii

35.0.420 UGCNET-Dec2006-II: 46 https://gateoverflow.in/335625

The frequency band allocated for the downlink in GSM is :

A. 960 − 985 MHz B. 935 − 960 MHz C. 920 − 945 MHz D. 930 − 955 MHz

ugcnetdec2006ii

35.0.421 UGCNET-Dec2006-II: 12 https://gateoverflow.in/335659

Enumeration variables can be used in :

A. search statement like an integer variable B. break statement
C. preprocessor commands D. function statement
ugcnetdec2006ii

35.0.422 UGCNET-June2007-II: 43 https://gateoverflow.in/335690

Match the following:

(a) Unit test (i) Requirements

(b) System test (ii) Design
(c) Validation test (iii) Code
(d) Integration test (iv) System Engineering
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
ugcnetjune2007ii

35.0.423 UGCNET-Dec2006-II: 8 https://gateoverflow.in/335663

A sum of products expression can be implemented with __________ logic gates.

A. AND−OR B. NAND−OR C. AND−NOT D. OR−AND

ugcnetdec2006ii

35.0.424 UGCNET-June2007-II: 44 https://gateoverflow.in/335689

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. 1 and 4 only B. 2 and 3 only C. 1,2 and 3 only D. 1,2,3 and 4

ugcnetjune2007ii

35.0.425 UGCNET-Dec2006-II: 5 https://gateoverflow.in/335666

If (a2 − b2 ) is a prime number where a and b ∈ N, then :

A. a2 − b2 = 3 B. a2 − b2 = a − b
2 2
C. a − b = a + b D. a2 − b2 = 5
ugcnetdec2006ii

35.0.426 UGCNET-Dec2006-II: 4 https://gateoverflow.in/335667

Which of the following is not true ?

A. B. A−B=A ∩ ~ B C. D.

ugcnetdec2006ii

35.0.427 UGCNET-June2007-II: 50 https://gateoverflow.in/335683

Which digital radio technology employs an N = 1 frequency – reuse plan?

A. GSM B. TDMA C. D AMPS D. CDMA

ugcnetjune2007ii

35.0.428 UGCNET-June2007-II: 49 https://gateoverflow.in/335684

The U-NII (Unlicensed National Information Infrastructure) band operates at the _______frequency:

A. 2.4 GHz B. 33 MHz C. 5 GHz D. 16 GHz

ugcnetjune2007ii

35.0.429 UGCNET-June2007-II: 48 https://gateoverflow.in/335685

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
ugcnetjune2007ii

35.0.430 UGCNET-June2007-II: 47 https://gateoverflow.in/335686

Wireless interconnection to the PSTN are also known as:

A. Localities B. CLECs C. POPs D. IXCs

ugcnetjune2007ii

35.0.431 UGCNET-June2006-II: 34 https://gateoverflow.in/335613

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
ugcnetjune2006ii

35.0.432 UGCNET-June2007-II: 41 https://gateoverflow.in/335692

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
ugcnetjune2007ii

35.0.433 UGCNET-June2006-II: 7 https://gateoverflow.in/335531

Which of the following expression removes static hazard from a two level AND-OR gate implementation of xy + zx̄

A. xy + zx̄ B. xy + zx̄ + wyz C. xy + zx̄ + yz D. xy + zx̄ + wz

ugcnetjune2006ii

35.0.434 UGCNET-June2007-II: 33 https://gateoverflow.in/335700

In an absolute loading scheme, which loader function is accomplished by programmer?

A. Allocation B. Linking C. Rellocation D. Both A and B

ugcnetjune2007ii

35.0.435 UGCNET-June2007-II: 32 https://gateoverflow.in/335701

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
ugcnetjune2007ii

35.0.436 UGCNET-June2007-II: 40 https://gateoverflow.in/335693

Cache memory is:

A. High-Speed Register B. Low-Speed RAM
C. Non-Volatile RAM D. High-speed RAM
ugcnetjune2007ii

35.0.437 UGCNET-June2007-II: 39 https://gateoverflow.in/335694

Which page replacement policy suffers from Belady’s anomaly?

A. LRV B. LFU C. FIFO D. OPTIMAL

ugcnetjune2007ii
35.0.438 UGCNET-June2007-II: 38 https://gateoverflow.in/335695

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
ugcnetjune2007ii

35.0.439 UGCNET-June2007-II: 37 https://gateoverflow.in/335696

Window is a _______ operating system:

A. Non-preemptive B. Preemptive C. Multi-user D. Real time

ugcnetjune2007ii

35.0.440 UGCNET-June2007-II: 36 https://gateoverflow.in/335697

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
ugcnetjune2007ii

35.0.441 UGCNET-June2007-II: 35 https://gateoverflow.in/335698

Moving process from main memory to disk is called:

A. Caching B. Termination C. Swapping D. Interruption

ugcnetjune2007ii

35.0.442 UGCNET-June2007-II: 34 https://gateoverflow.in/335699

Symbol table can be used for:

A. Checking type compability B. Suppressing duplication of error message
C. Storage allocation D. All of these above
ugcnetjune2007ii

35.0.443 UGCNET-June2007-II: 31 https://gateoverflow.in/335702

The parsing technique that avoids back tracking is:

A. Top-down parsing B. Recursive-descent parsing
C. Predicative D. Syntax tree
ugcnetjune2007ii

35.0.444 UGCNET-June2007-II: 23 https://gateoverflow.in/335710

The equivalent postfix express for d/(e + f) + b ∗ c is :

A. defbc/ + + B. def + /bc + ∗ C. def + /bc ∗ + D. None of these

ugcnetjune2007ii

35.0.445 UGCNET-June2007-II: 42 https://gateoverflow.in/335691

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
ugcnetjune2007ii

35.0.446 UGCNET-June2007-II: 30 https://gateoverflow.in/335703

Which of the following protocols is used to prevent looping?

A. OSPF B. Spanning tree
C. SRB D. Fragment free switching
 ugcnetjune2007ii

35.0.447 UGCNET-June2007-II: 29 https://gateoverflow.in/335704

What services does the Internet Layer provide?

1. Quality of service
2. Routing
3. Addressing
4. Connection-oriented delivery
5. Framming bits

A. 1, 2, 3 B. 2, 3, 4 C. 1, 3, 4, 5 D. 2, 3, 4, 5
ugcnetjune2007ii

35.0.448 UGCNET-June2007-II: 28 https://gateoverflow.in/335705

TDM is _____.
A. A primary /secondary type protocol B. A peer/peer protocol
C. A Non-priority peer/peer protocol D. A priority type protocol
ugcnetjune2007ii

35.0.449 UGCNET-June2007-II: 27 https://gateoverflow.in/335706

Which of the following techniques are used to control data flow?

1. Windowing
2. Routing
3. RPCs
4. Buffering

A. 1, 4 B. 2, 3, 4 C. 1, 3, 4 D. 1, 2, 3, 4
ugcnetjune2007ii

35.0.450 UGCNET-June2007-II: 26 https://gateoverflow.in/335707

In case of Bus/Tree topology signal balancing issue is overcome by:

A. Strong Transmitter B. Polling
C. Segmentation D. Modulation
ugcnetjune2007ii

35.0.451 UGCNET-June2007-II: 25 https://gateoverflow.in/335708

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.
ugcnetjune2007ii

35.0.452 UGCNET-June2007-II: 24 https://gateoverflow.in/335709

Which algorithm has some average, worst case and best case time:
A. Binary search B. Maximum of n numbers
C. Quick sort D. Fibonacci search
ugcnetjune2007ii

35.0.453 UGCNET-Dec2005-II: 6 https://gateoverflow.in/335502

Which of the following is divisible by 4?

 A. 100101100 B. 1110001110001 C. 11110011 D. 10101010101010
ugcnetdec2005ii

35.0.454 UGCNET-June2006-II: 12 https://gateoverflow.in/335526

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

ugcnetjune2006ii

35.0.455 UGCNET-Dec2005-II: 4 https://gateoverflow.in/335504

Which sentence can be generated by S → d/bA, A → d/ccA :

A. bccddd B. aabccd C. ababccd D. abbbd

ugcnetdec2005ii

35.0.456 UGCNET-Dec2019-II: 82 https://gateoverflow.in/360751

Match List-I and List-II:

List I List II
(a) Physical layer (i) Provide token management service
(b) Transport layer
(ii) Concerned with transmitting raw bits
over a communication channel
(c) Session Layer (iii) Concerned with the syntax and
semantics of the information transmitted
(d) Presentation layer (iv) True end-to-end layer from source to
destination

Choose the correct option from those given below:

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

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

ugcnetdec2019ii

35.0.457 UGCNET-Dec2019-II: 85 https://gateoverflow.in/360748

Match List – I with List-II:

List I List II
(a) Frame attribute (i) to create link in HTML
(b) <tr> tag (ii) for vertical alignment of content in cell
(c) Valign attribute (iii) to enclose each row in table
(d) <a> tag (iv) to specify the side of the table
frame that display border
Choose the correct option from those given below:
A. (a)-(i) , (b)-(ii), (c)-(iii), (d)-(iv) B. (a)-(ii) , (b)-(i), (c)-(iii), (d)-(iv)
C. (a)-(iv) , (b)-(iii), (c)-(ii), (d)-(i) D. (a)-(iii) , (b)-(iv), (c)-(ii), (d)-(i)
ugcnetdec2019ii
35.0.458 UGCNET-Dec2019-II: 27 https://gateoverflow.in/360806

Consider a paging system where translation look aside buffer ( TLB) a special type of associative memory is used with
hit ratio of 80%.
Assume that memory reference takes 80 nanoseconds and reference time to TLB is 20 nanoseconds. What will be the effective
memory access time given 80% hit ratio?
A. 110 nanoseconds B. 116 nanoseconds
C. 200 nanoseconds D. 100 nanoseconds
ugcnetdec2019ii

35.0.459 UGCNET-Dec2019-II: 28 https://gateoverflow.in/360805

Suppose a system has 12 magnetic tape drives and at time t0 , three processes are allotted tape drives out of their need
as given below:

Maximum Needs Current Needs

p0 10 5
p1 4 2
p2 9 2
At time t0 , the system is in safe state. Which of the following is safe sequence so that deadlock is avoided?

A. ⟨ p0 , p1 , p2 ⟩
B. ⟨ p1 , p0 , p2 ⟩
C. ⟨ p2 , p1 , p0 ⟩
D. ⟨ p0 , p2 , p1 ⟩

ugcnetdec2019ii

35.0.460 UGCNET-Dec2019-II: 84 https://gateoverflow.in/360749

Match the Agile Process models with the task performed during the model:

List I List II
(a) Scrum (i) CRC cards
(b) Adaptive software development (ii) Sprint backlog
(c) Extreme programming (iii)<action> the <result> <by/for/of/to>
a(n) <object>
(d) Feature-driven development (iv) Time box release plan

Choose the correct option from those given below:

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

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

ugcnetdec2019ii

35.0.461 UGCNET-Dec2019-II: 29 https://gateoverflow.in/360804

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
ugcnetdec2019ii

35.0.462 UGCNET-Dec2019-II: 83 https://gateoverflow.in/360750

According to the ISO − 9126 Standard Quality Model, match the attributes given in List-I with their definitions in
List-II:
 List I List II
(a) Functionality(i) Relationship between level of
performance and amount of resources
(b) Reliability (ii) Characteristics related with
achievement of purpose
(c) Efficiency (iii) Effort needed to make for improvement
(d) Maintainability (iv) Capability of software to maintain
performance of software

Choose the correct options from the ones given below:

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

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

ugcnetdec2019ii

35.0.463 UGCNET-Dec2019-II: 30 https://gateoverflow.in/360803

Given CPU time slice of 2ms and following list of processes.

Process Burst time Arrival time

(ms)
p1 3 0
p2 4 2
p3 5 5
Find average turnaround time and average waiting time using round robin CPU scheduling?

A. 4, 0 B. 5.66, 1.66 C. 5.66, 0 D. 7, 2

ugcnetdec2019ii

35.0.464 UGCNET-Dec2005-II: 3 https://gateoverflow.in/335505

Let A and B be two arbitrary events, then :

A. P (A ∩ B) = P (A) P (B)
B. P (P ∪ B) = P (A) + P (B)
C. P (A ∪ B) ≤ P (A) + P (B)
D. P (A/B) = P (A ∩ B) + P (B)

ugcnetdec2005ii

35.0.465 UGCNET-Dec2019-II: 31 https://gateoverflow.in/360802

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
ugcnetdec2019ii

35.0.466 UGCNET-Dec2019-II: 81 https://gateoverflow.in/360752

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)
ugcnetdec2019ii

35.0.467 UGCNET-Dec2019-II: 79 https://gateoverflow.in/360754

Consider the following statements with respect to network security:

a. Message confidentiality means that the sender and the receiver
b. Message integrity means that the data must arrive at the receiver
expect privacy exactly as they were sent.
c. Message authentication means the receiver is ensured that theWhich of the statements is (are) correct?
message is coming from the intended sender
A. Only (a) and (b) B. Only (a) and (c)
C. Only (b) and (c) D. (a), (b) and (c)
ugcnetdec2019ii

35.0.468 UGCNET-Dec2019-II: 70 https://gateoverflow.in/360763

Consider the following statements with respect to approaches to fill area on raster systems:
P : To determine the overlap intervals for scan lines that cross the area
Q: 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. P only B. Q only C. Both P and Q D. Neither P nor Q

ugcnetdec2019ii

35.0.469 UGCNET-Dec2019-II: 78 https://gateoverflow.in/360755

Consider the following statements:

a. Windows Azure is a cloud-based operating system. b. Google App Engine is an integrated set of online services for
consumers to communicate and share with others.
c. Amazon Cloud Front is a web service for content delivery. Which of the following statements is (are) correct?
A. Only (a) and (b) B. Only (a) and (c)
C. Only (b) and (c) D. (a), (b) and (c)
ugcnetdec2019ii

35.0.470 UGCNET-Dec2019-II: 77 https://gateoverflow.in/360756

Consider the following statements:

a. Fiber optic cable is much lighter than copper cable b. Fiber optic cable is not affected by power surges or
electromagnetic interference
c. Optical transmission is inherently bidirectional Which of the statements is (are) correct?
A. Only (a) and (b) B. Only (a) and (c)
C. Only (b) and (c) D. (a), (b) and (c)
ugcnetdec2019ii

35.0.471 UGCNET-Dec2019-II: 76 https://gateoverflow.in/360757

Consider the following statements:

a. The running time of dynamic

b. When
programming
a recurrence
algorithm
relation
c. For
is
hasalways
aadynamic
cyclic dependency,
θ(ρ) programming
where ρd.isitIfnumber
isaalgorithm,
impossible
problem
of subproblems
Xcomputing
to
can
use
bethat Which
reduced
allrecurrence
values
to ainknownofNP(unmodified)
relation
a bottom-up theproblem,
-hard
fashion isinasym
athen
co
statement(s) is (are)
true?

A. Only (b) and (a) B. Only (b) C. Only (b) and (c) D. Only (b) and (d)
ugcnetdec2019ii

35.0.472 UGCNET-Dec2019-II: 86 https://gateoverflow.in/360747

An instruction is stored at location 500 with its address field at location 501. The address field has the value 400. A
processor register R1 contains the number 200. Match the addressing mode (List – I) given below with effective
address (List-II) for the given instruction:

List I List II
(a) Direct (i) 200
(b) Register indirect (ii) 902
(c) Index with R1 as the index register (iii) 400
(d) Relative (iv) 600

Choose the correct option from those given below:

A. (a)-(iii), (b)-(i), (c) -(iv), (d)-(ii) B. (a)-(i), (b)-(ii), (c) -(iii), (d)-(iv)
C. (a)-(iv), (b)-(ii), (c) -(iii), (d)-(i) D. (a)-(iv), (b)-(iii), (c) -(ii), (d)-(i)
ugcnetdec2019ii

35.0.473 UGCNET-Dec2019-II: 87 https://gateoverflow.in/360746

Match List-I and List-II:

List I List II
(a) Isolated I/O (i) same set of control signal for I/O
and memory communication
(b) Memory mapped I/O (ii) separate instructions for I/O
and memory communication
(c) I/O interface (iii) requires control signals to be
transmitted between the
communicating units
(d) Asynchronous data transfer (iv) resolve the differences in central
computer and peripherals

Choose the correct option from those given below:

A. (a)-(ii), (b)-(iii), (c)-(iv), (d)-(i) B. (a)-(i), (b)-(ii), (c)-(iii), (d)-(iv)
C. (a)-(ii), (b)-(i), (c)-(iv), (d)-(iii) D. (a)-(i), (b)-(ii), (c)-(iv), (d)-(iii)
ugcnetdec2019ii

35.0.474 UGCNET-Dec2019-II: 74 https://gateoverflow.in/360759

Identify the circumstances under which pre-emptive CPU 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
ugcnetdec2019ii

35.0.475 UGCNET-Dec2019-II: 91 https://gateoverflow.in/360742

A flow graph F with entry node (1) and exit node (11) is shown below:

How many nodes are there in flowgraph F

A. 9 B. 10 C. 11 D. 12
ugcnetdec2019ii
35.0.476 UGCNET-June2007-II: 19 https://gateoverflow.in/335714

A Relation R ={A, B, C, D, E, F } is given with following set of functional dependencies:

F = {A → B, AD → C, B → F, A → E }. Which of the following is Candidate Key?

A. A B. AC C. AD D. None of these
ugcnetjune2007ii

35.0.477 UGCNET-Dec2019-II: 54 https://gateoverflow.in/360779

Consider a subnet with 720 routers. If a three-level hierarchy is chosen, with eight clusters, each containing 9 regions
of 10 routers, then total number of entries in hierarchical table of each router is

A. 25 B. 27 C. 53 D. 72
ugcnetdec2019ii

35.0.478 UGCNET-Dec2019-II: 53 https://gateoverflow.in/360780

Which of the following class of IP address has the last address as 223.255.255.255?

A. Class A B. Class B C. Class C D. Class D

ugcnetdec2019ii

35.0.479 UGCNET-Dec2019-II: 52 https://gateoverflow.in/360781

L e t A = {001, 0011, 11, 101} and B = {01, 111, 111, 010} . Similarly, let C = {00, 001, 1000} and
D = {0, 11, 011} .
Which of the following pairs have a post-correspondence solution?
A. Only pair (A, B) B. Only pair (C, D)
C. Both (A, B) and (C, D) D. Neither (A, B) nor (C, D)
ugcnetdec2019ii

35.0.480 UGCNET-Dec2019-II: 51 https://gateoverflow.in/360782

Consider the following statements:

S1 : These exists no algorithm for deciding if any two Turing machines M1 and M2 accept the same language
S2 : Let M1 and M2 be arbitrary Turing machines. The problem to determine L(M1 ) ⊆ L(M2 ) is undecidable
Which of the statements is (are) correct?

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

ugcnetdec2019ii

35.0.481 UGCNET-Dec2019-II: 50 https://gateoverflow.in/360783

Consider the following language families:

L1 ≡ The context-free languages
L2 ≡ The context-sensitive languages
L3 ≡ The recursively enumerable languages
L4 ≡ The recursive languages
Which one of the following options is correct?

A. L1 ⊆ L2 ⊆ L3 ⊆ L4
B. L2 ⊆ L1 ⊆ L3 ⊆ L4
C. L1 ⊆ L2 ⊆ L4 ⊆ L3
D. L2 ⊆ L1 ⊆ L4 ⊆ L3

ugcnetdec2019ii
35.0.482 UGCNET-Dec2019-II: 89 https://gateoverflow.in/360744

The sequence diagram given in Figure 1 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

ugcnetdec2019ii

35.0.483 UGCNET-Dec2019-II: 88 https://gateoverflow.in/360745

Match List-I with List-II:

List I List II
(a) Micro operation (i) Specify micro operations
(b) Micro programmed control unit (ii) Improve CPU utilization
(c) Interrupts (iii) Control Memory
(d) Micro instruction (iv) Elementary operation performed
on data stored in registers
Choose the correct option from those given below:
A. (a)-(iv), (b)-(iii), (c)-(ii), (d)-(i) B. (a)-(iv), (b)-(iii), (c)-(i), (d)-(ii)
C. (a)-(iii), (b)-(iv), (c)-(i), (d)-(ii) D. (a)-(iii), (b)-(iv), (c)-(ii), (d)-(i)
ugcnetdec2019ii

35.0.484 UGCNET-Dec2019-II: 49 https://gateoverflow.in/360784

Let G = (V , T, S, P ) be any context-free grammar without any λ-productions or unit productions. Let K be the
maximum number of symbols on the right of any production in P . The maximum number of production rules for any
equivalent grammar in Chomsky normal form is given by:
A. (K − 1) ∣ P ∣ + ∣ T ∣ −1 B. (K − 1) ∣ P ∣ + ∣ T ∣
C. K ∣ P ∣ + ∣ T ∣ −1 D. K ∣ P ∣ + ∣ T ∣
Where ∣⋅∣ denotes the cardinality of the set.

ugcnetdec2019ii

35.0.485 UGCNET-Dec2019-II: 67 https://gateoverflow.in/360766

Consider the following statements with respect to duality in LPP:

a. The final simplex table b.

giving
If either
optimal
the solution
primal orofthe
the
c. dual
Ifprimal
either
problem
also
problem
contains
has ahas
finite Which
optimal
an unbounded
optimal ofoptimum
solution the
solution, statements
of its
then
dual
solution, isthen
theinother
itself(are)
thecorrect?
problemother
also problem
has a finite
hasoptimal
no feasible
sol

A. Only (a) and (b) B. Only (a) and (c) C. only (b) and (c) D. (a), (b) and (c)
 ugcnetdec2019ii

35.0.486 UGCNET-Dec2019-II: 69 https://gateoverflow.in/360764

Which of the following binary codes for decimal digits are self complementing?

A. 8421 code B. 2421 code C. excess-3 code D. excess-3 gray code Choose the correct
option:

A. (a) and (b) B. (b) and (c) C. (c) and (d) D. (d) and (a)
ugcnetdec2019ii

35.0.487 UGCNET-Dec2019-II: 47 https://gateoverflow.in/360786

Consider the following statements with respect to the language L = {an bn ∣ n ≥ 0}

S1 : L2 is a context free language
S2 : Lk is context free language for any given k ≥ 1
S3 : ¯¯
¯¯
L and L∗ are context free languages
Which one of the following is correct?

A. only S1 and S2 B. only S1 and S3 C. only S2 and S3 D. S1 , S2 and S3

ugcnetdec2019ii

35.0.488 UGCNET-Dec2019-II: 80 https://gateoverflow.in/360753

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)
ugcnetdec2019ii

35.0.489 UGCNET-Dec2019-II: 32 https://gateoverflow.in/360801

Java Virtual Machine (JVM) is used to execute architectural neutral byte code. Which of the following is needed by
the JVM for execution of Java Code?
A. Class loader only B. Class loader and Java Interpreter
C. Class loader, Java Interpreter and API D. Java Interpreter only
ugcnetdec2019ii

35.0.490 UGCNET-Dec2019-II: 26 https://gateoverflow.in/360807

Which of the following CPU scheduling algorithms is/are supported by LINUX operating system?
A. Non-preemptive priority scheduling B. Preemptive priority scheduling and time sharing CPU scheduling
C. Time sharing scheduling only D. Priority scheduling only
ugcnetdec2019ii

35.0.491 UGCNET-Dec2019-II: 75 https://gateoverflow.in/360758

The following multithreaded algorithm computes transpose of a matrix in parallel:

p Trans (X, Y , N)
if N = 1
then Y [1, 1] ← X[1, 1]
else partition X into four (N /2) × (N /2) submatrices X11 , X12 , X21 , X22
partition Y into four (N /2) × (N /2) submatrices Y11 , Y12 , Y21 , Y22
spawn p Trans X11 , Y11 , N /2)
spawn p Trans X12 , Y12 , N /2)
spawn p Trans X21 , Y21 , N /2)
spawn p Trans X22 , Y22 , N /2)
What is the asymptotic parallelism of the algorithm?
A. T1 /T∞ or θ(N 2 / lg N) B. T1 /T∞ or θ(N / lg N)
C. T1 /T∞ or θ(lg N /N 2 ) D. T1 /T∞ or θ(lg N /N)
ugcnetdec2019ii

35.0.492 UGCNET-Dec2019-II: 73 https://gateoverflow.in/360760

Two concurrent executing transactions T1 and T2 are allowed to update same stock item say ′ A′ 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
ugcnetdec2019ii

35.0.493 UGCNET-Dec2019-II: 56 https://gateoverflow.in/360777

A network with bandwidth of 10 Mbps can pass only an average of 12, 000 frames per minute with each frame
carrying an average of 10, 000 bits. What is the throughput of this network?
A. 1, 000, 000 bps B. 2, 000, 000 bps
C. 12, 000, 000 bps D. 1, 200, 00, 000 bps
ugcnetdec2019ii

35.0.494 UGCNET-Dec2019-II: 42 https://gateoverflow.in/360791

The time complexity to multiply two polynomials of degree n using Fast Fourier transform method is:

A. θ(n lg n) B. θ(n2 ) C. θ(n) D. θ(lg n)

ugcnetdec2019ii

35.0.495 UGCNET-Dec2019-II: 20 https://gateoverflow.in/360813

Which of the component module of DBMS 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
ugcnetdec2019ii

35.0.496 UGCNET-Dec2019-II: 24 https://gateoverflow.in/360809

A counting semaphore is initialized to 8. 3 wait ( ) operations and 4 signal ( ) operations are applied. Find the current
value of semaphore variable.

A. 9 B. 5 C. 1 D. 4
ugcnetdec2019ii

35.0.497 UGCNET-Dec2019-II: 45 https://gateoverflow.in/360788

Consider the following grammar:

S → 0A ∣ 0BB
A → 00A ∣ λ
B → 1B ∣ 11C
C→B
Which language does this grammar generate?
 A. L((00)∗ 0 + (11)∗ 1) B. L(0(11)∗ + 1(00)∗ )
C. L((00)∗ 0) D. L(0(11)∗ 1)
ugcnetdec2019ii

35.0.498 UGCNET-Dec2019-II: 36 https://gateoverflow.in/360797

A clique in an undirected graph G = ⟨V , E⟩ is a subset V ′ ⊆ V of vertices, such that

A. If (u, v) ∈ E then u ∈ V ′ and v ∈ V ′

B. If (u, v) ∈ E then u ∈ V ′ or v ∈ V ′
C. Each pair of vertices in V ′ is connected by an edge
D. All pairs of vertices in V ′ are not connected by an edge

ugcnetdec2019ii

35.0.499 UGCNET-Dec2019-II: 44 https://gateoverflow.in/360789

Consider the language L = {an bn−3 ∣ n > 2} on Σ = {a, b} . Which one of the following grammars generates the
language L?

A. S → aA ∣ a, A → aAb ∣ b
B. S → aaA ∣ λ, A → aAb ∣ λ
C. S → aaaA ∣ a, A → aAb ∣ λ
D. S → aaaA, A → aAb ∣ λ

ugcnetdec2019ii

35.0.500 UGCNET-Dec2019-II: 43 https://gateoverflow.in/360790

Consider the following grammars:

G1 : S → aSb ∣ bSa ∣ aaG2 : S → aSb ∣ bSa ∣ SS ∣ λG3 : S → aSb ∣ bSa ∣ SS ∣ aG4 : S → aSb ∣ bSa ∣ SS ∣ SSS ∣ λ
Which of the following is correct w.r.t. the above grammars?
A. G1 and G3 are equivalent B. G2 and G3 are equivalent
C. G2 and G4 are equivalent D. G3 and G4 are equivalent
ugcnetdec2019ii

35.0.501 UGCNET-Dec2019-II: 41 https://gateoverflow.in/360792

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

ugcnetdec2019ii

35.0.502 UGCNET-Dec2019-II: 4 https://gateoverflow.in/360829

What are the greatest lower bound (GLB) and the least upper bound (LUB) of the sets A = {3, 9, 12} and
B = {1, 2, 4, 5, 10} if they exist in poset (z + , /) ?

A. A(GLB – 3, LUB – 36); B(GLB – 1, LUB – 20)

B. A(GLB – 3, LUB – 12); B(GLB – 1, LUB – 10)
C. A(GLB – 1, LUB – 36); B(GLB – 2, LUB – 20)
D. A(GLB – 1, LUB – 12); B(GLB – 2, LUB – 10)

ugcnetdec2019ii

35.0.503 UGCNET-Dec2019-II: 40 https://gateoverflow.in/360793

Consider a weighted directed graph. The current shortest distance from source S to node x is represented by d[x]. Let
d[v] = 29, d[u] = 15, w[u, v] = 12. What is the updated value of d[v] based on current information?

A. 29 B. 27 C. 25 D. 17
ugcnetdec2019ii

35.0.504 UGCNET-Dec2019-II: 39 https://gateoverflow.in/360794

Give asymptotic upper and lower bound for T(n) given below. Assume T(n) is constant for n ≤ 2 .
T(n) = 4T(√−
n) + lg2 n

A. T(n) = θ(lg(lg2 n) lg n)
B. T(n) = θ(lg2 n lg n)
C. T(n) = θ(lg2 n lg lg n)
D. T(n) = θ(lg(lg n) lg n)

ugcnetdec2019ii

35.0.505 UGCNET-Dec2019-II: 38 https://gateoverflow.in/360795

In a B-Tree, each node represents a disk block. Suppose one block holds 8192 bytes. Each key uses 32 bytes. In a B-
tree of order M there are M − 1 keys. Since each branch is on another disk block, we assume a branch is of 4 bytes.
The total memory requirement for a non-leaf node is
A. 32M − 32 B. 36M– 32
C. 36M– 36 D. 32M– 36
ugcnetdec2019ii

35.0.506 UGCNET-Dec2019-II: 37 https://gateoverflow.in/360796

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. θ(1), θ(n) B. θ(n), θ(1)
C. θ(1), θ(1) D. θ(n), θ(n)
ugcnetdec2019ii

35.0.507 UGCNET-Dec2019-II: 35 https://gateoverflow.in/360798

Let a2c mod n = (ac )2 mod n and a2c+1 mod n = a ⋅ (ac )2 mod n. For a = 7 , b = 17 and n = 561 , What is the
value of ab (mod n)?

A. 160 B. 166 C. 157 D. 67

ugcnetdec2019ii

35.0.508 UGCNET-Dec2019-II: 25 https://gateoverflow.in/360808

Which of the following is not needed by an encryption algorithm used in Cryptography?

A. KEY B. Message C. Ciphertext D. User details

ugcnetdec2019ii

35.0.509 UGCNET-Dec2019-II: 34 https://gateoverflow.in/360799

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
ugcnetdec2019ii

35.0.510 UGCNET-Dec2019-II: 2 https://gateoverflow.in/360831

Consider the following Linear programming problem (LPP):

Maximize z = x1 + x2
Subject to the constraints:
x1 + 2x2 ≤ 2000x1 + x2 ≤ 1500x2 ≤ 600and x1 , x2 ≥ 0
The solution of the above LPP is
A. x1 = 750, x2 = 750, z = 1500 B. x1 = 500, x2 = 1000, z = 1500
C. x1 = 1000, x2 = 500, z = 1500 D. x1 = 900, x2 = 600, z = 1500
ugcnetdec2019ii

35.0.511 UGCNET-Dec2019-II: 5 https://gateoverflow.in/360828

Let P be the set of all people. Let R be a binary relation on P such that (a, b) is in R if a is a brother of b. Is R
symmetric transitive, an equivalence relation, a partial order relation?
A. NO, NO, NO, NO B. NO, NO, YES, NO
C. NO, YES, NO, NO D. NO, YES, YES, NO
ugcnetdec2019ii

35.0.512 UGCNET-Dec2019-II: 72 https://gateoverflow.in/360761

Which of the following are legal statements in C programming language?

Choose the correct

a. b. c. d. option:

int *P=&44; int *P=&r; int P=&a; int P=a;

A. (a) and (b) B. (b) and (c) C. (b) and (d) D. (a) and (d)
ugcnetdec2019ii

35.0.513 UGCNET-Dec2019-II: 17 https://gateoverflow.in/360816

A rectangle is bound by the lines x = 0; y = 0; x = 5 and y = 3 . The line segment joining (−1, 0) and (4, 5), if
clipped against this window will connect the points __________.

A. (0, 1) and (3, 3) B. (0, 1) and (2, 3) C. (0, 1) and (4, 5) D. (0, 1) and (3, 5)
ugcnetdec2019ii

35.0.514 UGCNET-Dec2019-II: 71 https://gateoverflow.in/360762

Which of the following statements are true regarding C++?

a. Overloading gives the capability to an existing operator to operate
b. Inheritance in object oriented programming provides support to
on other data types reusability
c. When object of a derived class is defined, first the constructord.ofOverloading is a type of polymorphism
derived class is excecuted then constructor of a base class isChoose the correct option from those given below:
executed
A. (a) and (b) only B. (a), (b) and (c) only
C. (a), (b) and (d) only D. (b), (c) and (d) only
ugcnetdec2019ii

35.0.515 UGCNET-Dec2019-II: 48 https://gateoverflow.in/360785

Consider the following languages:

L1 = {an bn cm } ∪ {an bm cm }, n, m ≥ 0
L2 = {wwR ∣ w ∈ {a, b}∗} Where R represents reversible operation.
Which one of the following is (are) inherently ambiguous languages(s)?

A. Only L1 B. Only L2 C. both L1 and L2 D. neither L1 nor L2

ugcnetdec2019ii

35.0.516 UGCNET-Dec2019-II: 46 https://gateoverflow.in/360787

Consider ∑ = {w, x} and T = {x, y, z} . Define homomorphism h by:

 h(x) = xyz

h(w) = zxyy

If L is the regular language denoted by r = (w + x∗ )(ww)∗ , then the regular language h(L) is given by

A. (z x yy + x z y)(z x yy) B. (zxyy + (xzy)∗ ) (zxyy zxyy)

C. (zxyy + xzy)(zxyy)∗ D. (zxyy + (xzy)∗ ) (zxyy zxyy)
ugcnetdec2019ii

35.0.517 UGCNET-Dec2019-II: 90 https://gateoverflow.in/360743

The Data Encryption Standard (DES) has a function consists of four steps. Which of the following is correct order of
these four steps?

A. an expansion permutation, S -boxes, an XOR operation, a straight permutation

B. an expansion permutation, an XOR operation, S -boxes, a straight permutation
C. a straight permutation, S -boxes, an XOR operation, an expansion permutation
D. a straight permutation, an XOR operation, S -boxes, an expansion permutation

ugcnetdec2019ii

35.0.518 UGCNET-Dec2019-II: 11 https://gateoverflow.in/360822

A micro instruction format has microoperation field which is divided into 2 sunbfields F1 and F2 , each having 15
distinct microoperations, condition field CD for four status bits, branch field BR having four options used in
conjunction with address field AD. The address space is of 128 memory words. The size of micro instruction is:

A. 19 B. 18 C. 17 D. 20
ugcnetdec2019ii

35.0.519 UGCNET-Dec2019-II: 19 https://gateoverflow.in/360814

If we want to resize a 1024 × 768 pixels image to one that is 640 pixels wide with the same aspect ratio, what would
be the height of the resized image?

A. 420 Pixels B. 460 Pixels C. 480 Pixels D. 540 Pixels

ugcnetdec2019ii

35.0.520 UGCNET-Dec2019-II: 18 https://gateoverflow.in/360815

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
ugcnetdec2019ii

35.0.521 UGCNET-Dec2019-II: 16 https://gateoverflow.in/360817

Which tag is used to enclose any number of javascript statements in HTML document?
A. <code> B. <script>
C. <title> D. <body>
ugcnetdec2019ii

35.0.522 UGCNET-Dec2019-II: 7 https://gateoverflow.in/360826

A tree has 2n vertices of degree 1, 3n vertices of degree 2, n vertices of degree 3. Determine the number of vertices
and edges in tree.

A. 12, 11 B. 11, 12 C. 10, 11 D. 9, 10

ugcnetdec2019ii
35.0.523 UGCNET-Dec2019-II: 15 https://gateoverflow.in/360818

Let A be the base class in C++ and B be the derived class from A with protected inheritance. Which of the following
statement is false for class B?

A. Member function of class B can access protected data of class A

B. Member function of class B can access public data of class A
C. Member function of class B cannot access private data of class A
D. Object of derived class B can access public base class data

ugcnetdec2019ii

35.0.524 UGCNET-Dec2019-II: 14 https://gateoverflow.in/360819

What is the output of the following C 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. 6 B. 5 C. 4 D. 3

ugcnetdec2019ii

35.0.525 UGCNET-Dec2019-II: 13 https://gateoverflow.in/360820

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.

Location Instruction
010 CLA
011 ADD 016
012 BUN 014
013 HLT
014 AND 017
015 BUN 013
016 C1A5
017 93C6

A. A1B4 B. 81B4 C. A184 D. 8184

ugcnetdec2019ii

35.0.526 UGCNET-Dec2019-II: 12 https://gateoverflow.in/360821

Given following equation:

(142)b + (112)b−2 = (75)8 , find base b.

A. 3 B. 6 C. 7 D. 5
ugcnetdec2019ii

35.0.527 UGCNET-Dec2019-II: 10 https://gateoverflow.in/360823

A computer uses a memory unit of 512 K words of 32 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 256 registers and an address part. How many bits are
there in addressing mode part, opcode part, register code part and the address part?

A. 1, 3, 9, 19 B. 1, 4, 9, 18 C. 1, 4, 8, 19 D. 1, 3, 8, 20
ugcnetdec2019ii

35.0.528 UGCNET-Dec2019-II: 21 https://gateoverflow.in/360812

Given two tables R1(x, y) and R2(y, z) with 50 and 30 number of tuples respectively. Find maximum number of
tuples in the output of natural join between tables R1 and R2 i.e. R1 ∗ R2? ( ∗- Natural Join)

A. 30 B. 20 C. 50 D. 1500
ugcnetdec2019ii

35.0.529 UGCNET-Dec2019-II: 8 https://gateoverflow.in/360825

How many reflexive relations are there on a set with 4 elements?

A. 24 B. 212 C. 42 D. 2
ugcnetdec2019ii

35.0.530 UGCNET-Dec2019-II: 55 https://gateoverflow.in/360778

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

ugcnetdec2019ii

35.0.531 UGCNET-Dec2019-II: 33 https://gateoverflow.in/360800

In a system for a restaurant, the main scenario for placing order is given below:

a. Customer reads menu b. Customer places order c. Order is sent to kitchen d.

forOrdered
preparation
items are served
e. Customer requests for a bill for the orde

f. Bill is prepared for this g.

order
Customer is given the bill
h. 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. 3 B. 4 C. 5 D. 6
ugcnetdec2019ii

35.0.532 UGCNET-Dec2019-II: 68 https://gateoverflow.in/360765

The Reduced Instruction Set Computer (RISC) characteristics are:

a. Single cycle instructionb.execution

Variable length instruction
c. Instructions
formats that manipulates
d. Efficient
operands
instruction
in memory Choose
pipeline the correct
characteristics from the
options given below:

A. (a) and (b) B. (b) and (c) C. (a) and (d) D. (c) and (d)
ugcnetdec2019ii

35.0.533 UGCNET-Dec2019-II: 62 https://gateoverflow.in/360771

A fuzzy conjuction operators, t(x, y), and a fuzzy disjunction operator, s(x, y), form a pair if they satisfy:
t(x, y) = 1 − s(1 − x, 1 − y).
xy
If t(x, y) = then s(x, y) is given by
(x + y − xy)
x+y x + y − 2xy x + y − xy x + y − xy
A. B. C. D.
1 − xy 1 − xy 1 − xy 1 + xy
ugcnetdec2019ii
35.0.534 UGCNET-Dec2007-II: 43 https://gateoverflow.in/335741

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
ugcnetdec2007ii

35.0.535 UGCNET-Dec2019-II: 65 https://gateoverflow.in/360768

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, x, is given by
f(x)
Sf(x) = where f(x) = x2
Σf(x)
The population is given by P where:
P = {(01101, (11000), (01000), (10011)}
The strength of fitness of chromosome (11000) is ________

A. 24 B. 576 C. 14.4 D. 49.2

ugcnetdec2019ii

35.0.536 UGCNET-Dec2019-II: 66 https://gateoverflow.in/360767

Consider the following statements:

S1 : If a group (G, ∗) is of order n, and a ∈ G is such that am = e for some integer m ≤ n, then m must divide n.
S2 : If a group (G, ∗) is of even order, then there must be an element a ∈ G such that a ≠ e and a ∗ a = e .
Which of the statements is (are) correct?

A. Only S1 B. Only S2 C. Both S1 and S2 D. Neither S1 and S2

ugcnetdec2019ii

35.0.537 UGCNET-Dec2019-II: 57 https://gateoverflow.in/360776

The full form of ICANN 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

ugcnetdec2019ii

35.0.538 UGCNET-Dec2019-II: 58 https://gateoverflow.in/360775

According to Dempster-Shafer theory for uncertainity management,

A. Bel(A) + Bel(¬A) ≤ 1 B. Bel(A) + Bel(¬A) ≥ 1
C. Bel(A) + Bel(¬A) = 1 D. Bel(A) + Bel(¬A) = 0
Where Bel(A) denotes Belief of event A.

ugcnetdec2019ii

35.0.539 UGCNET-June2005-II: 40 https://gateoverflow.in/335423

Which of the following is not an Unix Command?

A. Whoami B. wc C. Is D. put
ugcnetjune2005ii
35.0.540 UGCNET-Dec2019-I: 47 https://gateoverflow.in/360685

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
ugcnetdec2019i

35.0.541 UGCNET-June2007-II: 20 https://gateoverflow.in/335713

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.

ugcnetjune2007ii

35.0.542 UGCNET-Dec2019-I: 45 https://gateoverflow.in/360687

Rashtriya Uchhatar Shiksha Abhiyan (RUSA) aims to achieve the following in Higher Education System:

a. Equity b. Access
c. 50% GER d. Excellence
Choose the correct option from those given below:
A. a, b and c B. a, c and d
C. a, b and d D. b, c and d
ugcnetdec2019i

35.0.543 UGCNET-Dec2019-I: 46 https://gateoverflow.in/360686

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
ugcnetdec2019i

35.0.544 UGCNET-Dec2019-I: 44 https://gateoverflow.in/360688

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

ugcnetdec2019i

35.0.545 UGCNET-June2007-II: 22 https://gateoverflow.in/335711

Pre order is also known as:

A. Depth first order B. Breadth first order
C. Topological order D. Linear order
ugcnetjune2007ii

35.0.546 UGCNET-Dec2019-I: 48 https://gateoverflow.in/360684

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
ugcnetdec2019i

35.0.547 UGCNET-Dec2019-II: 63 https://gateoverflow.in/360770

Let Wij represents weight between node i at layer k and node j at layer (k − 1) of a given multilayer perceptron. The
weight updation using gradient descent method is given by

∂E
A. Wij (t + 1) = Wij (t) + α ,0 ≤ α ≤ 1
∂Wij
∂E
B. Wij (t + 1) = Wij (t) − α ,0 ≤ α ≤ 1
∂Wij
∂E
C. Wij (t + 1) = α ,0 ≤ α ≤ 1
∂Wij
∂E
D. Wij (t + 1) =– α ,0 ≤ α ≤ 1
∂Wij

Where α and E represents learning rate and Error in the output respectively.

ugcnetdec2019ii
35.0.548 UGCNET-Dec2019-II: 64 https://gateoverflow.in/360769

The order of schema ?10?101? and ???0??1 are _______ and _______ respectively.

A. 5, 3 B. 5, 2 C. 7, 5 D. 8, 7
ugcnetdec2019ii

35.0.549 UGCNET-Dec2007-II: 10 https://gateoverflow.in/335774

Amongst the logic families DTL, TTL, ECL and CMOS , the family with the least power dissipation is :

A. CMOS B. DT L C. T T L D. ECL

ugcnetdec2007ii

35.0.550 UGCNET-Dec2019-I: 49 https://gateoverflow.in/360683

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
ugcnetdec2019i

35.0.551 UGCNET-Dec2007-II: 24 https://gateoverflow.in/335760

An example of a file extension is :

A. text B. pict C. mp3 D. web

ugcnetdec2007ii

35.0.552 UGCNET-Dec2007-II: 18 https://gateoverflow.in/335766

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

ugcnetdec2007ii

35.0.553 UGCNET-Dec2019-II: 60 https://gateoverflow.in/360773

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. 14 B. 17 C. 111 D. 112
ugcnetdec2019ii

35.0.554 UGCNET-Dec2019-II: 61 https://gateoverflow.in/360772

Consider the following models:

M1 : Mamdani model
M2 : Takagi – Sugeno – Kang model
M3 : Kosko’s additive model (SAM)
Which of the following option contains examples of additive rule model?

A. Only M1 and M2 B. Only M2 and M3 C. Only M1 and M3 D. M1 , M2 and M3

ugcnetdec2019ii

35.0.555 UGCNET-Dec2019-II: 59 https://gateoverflow.in/360774

Consider the following statements:

S1 : ∀xP (x) ∨ ∀xQ(x) and ∀x(P (x) ∨ Q(x)) are not logically equivalent.
S2 : ∃xP (x) ∧ ∃xQ(x) and ∃x(P (x) ∧ Q(x)) are not logically equivalent
Which of the following statements is/are correct?

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

ugcnetdec2019ii

35.0.556 UGCNET-Dec2007-II: 6 https://gateoverflow.in/335778

A WFF that is equivalent to the WFF x => y is :

A. y => x B. ~y => x C. ~y => ~x D. y => ~x

ugcnetdec2007ii

35.0.557 UGCNET-Dec2019-I: 50 https://gateoverflow.in/360682

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
ugcnetdec2019i

35.0.558 UGCNET-Dec2005-II: 2 https://gateoverflow.in/335506

If the proposition 7P ⇒ Q is true, then the truth value of the proportion 7P V (P ⇒ Q) is :

A. True B. Multi – Valued

C. False D. Can not determined
ugcnetdec2005ii

35.0.559 UGCNET-Dec2007-II: 9 https://gateoverflow.in/335775

The dual of the switching function F = x + yz is given by :

A. x+yz B. x(y+z) C. (~x)+(~y)(~z) D. (~x)((~y)+(~z))

ugcnetdec2007ii

35.1 Acid Properties (1)

35.1.1 Acid Properties: UGCNET-dec2009-ii-45 https://gateoverflow.in/152940

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
ugcnetdec2009ii databases acid-properties

35.2 Artificial Intelligence (1)

35.2.1 Artificial Intelligence: UGCNET-AUG2016-III: 71 https://gateoverflow.in/71697

Match each Artificial Intelligence term in List-I that best describes a given situation in List-II :
List-I List-II
I. Semantic Network
a. Knowledge about what to do as
opposed to how to do it
II. Frame b. A premise of rule that is not concluded
by any rule
III. Declarative Knowledge c. A method of knowledge representation that
uses a graph
IV. Primitive d. A data structure representing stereotypical
knowledge
Codes :
A. I-d, II-a, III-b, IV-c B. I-d, II-c, III-a, IV-b
C. I-d, II-c, III-b, IV-a D. I-c, II-d, III-a, IV-b
ugcnetaug2016iii artificial-intelligence

35.3 Assembly (1)

 35.3.1 Assembly: UGCNET-June2011-II: 34 https://gateoverflow.in/65521

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
ugcnetjune2011ii co-and-architecture microprocessors assembly

35.4 Binary Codes (1)

35.4.1 Binary Codes: UGCNET-Jan2017-III: 65 https://gateoverflow.in/335173

A t-error correcting q-nary linear code satisfy :

M ∑ti=0 ( ni )(q − 1)i ≤ X
Where M is the number of code words and X is

A. q n B. q t C. q −n D. q −t
ugcnetjan2017iii binary-codes

35.5 Binary Tree (1)

35.5.1 Binary Tree: UGCNET-June2011-II: 22 https://gateoverflow.in/64575

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
ugcnetjune2011ii algorithms binary-tree

35.6 Boolean Algebra (1)

35.6.1 Boolean Algebra: UGCNET-Dec2019-II: 3 https://gateoverflow.in/360830

¯¯¯¯
The Boolean expression AB + A¯B
¯¯¯
+ AC + AC is unaffected by the value of the Boolean variable _________.

A. A B. B C. C D. A, B and C
ugcnetdec2019ii digital-logic boolean-algebra

35.7 Compilation Phases (1)

35.7.1 Compilation Phases: UGCNET-Dec2010-II: 33 https://gateoverflow.in/66909

Grammar of the programming is checked at ________ phase of compiler.

A. Semantic analysis B. Code generation
C. Syntax analysis D. Code optimization
ugcnetdec2010ii compiler-design compilation-phases

35.8 Crypt Arithmetic (1)

35.8.1 Crypt Arithmetic: UGCNET-Sep2013-III: 3 https://gateoverflow.in/59503

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
ugcnetsep2013iii cryptography crypt-arithmetic

35.9 Data Compression (1)

35.9.1 Data Compression: UGCNET-June2015-III: 65 https://gateoverflow.in/61457

The redundancy in images stems from

A. pixel decolleration B. pixel colleration
C. pixel quantization D. image size
ugcnetjune2015iii data-compression digital-image-processing

35.10 Data Flow Diagram (1)

35.10.1 Data Flow Diagram: UGCNET-June2011-II: 43 https://gateoverflow.in/65604

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
ugcnetjune2011ii is&software-engineering data-flow-diagram

35.11 Data Mart (1)

35.11.1 Data Mart: UGCNET-Dec2010-II: 46 https://gateoverflow.in/67045

A data mart may contain

A. Summarised data B. De-normalized data
C. Aggregate departmental data D. All of the above
ugcnetdec2010ii data-warehousing data-mart

35.12 Data Mining (4)

35.12.1 Data Mining: UGCNET-AUG2016-II: 48 https://gateoverflow.in/70373

In Data mining, classification rules are extracted from _______.

A. Data B. Information C. Decision Tree D. Database

ugcnetaug2016ii data-mining

35.12.2 Data Mining: UGCNET-AUG2016-II: 50 https://gateoverflow.in/70378

In Data mining, ______ is a method of incremental conceptual clustering.

A. STRING B. COBWEB C. CORBA D. OLAD

ugcnetaug2016ii data-mining

35.12.3 Data Mining: UGCNET-Dec2010-II: 47 https://gateoverflow.in/67046

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

ugcnetdec2010ii databases data-mining

35.12.4 Data Mining: UGCNET-Dec2011-II: 47 https://gateoverflow.in/64188

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.
ugcnetdec2011ii data-mining

35.13 Data Structures (1)

35.13.1 Data Structures: UGCNET-Dec2011-II: 1 https://gateoverflow.in/62937

Which of the following data structure is Non-linear type ?

A. Strings B. Lists C. Stacks D. None of the above

ugcnetdec2011ii data-structures

35.14 Data Warehousing (2)

35.14.1 Data Warehousing: UGCNET-AUG2016-II: 47 https://gateoverflow.in/70369

_______ 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
ugcnetaug2016ii data-warehousing

35.14.2 Data Warehousing: UGCNET-June2011-II: 46 https://gateoverflow.in/65610

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
ugcnetjune2011ii data-warehousing

35.15 Decomposition (1)

35.15.1 Decomposition: UGCNET-June2011-II: 20 https://gateoverflow.in/64571

Decomposition help in eliminating some of the problems of bad design

A. Redundancy B. Inconsistencies
C. Anomalies D. All of the above
ugcnetjune2011ii databases decomposition

35.16 Digital Image Processing (3)

35.16.1 Digital Image Processing: UGCNET-AUG2016-III: 60 https://gateoverflow.in/71618

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

ugcnetaug2016iii digital-image-processing

35.16.2 Digital Image Processing: UGCNET-Dec2013-III: 31 https://gateoverflow.in/60558

Consider the formula in image processing RD = 1 − C1 where CR = nn12 . CR is called as compression ratio n1
R
and n2 denotes the number of information carrying units in two datasets that represent the same information. In this
situation RD is called as relative ____ of the first data set.
A. Data Compression B. Data Redundancy
C. Data Relation D. Data Representation
ugcnetdec2013iii digital-image-processing

35.16.3 Digital Image Processing: UGCNET-June2012-III: 22 https://gateoverflow.in/56219

The transform which possess the highest ‘energy compaction’ property is

A. Slant transform B. Cosine transform
C. Fourier transform D. Karhunen-Loeve transform
ugcnetjune2012iii digital-image-processing
35.17 Disk Scheduling (1)

35.17.1 Disk Scheduling: UGCNET-June2011-II: 23 https://gateoverflow.in/64577

The number of disk accesses performed by insertion operation in B-tree of height h is

A. 0(1) B. 0(1gh) C. 0(h) D. None of these

ugcnetjune2011ii operating-system disk-scheduling

35.18 Disks (1)

35.18.1 Disks: UGCNET-June2011-II: 36 https://gateoverflow.in/65524

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
ugcnetjune2011ii operating-system disks

35.19 Duality (1)

35.19.1 Duality: UGCNET-AUG2016-III: 62 https://gateoverflow.in/71655

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)
ugcnetaug2016iii linear-programming duality

35.20 E Commerce (2)

35.20.1 E Commerce: UGCNET-AUG2016-II: 49 https://gateoverflow.in/70374

Discovery of cross sales opportunities is called as _____.

A. Association B. Visualization C. Correlation D. Segmentation

ugcnetaug2016ii e-technologies e-commerce

35.20.2 E Commerce: UGCNET-June2011-II: 50 https://gateoverflow.in/65619

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
ugcnetjune2011ii e-technologies e-commerce

35.21 E Payment (1)

35.21.1 E Payment: UGCNET-June2011-II: 49 https://gateoverflow.in/65616

The principal electronic payment systems for electronic commerce is

A. Credit Card B. Digital Wallet
C. Electronic Cheque D. All of the above
ugcnetjune2011ii e-technologies e-payment

35.22 E Technologies (3)

35.22.1 E Technologies: UGCNET-Dec2010-II: 48 https://gateoverflow.in/67358

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

ugcnetdec2010ii e-technologies

35.22.2 E Technologies: UGCNET-Dec2011-II: 7 https://gateoverflow.in/63069

BCC in the internet refers to

A. Black carbon copy B. Blind carbon copy
C. Blank carbon copy D. Beautiful carbon copy
ugcnetdec2011ii e-technologies

35.22.3 E Technologies: UGCNET-June2011-II: 48 https://gateoverflow.in/65613

"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

ugcnetjune2011ii e-technologies

35.23 Encryption Decryption (2)

35.23.1 Encryption Decryption: UGCNET-Sep2013-II: 3 https://gateoverflow.in/59008

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

35.23.2 Encryption Decryption: UGCNET-Sep2013-III: 57 https://gateoverflow.in/59927

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
ugcnetsep2013iii cryptography encryption-decryption

35.24 Enterprise Resource Planning (2)

35.24.1 Enterprise Resource Planning: UGCNET-Dec2011-II: 44 https://gateoverflow.in/64182

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.

ugcnetdec2011ii mis enterprise-resource-planning (erp)

35.24.2 Enterprise Resource Planning: UGCNET-Dec2011-II: 45 https://gateoverflow.in/64183

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.
 ugcnetdec2011ii mis enterprise-resource-planning (erp)

35.25 Er Diagram (1)

35.25.1 Er Diagram: UGCNET-AUG2016-II: 19 https://gateoverflow.in/69557

Consider the following Entity-Relationship (E − R) diagram and three possible relationship sets (I, IIandIII) for
this E − R diagram:

If different symbols stand for different values (e.g., t1 is definitely not equal to t2 ), then which of the above could not be the
relationship set for the E − R diagram ?

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

ugcnetaug2016ii databases er-diagram

35.26 File System (1)

35.26.1 File System: UGCNET-June2011-II: 37 https://gateoverflow.in/65526

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
ugcnetjune2011ii operating-system file-system

35.27 Fuzzy Logic (2)

35.27.1 Fuzzy Logic: UGCNET-AUG2016-III: 64 https://gateoverflow.in/71657

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

ugcnetaug2016iii neural-network fuzzy-logic

35.27.2 Fuzzy Logic: UGCNET-Sep2013-III: 26 https://gateoverflow.in/59846

x1 x2 x3 x4
Let A be a set of comfortable houses given as A = {{ 0.8 , 0.9 , 0.1 , 0.7 }}and be the set of affordable houses
x1 x2 x3 x4
B = {{ 0.9 , 0.8 , 0.6 , 0.2 }Then
} the set of comfortable and affordable houses is
x1 x2 x3 x4
A. {{ 0.8 , 0.8 , 0.1 , 0.2 }}
x1 x2 x3 x4
B. {{ 0.9 , 0.9 , 0.6 , 0.7 }}
x1 x2 x3 x4
C. {{ 0.8 , 0.8 , 0.6 , 0.7 }}
x1 x2 x3 x4
D. {{ 0.7 , 0.7 , 0.7 , 0.9 }}

ugcnetsep2013iii neural-network fuzzy-logic

35.28 Fuzzy Relations (1)

35.28.1 Fuzzy Relations: UGCNET-AUG2016-III: 66 https://gateoverflow.in/71664

Let R and S be two fuzzy relations defined as

 and
Then, the resulting relation, T , which relates elements of universe of X to elements of universe of Z using max-product
composition is given by

A. B. C. D.

ugcnetaug2016iii neural-network fuzzy-relations

35.29 Fuzzy Sets (2)

35.29.1 Fuzzy Sets: UGCNET-Dec2013-III: 28 https://gateoverflow.in/60552

If A and B are two fuzzy sets with membership functions

μA (x) = {0.2, 0.5, 0.6, 0.1, 0.9}
μB (x) = {0.1, 0.5, 0.2, 0.7, 0.8}
Then the value of μA∩B will be

A. {0.2, 0.5, 0.6, 0.7, 0.9} B. {0.2, 0.5, 0.2, 0.1, 0.8}
C. {0.1, 0.5, 0.6, 0.1, 0.8} D. {0.1, 0.5, 0.2, 0.1, 0.8}
ugcnetdec2013iii fuzzy-sets

35.29.2 Fuzzy Sets: UGCNET-Dec2013-III: 29 https://gateoverflow.in/60553

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

ugcnetdec2013iii fuzzy-sets

35.30 General Awareness (33)

35.30.1 General Awareness: UGCNET-June-2019-I-1 https://gateoverflow.in/316178

To organize discussion method in teaching effectively, which of the following conditions should be met?

a. Topic be easy b. Topic be declared in advance

c. Topic of common interest
d. Availability of more than
e. one
Language
teacherfacility of participants
Select appropriate answer from the options given below:

A. b, c, and e B. a, b, and c C. a, b and e D. c, d and e

ugcnetjune2019-i general-awareness

35.30.2 General Awareness: UGCNET-June-2019-I-10 https://gateoverflow.in/316169

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
ugcnetjune2019-i general-awareness

35.30.3 General Awareness: UGCNET-June-2019-I-11 https://gateoverflow.in/316168

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

ugcnetjune2019-i general-awareness passage-reading

35.30.4 General Awareness: UGCNET-June-2019-I-12 https://gateoverflow.in/316167

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
ugcnetjune2019-i general-awareness passage-reading

35.30.5 General Awareness: UGCNET-June-2019-I-13 https://gateoverflow.in/316166

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

ugcnetjune2019-i general-awareness passage-reading

35.30.6 General Awareness: UGCNET-June-2019-I-14 https://gateoverflow.in/316165

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 DNA 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

ugcnetjune2019-i general-awareness passage-reading

35.30.7 General Awareness: UGCNET-June-2019-I-15 https://gateoverflow.in/316164

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

ugcnetjune2019-i general-awareness passage-reading

35.30.8 General Awareness: UGCNET-June-2019-I-16 https://gateoverflow.in/316163

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
ugcnetjune2019-i general-awareness

35.30.9 General Awareness: UGCNET-June-2019-I-17 https://gateoverflow.in/316162

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

ugcnetjune2019-i general-awareness

35.30.10 General Awareness: UGCNET-June-2019-I-18 https://gateoverflow.in/316161

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

ugcnetjune2019-i general-awareness

35.30.11 General Awareness: UGCNET-June-2019-I-19 https://gateoverflow.in/316160

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
ugcnetjune2019-i general-awareness

35.30.12 General Awareness: UGCNET-June-2019-I-2 https://gateoverflow.in/316177

Who developed the theory of ‘Multiple Intelligence’?

A. Alfred Binet B. L. Thurstone
C. Charles Spearman D. Howard Gardner
ugcnetjune2019-i general-awareness

35.30.13 General Awareness: UGCNET-June-2019-I-3 https://gateoverflow.in/316176

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
ugcnetjune2019-i general-awareness

35.30.14 General Awareness: UGCNET-June-2019-I-36 https://gateoverflow.in/316143

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

 ugcnetjune2019-i general-awareness

35.30.15 General Awareness: UGCNET-June-2019-I-37 https://gateoverflow.in/316142

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

ugcnetjune2019-i general-awareness

35.30.16 General Awareness: UGCNET-June-2019-I-38 https://gateoverflow.in/316141

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
ugcnetjune2019-i general-awareness

35.30.17 General Awareness: UGCNET-June-2019-I-39 https://gateoverflow.in/316140

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

ugcnetjune2019-i general-awareness

35.30.18 General Awareness: UGCNET-June-2019-I-4 https://gateoverflow.in/316175

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

ugcnetjune2019-i general-awareness

35.30.19 General Awareness: UGCNET-June-2019-I-40 https://gateoverflow.in/316139

Which one of the following pairs LEAST matches in respect of computers?

A. 1 Giga Byte : (1024) × (1024) × (1024) × 8 bits

B. CRT : Cathode Ray Tube
C. ROM : Rapid Online Memory
D. CPU : Central Processing Unit

ugcnetjune2019-i general-awareness

35.30.20 General Awareness: UGCNET-June-2019-I-41 https://gateoverflow.in/316138

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
ugcnetjune2019-i general-awareness

35.30.21 General Awareness: UGCNET-June-2019-I-42 https://gateoverflow.in/316137

Which of the following are priority areas in relation to the Sustainable Development Goals?
 A. No poverty B. Zero hunger Choose
C. Reducing urbanization D. Peace, justice and strong institutions the correct
answer from the options
given below :

A. a, b, c B. a, c, d C. b, c, d D. a, b, d
ugcnetjune2019-i general-awareness

35.30.22 General Awareness: UGCNET-June-2019-I-43 https://gateoverflow.in/316136

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

ugcnetjune2019-i general-awareness

35.30.23 General Awareness: UGCNET-June-2019-I-44 https://gateoverflow.in/316135

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

ugcnetjune2019-i general-awareness

35.30.24 General Awareness: UGCNET-June-2019-I-45 https://gateoverflow.in/316134

Algal blooms in oligotrophic lakes are

A. very frequent B. frequent C. very rare D. widespread

ugcnetjune2019-i general-awareness

35.30.25 General Awareness: UGCNET-June-2019-I-46 https://gateoverflow.in/316133

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
ugcnetjune2019-i general general-awareness

35.30.26 General Awareness: UGCNET-June-2019-I-47 https://gateoverflow.in/316132

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
ugcnetjune2019-i general-awareness

35.30.27 General Awareness: UGCNET-June-2019-I-49 https://gateoverflow.in/316130

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
ugcnetjune2019-i general-awareness

35.30.28 General Awareness: UGCNET-June-2019-I-5 https://gateoverflow.in/316174

Which among the following best describes the Emotional Intelligence of learners?

a. Understand the emotionb.ofExpress

other people
oneself
andvery
yourstrongly
own
c. Being rational in thinking
d. Adjusting one’s emotione.asBeing
per situation
creative and open to criticism
Choose
f. Accepting other people as they are your answer from the options given below :

A. a, d, and f B. d, e and f C. a, b, and c D. b, c and d

ugcnetjune2019-i general-awareness

35.30.29 General Awareness: UGCNET-June-2019-I-50 https://gateoverflow.in/316129

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
ugcnetjune2019-i general-awareness

35.30.30 General Awareness: UGCNET-June-2019-I-6 https://gateoverflow.in/316173

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
ugcnetjune2019-i general-awareness

35.30.31 General Awareness: UGCNET-June-2019-I-7 https://gateoverflow.in/316172

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

ugcnetjune2019-i general-awareness

35.30.32 General Awareness: UGCNET-June-2019-I-8 https://gateoverflow.in/316171

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
ugcnetjune2019-i general-awareness

35.30.33 General Awareness: UGCNET-June-2019-I-9 https://gateoverflow.in/316170

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

ugcnetjune2019-i general-awareness

35.31 Geographical Information System (1)

35.31.1 Geographical Information System: UGCNET-Dec2011-II: 46 https://gateoverflow.in/64186

To compare, overlay or cross analyze to maps in GIS .

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
ugcnetdec2011ii e-technologies geographical-information-system

35.32 Hard Disk Drive (1)

35.32.1 Hard Disk Drive: UGCNET-Dec2011-II: 29 https://gateoverflow.in/63890

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
ugcnetdec2011ii operating-system system hard-disk-drive

35.33 Hashing (3)

35.33.1 Hashing: UGCNET-Dec2010-II: 24 https://gateoverflow.in/66824

Linear probing suffers from a problem known as

A. Secondary clustering B. Primary clustering
C. Both (A) and (B) D. None of these
ugcnetdec2010ii data-structures hashing

35.33.2 Hashing: UGCNET-Dec2011-II: 6 https://gateoverflow.in/63068

A hash table has space for 75 records, then the probability of collision before the table is 6% full.

A. .25 B. .20 C. .35 D. .30

ugcnetdec2011ii data-structures hashing

35.33.3 Hashing: UGCNET-June2011-II: 24 https://gateoverflow.in/64710

(√5−1
Consider a hash table of size m = 10000 and the hash function h(k) = ⌊m(KA mod 1)′ ⌋ for A = 2 . The
location to the key k = 123456 is

A. 46 B. 47 C. 41 D. 43
ugcnetjune2011ii data-structures hashing

35.34 Image Compression (1)

35.34.1 Image Compression: UGCNET-AUG2016-III: 58 https://gateoverflow.in/71615

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
ugcnetaug2016iii digital-image-processing image-compression
35.35 Information System (1)

35.35.1 Information System: UGCNET-Dec2015-III: 48 https://gateoverflow.in/62701

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
ugcnetdec2015iii information-system

35.36 Interpreter (1)

35.36.1 Interpreter: UGCNET-June2011-II: 14 https://gateoverflow.in/64363

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
ugcnetjune2011ii compiler-design interpreter

35.37 Is&software Engineering (1)

35.37.1 Is&software Engineering: UGCNET-June2011-II: 41 https://gateoverflow.in/65600

Which one of the items listed below is not one of the software engineering layers ?

A. Process B. Manufacturing C. Method D. Tools

ugcnetjune2011ii is&software-engineering

35.38 Java (1)

35.38.1 Java: UGCNET-June2011-II: 15 https://gateoverflow.in/64364

Portable program means

A. Program with wheels B. Independent from its authors
C. Independent of platform D. None of the above
ugcnetjune2011ii programming java

35.39 Job (1)

35.39.1 Job: UGCNET-June2011-II: 32 https://gateoverflow.in/65516

A special software that is used to create a job queue is called

A. Drive B. Spooler C. Interpreter D. Linkage editor

ugcnetjune2011ii operating-system job

35.40 Linear Programming (3)

35.40.1 Linear Programming: UGCNET-AUG2016-III: 61 https://gateoverflow.in/71638

Consider the following linear programming problem :

max. z = 0.50x2 – 0.10x1
Subject to the constraints
2x1 + 5x2 ≤ 80
x1 + x2 ≤ 20
and x1 , x2 ≥ 0
The total maximum profit (z) for the above problem is :

A. 6 B. 8 C. 10 D. 12
ugcnetaug2016iii linear-programming
 35.40.2 Linear Programming: UGCNET-Jan2017-III: 70 https://gateoverflow.in/335168

Consider the following LPP:

Min.Z = x1 + x2 + x3
Subject to 3x1 + 4x3 ≤ 5
5x1 + x2 + 6x3 = 7
8x1 + 9x3 ≥ 2,
x1 , x2 , x3 ≥ 0
The standard form of this LPP shall be:

Min.Z = x1 + x2 + x3 + 0x4 + 0x5

Subject to 3x1 + 4x3 + x4 = 5;
A. 5x1 + x2 + 6x3 = 7;
8x1 + 9x3 − x5 = 2;
x1 , x2 , x3 , x4 , x5 ≥ 0
Min.Z = x1 + x2 + x3 + 0x4 + 0x5 − 1(x6 ) − 1(x7 )
Subject to 3x1 + 4x3 + x4 = 5;
B. 5x1 + x2 + 6x3 + x6 = 7;
8x1 + 9x3 − x5 + x7 = 2;
x1 to x7 ≥ 0
Min.Z = x1 + x2 + x3 + 0x4 + 0x5 + 0x6
Subject to 3x1 + 4x3 + x4 = 5;
C. 5x1 + x2 + 6x3 = 7;
8x1 + 9x3 − x5 + x6 = 2;
x1 to x6 ≥ 0
Min.Z = x1 + x2 + x3 + 0x4 + 0x5 + 0x6 + 0x7
Subject to 3x1 + 4x3 + x4 = 5;
D. 5x1 + x2 + 6x3 + x6 = 7
8x1 + 9x3 − x5 + x7 = 2;
x1 to x7 ≥ 0

ugcnetjan2017iii linear-programming

35.40.3 Linear Programming: UGCNET-June2013-III: 23 https://gateoverflow.in/58292

At any iteration of simplex method if Δj(Zj– Cj) corresponding to any non-basic variable Xj is obtained as zero, the
solution under the test is
A. Degenerate solution B. Unbounded solution
C. Alternative solution D. Optimal solution
ugcnetjune2013iii linear-programming

35.41 Linker (2)

35.41.1 Linker: UGCNET-June2011-II: 31 https://gateoverflow.in/65515

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

ugcnetjune2011ii operating-system linker

35.41.2 Linker: UGCNET-June2011-II: 35 https://gateoverflow.in/65522

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
ugcnetjune2011ii operating-system linker
35.42 Linux (1)

35.42.1 Linux: UGCNET-June2011-II: 40 https://gateoverflow.in/65530

Which command allows you to view your file 24 lines at a time ?

A. More B. Cat C. Pg D. None of the above

ugcnetjune2011ii unix linux

35.43 Management Information System (2)

35.43.1 Management Information System: UGCNET-June2011-II: 45 https://gateoverflow.in/65609

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
ugcnetjune2011ii management-information-system

35.43.2 Management Information System: UGCNET-June2015-III: 55 https://gateoverflow.in/61334

Match the following :

List-I List-II
(a) Intelligence (i) Contextual, tacit, transfer needs learning
(b) Knowledge (ii) Scattered facts, easily transferrable
(c) Information (iii) Judgemental
(d) Data (iv) Codifiable, endorsed with relevence and purpose
Codes :
A. (a)-(iii), (b)-(ii), (c)-(iv), (d)-(i) B. (a)-(iii), (b)-(i), (c)-(iv), (d)-(ii)
C. (a)-(i), (b)-(ii), (c)-(iii), (d)-(iv) D. (a)-(i), (b)-(iii), (c)-(iv), (d)-(ii)
ugcnetjune2015iii management-information-system

35.44 Microprocessors (2)

35.44.1 Microprocessors: UGCNET-June2014-III: 45 https://gateoverflow.in/57022

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 I /O devices.
D. None of the above.

ugcnetjune2014iii microprocessors

35.44.2 Microprocessors: UGCNET-Nov2017-III: 06 https://gateoverflow.in/222866

A micro-instruction format has micro-ops field which is divided into three subfields F1, F2, F3 each having seven
distinct micro operations, condition field CD for four status bits, branch field BR having four options used in
conjunction with address field ADF. The address space is of 128 memory locations. The size of micro-instruction is :

(1) 17 bits (2) 20 bits (3) 24 bits (4) 32 bits

microprocessors

35.45 Minimum Spanning Trees (1)

35.45.1 Minimum Spanning Trees: UGCNET-Dec2019-II: 6 https://gateoverflow.in/360827

The weight of minimum spanning tree in graph G, calculated using Kruskal’s algorithm is:
 A. 14 B. 15 C. 17 D. 18
ugcnetdec2019ii algorithms minimum-spanning-trees

35.46 Mis (1)

35.46.1 Mis: UGCNET-Dec2010-II: 49 https://gateoverflow.in/67359

The basic concepts of ethics in information society is/are

A. Responsibility B. Accountability
C. Liability D. All of the above
ugcnetdec2010ii mis

35.47 Mobile Communication (2)

35.47.1 Mobile Communication: UGCNET-Jan2017-II: 48 https://gateoverflow.in/335115

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

35.47.2 Mobile Communication: UGCNET-Jan2017-II: 49 https://gateoverflow.in/335114

In 3G network, W-CDMA is also known as UMTS. The minimum spectrum allocation required for W-CDMA is

A. 2 MHz B. 20 KHz C. 5 KHz D. 5 MHz

ugcnetjan2017ii mobile-communication csma-cd

35.48 Multiple Document Interface (1)

35.48.1 Multiple Document Interface: UGCNET-AUG2016-III: 68 https://gateoverflow.in/71677

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.

ugcnetaug2016iii windows-programming multiple-document-interface

35.49 Natural Join (1)

35.49.1 Natural Join: UGCNET-AUG2016-III: 9 https://gateoverflow.in/70770

Suppose database table T1(P , R) currently has tuples (10, 5), (15, 8), (25, 6) and table T2(A, C) currently has
(10, 6), (25, 3), (10, 5). Consider the following three relational algebra queries RA1, RA2 and RA3:
RA1 :T1 ⋈T1.P=T2.A T2 where ⋈ is natural join symbol
RA2 :T1 =⋈T1.P=T2.A T2 where =⋈ is left outer join symbol
RA3 :T1 ⋈T1.P=T2.A and T1.R=T2.C T2
The number of tuples in the resulting table of RA1, RA2 and RA3 are given by :
 A. 2, 4, 2 respectively B. 2, 3, 2 respectively
C. 3, 3, 1 respectively D. 3, 4, 1 respectively
ugcnetaug2016iii databases natural-join

35.50 Natural Language Processing (1)

35.50.1 Natural Language Processing: UGCNET-June2014-III: 29 https://gateoverflow.in/56785

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

35.51 Network Switching (1)

35.51.1 Network Switching: UGCNET-June2011-II: 30 https://gateoverflow.in/65513

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
ugcnetjune2011ii computer-networks network-switching

35.52 Neural Network (6)

35.52.1 Neural Network: UGCNET-June2013-III: 73 https://gateoverflow.in/58904

A fuzzy set A on R is ______ iff A(λx1 + (1 − λ)x2 ) ≥ min[A(x1 ), A(x2 )] for all x1 , x2 ∈ R and all λ ∈ [0, 1]
where minimum denotes the minimum operator.

A. Support
B. α - cut
C. Convex
D. Concave

ugcnetjune2013iii neural-network fuzzy-sets

35.52.2 Neural Network: UGCNET-June2013-III: 74 https://gateoverflow.in/58905

If A and B are two fuzzy sets with membership functions

μA (x) = {0.6, 0.5, 0.1, 0.7, 0.8}

μB (x) = {0.9, 0.2, 0.6, 0.8, 0.5}

¯¯¯¯¯¯¯¯¯¯ (x) will be

Then the value of μ¯A∪B

A. {0.9, 0.5, 0.6, 0.8, 0.8} B. {0.6, 0.2, 0.1, 0.7, 0.5}
C. {0.1, 0.5, 0.4, 0.2, 0.2} D. {0.1, 0.5, 0.4, 0.2, 0.3}
ugcnetjune2013iii neural-network fuzzy-sets

35.52.3 Neural Network: UGCNET-June2015-III: 70 https://gateoverflow.in/61464

Consider the two class classification task that consists of the following points:
Class C1 : [1 1.5] [1 -1.5]
Class C2 : [-2 2.5] [-2 -2.5]
The decision boundary between the two classes using single perceptron is given by:

A. x1 + x2 + 1.5 = 0 B. x1 + x2 − 1.5 = 0 C. x1 + 1.5 = 0 D. x1 − 1.5 = 0

ugcnetjune2015iii fuzzy-sets neural-network

35.52.4 Neural Network: UGCNET-June2015-III: 71 https://gateoverflow.in/61490

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
μA+B(Z) = ⊕ (μA (x) ⊗ μB (y))
x+y=z

f(A + B) is _____ . [Note: ⊕ ≡ max; ⊗ ≡ min]

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)}

ugcnetjune2015iii fuzzy-sets neural-network

35.52.5 Neural Network: UGCNET-June2015-III: 72 https://gateoverflow.in/61492

Suppose the function y and a fuzzy integer number around - 4 for x are given as y = (x − 3)2 + 2 . 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)}
ugcnetjune2015iii fuzzy-sets neural-network

35.52.6 Neural Network: UGCNET-Sep2013-III: 27 https://gateoverflow.in/59847

x1 x2 x3 x4 x5
Support of a fuzzy set A = {{ 0.2 , 0.15 , 0.9 , 0.95 , 0.15 }within
} a universal set X is given as
x1 x2 x3 x4 x5
A. {{ 0.15 , 0.15 , 0.15 , 0.15 , 0.15 }}
x1 x2 x3 x4 x5
B. {{ 0.95 , 0.95 , 0.95 , 0.915 , 0.95 }}
C. {x3 , x4 }
D. {x1 , x2 , x3 , x4 , x5 }

ugcnetsep2013iii neural-network fuzzy-sets

35.53 Oops Concept (1)

35.53.1 Oops Concept: UGCNET-AUG2016-II: 14 https://gateoverflow.in/69525

In C++, polymorphism requires :

A. Inheritance only B. Virtual functions only
C. References only D. Inheritance, Virtual functions and references
ugcnetaug2016ii c++ oops-concept

35.54 Operator Overloading (1)

35.54.1 Operator Overloading: UGCNET-June2011-II: 13 https://gateoverflow.in/64362

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
ugcnetjune2011ii object-oriented-programming operator-overloading

35.55 Pipelining (1)

35.55.1 Pipelining: UGCNET-Dec2019-II: 9 https://gateoverflow.in/360824

A non-pipelined system takes 30ns to process a task. The same task can be processed in a four-segment pipeline with a
clock cycle of 10ns. Determine the speed up of the pipeline for 100 tasks.

A. 3 B. 4 C. 3.91 D. 2.91
ugcnetdec2019ii co-and-architecture pipelining

35.56 Process Scheduling (2)

 35.56.1 Process Scheduling: UGCNET-June2011-II: 38 https://gateoverflow.in/65527

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
ugcnetjune2011ii operating-system process-scheduling

35.56.2 Process Scheduling: UGCNET-June2011-II: 39 https://gateoverflow.in/65528

How many states can a process be in ?

A. 3 B. 4 C. 2 D. 5
ugcnetjune2011ii operating-system process-scheduling

35.57 Prolog (1)

35.57.1 Prolog: UGCNET-AUG2016-III: 75 https://gateoverflow.in/71709

Which formal system provides the semantic foundation for Prolog ?

A. Predicate calculus B. Lambda calculus
C. Hoare logic D. Propositional logic
ugcnetaug2016iii artificial-intelligence prolog

35.58 Quadratic Equations (1)

35.58.1 Quadratic Equations: UGCNET-June2013-III: 11 https://gateoverflow.in/58274

The golden ratio φ and its conjugate φ̄ both satisfy the equation

A. x3 – x − 1 = 0 B. x3 + x − 1 = 0 C. x2 – x − 1 = 0 D. x2 + x − 1 = 0
ugcnetjune2013iii quadratic-equations

35.59 Queue (1)

35.59.1 Queue: UGCNET-June2011-II: 25 https://gateoverflow.in/64711

When the priority queue is represented by max heap, the insertion and deletion of an element can be performed in
(queue containing n elements)
A. θ(n) and θ(1) respectively B. θ(n) and θ(n) respectively
C. θ(1) and θ(1) respectively D. None of the above
ugcnetjune2011ii data-structures queue heap

35.60 Rdbms (2)

35.60.1 Rdbms: UGCNET-AUG2016-II: 16 https://gateoverflow.in/69528

DBMS provides the facility of accessing data from a database through

A. DDL B. DML C. DBA D. Schema

ugcnetaug2016ii databases rdbms

35.60.2 Rdbms: UGCNET-AUG2016-II: 18 https://gateoverflow.in/69553

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 3NF, 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.
 ugcnetaug2016ii databases rdbms

35.61 Relations (1)

35.61.1 Relations: UGCNET-Jan2017-III: 71 https://gateoverflow.in/335167

Let R and S be two fuzzy relations defined as:

x1 0.6 0.4
y1 [y2 R = ] and
x2 0.7 0.3
y1 0.8 0.5 0.1
z1 z2 z3 S = [ ]
y2 0.0 0.6 0.4
Then, the resulting relation, T , which relates elements of universe x to the elements of universe z using max-min composition
is given by:

x1 0.4 0.6 0.4

A. z1 z2 z3 T = [ ]
x2 0.7 0.7 0.7
x1 0.4 0.6 0.4
B. z1 z2 z3 T = [ ]
x2 0.8 0.5 0.4
x1 0.6 0.5 0.4
C. z1 z2 z3 T = [ ]
x2 0.7 0.5 0.3
x1 0.6 0.5 0.5
D. z1 z2 z3 T = [ ]
x2 0.7 0.7 0.7

ugcnetjan2017iii engineering-mathematics relations

35.62 Semantic Nets (1)

35.62.1 Semantic Nets: UGCNET-AUG2016-III: 72 https://gateoverflow.in/71699

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.

ugcnetaug2016iii artificial-intelligence semantic-nets

35.63 Shell (1)

35.63.1 Shell: UGCNET-Sep2013-III: 4 https://gateoverflow.in/59504

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
ugcnetsep2013iii unix linux shell

35.64 Single Layer Perceptron (1)

35.64.1 Single Layer Perceptron: UGCNET-June2013-III: 75 https://gateoverflow.in/58907

Consider a single perception with weights as given in the following figure:

and f(t) is defined as

f(t){1, t > 0 0, t ≤ 0
 The above perception can solve

A. OR problem B. AND problem C. XOR problem D. All of the above

ugcnetjune2013iii neural-network single-layer-perceptron

35.65 Software Development Life Cycle Models (1)

35.65.1 Software Development Life Cycle Models: UGCNET-June2011-II: 42 https://gateoverflow.in/65603

What is the first stage in program development ?

A. Specification and design B. System Analysis
C. Testing D. None of the above
ugcnetjune2011ii is&software-engineering software-development-life-cycle-models

35.66 Software Engineering Framework (1)

35.66.1 Software Engineering Framework: UGCNET-June2011-II: 44 https://gateoverflow.in/65607

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

ugcnetjune2011ii is&software-engineering software-engineering-framework

35.67 Software Testing (1)

35.67.1 Software Testing: UGCNET-June2015-III: 43 https://gateoverflow.in/12765

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-gate ugcnetjune2015iii

35.68 Sql (4)

35.68.1 Sql: UGCNET-Dec2011-II: 21 https://gateoverflow.in/63664

What deletes the entire file except the file structure ?

A. ERASE B. DELETE C. ZAP D. PACK

ugcnetdec2011ii databases sql

35.68.2 Sql: UGCNET-Dec2011-II: 22 https://gateoverflow.in/63668

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
ugcnetdec2011ii databases sql

35.68.3 Sql: UGCNET-Dec2011-II: 24 https://gateoverflow.in/63672

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
ugcnetdec2011ii databases sql
 35.68.4 Sql: UGCNET-Dec2011-II: 25 https://gateoverflow.in/63675

The SQL Expression Select distinct T . branch name from branch T , branch S where T . assets > S . assets and S .
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.

ugcnetdec2011ii databases sql

35.69 System Software Compilers (1)

35.69.1 System Software Compilers: UGCNET-AUG2016-III: 45 https://gateoverflow.in/71566

Match each software term in List-I to its description in List-II :

List-I List-II
I. Wizards a.
forms that provides structure
for a document.
II. Templates b. A series of commands grouped
into a single command.
III. Macros c. A single program that incorporates
most commonly used tools.
IV. Integrated Software d. step by step guide in application
software.
V. Software Suite e. Bundled group of software program
Codes :
A. a-ii, b-iii, c-iv, d-i, e-v B. a-ii, b-i, c-iv, d-iii, e-v
C. a-iv, b-iii, c-v, d-i, e-ii D. a-iv, b-iii, c-ii, d-v, e-i
ugcnetaug2016iii system-software-compilers macros

35.70 Transaction And Concurrency (3)

35.70.1 Transaction And Concurrency: UGCNET-June2011-II: 16 https://gateoverflow.in/64563

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
ugcnetjune2011ii databases transaction-and-concurrency

35.70.2 Transaction And Concurrency: UGCNET-June2011-II: 18 https://gateoverflow.in/64565

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
ugcnetjune2011ii databases transaction-and-concurrency

35.70.3 Transaction And Concurrency: UGCNET-June2011-II: 19 https://gateoverflow.in/64568

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

ugcnetjune2011ii databases transaction-and-concurrency

35.71 Transportation Problem (3)

35.71.1 Transportation Problem: UGCNET-AUG2016-III: 63 https://gateoverflow.in/71656

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)
ugcnetaug2016iii linear-programming transportation-problem

35.71.2 Transportation Problem: UGCNET-June2013-III: 24 https://gateoverflow.in/58293

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

ugcnetjune2013iii linear-programming transportation-problem

35.71.3 Transportation Problem: UGCNET-June2013-III: 25 https://gateoverflow.in/58294

The total transportation cost in an initial basic feasible solution to the following transportation problem using Vogel’s
Approximation method is
W1 W2 W3 W4 W5 Supply
F1 4 2 3 2 6 8
F2 5 4 5 2 1 12
F3 6 5 4 7 3 14
Demand 4 4 6 8 8

A. 76 B. 80 C. 90 D. 96
ugcnetjune2013iii linear-programming transportation-problem

35.72 Trees (1)

35.72.1 Trees: UGCNET-June2011-II: 21 https://gateoverflow.in/64573

The number of different trees with 8 nodes is

A. 256 B. 255 C. 248 D. None of these

ugcnetjune2011ii algorithms trees

35.73 Unix (4)

35.73.1 Unix: UGCNET-AUG2016-III: 67 https://gateoverflow.in/71672

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 - 1 | grep "June" | sort + 10n

B. ls - 1 | grep "June" | sort + 10r
C. ls - 1 | grep - v "June" | sort + 10n
D. ls - 1 | grep - n "June" | sort + 10x

ugcnetaug2016iii unix

35.73.2 Unix: UGCNET-AUG2016-III: 69 https://gateoverflow.in/71680

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. I, II only B. II, III only C. I, II, III D. I, III only
ugcnetaug2016iii unix

35.73.3 Unix: UGCNET-Dec2010-II: 37 https://gateoverflow.in/67019

Which of the following command the file names in multiple columns ?

A. IS − X B. IS C. IS − 1 D. IS − f − X
ugcnetdec2010ii unix

35.73.4 Unix: UGCNET-Sep2013-II: 48 https://gateoverflow.in/59277

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

35.74 Virtual Memory (1)

35.74.1 Virtual Memory: UGCNET-June2011-II: 47 https://gateoverflow.in/65612

Virtual memory is
A. Related to virtual reality B. A form of ROM
C. A form of RAM D. None of the above
ugcnetjune2011ii co-and-architecture virtual-memory

35.75 Windows (4)

35.75.1 Windows: UGCNET-June2014-III: 38 https://gateoverflow.in/57012

A part of Windows 2000 operating system that is not portable is

A. Device Management B. Virtual Memory Management
C. Processor Management D. User Interface
ugcnetjune2014iii windows

35.75.2 Windows: UGCNET-June2014-III: 47 https://gateoverflow.in/57189

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

35.75.3 Windows: UGCNET-June2014-III: 48 https://gateoverflow.in/57190

Windows 32 API supports

A. 16-bit Windows B. 32-bit Windows
C. 64-bit Windows D. All of the above
ugcnetjune2014iii windows

35.75.4 Windows: UGCNET-dec2008-ii-50 https://gateoverflow.in/155374

(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

ugcnetdec2008ii windows

35.76 Windows Programming (2)

35.76.1 Windows Programming: UGCNET-June2015-III: 74 https://gateoverflow.in/61494

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

ugcnetjune2015iii windows-programming

35.76.2 Windows Programming: UGCNET-june2009-ii-50 https://gateoverflow.in/154831

We cannot delete the __________ icon but we can made it invisible.

A. Recycle
B. My Computer
C. Internet explorer
D. None of the above

ugcnetjune2009ii windows-programming

Answer Keys
35.0.1 Q-Q 35.0.2 Q-Q 35.0.3 B 35.0.4 B 35.0.5 D
35.0.6 A 35.0.7 D 35.0.8 Q-Q 35.0.9 Q-Q 35.0.10 Q-Q
35.0.11 Q-Q 35.0.12 Q-Q 35.0.13 Q-Q 35.0.14 B 35.0.15 Q-Q
35.0.16 Q-Q 35.0.17 Q-Q 35.0.18 D 35.0.19 Q-Q 35.0.20 Q-Q
35.0.21 Q-Q 35.0.22 D 35.0.23 Q-Q 35.0.24 Q-Q 35.0.25 Q-Q
35.0.26 Q-Q 35.0.27 Q-Q 35.0.28 Q-Q 35.0.29 Q-Q 35.0.30 Q-Q
35.0.31 Q-Q 35.0.32 Q-Q 35.0.33 Q-Q 35.0.34 D 35.0.35 C
35.0.36 Q-Q 35.0.37 D 35.0.38 B 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 D
35.0.46 Q-Q 35.0.47 B 35.0.48 B 35.0.49 C 35.0.50 D
35.0.51 D 35.0.52 D 35.0.53 B 35.0.54 D 35.0.55 B
35.0.56 B 35.0.57 A 35.0.58 C 35.0.59 C 35.0.60 Q-Q
35.0.61 A 35.0.62 A 35.0.63 A 35.0.64 D 35.0.65 D
35.0.66 B 35.0.67 C 35.0.68 B 35.0.69 Q-Q 35.0.70 Q-Q
35.0.71 C 35.0.72 Q-Q 35.0.73 Q-Q 35.0.74 Q-Q 35.0.75 Q-Q
35.0.76 Q-Q 35.0.77 Q-Q 35.0.78 Q-Q 35.0.79 Q-Q 35.0.80 Q-Q
35.0.81 Q-Q 35.0.82 Q-Q 35.0.83 Q-Q 35.0.84 Q-Q 35.0.85 Q-Q
35.0.86 Q-Q 35.0.87 Q-Q 35.0.88 Q-Q 35.0.89 Q-Q 35.0.90 Q-Q
35.0.91 Q-Q 35.0.92 Q-Q 35.0.93 Q-Q 35.0.94 Q-Q 35.0.95 Q-Q
35.0.96 Q-Q 35.0.97 Q-Q 35.0.98 Q-Q 35.0.99 Q-Q 35.0.100 Q-Q
35.0.101 Q-Q 35.0.102 Q-Q 35.0.103 Q-Q 35.0.104 Q-Q 35.0.105 Q-Q
35.0.106 Q-Q 35.0.107 Q-Q 35.0.108 Q-Q 35.0.109 Q-Q 35.0.110 Q-Q
35.0.111 Q-Q 35.0.112 Q-Q 35.0.113 Q-Q 35.0.114 Q-Q 35.0.115 B
35.0.116 Q-Q 35.0.117 Q-Q 35.0.118 Q-Q 35.0.119 Q-Q 35.0.120 Q-Q
35.0.121 Q-Q 35.0.122 Q-Q 35.0.123 Q-Q 35.0.124 Q-Q 35.0.125 Q-Q
35.0.126 Q-Q 35.0.127 Q-Q 35.0.128 Q-Q 35.0.129 Q-Q 35.0.130 Q-Q
35.0.131 Q-Q 35.0.132 Q-Q 35.0.133 Q-Q 35.0.134 Q-Q 35.0.135 Q-Q
35.0.136 Q-Q 35.0.137 Q-Q 35.0.138 Q-Q 35.0.139 Q-Q 35.0.140 C
35.0.141 A 35.0.142 Q-Q 35.0.143 A 35.0.144 C 35.0.145 B
35.0.146 D 35.0.147 B 35.0.148 C 35.0.149 D 35.0.150 C
35.0.151 Q-Q 35.0.152 A 35.0.153 C 35.0.154 B 35.0.155 C
35.0.156 D 35.0.157 A 35.0.158 D 35.0.159 D 35.0.160 Q-Q
35.0.161 D 35.0.162 B 35.0.163 Q-Q 35.0.164 C 35.0.165 Q-Q
35.0.166 Q-Q 35.0.167 Q-Q 35.0.168 D 35.0.169 Q-Q 35.0.170 Q-Q
35.0.171 Q-Q 35.0.172 Q-Q 35.0.173 A 35.0.174 Q-Q 35.0.175 D
35.0.176 C 35.0.177 D 35.0.178 D 35.0.179 D 35.0.180 C
35.0.181 B 35.0.182 C 35.0.183 A 35.0.184 B 35.0.185 C
35.0.186 B 35.0.187 A 35.0.188 A 35.0.189 A 35.0.190 C
35.0.191 A 35.0.192 B 35.0.193 C 35.0.194 C 35.0.195 Q-Q
35.0.196 A 35.0.197 C 35.0.198 A 35.0.199 C 35.0.200 Q-Q
35.0.201 Q-Q 35.0.202 Q-Q 35.0.203 B 35.0.204 A 35.0.205 A
35.0.206 D 35.0.207 C 35.0.208 C 35.0.209 B 35.0.210 B
35.0.211 A 35.0.212 C 35.0.213 Q-Q 35.0.214 Q-Q 35.0.215 A
35.0.216 Q-Q 35.0.217 Q-Q 35.0.218 Q-Q 35.0.219 Q-Q 35.0.220 D
35.0.221 A 35.0.222 C 35.0.223 B 35.0.224 B 35.0.225 Q-Q
35.0.226 Q-Q 35.0.227 Q-Q 35.0.228 Q-Q 35.0.229 Q-Q 35.0.230 Q-Q
35.0.231 B 35.0.232 Q-Q 35.0.233 Q-Q 35.0.234 Q-Q 35.0.235 C
35.0.236 Q-Q 35.0.237 Q-Q 35.0.238 Q-Q 35.0.239 Q-Q 35.0.240 Q-Q
35.0.241 Q-Q 35.0.242 Q-Q 35.0.243 B 35.0.244 Q-Q 35.0.245 Q-Q
35.0.246 Q-Q 35.0.247 A 35.0.248 D 35.0.249 B 35.0.250 A
35.0.251 D 35.0.252 B 35.0.253 C 35.0.254 A 35.0.255 D
35.0.256 B 35.0.257 A 35.0.258 A 35.0.259 C 35.0.260 B
35.0.261 D 35.0.262 B 35.0.263 D 35.0.264 Q-Q 35.0.265 Q-Q
35.0.266 A 35.0.267 Q-Q 35.0.268 Q-Q 35.0.269 Q-Q 35.0.270 D
35.0.271 C 35.0.272 D 35.0.273 A 35.0.274 Q-Q 35.0.275 C
35.0.276 B 35.0.277 A 35.0.278 A;B 35.0.279 D 35.0.280 Q-Q
35.0.281 Q-Q 35.0.282 Q-Q 35.0.283 Q-Q 35.0.284 Q-Q 35.0.285 Q-Q
35.0.286 Q-Q 35.0.287 Q-Q 35.0.288 Q-Q 35.0.289 Q-Q 35.0.290 Q-Q
35.0.291 Q-Q 35.0.292 Q-Q 35.0.293 Q-Q 35.0.294 Q-Q 35.0.295 Q-Q
35.0.296 Q-Q 35.0.297 Q-Q 35.0.298 Q-Q 35.0.299 Q-Q 35.0.300 Q-Q
35.0.301 Q-Q 35.0.302 Q-Q 35.0.303 Q-Q 35.0.304 Q-Q 35.0.305 Q-Q
35.0.306 Q-Q 35.0.307 Q-Q 35.0.308 Q-Q 35.0.309 Q-Q 35.0.310 Q-Q
35.0.311 C 35.0.312 Q-Q 35.0.313 Q-Q 35.0.314 Q-Q 35.0.315 Q-Q
35.0.316 Q-Q 35.0.317 Q-Q 35.0.318 Q-Q 35.0.319 Q-Q 35.0.320 Q-Q
35.0.321 Q-Q 35.0.322 Q-Q 35.0.323 D 35.0.324 Q-Q 35.0.325 Q-Q
35.0.326 Q-Q 35.0.327 Q-Q 35.0.328 Q-Q 35.0.329 Q-Q 35.0.330 Q-Q
35.0.331 Q-Q 35.0.332 Q-Q 35.0.333 Q-Q 35.0.334 Q-Q 35.0.335 Q-Q
35.0.336 Q-Q 35.0.337 Q-Q 35.0.338 Q-Q 35.0.339 Q-Q 35.0.340 Q-Q
35.0.341 Q-Q 35.0.342 Q-Q 35.0.343 Q-Q 35.0.344 Q-Q 35.0.345 Q-Q
35.0.346 Q-Q 35.0.347 Q-Q 35.0.348 Q-Q 35.0.349 Q-Q 35.0.350 Q-Q
35.0.351 Q-Q 35.0.352 Q-Q 35.0.353 Q-Q 35.0.354 Q-Q 35.0.355 Q-Q
35.0.356 Q-Q 35.0.357 Q-Q 35.0.358 Q-Q 35.0.359 Q-Q 35.0.360 Q-Q
35.0.361 Q-Q 35.0.362 Q-Q 35.0.363 Q-Q 35.0.364 Q-Q 35.0.365 Q-Q
35.0.366 Q-Q 35.0.367 Q-Q 35.0.368 Q-Q 35.0.369 Q-Q 35.0.370 Q-Q
35.0.371 Q-Q 35.0.372 Q-Q 35.0.373 Q-Q 35.0.374 Q-Q 35.0.375 Q-Q
35.0.376 Q-Q 35.0.377 Q-Q 35.0.378 Q-Q 35.0.379 Q-Q 35.0.380 Q-Q
35.0.381 Q-Q 35.0.382 Q-Q 35.0.383 Q-Q 35.0.384 Q-Q 35.0.385 Q-Q
35.0.386 Q-Q 35.0.387 Q-Q 35.0.388 Q-Q 35.0.389 Q-Q 35.0.390 Q-Q
35.0.391 Q-Q 35.0.392 Q-Q 35.0.393 Q-Q 35.0.394 Q-Q 35.0.395 Q-Q
35.0.396 Q-Q 35.0.397 Q-Q 35.0.398 Q-Q 35.0.399 Q-Q 35.0.400 Q-Q
35.0.401 Q-Q 35.0.402 Q-Q 35.0.403 Q-Q 35.0.404 Q-Q 35.0.405 Q-Q
35.0.406 Q-Q 35.0.407 Q-Q 35.0.408 Q-Q 35.0.409 Q-Q 35.0.410 Q-Q
35.0.411 Q-Q 35.0.412 Q-Q 35.0.413 Q-Q 35.0.414 Q-Q 35.0.415 Q-Q
35.0.416 Q-Q 35.0.417 Q-Q 35.0.418 Q-Q 35.0.419 Q-Q 35.0.420 Q-Q
35.0.421 Q-Q 35.0.422 Q-Q 35.0.423 Q-Q 35.0.424 Q-Q 35.0.425 Q-Q
35.0.426 Q-Q 35.0.427 Q-Q 35.0.428 Q-Q 35.0.429 Q-Q 35.0.430 Q-Q
35.0.431 Q-Q 35.0.432 Q-Q 35.0.433 Q-Q 35.0.434 Q-Q 35.0.435 Q-Q
35.0.436 Q-Q 35.0.437 Q-Q 35.0.438 Q-Q 35.0.439 Q-Q 35.0.440 Q-Q
35.0.441 Q-Q 35.0.442 Q-Q 35.0.443 Q-Q 35.0.444 Q-Q 35.0.445 Q-Q
35.0.446 Q-Q 35.0.447 Q-Q 35.0.448 Q-Q 35.0.449 Q-Q 35.0.450 Q-Q
35.0.451 Q-Q 35.0.452 Q-Q 35.0.453 Q-Q 35.0.454 Q-Q 35.0.455 Q-Q
35.0.456 Q-Q 35.0.457 Q-Q 35.0.458 Q-Q 35.0.459 Q-Q 35.0.460 Q-Q
35.0.461 Q-Q 35.0.462 Q-Q 35.0.463 Q-Q 35.0.464 Q-Q 35.0.465 Q-Q
35.0.466 Q-Q 35.0.467 Q-Q 35.0.468 Q-Q 35.0.469 Q-Q 35.0.470 Q-Q
35.0.471 Q-Q 35.0.472 Q-Q 35.0.473 Q-Q 35.0.474 Q-Q 35.0.475 Q-Q
35.0.476 Q-Q 35.0.477 Q-Q 35.0.478 Q-Q 35.0.479 Q-Q 35.0.480 Q-Q
35.0.481 Q-Q 35.0.482 Q-Q 35.0.483 Q-Q 35.0.484 Q-Q 35.0.485 Q-Q
35.0.486 Q-Q 35.0.487 Q-Q 35.0.488 Q-Q 35.0.489 Q-Q 35.0.490 Q-Q
35.0.491 Q-Q 35.0.492 Q-Q 35.0.493 Q-Q 35.0.494 Q-Q 35.0.495 Q-Q
35.0.496 Q-Q 35.0.497 Q-Q 35.0.498 Q-Q 35.0.499 Q-Q 35.0.500 Q-Q
35.0.501 Q-Q 35.0.502 Q-Q 35.0.503 Q-Q 35.0.504 Q-Q 35.0.505 Q-Q
35.0.506 Q-Q 35.0.507 Q-Q 35.0.508 Q-Q 35.0.509 Q-Q 35.0.510 Q-Q
35.0.511 Q-Q 35.0.512 Q-Q 35.0.513 Q-Q 35.0.514 Q-Q 35.0.515 Q-Q
35.0.516 Q-Q 35.0.517 Q-Q 35.0.518 Q-Q 35.0.519 Q-Q 35.0.520 Q-Q
35.0.521 Q-Q 35.0.522 Q-Q 35.0.523 Q-Q 35.0.524 Q-Q 35.0.525 Q-Q
35.0.526 Q-Q 35.0.527 Q-Q 35.0.528 Q-Q 35.0.529 Q-Q 35.0.530 Q-Q
35.0.531 Q-Q 35.0.532 Q-Q 35.0.533 Q-Q 35.0.534 Q-Q 35.0.535 Q-Q
35.0.536 Q-Q 35.0.537 Q-Q 35.0.538 Q-Q 35.0.539 Q-Q 35.0.540 Q-Q
35.0.541 Q-Q 35.0.542 Q-Q 35.0.543 Q-Q 35.0.544 Q-Q 35.0.545 Q-Q
35.0.546 Q-Q 35.0.547 Q-Q 35.0.548 Q-Q 35.0.549 Q-Q 35.0.550 Q-Q
35.0.551 Q-Q 35.0.552 Q-Q 35.0.553 Q-Q 35.0.554 Q-Q 35.0.555 Q-Q
35.0.556 Q-Q 35.0.557 Q-Q 35.0.558 Q-Q 35.0.559 Q-Q 35.1.1 Q-Q
35.2.1 Q-Q 35.3.1 Q-Q 35.4.1 A 35.5.1 Q-Q 35.6.1 Q-Q
35.7.1 Q-Q 35.8.1 B 35.9.1 B 35.10.1 Q-Q 35.11.1 Q-Q
35.12.1 Q-Q 35.12.2 Q-Q 35.12.3 Q-Q 35.12.4 Q-Q 35.13.1 Q-Q
35.14.1 Q-Q 35.14.2 Q-Q 35.15.1 Q-Q 35.16.1 Q-Q 35.16.2 B
35.16.3 D 35.17.1 Q-Q 35.18.1 Q-Q 35.19.1 Q-Q 35.20.1 Q-Q
35.20.2 Q-Q 35.21.1 Q-Q 35.22.1 Q-Q 35.22.2 Q-Q 35.22.3 Q-Q
35.23.1 B 35.23.2 B 35.24.1 Q-Q 35.24.2 Q-Q 35.25.1 Q-Q
35.26.1 Q-Q 35.27.1 Q-Q 35.27.2 A 35.28.1 Q-Q 35.29.1 D
35.29.2 C 35.30.1 A 35.30.2 A;D 35.30.3 A 35.30.4 C
35.30.5 B 35.30.6 D 35.30.7 B 35.30.8 B 35.30.9 C
35.30.10 A 35.30.11 A 35.30.12 D 35.30.13 A 35.30.14 D
35.30.15 C 35.30.16 A 35.30.17 A 35.30.18 D 35.30.19 C
35.30.20 C 35.30.21 D 35.30.22 A 35.30.23 D 35.30.24 C
35.30.25 C 35.30.26 A 35.30.27 C 35.30.28 A 35.30.29 C
35.30.30 A 35.30.31 B 35.30.32 D 35.30.33 D 35.31.1 Q-Q
35.32.1 Q-Q 35.33.1 Q-Q 35.33.2 Q-Q 35.33.3 Q-Q 35.34.1 Q-Q
35.35.1 D 35.36.1 Q-Q 35.37.1 Q-Q 35.38.1 Q-Q 35.39.1 Q-Q
35.40.1 Q-Q 35.40.2 2 35.40.3 C 35.41.1 Q-Q 35.41.2 Q-Q
35.42.1 Q-Q 35.43.1 Q-Q 35.43.2 2 35.44.1 C 35.44.2 Q-Q
35.45.1 Q-Q 35.46.1 Q-Q 35.47.1 B 35.47.2 D 35.48.1 Q-Q
35.49.1 Q-Q 35.50.1 C 35.51.1 C 35.52.1 C 35.52.2 C
35.52.3 C 35.52.4 D 35.52.5 C 35.52.6 D 35.53.1 Q-Q
35.54.1 Q-Q 35.55.1 Q-Q 35.56.1 Q-Q 35.56.2 Q-Q 35.57.1 Q-Q
35.58.1 C 35.59.1 D 35.60.1 Q-Q 35.60.2 Q-Q 35.61.1 D
35.62.1 Q-Q 35.63.1 A 35.64.1 B 35.65.1 Q-Q 35.66.1 Q-Q
35.67.1 D 35.68.1 Q-Q 35.68.2 Q-Q 35.68.3 Q-Q 35.68.4 Q-Q
35.69.1 Q-Q 35.70.1 Q-Q 35.70.2 Q-Q 35.70.3 Q-Q 35.71.1 Q-Q
35.71.2 A 35.71.3 B 35.72.1 Q-Q 35.73.1 Q-Q 35.73.2 Q-Q
35.73.3 Q-Q 35.73.4 C 35.74.1 Q-Q 35.75.1 B 35.75.2 A
35.75.3 D 35.75.4 Q-Q 35.76.1 D 35.76.2 Q-Q
36 Programming and DS (30)

36.1 Array Of Pointers (1)

36.1.1 Array Of Pointers: UGCNET-AUG2016-II: 12 https://gateoverflow.in/69523

The following ′ C ′ 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.

ugcnetaug2016ii programming-in-c array-of-pointers pointers

36.2 Arrays (3)

36.2.1 Arrays: UGCNET-Dec2014-II: 14 https://gateoverflow.in/59137

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 C , 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.

ugcnetdec2014ii programming-in-c arrays

36.2.2 Arrays: UGCNET-June2013-III: 32 https://gateoverflow.in/58491

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
ugcnetjune2013iii programming-in-c arrays

36.2.3 Arrays: UGCNET-Oct2020-II: 11 https://gateoverflow.in/349662

Suppose you are compiling on a machine with 1-byte chars, 2-byte shorts, 4-byte ints, and 8-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. 150 bytes B. 320 bytes C. 240 bytes D. 200 bytes

ugcnet-oct2020-ii programming-in-c arrays

36.3 Dangling Pointers (1)

36.3.1 Dangling Pointers: UGCNET-Sep2013-III: 65 https://gateoverflow.in/59939

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
ugcnetsep2013iii programming-in-c dangling-pointers

36.4 Data Types (1)

36.4.1 Data Types: UGCNET-Dec2011-II: 33 https://gateoverflow.in/63900

If an integer needs two bytes of storage, then the maximum value of unsigned integer is

A. 216 – 1 B. 215 – 1 C. 216 D. 215

ugcnetdec2011ii programming-in-c data-types

36.5 Dynamic Memory Allocation (1)

36.5.1 Dynamic Memory Allocation: UGCNET-June2012-III: 24 https://gateoverflow.in/56221

The memory allocation function modifies the previous allocated space.

A. calloc() B. free() C. malloc() D. realloc()

ugcnetjune2012iii programming-in-c dynamic-memory-allocation

36.6 Input Output Statement (1)

36.6.1 Input Output Statement: UGCNET-dec2009-ii-12 https://gateoverflow.in/152704

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”
ugcnetdec2009ii programming-in-c input-output-statement

36.7 Operator Precedence (2)

36.7.1 Operator Precedence: UGCNET-Dec2010-II: 12 https://gateoverflow.in/66602

The value of the following expression (13/4 ∗ 3) is

A. 5.75 B. 2.95 C. 1.4875 D. 5

ugcnetdec2010ii programming-in-c operator-precedence

36.7.2 Operator Precedence: UGCNET-Dec2011-II: 36 https://gateoverflow.in/64059

X− = Y + 1 means
A. X = X– Y + 1 B. X = −X − Y − 1
 C. X = −X + Y + 1 D. X = X − Y − 1
ugcnetdec2011ii programming-in-c operator-precedence

36.8 Operators (2)

36.8.1 Operators: UGCNET-Dec2012-II: 45 https://gateoverflow.in/57128

What is the result of the following expression?

(1 & 2) + (3 & 4)

A. 1 B. 3 C. 2 D. 0
ugcnetdec2012ii programming-in-c operators

36.8.2 Operators: UGCNET-June2010-II: 11 https://gateoverflow.in/67824

The statement print

f (" % d", 10 ? 0 ? 5 : 1 : 12);
will print

A. 10 B. 0 C. 12 D. 1
ugcnetjune2010ii programming-in-c operators

36.9 Parameter Passing (1)

36.9.1 Parameter Passing: UGCNET-Dec2012-III: 44 https://gateoverflow.in/57679

The Default Parameter Passing Mechanism is called as

A. Call by Value B. Call by Reference
C. Call by Address D. Call by Name
ugcnetdec2012iii programming-in-c parameter-passing

36.10 Pointer Declaration (1)

36.10.1 Pointer Declaration: UGCNET-Sep2013-III: 51 https://gateoverflow.in/59921

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

ugcnetsep2013iii programming-in-c pointer-declaration

36.11 Programming In C (14)

36.11.1 Programming In C: UGCNET-AUG2016-II: 11 https://gateoverflow.in/69503

Given i = 0, j = 1, k = −1, x = 0.5, y = 0.0

What is the output of given ‘C ′ expression?
x * 3 & & 3 || j | k

A. −1 B. 0 C. 1 D. 2
ugcnetaug2016ii programming-in-c

36.11.2 Programming In C: UGCNET-Dec2010-II: 11 https://gateoverflow.in/66600

How many of the following declarations are correct ?

int z = 7.0 ;
double void = 0.000;
short array [2] = 0, 1, 2 ;
char c = “\n”;
A. None B. One is correct
C. Two are correct D. All four are correct
ugcnetdec2010ii programming-in-c

36.11.3 Programming In C: UGCNET-Dec2010-II: 13 https://gateoverflow.in/66603

Which one of the following will set the value of y to 5 if x has the value 3, but not otherwise ?
A. If (x = 3)y = 5 B. If x == 3(y = 5)
C. If (x == 3); y = 5 D. If (x == 3)y = 5
ugcnetdec2010ii programming-in-c

36.11.4 Programming In C: UGCNET-Dec2015-II: 11 https://gateoverflow.in/62234

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. x + x2 /2 + x3 /3 + x4 /4 + … B. x + x2 /2! + x3 /3! + x4 /4! + …
C. 1 + x2 /2 + x3 /3 + x4 /4 + … D. 1 + x2 /2! + x3 /3! + x4 /4! + …
ugcnetdec2015ii programming-in-c

36.11.5 Programming In C: UGCNET-Dec2015-III: 43 https://gateoverflow.in/48405

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 ugcnetdec2015iii

36.11.6 Programming In C: UGCNET-July-2018-II: 4 https://gateoverflow.in/225882

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
ugcnetjuly2018ii programming-in-c

36.11.7 Programming In C: UGCNET-June2007-II: 14 https://gateoverflow.in/335719

What is the output of the following ’C’ program?

main()
{
printf(“%x”,-1>>4);
}

A. ffff B. 0fff C. 0000 D. fff0

ugcnetjune2007ii programming-in-c

36.11.8 Programming In C: UGCNET-June2013-III: 33 https://gateoverflow.in/58492

Refer the points as listed below:

a. What are the operator precedence

b. What are
rules?
the operator associativity
c. What is the
rules?
order of operand
d. Areevaluation? Whichevaluations
these restrictions on operand of the side
above
effects?
must be considered as
primary design issues for arithmetic expressions?

A. a, b and c B. a, c and d C. a, b and d D. a, b, c and d

ugcnetjune2013iii programming-in-c

36.11.9 Programming In C: UGCNET-June2013-III: 51 https://gateoverflow.in/58717

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

ugcnetjune2013iii programming-in-c

36.11.10 Programming In C: UGCNET-Oct2020-II: 9 https://gateoverflow.in/349664

Consider the following pseudo-code fragment, where a and b are integer variables that have been initialized:
/* Pre-conditions : (a > 1 ∧ a < b) */
/* Assume that overflow never occurs */
int x = 0 ; int p = 1 ;
while (p < b){
p = p ∗ a;
x = x + 1;
}
When the while loop terminates, what will be the value of x in terms of a and b?

A. ab
B. ba
C. ⌊logba ⌋ /* ⌊ ⌋ means floor */
D. ⌊logba ⌋ /* ⌈ ⌉ means ceil */

ugcnet-oct2020-ii programming-in-c
 36.11.11 Programming In C: UGCNET-Sep2013-II: 33 https://gateoverflow.in/59233

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

36.11.12 Programming In C: UGCNET-Sep2013-II: 34 https://gateoverflow.in/59238

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

36.11.13 Programming In C: UGCNET-Sep2013-II: 36 https://gateoverflow.in/59243

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

36.11.14 Programming In C: UGCNET-Sep2013-III: 53 https://gateoverflow.in/59923

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
ugcnetsep2013iii programming-in-c

36.12 Storage Classes In C (1)

36.12.1 Storage Classes In C: UGCNET-Jan2017-II: 13 https://gateoverflow.in/335150

Which of the following storage classes have global visibility in C /C + + ?

A. Auto B. Extern C. Static D. Register

 ugcnetjan2017ii programming-in-c storage-classes-in-c

36.13 Three Dimensional Array (1)

36.13.1 Three Dimensional Array: UGCNET-Dec2015-II: 16 https://gateoverflow.in/62244

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)
ugcnetdec2015ii programming-in-c three-dimensional-array

Answer Keys
36.1.1 Q-Q 36.2.1 A 36.2.2 C 36.2.3 C 36.3.1 B
36.4.1 A 36.5.1 D 36.6.1 Q-Q 36.7.1 Q-Q 36.7.2 D
36.8.1 D 36.8.2 Q-Q 36.9.1 A 36.10.1 D 36.11.1 Q-Q
36.11.2 Q-Q 36.11.3 Q-Q 36.11.4 B 36.11.5 B 36.11.6 Q-Q
36.11.7 Q-Q 36.11.8 D 36.11.9 C 36.11.10 X 36.11.11 B
36.11.12 C 36.11.13 C 36.11.14 D 36.12.1 B 36.13.1 B
37 Programming and DS: DS (102)

37.0.1 UGCNET-Dec2004-II: 24 https://gateoverflow.in/335373

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

ugcnetdec2004ii

37.0.2 UGCNET-Dec2006-II: 24 https://gateoverflow.in/335647

The equivalent postfix expression for d/(e + f) + b ∗ c :

1. defbc/ + +∗
2. def + /bc + ∗
3. def + /bc ∗ +
4. None of these

ugcnetdec2006ii

37.0.3 UGCNET-Dec2004-II: 21 https://gateoverflow.in/335376

What item is at the root after the following sequence of insertions into an empty splay tree :
1, 11, 3, 10, 8, 4, 6, 5, 7, 9, 2, ?

A. 1 B. 2 C. 4 D. 8
ugcnetdec2004ii

37.0.4 UGCNET-Dec2004-II: 22 https://gateoverflow.in/335375

Suppose we are implementing quadratic probing with a Hash function, Hash (y) = X mode 100. If an element with
key 4594 is inserted and the first three locations attempted are already occupied, then the next cell that will be tried is :

A. 2 B. 3 C. 9 D. 97
ugcnetdec2004ii

37.0.5 UGCNET-Dec2007-II: 12 https://gateoverflow.in/335772

Consider the following linked list :

Which of the following piece of code will insert the node pointed to by q at the end of the list ?

A. for (p=list; p !=NULL; p=p → next);p = q;

B. for (p=list; p !=NULL; p=p → next);p→next=q;
C. for (p=list; p→next !=NULL; p=p → next);p = q;
D. for (p=list; p→next !=NULL; p=p → next);p → next = q;

ugcnetdec2007ii

37.0.6 UGCNET-Dec2006-II: 23 https://gateoverflow.in/335648

What is the time required to insert an element in a stack with linked implementation ?

A. O(log2n ) B. O(n) C. O(n log2n ) D. O(1)

ugcnetdec2006ii
37.0.7 UGCNET-june2009-ii-28 https://gateoverflow.in/154132

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

ugcnetjune2009ii

37.0.8 UGCNET-june2009-ii-24 https://gateoverflow.in/154365

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
ugcnetjune2009ii

37.0.9 UGCNET-Dec2004-II: 32 https://gateoverflow.in/335596

Which of the following is not collision resolution technique?

A. Hash addressing B. Chaining C. Both (A) and (B) D. Indexing

ugcnetdec2004ii

37.0.10 UGCNET-Dec2006-II: 11 https://gateoverflow.in/335660

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
ugcnetdec2006ii

37.0.11 UGCNET-Dec2007-II: 23 https://gateoverflow.in/335761

The height of a binary tree with n nodes, in the worst case is :

A. O(logn) B. O(n)
C. Ω(n log n) D. Ω(n2 )
ugcnetdec2007ii

37.0.12 UGCNET-Dec2007-II: 22 https://gateoverflow.in/335762

Which of the following data structure is used to implement recursion ?

A. Arrays B. Stacks C. Queues D. Linked lists

ugcnetdec2007ii

37.0.13 UGCNET-june2008-ii-21 https://gateoverflow.in/155605

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

ugcnetjune2008ii

37.0.14 UGCNET-Dec2007-II: 21 https://gateoverflow.in/335763

Consider a rooted tree in which every node has at least three children. What is the minimum number of nodes at level i
(i > 0) of the tree ? Assume that the root is at level 0:

A. 3i B. 3i C. 3 D. 3i + 1
 ugcnetdec2007ii

37.0.15 UGCNET-Dec2006-II: 25 https://gateoverflow.in/335646

Which one of the following is a physical data structure ?

A. Array B. Linked lists C. Stacks D. Tables

ugcnetdec2006ii

37.1 Avl Tree (1)

37.1.1 Avl Tree: UGCNET-Dec2012-II: 2 https://gateoverflow.in/50834

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 ugcnetdec2012ii avl-tree

37.2 B And Bplus Trees (1)

37.2.1 B And Bplus Trees: UGCNET-June2010-II: 25 https://gateoverflow.in/67881

In a B tree of order 5, the following keys are inserted as follows : 7, 8, 1, 4, 13, 20, 2, 6 and 5 How many elements are
present in the root of the tree ?

A. 1 B. 2 C. 3 D. 4
ugcnetjune2010ii data-structures b-and-bplus-trees

37.3 B Tree (1)

37.3.1 B Tree: UGCNET-Dec2012-II: 34 https://gateoverflow.in/57071

The maximum number of keys stored in a B-tree of order m and depth d is

md+1 −1 md −1
A. md+1 − 1 B. m−1 C. (m − 1)(md+1 − 1) D. m−1
ugcnetdec2012ii b-tree databases

37.4 Bfs (1)

37.4.1 Bfs: UGCNET-Oct2020-II: 63 https://gateoverflow.in/349610

Which of the following statements are true?

a. Minimax search is breadth-first;

b. The effectiveness
it processes of
all the
thec.alpha-beta
nodes
The alpha-beta
at a pruning
level before
search
is highly
moving
algorithms
d. dependent
Optimal
to a computes
node
play
oninin
the
next
games
the
order
level.
same
of Choose
in which
imperfect
optimal theas
themoves
information
states correct
areminimax
examined
does not
algorithm
require r
answer from the options
given below:

A. (a) and (c) only B. (a) and (d) only C. (b) and (c) only D. (c) and (d) only
ugcnet-oct2020-ii data-structures bfs

37.5 Binary Codes (1)

37.5.1 Binary Codes: UGCNET-Jan2017-III: 64 https://gateoverflow.in/335174

Let C be a binary linear code with minimum distance 2t + 1 then it can correct upto _______ bits of error
t
A. t + 1 B. t C. t − 2 D. 2
ugcnetjan2017iii data-structures binary-codes

37.6 Binary Heap (1)

 37.6.1 Binary Heap: UGCNET-Oct2020-II: 24 https://gateoverflow.in/349649

In a binary max heap containing n numbers, the smallest element can be found in ______

A. O(n) B. O(log2 n) C. O(1) D. O(log2 log2 n)

ugcnet-oct2020-ii data-structures binary-heap

37.7 Binary Search Tree (5)

37.7.1 Binary Search Tree: UGCNET-AUG2016-II: 23 https://gateoverflow.in/69942

The runtime for traversing all the nodes of a binary search tree with n nodes and printing them in an order is

A. O(lg n) B. O(n lg n) C. O(n) D. O(n2 )

ugcnetaug2016ii data-structures binary-search-tree

37.7.2 Binary Search Tree: UGCNET-July-2018-II: 26 https://gateoverflow.in/225860

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
ugcnetjuly2018ii data-structures binary-search-tree

37.7.3 Binary Search Tree: UGCNET-June2016-II: 21 https://gateoverflow.in/57060

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 ugcnetjune2016ii

37.7.4 Binary Search Tree: UGCNET-June2016-III: 35 https://gateoverflow.in/63958

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
ugcnetjune2016iii data-structures binary-search-tree

37.7.5 Binary Search Tree: UGCNET-Sep2013-III: 41 https://gateoverflow.in/59860

Given a binary search trees for a set of n = 5 keys with the following probabilities :
i 0 1 2 3 4 5
pi - 0.15 0.10 0.05 0.10 0.20
qi 0.05 0.10 0.05 0.05 0.05 0.10
The expected optimal cost of the search is

A. 2.65 B. 2.70 C. 2.75 D. 2.80

ugcnetsep2013iii data-structures binary-search-tree

37.8 Binary Tree (8)

37.8.1 Binary Tree: GATE CSE 2007 | Question: 39, UGCNET-June2015-II: 22 https://gateoverflow.in/1237

The inorder and preorder traversal of a binary tree are

d b e a f c g and a b d e c f g, respectively
The postorder traversal of the binary tree is:
A. d e b f g c a B. e d b g f c a
C. e d b f g c a D. d e f g b c a
gatecse-2007 data-structures binary-tree normal ugcnetjune2015ii

37.8.2 Binary Tree: UGCNET-June2012-27 https://gateoverflow.in/55849

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 ugcnetjune2012ii

37.8.3 Binary Tree: UGCNET-June2012-II: 8 https://gateoverflow.in/55613

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

ugcnetjune2012ii data-structures binary-tree

37.8.4 Binary Tree: UGCNET-Oct2020-II: 23 https://gateoverflow.in/349650

A complete n-ary tree is a tree in which each node has n children or no children. Let I be the number of internal nodes
and L be the number of leaves in a complete n-ary tree. If L = 41 , and I = 10 , what is the value of n?

A. 3 B. 4 C. 5 D. 6
ugcnet-oct2020-ii data-structures binary-tree

37.8.5 Binary Tree: UGCNET-Sep2013-II: 11 https://gateoverflow.in/49356

The min. number of nodes in a binary tree of depth d (root at level 0) is

A. (2d + 1) B. (2(d+1) − 1) C. d D. d + 1
binary-tree data-structures ugcnetsep2013ii

37.8.6 Binary Tree: UGCNET-Sep2013-II: 21 https://gateoverflow.in/59073

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

37.8.7 Binary Tree: UGCNET-dec2009-ii-21 https://gateoverflow.in/152857

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.
 ugcnetdec2009ii data-structures binary-tree

37.8.8 Binary Tree: UGCNET-june2009-ii-27 https://gateoverflow.in/154370

In a full binary tree of height k, there are ______ internal nodes .

A. 2k-1
B. 2k-1
C. 2k
D. 2k+1

ugcnetjune2009ii data-structures binary-tree

37.9 Cryptography (1)

37.9.1 Cryptography: UGCNET-Jan2017-II: 24 https://gateoverflow.in/335139

If h is chosen from a universal collection of hash functions and is used to hash n keys into a table of size m, where
n ≤ m, the expected number of collisions involving a particular key x is less than __________.

A. 1 B. 1/n C. 1/m D. n/m

ugcnetjan2017ii cryptography hashing data-structures

37.10 Data Structures (6)

37.10.1 Data Structures: UGCNET-June2012-II: 49 https://gateoverflow.in/55895

Which of the following data structure is linear type?

A. Strings B. Lists C. Queues D. All of the above

data-structures ugcnetjune2012ii

37.10.2 Data Structures: UGCNET-June2012-II: 50 https://gateoverflow.in/55897

To represent hierarchical relationship between elements, which data structure is suitable?

A. Dequeue B. Priority C. Tree D. All of the above

data-structures ugcnetjune2012ii

37.10.3 Data Structures: UGCNET-June2013-III: 49 https://gateoverflow.in/58524

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
ugcnetjune2013iii data-structures

37.10.4 Data Structures: UGCNET-June2016-II: 2 https://gateoverflow.in/63099

The number of different spanning trees in complete graph, K4 and bipartite graph, K2,2 have ____ and ___
respectively.

A. 14, 14 B. 16, 14 C. 16, 4 D. 14, 4

ugcnetjune2016ii data-structures graph-theory

37.10.5 Data Structures: UGCNET-June2016-II: 5 https://gateoverflow.in/63102

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
ugcnetjune2016ii data-structures graph-theory

37.10.6 Data Structures: UGCNET-Sep2013-III: 15 https://gateoverflow.in/59517

Which of the following is the minimum cost for an assignment problem given below?

A B C D
I 5 3 2 8
Jobs Workers II 7 9 2 6
III 6 4 5 7
IV 5 7 7 8

A. 13 B. 16 C. 17 D. 18
ugcnetsep2013iii data-structures

37.11 Graph Algorithms (1)

37.11.1 Graph Algorithms: UGCNET-July-2018-II: 24 https://gateoverflow.in/225862

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
ugcnetjuly2018ii data-structures graph-algorithms

37.12 Graph Connectivity (1)

37.12.1 Graph Connectivity: UGCNET-Sep2013-II: 20 https://gateoverflow.in/49362

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

37.13 Graphs (1)

37.13.1 Graphs: UGCNET-June2010-II: 4 https://gateoverflow.in/67748

S1 : I teach algorithms and maths.

S2 : My professor teaches maths, electronics and computer science.
S3 : I have a student of maths.
S4 : Algorithm is a part of computer science.
S5 : 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 S1
to S5 and edges to represent the associations/relationships amongst the entities/actors as expressed in the sentences S1 to S5
above ?
 A. 2 B. 3 C. 4 D. None of these
ugcnetjune2010ii data-structures graphs

37.14 Hashing (10)

37.14.1 Hashing: UGCNET-AUG2016-III: 32 https://gateoverflow.in/70947

Consider a hash table of size m = 10000, and the hash function h(K) = floor(m(KA mod 1)) for
–
A = (√5– 1)/2 . The key 123456 is mapped to location ______.

A. 46 B. 41 C. 43 D. 48
ugcnetaug2016iii data-structures hashing

37.14.2 Hashing: UGCNET-Dec2012-II: 26 https://gateoverflow.in/56842

A hash function f defined as f(key) = key mod 13 , 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
ugcnetdec2012ii data-structures hashing

37.14.3 Hashing: UGCNET-Dec2015-II: 35 https://gateoverflow.in/62281

The hash function used in double hashing is of the form:

A. h(k, i) = (h1 (k) + h2 (k) + i) mod m B. h(k, i) = (h1 (k) + h2 (k) − i) mod m
C. h(k, i) = (h1 (k) + i h2 (k)) mod m D. h(k, i) = (h1 (k) − i h2 (k)) mod m
ugcnetdec2015ii data-structures hashing

37.14.4 Hashing: UGCNET-July-2018-II: 23 https://gateoverflow.in/225863

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
ugcnetjuly2018ii data-structures hashing

37.14.5 Hashing: UGCNET-July-2018-II: 70 https://gateoverflow.in/225816

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, ___, ___
ugcnetjuly2018ii data-structures hashing

37.14.6 Hashing: UGCNET-June2010-II: 24 https://gateoverflow.in/67880

A chained hash table has an array size of 100. What is the maximum number of entries that can be placed in the table ?
A. 100 B. 200
C. 10000 D. There is no upper limit
ugcnetjune2010ii data-structures hashing

37.14.7 Hashing: UGCNET-June2014-II: 38 https://gateoverflow.in/54601

Searching for an element in the hash table requires O(1) 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
ugcnetjune2014ii hashing data-structures
 37.14.8 Hashing: UGCNET-June2014-III: 64 https://gateoverflow.in/57283

If h is chosen from a universal collection of hash functions and is used to hash n keys into a table of size m, where
n ≤ m, the expected number of collisions involving a particular key K is
A. Less than 1 B. Less than lgn
C. Greater than 1 D. Greater than lgn
ugcnetjune2014iii data-structures hashing

37.14.9 Hashing: UGCNET-June2015-III: 34 https://gateoverflow.in/61259

(√5−1)
Consider a hash table of size m=100 and the hash function h(k)=floor (m(kA mod 1)) for A = 2 = 0.618033 .
Compute the location to which the key k=123456 is placed in hash table

A. 77 B. 82 C. 88 D. 89
ugcnetjune2015iii data-structures hashing

37.14.10 Hashing: UGCNET-dec2009-ii-25 https://gateoverflow.in/152862

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
ugcnetdec2009ii data-structures hashing

37.15 Heap (6)

37.15.1 Heap: UGCNET-Jan2017-II: 23 https://gateoverflow.in/335140

Which of the following is a valid heap?

a. b. d.
c.

A. a B. b C. c D. d
ugcnetjan2017ii data-structures heap

37.15.2 Heap: UGCNET-July-2018-II: 22 https://gateoverflow.in/225864

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
ugcnetjuly2018ii data-structures heap

37.15.3 Heap: UGCNET-June2013-III: 13 https://gateoverflow.in/58278

In any n-element heap, the number of nodes of height h is,

A. less than equal to [ 2nh ] B. greater than [ 2nh ]

[ ] [ ]
 C. greater than [ 2hn+1 ] D. less than equal to [ 2hn+1 ]

ugcnetjune2013iii data-structures heap

37.15.4 Heap: UGCNET-June2015-III: 36 https://gateoverflow.in/61266

The number of nodes in height h in any n-element heap is

A. h B. z h
C. ceil ( znh ) D. ceil ( zh+1
n
)

ugcnetjune2015iii data-structures heap

37.15.5 Heap: UGCNET-Nov2017-iii-20 https://gateoverflow.in/166396

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
ugcnetnov2017-iii data-structures heap

37.15.6 Heap: UGCNET-dec2008-ii-33 https://gateoverflow.in/155357

In a heap, every element is ___________ of all the elements in the subtree.

A. maximum
B. minimum
C. sum
D. product

ugcnetdec2008ii data-structures heap

37.16 Heap Sort (1)

37.16.1 Heap Sort: UGCNET-June2013-II: 28 https://gateoverflow.in/50690

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(n2 )

heap-sort ugcnetjune2013ii

37.17 Infix Prefix (1)

37.17.1 Infix Prefix: UGCNET-AUG2016-II: 25 https://gateoverflow.in/69946

Given the following prefix expression :

∗ + 3 + 3 ↑ 3 + 333
What is the value of the prefix expression ?

A. 2178 B. 2199 C. 2205 D. 2232

ugcnetaug2016ii data-structures infix-prefix

37.18 Linked Lists (3)

37.18.1 Linked Lists: GATE CSE 1994 | Question: 1.17, UGCNET-Sep2013-II: 32 https://gateoverflow.in/2460

Linked lists are not suitable data structures for which one of the following problems?
A. Insertion sort B. Binary search
C. Radix sort D. Polynomial manipulation
gate1994 data-structures linked-lists normal ugcnetsep2013ii
 37.18.2 Linked Lists: UGCNET-AUG2016-II: 21 https://gateoverflow.in/69564

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 O(1) 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.

ugcnetaug2016ii data-structures linked-lists

37.18.3 Linked Lists: UGCNET-dec2009-ii-24 https://gateoverflow.in/152861

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.
ugcnetdec2009ii data-structures linked-lists time-complexity

37.19 Max Heap (1)

37.19.1 Max Heap: UGCNET-June2016-III: 33 https://gateoverflow.in/63955

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]
ugcnetjune2016iii data-structures max-heap

37.20 Priority (1)

37.20.1 Priority: UGCNET-June2013-II: 30 https://gateoverflow.in/50691

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 ugcnetjune2013ii

37.21 Priority Queue (2)

37.21.1 Priority Queue: UGCNET-AUG2016-III: 34 https://gateoverflow.in/70950

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
ugcnetaug2016iii data-structures priority-queue
 37.21.2 Priority Queue: UGCNET-June2010-II: 22 https://gateoverflow.in/67876

What is the most appropriate data structure to implement a priority queue ?

A. Heap B. Circular array C. Linked list D. Binary tree

ugcnetjune2010ii data-structures priority-queue

37.22 Queue (4)

37.22.1 Queue: UGCNET-AUG2016-II: 24 https://gateoverflow.in/69944

Consider the following statements :

S1 : A queue can be implemented using two stacks.
S2 : A stack can be implemented using two queues.
Which of the following is correct ?
A. S1 is correct and S2 is not correct. B. S1 is not correct and S2 is correct.
C. Both S1 and S2 are correct. D. Both S1 and S2 are not correct.
ugcnetaug2016ii data-structures queue stack

37.22.2 Queue: UGCNET-Sep2013-II: 12 https://gateoverflow.in/59030

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-lists

37.22.3 Queue: UGCNET-dec2009-ii-23 https://gateoverflow.in/152859

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

ugcnetdec2009ii data-structures queue

37.22.4 Queue: UGCNET-june2009-ii-26 https://gateoverflow.in/154369

Queue is a …………. list .

A. LIFO B. LILO
C. FILO D. FIFO
ugcnetjune2009ii data-structures queue

37.23 Quicksort (1)

37.23.1 Quicksort: UGCNET-Sep2013-II: 10 https://gateoverflow.in/59025

Suppose that the splits at every level of Quicksort are in proportion 1 − β to β, where 0 < β ≤ 0.5 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 quicksort

37.24 Radix Sort (2)

 37.24.1 Radix Sort: UGCNET-AUG2016-III: 35 https://gateoverflow.in/70951

If there are n integers to sort, each integer has d digits, and each digit is in the set {1, 2, … , k}, radix sort can sort the
numbers in :
A. O(k(n + d)) B. O(d(n + k))
C. O((n + k)lgd) D. O((n + d)lgk)
ugcnetaug2016iii data-structures radix-sort

37.24.2 Radix Sort: UGCNET-July-2018-II: 28 https://gateoverflow.in/225858

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
ugcnetjuly2018ii data-structures radix-sort

37.25 Recursion (1)

37.25.1 Recursion: UGCNET-Jan2017-III: 24 https://gateoverflow.in/335214

A recursive function h, is defined as follows:

h(m) = k, if m = 0
= 1, if m = 1
= 2h(m − 1) + 4h(m − 2), if m ≥ 2
If the value of h(4) is 88 then the value of k is:

A. 0 B. 1 C. 2 D. −1
ugcnetjan2017iii data-structures recursion

37.26 Relational Algebra (1)

37.26.1 Relational Algebra: UGCNET-Oct2020-II: 64 https://gateoverflow.in/349609

Match List I with List II

Let R1 = {(1, 1), (2, 2), (3, 3)} and R2 = {(1, 1), (1, 2), (1, 3), (1, 4)}
List I List II
(A) R1 ∪ R2 (I) {(1, 1), (1, 2), (1, 3), (1, 4), (2, 2), (3, 3)}
(B) R1 – R2 (II) {(1, 1)}
(C) R1 ∩ R2 (III) {(1, 2), (1, 3), (1, 4)}
(D) R2 – R1 (IV ) {(2, 2), (3, 3)}
Choose the correct answer from the options given below:
A. A − I, B − II, C − IV , D − III B. A − I, B − IV , C − III, D − II
C. A − I, B − III, C − II, D − IV D. A − I, B − IV , C − II, D − III
ugcnet-oct2020-ii data-structures relational-algebra

37.27 Spanning Tree (2)

37.27.1 Spanning Tree: UGCNET-AUG2016-III: 33 https://gateoverflow.in/70948

Consider a weighted complete graph G on the vertex set {ν1 , ν2 , . . . . νn } such that the weight of the edge (νi , νj ) is
4|i– j|. The weight of minimum cost spanning tree of G is :

A. 4n2 B. n C. 4n– 4 D. 2n– 2

ugcnetaug2016iii data-structures spanning-tree

37.27.2 Spanning Tree: UGCNET-dec2008-ii-3 https://gateoverflow.in/155027

The total number of spanning trees that can be drawn using five labeled vertices is:
 1. 125
2. 64
3. 36
4. 16

ugcnetdec2008ii data-structures spanning-tree

37.28 Stack (12)

37.28.1 Stack: UGCNET-Dec2012-II: 40 https://gateoverflow.in/57095

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
ugcnetdec2012ii data-structures stack

37.28.2 Stack: UGCNET-Dec2012-III: 17 https://gateoverflow.in/57381

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
ugcnetdec2012iii data-structures stack

37.28.3 Stack: UGCNET-Dec2014-II: 08 https://gateoverflow.in/58787

How many PUSH and POP operations will be needed to evaluate the following expression by reverse polish notation
in a stack machine (A ∗ B) + (C ∗ D/E) ?

A. 4 PUSH and 3 POP instructions B. 5 PUSH and 4 POP instructions

C. 6 PUSH and 2 POP instructions D. 5 PUSH and 3 POP instructions
ugcnetdec2014ii data-structures stack

37.28.4 Stack: UGCNET-Dec2014-II: 21 https://gateoverflow.in/59400

Convert the following infix expression into its equivalent post fix expression (A + B^D)/(E– F) + G

A. ABD^ +EF– /G+ B. ABD+^EF– /G+

C. ABD+ ^EF /– G+ D. ABD^ +EF /– G+
ugcnetdec2014ii data-structures stack

37.28.5 Stack: UGCNET-Jan2017-II: 22 https://gateoverflow.in/335141

The seven elements A, B, C, D, E, F and G are pushed onto a stack in reverse order, i.e., starting from G. 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. A B. B C. F D. G
ugcnetjan2017ii data-structures stack

37.28.6 Stack: UGCNET-June2010-II: 21 https://gateoverflow.in/67874

If we have six stack operationspushing and popping each of A, B and C -such that push (A) must occur before push
(B) which must occur before push (C), then A, C, B is a possible order for the pop operations, since this could be our
sequence : push (A), pop (A), push (B), push (C), pop (C), pop (B). 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. ABC B. CBA C. BAC D. CAB

ugcnetjune2010ii data-structures stack
 37.28.7 Stack: UGCNET-June2012-III: 38 https://gateoverflow.in/56270

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
ugcnetjune2012iii data-structures stack

37.28.8 Stack: UGCNET-June2014-II: 40 https://gateoverflow.in/12114

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

A. 2
B. 3
C. 4
D. 5

ugcnetjune2014ii data-structures stack

37.28.9 Stack: UGCNET-June2014-III: 41 https://gateoverflow.in/57017

The reverse polish notation equivalent to the infix expression ((A + B)∗ C + D)/(E + F + G)

A. AB + C ∗ D + EF + G + / B. AB + C D∗ + EF + G + /
C. AB + C ∗ D + EFG + +/ D. AB + C ∗ D + E + FG + /
ugcnetjune2014iii data-structures stack

37.28.10 Stack: UGCNET-June2016-II: 22 https://gateoverflow.in/63427

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
ugcnetjune2016ii data-structures stack

37.28.11 Stack: UGCNET-June2016-II: 24 https://gateoverflow.in/63429

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
ugcnetjune2016ii data-structures stack

37.28.12 Stack: UGCNET-dec2006-23 https://gateoverflow.in/156087

What is the time required to insert an element in a stack with linked implementation?
(A) O (log 2n) (B) O (n)
(C) O (n log 2n) (D) O (1)

linked-lists stack

37.29 Tree Traversal (1)

37.29.1 Tree Traversal: UGCNET-Dec2015-II: 38 https://gateoverflow.in/61447

The inorder traversal of the following tree is

 A. 2 3 4 6 7 13 15 17 18 18 20
B. 20 18 18 17 15 13 7 6 4 3 2
C. 15 13 20 4 7 17 18 2 3 6 18
D. 2 4 3 13 7 6 15 17 20 18 18

ugcnetdec2015ii data-structures tree-traversal

37.30 Trees (9)

37.30.1 Trees: UGCNET-Dec2012-II: 16 https://gateoverflow.in/56519

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
ugcnetdec2012ii data-structures trees binary-tree

37.30.2 Trees: UGCNET-Dec2014-II: 02 https://gateoverflow.in/58207

A certain tree has two vertices of degree 4, one vertex of degree 3 and one vertex of degree 2. If the other vertices have
degree 1, how many vertices are there in the graph ?

A. 5 B. n– 3 C. 20 D. 11
ugcnetdec2014ii data-structures trees

37.30.3 Trees: UGCNET-Dec2015-II: 5 https://gateoverflow.in/61659

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

ugcnetdec2015ii data-structures trees

37.30.4 Trees: UGCNET-July-2018-II: 29 https://gateoverflow.in/225857

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
ugcnetjuly2018ii data-structures trees

37.30.5 Trees: UGCNET-June2010-II: 23 https://gateoverflow.in/67878

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 log2 n B. About 2 log2 n
C. About n log2 n D. About 2n
ugcnetjune2010ii data-structures trees

37.30.6 Trees: UGCNET-June2010-II: 32 https://gateoverflow.in/67989

Which of the following expression is represented by the parse tree ?

 A. (A + B)∗ C B. A +∗ BC C. A + B ∗ C D. A ∗ C + B
ugcnetjune2010ii data-structures trees

37.30.7 Trees: UGCNET-June2012-II: 13 https://gateoverflow.in/50682

Leaves of which of the following trees are at the same level?

A. Binary tree
B. B-tree
C. AVL-tree
D. Expression tree
ugcnetjune2012ii programming trees

37.30.8 Trees: UGCNET-June2012-III: 36 https://gateoverflow.in/56267

Number of binary trees formed with 5 nodes are

A. 32 B. 36 C. 120 D. 42
ugcnetjune2012iii data-structures trees

37.30.9 Trees: UGCNET-June2016-II: 23 https://gateoverflow.in/63428

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
n n
A. 2 −1 B. 2 +1 C. (n − 1)/2 D. (n + 1)/2
ugcnetjune2016ii data-structures trees

Answer Keys
37.0.1 Q-Q 37.0.2 Q-Q 37.0.3 Q-Q 37.0.4 Q-Q 37.0.5 Q-Q
37.0.6 Q-Q 37.0.7 Q-Q 37.0.8 Q-Q 37.0.9 Q-Q 37.0.10 Q-Q
37.0.11 Q-Q 37.0.12 Q-Q 37.0.13 Q-Q 37.0.14 Q-Q 37.0.15 Q-Q
37.1.1 D 37.2.1 Q-Q 37.3.1 X 37.4.1 C 37.5.1 A
37.6.1 A 37.7.1 Q-Q 37.7.2 Q-Q 37.7.3 D 37.7.4 C
37.7.5 C 37.8.1 A 37.8.2 B 37.8.3 D 37.8.4 C
37.8.5 C 37.8.6 C 37.8.7 Q-Q 37.8.8 Q-Q 37.9.1 A
37.10.1 D 37.10.2 C 37.10.3 B 37.10.4 C 37.10.5 C
37.10.6 C 37.11.1 Q-Q 37.12.1 D 37.13.1 Q-Q 37.14.1 Q-Q
37.14.2 X 37.14.3 C 37.14.4 Q-Q 37.14.5 Q-Q 37.14.6 Q-Q
37.14.7 C 37.14.8 A 37.14.9 C 37.14.10 Q-Q 37.15.1 B
37.15.2 Q-Q 37.15.3 D 37.15.4 X 37.15.5 B 37.15.6 Q-Q
37.16.1 B 37.17.1 Q-Q 37.18.1 B 37.18.2 Q-Q 37.18.3 Q-Q
37.19.1 C 37.20.1 D 37.21.1 Q-Q 37.21.2 Q-Q 37.22.1 Q-Q
37.22.2 C 37.22.3 Q-Q 37.22.4 Q-Q 37.23.1 D 37.24.1 Q-Q
37.24.2 Q-Q 37.25.1 D 37.26.1 D 37.27.1 Q-Q 37.27.2 Q-Q
37.28.1 D 37.28.2 A;C 37.28.3 B 37.28.4 A 37.28.5 B
37.28.6 Q-Q 37.28.7 A 37.28.8 B 37.28.9 A 37.28.10 B
37.28.11 C 37.28.12 Q-Q 37.29.1 D 37.30.1 B 37.30.2 D
37.30.3 D 37.30.4 Q-Q 37.30.5 Q-Q 37.30.6 Q-Q 37.30.7 B
37.30.8 D 37.30.9 C
38 Programming and DS: Programming (85)

38.0.1 UGCNET-Dec2007-II: 11 https://gateoverflow.in/335773

What cannot replace ‘?’ in the following C-code to print all odd numbers less than 100 ?
for (i=1; ? ; i=i+2)
printf("%d\n", i);

1. i ≤ 100
2. i ≤ 101
3. i < 100
4. i < 101

ugcnetdec2007ii

38.0.2 UGCNET-Dec2012-II: 39 https://gateoverflow.in/57082

Match the following with respect to C++ data types :

a. User defined type i. Qualifier
b. Built in type ii. Union
c. Derived Type iii. Void
d. Long double iv. Pointer
Code :
A. a-ii, b-iii, c-iv, d-i B. a-iii, b-i, c-iv, d-ii
C. a-iv, b-i, c-ii, d-iii D. a-iii, b-iv, c-i, d-ii
ugcnetdec2012ii programming

38.0.3 UGCNET-Dec2013-III: 16 https://gateoverflow.in/60398

Match the following with respect to the programming language :

List – I List – II
a. Structured language i. JAVA
b. Non-structured Language ii. BASIC
c. Object oriented Programming Language iii. PASCAL
d. Interpreted Programming Language iv. FORTRAN
Codes :
A. a-iii, b-iv, c-i, d-ii B. a-iv, b-iii, c-ii, d-i
C. a-ii, b-iv, c-i, d-iii D. a-ii, b-iii, c-iv, d-i
ugcnetdec2013iii programming

38.0.4 UGCNET-june2007-12 https://gateoverflow.in/155859

In case of right shift bitwise operator in ‘C’ language, after shifting n bits, the left most n bits:
(A) are always filled with zeroes
(B) are always filled with ones
(C) are filled with zeroes or ones and is machine dependent
(D) none of the above

38.0.5 UGCNET-Dec2013-III: 14 https://gateoverflow.in/60396

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
 ugcnetdec2013iii programming

38.0.6 UGCNET-june2008-ii-14 https://gateoverflow.in/155598

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.

ugcnetjune2008ii

38.0.7 UGCNET-Dec2013-III: 34 https://gateoverflow.in/51869

______ 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 ( 3n
2 )–2
D. 2 lg n – 2
ugcnetdec2013iii programming

38.0.8 UGCNET-june2008-ii-13 https://gateoverflow.in/155571

Consider the following C code:

{ int a=5, b=9;
float r;
r=b/a; }
What is the value of r ?
(A) 1.8 (B) 1.0
(C) 2.0 (D) 0.0

ugcnetjune2008ii

38.0.9 UGCNET-Dec2006-II: 15 https://gateoverflow.in/335656

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
ugcnetdec2006ii

38.0.10 UGCNET-Dec2006-II: 13 https://gateoverflow.in/335658

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. 1 B. 2 C. 3 D. 4
ugcnetdec2006ii

38.0.11 UGCNET-Dec2007-II: 13 https://gateoverflow.in/335771

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);
}

ugcnetdec2007ii

38.0.12 UGCNET-Dec2004-II: 12 https://gateoverflow.in/335385

Consider the following statements,

Int i=4, j=3, k=0;
k=++i - --j + i++---j +j++;

What will be the values of i, j and k after the statement.

A. 7, 2, 8 B. 5, 2, 10 C. 6, 2, 8 D. 4, 2, 8
ugcnetdec2004ii

38.0.13 UGCNET-Dec2015-II: 17 https://gateoverflow.in/62247

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()

ugcnetdec2015ii programming

38.0.14 UGCNET-Sep2013-III: 66 https://gateoverflow.in/59940

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

ugcnetsep2013iii programming

38.0.15 UGCNET-june2009-ii-17 https://gateoverflow.in/154276

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
 ugcnetjune2009ii

38.0.16 UGCNET-Dec2015-III: 9 https://gateoverflow.in/62439

Match the following w.r.t. programming languages :

List – I List – II
(a) JAVA (i) Dynamically object oriented
(b) Phython (ii) Statistically non-object oriented
(c) Prolog (iii) Statistically object oriented
(d) ADA (iv) Dynamically non-object oriented
Codes :
A. (a)-(iii), (b)-(i), (c)-(ii), (d)-(iv) B. (a)-(i), (b)-(iii), (c)-(ii), (d)-(iv)
C. (a)-(i), (b)-(iii), (c)-(iv), (d)-(ii) D. (a)-(ii), (b)-(iv), (c)-(i), (d)-(iii)
ugcnetdec2015iii programming non-gate

38.0.17 UGCNET-June2016-II: 15 https://gateoverflow.in/63119

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

ugcnetjune2016ii programming

38.0.18 UGCNET-Dec2004-II: 14 https://gateoverflow.in/335383

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

ugcnetdec2004ii

38.0.19 UGCNET-June2016-III: 20 https://gateoverflow.in/63941

Match the following types of variables with the corresponding programming languages :
(a) Static variable (i) Local variables in Pascal
(b) Stack dynamic (ii) All variables in APL
(c) Explicit heap dynamic (iii) Fortran 77
(d) Implicit heap dynamic (iv) All Objects in JAVA
Codes :
A. (a)-(i), (b)-(iii), (c)-(iv), (d)-(ii) B. (a)-(iv), (b)-(i), (c)-(iii), (d)-(ii)
C. (a)-(iii), (b)-(i), (c)-(iv), (d)-(ii) D. (a)-(ii), (b)-(i), (c)-(iii), (d)-(iv)
ugcnetjune2016iii programming

38.0.20 UGCNET-June2016-III: 21 https://gateoverflow.in/63942

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
ugcnetjune2016iii programming
38.0.21 UGCNET-Dec2015-II: 45 https://gateoverflow.in/62323

The ____ transfers the executable image of a C++ program from hard disk to main memory

A. Compiler B. Linker C. Debugger D. Loader

ugcnetdec2015ii programming

38.0.22 UGCNET-June2013-III: 50 https://gateoverflow.in/58526

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

ugcnetjune2013iii

38.0.23 UGCNET-june2009-ii-20 https://gateoverflow.in/154279

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

ugcnetjune2009ii

38.0.24 UGCNET-June2014-III: 10 https://gateoverflow.in/55797

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-gate

38.0.25 UGCNET-AUG2016-III: 19 https://gateoverflow.in/70836

Match the following with reference to Functional programming history :

a. Lambda calculus i. Church, 1932
b. Lambda calculus as ii. Wordsworth, 1970
programming language
c. Lazy evaluation iii. Haskel, 1990
d. Type classes iv. Mecarthy, 1960
Codes :
A. a-iv, b-i, c-iii, d-ii B. a-i, b-iv, c-ii, d-iii
C. a-iii, b-ii, c-iv, d-i D. a-ii, b-i, c-iv, d-iii
ugcnetaug2016iii programming

38.0.26 UGCNET-Dec2012-II: 15 https://gateoverflow.in/56518

What is the size of the Unicode character in Windows Operating System?

A. 8-Bits B. 16-Bits C. 32-Bits D. 64-Bits

ugcnetdec2012ii non-gate programming

38.0.27 UGCNET-June2012-III: 1 https://gateoverflow.in/56074

Consider the following Pseudo-code segment:

 k:=0
for i1 :=1 to n
for i2 := 1 to i1
:
:
:
for im :=1 to im−1
k:=k+1
The value of k after the execution of this code shall be

A. C(n + m − 1, m) B. C(n − m + 1, m) C. C(n + m − 1, n) D. C(n − m + 1, n)

ugcnetjune2012iii programming algorithms

38.0.28 UGCNET-Dec2012-III: 39 https://gateoverflow.in/12130

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 ugcnetdec2012iii

38.0.29 UGCNET-Dec2013-II: 20 https://gateoverflow.in/43698

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)
ugcnetdec2013ii

38.0.30 UGCNET-Dec2012-II: 41 https://gateoverflow.in/57096

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
ugcnetdec2012ii programming

38.0.31 UGCNET-Dec2013-III: 15 https://gateoverflow.in/60397

Which of the following correctly describes overloading of functions?

A. Virtual polymorphism B. Transient polymorphism
C. Ad-hoc polymorphism D. Pseudo polymorphism
ugcnetdec2013iii programming

38.1 Abstract Data Type (1)

38.1.1 Abstract Data Type: UGCNET-June2016-III: 19 https://gateoverflow.in/63940

Given the following statements:

a. To implement Abstract Data Type, a programming language b. To implement ADT, a programming language requires some
require a syntactic unit to encapsulate type definition primitive operations that are built in the language processor
c. C++, Ada, Java 5.0, C#2005 provide support for parameterised Which one of the following options is correct?
ADT
A. a, b and c are false B. a, b are true, c is false
C. a is true, b and c are false D. a, b and c are true
ugcnetjune2016iii programming abstract-data-type

38.2 Aliasing (1)

38.2.1 Aliasing: UGCNET-AUG2016-III: 20 https://gateoverflow.in/70838

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

ugcnetaug2016iii programming aliasing

38.3 Arrays (2)

38.3.1 Arrays: UGCNET-June2013-III: 48 https://gateoverflow.in/44976

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
ugcnetjune2013iii programming-in-c arrays

38.3.2 Arrays: UGCNET-June2015-II: 11 https://gateoverflow.in/60955

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. ABCDEFGH1000 B. CDEFGH1000 C. DDEFGHH1000 D. DEFGH1000

ugcnetjune2015ii programming-in-c arrays

38.4 Binary Search Tree (1)

38.4.1 Binary Search Tree: UGCNET-Dec2014-III: 36 https://gateoverflow.in/60633

Suppose that we have numbers between 1 and 1000 in a binary search tree and we want to search for the number 365.
Which of the following sequences could not be the sequence of nodes examined ?

A. 4, 254, 403, 400, 332, 346, 399, 365

B. 926, 222, 913, 246, 900, 260, 364, 365
C. 927, 204, 913, 242, 914, 247, 365
D. 4, 401, 389, 221, 268, 384, 383, 280, 365

ugcnetdec2014iii data-structures binary-search-tree

38.5 Bitwise Operation (1)

38.5.1 Bitwise Operation: UGCNET-Dec2004-II: 11 https://gateoverflow.in/335386

Suppose x and y are two Integer Variables having values 0x5AB6 and 0x61CD respectively. The result (in hex) of
applying bitwise operator and to x and y will be :

1. 0x5089
2. 0x4084
3. 0x78A4
4. 0x3AD1

ugcnetdec2004ii programming-in-c bitwise-operation

38.6 Data Types (2)

 38.6.1 Data Types: UGCNET-Dec2005-II: 11 https://gateoverflow.in/335497

What is the output of the following C -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
ugcnetdec2005ii programming-in-c data-types

38.6.2 Data Types: UGCNET-June2010-II: 15 https://gateoverflow.in/67838

The data type created by the data abstraction process is called

A. Class B. Structure
C. Abstract data type D. User defined data type
ugcnetjune2010ii programming data-types

38.7 Evaluation Postfix (1)

38.7.1 Evaluation Postfix: UGCNET-Dec2013-II: 21 https://gateoverflow.in/60077

What is the value of the postfix expression a b c d + - * (where a=8, b=4, c=2 and d=5)

A. − 38 B. − 83 C. 24 D. -24
ugcnetdec2013ii evaluation-postfix

38.8 Exception Handling (1)

38.8.1 Exception Handling: UGCNET-Dec2012-II: 29 https://gateoverflow.in/57065

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()

ugcnetdec2012ii programming exception-handling

38.9 Expression Evaluation (1)

38.9.1 Expression Evaluation: UGCNET-Dec2004-II: 13 https://gateoverflow.in/335384

What is the value of the arithmetic expression (Written in C)

2 ∗ 3/4 − 3/4 ∗ 2

A. 0 B. 1 C. 1.5 D. None of these

ugcnetdec2004ii programming-in-c expression-evaluation

38.10 File Handling (1)

38.10.1 File Handling: UGCNET-Dec2012-II: 42 https://gateoverflow.in/57099

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

ugcnetdec2012ii programming file-handling

38.11 Graphs (1)

 38.11.1 Graphs: UGCNET-June2012-III: 31 https://gateoverflow.in/56263

The upper bound of computing time of m colouring decision problem is

A. O(nm) B. O(nm ) C. O(nmn ) D. O(nm mn )

ugcnetjune2012iii graphs graph-coloring

38.12 Io Statement (1)

38.12.1 Io Statement: UGCNET-dec2008-ii-26 https://gateoverflow.in/155187

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

ugcnetdec2008ii programming-in-c io-statement

38.13 Java (4)

38.13.1 Java: UGCNET-Dec2012-II: 21 https://gateoverflow.in/56838

Which API is used to draw a circle?

A. Circle () B. Ellipse () C. Round Rect () D. Pie ()

ugcnetdec2012ii programming java bad-question

38.13.2 Java: UGCNET-July-2018-II: 7 https://gateoverflow.in/225879

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

ugcnetjuly2018ii programming-in-c java

38.13.3 Java: UGCNET-June2012-III: 26 https://gateoverflow.in/56228

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

ugcnetjune2012iii programming programming-in-c java object-oriented-programming

38.13.4 Java: UGCNET-June2012-III: 55 https://gateoverflow.in/56313

Match the following with respect to java.util. ∗ class methods :

 (a) Bit Set (i) Time zone getTimezone()
(b) Calender (ii) int hashcode()
(c) Time zone (iii) int nextInt()
(d) Random (iv) Void setID(String tzName)
A. (a)-(ii), (b)-(i), (c)-(iv), (d)-(iii) B. (a)-(iii), (b)-(iv), (c)-(i), (d)-(ii)
C. (a)-(iv), (b)-(iii), (c)-(ii), (d)-(i) D. (a)-(ii), (b)-(i), (c)-(iii), (d)-(iv)
ugcnetjune2012iii programming object-oriented-programming java

38.14 Linked Lists (1)

38.14.1 Linked Lists: UGCNET-Dec2013-II: 22 https://gateoverflow.in/60078

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
ugcnetdec2013ii data-structures linked-lists

38.15 Loop (1)

38.15.1 Loop: UGCNET-Dec2010-II: 14 https://gateoverflow.in/66604

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.

ugcnetdec2010ii programming loop

38.16 Object Oriented Programming (3)

38.16.1 Object Oriented Programming: UGCNET-dec2009-ii-14 https://gateoverflow.in/152706

Encapsulation is

(A) Dynamic binding

(B) A mechanism to associate the code and data.

(C) Data abstraction

(D) Creating new class

ugcnetdec2009ii programming object-oriented-programming

38.16.2 Object Oriented Programming: UGCNET-dec2009-ii-14 https://gateoverflow.in/152705

A __________ is a special method used to initialize the instance variable of a class.

(A) Member function

(B) Destructor

(C) Constructor

(D) Structure
ugcnetdec2009ii programming object-oriented-programming

38.16.3 Object Oriented Programming: UGCNET-dec2009-ii-15 https://gateoverflow.in/152831

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
ugcnetdec2009ii object-oriented-programming

38.17 Operator Precedence (1)

38.17.1 Operator Precedence: UGCNET-June2010-II: 33 https://gateoverflow.in/67994

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. −61 B. 64 C. 512 D. 4096

ugcnetjune2010ii programming operator-precedence

38.18 Parameter Passing (1)

38.18.1 Parameter Passing: GATE CSE 2001 | Question: 2.17 | UGCNET-AUG2016-III: 21 https://gateoverflow.in/735

What is printed by the print statements in the program P 1 assuming call by reference parameter passing?
Program P1()
{
x = 10;
y = 3;
func1(y,x,x);
print x;
print y;
}

func1(x,y,z)
{
y = y + 4;
z = x + y + z
}

A. 10, 3 B. 31, 3 C. 27, 7 D. None of the above

gatecse-2001 programming compiler-design parameter-passing normal runtime-environments ugcnetaug2016iii

38.19 Pointers (2)

38.19.1 Pointers: UGCNET-Dec2014-II: 12 https://gateoverflow.in/59135

What does the following expression means ?

char ∗(∗(∗a [N])())();

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.
 ugcnetdec2014ii programming-in-c pointers

38.19.2 Pointers: UGCNET-June2010-II: 12 https://gateoverflow.in/67829

What will be the output of the following c-code?

void main ()
{
char *p= "ayqm";
char c;
c=++*p;
printf ("%c" , c);
}

A. a B. c C. b D. q
ugcnetjune2010ii programming-in-c pointers

38.20 Programming In C (15)

38.20.1 Programming In C: UGCNET-Dec2013-II: 16 https://gateoverflow.in/60069

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
ugcnetdec2013ii programming-in-c

38.20.2 Programming In C: UGCNET-Dec2013-II: 17 https://gateoverflow.in/60071

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
ugcnetdec2013ii programming-in-c

38.20.3 Programming In C: UGCNET-Dec2014-II: 11 https://gateoverflow.in/59133

What will be the output of the following ′ C ′ code ?

main ()
{ int x = 128;
printf ("\n%d", 1+x++);
}

A. 128 B. 129 C. 130 D. 131

ugcnetdec2014ii programming-in-c

38.20.4 Programming In C: UGCNET-June-2019-II: 22 https://gateoverflow.in/316257

Consider the following C-code fragment running on a 32-bit X86 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 q − p and N is the value of ((int )&(p → c))– ((int)p), then (M, N) is
 A. (1, 1) B. (3, 2) C. (1, 2) D. (4, 4)
ugcnetjune2019ii programming-in-c

38.20.5 Programming In C: UGCNET-June2012-II: 38 https://gateoverflow.in/55882

printf(“%c”, 100);
A. prints 100 B. prints ASCII equivalent of 100
C. prints garbage D. None of the above
non-gate programming-in-c ugcnetjune2012ii

38.20.6 Programming In C: UGCNET-June2013-III: 52 https://gateoverflow.in/58826

Match the following :

a. calloc() i. Frees previously allocated space
b. free() ii. Modifies previously allocated space
c. malloc() iii. Allocates space for array
d. realloc() iv. Allocates requested size of space
Codes :
A. a-iii, b-i, c-iv, d-ii B. a-iii, b-ii, c-i, d-iv
C. a-iii, b-iv, c-i, d-ii D. a-iv, b-ii, c-iii, d-i
ugcnetjune2013iii programming-in-c

38.20.7 Programming In C: UGCNET-June2014-II: 42 https://gateoverflow.in/55189

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
ugcnetjune2014ii programming programming-in-c

38.20.8 Programming In C: UGCNET-June2014-II: 43 https://gateoverflow.in/55191

While (87) printf(“computer”); The above C statement will

A. print “computer” 87 times B. print “computer” 0 times
C. print “computer” 1 times D. print “computer” infinite times
ugcnetjune2014ii programming-in-c

38.20.9 Programming In C: UGCNET-June2014-III: 11 https://gateoverflow.in/55800

Match the following with respect to the jump statements :

List – I List – II
a. return i. The conditional test and increment portions
b. goto ii. A value associated with it
c. break iii. Requires a label for operation
d. continue iv. An exit from only the innermost loop
Codes :
A. a-ii, b-iii, c-iv, d-i B. a-iii, b-iv, c-i, d-ii
C. a-iv, b-iii, c-ii, d-i D. a-iv, b-iii, c-i, d-ii
ugcnetjune2014iii programming programming-in-c

38.20.10 Programming In C: UGCNET-June2015-II: 13 https://gateoverflow.in/60957

Given that x = 7.5, j = −1.0, n = 1.0, m = 2.0 the value of − − x + j == x > n >= m is:

A. 0 B. 1 C. 2 D. 3
ugcnetjune2015ii programming-in-c
 38.20.11 Programming In C: UGCNET-June2016-II: 11 https://gateoverflow.in/63105

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
ugcnetjune2016ii programming-in-c

38.20.12 Programming In C: UGCNET-June2016-II: 12 https://gateoverflow.in/57055

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

ugcnetjune2016ii programming-in-c

38.20.13 Programming In C: UGCNET-Sep2013-II: 35 https://gateoverflow.in/59240

Assume that x and y 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

38.20.14 Programming In C: UGCNET-Sep2013-III: 54 https://gateoverflow.in/44499

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

ugcnetsep2013iii programming-in-c

38.20.15 Programming In C: UGCNET-june2007-11 https://gateoverflow.in/155856

The following loop in ‘C’:

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

programming-in-c

38.21 Programming Paradigms (1)

 38.21.1 Programming Paradigms: GATE CSE 2005 | Question: 3, UGCNET-June2012-III: 15
https://gateoverflow.in/1345
A common property of logic programming languages and functional languages is:
A. both are procedural languages B. both are based on λ-calculus
C. both are declarative D. both use Horn-clauses
gatecse-2005 programming normal ugcnetjune2012iii programming-paradigms non-gate

38.22 Pseudocode (1)

38.22.1 Pseudocode: UGCNET-June-2019-II: 21 https://gateoverflow.in/316258

Consider the following pseudo-code fragment in which an invariant for the loop is “ m∗ xk = pn and k ≥ 0 ” (here, p
and n are integer variable that have been initialized):
/* Pre-conditions : p ≥ 1 ∧ n ≥ 0 */
/* Assume that overflow never occurs */
int x = p ; int k = n; int m = 1;
while (k <> 0) {
if (k is odd) then m = m∗ x ;
x = x∗ x ;
k = ⌊k/2⌋ ; /* floor (k/2) */
}
Which of the following must be true ar the end of the while loop?

A. x = pn B. m = pn C. p = xn D. p = mn
ugcnetjune2019ii pseudocode

38.23 Row Major Address Calculation (1)

38.23.1 Row Major Address Calculation: UGCNET-Dec2014-II: 24 https://gateoverflow.in/59408

Consider an array A [20, 10], assume 4 words per memory cell and the base address of array A is 100. What is the
address of A [11, 5] ? Assume row major storage.

A. 560 B. 565 C. 570 D. 575

ugcnetdec2014ii arrays row-major-address-calculation

38.24 Storage Classes In C (2)

38.24.1 Storage Classes In C: UGCNET-June2014-II: 41 https://gateoverflow.in/55186

Match the following :

List – I List – II
a. Automatic Storage i. Scope of the variable is global
Class
b. Register Storage ii. Value of the variable persists between
Class different function calls
c. Static Storage iii. Value stored in memory and local to the block
Class in which the variable is defined
d. External Storage iv. value stored in CPU registers
class
Codes :
A. a-iii; b-iv; c-i; d-ii B. a-iii; b-iv; c-ii; d-i
C. a-iv; b-iii; c-ii; d-ii D. a-iv; b-iii; ci; d-ii
ugcnetjune2014ii programming-in-c storage-classes-in-c
 38.24.2 Storage Classes In C: UGCNET-june2009-ii-16 https://gateoverflow.in/154275

Which of the following does not represent a valid storage class in ’c’?
A. automatic B. static
C. union D. extern
ugcnetjune2009ii programming-in-c storage-classes-in-c

38.25 Tree Traversal (1)

38.25.1 Tree Traversal: UGCNET-June2015-II: 23 https://gateoverflow.in/60975

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
ugcnetjune2015ii data-structures tree-traversal

38.26 Undefined Behaviour (1)

38.26.1 Undefined Behaviour: UGCNET-june2009-ii-15 https://gateoverflow.in/154274

What is the value of ‘b′ after the execution of the following code statements :
C = 10;
B = + + c + + + c;
A. 20
B. 22
C. 23
D. None

ugcnetjune2009ii programming-in-c undefined-behaviour bad-question

38.27 Variable Binding (1)

38.27.1 Variable Binding: GATE IT 2007 | Question: 34, UGCNET-Dec2012-III: 52 https://gateoverflow.in/3467

Consider the program below in a hypothetical programming language which allows global variables and a choice of
static or dynamic scoping.
int i;
program main()
{
i = 10;
call f();
}

procedure f()
{
int i = 20;
call g ();
}
procedure g()
{
print i;
}

Let x be the value printed under static scoping and y be the value printed under dynamic scoping. Then, x and y are:

A. x = 10, y = 20 B. x = 20, y = 10 C. x = 10, y = 10 D. x = 20, y = 20

gateit-2007 programming variable-binding normal ugcnetdec2012iii

38.28 Variable Scope (4)

38.28.1 Variable Scope: UGCNET-June2005-II: 11 https://gateoverflow.in/335452

After 3 calls of the c function bug ( ) below, the values of i and j will be :
int j = 1;
bug ()
{
 static int i = 0; int j = 0;
i++; j++;
return (i);
}

A. i = 0, j = 0 B. i = 3, j = 3 C. i = 3, j = 0 D. i = 3, j = 1
ugcnetjune2005ii programming-in-c variable-scope

38.28.2 Variable Scope: UGCNET-June2005-II: 12 https://gateoverflow.in/335451

Find the output of the following “C” code :

Main()
{ int x=20, y=35;
x=y++ + x++;
y=++y + ++x;
printf (“%d, %d\n”, x, y);
}

A. 55, 93 B. 53, 97 C. 56, 95 D. 57, 94

ugcnetjune2005ii programming-in-c variable-scope

38.28.3 Variable Scope: UGCNET-June2005-II: 15 https://gateoverflow.in/335448

Main()
{ char *str="abcde";
printf("%c",*str);
printf("%c",*str++);
printf("%c",*(str++));
printf("%s",str);
}

The output of the above ‘C ′ code will be :

A. a a c b c d e B. a a c c c d e
C. a a b c d e D. None of these
ugcnetjune2005ii programming-in-c variable-scope

38.28.4 Variable Scope: UGCNET-dec2008-ii-25 https://gateoverflow.in/155185

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

ugcnetdec2008ii programming-in-c variable-scope

Answer Keys
38.0.1 Q-Q 38.0.2 A 38.0.3 A 38.0.4 C 38.0.5 B
38.0.6 Q-Q 38.0.7 C 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 A 38.0.14 C 38.0.15 C
38.0.16 B 38.0.17 A 38.0.18 A 38.0.19 C 38.0.20 D
38.0.21 D 38.0.22 X 38.0.23 Q-Q 38.0.24 B 38.0.25 Q-Q
38.0.26 B 38.0.27 A 38.0.28 B 38.0.29 A 38.0.30 C
38.0.31 C 38.1.1 D 38.2.1 Q-Q 38.3.1 A 38.3.2 D
38.4.1 C 38.5.1 B 38.6.1 Q-Q 38.6.2 Q-Q 38.7.1 D
38.8.1 A 38.9.1 Q-Q 38.10.1 D 38.11.1 C 38.12.1 Q-Q
38.13.1 B 38.13.2 Q-Q 38.13.3 C 38.13.4 A 38.14.1 C
38.15.1 Q-Q 38.16.1 Q-Q 38.16.2 Q-Q 38.16.3 Q-Q 38.17.1 Q-Q
38.18.1 B 38.19.1 X 38.19.2 Q-Q 38.20.1 B 38.20.2 D
38.20.3 B 38.20.4 C 38.20.5 B 38.20.6 A 38.20.7 C
38.20.8 D 38.20.9 A 38.20.10 A 38.20.11 C 38.20.12 A
38.20.13 B 38.20.14 A 38.20.15 Q-Q 38.21.1 C 38.22.1 B
38.23.1 A 38.24.1 B 38.24.2 Q-Q 38.25.1 A 38.26.1 Q-Q
38.27.1 A 38.28.1 Q-Q 38.28.2 Q-Q 38.28.3 Q-Q 38.28.4 Q-Q
39 Theory of Computation (139)

39.0.1 UGCNET-Dec2014-III: 63 https://gateoverflow.in/61488

According to pumping lemma for context free languages :

Let L be an infinite context free language, then there exists some positive integer m such that any w ∈ L with
|w| ≥ m can be decomposed as w = uvxyz

A. With |vxy| ≤ m such that uvi xy i z ∈ L for all i = 0, 1, 2

B. With |vxy| ≤ m , and |vy| ≥ 1 , such that uvi xy i z ∈ L for all i = 0, 1, 2, … … .
C. With |vxy| ≥ m , and |vy| ≤ 1 , such that uvi xy i z ∈ L for all i = 0, 1, 2, … … .
D. With |vxy| ≥ m , and |vy| ≥ 1 , such that uvi xy i z ∈ L for all i = 0, 1, 2, … … .

ugcnetdec2014iii theory-of-computation

39.0.2 UGCNET-Dec2015-III: 73 https://gateoverflow.in/61455

Consider Language A defined over the alphabet Σ = {0, 1} as A = {0⌊n/2⌋ 1n : n >= 0}

The expression ⌊n/2⌋ means the floor of n/2, or what you get by rounding n/2 down to the nearest integer.
Which of the following is not an example of a string in A?

A. 011 B. 0111 C. 0011 D. 001111

ugcnetdec2015iii theory-of-computation

39.0.3 UGCNET-Dec2006-II: 1 https://gateoverflow.in/335670

Which of the regular expressions corresponds to this grammar ?

S → AB/AS, A → a/aA, B → b

A. aa∗ b+ B. aa∗ b C. (ab)∗ D. a(ab)∗

ugcnetdec2006ii

39.0.4 UGCNET-Dec2004-II: 3 https://gateoverflow.in/335394

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)
ugcnetdec2004ii

39.0.5 UGCNET-Dec2015-III: 27 https://gateoverflow.in/40678

There are exactly ____ different finite automata with three states x, y and z over the alphabet {a, b} where x is always
the start state

A. 64 B. 256 C. 1024 D. 5832

ugcnetdec2015iii theory-of-computation

39.0.6 UGCNET-June2013-II: 24 https://gateoverflow.in/58015

Given a Non-deterministic Finite Automaton (NFA) with states p and r as initial and final states respectively and
transition table as given below :
 a b
p - q
q r s
r r s
s r s

The minimum number of states required in Deterministic Finite Automaton (DFA) equivalent to NFA is

A. 5 B. 4 C. 3 D. 2
ugcnetjune2013ii theory-of-computation

39.0.7 UGCNET-Dec2012-III: 50 https://gateoverflow.in/57720

Which of the following definitions generates the same Language as L, where L = {W W R ∣ W ∈ {a, b} *}?

A. S → asb ∣ bsa ∣∈
B. S → asa ∣ bsb ∣∈
C. S → asa ∣ bsa ∣ asa ∣ bsb ∣∈
D. S → asa ∣ bsa ∣ asa ∣ bsb∣

ugcnetdec2012iii theory-of-computation

39.0.8 UGCNET-Dec2015-II: 15 https://gateoverflow.in/62240

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

ugcnetdec2015ii theory-of-computation

39.0.9 UGCNET-Dec2012-II: 7 https://gateoverflow.in/56509

The ‘C’ language is

A. Context free language B. Context sensitive language
C. Regular language D. None of the above
ugcnetdec2012ii theory-of-computation

39.0.10 UGCNET-June2012-III: 52 https://gateoverflow.in/56305

Match the following :

(i) Regular grammer (a) Pushdown automaton
(ii) Context free grammer (b) Linear bounded automaton
(iii) Unrestricted grammer (c) Deterministic finite automaton
(iv) Context sensitive grammer (d) Turing machine
A. (i)-(c), (ii)-(a), (iii)-(b), (iv)-(d) B. (i)-(c), (ii)-(a), (iii)-(b), (iv)-(d)
C. (i)-(c), (ii)-(b), (iii)-(a), (iv)-(d) D. (i)-(c), (ii)-(b), (iii)-(d), (iv)-(a)
ugcnetjune2012iii theory-of-computation

39.0.11 UGCNET-June2013-III: 36 https://gateoverflow.in/58496

The grammar with production rules S → aSb ∣ SS ∣ λ generates language L given by:

A. L = {w ∈ {a, b}∗ ∣ na (w) = nb (w) and na (v) ≥ nb (v) where v is any prefix of w}
B. L = {w ∈ {a, b}∗ ∣ na (w) = nb (w) and na (v) ≤ nb (v) where v is any prefix of w}
C. L = {w ∈ {a, b}∗ ∣ na (w) ≠ nb (w) and na (v) ≥ nb (v) where v is any prefix of w}
D. L = {w ∈ {a, b}∗ ∣ na (w) ≠ nb (w) and na (v) ≤ nb (v) where v is any prefix of w}
 ugcnetjune2013iii theory-of-computation

39.0.12 UGCNET-Dec2012-III: 57 https://gateoverflow.in/51049

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 ugcnetdec2012iii

39.0.13 UGCNET-Dec2007-II: 3 https://gateoverflow.in/335781

A context free grammar is :

A. type 0 B. type 1 C. type 2 D. type 3

ugcnetdec2007ii

39.0.14 UGCNET-Dec2012-III: 45 https://gateoverflow.in/51355

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 ugcnetdec2012iii

39.0.15 UGCNET-June2012-III: 25, UGCNET-Dec2013-III: 42 https://gateoverflow.in/56223

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
ugcnetjune2012iii ugcnetdec2013iii theory-of-computation

39.0.16 UGCNET-Dec2015-III: 23 https://gateoverflow.in/62478

Match the following :

List – I List – II
(a) {an bn
∣ n > 0} is a deterministic (i) but not recursive language
context free language
(b) The complement of {an bn an ∣ n > 0} (ii) but not context free language
is a context free language
(c) {a bn an } is a context sensitive
n (iii) but cannot be accepted by a
language deterministic pushdown
automaton
(d) L is a recursive language (iv) but not regular
Codes :
A. (a)-(i), (b)-(ii), (c)-(iii), (d)-(iv) B. (a)-(i), (b)-(ii), (c)-(iv), (d)-(iii)
C. (a)-(iv), (b)-(iii), (c)-(ii), (d)-(i) D. (a)-(iv), (b)-(iii), (c)-(i), (d)-(ii)
ugcnetdec2015iii theory-of-computation

39.0.17 UGCNET-Sep2013-II: 18 https://gateoverflow.in/50842

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

39.0.18 UGCNET-June2015-III: 63 https://gateoverflow.in/61428

Given the following grammars:

G1 S → AB ∣ aaB
A → aA ∣ ϵ
B → bB ∣ ϵ
G2 : S → A ∣ B
A → aAb ∣ ab
B → abB ∣ ϵ
Which of the following is correct?

A. G1 is ambiguous and G2 is unambiguous grammars

B. G1 is unambiguous and G2 is ambiguous grammars
C. both G1 and G2 are ambiguous grammars
D. both G1 and G2 are unambiguous grammars

ugcnetjune2015iii theory-of-computation compiler-design

39.0.19 UGCNET-Dec2013-III: 41 https://gateoverflow.in/60715

The Greibach normal form grammar for the language L = {an bn+1 ∣ n ≥ 0} is

A. S → a SB, B → bB ∣ λ B. S → a SB, B → bB ∣ b
C. S → a SB ∣ b, B → b D. S → a Sb ∣ b
ugcnetdec2013iii theory-of-computation

39.0.20 UGCNET-June2013-III: 40 https://gateoverflow.in/58507

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
ugcnetjune2013iii theory-of-computation

39.0.21 UGCNET-NOV2017-III: 51 https://gateoverflow.in/222092

39.0.22 UGCNET-NOV2017-III: 63 https://gateoverflow.in/222088

Consider the following languages :

L1 = {a m bn | m ≠ n}
L2 = {a m bn | m = 2n+1}
L3 = {a m bn | m ≠ 2n}

Which one of the following statement is correct ?

1. Only L1 and L 2 are context free languages

2. Only L1 and L 3 are context free languages
3. Only L2 and L 3 are context free languages
4. L1, L 2 and L 3 are context free languages
39.0.23 UGCNET-June2013-III: 39 https://gateoverflow.in/58506

Match the following :

a. Context sensitive language i. Deterministic finite automation
b. Regular grammar ii. Recusive enumerable
c. Conext free grammar iii. Recursive language
d. Unrestricted grammar iv. Pushdown automation
Codes:
A. a-ii, b-i, c-iv, d-iii B. a-iii, b-iv, c-i, d-ii
C. a-iii, b-i, c-iv, d-ii D. a-ii, b-iv, c-i, d-iii
ugcnetjune2013iii theory-of-computation

39.0.24 UGCNET-Dec2013-III: 21 https://gateoverflow.in/60416

Given the following statements:

S1 : The grammars S → asb ∣ bsa ∣ ss ∣ a and S → asb ∣ bsa ∣ a are not equivalent.
S2 : The grammars S → ss ∣ sss ∣ asb ∣ bsa ∣ λ and S → ss ∣ asb ∣ bsa ∣ λ are equivalent.
A. S1 is correct and S2 is not correct B. Both S1 ad S2 are correct
C. S1 is not correct and S2 is correct D. Both S1 ad S2 are not correct
ugcnetdec2013iii theory-of-computation

39.0.25 UGCNET-Dec2007-II: 5 https://gateoverflow.in/335779

Consider a Moore machine M whose digraph is :

Then L(M), 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
ugcnetdec2007ii

39.0.26 UGCNET-AUG2016-III: 56 https://gateoverflow.in/136004

Given a Turing Machine M = ({q0 , q1 }, {0, 1}, {0, 1, B}, δ, B, {q1 })

Where δ is a transition function defined as δ(q0 , 0) = (q0 , 0, R) δ(q0 , B) = (q1 , B, R) The language L(M) accepted by Turing
machine is given as :

(1) 0* 1*

(2) 00*

(3) 10*

(4) 1*0*

39.0.27 UGCNET-June2015-III: 62 https://gateoverflow.in/61426

Given the following two statements:

S1 : If L1 and L2 are recursively enumerable languages over |Sigma, then L1 ∪ \L2 and L1 ∩ L2 are also recursively
enumerable.
S2 : The set of recursively enumerable languages is countable.
Which of the following is true?
A. S1 is correct and S2 is not correct B. S1 is not correct and S2 is correct
C. Both S1 and S2 are not correct D. Both S1 and S2 are correct
ugcnetjune2015iii theory-of-computation
 39.0.28 UGCNET-june2009-ii-35 https://gateoverflow.in/154486

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
ugcnetjune2009ii

39.1 Cfg (1)

39.1.1 Cfg: UGCNET-June2012-III: 28 https://gateoverflow.in/56260

Which one of the following is not a Greibach Normal form grammar?

S → a ∣ bA ∣ aA ∣ bB
(i) A → a
B→b
S → a ∣ aA ∣ AB
(ii) A → a
B→b
S → a ∣ A ∣ aA
(iii)
A→a

A. (i) and (ii) B. (i) and (iii) C. (ii) and (iii) D. (i), (ii) and (iii)
ugcnetjune2012iii theory-of-computation cfg

39.2 Chomsky Normal Form (1)

39.2.1 Chomsky Normal Form: UGCNET-Dec2012-III: 53 https://gateoverflow.in/44004

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 2i+1 B. no greater than 2i
C. no greater than 2i−1 D. no greater than i
chomsky-normal-form ugcnetdec2012iii

39.3 Closure Property (2)

39.3.1 Closure Property: UGCNET-Dec2012-III: 38 https://gateoverflow.in/57671

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

ugcnetdec2012iii theory-of-computation closure-property

39.3.2 Closure Property: UGCNET-June2012-II: 40 https://gateoverflow.in/55885

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 ugcnetjune2012ii

39.4 Cnf (1)

 39.4.1 Cnf: UGCNET-July-2018-II: 35 https://gateoverflow.in/225851

To obtain a string of n Terminals from a given Chomsky normal from grammar, the number of productions to be used
is

A. 2n − 1 B. 2n C. n + 1 D. n2
ugcnetjuly2018ii theory-of-computation cnf

39.5 Complement (1)

39.5.1 Complement: UGCNET-AUG2016-III: 23 https://gateoverflow.in/70923

Let Σ = a, b and language L = aa, bb . Then, the complement of L is

A. {λ, a, b, ab, ba} ∪ {w ∈ {a, b}∗ ||w| > 3}

B. {a, b, ab, ba} ∪ {w ∈ {a, b}∗ ||w| ≥ 3}
C. {w ∈ {a, b}∗ ||w| > 3} ∪ {a, b, ab, ba}
D. {λ, a, b, ab, ba} ∪ {w ∈ {a, b}∗ ||w| ≥ 3}

ugcnetaug2016iii theory-of-computation complement

39.6 Context Free Grammars (7)

39.6.1 Context Free Grammars: UGCNET-AUG2016-III: 57 https://gateoverflow.in/71612

Let G = (V , T, S, P ) be a context-free grammar such that every one of its productions is of the form A → ν , with
|ν| = k > 1 . The derivation tree for any string W ∈ L(G) has a height such that
(|W |−1) B. logk |W | ≤ h
A. h < k−1
(|W |−1) (|W |−1)
C. logk |W | < h < k−1 D. logk |W | ≤ h ≤ k−1
ugcnetaug2016iii theory-of-computation context-free-grammars

39.6.2 Context Free Grammars: UGCNET-Dec2013-II: 27 https://gateoverflow.in/60210

The context free grammar for the language:

L = {an bm ∣ n ≤ m + 3, n ≥ 0, m ≥ 0} is

A. S → aaa A; A → aAb ∣ B, B → Bb ∣ λ
B. S → aaaA ∣ λ, A → aAb ∣ B, B → Bb ∣ λ
C. S → aaaA ∣ aaA ∣ λ, A → aAb ∣ B, B → Bb ∣ λ
D. S → aaaA ∣ aa A ∣ aA ∣ λ, A → aAb ∣ B, B → Bb ∣ λ

ugcnetdec2013ii theory-of-computation context-free-grammars

39.6.3 Context Free Grammars: UGCNET-Dec2014-II: 35 https://gateoverflow.in/59640

The following Context-Free Grammar (CFG) :

S → aB|bA
A → a|as|bAA
B → b|bs|aBB
will generate
A. Odd numbers of a′ s and odd numbers of b′ s B. Even numbers of a′ s and even numbers of b′ s
C. Equal numbers of a′ s and b′ s D. Different numbers of a′ s and b′ s
ugcnetdec2014ii theory-of-computation context-free-grammars

39.6.4 Context Free Grammars: UGCNET-Jan2017-III: 22 https://gateoverflow.in/335216

Let G = (V , T, S, P ) be a context-free grammer such that every one of its productions is of the form A → v , with
∣v ∣= K > 1 . The derivation tree for any W ∈ L(G) has a height h such that

∣ W ∣≤ h ≤ ( )
 A. logK ∣ W ∣≤ h ≤ logK ( )
∣W∣−1
K−1
B. logK ∣ W ∣≤ h ≤ logK (K ∣ W ∣)
C. logK ∣ W ∣≤ h ≤ K logK ∣ W∣
D. logK |W ∣≤ h ≤ ( )
∣W∣–1
K−1

ugcnetjan2017iii context-free-grammars theory-of-computation

39.6.5 Context Free Grammars: UGCNET-June2013-III: 38 https://gateoverflow.in/58501

For every context free grammar (G) there exists an algorithm that passes any w ∈ L(G) in number of steps
proportional to
A. ln ∣ w∣ B. ∣w∣
C. ∣w∣2 D. ∣w∣3
ugcnetjune2013iii theory-of-computation context-free-grammars

39.6.6 Context Free Grammars: UGCNET-June2015-III: 61 https://gateoverflow.in/61424

A context free grammar for L = {w ∣ n0 (w) > n1 (w)} is given by:

A. S → 0 ∣ 0S ∣ 1SS
B. S → 0S ∣ 1S ∣ 0SS ∣ 1SS ∣ 0 ∣ 1
C. S → 0 ∣ 0S ∣ 1SS ∣ S1S ∣ SS1
D. S → 0S ∣ 1S ∣ 0 ∣ 1

ugcnetjune2015iii theory-of-computation context-free-grammars

39.6.7 Context Free Grammars: UGCNET-dec2009-ii-34 https://gateoverflow.in/152908

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)
ugcnetdec2009ii theory-of-computation context-free-grammars

39.7 Context Free Languages (7)

39.7.1 Context Free Languages: UGCNET-Dec2011-II: 38 https://gateoverflow.in/64061

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.

ugcnetdec2011ii theory-of-computation context-free-languages

39.7.2 Context Free Languages: UGCNET-Jan2017-III: 23 https://gateoverflow.in/335215

Given the following two languages :

L1 = {an bn , ∣ n ≥ 0, n ≠ 100}
L2 = {w ∈ {a, b, c}∗ ∣ na (w) = nb (w) = nc (w)}
Which of the following options is correct?

A. Both L1 and L2 are not context free language

B. Both L1 and L2 are context free language
C. L1 is context free language, L2 is not context free language
D. L1 is not context free language, L2 is context free language
 ugcnetjan2017iii theory-of-computation context-free-languages

39.7.3 Context Free Languages: UGCNET-June-2019-II: 77 https://gateoverflow.in/316202

How can the decision algorithm be constructed for deciding whether context-free language L is finite?

a. By constructing redundant
b. By
CFG
constructing
G in CNF generating
non-redundant
c. By
language
constructing
CFG G L in CNF Which
non-redundant
generating CFGof G
theinfollowing
language L is correct?
CNF generating language L − {∧} ( ∧ stands for

A. a only B. b only C. c only D. None of a, b and c

ugcnetjune2019ii context-free-languages

39.7.4 Context Free Languages: UGCNET-June2012-III: 39 https://gateoverflow.in/56273

The following CFG S → aB ∣ bA, A → a ∣ as ∣ bAA, B → b ∣ bs ∣ aBB 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
ugcnetjune2012iii theory-of-computation context-free-languages

39.7.5 Context Free Languages: UGCNET-June2014-II: 09 https://gateoverflow.in/49225

The context free grammar for the language L = {an bm ck ∣ k =∣ n − m ∣, n ≥ 0, m ≥ 0, k ≥ 0} is

A. S → S1 S3 , S1 → aS1 c ∣ S2 ∣ λ, S2 → aS2 b ∣ λ, S3 → aS3 b ∣ S4 ∣ λ, S4 → bS4 c ∣ λ

B. S → S1 S3 , S1 → aS1 S2 c ∣ λ, S2 → aS2 b ∣ λ, S3 → aS3 b ∣ S4 ∣ λ, S4 → bS4 c ∣ λ
C. S → S1 ∣ S2 , S1 → aS1 S2 c ∣ λ, S2 → aS2 b ∣ λ, S3 → aS3 b ∣ S4 ∣ λ, S4 → bS4 c ∣ λ
D. S → S1 ∣ S3 , S1 → aS1 c ∣ S2 ∣ λ, S2 → aS2 b ∣ λ, S3 → aS3 b ∣ S4 ∣ λ, S4 → bS4 c ∣ λ

ugcnetjune2014ii theory-of-computation context-free-languages

39.7.6 Context Free Languages: UGCNET-June2016-III: 56 https://gateoverflow.in/360641

Let L = {0n 1n |n ≥ 0} be a context free language. Which of the following is correct?

¯¯
¯¯
A. L is context free and Lk is not context free for any k ≥ 1
¯¯
¯¯
B. L is not context free and Lk is context free for any k ≥ 1
C. Both ¯¯
¯¯
L and Lk for any k ≥ 1 are context free
¯¯
¯¯
D. Both L and Lk for any k ≥ 1 are not context free

ugcnetjune2016iii context-free-languages

39.7.7 Context Free Languages: UGCNET-Oct2020-II: 29 https://gateoverflow.in/349644

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

ugcnet-oct2020-ii theory-of-computation context-free-languages

39.8 Context Sensitive (2)

39.8.1 Context Sensitive: UGCNET-Dec2015-III: 22 https://gateoverflow.in/62476

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
ugcnetdec2015iii theory-of-computation closure-property context-sensitive
 39.8.2 Context Sensitive: UGCNET-July-2018-II: 37 https://gateoverflow.in/225849

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
ugcnetjuly2018ii theory-of-computation context-sensitive

39.9 Decidability (4)

39.9.1 Decidability: UGCNET-June-2019-II: 79 https://gateoverflow.in/316200

Which of the following problems is/are decidable problem(s) (recursively enumerable) on turing machine M ?

∣ω∣
=ϕ
a. G is a CFG with L(G) b. There exist two TMs Mc.
1 and
MM is a2 TM
suchthat
thataccepts
L(M) ω ⊆ using
{L(Mat1 )most
∪ L(2M )} =oflanguage
2cells tape of all TMs​​.

A. a and b only B. a only C. a, b and c D. c only

ugcnetjune2019ii decidability turing-machine

39.9.2 Decidability: UGCNET-Nov2017-iii-22 https://gateoverflow.in/166398

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

ugcnetnov2017-iii theory-of-computation decidability

39.9.3 Decidability: UGCNET-Oct2020-II: 55 https://gateoverflow.in/349618

Let G1 and G2 be arbitrary context free languages and R an arbitrary regular language. Consider the following
problems:

a. Is L(G1 ) = L(G2 ) ? b. Is L(G2 ) ≤ L(G1 ) ? c. Is L(G1 ) = R ? Which of the problems are undecidable?
Choose the correct answer from the options given
below:

A. (a) only B. (b) only C. (a) and (b) only D. (a), (b) and (c)
ugcnet-oct2020-ii theory-of-computation decidability

39.9.4 Decidability: UGCNET-Oct2020-II: 87 https://gateoverflow.in/349586

Given below are two statements:

Statement I : The problem “Is L1 ∧ L2 = ϕ ?” is undecidable for context sensitive languages L1 and L2
Statement II : The problem “Is W ∈ L ?” is decidable for context sensitive language L. (where W is a string).
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

ugcnet-oct2020-ii theory-of-computation decidability

39.10 Expression (1)

39.10.1 Expression: UGCNET-Dec2015-III: 26 https://gateoverflow.in/48607

The context free grammar given by

S → XY X
X → aX ∣ bX ∣ λ
Y → bbb
 generates the language which is defined by regular expression:
A. (a + b)∗ bbb B. abbb(a + b)∗
C. (a + b)∗ (bbb)(a + b)∗ D. (a + b)(bbb)(a + b)∗
theory-of-computation regular-expressions finite-automata expression ugcnetdec2015iii

39.11 Finite Automata (6)

39.11.1 Finite Automata: UGCNET-July-2018-II: 31 https://gateoverflow.in/225855

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
ugcnetjuly2018ii theory-of-computation finite-automata

39.11.2 Finite Automata: UGCNET-July-2018-II: 32 https://gateoverflow.in/225854

The finite state machine given in figure below recognizes:

A. anu string of odd number of a's

B. anu 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

ugcnetjuly2018ii theory-of-computation finite-automata

39.11.3 Finite Automata: UGCNET-June2015-III: 19 https://gateoverflow.in/61228

Minimal deterministic finite automaton for the language L = {0n ∣ n ≥ 0, n ≠ 4} 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
ugcnetjune2015iii theory-of-computation finite-automata

39.11.4 Finite Automata: UGCNET-June2015-III: 21 https://gateoverflow.in/61232

The transition function for the language L = {w ∣ na (w) and nb (w) are both odd} is given by:
δ(q0 , a)
; δ(q0 , b) = q2
= q1
δ(q1 , a)
; δ(q1 , b) = q3
= q0
δ(q2 , a)
; δ(q2 , b) = q0
= q3
δ(q3 , a)
; δ(q3 , b) = q1
= q2
The initial and final states of the automata are
A. q0 and q0 respectively B. q0 and q1 respectively
C. q0 and q2 respectively D. q0 and q3 respectively
ugcnetjune2015iii theory-of-computation finite-automata

39.11.5 Finite Automata: UGCNET-Nov2017-iii-23 https://gateoverflow.in/166399

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
ugcnetnov2017-iii theory-of-computation finite-automata
 39.11.6 Finite Automata: UGCNET-Sep2013-II: 13 https://gateoverflow.in/59031

The number of states in a minimal deterministic finite automaton corresponding to the language L = {an ∣ n ≥ 4} is

A. 3 B. 4 C. 5 D. 6
ugcnetsep2013ii theory-of-computation finite-automata

39.12 Grammar (15)

39.12.1 Grammar: UGCNET-AUG2016-II: 35 https://gateoverflow.in/70300

Which of the following is FALSE ?

A. The grammar S → aS|aSbS| ∈ , where S 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 LR(k) for any k.
D. Recursive descent parser is a top-down parser.

ugcnetaug2016ii theory-of-computation grammar

39.12.2 Grammar: UGCNET-Dec2012-III: 42 https://gateoverflow.in/57674

The grammar ‘GI’ S → OSO ∣ ISI ∣ 0 ∣ 1 ∣∈ and the grammar G2 is S → as ∣ asb ∣ X, X → Xa ∣ a .

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
ugcnetdec2012iii theory-of-computation grammar

39.12.3 Grammar: UGCNET-Dec2014-III: 62 https://gateoverflow.in/61365

Match the following :

List – I List – II
a. Context free grammar i. Linear bounded automaton
b. Regular grammar ii. Pushdown automaton
c. Context sensitive grammar iii. Turing machine
d. Unrestricted grammar iv. Deterministic finite automaton
Codes :
A. a-ii, b-iv, c-iii, d-i B. a-ii, b-iv, c-i, d-iii
C. a-iv, b-i, c-ii, d-iii D. a-i, b-iv, c-iii, d-ii
ugcnetdec2014iii theory-of-computation grammar

39.12.4 Grammar: UGCNET-July-2018-II: 36 https://gateoverflow.in/225850

Consider the following two Grammars:

G1 : S → SbS ∣ a
G2 : S → aB ∣ ab, A → GAB ∣ a, B → ABb ∣ b
Which one of the folloeing options is correct?
A. Only G1 is ambiguous B. Only G2 is ambiguous
C. Both G1 and G2 are ambiguous D. Both G1 and G2 are not ambiguous
ugcnetjuly2018ii theory-of-computation grammar

39.12.5 Grammar: UGCNET-July-2018-II: 38 https://gateoverflow.in/225848

The set A = {0n 1n 2n ∣ n = 1, 2, 3, …} is an example of a grammar that is

A. Context sensitive B. Context free

C. Regular D. None of the above
ugcnetjuly2018ii theory-of-computation grammar
39.12.6 Grammar: UGCNET-June2012-III: 32 https://gateoverflow.in/56264

The equivalent grammar corresponding to the grammar G : S → aA, A → BB, B → aBb ∣ ε is

A. S → aA, A → BB, B → aBb

B. S → a ∣ aA, A → BB, B → aBb ∣ ab
C. S → a ∣ aA, A → BB ∣ B, B → aBb
D. S → a ∣ aA, A → BB ∣ B, B → aBb ∣ ab

theory-of-computation grammar context-free-languages ugcnetjune2012iii

39.12.7 Grammar: UGCNET-June2013-III: 35 https://gateoverflow.in/58494

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

ugcnetjune2013iii theory-of-computation grammar

39.12.8 Grammar: UGCNET-June2014-III: 73 https://gateoverflow.in/58190

Given the following two grammars :

G1 : S → AB|aaB
A → a|Aa
B→b
G2 : S → aSbS|bSaS|λ
Which statement is correct ?

A. G1 is unambiguous and G2 is unambiguous.

B. G1 is unambiguous and G2 is ambiguous.
C. G1 is ambiguous and G2 is unambiguous.
D. G1 is ambiguous and G2 is ambiguous.

ugcnetjune2014iii theory-of-computation grammar

39.12.9 Grammar: UGCNET-June2014-III: 74 https://gateoverflow.in/58195

Match the following :

List – I List – II
a. Chomsky Normal form i. S → bSS ∣ aS ∣ c
b. Greibach Normal form ii. S → aSb ∣ ab
c. S-grammar iii. S → AS ∣ a
A → SA ∣ b
d. LL grammar iv. S → aBSB
B→b
Codes :
A. a-iv, b-iii, c-i, d-ii B. a-iv, b-iii, c-ii, d-i
C. a-iii, b-iv, c-i, d-ii D. a-iii, b-iv, c-ii, d-i
ugcnetjune2014iii theory-of-computation grammar

39.12.10 Grammar: UGCNET-June2015-II: 33 https://gateoverflow.in/61067

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
ugcnetjune2015ii theory-of-computation grammar
39.12.11 Grammar: UGCNET-Nov2017-ii-34 https://gateoverflow.in/166268

Which of the following statements is/are TRUE?

a. The grammar S → SS ∣ a b. The grammar S → 0S1 ∣ 01S ∣ ϵ is ambiguous. (The special
is ambiguous. (Where S is the start
symbol) symbol ϵ represents the empty string) (Where S is the start
symbol)
c. The grammar (Where S is the start symbol)
S -> T/U$
T -> x S y | xy | ϵ
U -> yT

generates a language consisting of the string yxxyy .

A. Only (a) and (b) are TRUE. B. Only (a) and (c) are TRUE.
C. Only (b) and (c) are TRUE. D. All of (a), (b) and (c) are TRUE.
ugcnetnov2017-ii grammar context-free-languages ambiguous

39.12.12 Grammar: UGCNET-Oct2020-II: 57 https://gateoverflow.in/349616

Which of the following grammars is(are) ambiguous?

a. s → ss ∣ asb ∣ bsa ∣ λ b. s → asbs ∣ bsas ∣ λ c. s → aABA → bBbB → Choose the correct

A ∣ λ where answer
λ denotes from
empty the options given
string
below:

A. (a) and (c) only B. (b) only C. (b) and (c) only D. (a) and (b) only
ugcnet-oct2020-ii theory-of-computation grammar ambiguous

39.12.13 Grammar: UGCNET-Sep2013-II: 16 https://gateoverflow.in/59069

LL grammar for the language L = {an bm cn+m ∣ m ≥ 0, n ≥ 0} is

A. S → aSc ∣ S1 ; S1 → bS1 c ∣ λ
B. S → aSc ∣ S1 λ ∣ S1 ∣ λ; S1 → bS1 c
C. S → aSc ∣ S1 λ ∣ S1 ∣ λ; S1 → bS1 c ∣ λ
D. S → aSc ∣ S1 λ; S1 → bS1 c ∣ λ

ugcnetsep2013ii theory-of-computation grammar

39.12.14 Grammar: UGCNET-Sep2013-II: 17 https://gateoverflow.in/59071

Assume the statements S1 and S2 given as:

S1 : Given a context free grammar G, there exists an algorithm for determining whether L(G) is infinite.
S2 : There exists an algorithm to determine whether two context free grammars generate the same language.
Which one of the following is true?
A. S1 is correct and S2 is not correct B. Both S1 and S2 are correct
C. Both S1 and S2 are not correct D. S1 is not correct and S2 is correct
ugcnetsep2013ii theory-of-computation grammar

39.12.15 Grammar: UGCNET-Sep2013-III: 18 https://gateoverflow.in/59520

Given the following production of a grammar:

S → aA ∣ aBB ;
A → aaA ∣ λ ;
B → bB ∣ bbC ;
C→B
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
 ugcnetsep2013iii theory-of-computation grammar

39.13 Identify Class Language (7)

39.13.1 Identify Class Language: UGCNET-Dec2015-III: 28 https://gateoverflow.in/48404

Given the following two languages:

L1 = {an ban | n > 0}

L2 = {an ban bn+1 | n > 0}

Which of the following is correct?

A. L1 is context free language and L2 is not context free language

B. L1 is not context free language and L2 is context free language
C. Both L1 and L2 are context free languages
D. Both L1 and L2 are not context free languages

identify-class-language context-free-languages ugcnetdec2015iii

39.13.2 Identify Class Language: UGCNET-Jan2017-III: 61 https://gateoverflow.in/335177

Given the following two statements:

A. L = {w ∣ na (w) = nb (w)} is deterministic context B. L = {an bn } ∪ {an b2n } is linear, but not deterministic context
free
language, but not linear. free language.
Which of the following options is correct?
A. Both (A) and (B) are false. B. Both (A) and (B) are true.
C. (A) is true, (B) is false. D. (A) is false, (B) is true.
ugcnetjan2017iii identify-class-language

39.13.3 Identify Class Language: UGCNET-June2014-III: 75 https://gateoverflow.in/58199

Given the following two languages :

L1 = {an bn |n ≥ 1} ∪ {a}
L2 = {wC wR |w ∈ {a, b}∗ }
Which statement is correct ?

A. Both L1 and L2 are not deterministic.

B. L1 is not deterministic and L2 is deterministic.
C. L1 is deterministic and L2 is not deterministic.
D. Both L1 and L2 are deterministic.

ugcnetjune2014iii theory-of-computation identify-class-language

39.13.4 Identify Class Language: UGCNET-Oct2020-II: 71 https://gateoverflow.in/349602

Match List I with List II

LR : Regular language, LCF : Context free language
LREC : Recursive langauge, LRE : Recursively enumerable language.
List I List II
¯¯
¯¯
(A) Recursively Enumerable language (I) L REC ∪ LRE
¯¯
¯¯
(B) Recursive language (II) L CF ∪ LREC
(C) Context Free language (III) L∗R ∩ LCF
Choose the correct answer from the options given below:
A. A − II, B − III, C − I B. A − III, B − I, C − II
C. A − I, B − II, C − III D. A − II, B − I, C − III
ugcnet-oct2020-ii theory-of-computation identify-class-language
 39.13.5 Identify Class Language: UGCNET-Sep2013-III: 19 https://gateoverflow.in/59522

The language accepted by the non-deterministic pushdown automaton

M = ({q0 , q1 , q2 }, {a, b}, {a, b, z}, δ, q0 , z, {q2 }) with transitions
δ(q0 a, z) = {(q1 a), (q2 λ)} ;
δ(q1 , b, a) = {(q1 , b)}
δ(q1 , b, b) = {(q1 b)}, δ(q1 , a, b) = {(q2 , λ)} is

A. L(abb ∗ a) B. {a}UL(abb ∗ a) C. L(ab ∗ a) D. {a}UL(ab ∗ a)

ugcnetsep2013iii theory-of-computation identify-class-language

39.13.6 Identify Class Language: UGCNET-Sep2013-III: 20 https://gateoverflow.in/59523

The language L = {an bn am bm ∣ n ≥ 0, m ≥ 0} 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
ugcnetsep2013iii theory-of-computation identify-class-language

39.13.7 Identify Class Language: UGCNET-Sep2013-III: 21 https://gateoverflow.in/59525

Assume statements S1 and S2 defined as:

S1 : L2 – L1 is recursive enumerable where L1 and L2 are recursive and recursive enumerable respectively.
S2 : The set of all Turing machines is countable.
Which of the following is true?
A. S1 is correct and S2 is not correct B. Both S1 and S2 are correct
C. Both S1 and S2 are not correct D. S1 is not correct and S2 is correct
ugcnetsep2013iii identify-class-language theory-of-computation

39.14 Language (1)

39.14.1 Language: UGCNET-Nov2017-iii-24 https://gateoverflow.in/166400

The language L = {ai b ci ∣ i ≥ 0} over the alphabet {a, b, c} 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

ugcnetnov2017-iii theory-of-computation language

39.15 Languages Classification (1)

39.15.1 Languages Classification: UGCNET-June-2019-II: 76 https://gateoverflow.in/316203

Match List-I with List-II :

where L1 : Regular language
L2 : Context-free language
L3 : Recursive language
L4 : Recursively enumerable language
List-I List-II
(a) ¯L
¯¯¯¯¯
3 ∪ L4 (i) Context-free language
(b) ¯L
¯¯¯¯¯
2 ∪ L3 (ii) Recursively enumerable language
(c) L∗1 ∩ L2 (iii) Recursive Language
Choose the correct option from those given below :
A. (a)-(ii); (b)-(i); (c)-(iii) B. (a)-(ii); (b)-(iii); (c)-(i)
C. (a)-(iii); (b)-(i); (c)-(ii) D. (a)-(i); (b)-(ii); (c)-(iii)
 ugcnetjune2019ii languages-classification cfl-recusive-re

39.16 Languages Relationships (1)

39.16.1 Languages Relationships: UGCNET-Dec2014-III: 61 https://gateoverflow.in/61362

Given the recursively enumerable language (LRE ), the context sensitive language (LCS ), the recursive language
(LREC ), the context free language (LCF ) and deterministic context free language (LDCF ). The relationship between
these families is given by

A. LCF ⊆ LDCF ⊆ LCS ⊆ LRE ⊆ LREC

B. LCF ⊆ LDCF ⊆ LCS ⊆ LREC ⊆ LRE
C. LDCF ⊆ LCF ⊆ LCS ⊆ LRE ⊆ LREC
D. LDCF ⊆ LCF ⊆ LCS ⊆ LREC ⊆ LRE

ugcnetdec2014iii languages-relationships

39.17 Minimal State Automata (1)

39.17.1 Minimal State Automata: UGCNET-June-2019-II: 75 https://gateoverflow.in/316204

How many states are there in a minimum state automata equivalent to regular expression given below?
Regular expression is a∗ b(a + b)

A. 1 B. 2 C. 3 D. 4
ugcnetjune2019ii finite-automata minimal-state-automata

39.18 Nfa Dfa (3)

39.18.1 Nfa Dfa: UGCNET-Dec2012-II: 44 https://gateoverflow.in/57123

Let L be set accepted by a non-deterministic finite automaton. The number of states in non-deterministic finite
automaton is ∣Q∣. The maximum number of states in equivalent finite automaton that accepts L is

A. ∣Q∣ B. 2 ∣ Q∣
C. 2∣Q∣ − 1 D. 2∣Q∣
ugcnetdec2012ii theory-of-computation nfa-dfa

39.18.2 Nfa Dfa: UGCNET-Dec2012-III: 47 https://gateoverflow.in/57709

The minimum number of states of the non-deterministic finite automaton which accepts the language
{ababn ∣ n ≥ 0} ∪ {aban ∣ n ≥ 0} is

A. 3 B. 4 C. 5 D. 6
ugcnetdec2012iii theory-of-computation nfa-dfa

39.18.3 Nfa Dfa: UGCNET-June2012-III: 16 https://gateoverflow.in/56098

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

ugcnetjune2012iii theory-of-computation nfa-dfa finite-automata

39.19 Parsing (1)

39.19.1 Parsing: UGCNET-Dec2012-II: 35 https://gateoverflow.in/43711

Which of the following is the most powerful parsing method?

A. LL(I) B. Canonical LR C. SLR D. LALR

 ugcnetdec2012ii compiler-design parsing

39.20 Pumping Lemma (3)

39.20.1 Pumping Lemma: UGCNET-Dec2013-III: 40 https://gateoverflow.in/60713

Pumping lemma for context-free languages states:

Let L be an infinite context free language. Then there exists some positive integer m such that any w ∈ L with
∣w ∣≥ m can be decomposed as w = uv xy Z with ∣vxy∣ ______ and ∣vy∣ ________ such that uvż xy ż Z ∈ L for all
ż = 0, 1, 2, …
A. ≤ m, ≤ 1 B. ≤ m, ≥ 1
C. ≥ m, ≤ 1 D. ≥ m, ≥ 1
ugcnetdec2013iii theory-of-computation context-free-languages pumping-lemma

39.20.2 Pumping Lemma: UGCNET-Nov2017-iii-19 https://gateoverflow.in/166395

The logic of pumping lemma is an example of _________

A. Iteration B. Recursion
C. The divide and conquer principle D. The pigeon – hole principle
ugcnetnov2017-iii theory-of-computation pumping-lemma

39.20.3 Pumping Lemma: UGCNET-Nov2017-iii-21 https://gateoverflow.in/166397

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
ugcnetnov2017-iii theory-of-computation pumping-lemma

39.21 Pushdown Automata (5)

39.21.1 Pushdown Automata: UGCNET-Dec2014-III: 22 https://gateoverflow.in/60451

The pushdown automation M = ({q0 , q1 , q2 } , {a, b} , {0, 1} , δ, q0 , 0, {q0 }) with

δ(q0 , a, 0) = {(q1 , 10)}
δ(q1 , a, 1) = {(q1 , 11)}
δ(q1 , b, 1) = {(q2 , λ)}
δ(q2 , b, 1) = {(q2 , λ)}
δ(q2 , λ, 0) = {(q0 , λ)}
Accepts the language
A. L = {an bm |n, m ≥ 0} B. L = {an bn |n ≥ 0}
C. L = {an bm |n, m > 0} D. L = {an bn |n > 0}
ugcnetdec2014iii theory-of-computation pushdown-automata

39.21.2 Pushdown Automata: UGCNET-July-2018-II: 33 https://gateoverflow.in/225853

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
ugcnetjuly2018ii theory-of-computation pushdown-automata

39.21.3 Pushdown Automata: UGCNET-July-2018-II: 34 https://gateoverflow.in/225852

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
ugcnetjuly2018ii theory-of-computation pushdown-automata
 39.21.4 Pushdown Automata: UGCNET-June2013-III: 37 https://gateoverflow.in/58499

A pushdown automation M = (Q, Σ, Γ, δ, q0 , z, F) is set to be deterministic subject to which of the following

condition(s), for every q ∈ Q, a ∈ Σ ∪ {λ} and b ∈ Γ
(s1) δ(q, a, b) contains at most one element
(s2) if δ(q, λ, b) is not empty then δ(q, c, b) must be empty for every c ∈ Σ

A. only s1 B. only s2 C. both s1 and s2 D. neither s1 nor s2

ugcnetjune2013iii theory-of-computation pushdown-automata

39.21.5 Pushdown Automata: UGCNET-Sep2013-III: 22 https://gateoverflow.in/59527

Non-deterministic pushdown automaton that accepts the language generated by the grammar: S → aSS ∣ ab is

A. δ(q0 , λ, z) = {(q1 , z)}; δ(q0 , a, S) = {(q1 , SS)}, (q1 , B)}δ(q0 , b, B) = {(q1 , λ)}, δ(q1 , λ, z) = {(qf , λ)}
B. δ(q0 , λ, z) = {(q1 , Sz)}; δ(q0 , a, S) = {(q1 , SS)}, (q1 , B)}δ(q0 , b, B) = {(q1 , λ)}, δ(q1 , λ, z) = {(qf , λ)}
C. δ(q0 , λ, z) = {(q1 , Sz)}; δ(q0 , a, S) = {(q1 , S)}, (q1 , B)}δ(q0 , b, λ) = {(q1 , B)}, δ(q1 , λ, z) = {(qf , λ)}
D. δ(q0 , λ, z) = {(q1 , z)}; δ(q0 , a, S) = {(q1 , SS)}, (q1 , B)}δ(q0 , b, λ) = {(q1 , B)}, δ(q1 , λ, z) = {(qf , λ)}

ugcnetsep2013iii theory-of-computation pushdown-automata

39.22 Recursive And Recursively Enumerable Languages (2)

39.22.1 Recursive And Recursively Enumerable Languages: UGCNET-Jan2017-III: 63 https://gateoverflow.in/335175

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 languages is closed under union
D. The families of recursively enumerable and recursive languages are closed under reversal

ugcnetjan2017iii theory-of-computation recursive-and-recursively-enumerable-languages

39.22.2 Recursive And Recursively Enumerable Languages: UGCNET-Oct2020-II: 27 https://gateoverflow.in/349646

Consider L = L1 ∩ L2 where
L1 = {0m 1m 20n 1n ∣ m, n ≥ 0}
L2 = {0m 1n 2k ∣ m, n, k ≥ 0}
Then, the language L is
A. Recursively enumerable but not context free B. Regular
C. Context free but not regular D. Not recursive

ugcnet-oct2020-ii theory-of-computation recursive-and-recursively-enumerable-languages

39.23 Regular Expressions (17)

39.23.1 Regular Expressions: UGCNET-AUG2016-II: 31 https://gateoverflow.in/69956

The number of strings of length 4 that are generated by the regular expression (0 + 1 + |2 + 3+)∗ , where | is an
alternation character and +,∗ are quantification characters, is :

A. 08 B. 09 C. 10 D. 12
ugcnetaug2016ii theory-of-computation regular-expressions

39.23.2 Regular Expressions: UGCNET-AUG2016-III: 24 https://gateoverflow.in/70926

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)
ugcnetaug2016iii theory-of-computation regular-expressions

39.23.3 Regular Expressions: UGCNET-Dec2014-III: 24 https://gateoverflow.in/13365

Regular expression for the complement of language L = {an bm ∣ n ≥ 4, m ≤ 3} is

A. (a + b)∗ ba(a + b)∗ B. a∗ bbbbb∗

C. (λ + a + aa + aaa)b∗ + (a + b)∗ ba(a + b)∗ D. None of the above
ugcnetdec2014iii theory-of-computation regular-expressions regular-languages

39.23.4 Regular Expressions: UGCNET-Jan2017-II: 31 https://gateoverflow.in/335132

Which of the following strings would match the regular expression : p + [3 − 5] ∗ [xyz]?

I. p443y
II. p6y
III. 3xyz
IV. p35z
V. p353535x
VI. ppp5
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-expressions theory-of-computation

39.23.5 Regular Expressions: UGCNET-June2010-II: 3 https://gateoverflow.in/67606

"My Laughter Machine (MLM) recognizes the following strings :

(i) a
(ii) aba
(iii) abaabaaba
(iv) abaabaabaabaabaabaabaabaaba
Using this as an information, how would you compare the following regular expressions ?
(i) (aba)3x
(ii) a. (baa)3x – 1.ba
(iii) ab. (aab).3x−1 . a

A. (ii) and (iii) are same, (i) is different. B. (ii) and (iii) are not same.
C. (i), (ii) and (iii) are different. D. (i), (ii) and (iii) are same.
ugcnetjune2010ii theory-of-computation regular-expressions

39.23.6 Regular Expressions: UGCNET-June2012-III: 35 https://gateoverflow.in/56266

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. 2n states

ugcnetjune2012iii theory-of-computation regular-expressions

39.23.7 Regular Expressions: UGCNET-June2012-III: 43 https://gateoverflow.in/56282

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)*

 ugcnetjune2012iii theory-of-computation regular-expressions

39.23.8 Regular Expressions: UGCNET-June2015-III: 20 https://gateoverflow.in/61229

The regular expression corresponding to the language L where

L = {x ∈ {0, 1}∗ ∣ x ends with 1 and does not contain substring 00 is
A. (1+01)* (10+01) B. (1+01)* 01
C. (1+01)* (1+01) D. (10+01)* 01
ugcnetjune2015iii theory-of-computation regular-expressions

39.23.9 Regular Expressions: UGCNET-June2016-II: 31 https://gateoverflow.in/63440

The number of strings of length 4 that are generated by the regular expression

(0 ∣ ϵ)1+ 2∗ (3 ∣ ϵ)

, where ∣ is an alternation character, {+, ∗} are quantification characters, and ϵ is the null string, is:

A. 08 B. 10 C. 11 D. 12
ugcnetjune2016ii theory-of-computation regular-expressions

39.23.10 Regular Expressions: UGCNET-June2016-III: 23 https://gateoverflow.in/57156

The regular expression for the complement of the language L = {an bm ∣ n ≥ 4, m ≤ 3} is:

A. (λ + a + aa + aaa)b∗ + a∗ bbbb∗ + (a + b)∗ ba(a + b)∗

B. (λ + a + aa + aaa)b∗ + a∗ bbbbb∗ + (a + b)∗ ab(a + b)∗
C. (λ + a + aa + aaa) + a∗ bbbbb∗ + (a + b)∗ ab(a + b)∗
D. (λ + a + aa + aaa)b∗ + a∗ bbbbb∗ + (a + b)∗ ba(a + b)∗

ugcnetjune2016iii theory-of-computation regular-expressions

39.23.11 Regular Expressions: UGCNET-June2016-III: 24 https://gateoverflow.in/57141

Consider the following two languages:

L1 = {0i 1j ∣ ged(i, j) = 1}
L2 is any subset of 0*
Which of the following is correct?
A. L1 is regular and L2 ∗ is not regular B. L1 is not regular and L2 ∗ is regular
C. Both L1 and L2 ∗ are regular languages D. Both L1 and L2 ∗ are not regular languages
ugcnetjune2016iii regular-languages regular-expressions

39.23.12 Regular Expressions: UGCNET-June2016-III: 55 https://gateoverflow.in/63980

Let L be the language generated by regular expression 0*10* and accepted by the deterministic finite automata M.
Consider the relation RM defined by M as all states that are reachable from the start state. RM has ___ equivalence
classes.

A. 2 B. 4 C. 5 D. 6
ugcnetjune2016iii theory-of-computation regular-expressions regular-languages

39.23.13 Regular Expressions: UGCNET-Nov2017-ii-33 https://gateoverflow.in/166267

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. 0∗ 1+ 0∗ 1∗ B. 0∗ 1∗ 0+ 1∗ C. 0∗ 1∗ 0∗ 1+ D. 0+ 1∗ 0∗ 1∗ W h e r e {+, ∗} are
quantification
characters.

ugcnetnov2017-ii regular-expressions regular-languages

 39.23.14 Regular Expressions: UGCNET-Oct2020-II: 28 https://gateoverflow.in/349645

L e t L1 and L2 be languages over Σ = {a, b} represented by the regular expressions (a∗ + b)∗ and (a + b)∗
respectively.
Which of the following is true with respect to the two languages?
A. L1 ⊂ L2 B. L2 ⊂ L1
C. L1 = L2 D. L1 ∩ L2 = ϕ
ugcnet-oct2020-ii theory-of-computation regular-expressions

39.23.15 Regular Expressions: UGCNET-Oct2020-II: 79 https://gateoverflow.in/349594

Consider the following regular expressions:

a. r = a(b + a)∗ b. s = a(a + b)∗
c. t = aa∗ b Choose the correct answer from the options given below
based on the relation between the languages generated by the regular expressions above:
A. L(r) ⊆ L(s) ⊆ L(t) B. L(r) ⊇ L(s) ⊇ L(t)
C. L(r) ⊇ L(t) ⊇ L(s) D. L(s) ⊇ L(t) ⊇ L(r)
ugcnet-oct2020-ii theory-of-computation regular-expressions

39.23.16 Regular Expressions: UGCNET-Sep2013-II: 14 https://gateoverflow.in/59033

Regular expression for the language L = w ∈ {0, 1}∗ ∣ w has no pair of consecutive zeros } is

A. (1 + 010)∗ B. (01 + 10)∗

C. (1 + 010) ∗ (0 + λ) D. (1 + 01) ∗ (0 + λ)
ugcnetsep2013ii theory-of-computation regular-expressions

39.23.17 Regular Expressions: UGCNET-Sep2013-II: 15 https://gateoverflow.in/59068

Consider the following two languages:

L1 = {an bl ak ∣ n + l + k > 5}
L2 = {an bl ak ∣ n > 5, l > 3, k ≤ l}
Which one of the following is true?

A. L1 is regular language and L2 is not regular language

B. Both L1 and L2 are regular language
C. Both L1 and L2 are not regular language
D. L1 is not regular language and L2 is regular language

ugcnetsep2013ii theory-of-computation regular-expressions regular-languages

39.24 Regular Grammar (3)

39.24.1 Regular Grammar: UGCNET-AUG2016-III: 22 https://gateoverflow.in/70920

The regular grammar for the language L = { an bm | n + m is even} is given by

(1) S → S1 |S2

S1 → aS1 |A1

A1 → bA1 |λ

S2 → aaS2 |A2

A2 → bA2 |λ

(2) S → S1 |S2

S1 → aS1 |aA1
 S2 → aaS2 |A2

A1 → bA1 |λ

A2 → bA2 |λ

(3) S → S1 |S2

S1 → aaaS1 |aA1

S2 → aaS2 |A2

A1 → bA1 |λ

A2 → bA2 |λ

(4) S → S1 |S2

S1 → aaS1 |A1

S2 → aaS2 |aA2

A1 → bbA1 |λ

A2 → bbA2 |b
ugcnetaug2016iii theory-of-computation regular-grammar

39.24.2 Regular Grammar: UGCNET-June2014-II: 10 https://gateoverflow.in/53244

The regular grammar for the language L= { w ∣ na (w) and nb (w) are both even, w ∈ {a, b} * } is given by : (Assume,
p, q, r and s are states)
A. p → aq ∣ br ∣ λ, q → bs ∣ apr → as ∣ bp, s → ar ∣ bq , p and s are initial and final states.
B. p → aq ∣ br, q → bs ∣ apr → as ∣ bp, s → ar ∣ bq , p and s are initial and final states.
C. p → aq ∣ br ∣ λ, q → bs ∣ apr → as ∣ bp, s → ar ∣ bq p is both initial and final states.
D. p → aq ∣ br, q → bs ∣ apr → as ∣ bp, s → ar ∣ bq p is both initial and final states.

ugcnetjune2014ii theory-of-computation regular-grammar

39.24.3 Regular Grammar: UGCNET-Sep2013-III: 17 https://gateoverflow.in/59519

A regular grammar for the language L = {an bm ∣ n is even and m is even } is given by

A. S → aSb ∣ S1 ; S1 → bS1 a ∣ λ
B. S → aaS ∣ S1 ; S1 → bSb ∣ λ
C. S → aSb ∣ S1 ; S1 → S1 ab ∣ λ
D. S → aaS ∣ S1 ; S1 → bbS1 ∣ λ

ugcnetsep2013iii theory-of-computation regular-grammar

39.25 Regular Languages (11)

39.25.1 Regular Languages: UGCNET-AUG2016-III: 55 https://gateoverflow.in/71606

Given the following two languages :

L1 = uwwR ν|u, v, w ∈ (a, b)+
L2 = uwwR ν|u, ν, w ∈ (a, b)+ , |u| ≥ |ν|
Which of the following is correct ?

A. L1 is regular language and L2 is not regular language.

B. L1 is not regular language and L2 is regular language.
C. Both L1 and L2 are regular languages.
D. Both L1 and L2 are not regular languages.

ugcnetaug2016iii theory-of-computation regular-languages

39.25.2 Regular Languages: UGCNET-AUG2016-III: 55 https://gateoverflow.in/136000

Given the following two languages:

L1 = {uwwr ν ∣ u, v, w ∈ {a, b}+ }

L2 = {uwwr ν ∣ u, ν, w ∈ {a, b}+ , |u| > |ν|}

Which of the following is correct ?

A. L1 is regular language and L2 is not regular language.

B. L1 is not regular language and L2 is regular language.
C. Both L1 and L2 are regular languages.
D. Both L1 and L2 are not regular languages.

regular-languages theory-of-computation

39.25.3 Regular Languages: UGCNET-Dec2013-II: 28 https://gateoverflow.in/60211

Given the following statements:

S1 : If L is a regular language then the language {uv ∣ u ∈ L, v ∈ LR } is also regular.
S2 : L = {wwR } is regular language.
Which of the following is true?
A. S1 is not correct and S2 is not correct B. S1 is not correct and S2 is correct
C. S1 is correct and S2 is not correct D. S1 is correct and S2 is correct
ugcnetdec2013ii theory-of-computation regular-languages

39.25.4 Regular Languages: UGCNET-Dec2014-III: 23 https://gateoverflow.in/60455

Given two languages :

L1 = {(ab)n ak |n > k, k ≥ 0}
L2 = {an bm |n ≠ m}
Using pumping lemma for regular language, it can be shown that

A. L1 is regular and L2 is not regular.

B. L1 is not regular and L2 is regular.
C. L1 is regular and L2 is regular.
D. L1 is not regular and L2 is not regular.

ugcnetdec2014iii theory-of-computation regular-languages

39.25.5 Regular Languages: UGCNET-Jan2017-III: 19 https://gateoverflow.in/335219

Which of the following are not regular?

a. Strings of even number of a’s b. Strings of a’s , whose length is a prime number.
c. Set of all palindromes made up of a’s and b’s. d. Strings of a’s whose length is a perfect square.
A. (a) and (b) only B. (a), (b) and (c) only
C. (b),(c) and (d) only D. (b) and (d) only
ugcnetjan2017iii theory-of-computation regular-languages

39.25.6 Regular Languages: UGCNET-Jan2017-III: 20 https://gateoverflow.in/335218

Consider the languages L1 = ϕ and L2 = {1} . Which one of the following represents L∗1 ∪ L∗2 L∗1 ?

A. {∈} B. {∈, 1} C. ϕ D. 1∗
 ugcnetjan2017iii theory-of-computation regular-languages

39.25.7 Regular Languages: UGCNET-Jan2017-III: 21 https://gateoverflow.in/335217

Given the following statements:

a. A class of languages that is closed under union and b. A class of languages that is closed under union and intersection
complementation has to be closed under intersection has to be closed under complementation
Which of the following options is correct?
A. Both (a) and (b) are false B. Both (a) and (b) are true
C. (a) is true, (b) is false D. (a) is false, (b) is true
ugcnetjan2017iii theory-of-computation regular-languages

39.25.8 Regular Languages: UGCNET-June2014-III: 15 https://gateoverflow.in/101327

Let L be any language. Define Even(W) as the strings obtained by extracting from W the letters in the even-
numbered positions and Even(L) = {Even(W) ∣ W ∈ L}. We define another language Chop(L) by removing the
two leftmost symbols of every string in L given by Chop(L) = {W ∣ vW ∈ L, with ∣v ∣= 2}. If L is regular language then

A. Even(L) is regular and Chop(L) is not regular B. Both Even(L) and Chop(L) are regular
C. Even(L) is not regular and Chop(L) is regular D. Both Even(L) and Chop(L) are not regular
ugcnetjune2014iii theory-of-computation regular-languages

39.25.9 Regular Languages: UGCNET-June2016-III: 22 https://gateoverflow.in/63943

The symmetric differences of two sets S1 and S2 is defined as:

S1 ⊕ S2 = {x ∣ x ∈ S1 or x ∈ S2 , but x is not in both S1 and S2 }
The nor of two languages is defined as
nor(L1 , L2 ) = {w ∣ w ∉ L1 and w ∉ L2 }
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

ugcnetjune2016iii theory-of-computation regular-languages

39.25.10 Regular Languages: UGCNET-Oct2020-II: 56 https://gateoverflow.in/349617

Consider the following languages:

z
L1 = {az̀ ∣ Z̀ is an integer}
L2 = {azz̀ ∣ Z̀ ≥ 0}
L3 = {ωω ∣ ωϵ{a, b}∗ }
Which of the languages is(are) regular?
Choose the correct answer from the options given below:

A. L1 and L2 only B. L1 and L3 only C. L1 only D. L2 only

ugcnet-oct2020-ii theory-of-computation regular-languages

39.25.11 Regular Languages: UGCNET-Sep2013-III: 16 https://gateoverflow.in/59518

Assume, L is regular language. Let statements S1 and S2 be defined as:

S1 : SQRT(L) = {x ∣ for some y with ∣ y ∣=∣ x2 ∣, xy ∈ L} is regular.
S2 : LOG(L) = {x ∣ for some y with ∣ y ∣= 2∣x∣ , xy ∈ L} is regular.
Which of the following is true?
A. S1 is correct and S2 is not correct B. Both S1 and S2 are correct
C. Both S1 and S2 are not correct D. S1 is not correct and S2 is correct
ugcnetsep2013iii theory-of-computation regular-languages
39.26 Right Quotient (1)

39.26.1 Right Quotient: UGCNET-June2013-II: 20 https://gateoverflow.in/58009

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

ugcnetjune2013ii theory-of-computation right-quotient

39.27 Strings (1)

39.27.1 Strings: UGCNET-June-2019-II: 78 https://gateoverflow.in/316201

Consider the following grammar:

S → XY
X → Y aY ∣ a and Y → bbX
Which of the following statements is/are true about the above grammar?​​

a. Strings produced by theb.grammar

Every string
can have
produced
consecutive
by
c. the
Every
three
grammar
string
a’s. have
produced
alternate
by
d. the
Every
a and
grammar
bstring
. have
produced
at least
by two
the grammar
a’s. have b’s in multiple of

A. a only B. b and c only C. d only D. c and d only

ugcnetjune2019ii grammar strings

39.28 Turing Machine (5)

39.28.1 Turing Machine: UGCNET-AUG2016-III: 56 https://gateoverflow.in/71610

Given a Turing Machine

M = (q0 , q1 , 0, 1, 0, 1, B, δ, B, q1 )
Where δ is a transition function defined as
δ(q0 , 0) = (q0 , 0, R)
δ(q0 , B) = (q1 , B, R)
The language L(M) accepted by Turing machine is given as :

A. 0∗ 1∗ B. 00∗ C. 10∗ D. 1∗ 0∗
ugcnetaug2016iii theory-of-computation turing-machine

39.28.2 Turing Machine: UGCNET-Jan2017-III: 62 https://gateoverflow.in/335176

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 pushdown automata.
D. Deterministic finite automata and Non-deterministic finite automata

ugcnetjan2017iii theory-of-computation turing-machine

39.28.3 Turing Machine: UGCNET-July-2018-II: 40 https://gateoverflow.in/225846

Consider the following statements( ):

S1 : There exist no algorithm for deciding if any two Turing machine M1 and M2 accept the same language
S2 : The problem of determining whether a Turing machine halts on any input is undecidable
Which one of the following options is correct?
A. Both S1 and S2 are correct B. Both S1 and S2 are not correct
C. Only S1 is correct D. Only S2 is correct
ugcnetjuly2018ii theory-of-computation turing-machine
 39.28.4 Turing Machine: UGCNET-June-2019-II: 80 https://gateoverflow.in/316199

For a statement
A language L ⊆ Σ∗ is recursive if there exists some turing machine M . Which of the following conditions is satisfied
for any string ω?

A. If ω ∈ L , then M accepts ω and M will not halt

B. If ω ∉ L , then M accepts ω and M will halt by reaching at final state
C. If ω ∉ L , then M halts without reaching to acceptable state
D. If ω ∈ L , then M halts without reaching to an acceptable state

ugcnetjune2019ii turing-machine

39.28.5 Turing Machine: UGCNET-June2016-III: 57 https://gateoverflow.in/63981

Given a Turing Machine

M = ({q0 , q1 , q2 , q3 }, {a, b}, {a, b, B}, δ, B, {q3 })
where δ is a atransaction function defined as
δ(q0 , a) = (q1 , a, R)
δ(q1 , b) = (q2 , b, R)
δ(q2 , a) = (q2 , a, R)
δ(q2 , b) = (q3 , b, R)
The language L(M) accepted by the Turing machine is given as:

A. aa*b B. abab C. aba*b D. aba*

ugcnetjune2016iii theory-of-computation turing-machine

Answer Keys
39.0.1 B 39.0.2 A 39.0.3 Q-Q 39.0.4 Q-Q 39.0.5 B
39.0.6 C 39.0.7 B 39.0.8 B 39.0.9 B 39.0.10 B
39.0.11 A 39.0.12 B 39.0.13 Q-Q 39.0.14 C 39.0.15 B
39.0.16 D 39.0.17 A 39.0.18 C 39.0.19 C 39.0.20 B
39.0.21 Q-Q 39.0.22 Q-Q 39.0.23 C 39.0.24 A 39.0.25 Q-Q
39.0.26 Q-Q 39.0.27 D 39.0.28 Q-Q 39.1.1 C 39.2.1 C
39.3.1 B 39.3.2 B 39.4.1 Q-Q 39.5.1 Q-Q 39.6.1 Q-Q
39.6.2 D 39.6.3 X 39.6.4 D 39.6.5 D 39.6.6 C
39.6.7 Q-Q 39.7.1 Q-Q 39.7.2 A 39.7.3 C 39.7.4 C
39.7.5 D 39.7.6 C 39.7.7 A 39.8.1 B 39.8.2 Q-Q
39.9.1 C 39.9.2 D 39.9.3 D 39.9.4 A 39.10.1 B
39.11.1 Q-Q 39.11.2 Q-Q 39.11.3 D 39.11.4 D 39.11.5 C
39.11.6 C 39.12.1 Q-Q 39.12.2 B 39.12.3 B 39.12.4 Q-Q
39.12.5 Q-Q 39.12.6 D 39.12.7 D 39.12.8 D 39.12.9 C
39.12.10 A 39.12.11 D 39.12.12 D 39.12.13 C 39.12.14 A
39.12.15 B 39.13.1 X 39.13.2 C 39.13.3 D 39.13.4 C
39.13.5 B 39.13.6 A 39.13.7 B 39.14.1 C 39.15.1 B
39.16.1 D 39.17.1 C 39.18.1 D 39.18.2 C 39.18.3 B
39.19.1 B 39.20.1 B 39.20.2 D 39.20.3 D 39.21.1 B
39.21.2 Q-Q 39.21.3 Q-Q 39.21.4 C 39.21.5 B 39.22.1 A

39.22.2 C 39.23.1 Q-Q 39.23.2 Q-Q 39.23.3 D 39.23.4 D

39.23.5 Q-Q 39.23.6 B 39.23.7 D 39.23.8 C 39.23.9 D
39.23.10 D 39.23.11 B 39.23.12 D 39.23.13 C 39.23.14 C
39.23.15 B 39.23.16 D 39.23.17 A 39.24.1 Q-Q 39.24.2 C
39.24.3 D 39.25.1 Q-Q 39.25.2 Q-Q 39.25.3 C 39.25.4 D
39.25.5 D 39.25.6 D 39.25.7 C 39.25.8 B 39.25.9 C
39.25.10 X 39.25.11 B 39.26.1 C 39.27.1 D 39.28.1 Q-Q
39.28.2 A 39.28.3 Q-Q 39.28.4 C 39.28.5 C
40 Unknown Category (235)

40.0.1 UGCNET-Oct2020-II: 62 https://gateoverflow.in/349611

Which of the following statements are true?

a. A sentence α entails another

b. Forward
sentence
chaining
β if β and
is true
backward
c.inSound
few worlds
chaining
inference
where
are
algorithms
very
α is d.
true
natural
Propositional
derive
reasoning
all sentences
logic
algorithms
does Choose
thatnot
are
forscale
entailed
knowledge thebasescorrect
to environments
in Horn
of unbounded
form s
answer from the options
given below:

A. (a) and (b) only B. (b) and (c) only C. (c) and (d) only D. (b) and (d) only
ugcnet-oct2020-ii

40.0.2 UGCNET-Nov2017-ii-13 https://gateoverflow.in/166247

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
ugcnetnov2017-ii

40.0.3 UGCNET-DEC2016-II: 1 https://gateoverflow.in/115596

Consider a sequence F00 defined as:

F00 (0) = 1, F00 (1) = 1
10∗F00 (n−1)+100
F00 (n) = F00 (n−2)
for n ≥ 2
Then what shall be the set of values of the sequence F00 ?
A. (1, 110, 1200) B. (1, 110, 600, 1200)
C. (1, 2, 55, 110, 600, 1200) D. (1, 55, 110, 600, 1200)
ugcnetdec2016ii

40.0.4 UGCNET-Nov2017-ii-2 https://gateoverflow.in/166236

Let m = (313)4 and n = (322)4 . Find the base 4 expansion of m + n.

A. (635)4 B. (32312)4 C. (21323)4 D. (1301)4

ugcnetnov2017-ii

40.0.5 UGCNET-Nov2017-ii-4 https://gateoverflow.in/166238

How many distinguishable permutations of the letters in the word of BANANA are there?

A. 720 B. 120 C. 60 D. 360

ugcnetnov2017-ii

40.0.6 UGCNET-Nov2017-ii-5 https://gateoverflow.in/166239

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
ugcnetnov2017-ii

40.0.7 UGCNET-Nov2017-ii-3 https://gateoverflow.in/166237

 ⎡1 1 0⎤
⎡1 0 0 0⎤
Let A = ⎢
0⎥
⎢ ⎥ and B = ⎢ 0 1 0 ⎥ Find the boolean product A ⊙ B of the two matrices.
0 1
⎢1 0⎥
1
1 ⎣1 0 1⎦
⎣0 0 1⎦
1

⎡1 1 1 0⎤
⎢0 0⎥
⎢ ⎥
1 1
⎢1 0⎥
A.
1 1
⎣1 0 1 1⎦
⎡1 1 0 1⎤
⎢0 1⎥
⎢ ⎥
1 0
⎢1 0⎥
B.
1 1
⎣1 0 1 1⎦
⎡1 1 0 1⎤
⎢0 0⎥
⎢ ⎥
1 1
⎢1 0⎥
C.
1 1
⎣1 0 1 1⎦
⎡1 1 1 0⎤
⎢0 0⎥
⎢ ⎥
1 1
⎢1 1⎥
D.
0 1
⎣1 0 1 1⎦

ugcnetnov2017-ii

40.0.8 UGCNET-Nov2017-ii-9 https://gateoverflow.in/166243

Negation of the proposition ∃ x H(x) is

A. ∃ x ¬ H(x) B. ∀ x ¬ H(x)
C. ∀ x H(x) D. ¬ x H(x)
ugcnetnov2017-ii

40.0.9 UGCNET-Nov2017-ii-6 https://gateoverflow.in/166240

The Boolean function with the Karnaugh map

is
A. (A + C) ⋅ D + B B. (A + B) ⋅ C + D
C. (A + D) ⋅ C + B D. (A + C) ⋅ B + D
ugcnetnov2017-ii

40.0.10 UGCNET-Nov2017-ii-12 https://gateoverflow.in/166246

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
ugcnetnov2017-ii

40.0.11 UGCNET-Nov2017-ii-10 https://gateoverflow.in/166244

The output of the following combinational circuit is F .

The value of F is
A. P1 + P2′ P3 B. P1 + P2′ P3′
C. P1 + P2 P3′ D. P1′ + P2 P3
ugcnetnov2017-ii

40.0.12 UGCNET-Nov2017-ii-11 https://gateoverflow.in/166245

prtdata is a pointer to a data type. The expression ∗ prtdata + + is evaluated as (in C++)
A. ∗ (prtdata++) B. (∗ prtdata) + +
C. ∗ (prtdata) + + D. Depends on compiler
ugcnetnov2017-ii

40.0.13 UGCNET-Nov2017-ii-16 https://gateoverflow.in/166250

Which of the following is/are true with reference to ‘view’ in DBMS?

a. A ‘view’ is a special stored procedure executed when certain event
b. A ‘view’ is a virtual table, which occurs after executing a pre-
occurs compiled query
A. Only (a) is true B. Only (b) is true
C. Both (a) and (b) are true D. Neither (a) nor (b) are true
ugcnetnov2017-ii

40.0.14 UGCNET-Nov2017-iii-40 https://gateoverflow.in/166416

Which of the following statements is/are TRUE?

a. In HTML, character entitites are used to incorporate external
b. Once a web server returns a cookie to a browser, the cookie will
content into a web page, such as images. be included in all future requests from the browser to the same
server.
A. Only (a) is TRUE B. Only (b) is TRUE
C. Both (a) and (b) are TRUE D. Neither (a) nor (b) is TRUE
ugcnetnov2017-iii

40.0.15 UGCNET-Nov2017-ii-15 https://gateoverflow.in/166249

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

ugcnetnov2017-ii

40.0.16 UGCNET-Nov2017-ii-21 https://gateoverflow.in/166255

Consider an array representation of an n element binary heap where the elements are stored from index 1 to index n of
the array. For the element stored at index i of the array (i ≤ n), the index of the parent is

A. floor((i + 1)/2) B. ceiling((i + 1)/2)

C. floor(i/2) D. ceiling(i/2)
ugcnetnov2017-ii

40.0.17 UGCNET-Nov2017-ii-19 https://gateoverflow.in/166253

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
ugcnetnov2017-ii

40.0.18 UGCNET-Nov2017-ii-20 https://gateoverflow.in/166254

_________ SQL command changes one or more fields in a record

A. LOOK-UP B. INSERT C. MODIFY D. CHANGE

ugcnetnov2017-ii

40.0.19 UGCNET-Nov2017-ii-18 https://gateoverflow.in/166252

Match the following with respect to RDBMS :

(a) Entity integrity (i)
enforces some specific business rule that do not
fall into entity or domain
(b) Domain integrity (ii) Rows can’t be deleted which are used by
other records
(c) Referential integrity (iii) enforces valid entries for a column
(d) Userdefined integrity (iv) No duplicate rows in a table
Code :
A. (a)-(iii); (b)-(iv); (c)-(i); (d)-(ii) B. (a)-(iv); (b)-(iii); (c)-(ii); (d)-(i)
C. (a)-(iv); (b)-(ii); (c)-(iii); (d)-(i) D. (a)-(ii); (b)-(iii); (c)-(iv); (d)-(i)
ugcnetnov2017-ii databases

40.0.20 UGCNET-Nov2017-ii-22 https://gateoverflow.in/166256

The following numbers are inserted into an empty binary search tree in the given order: 10, 1, 3, 5, 15, 12, 16 . What is
the height of the binary search tree?

A. 3 B. 4 C. 5 D. 6
ugcnetnov2017-ii

40.0.21 UGCNET-Nov2017-ii-25 https://gateoverflow.in/166259

Post-order traversal of a given binary search tree T produces following sequence of keys:
3, 5, 7, 9, 4, 17, 16, 20, 18, 15, 14 . Which one of the following sequences of keys can be the result of an in-order
traversal of the tree T ?
A. 3, 4, 5, 7, 9, 14, 20, 18, 17, 16, 15 B. 20, 18, 17, 16, 15, 14, 3, 4, 5, 7, 9
C. 20, 18, 17, 16, 15, 14, 9, 7, 5, 4, 3 D. 3, 4, 5, 7, 9, 14, 15, 16, 17, 18, 20
ugcnetnov2017-ii

40.0.22 UGCNET-Nov2017-ii-26 https://gateoverflow.in/166260

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

ugcnetnov2017-ii

40.0.23 UGCNET-Nov2017-ii-27 https://gateoverflow.in/166261

_________ 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.
ugcnetnov2017-ii
40.0.24 UGCNET-Nov2017-ii-23 https://gateoverflow.in/166257

Let G be an undirected connected graph with distinct edge weight. Let Emax be the edge with maximum weight and
Emin the edge with minimum weight. Which of the following statements is false?
A. Every minimum spanning tree of G must contain Emin
B. If Emax is in minimum spanning tree, then its removal must disconnect G
C. No minimum spanning tree contains Emax
D. G has a unique minimum spanning tree

ugcnetnov2017-ii

40.0.25 UGCNET-Nov2017-ii-24 https://gateoverflow.in/166258

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. O(n log n) B. O(n2 log n) C. O(n2 + log n) D. O(n3 )

ugcnetnov2017-ii

40.0.26 UGCNET-Nov2017-ii-14 https://gateoverflow.in/166248

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

ugcnetnov2017-ii

40.0.27 UGCNET-Nov2017-iii-42 https://gateoverflow.in/166418

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
ugcnetnov2017-iii

40.0.28 UGCNET-Nov2017-iii-47 https://gateoverflow.in/166423

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 20, 000 lines of code. Considering
(a, b) = 2.4, 1.05) as multiplicative and exponention factor for the basic COCOMO effort estimation equation and
(c, d) = (2.5, 0.38) as multiplicative and exponention factor for the basic COCOMO development time estimation equation,
approximately how long does the software project take to complete?

A. 10.52 months B. 11.52 months C. 12.52 months D. 14.52 months

 ugcnetnov2017-iii

40.0.29 UGCNET-Nov2017-ii-42 https://gateoverflow.in/166276

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

ugcnetnov2017-ii

40.0.30 UGCNET-Oct2020-I: 39 https://gateoverflow.in/349534

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. (c), (d), (b), (a) B. (c), (d), (a), (b)
C. (b), (d), (a), (c) D. (b), (c), (d), (a)
ugcnet-oct2020-i

40.0.31 UGCNET-Oct2020-I: 38 https://gateoverflow.in/349535

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
ugcnet-oct2020-i

40.0.32 UGCNET-Oct2020-I: 37 https://gateoverflow.in/349536

Given below are two statements: One is labelled as Assertion (A) and the other is labelled as Reason (R)
Assertion (A) : Carbon dioxide emissions from bioenergy. Production have traditionally
been excluded from most emission inventories and climate impact studies.
Reason (R) : Carbon dioxide emissions associated with production of bioenergy are
significantly less compared to those from combustion of fossil fuels.
In the 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

ugcnet-oct2020-i

40.0.33 UGCNET-Oct2020-I: 36 https://gateoverflow.in/349537

Which of the International Agreements/Convention/Protocols are legally binding on the member countries (parties)?

a. Convention on Biological
b. Diversity
Kyoto Protocol c. Montreal Protocol d. Paris Agreement Choose the most
appropriate answer from
the options given below:

A. c only B. a and c only C. a, b, and c only D. b, c, and d only

ugcnet-oct2020-i
40.0.34 UGCNET-Oct2020-I: 35 https://gateoverflow.in/349538

Match List I with List II

List I List II
(A) Input (I) Mouse
(B) Output (II) Monitor
(C) Memory (III) Cache
(D) Software (IV ) Python
Choose the correct answer from the options given below:
A. (A) − (I), (B) − (II), (C) − (IV ), (D) − (III) B. (A) − (I), (B) − (III), (C) − (II), (D) − (IV )
C. (A) − (III), (B) − (II), (C) − (I), (D) − (IV ) D. (A) − (I), (B) − (II), (C) − (III), (D) − (IV )
ugcnet-oct2020-i

40.0.35 UGCNET-Nov2017-ii-49 https://gateoverflow.in/166283

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

ugcnetnov2017-ii computer-networks

40.0.36 UGCNET-Nov2017-ii-36 https://gateoverflow.in/166270

In Distributed system, the capacity of a system to adapt the increased service load is called

A. Tolerance B. Scalability C. Capability D. Loading

ugcnetnov2017-ii

40.0.37 UGCNET-Nov2017-ii-39 https://gateoverflow.in/166273

Which module gives control of the CPU to the process selected by the short-term schedular?

A. Dispatcher B. Interrupt C. Schedular D. Threading

ugcnetnov2017-ii operating-system

40.0.38 UGCNET-Nov2017-ii-41 https://gateoverflow.in/166275

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

ugcnetnov2017-ii

40.0.39 UGCNET-Nov2017-ii-40 https://gateoverflow.in/166274

Two atomic operations permissible on Semaphores are _________ and ________.

A. wait, stop B. wait, hold C. hold, signal D. wait, signal

ugcnetnov2017-ii

40.0.40 UGCNET-Nov2017-ii-38 https://gateoverflow.in/166272

Suppose there are six files F1, F2, F3, F4, F5, F6 with corresponding sizes 150 KB, 225 KB, 75 KB 60 KB, 275
KB and 65 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. F5, F2, F1, F3, F6, F4 B. F4, F6, F3, F1, F2, F5
C. F1, F2, F3, F4, F5, F6 D. F6, F5, F4, F3, F2, F1
 ugcnetnov2017-ii

40.0.41 UGCNET-Nov2017-iii-41 https://gateoverflow.in/166417

Which of the following statements is/are TRUE regarding JAVA?

a. Constants that cannot be changed are declared using ‘static’
b. A class can only inherit one class but can implement multiple
keyword. interfaces.
A. Only (a) is TRUE B. Only (b) is TRUE
C. Both (a) and (b) are TRUE D. Neither (a) nor (b) is TRUE
ugcnetnov2017-iii

40.0.42 UGCNET-Nov2017-ii-43 https://gateoverflow.in/166277

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

ugcnetnov2017-ii

40.0.43 UGCNET-Nov2017-ii-44 https://gateoverflow.in/166278

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)
ugcnetnov2017-ii

40.0.44 UGCNET-Nov2017-iii-17 https://gateoverflow.in/166393

Find the normalization transformation that maps a window whose lower left corner is at (1, 1) and upper right corner is
at (3, 5) onto a viewpoint that is the entire normalized device screen

⎛ 1
0
−1 ⎞
⎜ 2 2 ⎟
A. ⎜
⎜ 1 −1 ⎟
⎟
⎜ 0 ⎟
⎝ ⎠
4 4
0 0 1
⎛1 0
1 ⎞
⎜2 2 ⎟
B. ⎜
⎜0 −1 1 ⎟
⎟
⎜ ⎟
⎝1 ⎠
4 4
1 1
⎛1 0
−1 ⎞
⎜2 2 ⎟
C. ⎜
⎜0 1 1 ⎟
⎟
⎜ ⎟
⎝1 ⎠
4 4
0 0
⎛1 0
1 ⎞
⎜2 2 ⎟
D. ⎜
⎜0 1 −1 ⎟
⎟
⎜ ⎟
⎝1 ⎠
4 4
0 0

ugcnetnov2017-iii
40.0.45 UGCNET-Nov2017-iii-16 https://gateoverflow.in/166392

Find the equation of the circle x2 + y 2 = 1 in terms of x′ y ′ coordinates, assuming that the xy coordinate system
results from a scaling of 3 units in the x′ direction and 4 units in the y ′ direction.
A. 3(x′ )2 + 4(y ′ )2 = 1 x′ 2 y′ 2
B. ( ))+ ( ))= 1
3 4
C. (3x′ )2 + (4y ′ )2 = 1 1 ′ 2 1 ′ 2
D. (x ) + (y ) = 1
3 4
ugcnetnov2017-iii

40.0.46 UGCNET-Nov2017-iii-32 https://gateoverflow.in/166408

n
You are given a sequence of n elements to sort. The input sequence consists of subsequences, each containing k
k
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 n is to sort the k
n
elements in each of the subsequences.
k
The lower bound on the number of comparisons needed to solve this variant of the sorting problem is
A. Ω(n)
B. Ω( )
n
k
C. Ω(n lg k)
D. Ω( lg )
n n
k k
ugcnetnov2017-iii

40.0.47 UGCNET-Nov2017-iii-33 https://gateoverflow.in/166409

Consider the recurrence relation:

( )
n
T(n) = 8T + Cn, if n > 1
2
= b, if n = 1
Where b and c are constants.
The order of the algorithm corresponding to above recurrence relation is

A. n B. n2 C. n lg n D. n3
ugcnetnov2017-iii

40.0.48 UGCNET-Nov2017-iii-34 https://gateoverflow.in/166410

Consider the following two sequences:

X =< B, C, D, C, A, B, C > and Y =< C, A, D, B, C, B >
The length of longest common subsequence of X and Y is

A. 5 B. 3 C. 4 D. 2
ugcnetnov2017-iii

40.0.49 UGCNET-Nov2017-iii-35 https://gateoverflow.in/166411

A text is made up of the characters a, b, c, d, e each occuring with the probability 0.11, 0.40, 0.16, 0.09 and 0.24
respectively. The optimal Huffman coding technique will have the average length of

A. 2.40 B. 2.16 C. 2.26 D. 2.15

ugcnetnov2017-iii

40.0.50 UGCNET-Nov2017-iii-36 https://gateoverflow.in/166412

An undirected graph G(V , E) contains n(n > 2) nodes named v1 , v2 , … , vn . Two nodes vi and vj are connected if
and only if 0 <∣ i − j ∣≤ 2. Each edge (vi , vj ) is assigned a weight i + j. The cost of the minimum spanning tree of
such a graph with 10 nodes is
 A. 88 B. 91 C. 49 D. 21
ugcnetnov2017-iii

40.0.51 UGCNET-Nov2017-iii-37 https://gateoverflow.in/166413

An XML document that adheres to syntax rules specified by XML 1.0 specification in that it must satisfy both physical
and logical structured, is called

A. Well-formed B. Reasonable C. Valid D. Sophisticated

ugcnetnov2017-iii

40.0.52 UGCNET-Nov2017-iii-38 https://gateoverflow.in/166414

Which of the following statement(s) is/are TRUE regarding Java Servelets?

a. A Java Servelet is a server-side component that runs on the web
b. A servelet can use the user interface classes like AWT or Swing.
server and extends the capabilities of a server.
A. Only (a) is TRUE B. Only (b) is TRUE
C. Both (a) and (b) are TRUE D. Neither (a) nor (b) is TRUE
ugcnetnov2017-iii

40.0.53 UGCNET-Nov2017-iii-39 https://gateoverflow.in/166415

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.
ugcnetnov2017-iii

40.0.54 UGCNET-DEC2018-II: 75 https://gateoverflow.in/288302

​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

ugcnetdec2018ii

40.0.55 UGCNET-Oct2020-I: 41 https://gateoverflow.in/349532

Match List I with List II: List I consists of the Vedangas and List II contains subjects dealt in them.
List I List II
(A) Nirukta (I) Phonetics
(B) Chhandas (II) Ritual
(C) Shiksha (III) Metrics
(D) Kalpa (IV ) Etymology
Choose the correct answer from the options given below:
 A. (A) − (II), (B) − (IV ), (C) − (III), (D) − (I) B. (A) − (IV ), (B) − (III), (C) − (I), (D) − (II)
C. (A) − (III), (B) − (I), (C) − (II), (D) − (IV ) D. (A) − (I), (B) − (II), (C) − (IV ), (D) − (III)
ugcnet-oct2020-i

40.0.56 UGCNET-Nov2017-iii-71 https://gateoverflow.in/166447

Consider a single perceptron with sign activation function. The perceptron is represented by weight vector
[ 0.4 −0.3 0.1 ] t and a bias θ = 0 . If the input vector to the perceptron is X = [ 0.2 0.6 0.5 ] then the output
of the perceptron is

A. 1 B. 0 C. −0.05 D. −1
ugcnetnov2017-iii

40.0.57 UGCNET-Nov2017-iii-48 https://gateoverflow.in/166424

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)
ugcnetnov2017-iii

40.0.58 UGCNET-Nov2017-iii-49 https://gateoverflow.in/166425

Consider the following four processes with the arrival time and length of CPU burst given in milliseconds:
Process Arrival Time Burst Time
P1 0 8
P2 1 4
P3 2 9
P4 3 5
The average waiting time for preemptive SJF scheduling algorithm is ____________

A. 6.5 ms B. 7.5 ms C. 6.75 ms D. 7.75 ms

ugcnetnov2017-iii

40.0.59 UGCNET-Nov2017-iii-50 https://gateoverflow.in/166426

Consider a virtual page reference string 7, 0, 1, 2, 0, 3, 0, 4, 2, 3, 0, 3, 2, 1, 2, 0, 1, 7, 0, 1 . Suppose a demand paged

virtual memory system running on a computer system such that the main memory has 3 page frames. Then ______
page replacement algorithm has minimum number of page faults.

A. FIFO B. LIFO C. LRU D. Optimal

ugcnetnov2017-iii

40.0.60 UGCNET-Nov2017-iii-51 https://gateoverflow.in/166427

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?
a. b.
i. The Many – to – one model maps many user threads to one i. Many – to – one model maps many kernel threads to one user
kernel thread thread
ii. The one – to – one model maps one user thread to one kernel ii. One – to – one model maps one kernel thread to one user
thread thread
iii. The many – to – many model maps many user threads to iii. Many – to – many model maps many kernel threads to smaller
smaller or equal kernel threads or equal user threads
A. (a) is true; (b) is false B. (a) is false; (b) is true
C. Both (a) and (b) are true D. Both (a) and (b) are false
ugcnetnov2017-iii
40.0.61 UGCNET-Nov2017-iii-52 https://gateoverflow.in/166428

Consider a system with five processes P0 through P4 and three resource types A, B and C . Resource type A has seven
instances, resource type B has two instances and resource type C has six instances suppose at time T0 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
ugcnetnov2017-iii

40.0.62 UGCNET-Nov2017-iii-54 https://gateoverflow.in/166430

The Bounded buffer problem is also known as ___________

A. Producer – consumer problem B. Reader – writer problem
C. Dining Philosophers problem D. Both (2) and (3)
ugcnetnov2017-iii

40.0.63 UGCNET-Nov2017-iii-56 https://gateoverflow.in/166432

If b is the branching factor and m is the maximum depth of the search tree, what is the space complexity of greedy
search?

A. O(b + m) B. O(bm) C. O(bm ) D. O(mb )

ugcnetnov2017-iii

40.0.64 UGCNET-Nov2017-iii-53 https://gateoverflow.in/166429

Consider a disk queue with requests for I/O to blocks on cylinders 98, 183, 37, 122, 14, 124, 65, 67 . 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 53.

A. 224 B. 248 C. 236 D. 240

ugcnetnov2017-iii

40.0.65 UGCNET-Nov2017-iii-55 https://gateoverflow.in/166431

ugcnetnov2017-iii

40.0.66 UGCNET-Nov2017-iii-58 https://gateoverflow.in/166434

“If X , then Y unless Z ” is represented by which of the following formulae in propositional logic?
A. (X ∧ Y ) → ¬Z B. (X ∧ ¬Z) → Y
C. X → (Y ∧ ¬Z) D. Y → (X ∧ ¬Z)
ugcnetnov2017-iii

40.0.67 UGCNET-Nov2017-iii-59 https://gateoverflow.in/166435

Consider the following two well-formed formulas in prepositional logic.

F1 : P ⇒ ¬P
F2 : (P ⇒ ¬P ) ∨ (¬P ⇒ P )
Which of the following statements is correct?
A. F1 is Satisfiable, F2 is valid B. F1 is unsatisfiable, F2 is Satisfiable
C. F1 is unsatisfiable, F2 is valid D. F1 and F2 both are Satisfiable
ugcnetnov2017-iii

40.0.68 UGCNET-Nov2017-iii-45 https://gateoverflow.in/166421

A signal processor software is expected to operate for 91.25 days after repair, and the mean software repair time is
expected to be 5 minutes. Then, the availability of the software is

A. 96.9862% B. 97.9862% C. 98.9962% D. 99.9962%

ugcnetnov2017-iii

40.0.69 UGCNET-Nov2017-iii-60 https://gateoverflow.in/166436

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

ugcnetnov2017-iii

40.0.70 UGCNET-Nov2017-iii-61 https://gateoverflow.in/166437

Which of the following statements is not correct?

A. Every recursive language is recursively enumerable

B. L = {0n 1n 0n ∣ n = 1, 2, 3, …} is recursively enumerable
C. Recursive languages are closed under intersection
D. Recursive languages are not closed under intersection

ugcnetnov2017-iii

40.0.71 UGCNET-Nov2017-iii-62 https://gateoverflow.in/166438

Context free grammar is not closed under

A. Concatenation B. Complementation C. Kleene Star D. Union

ugcnetnov2017-iii

40.0.72 UGCNET-Nov2017-iii-63 https://gateoverflow.in/166439

Consider the following languages:

L1 = {am bn ∣ m ≠ n}
L2 = {am bn ∣ m = 2n + 1}
L3 = {am bn ∣ m ≠ 2n}
Which one of the following statements is correct?

A. Only L1 and L2 are context free languages

B. Only L1 and L3 are context free languages
C. Only L2 and L3 are context free languages
D. L1 , L2 and L3 are context free languages

ugcnetnov2017-iii

40.0.73 UGCNET-Nov2017-iii-64 https://gateoverflow.in/166440

A 4 × 4 DFT matrix is given by

⎡ ⎤
⎢ ⎥
⎢ ⎥
⎢ ⎥
2 = −1
 ⎡1 1 1 1 ⎤
1⎢1 x −1 y ⎥ 2
⎢ ⎥ j = −1
2 ⎢ 1 −1 1 −1 ⎥
⎣ 1 −j −1 j ⎦
Where the values of x and y are ______, _____ respectively.

A. 1, −1 B. −1, 1 C. −j, j D. j, −j
ugcnetnov2017-iii

40.0.74 UGCNET-Nov2017-iii-65 https://gateoverflow.in/166441

Entropy of a discrete random variable with possible values {x1 , x2 , … , xn } and probability density function P (X) is
n
H(X) = – ∑ P (xi ) logb P (xi )
i=1
The value of b gives the units of entropy. The unit for b = 10 is

A. bits B. bann C. nats D. deca

ugcnetnov2017-iii

40.0.75 UGCNET-Nov2017-iii-66 https://gateoverflow.in/166442

For any binary (n, h) linear code with minimum distance (2t + 1) or greater n − h ≥ log2 [[ ∑ ( ) ]where
]
α n
α is
i=0 i

A. 2t + 1 B. t + 1 C. t − 1 D. t
ugcnetnov2017-iii

40.0.76 UGCNET-Nov2017-iii-67 https://gateoverflow.in/166443

Which of the following is a valid reason for causing degeneracy in a transportation problem? Here m is number of
rows and n is number of columns in transportation table.

A. When the number of allocations is m + n − 1

B. When two or more occupied cells become unoccupied simultaneously
C. When the number of allocations is less than m + n − 1
D. When a loop cannot be drawn without using unoccupied cells, except the starting cell of the loop

ugcnetnov2017-iii

40.0.77 UGCNET-Nov2017-iii-70 https://gateoverflow.in/166446

Consider a Takagi-Sugeno – Kang (TSK) Model consisting of rules of the form:

If x1 is Ai1 and … and xr is Air
THEN y = fi (x1 , x2 , … , xt ) = bi0 + bi1 x1 + ⋯ + bir xr
assume, αi is the matching degree of rule i, then the total output of the model is given by:
L
A. y = ∑ αi fi (x1 , x2 , … , xr )
i=1
L
∑ αi fi (x1 , x2 , … , xr )
i=1
B. y =
L
∑ αi
i=1
L
∑ fi (x1 , x2 , … , xr )
i=1
C. y =
L
∑ αi
i=1
D. y = max[αi fi (x1 , x2 , … , xr )]
i
 ugcnetnov2017-iii

40.0.78 UGCNET-Nov2017-iii-68 https://gateoverflow.in/166444

Consider the following LPP:

Max Z = 15x1 + 10x2
Subject to the constraints
4x1 + 6x2 ≤ 360
3x1 + 0x2 ≤ 180
0x1 + 5x2 ≤ 200
x1 , x2 ≥ 0
The solution of the LPP using Graphical solution technique is
A. x1 = 60, x2 = 0 and Z = 900 B. x1 = 60, x2 = 20 and Z = 1100
C. x1 = 60, x2 = 30 and Z = 1200 D. x1 = 50, x2 = 40 and Z = 1150
ugcnetnov2017-iii

40.0.79 UGCNET-Nov2017-iii-69 https://gateoverflow.in/166445

Consider the following LPP:

Min Z = 2x1 + x2 + 3x3
Subject to:
x1 – 2x2 + x3 ≥ 4
2x1 + x2 + x3 ≤ 8
x1 − x3 ≥ 0
x1 , x2 , x3 ≥ 0
The solution of this LPP using Dual Simplex Method is
A. x1 = 0, x2 = 0, x3 = 3 and Z = 9 B. x1 = 0, x2 = 6, x3 = 0 and Z = 6
C. x1 = 4, x2 = 0, x3 = 0 and Z = 8 D. x1 = 2, x2 = 0, x3 = 2 and Z = 10
ugcnetnov2017-iii

40.0.80 UGCNET-Nov2017-iii-46 https://gateoverflow.in/166422

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
M1 = Number of tests to exhaustively test mcq();
M2 = Minimum number of tests to achieve full statement coverage for mcq (); and
M3 = Minimum number of tests to achieve full branch coverage for mcq ( );
then (M1, M2, M3) = ______________

A. (16, 3, 5) B. (8, 5, 3) C. (8, 3, 5) D. (16, 4, 4)

ugcnetnov2017-iii

40.0.81 UGCNET-Nov2017-iii-44 https://gateoverflow.in/166420

Which of the following statements is/are FALSE with respect to software testing?
S1 : White-box tests are based on specifications; better at telling whether program meets specification, better at finding
errors of ommission.
S2 : Black-box tests are based on code; better for finding crashes, out of bounds errors, file not closed errors.
S3 : 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 S1 and S2 are FALSE B. Only S1 and S3 are FALSE
C. Only S2 and S3 are FALSE D. All of S1, S2 , and S3 are FALSE
ugcnetnov2017-iii

40.0.82 UGCNET-DEC2018-II: 89 https://gateoverflow.in/288288

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
ugcnetdec2018ii computer-networks

40.0.83 UGCNET-Nov2017-iii-73 https://gateoverflow.in/166449

Consider the following statements:

a. UNIX provides three types

b. UNIX
of permissions Which
provides three sets of of the above statement/s is/are true?
permissions

ReadWriteExecute permission
permission
permission
for owner
for group
for others

A. Only (a) B. Only (b) C. Both (a) and (b) D. Neither (a) nor (b)
ugcnetnov2017-iii

40.0.84 UGCNET-DEC2018-II: 100 https://gateoverflow.in/288277

​A full joint distribution for the Toothache, Cavity and Catch is given in the table below.
Toothache ¬ Toothache
Catch ¬ Catch Catch ¬ Catch
Cavity 0.108 0.012 0.072 0.008
¬ Cavity 0.016 0.064 0.144 0.576
What is the probability of Cavity, given evidence of Toothache?
A. < 0.2, 0.8 > B. < 0.4, 0.8 >
C. < 0.6, 0.8 > D. < 0.6, 0.4 >
ugcnetdec2018ii

40.0.85 UGCNET-DEC2018-II: 99 https://gateoverflow.in/288278

​Consider the sentence below:

“There is a country that borders both India and Nepal”
Which of the following represents the above sentence correctly?

A. ∃c Country(c) ∧ Border(c, India) ∧ Border(c, Nepal)

B. ∃c Country(c) ⇒ [Border(c, India) ∧ Border(c, Nepal)]
C. [∃c Country(c)] ⇒ [Border(c, India) ∧ Border(c, Nepal)]
D. ∃c Border(Country(c), India ∧ Nepal)

ugcnetdec2018ii

40.0.86 UGCNET-DEC2018-II: 98 https://gateoverflow.in/288279

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

A. 7 B. 8 C. 15 D. 16
 ugcnetdec2018ii

40.0.87 UGCNET-DEC2018-II: 97 https://gateoverflow.in/288280

Consider the following minimax game tree search

What will be the value probagated at the root?

A. 3 B. 4 C. 5 D. 6
ugcnetdec2018ii

40.0.88 UGCNET-DEC2018-II: 96 https://gateoverflow.in/288281

​Consider the following statements related to AND − OR Search algorithm.

S1 : A solution is a subtree that has a goal node at every leaf.
S2 : OR nodes are analogous to the branching in a deterministic environment.
S3 : AND 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 :
Code :
A. S1– False, S2– True, S3– True
B. S1– True, S2– True, S3– False
C. S1– True, S2– True, S3– True
D. S1– False, S2– True, S3– False

ugcnetdec2018ii

40.0.89 UGCNET-DEC2018-II: 95 https://gateoverflow.in/288282

​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 :
Code :
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

ugcnetdec2018ii

40.0.90 UGCNET-DEC2018-II: 94 https://gateoverflow.in/288283

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) path to that node has
First Search
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)

ugcnetdec2018ii

40.0.91 UGCNET-DEC2018-II: 93 https://gateoverflow.in/288284

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
ListI (Algorithms) List II (Space Complexity)
(a) BFS search (i) O(bd)
(b) DFS search (ii) O(bd )
(c) Depth-limited search (iii) O(bm)
(d) Iterative deepening search (iv) O(bl)
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)

ugcnetdec2018ii

40.0.92 UGCNET-DEC2018-II: 92 https://gateoverflow.in/288285

​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

ugcnetdec2018ii

40.0.93 UGCNET-DEC2018-II: 91 https://gateoverflow.in/288286

​An agent can improve its performance by

 A. Perceiving B. Responding C. Learning D. Observing
ugcnetdec2018ii

40.0.94 UGCNET-DEC2018-II: 88 https://gateoverflow.in/288289

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
ugcnetdec2018ii

40.0.95 UGCNET-DEC2018-II: 86 https://gateoverflow.in/288291

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
ugcnetdec2018ii computer-networks

40.0.96 UGCNET-Nov2017-iii-57 https://gateoverflow.in/166433

Let P , Q, R and S be Propositions. Assume that the equivalences P ⇔ (Q ∨ ¬Q) and Q ⇔ R hold. Then the truth
value of the formula (P ∧ Q) ⇒ ((P ∧ R) ∨ S) is always

A. True B. False
C. Same as truth table of Q D. Same as truth table of S
ugcnetnov2017-iii

40.0.97 UGCNET-DEC2018-II: 84 https://gateoverflow.in/288293

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. 0 B. 1 C. 2 D. 3
ugcnetdec2018ii databases
40.0.98 UGCNET-DEC2018-II: 82 https://gateoverflow.in/288295

Consider a relation schema R = (A, B, C, D, E, F) on which the following functional dependencies hold :
A→B
B, C → D
E→C
D→A
What are the candidate keys of R ?

A. AE and BE B. AE, BE and DE C. AEF, BEF and BCFD. AEF, BEF and DEF
ugcnetdec2018ii databases

40.0.99 UGCNET-DEC2018-II: 81 https://gateoverflow.in/288296

​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

ugcnetdec2018ii

40.0.100 UGCNET-DEC2018-II: 80 https://gateoverflow.in/288297

​Which of the following statement/s is/are true ?

i. Facebook has the world’s largest Hadoop Cluster.

ii. Hadoop 2.0 allows live stream processing of Real time data.

Choose the correct answer from the code given below :

Code :
A. (i) only B. (ii) only
C. Both (i) and (ii) D. Neither (i) nor (ii)
ugcnetdec2018ii

40.0.101 UGCNET-DEC2018-II: 79 https://gateoverflow.in/288298

​_______ command is used to remove a relation from SQL database.

A. Drop table B. Delete table
C. Remove table D. Update table
ugcnetdec2018ii

40.0.102 UGCNET-DEC2018-II: 78 https://gateoverflow.in/288299

​Data warehouse contains _____ data that is never found in operational environment.

A. Summary B. Encoded C. Encrypted D. Scripted

ugcnetdec2018ii

40.0.103 UGCNET-DEC2018-II: 77 https://gateoverflow.in/288300

An attribute A of datatype varchar( 20) has the value ‘xyz ′, and the attribute B of datatype char( 20) has the value
“lmnop”, then the attribute A has _____ spaces and attribute B has ____ spaces.

A. 3, 5 B. 20, 20 C. 3, 20 D. 20, 5
ugcnetdec2018ii
40.0.104 UGCNET-DEC2018-II: 76 https://gateoverflow.in/288301

​______ system call creates new process in Unix.

A. create B. create new C. fork D. fork new

ugcnetdec2018ii

40.0.105 UGCNET-Nov2017-iii-74 https://gateoverflow.in/166450

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)
ugcnetnov2017-iii

40.0.106 UGCNET-Nov2017-iii-72 https://gateoverflow.in/166448

The Sigmoid activation function f(t) is defined as

1 B. t exp(−t)
A.
exp(t) + exp(−t)
1 1
C. D.
1 + exp(t) 1 + exp(−t)
ugcnetnov2017-iii

40.0.107 UGCNET-Nov2017-iii-43 https://gateoverflow.in/166419

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

ugcnetnov2017-iii

40.0.108 UGCNET-Oct2020-I: 40 https://gateoverflow.in/349533

Given below are two statements: One is labelled as Assertion (A) and the other is labelled as Reason (R)
Assertion (A) : Carbon monoxide (CO) is a serious asphyxiant; even a short exposure
may have fatal health issues.
Reason (R) : Hemoglobin present in the blood has greater affinity towards
carbon monoxide than oxygen
In the light of the above statements, choose the most appropriate answer from the options given below:

A. Both (A) and (R) are correct and (R) is the correct explanation of (A)
B. Both (A) and (R) are correct but (R) is NOT the correct explanation of (A)
C. (A) is correct but (R) is not correct
D. (A) is not correct but (R) is correct

ugcnet-oct2020-i

40.0.109 UGCNET-DEC2018-II: 74 https://gateoverflow.in/288303

Suppose P , Q and R are co-operating processes satisfying Mutual Exclusion condition. Then, if the process Q is
executing in its critical section then

A. Both ‘P ′ and ‘R′ execute in critical section

B. Neither ‘P ′ nor ‘R′ executes in their critical section
C. ‘P ′ executes in critical section
D. ‘R′ executes in critical section
 ugcnetdec2018ii operating-system

40.0.110 UGCNET-Oct2020-I: 42 https://gateoverflow.in/349531

Which of the following explain the concept of values?

a. Values are beliefs tied inextricably to human emotion and
b. Values refer to desirable goals people strive to attain
behaviour Choose the correct answer from the options given below:
c. Values are conflict-free d. Values are ordered by importance relative to one another
e. Values are utilized primarily to effect change in knowledge of a
person
A. (a), (b), (c) only B. (a), (b), (d) only
C. (b), (c), (d) only D. (c), (d), (e) only
ugcnet-oct2020-i

40.0.111 UGCNET-DEC2018-II: 13 https://gateoverflow.in/288364

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
ugcnetdec2018ii

40.0.112 UGCNET-DEC2018-II: 53 https://gateoverflow.in/288324

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

ugcnetdec2018ii

40.0.113 UGCNET-DEC2018-II: 52 https://gateoverflow.in/288325

The Software Requirement Specification (SRS) 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

ugcnetdec2018ii

40.0.114 UGCNET-DEC2018-II: 51 https://gateoverflow.in/288326

Consider the C /C + + function f() 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 f() ?

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

ugcnetdec2018ii

40.0.115 UGCNET-DEC2018-II: 50 https://gateoverflow.in/288327

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>

ugcnetdec2018ii

40.0.116 UGCNET-DEC2018-II: 49 https://gateoverflow.in/288328

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 1’s in the binary representation of integer a
D. Return the int that represents the number of 0’s in the binary representation of integer a

ugcnetdec2018ii

40.0.117 UGCNET-DEC2018-II: 48 https://gateoverflow.in/288329

Consider the following recursive Java function f 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 f(2, 3)?

A. 0 B. 1 C. 2 D. 3
ugcnetdec2018ii

40.0.118 UGCNET-DEC2018-II: 47 https://gateoverflow.in/288330

Consider the following two C + + programs P 1 and P 2 and two statements S1 and S2 about these programs:
P1 P2
 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< < “:” < <
count <<i; b;
} }

S1 : P 1 prints out 3.
S2 : P 2 prints out 4 : 2
What can you say about the statements S1 and S2 ?
Code :
A. Only S1 is true B. Only S2 is true
C. Both S1 and S2 are true D. Neither S1 nor S2 is true
ugcnetdec2018ii

40.0.119 UGCNET-DEC2018-II: 46 https://gateoverflow.in/288331

Consider the following pseudo-code fragment, where m is a non-negative integer that has been initialized:
p=0
k=0
while (k < m)
p = p + 2k
k=k+1
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. p = 2k − 1 and 0 ≤ k < m B. p = 2k+1 − 1 and 0 ≤ k < m

C. p = 2k − 1 and 0 ≤ k ≤ m D. p = 2k+1 − 1 and 0 ≤ k ≤ m
ugcnetdec2018ii

40.0.120 UGCNET-DEC2018-II: 45 https://gateoverflow.in/288332

​In 3D 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 16-bit, 32-bit, or 64 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 :
Code :

A. P only B. Q only C. P and Q D. Neither P nor Q

ugcnetdec2018ii

40.0.121 UGCNET-Oct2020-I: 43 https://gateoverflow.in/349530

Which of the following come under the mandate of the University Grants Commission (UGC)?
 a. Promotion and coordination of University education b. Determining and monitoring standards of teaching, examination
and research in Universities
c. Organising continuous professional development programmes d. forFraming regulations on minimum standards of education
college and University teachers Choose the correct answer from the options given below:
e. Disbursing and regulating grants to the universities and colleges
A. (a), (b), (c), (d) only B. (b), (c), (d), (e) only
C. (a), (c), (d), (e) only D. (a), (b), (d), (e) only
ugcnet-oct2020-i

40.0.122 UGCNET-DEC2018-II: 55 https://gateoverflow.in/288322

Which of the following statements is/are false ?

P : The clean-room strategy to software engineering is based on the incremental software process model.
Q : 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:
Code :

A. P only B. Q only C. Both P and Q D. Neither P nor Q

ugcnetdec2018ii

40.0.123 UGCNET-Oct2020-I: 19 https://gateoverflow.in/349554

Identifying the sequence of stages of message processing

a. Action b. Internalisation
c. Selection d. Understanding
e. Perception Choose the correct answer from the options given below
A. (a), (b), (d), (e), (c) B. (b), (c), (a), (d), (e)
C. (d), (e), (b), (a), (c) D. (e), (d), (c), (b), (a)
ugcnet-oct2020-i

40.0.124 UGCNET-Oct2020-I: 31 https://gateoverflow.in/349543

A type of memory that holds the computer startup routine is

A. Cache B. RAM C. DRAM D. ROM

ugcnet-oct2020-i

40.0.125 UGCNET-Oct2020-I: 29 https://gateoverflow.in/349544

Match List-I with List-II

List I List II
(Philosophical doctrines) (Philosophical schools)
(A) Syadavada (I) Nyaya
(B) Anupalabdhi (II) Buddhism
(C) Apoha (III) Vedanta
(D) Abhava (IV ) Jainism
Choose the correct answer from the options given below:
A. (A) − (II), (B) − (IV ), (C) − (III), (D) − (I) B. (A) − (IV ), (B) − (III), (C) − (II), (D) − (I)
C. (A) − (I), (B) − (II), (C) − (IV ), (D) − (III) D. (A) − (III), (B) − (I), (C) − (II), (D) − (IV )
ugcnet-oct2020-i

40.0.126 UGCNET-Oct2020-I: 28 https://gateoverflow.in/349545

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.
 a. S’esavat anumana b. Comparison c. Purvovat anumana d. Both (A) and (B) Choose the appropriate
answer from the options
given below:

A. (a) only B. (b) only C. (c) only D. (d) only

ugcnet-oct2020-i

40.0.127 UGCNET-Oct2020-I: 27 https://gateoverflow.in/349546

Given below are two statements: One is labelled as Assertion (A) and the other is labelled as Reason (R)
Assertion (A): Substance is always the subject of all predicates
Reason (R): 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 (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

ugcnet-oct2020-i

40.0.128 UGCNET-Oct2020-I: 26 https://gateoverflow.in/349547

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

ugcnet-oct2020-i

40.0.129 UGCNET-Oct2020-I: 25 https://gateoverflow.in/349548

Three pipes fill a tank in 4 hours. If two of them take 8 and 12 hours each to fill the tank, how many hours will the
third pipe take to fill the tank?

A. 6 hours B. 15 hours C. 18 hours D. 24 hours

ugcnet-oct2020-i

40.0.130 UGCNET-DEC2018-II: 26 https://gateoverflow.in/288351

In a ternary tree, the number of internal nodes of degree 1, 2, and 3 is 4, 3, and 3 respectively. The number of leaf
nodes in the ternary tree is

A. 9 B. 10 C. 11 D. 12
ugcnetdec2018ii

40.0.131 UGCNET-Oct2020-I: 23 https://gateoverflow.in/349550

If some pens are pencils but no pencil is sharpener then

a. All pencils are pens b. Some sharpeners are pencils d. Some pencils are not pens Choose
c. Some pens are not sharpener the correct
answer from the options
given below:

A. (a) and (c) only B. (b) and (c) only C. (a) and (d) only D. (b) and (d) only
ugcnet-oct2020-i

40.0.132 UGCNET-DEC2018-II: 54 https://gateoverflow.in/288323

Match each UML diagram in List I to its appropriate description in List II.
 List I List II
(a) State (i) Describes how the external entities (people, devices) can
Diagram interect with the System
(b) Use Case (ii) Used to describe the static or structural view of a system
Diagram
(c) Class (iii) Used to show the flow of a business process, the steps
Diagram of a use-case or the logic of an object behaviour
(d) Activity (iv) Used to describe the dynamic behaviour of objects and
Diagram could also be used to describe the entire system behaviour
Code :
A. (a)-(i); (b)-(iv); (c)-(ii); (d)-(iii) B. (a)-(iv); (b)-(ii); (c)-(i); (d)-(iii)
C. (a)-(i); (b)-(iv); (c)-(iii); (d)-(ii) D. (a)-(iv); (b)-(i); (c)-(ii); (d)-(iii)
ugcnetdec2018ii

40.0.133 UGCNET-DEC2018-II: 56 https://gateoverflow.in/288321

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 P is the minimum number of tests to achieve full statement coverage for f(), and Q is the minimum number of tests to
achieve full branch coverage for f(), then (P , Q) =

A. (3, 4) B. (4, 3) C. (2, 3) D. (3, 2)

ugcnetdec2018ii

40.0.134 UGCNET-Oct2020-I: 21 https://gateoverflow.in/349552

In a park, A, B, C, D, E and F are sitting. C is the brother of D’s husband and son of A. F is the daughter of D and
sister of E.​​
a. E is the grandson of A b. F is the daughter of C
c. B is the father of F d. There are one son and one daughter in the group
e. C is the uncle of E Choose the correct answer from the options given below:
A. (A), (B) and (C) only B. (A), (C) and (E) only
C. (B), (D) and (E) only D. (B), (C) and (D) only
ugcnet-oct2020-i

40.0.135 UGCNET-DEC2018-II: 28 https://gateoverflow.in/288349

In K-coloring of an undirected graph G = (V , E) is a function. c : V → {0, 1, … , K − 1} such that c(u) ≠ c(v)

for every edge (u, v) ∈ E .
Which of the following is not correct?
A. G is bipartite B. G is 2-colorable
C. G has cycles of odd length D. G has no cycles of odd length
ugcnetdec2018ii

40.0.136 UGCNET-DEC2018-II: 42 https://gateoverflow.in/288335

Which homogeneous 2D matrix transforms the figure (a) on the left side to figure (b) on the right?
 ⎛0 2 −6 ⎞
A. ⎜2 0 1 ⎟
⎝0 0 1 ⎠
⎛0 −2 6 ⎞
B. ⎜1 0 1⎟
⎝0 0 1⎠
⎛1 −2 6 ⎞
C. ⎜1 0 2⎟
⎝0 0 1⎠
⎛0 2 6⎞
D. ⎜1 0 1⎟
⎝0 0 1⎠

ugcnetdec2018ii

40.0.137 UGCNET-DEC2018-II: 20 https://gateoverflow.in/288357

If a graph (G) has no loops or parallel edges, and if the number of vertices (n) the graph is n ≥ 3 , then graph G is
Hamiltonian if

A. deg(v) ≥ n
for each vertex
B. deg(v)
v + deg(w) ≥ nC. E(G) ≥v 13and
whenever (n −
w1)(n
are not Choose thebycorrect
− 2)connected
+2 an edgeanswer from the code given
3
below:

A. (i) and (iii) only B. (ii) only C. (ii) and (iii) only D. (iii) only
ugcnetdec2018ii

40.0.138 UGCNET-DEC2018-II: 19 https://gateoverflow.in/288358

Consider a system with 2 level cache. Access times of Level 1 cache, Level 2 cache and main memory are 0.5 ns, 5 ns
and 100 ns respectively. The hit rates of Level 1 and Level 2 caches are 0.7 and 0.8 respectively. What is the average
access time of the system ignoring the search time within the cache?

A. 35.20 ns B. 7.55 ns C. 20.75 ns D. 24.35 ns

ugcnetdec2018ii

40.0.139 UGCNET-DEC2018-II: 17 https://gateoverflow.in/288360

Find the boolean expression for the logic circuit shown below:

¯¯¯¯ ¯¯¯¯
A. AB B. AB
C. AB ¯¯¯¯¯¯¯¯
D. AB
ugcnetdec2018ii digital-logic
40.0.140 UGCNET-DEC2018-II: 41 https://gateoverflow.in/288336

If the frame buffer has 10-bits per pixel and 8-bits are allocated for each of the R, G, and B components, then what
would be the size of the color lookup table (LUT)?

A. (28 + 29 ) bytes B. (210 + 28 ) bytes

C. (210 + 224 ) bytes D. (210 + 211 ) bytes
ugcnetdec2018ii

40.0.141 UGCNET-DEC2018-II: 43 https://gateoverflow.in/288334

​Consider the midpoint (or Bresenham) algorithm for rasterizing lines given below:

1. Input (x1 , y1 ) and (x2 , y2 )

2. y = y1
3. d = f(x1 + 1, y1 + 1/2) //f is the implicit form of a line
4. for x = x1 to x2
5. do
6. plot(x, y)
7. if (d < 0)
8. then
9. y=y+1
10. d = d + (y1 − y2 ) + (x2 − x1 )
11. else
12. d = d + (y1 − y2 )
13. end
14. end

Which statements are true?

P: For a line with slope m > 1, we should change the outer loop in line (4) to be over y
Q: Lines (10) and (12) update the decision variable d through an incremental evaluation of the line equation f
R: The algorithm fails if d is over 0
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

ugcnetdec2018ii

40.0.142 UGCNET-DEC2018-II: 14 https://gateoverflow.in/288363

A computer uses a memory unit with 256 K words of 32 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 64
registers and an address part. How many bits are there in the operation code, the register code part and the address part?

A. 7, 6, 18 B. 6, 7, 18 C. 7, 7, 18 D. 18, 7, 7
ugcnetdec2018ii

40.0.143 UGCNET-DEC2018-II: 59 https://gateoverflow.in/288318

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
ugcnetdec2018ii

40.0.144 UGCNET-DEC2018-II: 71 https://gateoverflow.in/288306

​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
ugcnetdec2018ii
40.0.145 UGCNET-DEC2018-II: 68 https://gateoverflow.in/288309

​In Linux operating system environment ____ command is used to print a file.

A. print B. ptr C. pr D. lpr

ugcnetdec2018ii

40.0.146 UGCNET-DEC2018-II: 44 https://gateoverflow.in/288333

In 3D 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:
Code :

A. P and Q only B. P and R only C. Q and R only D. P, Q and R

ugcnetdec2018ii

40.0.147 UGCNET-DEC2018-II: 67 https://gateoverflow.in/288310

​Which of the following statements/s is/are true ?

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:

Code :
A. (i) only B. (ii) only
C. Neither (i) nor (ii) D. Both (i) and (ii)
ugcnetdec2018ii

40.0.148 UGCNET-DEC2018-II: 66 https://gateoverflow.in/288311

​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:

Code:
A. (i) only B. (ii) only
C. Both (i) and (ii) D. Neither (i) nor (ii)
ugcnetdec2018ii

40.0.149 UGCNET-DEC2018-II: 65 https://gateoverflow.in/288312

The Third Generation mobile phones are digital and based on

A. AMPS B. D − AMPS C. CDMA D. Broadband CDMA

ugcnetdec2018ii

40.0.150 UGCNET-DEC2018-II: 30 https://gateoverflow.in/288347

The second smallest of n elements can be found with ____ comparisons in the worst case.
3n
A. n − 1 B. lg n C. n + ceil(lg n) − 2 D. 2
ugcnetdec2018ii algorithms
40.0.151 UGCNET-DEC2018-II: 63 https://gateoverflow.in/288314

Consider ISO − OSI 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

ugcnetdec2018ii computer-networks

40.0.152 UGCNET-DEC2018-II: 62 https://gateoverflow.in/288315

A. B.
C. D.
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
ugcnetdec2018ii

40.0.153 UGCNET-DEC2018-II: 31 https://gateoverflow.in/288346

Let r = a(a + b)∗ , s = aa∗ b and t = a∗ b be three regular expressions.

Consider the following :

i. L(s) ⊆ L(r) and L(s) ⊆ L(t)

ii. L(r) ⊆ L(s) and L(s) ⊆ L(t)

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
ugcnetdec2018ii

40.0.154 UGCNET-DEC2018-II: 61 https://gateoverflow.in/288316

Match the following Secret Key Algorithms (list I) with Corresponding Key Lengths (List II) and choose the correct
answer from the code given below:
List I List II
(a) Blowfish (i) 128 – 256 bits
(b) DES (ii) 128 bits
(c) IDEA (iii) 1-448 bits
(d) RC5 (iv) 56 bits
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)

ugcnetdec2018ii

40.0.155 UGCNET-DEC2018-II: 60 https://gateoverflow.in/288317

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 :
Code :
 A. P and Q only B. P and R only C. Q and R only D. All of P, Q and R
ugcnetdec2018ii

40.0.156 UGCNET-DEC2018-II: 58 https://gateoverflow.in/288319

Which of the following statements is/are true ?

P : Software Reengineering is preferable for software products having high failure rates, having poor design and/or
having poor code structure.
Q : 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. P only B. Q only C. Both P and Q D. Neither P nor Q

ugcnetdec2018ii

40.0.157 UGCNET-Oct2020-I: 22 https://gateoverflow.in/349551

The ratio of ages of two persons A and B is 3 : 4 and that of ages B and C is 4 : 5 . If the average of all three is 40
years, what is B’s age?

A. 20 years B. 30 years C. 40 years D. 50 years

ugcnet-oct2020-i

40.0.158 UGCNET-Oct2020-I: 24 https://gateoverflow.in/349549

In a 100 meters race, A beat B by 10 meter or 2 second. What is the speed of A?

A. 5 Km/h B. 10 Km/h C. 15 Km/h D. 20 Km/h

ugcnet-oct2020-i

40.0.159 UGCNET-Oct2020-I: 20 https://gateoverflow.in/349553

Match List-I with List-II

List I List II
(Medium) (Example for description)
(A) Newspaper (I) Networking
(B) Radio and television (II) Audio, Video and graphics
(C) Social Media (III) Broadsheet
(D) Multi-media (IV ) Broadcasting
Choose the correct answer from the options given below:
A. (A) − (III), (B) − (IV ), (C) − (I), (D) − (II) B. (A) − (IV ), (B) − (I), (C) − (II), (D) − (III)
C. (A) − (I), (B) − (II), (C) − (III), (D) − (IV ) D. (A) − (II), (B) − (III), (C) − (IV ), (D) − (I)
ugcnet-oct2020-i

40.0.160 UGCNET-Oct2020-I: 18 https://gateoverflow.in/349555

Given below are two statements:

Statement I : Interactive and multimedia systems provide for a new culture of
teaching and learning
Statement II : Virtual classrooms convert students into senseless humanoids
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
 ugcnet-oct2020-i

40.0.161 UGCNET-DEC2018-II: 35 https://gateoverflow.in/288342

Consider the following languages:

L1 = {an+m bn am ∣ n, m ≥ 0}
L2 = {an+m bn+m an+m ∣ n, m ≥ 0}
Which of the following is correct ?
Code :
A. Only L1 is context free language B. Only L2 is context free language
C. Both L1 and L2 are context free languages D. Both L1 and L2 are not context free languages
ugcnetdec2018ii theory-of-computation

40.0.162 UGCNET-Oct2020-I: 48 https://gateoverflow.in/349525

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

ugcnet-oct2020-i

40.0.163 UGCNET-DEC2018-II: 11 https://gateoverflow.in/288366

Consider the following boolean equations:

i. wx + w(x + y) + x(x + y) = x + wy
ii. (wx̄¯¯(y + xz̄¯ ) + ¯¯ ¯¯)y = x̄
¯¯ x̄
w ¯¯y

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
ugcnetdec2018ii digital-logic

40.0.164 UGCNET-DEC2018-II: 10 https://gateoverflow.in/288367

In computers, subtraction is generally carried out by

A. 9’s complement B. 1’s complement
C. 10’s complement D. 2’s complement
ugcnetdec2018ii digital-logic

40.0.165 UGCNET-DEC2018-II: 9 https://gateoverflow.in/288368

Use Dual Simplex Method to solve the following problem:

 Maximize z = −2x1 − 3x2
subject to:
x1 + x2 ≥ 2
2x1 + x2 ≤ 10
x2 + x2 ≤ 8
x1 , x2 ≥ 0
A. x1 = 2, x2 = 0, and z = −4 B. x1 = 2, x2 = 6, and z = −22
C. x1 = 0, x2 = 2, and z = −6 D. x1 = 6, x2 = 2, and z = −18
ugcnetdec2018ii

40.0.166 UGCNET-DEC2018-II: 40 https://gateoverflow.in/288337

The grammar S → (S) ∣ SS ∣ ϵ is not suitable for predictive parsing because the grammar is

A. Right recursive B. Left recursive

C. Ambiguous D. An operator grammar
ugcnetdec2018ii

40.0.167 UGCNET-DEC2018-II: 36 https://gateoverflow.in/288341

A. B.
C. D.

Consider R to be any regular language and L1 , L2 be any two context-free languages. Which of the following is correct?
¯¯¯¯¯¯ ¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯
A. L1 is context free B. (L1 ∪ L2 ) – R is context free
C. L1 ∩ L2 is context free D. L1 – R is context free
ugcnetdec2018ii

40.0.168 UGCNET-DEC2018-II: 39 https://gateoverflow.in/288338

Consider the following grammar G:

S→A∣B
A→a∣c
B→b∣c
where {S, A, B} is the set of non-terminals, {a, b, c, } is the set of terminals.
Which of the following statement(s) is/are correct?
S1 : LR(1) can parse all strings that are generated using grammar G.
S2 : LL(1) can parse all strings that are generated using grammar G.
Choose the correct answer from the code given below:
Code :

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

ugcnetdec2018ii

40.0.169 UGCNET-Oct2020-I: 30 https://gateoverflow.in/349542

Which one of the following pramanas has been accepted in Buddhism?

A. Arthapatti B. Anupalabdhi C. S’abda D. Pratyaksha

ugcnet-oct2020-i
40.0.170 UGCNET-Oct2020-I: 49 https://gateoverflow.in/349524

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

ugcnet-oct2020-i

40.0.171 UGCNET-Oct2020-I: 50 https://gateoverflow.in/349523

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

ugcnet-oct2020-i

40.0.172 UGCNET-DEC2018-II: 7 https://gateoverflow.in/288370

¯¯¯¯
The boolean expression A ⋅ B + A ⋅ ¯B
¯¯¯
+ A ⋅ B is equivalenet to
¯¯¯¯ ¯¯¯¯¯¯¯¯¯¯¯¯¯¯
A. A ⋅ B B. A + B C. A ⋅ B D. A + B
ugcnetdec2018ii digital-logic

40.0.173 UGCNET-DEC2018-II: 6 https://gateoverflow.in/288371

The relation ≤ and > on a boolean algebra are defined as:

x ≤ y if and only if x ∨ y = y
x < y means x ≤ y but x ≠ y
x ≥ y means y ≤ x and
x > y means y < x
Considering the above definitions, which of the following is not true in the boolean algebra?

i. If x ≤ y and y ≤ z , then x ≤ z
ii. If x ≤ y and y ≤ x , then x = y
iii. If x < y and y < z , then x ≤ y
iv. If x < y and y < z , then x < y
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

ugcnetdec2018ii

40.0.174 UGCNET-DEC2018-II: 1 https://gateoverflow.in/288376

​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

ugcnetdec2018ii mathematical-logic

40.0.175 UGCNET-DEC2018-II: 37 https://gateoverflow.in/288340

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 ?

Code :
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

ugcnetdec2018ii

40.0.176 UGCNET-DEC2018-II: 5 https://gateoverflow.in/288372

​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
ugcnetdec2018ii digital-logic

40.0.177 UGCNET-DEC2018-II: 2 https://gateoverflow.in/288375

​Match List-I with List-II and choose the correct answer from the code given below :
 List I List II
(a) Equivalence (i) p⇒q
(b) Contrapositive (ii) p ⇒ q; q ⇒ p
(c) Converse (iii) p ⇒ q :∼ q ⇒∼ p
(d) Implication (iv) p⇔q

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)
ugcnetdec2018ii mathematical-logic

40.0.178 UGCNET-Oct2020-I: 33 https://gateoverflow.in/349540

A firewall is a software tool that protects

a. Server b. Network c. Fire d. Individual computer Choose the correct

answer from the options
given below:

A. a, c only B. b, c only C. a, b, c only D. a, b, d only

ugcnet-oct2020-i

40.0.179 UGCNET-Oct2020-I: 6 https://gateoverflow.in/349567

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
ugcnet-oct2020-i

40.0.180 UGCNET-DEC2018-II: 38 https://gateoverflow.in/288339

Which one of the following problems is decidable for recursive languages (L) ?

A. Is L = ϕ ? B. Is w ∈ L , where w is a string ?
C. Is L = Σ∗ ? D. Is L = R , where R is a given regular set ?
ugcnetdec2018ii

40.0.181 UGCNET-Oct2020-I: 13 https://gateoverflow.in/349560

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. 1, 2 and 3 only B. 2, 4 and 5 only C. 2, 3 and 4 only D. 3 4 and 5 only

ugcnet-oct2020-i

40.0.182 UGCNET-Oct2020-I: 32 https://gateoverflow.in/349541

Cloud computing has the following distinct characteristics:

a. The service is hosted onb.theIt internet

is made available by ac.service
It computes
provider
and predictsd.rain
Thewhen
service
the is
weather
fully managedChoose
is cloudy the
by the provider correct
answer from the options
given below:

A. a, b only B. a, b, c only C. a, d only D. a, b, d only

ugcnet-oct2020-i
40.0.183 UGCNET-Oct2020-I: 44 https://gateoverflow.in/349529

Given below are two statements:

Statement I : Equality of educational opportunities is a pre-condition for
achieving equity in education.
Statement II : Equity in education can be achieved without equality of
educational opportunities.
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

ugcnet-oct2020-i

40.0.184 UGCNET-Oct2020-I: 45 https://gateoverflow.in/349528

What are the advantages of Choice Based Credit System (CBCS) introduces by the UGC for higher education
institutions?
a. Focuses on student centric education b. Allows students to choose inter-disciplinary and intra-disciplinary
courses
c. Makes education at par with global standards d. Makes it easy to estimate the performance levels of students in
terms of marks
e. Offers flexibility for students to undertake studies at differentChoose the correct answer from the options given below:
times and at different institutions
A. (a), (b), (c), (d) only B. (b), (c), (d), (e) only
C. (a), (b), (c), (e) only D. (c), (d), (e), (a) only
ugcnet-oct2020-i

40.0.185 UGCNET-Oct2020-I: 17 https://gateoverflow.in/349556

Which of the following are useful in positive components of classroom communication?​​

a. Restrictive actions b. Empathy
c. Punctuality d. Follow-up
e. Scattered reflections Choose the most appropriate answer from the options given
below:
A. (a), (b), (c) only B. (b), (c), (d) only
C. (c), (d), (e) only D. (a), (d), (e) only
ugcnet-oct2020-i

40.0.186 UGCNET-Oct2020-I: 16 https://gateoverflow.in/349557

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
ugcnet-oct2020-i

40.0.187 UGCNET-Oct2020-I: 15 https://gateoverflow.in/349558

Given below are the two statements:

Statement I : Qualitative research is an umbrella term to refer to various research
strategies that share certain characteristics. The data collected have
been termed ‘soft’ i.e., rich in description
Statement II : Quantitative research is mainly hypothetico deductive and employs
mostly statistical techniques for data analysis
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 is false
D. Statement I is incorrect but Statement II is true

ugcnet-oct2020-i

40.0.188 UGCNET-Oct2020-I: 14 https://gateoverflow.in/349559

Given below are two statements: One is labelled as Assertion (A) and the other is labelled as Reason (R)
Assertion (A) : In order to bring the gap between theory and practice
both fundamental and applied research formats have to be promoted.
Reason (R) : Fundamental research focuses on theory making and applied research
is directed at exploring the applicability of theory in varied
practical situations
In the light of the above statements, choose the most appropriate answer from the options given below:

A. Both (A) and (R) are correct and (R) is the correct explanation of (A)
B. Both (A) and (R) are correct but (R) is NOT the correct explanation of (A)
C. (A) is correct and (R) is not incorrect
D. (A) is not correct and (R) is correct

ugcnet-oct2020-i

40.0.189 UGCNET-Oct2020-I: 12 https://gateoverflow.in/349561

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 .05 level. What decisions will be warranted thereafter?

1. Rejecting the Null hypothesis (H0 )

2. Accepting the Null hypothesis (H0 )
3. Accepting the alternate hypothesis (H1 )
4. Keeping the decision in abeyance
5. Rejecting the alternate hypothesis (H1 )

Choose the correct answer from the options given below:

A. 1 and 2 only B. 2 and 3 only C. 4 only D. 1 and 3 only

ugcnet-oct2020-i

40.0.190 UGCNET-Oct2020-I: 7 https://gateoverflow.in/349566

Identify the teaching strategies which are employed during indirect instruction:

A. Emphasizing direct andB.indirect

Presenting
examplars
the stimulusC.
material
Inquiry based question-answer
D. Presenting,
sessionasking and providing
E. Promoting
feed problem
back solving approach
Choose the correct answer from the options given below

A. A, B and C only B. B, C and D only C. C, D and E only D. A, C and E only

ugcnet-oct2020-i

40.0.191 UGCNET-DEC2018-II: 34 https://gateoverflow.in/288343

Consider the following two languages :

L1 = {x ∣ for some y with ∣ y ∣= 2∣x∣ , xy ∈ L and L is regular language}
L2 = {x ∣ for some y such that ∣ x ∣=∣ y ∣, xy ∈ L and L is regular language}
Which one of the following is correct ?
A. Only L1 is regular language B. Only L2 is regular language
C. Both L1 and L2 are regular languages D. Both L1 and L2 are not regular languages
ugcnetdec2018ii theory-of-computation
40.0.192 UGCNET-Oct2020-I: 11 https://gateoverflow.in/349562

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
ugcnet-oct2020-i

40.0.193 UGCNET-Oct2020-I: 10 https://gateoverflow.in/349563

Given below are two statements:

Statement I : Indirect instruction is an approach to teaching and learning in which
the process is inquiry, the content involves concept and
the context is a problem
Statement II : In NRT test data tell us about a student’s level of proficiency
in mastery of some skills or set of skills
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 and Statement II is false
D. Statement I is incorrect but Statement II is true

ugcnet-oct2020-i

40.0.194 UGCNET-Oct2020-I: 46 https://gateoverflow.in/349527

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 MBO, organisation is managed through the identification of
A. competing goals B. common objectives
C. its specific characteristics D. senior and junior managers
ugcnet-oct2020-i

40.0.195 UGCNET-Oct2020-I: 34 https://gateoverflow.in/349539

The word blog is derived from the word

A. My log B. We blog C. E blog D. Blogger

ugcnet-oct2020-i

40.0.196 UGCNET-Oct2020-I: 47 https://gateoverflow.in/349526

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
ugcnet-oct2020-i

40.0.197 UGCNET-Oct2020-I: 9 https://gateoverflow.in/349564

Match List-I with List-II:

List-I List-II
(Scales of measurement) (Description of properties)
(A) Nominal (I) Classification and order
(B) Ordinal (II) Classification
(C) Interval (III) Classification, order and equal units
(D) Ratio (IV ) Classification, order, equal units
and Absolute Zero
Choose the correct answer from the options given below:
A. (A) − (IV ), (B) − (III), (C) − (II), (D) − (I) B. (A) − (II), (B) − (I), (C) − (III), (D) − (IV )
C. (A) − (I), (B) − (II), (C) − (IV ), (D) − (III) D. (A) − (III), (B) − (IV ), (C) − (I), (D) − (II)
ugcnet-oct2020-i

40.0.198 UGCNET-Oct2020-I: 8 https://gateoverflow.in/349565

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
ugcnet-oct2020-i

40.0.199 UGCNET-DEC2018-II: 4 https://gateoverflow.in/288373

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 30 people; Train 35 people; Automobile 100 people; Bus and Train 15 people; Bus and Automobile 15 people; Train and
Automobile 20 people; and all the three methods 5 people. How many people completed the survey form?

A. 120 B. 165 C. 160 D. 115

ugcnetdec2018ii

40.1 Binary Search Tree (1)

40.1.1 Binary Search Tree: UGCNET-DEC2018-II: 25 https://gateoverflow.in/288352

A binary search tree is constructed by inserting the following numbers in order :

60, 25, 72, 15, 30, 68, 101, 13, 18, 47, 70, 34
The number of nodes in the left subtree is

A. 5 B. 6 C. 7 D. 3
ugcnetdec2018ii data-structures binary-search-tree

40.2 Cloud Computing (1)

 40.2.1 Cloud Computing: UGCNET-DEC2018-II: 64 https://gateoverflow.in/288313

Suppose a cloud contains software stack such as Operating systems, Application softwares, etc. This model is referred
as ____ model

A. SaaS B. PaaS C. IaaS D. MaaS

ugcnetdec2018ii cloud-computing

40.3 Clustering (1)

40.3.1 Clustering: UGCNET-Nov2017-ii-48 https://gateoverflow.in/166282

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
ugcnetnov2017-ii data-mining clustering

40.4 Co And Architecture (2)

40.4.1 Co And Architecture: UGCNET-Nov2017-ii-46 https://gateoverflow.in/166280

Which of the following Super Computers is the fastest Super Computer?

A. Sun-way TaihuLight B. Titan C. Piz Daint D. Sequoia

ugcnetnov2017-ii co-and-architecture

40.4.2 Co And Architecture: UGCNET-Nov2017-ii-50 https://gateoverflow.in/166284

Which speed up could be achieved according to Amdahl's Law for infinte number of processes if 5% of a program is
sequential and the remaining part is ideally parallel?

A. Infinite B. 5 C. 20 D. 50
ugcnetnov2017-ii co-and-architecture

40.5 Computer Architecture (1)

40.5.1 Computer Architecture: UGCNET-DEC2018-II: 15 https://gateoverflow.in/288362

Consider the following ×86 – assembly language instructions:

MOV AL, 153
NEG AL
The contents of the destination register AL (in 8-bit binary notation), th status of Carry Flag (CF) and Sign Flag (SF) after
the execution of above instructions, are
A. AL = 0110 0110; CF = 0; SF = 0 B. AL = 0110 0111; CF = 0; SF = 1
C. AL = 0110 0110; CF = 1; SF = 1 D. AL = 0110 0111; CF = 1; SF = 0
ugcnetdec2018ii computer-architecture

40.6 Counting (1)

40.6.1 Counting: UGCNET-DEC2018-II: 33 https://gateoverflow.in/288344

The number of substrings that can be formed from string given by

adefbghnmp
is

A. 10 B. 45 C. 55 D. 56

ugcnetdec2018ii combinatory counting

40.7 Deadlock (1)

 40.7.1 Deadlock: UGCNET-DEC2018-II: 70 https://gateoverflow.in/288307

Suppose a system has 12 instances of some resource with n processes competing for that resource. Each process may
require 4 instances of the resources. The maximum value of n for which the system never enters into deadlock is

A. 3 B. 4 C. 5 D. 6
ugcnetdec2018ii operating-system deadlock

40.8 Disk Scheduling (1)

40.8.1 Disk Scheduling: UGCNET-Nov2017-ii-37 https://gateoverflow.in/166271

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

ugcnetnov2017-ii operating-system disk-scheduling

40.9 Disks (1)

40.9.1 Disks: UGCNET-DEC2018-II: 18 https://gateoverflow.in/288359

Consider a disk pack with 32 surfaces, 64 tracks and 512 sectors per pack. 256 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. 18 B. 19 C. 20 D. 22
ugcnetdec2018ii operating-system disks

40.10 Dynamic Programming (1)

40.10.1 Dynamic Programming: UGCNET-DEC2018-II: 23 https://gateoverflow.in/288354

Consider two sequences X and Y :

X =< 0, 1, 2, 1, 3, 0, 1 >
Y =< 1, 3, 2, 0, 1, 0 >
The length of longest common subsequence between X and Y is

A. 2 B. 3 C. 4 D. 5
ugcnetdec2018ii algorithms dynamic-programming

40.11 E Technologies (1)

40.11.1 E Technologies: UGCNET-Nov2017-ii-47 https://gateoverflow.in/166281

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

ugcnetnov2017-ii e-technologies

40.12 Ethernet (1)

40.12.1 Ethernet: UGCNET-Nov2017-ii-28 https://gateoverflow.in/166262

The number of bits used for addressing in Gigabit Ethernet is __________.

A. 32 bits B. 48 bits C. 64 bits D. 128 bits

 ugcnetnov2017-ii computer-networks ethernet

40.13 Finite Automata (1)

40.13.1 Finite Automata: UGCNET-DEC2018-II: 32 https://gateoverflow.in/288345

Consider the language L given by

L = {2nk ∣ k > 0, and n is non-negative integer number }

The minimum number of states of finite automaton which accepts the language L is
n(n+1)
A. n B. n + 1 C. 2 D. 2n
ugcnetdec2018ii theory-of-computation finite-automata

40.14 Floating Point Representation (1)

40.14.1 Floating Point Representation: UGCNET-DEC2018-II: 16 https://gateoverflow.in/288361

The decimal floating point number −40.1 represented using IEEE − 754 32 -bit representation and written in
hexadecimal form is

A. 0xC2206666 B. 0xC2206000 C. 0xC2006666 D. 0xC2006000

ugcnetdec2018ii digital-logic number-representation floating-point-representation

40.15 Graph Algorithms (1)

40.15.1 Graph Algorithms: UGCNET-DEC2018-II: 27 https://gateoverflow.in/288350

Match List I with List II and choose the correct answer from the code given below.
List I List II
(Graph Algorithm) (Time Complexity)
(a) Dijkstra’s algorithm (i) O(E lg E)
(b) Kruskal’s algorithm (ii) Θ(V 3 )
(c) Floyd-Warshall algorithm (iii) O(V 2 )
(d) Topological sorting (iv) Θ(V + E)
where V and E are the number of vertices and edged in graph respectively.
Code :
A. (a)-(i), (b)-(iii), (c)-(ii), (d)-(iv) B. (a)-(iii), (b)-(i), (c)-(ii), (d)-(iv)
C. (a)-(i), (b)-(iii), (c)-(iv), (d)-(ii) D. (a)-(iii), (b)-(i), (c)-(iv), (d)-(ii)
ugcnetdec2018ii algorithms graph-algorithms time-complexity

40.16 Heap (1)

40.16.1 Heap: UGCNET-DEC2018-II: 22 https://gateoverflow.in/288355

The elements 42, 25, 30, 40, 22, 35, 26 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. < 42, 40, 35, 25, 22, 30, 26 > B. < 42, 35, 40, 22, 25, 30, 26 >
C. < 42, 40, 35, 25, 22, 26, 30 > D. < 42, 35, 40, 22, 25, 26, 30 >
ugcnetdec2018ii data-structures heap

40.17 Indexing (1)

40.17.1 Indexing: UGCNET-DEC2018-II: 85 https://gateoverflow.in/288292

​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
ugcnetdec2018ii databases indexing

40.18 Ip Addressing (1)

 40.18.1 Ip Addressing: UGCNET-Nov2017-ii-30 https://gateoverflow.in/166264

The IP address _________ is used by hosts when they are being booted.

A. 0.0.0.0 B. 1.0.0.0 C. 1.1.1.1 D. 255.255.255.255

ugcnetnov2017-ii computer-networks ip-addressing

40.19 Linked Lists (1)

40.19.1 Linked Lists: UGCNET-DEC2018-II: 29 https://gateoverflow.in/288348

Consider a singly linked list. What is the worst case time complexity of the best-known algorithm to delete the node a,
pointer to this node is q, from the list?

A. O(n lg n) B. O(n) C. O(lg n) D. O(1)

ugcnetdec2018ii data-structures linked-lists time-complexity

40.20 Microprocessors (1)

40.20.1 Microprocessors: UGCNET-Dec2015-III: 3 https://gateoverflow.in/62426

Which of the following 8085 microprocessor hardware interrupt has the lowest priority?

A. RST 6.5 B. RST 7.5 C. TRAP D. INTR

ugcnetdec2015iii microprocessors 8085-microprocessor

40.21 Minimum Spanning Trees (1)

40.21.1 Minimum Spanning Trees: UGCNET-DEC2018-II: 12 https://gateoverflow.in/288365

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. 17 B. 14 C. 16 D. 13
ugcnetdec2018ii algorithms minimum-spanning-trees

40.22 Multiplexing (1)

40.22.1 Multiplexing: UGCNET-June2011-II: 26 https://gateoverflow.in/64713

A comparison of frequency division and time division multiplexing system shows that

A. FDM requires a lower bandwidth, but TDM has greater noise immunity.
B. FDM has greater noise immunity and requires lower bandwidth than TDM .
C. FDM requires channel synchronization, while TDM has greater noise immunity.
D. FDM requires more multiplex while TDM requires band pass filter.

ugcnetjune2011ii computer-networks multiplexing

40.23 Network Security (1)

 40.23.1 Network Security: UGCNET-DEC2018-II: 90 https://gateoverflow.in/288287

Suppose that everyone in a group of N people wants to communicate secretly with (N − 1) 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. N(N − 1) B. N(N − 1)/2 C. 2N D. (N − 1)2

ugcnetdec2018ii computer-networks network-security

40.24 Osi Model (1)

40.24.1 Osi Model: UGCNET-Nov2017-ii-29 https://gateoverflow.in/166263

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
ugcnetnov2017-ii computer-networks osi-model

40.25 Page Fault (1)

40.25.1 Page Fault: UGCNET-DEC2018-II: 72 https://gateoverflow.in/288305

Suppose for a process P , reference to pages in order are 1, 2, 4, 5, 2, 1, 2, 4 . Assume that main memory can
accomodate 3 pages and the main memory has already 1 and 2 in the order 1 – first, 2 – 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 P is

A. 4 B. 3 C. 5 D. 6
ugcnetdec2018ii operating-system page-replacement page-fault

40.26 Physical Layer (1)

40.26.1 Physical Layer: UGCNET-June2011-II: 27 https://gateoverflow.in/64716

If carrier modulated by a digital bit stream, has one one of the possible phase of 0, 90, 180 and 270 degrees, then
modulation called

A. BPSK B. QPSK C. QAM D. MSK

ugcnetjune2011ii computer-networks physical-layer

40.27 Probability (1)

40.27.1 Probability: UGCNET-DEC2018-II: 3 https://gateoverflow.in/288374

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?
1 3 1 1
A. 14 B. 7 C. 35 D. 9
ugcnetdec2018ii probability

40.28 Process Synchronization (1)

40.28.1 Process Synchronization: UGCNET-DEC2018-II: 69 https://gateoverflow.in/288308

​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 :

Code :

A. (i) only B. (ii) only C. (iii) only D. Both (ii) and (iii)
 ugcnetdec2018ii operating-system process-synchronization

40.29 Recurrence (1)

40.29.1 Recurrence: UGCNET-DEC2018-II: 21 https://gateoverflow.in/288356

The solution of recurrence relation:

T(n) = 2T(sqrt(n)) + lg(n) is
A. O(lg(n)) B. O(n lg (n))
C. O(lg (n) lg(n)) D. O(lg (n) lg(lg (n)))
ugcnetdec2018ii recurrence

40.30 Round Robin (1)

40.30.1 Round Robin: UGCNET-DEC2018-II: 73 https://gateoverflow.in/288304

​Consider the following set of processes and the length of CPU burst time given in milliseconds :
Process CPU Burst time (ms)
P1 5
P2 7
P3 6
P4 4
Assume that processes being scheduled with Round-Robin Scheduling Algorithm with time quantum 4 ms. Then the waiting
time for P4 is ______ ms

A. 0 B. 4 C. 12 D. 6
ugcnetdec2018ii operating-system process-scheduling round-robin

40.31 Software Testing (1)

40.31.1 Software Testing: UGCNET-Nov2017-ii-45 https://gateoverflow.in/166279

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
ugcnetnov2017-ii is&software-engineering software-testing

40.32 Sql (1)

40.32.1 Sql: UGCNET-Nov2017-ii-17 https://gateoverflow.in/166251

In SQL, ________ is an Aggregate function.

A. SELECT B. CREATE C. AVG D. MODIFY

ugcnetnov2017-ii databases sql

40.33 Stack (1)

40.33.1 Stack: UGCNET-DEC2018-II: 24 https://gateoverflow.in/288353

Consider the following postfix expression with single digit operands :

6 23∗ /42∗ + 68∗ −
The top two elements of the stack after the second ∗ is evaluated, are :

A. 8, 2 B. 8, 1 C. 6, 2 D. 6, 3
ugcnetdec2018ii data-structures stack

40.34 Subnetting (1)

 40.34.1 Subnetting: UGCNET-DEC2018-II: 87 https://gateoverflow.in/288290

An Internet Service Provider (ISP ) has following chunk of CIDR−based IP addresses available with it :
245.248.128.0/20. The ISP wants to give half of this chunk addresses to organization A and a quarter to
organization B while retaining the remaining with itself. Which of the following is a valid allocation of addresses to A and B?
A. 245.248.136.0/21 and 245.248.128.0/22 B. 245.248.128.0/21 and 245.248.128.0/22
C. 245.248.132.0/22 and 245.248.132.0/21 D. 245.248.136.0/24 and 245.248.132.0/21
ugcnetdec2018ii computer-networks subnetting

40.35 Transaction And Concurrency (1)

40.35.1 Transaction And Concurrency: UGCNET-DEC2018-II: 83 https://gateoverflow.in/288294

Consider the following sequence of two transactions on a bank account (A) with initial balance 20, 000 that transfers
5, 000 to another account (B) and then apply 10% interest.

i. T1 start
ii. T1 A old= 20, 000 new 15, 000
iii. T1 B old = 12, 000 new = 17, 000
iv. T1 commit
v. T2 start
vi. T2 A old = 15, 000 new = 16, 500
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 A to 16, 500

B. We must redo log record (vi) to set A to 16, 500 and then redo log records (ii) and (iii)
C. We need not redo log records (ii) and (iii) because transaction T1 is committed
D. We can apply redo and undo operations in arbitrary order because they are idempotent

ugcnetdec2018ii databases transaction-and-concurrency

Answer Keys
40.0.1 D 40.0.2 A 40.0.3 1 40.0.4 D 40.0.5 C
40.0.6 X 40.0.7 A 40.0.8 B 40.0.9 A 40.0.10 C
40.0.11 B 40.0.12 A 40.0.13 B 40.0.14 D 40.0.15 B;C;D
40.0.16 C 40.0.17 D 40.0.18 C 40.0.19 B 40.0.20 A
40.0.21 D 40.0.22 C 40.0.23 C 40.0.24 C 40.0.25 B
40.0.26 B 40.0.27 D 40.0.28 B 40.0.29 C 40.0.30 B
40.0.31 D 40.0.32 B 40.0.33 B 40.0.34 D 40.0.35 B
40.0.36 B 40.0.37 A 40.0.38 C 40.0.39 D 40.0.40 B
40.0.41 B 40.0.42 D 40.0.43 B 40.0.44 A 40.0.45 B
40.0.46 C 40.0.47 D 40.0.48 C 40.0.49 B 40.0.50 B
40.0.51 A 40.0.52 A 40.0.53 C 40.0.54 Q-Q 40.0.55 B
40.0.56 D 40.0.57 A 40.0.58 A 40.0.59 D 40.0.60 A
40.0.61 X 40.0.62 A 40.0.63 C 40.0.64 C 40.0.65 D
40.0.66 B 40.0.67 A 40.0.68 D 40.0.69 A 40.0.70 D
40.0.71 B 40.0.72 D 40.0.73 D 40.0.74 X 40.0.75 D
40.0.76 C 40.0.77 B 40.0.78 B 40.0.79 C 40.0.80 A
40.0.81 A 40.0.82 Q-Q 40.0.83 3 40.0.84 Q-Q 40.0.85 Q-Q
40.0.86 Q-Q 40.0.87 Q-Q 40.0.88 Q-Q 40.0.89 Q-Q 40.0.90 Q-Q
40.0.91 Q-Q 40.0.92 Q-Q 40.0.93 Q-Q 40.0.94 Q-Q 40.0.95 Q-Q
40.0.96 A 40.0.97 Q-Q 40.0.98 Q-Q 40.0.99 Q-Q 40.0.100 Q-Q
40.0.101 Q-Q 40.0.102 Q-Q 40.0.103 Q-Q 40.0.104 Q-Q 40.0.105 D
40.0.106 D 40.0.107 C 40.0.108 A 40.0.109 B 40.0.110 B
40.0.111 Q-Q 40.0.112 Q-Q 40.0.113 Q-Q 40.0.114 B 40.0.115 Q-Q
40.0.116 Q-Q 40.0.117 Q-Q 40.0.118 Q-Q 40.0.119 Q-Q 40.0.120 Q-Q
40.0.121 D 40.0.122 Q-Q 40.0.123 D 40.0.124 D 40.0.125 B
40.0.126 A 40.0.127 B 40.0.128 C 40.0.129 D 40.0.130 B
40.0.131 A 40.0.132 Q-Q 40.0.133 Q-Q 40.0.134 B 40.0.135 Q-Q
40.0.136 Q-Q 40.0.137 Q-Q 40.0.138 B 40.0.139 C 40.0.140 Q-Q
40.0.141 Q-Q 40.0.142 A 40.0.143 Q-Q 40.0.144 Q-Q 40.0.145 Q-Q
40.0.146 Q-Q 40.0.147 Q-Q 40.0.148 Q-Q 40.0.149 Q-Q 40.0.150 Q-Q
40.0.151 Q-Q 40.0.152 Q-Q 40.0.153 A 40.0.154 Q-Q 40.0.155 Q-Q
40.0.156 Q-Q 40.0.157 C 40.0.158 D 40.0.159 A 40.0.160 C
40.0.161 A 40.0.162 D 40.0.163 Q-Q 40.0.164 D 40.0.165 Q-Q
40.0.166 Q-Q 40.0.167 Q-Q 40.0.168 D 40.0.169 D 40.0.170 B
40.0.171 A 40.0.172 Q-Q 40.0.173 Q-Q 40.0.174 A 40.0.175 Q-Q
40.0.176 Q-Q 40.0.177 D 40.0.178 D 40.0.179 A 40.0.180 Q-Q
40.0.181 B 40.0.182 D 40.0.183 C 40.0.184 C 40.0.185 B
40.0.186 A 40.0.187 A 40.0.188 A 40.0.189 D 40.0.190 D
40.0.191 Q-Q 40.0.192 A 40.0.193 C 40.0.194 B 40.0.195 B
40.0.196 C 40.0.197 B 40.0.198 A 40.0.199 Q-Q 40.1.1 C
40.2.1 Q-Q 40.3.1 C 40.4.1 A 40.4.2 C 40.5.1 Q-Q
40.6.1 D 40.7.1 Q-Q 40.8.1 D 40.9.1 C 40.10.1 4
40.11.1 B 40.12.1 B 40.13.1 Q-Q 40.14.1 Q-Q 40.15.1 Q-Q
40.16.1 Q-Q 40.17.1 Q-Q 40.18.1 A 40.19.1 B 40.20.1 X
40.21.1 Q-Q 40.22.1 Q-Q 40.23.1 Q-Q 40.24.1 D 40.25.1 Q-Q
40.26.1 Q-Q 40.27.1 Q-Q 40.28.1 Q-Q 40.29.1 D 40.30.1 Q-Q
40.31.1 D 40.32.1 C 40.33.1 B 40.34.1 Q-Q 40.35.1 Q-Q