Login
Register
@
Dark Mode
Profile
Edit my Profile
Messages
My favorites
Register
Activity
Q&A
Questions
Unanswered
Tags
Subjects
Users
Ask
Previous Years
Blogs
New Blog
Exams
Dark Mode
Filter
User Prasanjeet Ghosh
Wall
Recent activity
All questions
All answers
Exams Taken
All Blogs
Answers by Prasanjeet Ghosh
9
votes
1
GATE IT 2004 | Question: 11, ISRO2011-33
What is the bit rate of a video terminal unit with $80$ characters/line, $8$ $\text{bits/character}$ and horizontal sweep time of $100$ $\text{µs}$ (including $20$ $\text{µs}$ of retrace time)? $8$ $\text{Mbps}$ $6.4$ $\text{Mbps}$ $0.8$ $\text{Mbps}$ $0.64$ $\text{Mbps}$
answered
in
Operating System
Jul 22, 2018
6.3k
views
gateit-2004
operating-system
io-handling
easy
isro2011
0
votes
2
Uttrakhand Asst. Professor Exam-82
In C programming language, which of the following operators has the highest precedence? unary + * >= ==
answered
in
Unknown Category
Jul 16, 2018
686
views
uttarakhand-asst-prof-2018
programming-in-c
0
votes
3
Uttrakhand Asst. Professor Exam-34
Which of the following is not considered in Booth's algorithm for multiplication? Positive multiplier and positive multiplicand Negative multiplier and negative multiplicand Positive multiplier and negative multiplicand All of the above
answered
in
Unknown Category
Jul 16, 2018
147
views
uttarakhand-asst-prof-2018
0
votes
4
Uttrakhand Asst. Professor Exam-32
In the size of memory of 4K words and each word id of 8 bits, what is the size of the address bus? 256 12 3 32
answered
in
Unknown Category
Jul 16, 2018
107
views
uttarakhand-asst-prof-2018
0
votes
5
UGC NET CSE | December 2015 | Part 2 | Question: 43
Which of the following statements is false? Top-down parsers are LL parsers where first L stands for left-to-right scan and second L stands for a leftmost derivation (000)* is a regular expression that matches only strings containing an odd number ... is any context-free language, then the language $L^R =\{w^R: w \varepsilon L\}$ is context-free
answered
in
Compiler Design
Jul 6, 2018
1.8k
views
ugcnetcse-dec2015-paper2
compiler-design
parsing
0
votes
6
UGC NET CSE | December 2012 | Part 2 | Question: 3
The GSM network is divided into the following three major systems: SS, BSS, OSS BSS, BSC, MSC CELL, BSS, OSS SS, CELL, MSC
answered
in
Computer Networks
Jul 3, 2018
3.6k
views
ugcnetcse-dec2012-paper2
computer-networks
communication
mobile-communication
0
votes
7
UGC NET CSE | June 2016 | Part 3 | Question: 39
Which of the following statements is correct? Aggregation is a strong type of association between two classes with full ownership Aggregation is a strong type of association between two classes with partial ownership Aggregation is ... two classes with partial ownership Aggregation is a weak type of association between two classes with full ownership
answered
in
Databases
Jul 2, 2018
1.9k
views
ugcnetcse-june2016-paper3
databases
aggregation
0
votes
8
UGC NET CSE | June 2016 | Part 3 | Question: 41
Which of the following statements is not correct? HTML is not screen precise formatting language HTML does not specify a logic DHTML is used to developing highly interacting webpages HTML is a programming language
answered
in
Web Technologies
Jul 2, 2018
1.7k
views
ugcnetcse-june2016-paper3
html
web-technologies
0
votes
9
UGC NET CSE | June 2016 | Part 3 | Question: 44
Match the software maintenance activities in List-I to its meaning in List-II. ... $\text{a-iv, b-ii, c-i, d-iii}$ $\text{a-i, b-iii, c-iv, d-ii}$
answered
in
IS&Software Engineering
Jul 2, 2018
1.7k
views
ugcnetcse-june2016-paper3
is&software-engineering
0
votes
10
UGC NET CSE | June 2016 | Part 3 | Question: 57
Given a Turing Machine $M=(\{q_0, q_1, q_2, q_3\}, \{a,b\}, \{a, b, B\}, \delta, B, \{q_3\})$ where $\delta$ is a atransaction function defined as $\delta(q_0,a)=(q_1, a, R)$ $\delta(q_1, b)=(q_2, b, R)$ $\delta(q_2, a)=(q_2, a, R)$ $\delta(q_2,b)=(q_3, b, R)$ The language L(M) accepted by the Turing machine is given as: aa*b abab aba*b aba*
answered
in
Theory of Computation
Jul 2, 2018
7.6k
views
ugcnetcse-june2016-paper3
theory-of-computation
turing-machine
1
vote
11
UGC NET CSE | June 2016 | Part 3 | Question: 59
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? $2$ bits per symbol $1.75$ bits per symbol $1.50$ bits per symbol $1.25$ bits per symbol
answered
in
Algorithms
Jul 2, 2018
3.8k
views
ugcnetcse-june2016-paper3
algorithms
huffman-code
probability
1
vote
12
UGC NET CSE | June 2016 | Part 3 | Question: 64
Let R and S be two fuzzy relations defined as R= $y_1$ $y_2$ $x_1$ $\begin{bmatrix} 0.7 & 0.5 \\ 0.8 & 0.4 \end{bmatrix}$ $x_2$ and S= $z_1$ $z_2$ $z_3$ $y_1$ ... $z_1$ $z_2$ $z_3$ $x_1$ $\begin{bmatrix} 0.7 & 0.6 & 0.5 \\ 0.8 & 0.8 & 0.8 \end{bmatrix}$ $x_2$
answered
in
Others
Jul 2, 2018
5.7k
views
ugcnetcse-june2016-paper3
fuzzy-set
fuzzy-relation
0
votes
13
UGC NET CSE | June 2016 | Part 2 | Question: 42
The ____ model is preferred for software development when the requirements are not clear. Rapid Application Development Rational Unified Process Evolutionary Model Waterfall Model
answered
in
IS&Software Engineering
Jul 2, 2018
9.0k
views
ugcnetcse-june2016-paper2
is&software-engineering
software-development-life-cycle-models
1
vote
14
UGC NET CSE | June 2016 | Part 2 | Question: 38
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 320 322 321 319
answered
in
Operating System
Jul 2, 2018
16.4k
views
ugcnetcse-june2016-paper2
operating-system
disk-scheduling
0
votes
15
UGC NET CSE | June 2016 | Part 2 | Question: 35
Which of the following is false? The grammar $S \rightarrow a \: Sb \mid bSa \mid SS \mid \in$, where $S$ is the only non-terminal symbol and $\in$ is the null string, is ambiguous SLR is powerful than LALR An LL(1) parser is a top-down parser YACC tool is an LALR(1) parser generator
answered
in
Compiler Design
Jul 2, 2018
1.7k
views
ugcnetcse-june2016-paper2
compiler-design
parsing
0
votes
16
UGC NET CSE | June 2016 | Part 2 | Question: 27
In a fully connected mesh network with 10 computers, total ___ number of cables are required and ____ number od ports are required for each device 40, 9 45, 10 45, 9 50, 10
answered
in
Computer Networks
Jul 1, 2018
16.4k
views
ugcnetcse-june2016-paper2
computer-networks
mesh-topology
1
vote
17
UGC NET CSE | June 2016 | Part 2 | Question: 25
In how many ways can the string $A \cap B - A \cap B -A$ be fully paranthesized to yield an infix expression? 15 14 13 12
answered
in
Combinatory
Jul 1, 2018
5.8k
views
ugcnetcse-june2016-paper2
parenthesization
combinatory
0
votes
18
UGC NET CSE | June 2016 | Part 2 | Question: 9
The simplified form of the Boolean equation $(A\bar{B}+A\bar{B}+AC)(\bar{A}\bar{C}+\bar{B})$ is $A\bar{B}$ $A\bar{B}C$ $\bar{A}B$ $ABC$
answered
in
Digital Logic
Jul 1, 2018
3.7k
views
ugcnetcse-june2016-paper2
digital-logic
0
votes
19
UGC NET CSE | June 2016 | Part 2 | Question: 4
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? 3/4 2/3 1/2 1/3
answered
in
Probability
Jul 1, 2018
2.3k
views
ugcnetcse-june2016-paper2
engineering-mathematics
probability
2
votes
20
UGC NET CSE | Junet 2015 | Part 3 | Question: 64
Given the symbols A, B, C, D, E, F, G and H with the probabilities$\frac{1}{30}, \frac{1}{30}, \frac{1}{30}, \frac{2}{30}, \frac{3}{30}, \frac{5}{30}, \frac{5}{30}$ and $\frac{12}{30}$respectively. The average Huffman code size in bits per symbol is $\frac{67}{30}$ $\frac{70}{34}$ $\frac{76}{30}$ $\frac{78}{30}$
answered
in
Algorithms
Jun 27, 2018
4.9k
views
ugcnetcse-june2015-paper3
algorithms
greedy-algorithms
huffman-code
0
votes
21
UGC NET CSE | Junet 2015 | Part 3 | Question: 72
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 {(2, 0.6), (3, 0.3), (6, 1), (11, 0.3)} {(2, 0.6), (3, ... (11, 0.3)} {(2, 0.6), (3, 1), (6, 0.6), (11, 0.3)} {(2, 0.6), (3, 0.3), (6, 0.6), (11, 0.3)}
answered
in
Others
Jun 27, 2018
6.2k
views
ugcnetcse-june2015-paper3
fuzzy-set
neural-network
0
votes
22
UGC NET CSE | Junet 2015 | Part 2 | Question: 48
Which of the following algorithms sort $n$ integers, having the range $0$ to $(n^2 -1)$, in ascending order in $O(n)$ time? Selection sort Bubble sort Radix sort Insertion sort
answered
in
Algorithms
Jun 25, 2018
3.2k
views
ugcnetcse-june2015-paper2
algorithms-sorting
0
votes
23
UGC NET CSE | Junet 2015 | Part 2 | Question: 47
Which of the following statements is incorrect for Parallel Virtual Machine (PVM)? The PVM communication model provides asynchronous blocking send, asynchronous blocking receive, amd non-blocking receive function Message buffers are allocated dynamically ... to the size or number of such messages In PVM model, the message order is not preserved
answered
in
Distributed Computing
Jun 25, 2018
1.4k
views
ugcnetcse-june2015-paper2
distributed-computing
parallel-virtual-machine
1
vote
24
UGC NET CSE | Junet 2015 | Part 2 | Question: 38
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? $6$ $7$ $5$ $8$
answered
in
Operating System
Jun 25, 2018
8.8k
views
ugcnetcse-june2015-paper2
operating-system
page-replacement
5
votes
25
UGC NET CSE | Junet 2015 | Part 2 | Question: 37
Let $P-i$ and $P_j$ 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 $p_i$ and $P_j$ which of the conditions are not true? $R(P_i) \cap W(P_j) = \Phi$ $W(P_i) \cap R(P_j) = \Phi$ $R(P_i) \cap R(P_j) = \Phi$ $W(P_i) \cap W(P_j) = \Phi$
answered
in
Operating System
Jun 25, 2018
2.5k
views
ugcnetcse-june2015-paper2
transaction-and-concurrency
0
votes
26
UGC NET CSE | Junet 2015 | Part 2 | Question: 36
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$ ... seek time is needed for shortest seek time first (SSTF) algorithm? $0.984$ sec $0.396$ sec $0.738$ sec $0.42$ sec
answered
in
Operating System
Jun 25, 2018
8.8k
views
ugcnetcse-june2015-paper2
operating-system
disk-scheduling
0
votes
27
UGC NET CSE | Junet 2015 | Part 2 | Question: 12
Which of the following, in C++, is inherited in a derived class from base class? constructor destructor data members virtual methods
answered
in
Object Oriented Programming
Jun 25, 2018
4.9k
views
ugcnetcse-june2015-paper2
oops
inheritance
1
vote
28
UGC NET CSE | Junet 2015 | Part 2 | Question: 11
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 ... of S is 1000 */ } $\text{ABCDEFGH}1000$ $\text{CDEFGH}1000$ $\text{DDEFGHH}1000$ $\text{DEFGH}1000$
answered
in
Programming
Jun 25, 2018
2.1k
views
ugcnetcse-june2015-paper2
programming-in-c
array
0
votes
29
UGC NET CSE | Junet 2015 | Part 2 | Question: 7
Consider a full-adder with the following input values : $x=1, y=0$ and $C_i$(carry input)$=0$ $x=0, y=1$ and $C_i =1$ Compute the value of S(sum) and $C_o$ (carry output) for the above input values : $S=1, C_o=0$ and $S=0, C_o=1$ $S=0, C_o=0$ and $S=1, C_o=1$ $S=1, C_o=1$ and $S=0, C_o=0$ $S=0, C_o=1$ and $S=1, C_o=0$
answered
in
Digital Logic
Jun 25, 2018
2.5k
views
ugcnetcse-june2015-paper2
digital-logic
full-adder
1
vote
30
UGC NET CSE | December 2014 | Part 3 | Question: 57
The resolvent of the set of clauses $(A \vee B, \sim A \vee D, C \vee \sim B)$ is $A \vee​ B$ $C \vee​ D$ $A \vee​ C$ $A \vee​ D$
answered
in
Mathematical Logic
Jun 16, 2018
3.8k
views
ugcnetcse-dec2014-paper3
mathematical-logic
Page:
1
2
3
4
5
next »
Subscribe to GATE CSE 2023 Test Series
Subscribe to GO Classes for GATE CSE 2023
Quick search syntax
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
Recent Posts
Recruitment of Scientific Officers in the Department of Atomic Energy 2023
GATE CSE 2023 Paper & Analysis - Memory Based
From GATE to Australia
DRDO Previous Year Papers
From Rank 4200 to 64: My Journey to Success in GATE CSE Exam
Subjects
All categories
General Aptitude
(2.5k)
Engineering Mathematics
(9.3k)
Digital Logic
(3.3k)
Programming and DS
(5.9k)
Algorithms
(4.6k)
Theory of Computation
(6.7k)
Compiler Design
(2.3k)
Operating System
(5.0k)
Databases
(4.6k)
CO and Architecture
(3.8k)
Computer Networks
(4.6k)
Non GATE
(1.3k)
Others
(2.4k)
Admissions
(649)
Exam Queries
(842)
Tier 1 Placement Questions
(17)
Job Queries
(75)
Projects
(9)
Unknown Category
(853)
Recent Blog Comments
1200/1000 = 1.2
Aptitude- 1- there was a question, Like in a...
Suppose typing happens at 1 keystroke per second....
The algorithm for graph colouring was to pick...
@Aakash_Bhardwaj all the best bro . For your...