Download Ugc Net coverd Privious years and more Study notes Database Management Systems (DBMS) in PDF only on Docsity!
Table of Contents
Table of Contents
Contributors
1 Algorithms (99)
1.1 Activity Selection Problem (1) 1.2 Algorithm Design Techniques (1) 1.3 Algorithm Efficiency (1) 1.4 Algorithms Sorting (1) 1.5 Arrays (2) 1.6 Artificial Intelligence (2) 1.7 Asymptotic Notations (7) 1.8 B Tree (2) 1.9 Binary Search Tree (1) 1.10 Binary Tree (4) 1.11 Branch And Bound (1) 1.12 Decision Tree (1) 1.13 Dfs (2) 1.14 Dijkstras Algorithm (1) 1.15 Double Hashing (1) 1.16 Dynamic Programming (3) 1.17 Graph Algorithms (3) 1.18 Greedy Algorithms (1) 1.19 Hashing (1) 1.20 Heap (1) 1.21 Huffman Code (2) 1.22 In Place Algo (1) 1.23 Knapsack (2) 1.24 Linear Search (1) 1.25 Longest Common Subsequence (1) 1.26 Matrix Chain Ordering (3) 1.27 Optimal Search Tree (1) 1.28 Optimal Solution (1) 1.29 P Np Npc Nph (3) 1.30 Parenthesization (1) 1.31 Quicksort (1) 1.32 Recurrence (6) 1.33 Recursion (2) 1.34 Red Black Tree (1) 1.35 Shortest Path (2) 1.36 Sorting (5) 1.37 Space Complexity (1) 1.38 Time Complexity (8) 1.39 Tree Search Algorithm (1) 1.40 Tree Traversal (1) 1.41 Tree Traversals (1) 1.42 Trees (2) Answer Keys
2 CO and Architecture (105)
2.1 8085 Microprocessor (6) 2.2 Accumultor (1) 2.3 Addressing Modes (11) 2.4 Amdahls Law (1) 2.5 Assembly (13) 2.6 Byte Addressable (1) 2.7 Cache Memory (4) 2.8 Cmos (1) 2.9 Co And Architecture (9) 2.10 Computer Architecture (3)
2.11 Control Unit (2) 2.12 Cpu (1) 2.13 Data Transfer (1) 2.14 Disks (1) 2.15 Dma (1) 2.16 Dynamic Ram (1) 2.17 Flags (1) 2.18 Hardware Interrupt (1) 2.19 Instruction Format (1) 2.20 Integrated Circuits (1) 2.21 Interrupts (4) 2.22 Language (1) 2.23 Machine Instructions (2) 2.24 Macros (1) 2.25 Memory (4) 2.26 Memory Data Transfer (1) 2.27 Microprocessors (12) 2.28 Microprogram Control Unit (1) 2.29 Parallel Computing (1) 2.30 Parallel Processing (1) 2.31 Pipelining (4) 2.32 Priority Encoder (1) 2.33 Processor Address Bus (1) 2.34 Register (1) 2.35 Runtime Environments (1) 2.36 Speedup (1) 2.37 Tlb (1) Answer Keys
3 Compiler Design (68)
3.1 Code Optimization (1) 3.2 Compilation Phases (1) 3.3 Compiler (1) 3.4 Compiler Optimization (2) 3.5 Constant Folding (1) 3.6 Control Flow Graph (1) 3.7 Grammar (4) 3.8 Infix Prefix (1) 3.9 Intermediate Code (1) 3.10 Lexical Analysis (3) 3.11 Linker (1) 3.12 Lr Parser (2) 3.13 Machine Instructions (1) 3.14 Parameter Passing (1) 3.15 Parsing (12) 3.16 Quadruple Representation (1) 3.17 Runtime Environments (1) 3.18 Shift Reduce Parser (2) 3.19 Symbol Table (3) 3.20 System Software& Compilers (1) 3.21 Translator (1) 3.22 Two Pass Assembler (1) Answer Keys
4 Computer Networks (290)
4.1 Analog & Digital Transmission (1) 4.2 Analog Signals (1) 4.3 Application Layer (1) 4.4 Asymmetric Key Cryptography (1) 4.5 Binary Search Tree (1) 4.6 Binary Symmetric Channel (1) 4.7 Bit Oriented Protocol (1)
4.68 Routing Algorithm (3) 4.69 Rsa (1) 4.70 Rsa Public Key (1) 4.71 Rsa Security Networks (2) 4.72 Serial Communication (2) 4.73 Session Layer (1) 4.74 Signalling (1) 4.75 Signals (1) 4.76 Sliding Window (4) 4.77 Slotted Aloha (1) 4.78 Subnetting (1) 4.79 Tcp (4) 4.80 Tcp Header (1) 4.81 Tcp Ip Model (1) 4.82 Tcp Ip Suit Protocols (1) 4.83 Tele Communication (1) 4.84 Token Bucket (1) 4.85 Transmission Media (9) 4.86 Transport Layer (2) 4.87 Unguided Media (1) 4.88 Wifi (1) 4.89 Wireless Communication (1) 4.90 Wireless Lan (4) 4.91 Wireless Networks (1) 4.92 Wireless Protocol (1) 4.93 Wireless Transmission (1) Answer Keys
5 Databases (176)
5.1 Aggregation (2) 5.2 B Tree (3) 5.3 B+tree (1) 5.4 Candidate Keys (4) 5.5 Cardinality Ratio (1) 5.6 Circular Queue (1) 5.7 Concurrency Control Protocols (1) 5.8 Crosstabquery (1) 5.9 Data Dependences (2) 5.10 Data Integrity (1) 5.11 Data Mining (2) 5.12 Data Model (2) 5.13 Database Constraints (1) 5.14 Database Design (1) 5.15 Database Normalization (23) 5.16 Decomposition (3) 5.17 Dependency Preserving (1) 5.18 Distributed Databases (2) 5.19 Enhanced Er Model (1) 5.20 Er Diagram (15) 5.21 File System (1) 5.22 Generalization (1) 5.23 Granularity (1) 5.24 Hierarchical Database (1) 5.25 Indexing (2) 5.26 Java (1) 5.27 Joins (1) 5.28 Object Oriented Database (2) 5.29 Protocol (1) 5.30 Rdbms (9) 5.31 Recovery From Failure (1) 5.32 Referential Integrity (2)
5.33 Relation (2) 5.34 Relational Algebra (3) 5.35 Relational Calculus (2) 5.36 Relational Model (2) 5.37 Relational Schema (1) 5.38 Relations (1) 5.39 Sql (31) 5.40 Transaction And Concurrency (9) 5.41 Transactions And Concurrency Control (1) 5.42 Tree (1) 5.43 Weak Entity (1) Answer Keys
6 Digital Logic (104)
6.1 Adder (3) 6.2 Boolean Algebra (9) 6.3 Boolean Function (1) 6.4 Circuit Output (2) 6.5 Combinational Circuits (3) 6.6 Digital Circuits (11) 6.7 Digital Counter (2) 6.8 Dual Function (2) 6.9 Encoding (1) 6.10 Excess 3 (1) 6.11 Flip Flop (7) 6.12 Floating Point Representation (1) 6.13 Full Adder (1) 6.14 Ieee Representation (2) 6.15 K Map (3) 6.16 Logic Circuit Diagram (1) 6.17 Memory (1) 6.18 Multiplexer (4) 6.19 Number Representation (12) 6.20 Number System (6) 6.21 Number Theory (1) 6.22 Priority Encoder (1) 6.23 Ripple Counter Operation (3) 6.24 Rom (1) 6.25 Sequential Circuit (6) 6.26 Sum Of Product (1) 6.27 Unix (1) Answer Keys
7 Discrete Mathematics: Combinatory (14)
7.1 Binary Tree (1) 7.2 Counting (2) 7.3 Discrete Mathematics (2) 7.4 Euler Phi Function (1) 7.5 Inclusion Exclusion (1) 7.6 Pigeonhole Principle (1) 7.7 Recurrence (1) Answer Keys
8 Discrete Mathematics: Graph Theory (46)
8.1 Binary Tree (1) 8.2 Discrete Mathematics (2) 8.3 Euler Graph (2) 8.4 Flow Network (1) 8.5 Graph (1) 8.6 Graph Coloring (2) 8.7 Graph Connectivity (8) 8.8 Graph Isomorphism (1)
15.1 Logical Reasoning (2) 15.2 Quantitative Aptitude (2) Answer Keys
16 Non GATE: Artificial Intelligence (44)
16.1 Artificial Intelligence (14) 16.2 Artificial Neural Network (1) 16.3 Back Propagation (1) 16.4 Blocks World Problem (1) 16.5 Chaining (1) 16.6 Expert System (2) 16.7 Fuzzy Logic (1) 16.8 Genetic Algorithms (1) 16.9 Heuristic Search (1) 16.10 Linear Programming (1) 16.11 Machine Learning (4) 16.12 Map Coloring (1) 16.13 Means End (1) 16.14 Minimax Procedure (1) 16.15 Neural Network (4) 16.16 Planning (1) 16.17 Prolog (2) 16.18 Reinforcement Learning (1) 16.19 Searches (1) 16.20 Sigmoid Function (1) 16.21 Strips (1) Answer Keys
17 Non GATE: Big Data Systems (1)
17.1 Big Data Systems (1) Answer Keys
18 Non GATE: Cloud Computing (1)
18.1 Cloud Computing (1) Answer Keys
19 Non GATE: Computer Graphics (80)
19.1 2d Geometry (1) 19.2 2d Transformation (1) 19.3 3d Graphics (2) 19.4 3d Rotation (1) 19.5 Animation (1) 19.6 Anti Aliasing (1) 19.7 Breshenmans Algorithm (1) 19.8 Color Models (1) 19.9 Computer Graphics (38) 19.10 Crt (2) 19.11 Digital Image Processing (5) 19.12 Display Devices (1) 19.13 Frame Buffer (1) 19.14 Halftoning (1) 19.15 Image Compression (1) 19.16 Image Entropy (1) 19.17 Line Clipping (1) 19.18 Line Drawing Algorithm (3) 19.19 Parametric Line Equation (1) 19.20 Phong Color Model (1) 19.21 Projection (8) 19.22 Raster Graphics (2) 19.23 Resolution (1) 19.24 Rotation (2) 19.25 Transformation (2) Answer Keys
20 Non GATE: Computer Peripherals (3)
20.1 Computer Peripherals (1) 20.2 Io Devices (1) 20.3 Matrix Printer (1) Answer Keys
21 Non GATE: Data Mining and Warehousing (16)
21.1 Data Cube (1) 21.2 Data Mining (1) 21.3 Data Mining And Warehousing (1) 21.4 Decision Tree (1) 21.5 Expert System (1) 21.6 Fuzzy Sets (1) 21.7 Group Decision Support System (1) 21.8 K Means Clustering (1) 21.9 Knowledge Representation (5) 21.10 Olap (1) 21.11 Perceptron (1) Answer Keys
22 Non GATE: Digital Image Processing (8)
22.1 Discovolution (1) 22.2 Entropy (2) 22.3 Fourier Transform (1) 22.4 Image Compression (4) Answer Keys
23 Non GATE: Digital Signal Processing (4)
23.1 Butterworth Lowpass Filter (1) 23.2 Digital Signal Processing (1) 23.3 Discrete Memoryless Channel (1) 23.4 Spatial Mask (1) Answer Keys
24 Non GATE: Distributed Computing (11)
24.1 Computing Models (1) 24.2 Distributed Computing (3) 24.3 Distributed Databases (2) 24.4 Distributed System (2) 24.5 Message Passing (1) 24.6 Parallel Virtual Machine (1) 24.7 Rpc (1) Answer Keys
25 Non GATE: Geometry (2)
25.1 Geometry (1) 25.2 Lines Curves (1) Answer Keys
26 Non GATE: Integrated Circuits (1)
26.1 Integrated Circuits (1) Answer Keys
27 Non GATE: IS&Software Engineering (210)
27.1 Adaptive Maintenance (1) 27.2 Artificial Intelligence (2) 27.3 Assignment Problem (1) 27.4 Cmm Model (3) 27.5 Cmmi (1) 27.6 Cocomo Model (3) 27.7 Coding And Testing (1) 27.8 Cohesion (2) 27.9 Cost Estimation Model (2) 27.10 Coupling (3) 27.11 Coupling Cohesion (1)
30 Non GATE: Object Oriented Programming (59)
30.1 Abstract Class (2) 30.2 C++ (2) 30.3 Class (1) 30.4 Composition (1) 30.5 Constructor (3) 30.6 Cpp (1) 30.7 Final (1) 30.8 Friend Class (1) 30.9 Friend Function (2) 30.10 Inheritance (3) 30.11 Java (10) 30.12 Object Oriented Programming (24) 30.13 Operator Overloading (1) 30.14 Programming In C (1) 30.15 Software Design (1) 30.16 Template Vs Macro (1) 30.17 Windows (1) Answer Keys
31 Non GATE: Optimization (17)
31.1 Assignment Problem (2) 31.2 Linear Programming (7) 31.3 Linear Programming Problem (1) 31.4 Optimization (2) 31.5 Transportation Problem (5) Answer Keys
32 Non GATE: Others (51)
32.1 3 Puzzle (1) 32.2 Alpha Beta Pruning (1) 32.3 Alpha Cut (1) 32.4 Application Software (1) 32.5 Bigdata Hadoop (1) 32.6 Convex Optimization (1) 32.7 Data Mining (2) 32.8 Data Warehousing (4) 32.9 Debugger (1) 32.10 Defuzzification (1) 32.11 Encryption Decryption (1) 32.12 Fuzzy Relation (1) 32.13 Fuzzy Sets (5) 32.14 Hill Climbing Search (1) 32.15 Inventory (1) 32.16 K Mean Clustering (1) 32.17 Linear Programming (1) 32.18 Llp (1) 32.19 Machine Learning (1) 32.20 Operational Research (2) 32.21 Searching (1) 32.22 Shell (1) 32.23 Shell Script (2) 32.24 Simplex Method (2) 32.25 System Software& Compilers (1) 32.26 Transportation Problem (1) 32.27 Unified Modeling Language (1) 32.28 Unix (5) 32.29 Windows (1) Answer Keys
33 Non GATE: Web Technologies (32)
33.1 Activex (1)
33.2 Client Server Application (1) 33.3 Data Warehousing (1) 33.4 E Commerce (1) 33.5 Edi Layers (2) 33.6 Html (5) 33.7 Javascript (2) 33.8 Transmission Media (1) 33.9 Trojan Horse (1) 33.10 Web Technologies (8) 33.11 Xml (7) 33.12 Xsl (1) Answer Keys
34 Operating System (227)
34.1 Applications In Windows (1) 34.2 Bankers Algorithm (1) 34.3 Binary Semaphore (1) 34.4 Context Switch (1) 34.5 Counting Semaphores (1) 34.6 Critical Section (1) 34.7 Deadlock (2) 34.8 Deadlock Prevention Avoidance Detection (6) 34.9 Delay (1) 34.10 Demand Paging (1) 34.11 Dijkstras Bankers Algorithm (1) 34.12 Directory Structure (1) 34.13 Disk Cpu Memory Interrupt (1) 34.14 Disk Scheduling (9) 34.15 Disks (7) 34.16 Distributed Computing (1) 34.17 Distributed System (1) 34.18 Dynamic Linking (1) 34.19 File System (7) 34.20 Fragmentation (1) 34.21 Hit Ratio (1) 34.22 Input Output (2) 34.23 Interrupts (2) 34.24 Io Handling (2) 34.25 Java (1) 34.26 Linux (1) 34.27 Lru (2) 34.28 Memory Management (8) 34.29 Mmu (1) 34.30 Monitors (1) 34.31 Multiprogramming Os (1) 34.32 Mutual Exclusion (1) 34.33 Os Protection (2) 34.34 Page Fault (6) 34.35 Page Replacement (5) 34.36 Paging (8) 34.37 Pipelining (1) 34.38 Process (2) 34.39 Process Model (2) 34.40 Process Scheduling (21) 34.41 Process Synchronization (2) 34.42 Ram (1) 34.43 Resource Allocation (3) 34.44 Runtime Environments (1) 34.45 Scheduling (4) 34.46 Seek Latency (1) 34.47 Semaphores (4)
35.46 Mis (1) 35.47 Mobile Communication (2) 35.48 Multiple Document Interface (1) 35.49 Natural Join (1) 35.50 Natural Language Processing (1) 35.51 Network Switching (1) 35.52 Neural Network (6) 35.53 Oops Concept (1) 35.54 Operator Overloading (1) 35.55 Pipelining (1) 35.56 Process Scheduling (2) 35.57 Prolog (1) 35.58 Quadratic Equations (1) 35.59 Queue (1) 35.60 Rdbms (2) 35.61 Relations (1) 35.62 Semantic Nets (1) 35.63 Shell (1) 35.64 Single Layer Perceptron (1) 35.65 Software Development Life Cycle Models (1) 35.66 Software Engineering Framework (1) 35.67 Software Testing (1) 35.68 Sql (4) 35.69 System Software Compilers (1) 35.70 Transaction And Concurrency (3) 35.71 Transportation Problem (3) 35.72 Trees (1) 35.73 Unix (4) 35.74 Virtual Memory (1) 35.75 Windows (4) 35.76 Windows Programming (2) Answer Keys
36 Programming and DS (30)
36.1 Array Of Pointers (1) 36.2 Arrays (3) 36.3 Dangling Pointers (1) 36.4 Data Types (1) 36.5 Dynamic Memory Allocation (1) 36.6 Input Output Statement (1) 36.7 Operator Precedence (2) 36.8 Operators (2) 36.9 Parameter Passing (1) 36.10 Pointer Declaration (1) 36.11 Programming In C (14) 36.12 Storage Classes In C (1) 36.13 Three Dimensional Array (1) Answer Keys
37 Programming and DS: DS (102)
37.1 Avl Tree (1) 37.2 B And Bplus Trees (1) 37.3 B Tree (1) 37.4 Bfs (1) 37.5 Binary Codes (1) 37.6 Binary Heap (1) 37.7 Binary Search Tree (5) 37.8 Binary Tree (8) 37.9 Cryptography (1) 37.10 Data Structures (6) 37.11 Graph Algorithms (1) 37.12 Graph Connectivity (1)
37.13 Graphs (1) 37.14 Hashing (10) 37.15 Heap (6) 37.16 Heap Sort (1) 37.17 Infix Prefix (1) 37.18 Linked Lists (3) 37.19 Max Heap (1) 37.20 Priority (1) 37.21 Priority Queue (2) 37.22 Queue (4) 37.23 Quicksort (1) 37.24 Radix Sort (2) 37.25 Recursion (1) 37.26 Relational Algebra (1) 37.27 Spanning Tree (2) 37.28 Stack (12) 37.29 Tree Traversal (1) 37.30 Trees (9) Answer Keys
38 Programming and DS: Programming (85)
38.1 Abstract Data Type (1) 38.2 Aliasing (1) 38.3 Arrays (2) 38.4 Binary Search Tree (1) 38.5 Bitwise Operation (1) 38.6 Data Types (2) 38.7 Evaluation Postfix (1) 38.8 Exception Handling (1) 38.9 Expression Evaluation (1) 38.10 File Handling (1) 38.11 Graphs (1) 38.12 Io Statement (1) 38.13 Java (4) 38.14 Linked Lists (1) 38.15 Loop (1) 38.16 Object Oriented Programming (3) 38.17 Operator Precedence (1) 38.18 Parameter Passing (1) 38.19 Pointers (2) 38.20 Programming In C (15) 38.21 Programming Paradigms (1) 38.22 Pseudocode (1) 38.23 Row Major Address Calculation (1) 38.24 Storage Classes In C (2) 38.25 Tree Traversal (1) 38.26 Undefined Behaviour (1) 38.27 Variable Binding (1) 38.28 Variable Scope (4) Answer Keys
39 Theory of Computation (139)
39.1 Cfg (1) 39.2 Chomsky Normal Form (1) 39.3 Closure Property (2) 39.4 Cnf (1) 39.5 Complement (1) 39.6 Context Free Grammars (7) 39.7 Context Free Languages (7) 39.8 Context Sensitive (2) 39.9 Decidability (4) 39.10 Expression (1)
User , Answers
- sanjay 1082,
- shekhar chauhan 677,
- Arjun Suresh 406,
- Leen Sharma 349,
- VIPIN NARAYAN 313,
- Prashant Singh 221,
- Rajarshi Sarkar 136,
- Mojo Jojo 127,
- Sachin Mittal 93,
- Sandeep_Uniyal 89,
- Muktinath Vishwakarma 87,
- papesh 82,
- Bikram 81,
- Debasmita Bhoumik 78,
- Akash Kanase 74,
- Rajesh Pradhan 72,
- jayendra 65,
- Amar Vashishth 63,
- Satbir Singh 59,
- Gate Keeda 56,
- shashi shekhar 53,
- RISHABH KUMAR 44,
- Dhananjay Kumar Sharma 41,
- Praveen Saini 36,
- srestha 35,
- asutosh kumar Biswal 32,
- Hira 32,
- Kapil Phulwani 31,
- Don't you worry 30,
- kunal chalotra 29,
- sumit kumar singh dixit 26,
- Sankaranarayanan P.N 26,
- Vicky rix 25,
- Ashwani Kumar 25,
- Prasanjeet Ghosh 25,
- Shaik Masthan 23,
- Shyam Singh 22,
- Sayan Bose 22,
- GO Editor User Added
- makhdoom ghaya
- Arjun Suresh
- RISHABH KUMAR
- Pooja Khatri
- soujanyareddy13
- sanjay
- Debasmita Bhoumik
- Kathleen Bankson
- sanjay User Done
- Arjun Suresh
- Sankaranarayanan P.N
- RISHABH KUMAR
- Prashant Singh
- VIPIN NARAYAN
- Leen Sharma
- srestha
- Debasmita Bhoumik
- sourav.
- Manoj Kumar
- shekhar chauhan
- Dhananjay Kumar Sharma
- Lakshman Patel
- Resmi Arjun
- papesh
- Bikram
- Abhishek
- asutosh kumar Biswal
- Kapil Phulwani
- Satbir Singh
- deepthi
- Tauhin Gangwar
- shahidhope
- soujanyareddy13
- Hira
- Desert_Warrior
- Aboveallplayer
- shivani Sharma
- Rajesh Pradhan
- Jeet Rajput
- kenzou
- Prajwal Bhat
- Rishabh Gupta
- im.raj
- Rishi yadav
- Praveen Saini
- Meenakshi Sharma
- Roma Nagpal
- Shobhit Joshi
- Ram Swaroop1
- Prabhanjan_1
- Shubham Pandey
- Debashish Deka
- Shaik Masthan
- Sayan Bose
- V Sharma
- nocturnal123
- Prasanjeet Ghosh
- Don't defeat anybody but yourself.
- Subham Mishra
- Muktinath Vishwakarma
- Pooja Palod
- Suvasish Dutta
- Arnabi Bej
- Akash Kanase
- Akhil Nadh PC
- saurabh rai
- Hradesh patel
- gatecse
- gshivam63
- Kuljeet Singh
- rio
- kunal chalotra
- Mk Utkarsh
- Milicevic3306
- sushmita
- Rohit kumar1
- DEVWRITT ARYA
- omveer
- SuShrut2311
1.0.1 https://gateoverflow.in/ A. B. C. D. 1.0.2 https://gateoverflow.in/ A. B. C. D. 1.0.3 https://gateoverflow.in/ 1.0.4 https://gateoverflow.in/
Algorithms (99)
UGCNET-Dec2004-II: 25 How much extra space is used by heapsort? ugcnetdec2004ii UGCNET-Oct2020-II: 73 Match with Choose the correct answer from the options given below: ugcnet-oct2020-ii algorithms UGCNET-Oct2020-II: 78 Consider the undirected graph below: Using Prim’s algorithm to construct a minimum spanning tree starting with node , which one of the following sequences of edges represents a possible order in which the edges would be added to construct the minimum spanning tree? A. B. C. D. ugcnet-oct2020-ii algorithms UGCNET-Oct2020-II: 90 Given below are two statements: Statement : A genetic algorithm is a stochastic hill-climbing search in which a large population of states is maintained Statement : In nondeterministic environments, agents can apply AND-OR search to generate contingent plans that reach the goal regardless of which outcomes occur during execution. In the light of the above statements, choose the correct answer from the options given below O ( 1 ) O (log n ) O ( n ) O ( n^2 )
List I List II
( A )
( B )
( C )
( D )
List I
Greedy Best-First Search
A ∗
Recursive Best-First Search
SMA*
( I )
( II )
( III )
( IV )
List II
Space complexity is O(d) where
d=depth of the deepest optimal
solution
Incomplete even if the search space is
finite
Optimal if optimal solution is
reachable; otherwise, returns the best
reachable optimal solution
Computation and space complexity
is too high
A − II , B − IV , C − I , D − III A − II , B − III , C − I , D − IV A − III , B − II , C − IV , D − I A − III , B − IV , C − II , D − I
a
( a , b ), ( a , h ), ( g , h ), ( f , g ), ( c , f ), ( c , i ), ( c , d ), ( d , e )
( a , b ), ( b , h ), ( g , h ), ( g , i ), ( c , i ), ( c , f ), ( c , d ), ( d , e )
( a , b ), ( b , c ), ( c , i ), ( c , f ), ( f , g ), ( g , h ), ( c , d ), ( d , e )
( a , b ), ( g , h ), ( g , f ), ( c , f ), ( c , i ), ( f , e ), ( b , c ), ( d , e )
I
II
A. B. C. D. 1.0.11 https://gateoverflow.in/ A. B. C. D. 1.0.12 https://gateoverflow.in/ 1.0.13 https://gateoverflow.in/ A. Logarithmic B. Linear C. Quadratic D. Exponential ugcnetjan2017iii algorithms UGCNET-Oct2020-II: 69 Match with With reference to CMM developed by Software Engineering Institute (SEI) Choose the correct answer from the options given below: ugcnet-oct2020-ii non-gate algorithms UGCNET-AUG2016-III: 36 Match the following : where is the set of nodes and is the set of edges in the graph. A. B. C. D. ugcnetaug2016iii algorithms UGCNET-July-2018-II: 30 Consider a Boolean function of 'n' variables. The order of an algorithm that determines whether the Boolean function produces a output 1 is ugcnetjuly2018ii algorithms
a.
b.
c.
d.
List-I
Merge sort
Huffman coding
Optimal polygon triangulation
Subset sum problem
i.
ii.
iii.
iv.
List-II
Dynamic programming
Greedy approach
Divide and conquer
Back tracking
Codes :
a-iii, b-i, c-ii, d-iv a-ii, b-i, c-iv, d-iii a-ii, b-i, c-iii, d-iv a-iii, b-ii, c-i, d-iv
List I List II
( A )
( B )
( C )
( D )
List I
Branch-and-bound
Steepest-accent hill climbing
Constraint satisfaction
Means-end-analysis
( I )
( II )
( III )
( IV )
List II
Keeps track of all partial paths
which can be candidate for
further exploration.
Defects difference between current
state and goal state
Discovers problem state(s) that satisfy
a set of constraints
Considers all moves from current state
and selects best move
A − I , B − IV , C − III , D − II A − I , B − II , C − III , D − IV A − II , B − I , C − III , D − IV A − II , B − IV , C − III , D − I
a.
b.
c.
d.
Prim’s algorithm
Bellman-Ford algorithm
Floyd-Warshall algorithm
Johnson’s algorithm
i.
ii.
iii.
iv.
O ( V^2 E )
O ( V ElgV )
O ( ElgV )
O ( V^3 )
V E
Codes :
a-i, b-iii, c-iv, d-ii
a-i, b-iii, c-ii, d-iv
a-iii, b-i, c-iv, d-ii
a-iii, b-i, c-ii, d-iv
1.0.14 https://gateoverflow.in/ A. B. C. D. 1.0.15 https://gateoverflow.in/ A. O(n) B. O(n Ig n) C. O(n ) D. None of the above 1. 1.1.1 https://gateoverflow.in/ A. B. C. or D. and 1. 1.2.1 https://gateoverflow.in/ A. Divide and conquer technique B. Greedy algorithm C. Back tracking D. Dynamic Programming 1. 1.3.1 https://gateoverflow.in/ A. Counting micro seconds B. Counting number of key operations C. Counting number of statements D. Counting kilobytes of algorithm 1. 1.4.1 https://gateoverflow.in/ A. Selection sort B. Bubble sort C. Radix sort D. Insertion sort 1. UGCNET-July-2018-II: 27 Match the following with respect to algorithm paradigms : ugcnetjuly2018ii algorithms UGCNET-Sep2013-III: 40 The time complexity of an efficient algorithm to find the longest monotonically increasing subsequence of n numbers is algorithms ugcnetsep2013iii Activity Selection Problem (1) Activity Selection Problem: UGCNET-Dec2015-III: 16 In Activity-Selection problem, each activity has a start time and a finish time where. Activities and are compatible if ugcnetdec2015iii algorithms activity-selection-problem Algorithm Design Techniques (1) Algorithm Design Techniques: UGCNET-Dec2006-II: 22 Binary search tree is an example of : ugcnetdec2006ii algorithms algorithm-design-techniques Algorithm Efficiency (1) Algorithm Efficiency: UGCNET-June2015-II: 25 To determine the efficiency of an algorithm the time factor is measured by ugcnetjune2015ii algorithm-efficiency Algorithms Sorting (1) Algorithms Sorting: UGCNET-June2015-II: 48 Which of the following algorithms sort integers, having the range to , in ascending order in time? ugcnetjune2015ii algorithms-sorting Arrays (2)
(a)
(b)
(c)
(d)
List-I
The 8-Queen's problem
Single-Source shortest paths
STRASSEN's Matrix multiplication
Optimal Binary search trees
(i)
(ii)
(iii)
(iv)
List-II
Dynamic programming
Divide and Conquer
Greedy approach
Back tracking
Code :
(a)-(iv), (b)-(i), (c)-(iii), (d)-(ii) (a)-(iv), (b)-(iii), (c)-(i), (d)-(ii) (a)-(iii), (b)-(iv), (c)-(ii), (d)-(i) (a)-(iv), (b)-(iii), (c)-(ii), (d)-(i) 2
i si fi si ≤ fi i j
si ≥ fj sj ≥ fi si ≥ fj sj ≥ fi si ≥ fj sj ≥ fi
n 0 ( n^2 − 1 ) O ( n )
