UGC NET SOLVED-COMPUTER SCIENCE

Useful for anyone learning the basics of computer science. Particularly useful for NET and any state SLET exam aspirants appearing for Computer Science Paper. By Vani C

Thursday, 11 June 2015

Determining GNF and CNF

at 03:48

Email This BlogThis!Share to X Share to Facebook Share to Pinterest

Labels: Finite Automata

3 comments:

Unknown4 July 2015 at 20:00
This comment has been removed by the author.
ReplyDelete
Replies
Unknown4 July 2015 at 20:02
pls send ur email-id mam
ReplyDelete
Replies
Unknown6 November 2016 at 07:53
Great mam...
ReplyDelete
Replies

Add comment

Newer Post Older Post Home

Subscribe to: Post Comments (Atom)

helplogger

Subscribe via Email

">">

Popular Posts

OPERATION ON FUZZY SETS

FUNDAMENTALS OF OPERATIONS ON FUZZY SETS There have been quite a few questions on operations on fuzzy sets in every exam of NET(in PAPER I...
UGC NET SOLVED COMPUTER SCIENCE - PAPER II

This section is for all those NET exam aspirants who are looking out for a solution for UGC NET computer science papers. As a person who had...
KNAPSACK PROBLEM

KNAPSACK PROBLEM JUNE 2014 - PAPER III Q.No 62 62. Consider the fractional knapsack instance n=4, (p1,p2,p3,p4) = (10,10,12,18) (w1,w2,w...
June 2012 - Paper II

Hey everyone, back after a two day break. Since we are done with December 2010 paper, I want to choose the next one and it would be June 20...
December 2010 - Question No 21 & 22 & 23

21. What is the maximum number of nodes in a B-tree of order 10 of depth 3 (root at depth 0) ? (A) 111 (B) 999 (C) 9999 (D) None of the ...
JANUARY 2017 - PAPER II

JANUARY 2017 – PAPER II OPERATING SYSTEMS 37. In a paging system, it takes 30 ns to search translation Look-a-side Buffer (TLB...
DEADLOCK AVOIDANCE

Deadlock avoidance is a very important topic in operating system. So, first let us understand the basics related to deadlock. What is a de...
JUNE 2012 - PAPER II

37. Interrupts which are initiated by an instruction are (A) Internal (B) External (C) Hardware (D) Software Ans:-D Explanation:- ...
RSA Algorithm

Using RSA algorithm, what is the value of cipher text C, if the plain text M = 5 and p = 3, q = 11 & d = 7 ? (A) 33 (B) 5 (C ) 25 (...
CYCLOMATIC COMPLEXITY - SOLVED PROBLEMS

Cyclomatic complexity is a software metric. It provides a quantitative measure of the logical complexity of a program.Cyclomatic complexity...

Total Pageviews

Blog Archive

► 2017 (7)
- ► September (4)
- ► June (1)
- ► April (2)

▼ 2015 (35)
- ► November (4)
- ► October (1)
- ► July (2)
- ▼ June (10)
- ► May (6)
- ► April (2)
- ► March (2)
- ► February (1)
- ► January (7)

► 2014 (9)
- ► December (2)
- ► November (4)
- ► May (3)

► 2013 (6)
- ► June (1)
- ► May (1)
- ► March (4)

► 2012 (29)
- ► September (27)
- ► May (1)
- ► March (1)

► 2011 (2)
- ► August (2)

Pages

Home
DECEMBER 2011 - PAPER II(Q.N0 36 - 50)
JUNE 2012 - PAPER III
JUNE 2012 - PAPER III
JUNE 2012 - PAPER III

Visitors

Search This Blog

Pages

Home
PAPER III
PAPER II
Software Engineering
Computer Networks
Data Structures
Finite Automata
ADA
DBMS

Simple theme. Powered by Blogger.