Data Structures Algorithms Operating Systems Computer Networks Software Engineering System Design
Categories
All Categories
Aptitude & Reasoning
All Aptitude & Reasoning Quantitative Aptitude Logical Reasoning Verbal Reasoning Data Interpretation Critical Thinking
Artificial Intelligence
All Artificial Intelligence Machine Learning Deep Learning Natural Language Processing Computer Vision Neural Networks AI Ethics Robotics Expert Systems AI Algorithms
Backend Development
All Backend Development CakePHP Django Flask FastAPI Laravel Spring Boot ASP.NET Ruby on Rails CodeIgniter Symfony
Business & Management
All Business & Management Project Management Business Analysis Digital Marketing SEO/SEM E-commerce
Cloud Computing
All Cloud Computing AWS Azure Google Cloud Docker Kubernetes Serverless Microservices CI/CD DevOps Terraform
Computer Science Fundamentals
All Computer Science Fundamentals Data Structures Algorithms Operating Systems Computer Networks Software Engineering System Design
Cybersecurity
All Cybersecurity Ethical Hacking Penetration Testing Network Security Web Security Cryptography Security Auditing
Data Science & Analytics
All Data Science & Analytics Data Analysis Statistics R Programming Pandas NumPy Matplotlib Data Science
Database Management
All Database Management MySQL PostgreSQL MongoDB Oracle SQL Server SQLite Redis Elasticsearch
ERP Systems
All ERP Systems Odoo SAP Oracle ERP Microsoft Dynamics NetSuite Salesforce ERP Implementation
General Knowledge
All General Knowledge Basic General Knowledge General Science Inventions Current Affairs Science & Technology History Geography Sports Politics Mixed Questions
HR & Soft Skills
All HR & Soft Skills Communication Skills Leadership Skills Team Management Time Management Problem Solving HR Interview
Interview Preparation
All Interview Preparation Technical Interview Coding Interview System Design Interview Behavioral Interview
Mathematics
All Mathematics Algebra Calculus Statistics Probability Discrete Mathematics Linear Algebra
Mobile Development
All Mobile Development React Native Flutter Swift Kotlin Ionic Xamarin Android Development iOS Development
Programming Languages
All Programming Languages PHP JavaScript Python Java C++ C# C Go Rust COBOL Pascal Delphi VBScript JCL CICS DB2 Mainframe
Web Development
All Web Development React.js Vue.js Angular Node.js Next.js Nuxt.js Express.js FastAPI Svelte TypeScript JavaScript ES6+ HTML/CSS jQuery Bootstrap Sass/SCSS AJAX

Computer Science Fundamentals Questions - Algorithms

Download PDF (5 Sample Questions)
Given A = (0,1) and L = A*. If R = (0n 1n, n > 0) , then language L ∪ R and R are respectively
Computer Science Fundamentals Algorithms Objective
Posted: Mar 06, 2013 View Details
A given grammar is called ambiguous if
Computer Science Fundamentals Algorithms Objective
Posted: Mar 06, 2013 View Details
Which of the following statements are true?I.    The set of all odd integers is a monoid under multiplication.II. &...
Computer Science Fundamentals Algorithms Objective
Posted: Mar 06, 2013 View Details
In a context-free grammar
Computer Science Fundamentals Algorithms Objective
Posted: Mar 06, 2013 View Details
In a context-sensitive grammar, number of grammar symbols on the left hand side of a production can't be greater than the number of
Computer Science Fundamentals Algorithms Objective
Posted: Mar 06, 2013 View Details
For two regular languagesL1 = (a + b)* a and L2 = b (a + b ) *the intersection of L1 and L2 is given by
Computer Science Fundamentals Algorithms Objective
Posted: Mar 06, 2013 View Details
The intersection of CFL and regular language
Computer Science Fundamentals Algorithms Objective
Posted: Mar 06, 2013 View Details
The logic of pumping lemma is a good example of
Computer Science Fundamentals Algorithms Objective
Posted: Mar 06, 2013 View Details
The grammars G = ( { s }, { 0, 1 }, p , s)where p = (s —> 0S1, S —> OS, S —> S1, S —>0} is a
Computer Science Fundamentals Algorithms Objective
Posted: Mar 06, 2013 View Details
Let L be a language recognizable by a finite automaton. The languageREVERSE (L) = {w such that w is the reverse of v where v ∈ L } is a
Computer Science Fundamentals Algorithms Objective
Posted: Mar 06, 2013 View Details
Which of the following statements is (are) correct ?
Computer Science Fundamentals Algorithms Objective
Posted: Mar 06, 2013 View Details
Consider the following grammar                   S --> Ax / By...
Computer Science Fundamentals Algorithms Objective
Posted: Mar 06, 2013 View Details
For which of the following application, regular expressions can not be used ?
Computer Science Fundamentals Algorithms Objective
Posted: Mar 05, 2013 View Details
If L be a language recognizable by a finite automaton, then language front    {L} = { w such that w is prefix of v where v &is...
Computer Science Fundamentals Algorithms Objective
Posted: Mar 05, 2013 View Details
Context free grammar is not closed under
Computer Science Fundamentals Algorithms Objective
Posted: Mar 05, 2013 View Details
Showing 16 to 30 of 348 results
Feedback