https://github.com/pvn-a/finetech2k20
Programming assignments for the course Fine Techniques using C, SEM-4
https://github.com/pvn-a/finetech2k20
bst c dynamic-memory-allocation linked-list mymalloc search-space-tree second-max water-jug-problem
Last synced: 19 days ago
JSON representation
Programming assignments for the course Fine Techniques using C, SEM-4
- Host: GitHub
- URL: https://github.com/pvn-a/finetech2k20
- Owner: pvn-a
- License: apache-2.0
- Created: 2020-04-16T13:33:41.000Z (about 6 years ago)
- Default Branch: master
- Last Pushed: 2020-04-17T04:36:20.000Z (about 6 years ago)
- Last Synced: 2024-07-16T02:18:40.873Z (almost 2 years ago)
- Topics: bst, c, dynamic-memory-allocation, linked-list, mymalloc, search-space-tree, second-max, water-jug-problem
- Language: C
- Homepage:
- Size: 27.3 KB
- Stars: 2
- Watchers: 1
- Forks: 0
- Open Issues: 0
-
Metadata Files:
- Readme: README.md
- License: LICENSE
Awesome Lists containing this project
README
# FineTech2k20
Programming assignments for the course Fine Techniques using C language.
## Developmental Env
Code developed, debugged and tested on UBUNTU 18.04
### Execution
```
make
./a.out
```
### 3_Jug_Problem
```
Find out all the solutions to A-B-C jug problem.
You are given 3 jugs of capacities A litres, B litres, and C litres.
The initial state/initial volumes of water in the jugs is X, Y, and Z.
Your goal is to get to a final state of P, Q, R litres.
There are no markings on the jugs (you can’t just measure off litres directly).
You may pour from a jug to any other jug (you have to transfer from one jug to another until either one jug becomes empty or the other full) . You cannot waste water. The total amount of water in the entire system must be the same as initial.
```
### BST_HardDisk
```
Implement a binary search tree on a harddisk.
Your tree should support the following operations (mentioned in the header file)
insert
delete based on the key
traversal - inorder : space separated values followed by \n
traversal - pre-order : space separated values followed by \n
```
### My_Malloc
```
Fix the flaw in malloc, by implementing your own malloc with best-fit allocation policy.
```
### Second_Max
```
Implement Stepanov's Binary counter to find the second biggest in an array of integers.
The number of elements may be an exact power of 2 or may not be.
The algorithm should have at most n + logn - 2 comparisons.(However when n is odd the number of comparisons can be little more)
It may use extra space proportional to (logn) ^ 2.
```