Month: March 2018
DATA COMMUNICATIONS AND NETWORKS PPT
DATA COMMUNICATIONS AND NETWORKS PPT BY Dr. Carl M. Rebman Download Datacommunications And Networks PPT Notes:chapter one (fall 08)chapter twochapter…
Read More »C Programming PPT Powerpoint Presentation
C PROGRAMMING PPT BY : Dr. KHAMIS OMAR Download C Programming PPT Notes Introduction to Computers and C++Programming Introduction to C…
Read More »Automata Theory Multiple Choice Quaestion & Answers (MCQs) Set-49
1. Are Multitape and Multitrack turing machines same? a) Yes b) No c) Somewhat yes d) Cannot tell 2. Complete…
Read More »Automata Theory Multiple Choice Quaestion & Answers (MCQs) set-48
1. Which of them have XML as their default format? a) IWork b) LibreOffice c) OpenOffice d) All of the…
Read More »Automata Theory Multiple Choice Quaestion & Answers (MCQs) set-46
1. State true or false: Statement: We cannot use Ogden’s lemma when pumping lemma fails. a) true b) false 2.…
Read More »Automata Theory Multiple Choice Quaestion & Answers (MCQs) set-47
1. A DTD is associated with a XML file by means of ___________ a) Function b) <!DOCTYPE> c) Macros d)…
Read More »Automata Theory Multiple Choice Quaestion & Answers (MCQs) set-45
1. What does NP stands for in complexity classes theory? a) Non polynomial b) Non-deterministic polynomial c) Both (a) and…
Read More »Automata Theory Multiple Choice Quaestion & Answers (MCQs) set-44
1. Which of the expressions correctly is an requirement of the pumping lemma for the context free languages? a) uvnwxny…
Read More »Automata Theory Multiple Choice Quaestion & Answers (MCQs) set-43
1. X is a simple mathematical model of a computer. X has unrestricted and unlimited memory. X is a FA…
Read More »Automata Theory Multiple Choice Quaestion & Answers (MCQs) set-42
1. Which of the given problems are NP-complete? a) Node cover problems b) Directed Hamilton Circuit Problem c) Both (a)…
Read More »