MCQ
03:41
Monday, 18 December 2017
Thursday, 7 December 2017
Wednesday, 6 December 2017
Wednesday, 29 November 2017
Sunday, 26 November 2017
Friday, 24 November 2017
Wednesday, 22 November 2017
Monday, 20 November 2017
Thursday, 16 November 2017
Friday, 3 November 2017
Friday, 27 October 2017
INTERNET
20:57
SEARCH ENGINE व BROWSER में अंतर
* ब्राउज़र सर्च इंजन तक पहुचने का माध्यम है | अर्थात बिना ब्राउज़र ओपन किये हम सर्च इंजन वेबसाइट नहीं OPEN कर सकते |
Thursday, 26 October 2017
Tuesday, 24 October 2017
Tuesday, 17 October 2017
Monday, 9 October 2017
Monday, 28 August 2017
Wednesday, 23 August 2017
Friday, 18 August 2017
COMPUTER SCIENCE NET
00:13
Basic of theory of computation
Computer is usually used to solve the problem . The problem is of two type -
- Solvable Problem --> Any problem which have a solution and we have an algorithm to reach that solution is called solvable . Ex - Prim's , Kruskal etc . The problem which not have a solution is called solvable if there is an algorithm or mathmatical proof that problem is not have any solution . Ex - Kosinberg Bride Probelm
- Unsolvable problem --> The problem about which we are not sure that it has a solution or not have a solution means there is a stat of confusion is called unsolvable problem . Ex - travel 100 km in second presently it is not possible but we can,t say mathematically that it is possible or not possible in future .
Solvable problem is also of two type --
1) Decidable ( Algorithm and procedure)
2)Undecidable (Procedure only)
So we see that a problem is decidable only if we have procedure to solve it and also have algoritm for it. The difference between algorithm and procedure is that we not only able to solve the problem but also able to determine space time complexity for the it whereas for procedure we only able to solve the problem . Ex - becoming an IAS , cricketer there is procedure like preparation and try but in how much time we got result or also not got result is not decided so this problem is called Undecidable .
Problems like merge sort , shortest path is Decidable .
Theory of computation - It is the study of mathematical machine or system called automatically . It determine whether a problem is solved by a machine and if yes then how much effort is needed to solve it . It find the desired effort for Decidable problem.
There are four type of machine in TOC like Finite automata , PDA , LBA and turing machine . If a problem is solved by a finite automata then it will need minimum effort and if it solved by turing machine it will need maximun effort and if problem is not solved by turing machine then it is Undecidable .
Language - As we need natural language like English , hindi for communication in real world we need language for communication with machine and that language is called formal language . It is called formal because it is not comlex like natural language which have too much ambiguity and needs expressions. Formal language simply the set of strings and here strings are generated by grammer like regular , context free , context sensitive.
Grammar --> Grammar is the set of productions like A-->set of terminal or non-terminal .Grammar is the generator of language means it generates strings and these set of strings called the language .
Machine --> Machine is the accept-er of language . It will accept the strings by reading it from left to right one by one symbol by starting from initial state . It transit from one state to another after reading symbol from strings on the base of transitional table . If after reading final symbol it will reach at final state then it is called that string is accepted by machine . If all strings of language is accepted then we can say that language is accepted by machine .
Symbol --> Basic building block of language like 0,1,a,b etc
Alphbet --> Set of symbol of a language like {0,1} or {a,b}is two symbol alphabet .
String --> Any Combination of symbol like 00,01,000,1111 etc. String is represented by small character like w,q,r etc
Mode of String --> Length . If w=001 then |w|=3 then zero length string is epsylen whereas empty set is Φ
Reverse of String --> if w= 001 then reverse of w wR =100.
Kleen Closure and Positive Closure of String --> Kleen closure is like universal set of strings . If alphabet A ={0,1} then Kleen closure={ε ,0,1,00,11,01,10,000,001,011,010,100,101,110,111 etc }
In positive closure ε is not involved
Monday, 14 August 2017
TIME AND MONEY
04:34
TIME AND MONEY
Time and Money Similarity -
- Waste -
- Time - > We can waste time by doing unproductive work like watching too much tv , gossip and internet . Up to some extent they are part of entertainment but exceeding the limit is wastage of time
- Money - > Spending the money only for showing to others is the wastage of money like spending too much on party , purchasing unnecessary things is waste of time .
- Spend
- Time -> We can spend time in our job , in education in family work meas the in the work which are our responsibility . We can also spend time in entertainment up to a extent like watch tv , surf the internet .
- Money --> We can spend the money on monthly expense like fees , medicine , food and on thing which gives us the happiness like going for a tour with family in a year .
- Invest
- Time -> We can invest our empty time in a work which will produce extra income for us like doing part time job , doing coaching work etc. Out of all investment of time the investment which increase our knowledge is the best investment .
- Money -> We can invest money which we saves on fixed deposit , lic , mutual funds , real estate etc.
- What we have to do is that do our spending , minimize wastes and increase the investment to be happier man or women .
Wednesday, 2 August 2017
Monday, 31 July 2017
Thursday, 13 July 2017
Wednesday, 12 July 2017
Friday, 7 July 2017
Thursday, 6 July 2017
Wednesday, 5 July 2017
Monday, 3 July 2017
Sunday, 2 July 2017
Subscribe To SSCE BLOG
Posts
All Comments
