mgechev

--Дефинирайте функция на Haskell, която намира сумата на два полинома, зададени във вида
--[(<коеф.1>,<степен1>),(<коеф.2>,<степен2>), . . . ,(<коеф.n>,<степенn>)],
--където всички коефициенти са различни от 0 реални числа и степенните показатели
--са подредени в строго намаляващ ред (резултатът трябва да има същия вид).

--It should also work with with coeficients equals to zero.
polynomialSum :: [(Integer, Integer)]->[(Integer, Integer)]->[(Integer, Integer)]
polynomialSum [] [] = []
polynomialSum [] l2 = l2
polynomialSum l1 [] = l1

mgechev

#include <iostream>
#include <math.h>
using namespace std;

template <class T>
struct Node {
    T value;
    Node *left;
    Node *right;

mgechev

data Tree = Nil | Node Int Tree Tree deriving (Eq)

interestingNodesCount Nil = 0
interestingNodesCount (Node a Nil Nil) = if a == 0 then 1 else 0
interestingNodesCount (Node a left right)
    | left /= Nil && right == Nil && a == 1   =   1 + interestingNodesCount left
    | left == Nil && right /= Nil && a == 1   =   1 + interestingNodesCount right
    | left /= Nil && right == Nil && a /= 1   =   0 + interestingNodesCount left
    | left == Nil && right /= Nil && a /= 1   =   0 + interestingNodesCount right
    | otherwise                               =   (if a == 2 then 1 else 0) + (interestingNodesCount left) + (interestingNodesCount right)

mgechev

reverse2 :: [a]->[a]
reverse2 [] = []
reverse2 (x:xs) = (reverse2 xs) ++ [x]

len :: [a]->Int
len [] = 0
len (x:xs) = (len xs) + 1

sum2 :: [Int]->Int
sum2 [] = 0

mgechev

#include <iostream>
#include <string.h>
using namespace std;

class Trip {
    private:
    char *destination;
    char *description;
    int length;
    double price;

mgechev

import 'dart:core';
import 'dart:async';
import 'dart:io';

void startServer() {
  Future<ServerSocket> serverFuture = ServerSocket.bind('0.0.0.0', 55555);
  serverFuture.then((ServerSocket server) {
    server.listen((Socket socket) {
      socket.listen((List<int> data) {
        String result = new String.fromCharCodes(data);

mgechev

--List length
len :: [a] -> Integer
len [] = 0
len (x:xs) = 1 + len xs

--Fibonacci
fib :: Integer -> Integer
fib 1 = 0
fib 2 = 1
fib 3 = 1

mgechev

#!/usr/bin/perl

use strict;
use warnings;

sub get_resolution {
    my $resolution = `xdpyinfo | grep dimensions`;
    if ($resolution =~ /dimensions:\s+(\d+)x(\d+)/) {
        return { width => $1, height => $2 };
    }

mgechev

\documentclass[12pt]{beamer}


\usetheme{Singapore}
\usecolortheme{seagull}
\beamertemplatenavigationsymbolsempty

\usepackage[utf8]{inputenc}

\usepackage[russian]{babel}

mgechev

#Schedule for ASP.NET exercises

1. Introduction

• Introduction to the course
• What will be the course project
• Course's web page
• What kind of language is C#?
• Hello world application with ASP.NET

2. Introduction to C#

• Fundamental constructs (loops, if-else-then, switch)