Recent activity by Nurzamal Islam / GATE Overflow for GATE CSE

2 answers

1

UGC NET CSE | June 2016 | Part 3 | Question: 3
Which of the following in 8085 microprocessor performs HL=HL+DE ? DAD D DAD H DAD B DAD SP

Which of the following in 8085 microprocessor performs HL=HL+DE ?DAD DDAD HDAD BDAD SP

3.0k views

answered Oct 8, 2018

3 answers

2

UGC NET CSE | December 2014 | Part 3 | Question: 56
An $A^{*}$ algorithm is a heuristic search technique which Is like a depth-first search where most promising child is selected for expansion Generates all successor nodes and computes an estimate of distance (cost) from start node ... (costs) from start node to all generated nodes and chooses shortest path for further expansion. None of the above

An $A^{*}$ algorithm is a heuristic search technique whichIs like a depth-first search where most promising child is selected for expansion Generates all successor nodes ...

2.8k views

answered Sep 20, 2018

4 answers

3

UGC NET CSE | July 2018 | Part 2 | Question: 17
A software design pattern often used to restrict access to an object is adapter decorator delegation proxy

A software design pattern often used to restrict access to an object isadapterdecoratordelegationproxy

1.6k views

answered Sep 19, 2018

5 answers

4

GATE CSE 2014 Set 1 | Question: 31
An operating system uses the Banker's algorithm for deadlock avoidance when managing the allocation of three resource types $X, Y,$ and $Z$ to three processes $P0, P1,$ and $P2.$ The table given below presents the current system state. ... be permitted. Only REQ2 can be permitted. Both REQ1 and REQ2 can be permitted. Neither REQ1 nor REQ2 can be permitted.

An operating system uses the Banker's algorithm for deadlock avoidance when managing the allocation of three resource types $X, Y,$ and $Z$ to three processes $P0, P1,$ a...

22.7k views

commented Jan 21, 2018

8 answers

5

GATE CSE 2016 Set 1 | Question: 14
Let $G$ be a weighted connected undirected graph with distinct positive edge weights. If every edge weight is increased by the same value, then which of the following statements is/are TRUE? $P$: Minimum spanning tree of $G$ does not change. $Q$: Shortest path between any pair of vertices does not change. $P$ only $Q$ only Neither $P$ nor $Q$ Both $P$ and $Q$

Let $G$ be a weighted connected undirected graph with distinct positive edge weights. If every edge weight is increased by the same value, then which of the following sta...

22.8k views

commented Jan 18, 2018

tags	tag:apple
author	user:martin
title	title:apple
content	content:apple
exclude	-tag:apple
force match	+apple
views	views:100
score	score:10
answers	answers:2
is accepted	isaccepted:true
is closed	isclosed:true