# Answers by sripo

1
Which one test series should I purchase for that it will help me all types of computer science related exam like:: PSU,NVS,KVS,CIL,CRIS,BEL,BARC,ISRO ,IBPS SO,SBI SO . ....
2
The variable cost $(V)$ of manufacturing a product varies according to the equation $V=4q$, where $q$ is the quantity produced. The fixed cost $(F)$ of production of same product reduces with $q$ according to the equation $F=\dfrac{100}{q}$. How many units should be produced to minimize the total cost $(V+F)$? $5$ $4$ $7$ $6$
1 vote
3
Which approach should be followed: Finishing subtopics and giving test series simultaneously or finishing the full syllabus first and then taking the test series, in December-January? Also, I have heard that Made Easy test series have a lot of errors. Then which one to take?
4
I am getting 40 as answer,but correct answer given was 41. I have counted >>= as one token but ,in solution it was counted two.
1 vote
5
A value of $x$ that satisfies the equation $\log x + \log (x – 7) = \log (x + 11) + \log 2$ is $1$ $2$ $7$ $11$
6
T(n)=T(n/2)+2; T(1)=1 when n is power of 2 the correct expression for T(n) is: a) 2(logn+1) b) 2logn c)logn+1 d)2logn+1
7
How to distinguish between a problem which is (undecidable) and which is (undecidable but partially decidable); or rather for a given problem how to say in which category it falls?
8
Decidable or Undecidable? Given a Turing machine M, a string s and an integer k, M accepts s within k steps. Please elaborate.
9
Which one of the following statements is FALSE? Context-free grammar can be used to specify both lexical and syntax rules Type checking is done before parsing High-level language programs can be translated to different Intermediate Representations Arguments to a function can be passed using the program stack
1 vote
10
11
Can anyone explain me the answer in detail?
12
Given an array of distinct integers A[1, 2,…n]. Find the tightest upper bound to check the existence of any index i for which A[i]= i. (a) O (1) (b) O (log n) (c) O (n) (d) None of these Solution: Option (c)
Let $L$ be the set of all binary strings whose last two symbols are the same. The number of states in the minimal state deterministic finite state automaton accepting $L$ is $2$ $5$ $8$ $3$
Amongst the properties $\left\{\text{reflexivity, symmetry, anti-symmetry, transitivity}\right\}$ the relation $R=\{(x, y) \in N^2|x \neq y\}$ satisfies _________