GATE | GATE-CS-2009 | Question 12
Which of the following statement(s)is / are correct regarding Bellman-Ford shortest path algorithm? P: Always finds a negative weighted cycle, if one...Read More
Which of the following statement(s)is / are correct regarding Bellman-Ford shortest path algorithm? P: Always finds a negative weighted cycle, if one...Read More
S -> aSa|bSb|a|b; The language generated by the above grammar over the alphabet {a,b} is the set of (A) All palindromes (B) All odd length palindromes...Read More
The essential content(s) in each entry of a page table is / are (A) Virtual page number (B) Page frame number (C) Both virtual page number and page fr...Read More
In which one of the following page replacement policies, Belady’s anomaly may occur? (A) FIFO (B) Optimal (C) LRU (D) MRU Answer: (A) Explanation: Bel...Read More
Consider the binary relation R = {(x, y), (x, z), (z, x), (z, y)} on the set {x, y, z}. Which one of the following is TRUE? (A) R is symmetric but NOT...Read More
Which one of the following is TRUE for any simple connected undirected graph with more than 2 vertices? (A) No two vertices have the same degree. (B)...Read More
What is the chromatic number of an n-vertex simple connected graph which does not contain any odd length cycle? Assume n >= 2. (A)n-1 (B)3 (C)2 (D)...Read More
ECMAScript 2019, also known as ES10, introduced features like Array.flat(), Array.flatMap(), Object.fromEntries(), and Symbol. description, and some s...Read More
Consider a binary max-heap implemented using an array. Which one of the following array represents a binary max-heap? (A) 25,12,16,13,10,8,14 (B) 25,1...Read More
Consider the following relational schema: Suppliers(sid:integer, sname:string, city:string, street:string) Parts(pid:integer, pname:string, color:stri...Read More