Computer Science Articles

Page 10 of 53

Early Database Models

Samual Sam
Samual Sam
Updated on 14-Mar-2026 397 Views

A database model determines the logical structure of a database and defines how data can be stored, organized, and manipulated. Before databases were developed, the only way to store data was in file storage systems, which increased complexity as programmers had to perform complex parsing and relating operations to extract data. File Storage Complex, redundant Database Models Structured, ...

Read More

Cloud Databases

karthikeya Boyini
karthikeya Boyini
Updated on 14-Mar-2026 3K+ Views

A cloud database is a database that has been optimized or built for a virtualized environment, deployed in a hybrid cloud, public cloud, or private cloud. Cloud databases offer the ability to pay for storage capacity and bandwidth on a per-user basis, provide scalability on demand, and deliver high availability. They also give enterprises the opportunity to support business applications in a software-as-a-service (SaaS) deployment. Cloud Database DB DB DB ...

Read More

Operational Database

karthikeya Boyini
karthikeya Boyini
Updated on 14-Mar-2026 797 Views

An operational database is a system designed to store information related to the day-to-day operations of an enterprise. Functional lines like marketing, employee relations, customer service, inventory management, and sales require such databases to maintain current and frequently accessed data. Operational databases are also known as OLTP (Online Transaction Processing) systems because they handle real-time transactions and support the ongoing operations of a business. Key Characteristics Real-time processing − Handle immediate transaction processing. High concurrency − Support multiple users accessing data simultaneously. Data integrity − Maintain ACID properties for reliable transactions. Normalized structure − Reduce data ...

Read More

NoSQL Databases

Samual Sam
Samual Sam
Updated on 14-Mar-2026 7K+ Views

NoSQL databases (Not Only SQL) are designed for large sets of distributed data. Some big data performance issues that are not effectively handled by relational databases are easily managed by NoSQL databases. They are very efficient at analyzing large-size unstructured data that may be stored across multiple virtual servers in the cloud. Types of NoSQL Databases NoSQL databases are categorized into four main types based on their data model − Document Store JSON-like documents MongoDB ...

Read More

Commercial Database

karthikeya Boyini
karthikeya Boyini
Updated on 14-Mar-2026 2K+ Views

A Commercial Database is a paid database service designed for users who need access to large volumes of specialized information. These databases are subject-specific, containing vast amounts of curated data that individual organizations cannot afford to collect and maintain on their own. Access is provided through commercial links or subscription plans. Commercial Database Access Model Commercial Database Paid Access ...

Read More

End User Database

Samual Sam
Samual Sam
Updated on 14-Mar-2026 2K+ Views

An End User Database is a shared database specifically designed for end users who are not concerned with the underlying transactions, operations, or technical details. The end user interacts only with the final product − a software application or interface − and the database presents summarized, meaningful information for their use. Raw Operational Database SQL, Transactions, CRUD Data Processing & Aggregation End User Database Interface Dashboards, Reports, Simple Views ...

Read More

Personal database

karthikeya Boyini
karthikeya Boyini
Updated on 14-Mar-2026 2K+ Views

A Personal Database is a small, single-user database that is stored and managed on a personal computer. The data is collected and used by an individual or a small group of people, typically within the same department of an organization. Personal databases are designed for simplicity and ease of use, making them ideal for managing personal information, small projects, or departmental data without the complexity of enterprise-level systems. Characteristics Personal databases have several key characteristics that distinguish them from larger database systems − Single-user − Designed for one user or a small group at a time. Small size − ...

Read More

C program for DFA accepting all strings over w ∈(a,b)* containing "aba" as a substring

Bhanu Priya
Bhanu Priya
Updated on 11-Mar-2026 3K+ Views

ProblemDesign a DFA for the language L={w1abaw2 | w1, w2 Є(a, b)*}, which means the DFA accepts all strings which contain “aba” as a substring.SolutionThe strings that are accepted by language L= {aba, aabaa, aabab, babab, ababa, …….}Step 1 − Transition diagram for minimal string (starting string) −If w1 and w2 are null then the string it generates is “aba” because w1, w2 ε(a, b)*q0 is the initial state and q3 is the final state.Step 2 − The final DFA for the given language is as follows −Explanationqo is the initial state q0 on ‘a’ goes to q1 and on ...

Read More

C Program to construct DFA accepting odd numbers of 0s and 1s

Bhanu Priya
Bhanu Priya
Updated on 11-Mar-2026 10K+ Views

Construct deterministic finite automata (DFA) for the language L = { w : w has odd number of 0’s and w has odd number of 1’s}, over the alphabet Σ = {0, 1}.Example0111, 010101, 01110011 is an accepted string, because those strings have an odd number of 0’s and an odd number of 1’s.For the given language we will need four states to draw the main DFA which will read odd no. of 0s and 1s. We can also draw it by merging the two DFAs in which one will accept only an odd number of 0s and one accepts ...

Read More

C Program to build DFA accepting the languages ending with "01

Bhanu Priya
Bhanu Priya
Updated on 11-Mar-2026 18K+ Views

ProblemDesign deterministic finite automata (DFA) with ∑ = {0, 1} that accepts the languages ending with “01” over the characters {0, 1}.SolutionThe strings that are generated for a given language are as follows −L={01, 001, 101, 110001, 1001, ……….}The minimum length of the string is 2, the number of states that the DFA consists of for the given language is: 2+1 = 3 states.Here, q0 − On input 0 it goes to state q1 and on input 1 it goes to itself.q1 − On input 0 it goes to itself and on input 1 it goes to State q2.q2 − ...

Read More
Showing 91–100 of 521 articles
« Prev 1 8 9 10 11 12 53 Next »
Advertisements