Login
Register
Dark Mode
Brightness
Profile
Edit Profile
Messages
My favorites
My Updates
Logout
Filter
Profile
Wall
Recent activity
All questions
All answers
Exams Taken
All Blogs
Recent activity by 33
1
answer
1
UGC NET CSE | June 2005 | Part 2 | Question: 14
If a data-item is declared as a protected access specifier then it can be accessed : Anywhere in the program By the base and derived classes Only by base class Only by derived class
If a data-item is declared as a protected access specifier then it can be accessed : Anywhere in the programBy the base and derived classesOnly by base classOnly by deriv...
583
views
answered
Mar 16, 2022
Others
ugcnetcse-june2005-paper2
+
–
3
answers
2
UGC NET CSE | December 2004 | Part 2 | Question: 49
A data warehouse is always _________. Subject oriented Object oriented Program oriented Compiler oriented
A data warehouse is always _________.Subject orientedObject orientedProgram orientedCompiler oriented
1.1k
views
answered
Mar 15, 2022
Data Mining and Warehousing
ugcnetcse-dec2004-paper2
+
–
3
answers
3
UGC NET CSE | December 2004 | Part 2 | Question: 41
The main objective of designing various modules of a software system is : To decrease the cohesion and to increase the coupling To increase the cohesion and to decrease the coupling To increase the coupling only To increase the cohesion only
The main objective of designing various modules of a software system is :To decrease the cohesion and to increase the couplingTo increase the cohesion and to decrease the...
1.1k
views
answered
Mar 15, 2022
IS&Software Engineering
ugcnetcse-dec2004-paper2
+
–
3
answers
4
NIELIT 2016 MAR Scientist B - Section C: 35
The file structure that redefines its first record at a base of zero uses the term relative organization. key fielding. dynamic reallocation. all of these.
The file structure that redefines its first record at a base of zero uses the termrelative organization.key fielding.dynamic reallocation.all of these.
948
views
answered
Mar 15, 2022
Operating System
nielit2016mar-scientistb
operating-system
file-system
file-organization
+
–
3
answers
5
NIELIT 2016 MAR Scientist B - Section B: 16
A box contains $10$ screws, $3$ of which are defective. Two screws are drawn at random with replacement. The probability that none of two screws is defective will be $100\%$ $50\%$ $49\%$ None of these.
A box contains $10$ screws, $3$ of which are defective. Two screws are drawn at random with replacement. The probability that none of two screws is defective will be$100\...
1.1k
views
answered
Mar 15, 2022
Probability
nielit2016mar-scientistb
engineering-mathematics
probability
+
–
1
answer
6
NIELIT 2016 MAR Scientist B - Section B: 7
In which of the following methods proper choice of initial value is very important? Bisection method False position Newton-Raphson Bairsto method
In which of the following methods proper choice of initial value is very important?Bisection methodFalse positionNewton-RaphsonBairsto method
1.9k
views
answered
Mar 15, 2022
Numerical Methods
nielit2016mar-scientistb
non-gate
numerical-methods
+
–
2
answers
7
NIELIT 2016 MAR Scientist B - Section C: 25
Regarding power of recognition of language, which of the following statements is false? Non deterministic finite-state automata are equivalent to deterministic finite-state automata. Non-deterministic push-down automata are equivalent to ... to deterministic push-down automata. Multi-tape Turing Machines are equivalent to Single-tape Turing Machines.
Regarding power of recognition of language, which of the following statements is false?Non deterministic finite-state automata are equivalent to deterministic finite-stat...
1.3k
views
answered
Mar 15, 2022
Theory of Computation
nielit2016mar-scientistb
theory-of-computation
identify-class-language
+
–
2
answers
8
NIELIT 2021 Dec Scientist A - Section B: 48
The addressing mode/s, which uses the $\text{PC}$ instead of a general-purpose register is : Indexed with offset Relative Direct Both Indexed with offset and direct
The addressing mode/s, which uses the $\text{PC}$ instead of a general-purpose register is :Indexed with offsetRelativeDirectBoth Indexed with offset and direct
432
views
answered
Mar 15, 2022
Others
nielit2021dec-scientista
+
–
1
answer
9
does the job scheduler only select the process or bring the process from new state to ready state?
does the job scheduler only select the process or bring the process from new state to ready state
does the job scheduler only select the process or bring the process from new state to ready state
628
views
commented
Mar 15, 2022
2
answers
10
NIELIT 2017 DEC Scientist B - Section B: 57
Which machine is equally powerful in both deterministic and non-deterministic form? Push Down Automata Turing machine Linear Bounded Automata None of the options
Which machine is equally powerful in both deterministic and non-deterministic form?Push Down AutomataTuring machineLinear Bounded AutomataNone of the options
1.7k
views
commented
Mar 14, 2022
Theory of Computation
nielit2017dec-scientistb
pushdown-automata
turing-machine
+
–
1
answer
11
NIELIT 2021 Dec Scientist B - Section B: 67
The channel capacity of a noise free channel having $\text{M}$ symbols is given by : $\text{M}$ $2^{\text{M}}$ $\log \text{M}$ None of these
The channel capacity of a noise free channel having $\text{M}$ symbols is given by :$\text{M}$$2^{\text{M}}$$\log \text{M}$None of these
542
views
answered
Mar 13, 2022
Others
nielit2021dec-scientistb
+
–
1
answer
12
NIELIT 2021 Dec Scientist B - Section B: 61
If developer wants to transform model into source code is also known as _____________ . Backward Testing / Engineering Forward Engineering Forward Testing Reverse Engineering
If developer wants to transform model into source code is also known as _____________ .Backward Testing / Engineering Forward EngineeringForward Testing Reverse Engineeri...
545
views
answered
Mar 13, 2022
Others
nielit2021dec-scientistb
+
–
2
answers
13
NIELIT 2021 Dec Scientist B - Section B: 53
The ____________ enables the software engineer to develop models of the information domain and functional domain at the same time. data flow diagram state transition diagram control specification activity diagram
The ____________ enables the software engineer to develop models of the information domain and functional domain at the same time.data flow diagramstate transition diagra...
483
views
answer edited
Mar 13, 2022
Others
nielit2021dec-scientistb
+
–
1
answer
14
NIELIT 2021 Dec Scientist B - Section B: 49
Let $\text{P}(x)$ be $x$ is perfect , $\text{F}(x)$ be $x$ is your friend and the domain be all people. The statement, At least one of your friends is perfect is : $ \forall x \; \text{(F}(x) \rightarrow \text{P}(x)) $ ... $ \exists x \; \text{(F}(x) \land \text{P}(x)) $ $ \exists x \; \text{(F}(x) \rightarrow \text{P}(x)) $
Let $\text{P}(x)$ be “$x$ is perfect”, $\text{F}(x)$ be “$x$ is your friend” and the domain be all people. The statement, “At least one of your friends is perfe...
495
views
answered
Mar 13, 2022
Others
nielit2021dec-scientistb
+
–
2
answers
15
Interview call in 3rd year
I am currently in my 3rd year and I gave GATE thorough EE. I wish to pursue Mtech in AI from IISC. If I get a good score/rank this is year will I be called for interview/written test process by IISc? If not can I apply in 2023 through my gate score of 2022?
I am currently in my 3rd year and I gave GATE thorough EE. I wish to pursue Mtech in AI from IISC. If I get a good score/rank this is year will I be called for interview/...
587
views
commented
Mar 13, 2022
1
answer
16
Cormen Edition 3 Exercise 22.1 Question 3 (Page No. 592)
The transpose of a directed graph $G=(V,E)$ is the graph $G^T=(V,E^T)$, where $E^T=\{(v,u) \in V * V :(u,v) \in E \ \}$ .Thus ,$G^T$ is $G$ with all its edges reversed . Describe ... algorithms for computing $G^T$ from $G$,for both the adjacency list and adjacency matrix representations of $G$. Analyze the running times of your algorithms.
The transpose of a directed graph $G=(V,E)$ is the graph $G^T=(V,E^T)$, where $E^T=\{(v,u) \in V * V :(u,v) \in E \ \}$ .Thus ,$G^T$ is $G$ with all its edges reversed . ...
4.4k
views
answered
Mar 13, 2022
Algorithms
cormen
algorithms
graph-algorithms
descriptive
+
–
1
answer
17
Please solve this question
Determine the minimum bandwidth, baud, and bandwidth efficiency for the following bit rates and modulation schemes-BPSK, QPSK, 8-PSK, and 16-PSK.where fb = 2400 bps
Determine the minimum bandwidth, baud, and bandwidth efficiency for the following bit rates and modulation schemes-BPSK, QPSK, 8-PSK, and 16-PSK.where fb = 2400 bps
510
views
answered
Mar 12, 2022
Computer Networks
data-communication
computer-networks
+
–
1
answer
18
NIELIT 2021 Dec Scientist B - Section B: 76
In a paging scheme if page size is of $2048 \; \text{bytes},$ then while accommodating a process of $72,766 \; \text{bytes},$ how much internal fragmentation occurs $?$ $962 \; \text{bytes}$ $2048 \; \text{bytes}$ $1024 \; \text{bytes}$ $1086 \; \text{bytes}$
In a paging scheme if page size is of $2048 \; \text{bytes},$ then while accommodating a process of $72,766 \; \text{bytes},$ how much internal fragmentation occurs $?$$9...
1.1k
views
answered
Mar 12, 2022
Others
nielit2021dec-scientistb
+
–
1
answer
19
NIELIT 2021 Dec Scientist B - Section B: 79
A protected variable which can be accessed and changed by particular set of operation is called $:$ interrupt monitor semaphore $\text{IPC}$
A protected variable which can be accessed and changed by particular set of operation is called $:$interrupt monitorsemaphore$\text{IPC}$
490
views
answered
Mar 12, 2022
Others
nielit2021dec-scientistb
+
–
1
answer
20
NIELIT 2021 Dec Scientist B - Section B: 84
$\text{TCP/IP}$ model does not have ____________ layer but $\text{OSI}$ model have this layer. session layer transport layer application layer network layer
$\text{TCP/IP}$ model does not have ____________ layer but $\text{OSI}$ model have this layer.session layertransport layerapplication layernetwork layer
333
views
answered
Mar 12, 2022
Others
nielit2021dec-scientistb
+
–
2
answers
21
UGC NET CSE | November 2017 | Part 3 | Question: 73
Consider the following statements: UNIX provides three types of permissions Read Write Execute UNIX provides three sets of permissions permission for owner permission for group permission for others Which of the above statement/s is/are true? Only (i) Only (ii) Both (i) and (ii) Neither (i) nor (ii)
Consider the following statements:UNIX provides three types of permissionsReadWriteExecuteUNIX provides three sets of permissionspermission for ownerpermission for groupp...
592
views
answered
Mar 10, 2022
Unknown Category
ugcnetcse-nov2017-paper3
+
–
1
answer
22
Nptel Assignment Question
How long does the receiver wait before it sends a delayed acknowledgement for receiving few more packets. ? RTT 2*RTT 250 ms 500 ms
How long does the receiver wait before it sends a delayed acknowledgement for receiving few more packets. ? RTT2*RTT250 ms500 ms
293
views
answered
Mar 10, 2022
Computer Networks
nptel-quiz
+
–
2
answers
23
Morris Mano Edition 3 Exercise 1 Question 18 (Page No. 34)
Perform the arithmetic operations (+42) + (-13) and (-42) – (-13) using binary signed 2’s complement representation for the negative numbers.
Perform the arithmetic operations (+42) + (-13) and (-42) – (-13) using binary signed 2’s complement representation for the negative numbers.
8.9k
views
answered
Mar 10, 2022
Digital Logic
digital-logic
morris-mano
number-representation
+
–
1
answer
24
NPTEL Assignment Question
Natural language constructs are (A) Unambiguous (B) Ambiguous (C) May be unambiguous or ambiguous (D) None of the other options
Natural language constructs are(A) Unambiguous (B) Ambiguous (C) May be unambiguous or ambiguous (D) None of the other options
827
views
answered
Mar 9, 2022
Compiler Design
compiler-design
nptel-quiz
ambiguous-grammar
+
–
1
answer
25
NPTEL Assignment Question
In an array A[1..n] of n distinct elements, if i < j and A[i] > A[j], then the pair (i,j) is called an inversion of A. How many inversions are there in the array A = {n,n-1,n-2,...,3,2,1}? n(n-1) / 2 n(n+1) / 2 2n(n+1) None
In an array A[1..n] of n distinct elements, if i < j and A[i] A[j], then the pair (i,j) is called an inversion of A.How many inversions are there in the array A = {n,n-1...
333
views
answered
Mar 9, 2022
Algorithms
nptel-quiz
sorting
inversion
+
–
1
answer
26
NPTEL Assignment Question
The number of possible subsequences in a string of length n are: $n^{2}$ $2^{n}$ n! n(n-1)
The number of possible subsequences in a string of length n are:$n^{2}$$2^{n}$ n!n(n-1)
349
views
answered
Mar 9, 2022
Combinatory
nptel-quiz
combinatory
counting
normal
+
–
1
answer
27
NPTEL Assignment Question
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 statem...
610
views
answered
Mar 9, 2022
Algorithms
nptel-quiz
graph-algorithms
minimum-spanning-tree
shortest-path
+
–
1
answer
28
NPTEL Assignment Question
Suppose we want to extend the union-find data structure to support the operation Reset(c), which takes as input the name of a component c and then breaks up c into singleton components, like MakeUnionFind(). For instance if c = 3 and c currently ... representation: O(n), Pointer representation: O(size(c)) Array representation: O(size(c)), Pointer representation: O(size(c))
Suppose we want to extend the union-find data structure to support the operation Reset(c), which takes as input the name of a component c and then breaks up c into single...
1.3k
views
answered
Mar 9, 2022
Algorithms
algorithms
array
time-complexity
nptel-quiz
+
–
1
answer
29
NPTEL Assignment Question
Consider the following strategy to solve the single source shortest path problem with edge weights from source s. 1. Replace each edge with weight w by w edges of weight 1 connected by new intermediate nodes 2. Run BFS(s) on the modified graph to ... ;s algorithm.s st This strategy will not solve the problem correctly. This strategy will only work if the graph is acyclic.
Consider the following strategy to solve the single source shortest path problem with edge weights from source s.1. Replace each edge with weight w by w edges of weight 1...
1.3k
views
answered
Mar 9, 2022
Algorithms
nptel-quiz
shortest-path
graph-search
graph-algorithms
+
–
3
answers
30
NPTEL Assignment Question
Suppose there are k sorted lists (decreasing order) with n/k elements in each list. What is the time complexity to merge them into one single sorted list. Hint: Maintain a heap of k elements. Think which k elements to choose. A. O(nlogk) B. O(n) C. O(nk) D. O(nlogn)
Suppose there are k sorted lists (decreasing order) with n/k elements in each list.What is the time complexity to merge them into one single sorted list.Hint: Maintain a ...
728
views
answered
Mar 8, 2022
Algorithms
algorithms
nptel-quiz
sorting
time-complexity
+
–
Email or Username
Show
Hide
Password
I forgot my password
Remember
Log in
Register