Skip to content
computer engineering practicals
Computer Science practical source code and reference
Menu
Semester 3
Lab Manuals
Semester 4
CG
Koch Curve
Sierpinsky Gasket
Bezier Curve
Scan Line
Liang Barksy
Polyline using Mouse Interaction
Cohen Sutherland Line Clipping
Sutherland Hodgeman Polygon Clipping
Mid point ellipse
Mid point circle
Bresenham
DDA
AOA
Merge Sort
Quick Sort
OBST
Kruskal’s algorithm
Prims algorithm
N queens
Largest common subsequence algorithm
Fractional Knapsack : Greedy approach
Knuth-Morris-Pratt algorithm
Djikstras : Single Source Shortest path
Travelling salesman problem
COA
Implementation of page replacement policy
Implimentation of unsigned binary multiplication
Implementation of memory allocation policy
Implementation of mapping techniques
Hexadecimal calculator
Hamming Code
Booth’s Algorithm
Semester 5
Microprocessors
Computer Networks
SOOAD
Operating Systems
Semester 6
Projects
RaspberryPi
Raspberry Pi Setup
Using Raspberry Pi without keyboard, mouse and monitor
PXE boot CentOS from RPI
OPENSTACK
PintOS
Installing PintOS on QEMU
High Performance Computing with MPI
Android GCM
Udacity SRT convertor
CodeSchool Video Downloader
Competitions
CodeVita TCS
Hacker Earth
Mindtree
Home
Lab Manuals
Lab Manuals
.
Click to download
ECCF Lab Manual
Share this:
Twitter
Facebook
Like
Loading...
Leave a comment
Cancel reply
Δ
Privacy & Cookies: This site uses cookies. By continuing to use this website, you agree to their use.
To find out more, including how to control cookies, see here:
Cookie Policy
Subscribe
Subscribed
computer engineering practicals
Sign me up
Already have a WordPress.com account?
Log in now.
computer engineering practicals
Customize
Subscribe
Subscribed
Sign up
Log in
Copy shortlink
Report this content
View post in Reader
Manage subscriptions
Collapse this bar
%d