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 Anjali_aspirant
2
answers
1
char output in c. Predict the output of following C programs
Predict the output of following C programs 1. #include int main() { char a = '\012'; printf("%d", a); return 0; } 2. #include int main() { char a = '012'; printf("%d", a); return 0; } 3. #include int main() { char a = '\012'; printf("%c", a); return 0; }
Predict the output of following C programs1.#includeint main(){ char a = '\012'; printf("%d", a); return 0;}2.#includeint main(){ char a = '012'; printf...
3.5k
views
commented
Jul 4, 2017
Programming in C
programming
programming-in-c
output
datatype
+
–
2
answers
2
UGC NET CSE | December 2015 | Part 3 | Question: 37
Match the following with respect to various memory management algorithms : ... $\text{(a)-(ii), (b)-(iii), (c)-(iv), (d)-(i)}$
Match the following with respect to various memory management algorithms :$\begin{array}{clcl} & \textbf{List-I} & & \textbf{List-II} \\ \text{(a)} & \text{Demand pagin...
2.7k
views
answered
Oct 11, 2016
Operating System
operating-system
memory-management
ugcnetcse-dec2015-paper3
+
–
2
answers
3
UGC NET CSE | August 2016 | Part 2 | Question: 19
Consider the following Entity-Relationship $(E-R)$ diagram and three possible relationship sets I, II and III) for this $E-R$ diagram: If different symbols stand for different values (e.g., $t _{1}$ is definitely not equal to $t_{2}$ ), ... above could not be the relationship set for the $E-R$ diagram ? I only I and II only II only I, II and III
Consider the following Entity-Relationship $(E-R)$ diagram and three possible relationship sets I, II and III) for this $E-R$ diagram: If different symbols stand for diff...
1.8k
views
comment edited
Sep 25, 2016
Databases
ugcnetcse-aug2016-paper2
databases
er-diagram
+
–
2
answers
4
UGC NET CSE | June 2016 | Part 2 | Question: 17
Which of the following statement(s) is/are FALSE in the context of Relational DBMS? Views in a database system are important because they with access control by aloowing users to see only a particular subset of the data in the databse E-R diagrams are ... SQL is a procedural language I and IV only III and IV only I, II and III only II, III and IV only
Which of the following statement(s) is/are FALSE in the context of Relational DBMS?Views in a database system are important because they with access control by aloowing u...
4.9k
views
commented
Aug 14, 2016
Databases
ugcnetcse-june2016-paper2
databases
+
–
2
answers
5
UGC NET CSE | December 2014 | Part 2 | Question: 27
In a classful addressing, first four bits in Class $A$ IP address is $1010$ $1100$ $1011$ $1110$
In a classful addressing, first four bits in Class $A$ IP address is$1010$ $1100$ $1011$ $1110$
6.7k
views
commented
Jul 22, 2016
Computer Networks
ugcnetcse-dec2014-paper2
computer-networks
classful-addressing
+
–
1
answer
6
UGC NET CSE | June 2013 | Part 3 | Question: 45
The simplified function in product of sums of Boolean function $F(W, X, Y, Z) = \Sigma(0,1, 2, 5, 8, 9, 10)$ is $(W’+X’)(Y’+Z’)(X’+Z)$ $(W’+X’)(Y’+Z’)(X’+Z’)$ $(W’+X’)(Y’+Z)(X’+Z)$ $(W’+X’)(Y+Z’)(X’+Z)$
The simplified function in product of sums of Boolean function $F(W, X, Y, Z) = \Sigma(0,1, 2, 5, 8, 9, 10)$ is$(W’+X’)(Y’+Z’)(X’+Z)$$(W’+X’)(Y’+Z’)(X�...
4.7k
views
commented
Jul 17, 2016
Digital Logic
ugcnetcse-june2013-paper3
digital-logic
k-map
+
–
1
answer
7
UGC NET CSE | June 2013 | Part 3 | Question: 50
What will be the output of the following segment of the program? main() { char *s=”hello world”; int i=7; printf(“%, *s, i, s); } syntax error hello w hello o world
What will be the output of the following segment of the program?main() { char *s=”hello world”; int i=7; printf(“%, *s, i, s); }syntax errorhello whello...
1.7k
views
commented
Jul 17, 2016
Programming in C
ugcnetcse-june2013-paper3
+
–
1
answer
8
UGC NET CSE | June 2013 | Part 3 | Question: 39
Match the following : ... $\text{a-iii, b-i, c-iv, d-ii}$ $\text{a-ii, b-iv, c-i, d-iii}$
Match the following :$\begin{array} {} \text{a.}& \text{Context sensitive language} & \text{i.} & \text{Deterministic finite automation} \\ \text{b.}& \text{Regular gram...
1.5k
views
answered
Jul 17, 2016
Theory of Computation
ugcnetcse-june2013-paper3
theory-of-computation
match-the-following
easy
+
–
2
answers
9
MCQ COA veii Impp
Choose the correct answer and explain also why ? What is a Flip Flop a)A Binary cell capable of storing one bit information b)An analog device capable of giving the synchronization c)a set of registers d) a clock
Choose the correct answer and explain also why ?What is a Flip Flop a)A Binary cell capable of storing one bit informationb)An analog device capable of giving the synchro...
1.0k
views
commented
Jul 17, 2016
1
answer
10
what is the output ?
#include<stdio.h> int sum(int,int); main() { int res = sum(10,20); } int sum(int n1,int n2) { return(n1+n2); }
#include<stdio.h>int sum(int,int);main(){int res = sum(10,20);}int sum(int n1,int n2){return(n1+n2);}
359
views
commented
Jul 17, 2016
Programming in C
programming-in-c
+
–
1
answer
11
Output of C programm.
#include<stdio.h> #include<math.h> int main(){ int M_PI=25; printf("%d",M_PI); return 0; } Run Time Error Compile Time Error 25 Gargabe value
#include<stdio.h #include<math.h int main(){ int M_PI=25; printf("%d",M_PI); return 0; }Run Time ErrorCompile Time Error25Gargabe value
580
views
commented
Jul 17, 2016
Programming in C
programming-in-c
+
–
1
answer
12
Digital Logic Carry look ahead adder v/s ripple carry addrer
Which of the following statements is/are true? S1: Carry look ahead adder is faster compared to a ripple carry adder. S2: The cost is higher for a carry look ahead adder compared to a ripple carry adder. S1 only S2 only Both None of these
Which of the following statements is/are true?S1: Carry look ahead adder is faster compared to a ripple carry adder.S2: The cost is higher for a carry look ahead adder co...
690
views
answered
Jul 16, 2016
Digital Logic
digital-logic
+
–
1
answer
13
Calculate excess 3 code
Convert 11012 to corresponding excess-3 binary number. (A) 10000 (B) 10110 10110 (C) 100110 (D) 01000110
Convert 11012 to corresponding excess-3 binary number.(A) 10000(B) 10110 10110(C) 100110(D) 01000110
3.0k
views
answered
Jul 16, 2016
Digital Logic
digital-logic
+
–
2
answers
14
register memory location
The register or main memory location which contains the effective address of the operand is known as pointer special location indexed register None of the above
The register or main memory location which contains the effective address of the operand is known aspointerspecial locationindexed registerNone of the above
3.0k
views
answered
Jul 16, 2016
1
answer
15
UGC NET CSE | June 2013 | Part 3 | Question: 14
A data file of $1,00,000$ characters contains only the characters $\text{g-1},$ ... code by Huffman codes, the file can be encoded with $2,52,000$ bits $2,64,000$ bits $2,46,000$ bits $2,24,000$ bits
A data file of $1,00,000$ characters contains only the characters $\text{g-1},$ with the frequencies as indicated in table:$\begin{array}{|l|l|l|l|l|l|l|} \hline & \text{...
2.7k
views
commented
Jul 16, 2016
Computer Networks
ugcnetcse-june2013-paper3
computer-networks
huffman-code
data-link-layer
+
–
1
answer
16
Which data structure satisfies given requirements?
Shiva is designing a new software. He wants to select a data structure to store integers such that "Deletion of the smallest element" and " Insertion of an element if it is not already present" should be done in O(log n ) time. He ... choice will satisfy all this requirements? A. 1 B. 2 C. 1 or 2 can be used. D. neither 1 nor 2
Shiva is designing a new software. He wants to select a data structure to store integers such that "Deletion of the smallest element" and " Insertion of an element if it ...
354
views
answer edited
Jul 16, 2016
DS
data-structures
binary-search-tree
+
–
2
answers
17
Thread
Q:which of the following can run in parallel on different processors in a multiprocessors a)user level thread b)kernel level thread c)processes d) processes and kernel level thread
Q:which of the following can run in parallel on different processors in a multiprocessorsa)user level thread b)kernel level thread c)processesd) processes and kernel leve...
2.6k
views
answer selected
Jul 16, 2016
Operating System
threads
in
multiprocessor
+
–
2
answers
18
Guess the data structure given:
Let us consider a data structure named UD. Storage can be made in UD in non-increasing order of address. Each address consists of two bytes (i.e., a word). X is a pointer that points to the most recent element entered in UD. InB stores a byte in UD, InW stores ... of X by 1. Assume that UD is not empty. What is UD ? (A) Dequeue (B) Array (C) Circular Queue (D) Stack
Let us consider a data structure named UD. Storage can be made in UD in non-increasing order of address. Each address consists of two bytes (i.e., a word). X is a pointer...
483
views
commented
Jul 16, 2016
Programming in C
data-structures
+
–
1
answer
19
identify the grammar
S --> 0S1 S -->0S S-->S1 S-->0 THE LANGUAGE GENERATED BY THIS GRAMMAR IS_____? A. regular language B. Context free language C. Context sensitive language D. Recursively enumerable language
S 0S1S >0SS >S1S >0THE LANGUAGE GENERATED BY THIS GRAMMAR IS_____?A. regular languageB. Context free languageC. Context sensitive languageD. Recursively enumerable lan...
958
views
commented
Jul 16, 2016
Theory of Computation
theory-of-computation
+
–
4
answers
20
ISRO2015-73
The output of the following program is main() { static int x[] = {1,2,3,4,5,6,7,8} int i; for (i=2; i<6; ++i) x[x[i]]=x[i]; for (i=0; i<8; ++i) printf("%d", x[i]); } 1 2 3 3 5 5 7 8 1 2 3 4 5 6 7 8 8 7 6 5 4 3 2 1 1 2 3 5 4 6 7 8
The output of the following program ismain() { static int x[] = {1,2,3,4,5,6,7,8} int i; for (i=2; i<6; ++i) x[x[i]]=x[i]; for (i=0; i<8; ++i) printf("%d", x[i]); }1 2 3 ...
9.5k
views
commented
Jul 13, 2016
Programming in C
isro2015
programming-in-c
loop
output
+
–
2
answers
21
Gate 2017
Please Tell me where I can find Gate-2017 official syllabus . and please guide me how to prepare.
Please Tell me where I can find Gate-2017 official syllabus .and please guide me how to prepare.
1.0k
views
commented
Jul 11, 2016
1
answer
22
Eigen values
To find out the Eigen values we put the |A-⋋I | =0 why we put the determinant =0 . Is there any specific reason For this
To find out the Eigen values we put the |A-⋋I | =0 why we put the determinant =0 .Is there any specific reason For this
1.8k
views
commented
Jul 10, 2016
Linear Algebra
eigen-value
+
–
1
answer
23
Pipelining
Consider 4 stage instruction pipeline where different instructions are spending different cycles at different stages shown below: S1 S2 S3 S4 I1 1 3 2 1 I2 1 1 3 2 I3 3 1 1 1 I4 1 2 1 1 The following loop is executed in the pipeline for ... The number of cycles saved using the loop level parallelism over without loop level parallelism to executed the above program is _______ (in cycles).
Consider 4 stage instruction pipeline where different instructions are spending different cycles at different stages shownbelow: S1S2S3S4I1 1 3 2 1I2 1 1 3 2I...
2.2k
views
comment edited
Jul 10, 2016
3
answers
24
Reflexive ,symmetric relation
How many relations are reflexive or symmetric on set of n element?
How many relations are reflexive or symmetric on set of n element?
10.7k
views
answer selected
Jul 10, 2016
Combinatory
relations
+
–
1
answer
25
Dearrangement
Please explain the dearrangement concept with example
Please explain the dearrangement concept with example
524
views
asked
Jul 10, 2016
Combinatory
combinatory
+
–
1
answer
26
predict output of C program
main () { struct xx { int x = 3; char name[] = "hello"; }; struct xx *s; printf("%d", s->x); printf("%s", s->name); } The output is : 3hello 104ello 104hello Compiler error
main () { struct xx { int x = 3; char name[] = "hello"; }; struct xx *s; printf("%d", s->x); printf("%s", s->name); }The output is :3hello104ello104helloCompiler error
2.4k
views
commented
Jul 10, 2016
Programming in C
programming-in-c
+
–
1
answer
27
UGC NET CSE | June 2014 | Part 3 | Question: 34
Consider a uniprocessor system where new processes arrive at an average of five processes per minute and each process needs an average of $6$ seconds of service time. What will be the CPU utilization ? $80$ % $50$ % $60$ % $30$ %
Consider a uniprocessor system where new processes arrive at an average of five processes per minute and each process needs an average of $6$ seconds of service time. Wha...
4.9k
views
commented
Jul 9, 2016
Operating System
ugcnetjune2014iii
operating-system
process-scheduling
+
–
3
answers
28
UGC NET CSE | June 2014 | Part 3 | Question: 35
Consider a program that consists of $8$ pages (from $0$ to $7$) and we have $4$ ... including initial page faults to fill available page frames with pages) : $9$ and $6$ $10$ and $7$ $9$ and $7$ $10$ and $6$
Consider a program that consists of $8$ pages (from $0$ to $7$) and we have $4$ page frames in the physical memory for the pages. The page reference string is :$1\; 2\; 3...
7.7k
views
answered
Jul 9, 2016
Operating System
ugcnetjune2014iii
operating-system
page-replacement
+
–
1
answer
29
algorithms analysis
Q; Consider the following functions: f(n)=2n g(n)= n! h(n)= nlogn so what is the Asymptotic behavior of f(n),g(n) and h(n) is trye a. f(n)=O(g(n));g(n)=O(h(n)) b. f(n)=O(g(n));g(n)=O(h(n)) c. g(n)=O(f(n));h(n)=O(f(n)) d. h(n)=O(f(n));g(n)=O(f(n))
Q; Consider the following functions: f(n)=2n g(n)= n! h(n)= nlognso what is the Asymptotic behavior of f(n),g(n) and h(n) is tryea. f(n...
374
views
commented
Jul 9, 2016
Algorithms
algorithms
asymptotic-notation
+
–
3
answers
30
Which of the following is a valid word of the language?
Which of the following is a valid word of the language (1*(01*01*)*) U (0*(10*10*)*) ? 10110010101 1010101010 000101010000 001010001010
Which of the following is a valid word of the language (1*(01*01*)*) U (0*(10*10*)*) ?101100101011010101010000101010000001010001010
673
views
commented
Jul 9, 2016
Theory of Computation
theory-of-computation
+
–
Email or Username
Show
Hide
Password
I forgot my password
Remember
Log in
Register