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
Answers by vg653
1
votes
1
NIELIT 2016 MAR Scientist C - Section C: 59
In C programming language, if the first and the second operands of operator $+$ are of types int and float, respectively, the result will be of type int float char long int
In C programming language, if the first and the second operands of operator $+$ are of types int and float, respectively, the result will be of type intfloatcharlong int
1.1k
views
answered
Apr 2, 2020
Programming in C
nielit2016mar-scientistc
programming-in-c
+
–
0
votes
2
NIELIT 2016 MAR Scientist B - Section C: 32
A linker is given object module for a set of programs that were compiled separately. What information need not be included in an object module? Object mode Relocation bits Names and locations of all external symbols defined in the object module. Absolute addresses of internal symbols.
A linker is given object module for a set of programs that were compiled separately. What information need not be included in an object module?Object modeRelocation bitsN...
1.1k
views
answered
Mar 31, 2020
Compiler Design
nielit2016mar-scientistb
compiler-design
linker
+
–
2
votes
3
NIELIT 2016 MAR Scientist B - Section C: 26
If $L_1$ and $L_2$ are context free language and $R$ a regular set, then which one of the languages below is not necessarily a context free language? $L_1L_2$ $L_1\cap L_2$ $L_1\cap R$ $L_1\cup L_2$
If $L_1$ and $L_2$ are context free language and $R$ a regular set, then which one of the languages below is not necessarily a context free language?$L_1L_2$$L_1\cap L_2$...
959
views
answered
Mar 31, 2020
Theory of Computation
nielit2016mar-scientistb
theory-of-computation
context-free-language
+
–
2
votes
4
NIELIT 2016 MAR Scientist B - Section C: 22
Time complexity of an algorithm $T(n)$, where $n$ is the input size is given by $\begin{array}{ll}T(n) & =T(n-1)+\frac{1}{n}, \text{ if }n>1\\ & =1, \text{ otherwise} \end{array}$ The order of this algorithm is $\log n$ $n$ $n^2$ $n^n$
Time complexity of an algorithm $T(n)$, where $n$ is the input size is given by$\begin{array}{ll}T(n) & =T(n-1)+\frac{1}{n}, \text{ if }n>1\\ & =1, \text{ otherwise} \en...
1.5k
views
answered
Mar 31, 2020
Algorithms
nielit2016mar-scientistb
algorithms
recurrence-relation
time-complexity
+
–
5
votes
5
NIELIT 2016 MAR Scientist B - Section C: 15
Output of the following loop is for(putchar('c');putchar ('a');putchar('r')) putchar('t'); a syntax error. cartrt. catrat. catratratratrat...
Output of the following loop isfor(putchar('c');putchar ('a');putchar('r')) putchar('t');a syntax error.cartrt.catrat.catratratratrat...
3.3k
views
answered
Mar 31, 2020
Programming in C
nielit2016mar-scientistb
programming-in-c
output
+
–
5
votes
6
NIELIT 2016 MAR Scientist B - Section C: 6
The result of the subtraction $FD_{16} - 88_{16}$ is $75_{16}$ $65_{16}$ $5E_{16}$ $10_{16}$
The result of the subtraction $FD_{16} - 88_{16}$ is$75_{16}$$65_{16}$$5E_{16}$$10_{16}$
1.8k
views
answered
Mar 31, 2020
Digital Logic
nielit2016mar-scientistb
digital-logic
number-system
+
–
0
votes
7
UGC NET CSE | December 2006 | Part 2 | Question: 21
Which algorithm has same average, worst case and best case time ? Binary search Maximum of n number Quick sort Fibonacci search
Which algorithm has same average, worst case and best case time ?Binary searchMaximum of n numberQuick sortFibonacci search
936
views
answered
Mar 29, 2020
Algorithms
algorithms
time-complexity
ugcnetcse-dec2006-paper2
+
–
0
votes
8
UGC NET CSE | June 2007 | Part 2 | Question: 8
How many $1$’s are present in the binary representation of $15\times 256+5\times 16+3$: $8$ $9$ $10$ $11$
How many $1$’s are present in the binary representation of $15\times 256+5\times 16+3$:$8$$9$$10$$11$
266
views
answered
Mar 29, 2020
Others
ugcnetcse-june2007-paper2
+
–
0
votes
9
self doubt
Given a TM, M accepts 100 strings. Is it decidable, semi decidable or fully undecidable??
Given a TM, M accepts 100 strings. Is it decidable, semi decidable or fully undecidable??
671
views
answered
Aug 13, 2019
Theory of Computation
decidability
theory-of-computation
turing-machine
+
–
1
votes
10
Reducibility Problem
Consider 2 problems X & Y. Now if X is reducible to Y.What does this mean.please explain with an example.
Consider 2 problems X & Y. Now if X is reducible to Y.What does this mean.please explain with an example.
517
views
answered
Aug 9, 2019
Theory of Computation
reducibilty
decidability
theory-of-computation
+
–
0
votes
11
Peter Linz Edition 5 Exercise 12.4 Question 5 (Page No. 321)
Let $L_1$ be a regular language and $G$ a context-free grammar. Show that the problem $“L_1 \subseteq L(G)”$ is undecidable.
Let $L_1$ be a regular language and $G$ a context-free grammar. Show that the problem $“L_1 \subseteq L(G)”$ is undecidable.
230
views
answered
Aug 9, 2019
Theory of Computation
peter-linz
peter-linz-edition5
theory-of-computation
decidability
proof
difficult
+
–
0
votes
12
Peter Linz Edition 4 Exercise 3.2 Question 10.b (Page No. 88)
What is the regular expression for this
What is the regular expression for this
963
views
answered
Mar 1, 2019
Theory of Computation
theory-of-computation
peter-linz
peter-linz-edition4
finite-automata
regular-language
regular-expression
+
–
0
votes
13
regular expression
Are both regular expression same .a*(ba*)* =(a+b)*ba(a+b)* if not then why????
Are both regular expression same .a*(ba*)* =(a+b)*ba(a+b)*if not then why????
264
views
answered
Dec 27, 2018
0
votes
14
#toc Reasoning for the answer
Let L1, L2, L3 be three languages $L_1 = {a^nb^nc^m | m, n >= 1}$ $L_2 = {a^nb^mc^m | m, n >= 1}$ $L_3 = {a^nb^nc^n | n >= 1}$ Choose the correct answer (A) $L_1 = L_1 \cap L_2$ (B) $L_1 $ and $L_2 $ are CFL but L_3 is regular (C) $L_1 and L_2$ are not CFL but L_3 is CFL (D) $L_1$ is subset of $L_3$
Let L1, L2, L3 be three languages$L_1 = {a^nb^nc^m | m, n >= 1}$$L_2 = {a^nb^mc^m | m, n >= 1}$$L_3 = {a^nb^nc^n | n >= 1}$Choose the correct answer(A) $L_1 = L_1 \cap L_...
499
views
answered
Dec 27, 2018
0
votes
15
Integration
If n is a positive integer, then $\int_{0}^{\pi} \frac{sin(2nx)}{sinx} dx$
If n is a positive integer, then $$\int_{0}^{\pi} \frac{sin(2nx)}{sinx} dx$$
303
views
answered
Dec 27, 2018
4
votes
16
Linked list
What does the following program do on two linked lists? Struct node *myFun (struct node * a, struct node * b) { Struct node *new = NULL ; If (a = = NULL) return (b) ; if (b = = NULL) return (a) ; If (a → data <= ... two linked lists by selecting the alternate nodes merges two sorted linked lists into final sorted linked list merges two linked lists by selecting the nodes in reverse.
What does the following program do on two linked lists? Struct node *myFun (struct node * a, struct node * b) { Struct node *new = NULL ; If (a = = NULL) return (b) ;...
1.2k
views
answered
Dec 27, 2018
DS
linked-list
data-structures
programming-in-c
+
–
Email or Username
Show
Hide
Password
I forgot my password
Remember
Log in
Register