Skip to content
This repository has been archived by the owner on Oct 17, 2022. It is now read-only.

Latest commit

 

History

History
210 lines (171 loc) · 6.64 KB

README.md

File metadata and controls

210 lines (171 loc) · 6.64 KB

C101

Introduction

Feel free to visit and use some sample codes and homeworks problem source codes in C and GoLang for the Introduction to Programming course at the Amirkabir University of Tech. under supervision of Prof. Bakhshi.

For homework problems and more materials about the course see here.

Thanks to Quera for supporting our course!

Trello boards

Requirements

Source codes of Homework are written in Go and C. Documentations are in Word and needs Sahel and Vazir fonts.

Problem Structure

Each problem have the following structure:

HW-1\
    |
    |- p1\
    |    |
    |    |- p1.md
    |    |- p1.go
    |    |- tc\
    |    |     |- in
    |    |     |- out
    |
    |- p2\

p.sh creates the zip file that can be uplaoded to Quera website based on the above structure. It feeds the inputs from in folder into p.go then puts the results into out folder.

If there is a file with generator.go name in tc folder the p.sh use it to generate the test cases into in folder.

package main

import (
	"fmt"
	"math/rand"
)

func main() {
	fmt.Printf("%d %d;", 1, 10)
	fmt.Printf("%d %d;", 5, 10)

	for i := 0; i < 20; i++ {
		m := rand.Intn(100)
		n := rand.Intn(m)

		fmt.Printf("%d %d;", n, m)
	}
}

Topics

  • Lecture 3: Basic C Programming
  • Lecture 4: Calculations
  • Lecture 5: Interaction
  • Lecture 6: Making Decisions
  • Lecture 7: Repeating Statements
  • Lecture 8: Functions
  • Lecture 9: Arrays
  • Lecture 10: Pointers & Dynamic Memory
  • Lecture 11: Structures
  • Lecture 12: Files
  • Lecture 13: Miscellaneous

Assignments

  • HW1: Algorithm Design

  • HW2: Caculation (with an introduction to math.h) and Interaction (scanf() and printf())

  • HW3: Decision Making

  • HW4: Loops

  • HW5: Functions

  • HW6: Mid-Term Project

  • HW7: Pointer, Structs and Files

Exercises are categorized by topic and semester order in this link

The difficulty of each question from 10 and terms that contain the question are included in the sheet along with their link.

Workshops

  • Introduction-1
  • Introduction-2
  • Algorithm
  • Algorithm
  • I/O, Calculation
  • Decision
  • Loop
  • Midterm Review
  • Git
  • Arrays & DP
  • Pointers
  • Pointers and Arguments
  • Linked Lists & Structs

Teaching Assistants over Semesters

Fall-2014

Fall-2015

Fall-2016

Fall-2017

Fall-2018

Spring-2019

Fall-2019

Spring-2020

Fall-2020