verdantia/technical.html at main · simran-kalkeri/verdantia · GitHub

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
<!DOCTYPE html>
<html lang="en">
<head>
    <meta charset="UTF-8">
    <meta name="viewport" content="width=device-width, initial-scale=1.0">
    <title>Railway Network Optimization</title>
    <link rel="stylesheet" href="technical.css">
</head>
<body>
    <!-- Navigation Bar -->
    <header>
        <div class="logo">
            <a href="index.html" style="display: flex; align-items: center; text-decoration: none;">
                <i>A</i>
                <span>Verdantia</span>
            </a>
        </div>
        <ul class="nav-links">
            <li><a href="index.html">Home</a></li>
            <li><a href="course.html">Course Project</a></li>
            <li><a href="Business.html">Business Case Studies</a></li>
            <li><a href="sdg.html">SDG</a></li>
            <li><a href="budget.html">Budget</a></li>
            <li><a href="technical.html" class="active">Technical Aspects</a></li>
            <li><a href="reflections.html">Reflections</a></li>
        </ul>
    </header>

    <div class="container">
        <h2>Technical Aspects of Railway Network Optimization</h2>
        <h3>Time and Space Complexity Analysis</h3>
        <table>
            <thead>
                <tr>
                    <th>Algorithm</th>
                    <th>Time Complexity</th>
                    <th>Space Complexity</th>
                    <th>Use Case</th>
                </tr>
            </thead>
            <tbody>
                <tr>
                    <td>Dijkstra's Algorithm</td>
                    <td>O(V^2) using adjacency matrix, O((V+E)logV) with min-heap</td>
                    <td>O(V+E)</td>
                    <td>Improved Supply Chain Network, Fare Calculation for Passengers</td>
                </tr>
                <tr>
                    <td>Hash Tables</td>
                    <td>O(1) average case, O(n) worst case</td>
                    <td>O(n)</td>
                    <td>Enhancement of Security</td>
                </tr>
                <tr>
                    <td>Kruskal's Algorithm</td>
                    <td>O(ElogV)</td>
                    <td>O(E+V)</td>
                    <td>Route Planning</td>
                </tr>
                <tr>
                    <td>Prim's Algorithm</td>
                    <td>O((V+E)logV)</td>
                    <td>O(V+E)</td>
                    <td>Route Planning</td>
                </tr>
                <tr>
                    <td>Sorting</td>
                    <td>O(nlogn)</td>
                    <td>O(n) for Merge Sort, O(logn) for Quick Sort</td>
                    <td>Scheduling of Trains</td>
                </tr>
                <tr>
                    <td>Brute Force String Search</td>
                    <td>O(nm)</td>
                    <td>O(1)</td>
                    <td>Lost and Found Department</td>
                </tr>
                <tr>
                    <td>File Management System</td>
                    <td>O(n)</td>
                    <td>O(n)</td>
                    <td>Lost and Found Department</td>
                </tr>
            </tbody>
        </table>
    </div>
    <div class="container">
        <h2>Scalability Considerations</h2>
        <div class="cards">
            <div class="card">
                <h3>Microservices Architecture</h3>
                <p>Design the system as a collection of loosely coupled services for easier scaling and maintenance.</p>
            </div>
            <div class="card">
                <h3>Horizontal Scaling</h3>
                <p>Add more servers to handle increased load, especially for computationally intensive tasks like route optimization.</p>
            </div>
            <div class="card">
                <h3>Database Sharding</h3>
                <p>Partition the database to distribute data across multiple servers, improving query performance.</p>
            </div>
            <div class="card">
                <h3>Content Delivery Network (CDN)</h3>
                <p>Use a CDN to serve static assets and reduce latency for users across different locations.</p>
            </div>
            <div class="card">
                <h3>Elastic Computing</h3>
                <p>Implement auto-scaling to dynamically adjust resources based on current demand, ensuring efficient resource utilization.</p>
            </div>
        </div>
    </div>

    <div class="container">
        <h2>Performance Considerations</h2>
        <div class="cards">
            <div class="card">
                <h3>Caching</h3>
                <p>Implement caching mechanisms for frequently accessed data.</p>
            </div>
            <div class="card">
                <h3>Database Indexing</h3>
                <p>Optimize database queries by creating indexes on frequently searched fields.</p>
            </div>
            <div class="card">
                <h3>Load Balancing</h3>
                <p>Distribute the workload across multiple servers to handle high traffic during peak booking times.</p>
            </div>
            <div class="card">
                <h3>Asynchronous Processing</h3>
                <p>Use message queues for non-real-time tasks to improve system responsiveness.</p>
            </div>
            <div class="card">
                <h3>Data Compression</h3>
                <p>Compress data for storage and transmission to reduce bandwidth usage and improve response times.</p>
            </div>
        </div>
    </div>

    <footer>
        <p>&copy; 2025 Verdantia | All Rights Reserved</p>
    </footer>
</body>
</html>