department of information technology … schedule 2015/ct… · 2 8085 microprocessor: ... 13...
TRANSCRIPT
DEPARTMENT OF INFORMATION TECHNOLOGY College of Technology & engineering
MPUAT, Udaipur Lecture Plan/Schedule for
IT 221: Computer Organization & Architecture (Credit 3+1)
2015-16 (Theory) Nandita Chasta Lecture No. Topic
1 Register Transfer Language 2 Data Movement around registers 3 Data Movement from/to Memory 4 Tutorial 5 Logic Micro operations 6 Concept of bus 7 Timing in register transfer 8 Tutorial 9 CPU Organization 10 Addressing Modes 11 Instruction Format 12 Tutorial 13 CPU organization with large registers 14 Stack and Handling of Interrupts 15 Subroutine and Instruction Pipelining 16 Tutorial 17 Arithmetic Algorithms: Array Multipler 18 Both’s Algorithm 19 Addition and Subtraction of Signed numbers 20 Tutorial 21 Addition and Subtraction of Unsigned numbers 22 Addition and Subtraction of 2’s compliment numbers 23 Microprogrammed Control Unit: Basic Organization 24 Tutorial 25 Horizontal and Vertical Formats 26 Address sequencer 27 Memory Organization 28 Tutorial 29 Memory Technology, Types 30 Performance, Access modes 31 RAM organization and Design 32 Tutorial
33 Auxiliary Memory Access methods 34 Auxiliary Memory Organization 35 Magnetic Disks types 36 Tutorial 37 Optical Memories 38 Memory Hierarchies 39 Associative Memory 40 Tutorial 41 Cache Memories: Organizations 42 Cache Memories: mapping 43 Principle of virtual Memory 44 Tutorial 45 Segmentation and Paging 46 I/O organizations: Introduction to peripherals 47 Peripherals interface 48 Tutorial 49 Strobe based communication 50 Handshake based communication 51 DMA based transfer and I/O processors Tutorial
52 Introduction to SIMD and MIMD 53 Array Processors 54 Pipeline Architecture
Total 54
Nandita Chasta (Faculty)
DEPARTMENT OF INFORMATION TECHNOLOGY College of Technology & Engineering
MPUAT, Udaipur Lecture Plan/Schedule for
IT 222: Microprocessors & Interfacing (Credit 3+2)
2015-16 (Theory) Sunil Choudhary Lecture No. Topic
1 Introduction of microprocessors 2 8085 microprocessor: Block diagram and Pins diagram 3 Pins and their function de-multiplexing of bushes 4 Control signals and pins a flags 5 Introduction to 8085 based microcomputer system 6 Instruction and Timings 7 Instruction format 8 Instruction classification 9 Addressing modes 10 Instructions and timing diagram. 11 8086: Pin diagram and internal architecture. 12 8088: Pin diagram and internal architecture. 13 Assembly Language and Programming in 8085 Part - I 14 Assembly Language and Programming in 8085 Part - II 15 Instruction set Part - I 16 Instruction set Part - II 17 Program structures (sequential, conditional, iterative) Part - I 18 Program structures (sequential, conditional, iterative) Part - II 19 Macros and subroutines Part -I 20 Macros and subroutines Part -II 21 Stacks 22 Counter 23 timing delay 24 Interrupt structure 25 Interrupt Programming 26 Devices and Interfacing 27 Interfacing of Memory 28 I/0 Devices 29 Architecture characteristics and interfacing to 8085 30 DMA controller 8257 31 Interrupt Controller 8259A 32 USART 8251
33 PPI 8255 34 Timer 8254 (8253) 35 Keyboard display controller 8279 36 Programming and operation of 8254 (8253) 37 PPI 8255 38 ADC interfacing with 8085 microprocessor 39 DAC interfacing with 8085 microprocessor 40 Level Converters MC 1488 41 Level Converters MC 1489 42 Communication buses 43 Centronics 44 IEEE 488 45 Current loop 46 RS 232 C 47 RS 422 A 48 RS 423 A
Total 48
Sunil Choudhary (Faculty)
INFORMATION TECHNOLOGY & ENGINEERING COLLEGE OF TECHNOLOGY AND ENGINEERING
MPUAT, UDAIPUR LECTURE PLAN SCHEDULE
For IT-223: OBJECT ORIENTED PROGRAMMING (Credit 3 + 2)
(THEORY) 2015-2016 Course Teacher: Kartika Vyas
Lecture No. TOPIC
1 Introduction to Object-oriented programming: encapsulation, polymorphism, inheritance.
2 Header files, structures, unions, anonymous unions.
3 Inline function, static data members and static member functions, scope resolution operator.
4 Namespaces, Friend function.
5 Array of objects, pointer to objects, reference parameters, passing objects to functions, returning objects,
6 Object assignment, passing references to objects, returning references, independent references.
7 C++ dynamic allocation operators, this pointer 8 Constructor: default constructor, parameterized constructors. 9 Constructor: copy constructor, default arguments. 10 Objects & memory allocation, dynamic constructors. 11 Function overloading: overloading function. 12 Overloading constructor functions. 13 Function overloading & ambiguity. 14 Operator overloading: member operator functions. 15 Operator overloading using a friend function 16 Overloading new & delete. 17 Inheritance: Base-Class access control, 18 Inheritance and protected members. 19 Inheriting from multiple base classes 20 Execution of constructors & destructors in inheritance 21 Passing parameters to Base- Class Constructors. 22 Virtual Base classes.
23 Virtual functions & polymorphism: calling a virtual function through a Base Class.
24 Hierarchical virtual functions 25 Pure virtual functions & Abstract classes. 26 Overloading << & >>. 27 C++ I/O: C++ streams, formatted I/O. 28 Formatting I/O using manipulators,. 29 Templates: generic functions, overloading function template. 30 Template classes, using default arguments with template classes 31 Explicit class specializations. 32 Exception Handling: catching class types. 33 Using multiple catch statements. 34 Handling derived class exceptions. 35 Restricting exceptions, rethrowing an exception. 36 C++ File I/O: fstream & file classes.
37 Opening, closing, reading & writing text files. 38 Unformatted and Binary I/O. 39 Detecting EOF, random access of file. 40 Introduction to java and advantages of java 41 Java virtual machine, java byte code. 42 Importance of java in internet
IT 321: Data Modeling and Design (Credit 3 + 1) Course Teacher: Hemwati Kumawat
Unit Topic (IT 321 Theory) Lecture duration
(Hrs) 1. Application, Database system and file system, View, Models, Database
Languages, Transaction management, System structure, Users, Data models 7
1. Entity relationship model: concepts, constraints, keys, design, issues, ERD, weak entity, ER symbols, ER-schema to tables
4
2. Relational algebra: Structure, Tuple relational calculus, Domain relational calculus
6
2. Relational databases: Structured query language-structure, Set operation, Aggregate functions, Null values, Nested sub queries, Views, Complex queries, Joined relations, DDL, DML, Database modification
6
2. Embedded structured query language, Dynamic structured query language 3
3. Database integrity and security: Domain constraints, Referential integrity assertions, triggers
3
3. Relational database design: First normal form, Functional dependencies, Decomposition – properties, Second normal form, Boyce normal form, Fourth normal form, more normal form, design process
4
4. Object relational database: Nested relations, Complex types, Inheritance, Reference types, Query with complex types, Functions and procedure, Object oriented and object relational
5
4. Introduction to object oriented database, Query processing and optimization physical database design in relational database, concepts of database tuning in relational systems
6
Revision and discussion regarding important topics 4
Total 48
IT 321: Data Modeling and Design (Credit 3 + 1) Course Teacher: Hemwati Kumawat
S.No Topic (IT 321 Practical) Practical duration
(Hrs) 1. Sample database with Microsoft Access for basic understanding of
Tables, Records and Fields. 2
2. Queries with and without Primary Key and Referential constraints. 2 3. Study ER Diagram, Bank Database. 4 4. Create a Database of a company 4 5. SQL Create Queries for the Company Database with proper Referential
Constraints. 2
6. SQL Alter Command with Option of add column, add constraints, drop column for Company Databse.
4
7. Basic Queries in SQL: The Select From Where structure of Basic SQL Queries, Ambiguous Attribute Names, Aliasing.
4
8. Unspecified WHERE Clause and Use of (*) Asterisk, Queries as Tables as Sets in SQL (Union, Except, Intersection).
6
9. Queries of substring pattern matching and Arithmetic Operators, SQL Queries for Ordering
6
10. Nested Queries, Queries: Exists and Not Exists Functions, Joined Tables (with explicit Join, Natural Join)
6
11. Queries with a use of Aggregate functions, Queries with Group by and Having Clauses, Queries of Update and Delete Command
6
12. Sample form Design of Students details and connected with database, having Insert, display functions.
2
Total 48
Practical List
IT 321: Data Modeling and Design (Credit 3 + 1) Course Teacher: Hemwati Kumawat
S.No Topic
1. Sample database with Microsoft Access for basic understanding of Tables, Records and Fields.
2. Queries with and without Primary Key and Referential constraints.
3. Study ER Diagram, Bank Database.
4. Create a Database of a company
5. SQL Create Queries for the Company Database with proper Referential Constraints.
6. SQL Alter Command with Option of add column, add constraints, drop column for Company Databse.
7. Basic Queries in SQL:
i) The Select From Where structure of Basic SQL Queries.
ii) Ambiguous Attribute Names, Aliasing.
iii) Unspecified WHERE Clause and Use of (*) Asterisk.
iv) Queries as Tables as Sets in SQL (Union, Except, Intersection).
v) Queries of substring pattern matching and Arithmetic Operators.
vi) SQL Queries for Ordering
vii) Nested Queries.
viii) Queries: Exists and Not Exists Functions
ix) Joined Tables (with explicit Join, Natural Join)
x) Queries with a use of Aggregate functions
xi) Queries with Group by and Having Clauses
xii) Queries of Update and Delete Command
8. Sample form Design of Students details and connected with database, having Insert, display functions.
DEPARTMENT OF INFORMATION TECHNOLOGY College of Technology & Engineering
MPUAT, Udaipur Lecture Plan/schedule for
IT 322 Computer Algorithm (Credit: 3+1) 2015-2016 (Theory) Pallavi Joshi
Lecture No. Topic
1. Algorithms concepts, analysis, design,
2. asymptotic notations
3. Recurrence- substitution method
4. Recurrence tree method
5. Masters method
6. Probabilistic analysis and randomized algorithm
7. Probabilistic analysis and randomized algorithm
8. Hiring Problem, indicator random variables
9. Randomized algorithms
10. Data Structures: Hash tables, direct address tables.
11. Hash table functions, open addressing
12. Binary search tree: definition , querying
13. Binary search tree insertion deletion
14. Red- Black tree: Properties, rotation
15. Red- Black tree: insertion deletion
16. Oder statistics: Heap sort
17. Quick sort
18. Sorting in linear time
19. Median and order static`s
20. Binomial heaps: Binomial tree, Binomial heaps
21. Binomial heaps: Binomial tree, Binomial heaps operations
22. Advance design analysis and techniques: Dynamic Programming
23. Dynamic Programming: Elements, assembly line scheduling
24. Matrix chain multiplication
25. Longest Common subsequence
26. Linear Programming: Standard and slack form
27. Linear Programming: Standard and slack form
28. Formulating problems as linear programming
29. Simplex Algorithm
30. Approximation algorithm: Vertex cover problem
31. Vertex cover problem
32. Set covering problem
33. Floyd- Warshall Algorithm
34. Graph algorithms: BFS, DFS
35. Topological sort
36. Minimum Spanning Trees
37. Kruskal and Prim`s Algorithm
38. Kruskal and Prim`s Algorithm
39. Single source Shortest path- Bellman Ford algorithm
40. Single source Shortest path- Bellman Ford algorithm
41. Dijkastra`s Algorithm
Pallavi Joshi Faculty
S.No. Topic (Theory)
Lecture
Duration
(Hrs)
1 Advatages of Java, JVM and Java Bytecode 3
2 Encapsulation, Polymorphism, Abstraction 2
3 Data Types, Variables and Arrays 1
4 Operators, Operator Precedence, Control Statements 2
5 Objects and Classes 4
6 Inheritance: Member Access, Types of Inheritace 1
7 Method Overriding, Dynamic Method Dispatch 2
8 Abstract Classes, Using Final with Inheritance 2
9 Packages 2
10 Interfaces 3
11 Exception Handling 5
12 Multithreaded Programming 6
13 Java I/O Classes, Streams and Interfcaes 5
14 Applets 3
15 Event Handling and AWT 4
16 Introduction to Swing 3
Total : 48
B.Tech Third Year, Information Technology
Course Name and Code: Internet Programming with JAVA (IT323) [Credit: 3+2]
Course Teacher: Pranav Wadhwani
IT 324: Computer Graphics (Credit 3 + 1) Course Teacher: Hemwati Kumawat
Unit Topic (IT 324 Theory) Lecture duration
(Hrs) 1. Introduction to computer graphics, Applications of computer graphics, Video
display devices: Direct view storage tubes, Refresh cathode ray tube, Raster scan displays, Three dimensional viewing devices, Raster scan systems: Video controllers, Raster scan display processors, Random scan systems
6
1. Color CRT monitors, Flat panel displays, Graphics monitors and workstations 3
1. Input devices: Keyboards, Mouse, Trackball and spaceball, Joysticks, Digitizers, Image scanners, Touch panels, Light pens, Voice Systems, Hard copy devices, Graphics software
3
2. Output primitives: Points and lines, Line drawing algorithms, DDA algorithms, Bresenham’s line algorithms, parallel line algorithms, Loading the frame buffer, Line Function
4
2. Circle generating algorithms: Properties of circles, Midpoint circle algorithms, Ellipse generating algorithms, Properties of ellipse, Midpoint ellipse algorithms
3
2. Pixel addressing and object geometry, Filled area primitives: Boundary fill algorithms, Flood fill algorithms, Character generation
4
3. Attributes of output primitives: Line, Curve attributes, Color and gray scale levels, Area fill, Character attributes, Bundled attributes, Enquiry functions
2
3. Two dimensional geometric transformations: Basic transformation- Translation, Rotation, Scaling. Matrix representation and Homogeneous coordinates, Composite transformation: Translations, Rotations, Scaling, Reflection, Shear
6
3. Three dimensional geometric and modeling transformations: Translation, Rotation, Scaling, Reflection, Modeling and coordinate transformations
3
4. Two dimensional viewing: Viewing pipeline, Viewing coordinate reference frame, Window to viewport coordinate transformation, Two dimensional viewing functions
4
4. Clipping operations, Point clipping, Line clipping: Cohen Sutherland line clipping, Liang-Barsky line clipping, Nicholl-Lee-Nicholl line clipping, Line clipping using nonrectangular clip windows, Splitting concave polygons, Polygon clipping
6
Revision and discussion regarding important topics 4
Total 48
IT 324: Computer Graphics (Credit 3 + 1) Course Teacher: Hemwati Kumawat
S. No Topic (IT 324 Practical) Practical duration
(Hrs) 1. DDA line draw algorithm, bresenham’s line draw algorithm 4
3. Midpoint circle algorithm, midpoint ellipse algorithm 4
4. Fill area using flood fill algorithm, boundary fill algorithm fill area function
6
5. Translation, scaling of a triangle and rotation of a line 6
6. Name using san serif font, change background color, simulate traffic light, draw a moving wheel, Indian flag, to implement human face.(eyebro, eye ,ears, nose and lips)
12
Total 32
IT 324: Computer Graphics (Credit 3 + 1) Course Teacher: Hemwati Kumawat
Practical List
1. Write a program to draw line using DDA line draw algorithm.
2. Write a program to draw line using bresenham’s line draw algorithm.
3. Write a program to draw circle using midpoint circle algorithm.
4. Write a program to draw ellipse using midpoint ellipse algorithm.
5. Write a program to fill area using flood fill algorithm
6. Write a program to fill area using boundary fill algorithm
7. Write a program to fill area using fill area function.
8. Write a program for translation of a triangle.
9. Write a program for scaling of a triangle.
10. Write a program to implement rotation of a line.
11. Write a program to write a name using san serif font.
12. Write a program to change background color.
13. Write a program to simulate traffic light.
14. Write a program to draw a moving wheel.
15. Write a program to draw a Indian flag.
16. Write a program to implement human face.(eyebro, eye ,ears, nose and lips)
Lecture Plan
IT Final Year, II Semester
Session: 2015-16
Subject Code: IT 421
Subject Name: Net Centric Computing Credit: 3+1
Subject Teacher: Vishal Jain
Unit Topic Time Duration
(Hrs.)
1. Network and internetworking: types of network, network principles, internet protocols.
Characterization of distributed computing, design issues of distributed computing, IPC in unix.
External Data Representation, Remote procedure calls, remote method invocation, distributed garbage collection.
3
3
4
2. Distributed File System: File service architecture, sun network file system, Andrew File system.
Name Services: domain name system, directory & discovery services.
Global name service, X.500 directory service.
4
5
3
3. Time & global states: clocks, events, process states, synchronizing physical clock.
Logical time and logical clocks.
Coordination and agreement: Distributed mutual exclusion, Elections.
5
2
5
4. Transaction & concurrency control: transactions, nested transactions.
Locks, optimistic concurrency control, timestamp ordering.
Distributed transactions: flat and nested distributed transactions.
Atomic commit protocols, concurrency control in distributed transactions, distributed deadlocks, transaction recovery.
2
3
3
6
Total Time Duration (Hrs): 48
Practical Plan
IT Final Year, II Semester
Session: 2015-16
Subject Code: IT 421
Subject Name: Net Centric Computing Credit: 3+1
Subject Teacher: Vishal Jain
Unit Topic Time Duration
(Hrs.)
1. Practical based on IP Addresses, IPC, TCP, UDP, client-server communication.
Practical based on RPC, RMI.
10
6
2. Practical based on file system.
Practical based on Domain Name System (DNS).
8
8
3. Practical based on clocks, process states.
Practical based on synchronizing physical clock, logical time and logical clocks.
Practical based on Distributed Mutual exclusion.
4
8
4
4. Practical based on Transactions and concurrency control. 16
Total Time Duration (Hrs): 64
IT422: E-Commerce (Credit: 3+0)
Course Teacher: Himani Jain
Unit
Topic (IT422-Theory)
Lecture
Duration
(Hrs) 1. Introduction: Scope of electronic commerce, trade cycle, electronic markets, electronic data
interchange, Internet commerce and e-commerce in perspective.
2
1. Business Strategy in an Electronic Age: Value Chain-supply chains, Porter’s value chain model
and Inter-Organizational value chains. Competitive Advantage-Competitive Strategy, Porter’s
Model, First Mover advantage and competitive advantage using e-commerce business strategy,
Introduction to Business Strategy, Strategic Implications of IT technology.
8
1. E-commerce: Implementation and evaluation. 2
2. Web booking systems and competitive outcomes. 2
2. Business-to-Business Electronic Commerce: Inter-Organizational Transaction, The credit
Transaction Trade cycle. A variety of transactions.
5
2. Electronic Markets: Markets and electronic markets, usage of electronic markets, Advantages
and disadvantages of electronic markets.
5
3. Electronic Data Interchange (EDI): Definition and benefits of EDI, EDI technology, standards,
communications, Implementation, agreements and securities.
4
3. EDI trading pattern and transactions, EDI Adoption and EDI Maturity, IOS, EDI, and Internet e-
commerce.
4
3. Inter-Organizational e-commerce: Transactions, Purchasing Online, After Sales Online, E-
commerce in Desktop Facilities Management.
4
4. Business-to-Consumer Electronic Commerce: Consumer Trade Transactions, A page on
Web, HTML, Client side Scripting, Server side Scripting.
6
4. The Elements of e-commerce: e-Visibility, The e-shop, Online Payments, Delivering the
goods, After Sales Service, Internet e-commerce Security, A Website Evaluation Model.
6
Total 48
.
IT 423(e) PARALLEL AND DISTRIBUTED DATABASE (Credit: 3+1)
Course Teacher: Garima Jain
Unit
Topic (IT423 (e)-Theory)
Lecture
Duration
(Hrs)
1. Parallel database systems, architecture, functional aspects, parallel DBMS
techniques: data placement, query parallelism, parallel data processing, parallel
query optimization.
3
1. Parallel execution: initialization, interferences and convoy effect, load
balancing, load balancing and performance evaluation for hierarchical
architecture.
5
2. Distributed database issues and challenges, distributed database
architecture. client/server architecture, peer-to-peer architecture,
MDBS architecture
4
2. Distributed database design: top-down design, bottom-up design, horizontal
fragmentation.
6
2. Vertical Fragmentation, Hybrid Fragmentation, allocation issues, information requirement, allocation model.
6
3. Semantic data control: view management, data security, semantic integrity
control, Query processing, Decomposition and Localization: query processing
objectives.
6
3. Query processors characterization- types of optimization, optimization timing,
statistics, decision sites, network topology and query processing, replicated
fragments, use of semi joins.
4
3. Query processing layers, query decomposition- normalization, analysis,
redundancy, Localization- primary horizontal fragmentation, vertical
fragmentation, derived fragmentation, hybrid fragmentation.
8
4. Distributed transaction management: definition, transaction properties-
Atomicity, consistency, isolation, durability. Transaction issues- flat
transaction, nested transactions, workflows.
5
4. Distributed concurrency Control: serializability, taxonomy of concurrency
control, locking-based; Concurrency control, timestamp-based concurrency
control, optimistic concurrency control, relaxed concurrency control, deadlock.
8
Total 55
IT 423(e) PARALLEL AND DISTRIBUTED DATABASE (Credit: 3+1)
Course Teacher: Garima Jain
S.No.
Topic (CS423 (c) - Practical)
Practical
Duration
(Hrs)
1. Queries on functions with and without parameters 6
2. Queries on user defined procedures with and without parameters 6
3. Queries on cursors, triggers, sequences 8
4. Queries to implement multiple return statements, recursive function 6
5. Queries on stored procedures, implementing nested procedure block 4
6. Queries implementing cursor variable assignment, use of RPAD 6
Total 36
PRACTICAL LIST
1. Write a program calling a function-
(a) Area of a circle
(b)Lateral area of a cone
(c)Area of a cube.
2. Write a program calling a function for a table employee & find their average salary.
3. Write a program to create or replace a function.
4. Write a program to create a function dealing with cursors.
5. Write a program to exit a function.
6. Write a function to call a function from PL/SQL without parameters.
7. Write for local subprograms that is calling function inside cursor.
8. Write a program to implement multiple return statements.
9. Write a program to return a user defined data type.
10. Write a program to implement recursive function.
11. Write a program to call a procedure.
12. Write a program to execute a procedure.
13. Write a program for creating stored procedures.
14. Write a program to decrease salary with user procedure.
15. Write a program to implement nested procedure block.
16. Write a program where loop is required to read each row in cursor returned.
17. Write a program to implement cursor for counting.
18. Write a program using RPAD to format cursor variable.
19. Write a program to implement CONCAT ( ) Function.
20. Write a program to implement cursor variable assignment.
21. Write a program to create a trigger for setting employee salary to 0.
DEPARTMENT OF COMPUTER SCIENCE & ENGINEERING College of Technology & Engineering MPUAT, Udaipur
Lecture Plan/Schedule for IT-415: Parallel Computer Architecture (Credit: 3+0)
2015-2016 (Theory) Rubina Banu Patel
Lecture no. Topic
1 Parallel programs: Parallel applications
2 Parallelization processes
3 parallelizing computation versus data, Goals of parallelization processes
4 Programming for performance: partitioning for performance
5 Load balance
6 Reducing inherent communication
7 Data access and communication in a multi-memory system
8 Workload —Driven evaluation: scaling workloads and machines
9 Key issues in scaling
10 Scaling models and speedup measures
11 Scaling workload parameters
12 Evaluating a real machine
13 Performance isolation
14 Choosing workloads
15 Choosing performance metrics
16 Shared memory multiprocessors: cache coherence problem, Cache coherence
through bus snooping
17 Memory consistency
18 Snooping protocols
19 Snooping protocols
20 Snooping protocols
21 Snoop-Based multiprocessor design : correctness requirement
22 Cache controller
23 Reporting snoop results
24 Dealing with write backs
25 Non-atomic state transitions
26 Serialization, Deadlocks, live-locks & starvation
27 Multilevel cache hierarchies
28 Split transaction bus
29 Snoop results & conflicting requests
30 Path of cache miss, Serialization & sequential consistency
31 Split transaction bus with multiple caches
32 Shared cache design
33 Coherence for virtually indexed caches
34 Translation look-aside buffer coherence
35 Scalable Multiprocessors: scalability, Network transaction
36 Shared address space
37 Message passing
38 Active messages
39 Physical DMA
40 Node to network interface
41 Dedicated message passing
42 Shared physical address space
43 Cluster & network of workstations
44 Network transaction performance
45 Shared address space operations
46 Message passing operations
47 Application level performance
48 Synchronization
49 Algorithms for locks
50 Algorithms for barriers
Faculty: Rubina Banu Patel