Most viewed questions in Others

2 votes
0 answers
61
What is the possibility of rank/normalized cutoff for 2016?What are the possible written and interview questions?
1 votes
2 answers
62
0 votes
1 answer
63
All the classes necessary for windows programming are available in the module :win.txtwin.mainwin.stdMFC
1 votes
1 answer
65
Which one is the measure of software complexity ? Number of lines of code (LOC)Number of man yearsNumber of function points (FP)All of the above
5 votes
0 answers
66
In a hash table, both the keys and values are integers. We iterate over the key-value pairs of a hash table and print each of the pairs of values in the format key=a, val...
6 votes
1 answer
67
Why hasn't anyone got 90+ marks in the GATE-CS till now ?Is there any possibility to score more than 90+ marks in CS ?what are the ways to achieve it ,while other branch ...
1 votes
1 answer
68
Support of a fuzzy set $A= \big\{ \frac{x_1}{0.2}, \frac{x_2}{0.15}, \frac{x_3}{0.9}, \frac{x_4}{0.95}, \frac{x_5}{0.15} \big \}$ within a universal set X is given as$\bi...
1 votes
3 answers
71
1 votes
2 answers
73
Match the following $:$$\begin{array}{} \text{a.} & \text{Good Quality} & \text{i.} & \text{Program does not fail for a specified time } \\ &&& \text{in a given environm...
0 votes
1 answer
75
1 votes
1 answer
76
0 votes
1 answer
77
I find it difficult to read standard books. I understand the concepts by watching videos and solving GATE Questions. Should i jump to questions in standard books directly...
2 votes
2 answers
79
How to prepare for barc interview. Plz share your experience..
0 votes
2 answers
80
_________ is the class of decision problems that can be solved by non-deterministic polynomial algorithms.$\text{NP}$$\text{P}$HardComplete