Professional Finishing Services | Enhance Your Products

header

Inspiration

Showcase of inspiring ideas according to your interests.

Contact us and request a quote.

Website, June 2020 | Eva.final ORDINARY – correodecontacto@direccion.com | Phone: +034 500 600 300

header

Finishing

Apply selective varnish for stamping. Preserve the scaling of the sample.

Website, June 2020 | Eva.final ORDINARY – correodecontacto@direccion.com | Phone: +034 500 600 300

header

Finishing

Every month you will find a new model to bind your products.

In this section

Read More

C Programming Examples: Matrices, Strings, and Structures

C Program for 2×2 Matrix Addition

Code:

#include <stdio.h>

int main() {
    int matrix1[2][2] = {{1, 2}, {3, 4}};
    int matrix2[2][2] = {{5, 6}, {7, 8}};
    int result[2][2];
    int i, j;

    // Adding matrices
    for (i = 0; i < 2; i++) {
        for (j = 0; j < 2; j++) {
            result[i][j] = matrix1[i][j] + matrix2[i][j];
        }
    }

    // Displaying the result
    printf("Sum of matrices:\n");
    for (i = 0; i < 2; i++) {
        for (j = 0; j < 2; j++) {
 
Read More

Distributed Computing for Large Language Models: Scalability, Speed, and Fault Tolerance

Paged Data Access to DRAM

Basic Idea: “Split” data file (virtually or physically) and stage reads of its pages from disk to DRAM (vice versa for writes)

Page Management in DRAM Cache

  • ❖ Caching: Retaining pages read from disk in DRAM
  • ❖ Eviction: Removing a page frame’s content in DRAM
  • ❖ Spilling: Writing out pages from DRAM to disk

Cache Replacement Policy

The algorithm that chooses which page frame(s) to evict when a new page has to be cached but the OS cache in DRAM is full

  • ❖ Popular policies
Read More

Graph Theory and Algorithms

  1. (a)  T or F: For a directed graph with n vertices to be acyclic, the maximum number of edges is n − 1.

  2. (b)  T or F: When DFS processes node u’s adjacency list, the color of neighbor v is black, then (u, v) is a forward edge.

  3. (c)  
    T or F: If u is a descendant of v in a DFS tree, DFS must have discovered v before discovering u.

  4. (d)  T or F: Topological ordering can be found for any directed acyclic graph.

  5. (e)  
    T or F: If all edge weights are distinct, the edge with the lowest weight must be in

Read More

Artificial Intelligence: A Comprehensive Guide to AI Concepts and Algorithms

What is AI? Explain intelligent behavior that involved in AI
: Artificial Intelligence is a branch of Computer Science that pursues creating the computers
or machines as intelligent as human beings. It can be described as an attempt to build machines
that like humans can think and act, able to learn and use knowledge to solve problems on their
own.
Intelligence relates to tasks involving higher mental processes, e.g. creativity, solving
problems, pattern recognition, classification, learning, induction,

Read More

Understanding Segments in Computer Graphics and Animation

UNIT-5

Q. Explain in detail how segments are created.

ANS.

Coordinate System: In computer graphics, we typically work within a Cartesian coordinate system. This system consists of an x-axis and a y-axis, where each point on the plane is represented by an ordered pair (x, y).

Endpoint Definition: To create a line segment, we first need to define the coordinates of its endpoints. Let’s denote these endpoints as 𝑃1 and 𝑃2, with coordinates (𝑥1,𝑦1) and (𝑥2,𝑦2) respectively.

Algorithm Selection:

Read More