Mini-Project Exhibition on Microcontroller & Embedded System
Computer Science & Engineering 4th Semester B-section Students exhibited their mini-project on microcontroller and embedded system, IoT, Android under guidance of Basavesh D ,Assistant professor,Dept of CSE.
List of Projects
- “TEMPERATURE AND HUMIDITY INDICATOR” by Shobith Gowda,Sharaj Kornaya, Roshan Kashyap, Prathik S S
- “TEMPERATURE MONITORING SYSTEM” by Surabhi.S, Sinchana Patel, Sathya.K, Sneha.N.R
- “MUSIC REACTIVE RGB LIGHTS” by Vishnu Vardhanreddy Y, Yash Yadav, Raghav Singh
- “SMART DRIP IRRIGATION SYSTEM” by Rishi V, Sai Kiran.J, Sai Praneeth.S
- “4x4x4 LED CUBE” by Rakshitha Kashyap, Rakshitha M Prabhu, Sahana Somani, Sahanaa Dinesh.
- “WIFI CONTROLLED CAR” by Varsha.S, Varun Kumar.D, Vithesh Shetty, Sai Gowrav.P
- “OBJECT FOLLOWING ROBOT” by Sharath Kumar U S, Sharath, Yash Kumar, Villayat Ali
- “SMART DUSTBIN” by Yashas S.R, Vishnu Prasad Pai, Prateek Shridhar Bhat, Vijay Surya Reddy
- “HOME AUTOMATION”by Prerana S, Rithu Rao, Sanjana S Daivagna, Sree Shravani
- “DIGITAL THERMOMETER”by Yashaswini, Yamuna, Zainab
- “VISION INDIA” by Spoorthi N Shetty, Riona Lobo, Supritha A V, Pragnya V Prasad
- “SMART BLIND STICK”Sudhanva S P, Vismai Kumar S, Surya N B Sushanth M S
- “BLUETOOTH CONTROLLED RC CAR” by Satish M Kiran Kumar R Sanjay H.P Sai Sujan.S
- “OFF TERRAIN ADVENTURE ROBOT” by Pranav S P, Rakshith Gowda N, Sujan S, Tejas N
- “SMART WIFI CONTROLLED IOT DOOR LOCK SYSTEM” by Samanvita. S, Sharanya K R
- “WATER FLOW METER” by Tarun, Sanjana A, Sharath KB, Puneeth
Few Ideas were further developed & commercial products is being designed & applying for patent.
INSERTION OF A NODE AT THE BEGINNING OF A DOUBLY LINKED LIST
Can a program be explained in the form of ACT?
I am glad to say that the answer is “YES”. We can illustrate the program in the form of a skit or an act.
Here, the students of 3rd semester Artificial Intelligence and Machine Learning under the guidance of our teacher, Mr. Srinidhi Kulkarni, illustrated the action of insertion of a node at the beginning of a doubly linked list.
A doubly linked list is a type of linked list in which each node apart from storing its data has two links. The first link points to the previous node in the list and the second link points to the next node in the list. The first node of the list has its previous link pointing to NULL and is nicknamed as ‘HEAD’ similarly the last node of the list has its next node pointing to NULL and is nicknamed as ‘TAIL’.
In the picture below the action of insertion of a new node at the beginning is explained by Neethu CV. There are three nodes represented (Node A, B&C).
Node A consists of: – Santhosh-data value of 10
Banushree-address of previous node (In this case Null) Pooja-address of the next node (2000)
Node B: –
Rathan-data value of 20
Shwetha-address of the previous node (1000) Shreesha-address of the next node (3000) Node C: –
Girish-data value of 30
Hitesh-address of the next node (In this case Null) Shishir-address of the previous node (2000)
Devaraj-data value of 40
Kruthika R-address of the previous node Adithi-address of the next node
The linked list before inserting a new node has its head at the first node (10) and tail at (30). The role of ‘Head’ is played by Harshith and ‘Tail’ is played by Ranga Swamy.
So in the above picture we can see a head node pointing to the address of the next node(20) and also the previous node i.e,NULL. If we move to the next node(20) we can see it is pointing to the address of the next node(30) i,e, 3000 and the address of the previous node i.e,1000.
Again if we move to the further node(30) we can see it is pointing to the next node i.e, NULL and the address of the previous node i.e, 2000.
The main aim of this activity is to insert the new node at the beginning and tp make that as the head node and linking it to the existing first node(A). To do that we begin by inserting the new node of value 40 in the front by connecting it to the address of the next node(A) i.e, 1000 and the previous node value as NULL (as it is the front node and there is no previous node). After the insertion of the node(N) at front we set the head node to the new inserted node making the new node(N) as the head node, now the head will point to the new node(N).
The below picture shows the end of the illustration. The insertion of a new node at the beginning is completed by making the new inserted node as the head node and connecting it to the next node and previous node as shown below.
The activity which was conducted by my fellow students under the guidance of our teacher, Mr Srinidhi Kulkarni, was a fun learning exercise for all. The activity truly gave us a realistic idea on how the insertion of the new node at the beginning in the doubly linked list works thus enhancing our knowledge in this particular topic of data structures. I can positively conclude that the activity was a huge success in achieving its main objective for the class. The class really appreciates the opportunity as it helped us to introduce personal talents, master and help others master the subject.
INSERTION OF A NODE AT THE BEGINNING OF A DOUBLY LINKED LIST written by-Kruthika KS(3rd Sem Al-ML)
REVERSING A DOUBLE LINKED LIST
A double linked list is a type of linked list in which each node apart from storing its data has two links. The first link points to the previous node in the list and the second link points to the next node in the list. The first node of the list has its previous link pointing to NULL and is nicknamed as ‘HEAD’ similarly the last node of the list has its next node pointing to NULL and is nicknamed as ‘TAIL’.
The students of 3rd semester Computer Science Engineering under the guidance of our teacher, Mr. Srinidhi Kulkarni, illustrated the action of reversing a double linked list. In the picture below the action of reversing is explained by Arul Joshua. There are three nodes represented (Node A, B&C).
Node A consists of: -Giridhar -data value of 10
Deepanshu – address of previous node (In this case Null)
Devika- address of the next node (2000)
Node B: -Krishna Koustab – data value of 20
Ananya D- address of the previous node (1000)
Pooja- address of the next node (3000)
Node C: -Gayathri- data value of 30
Ajay- address of the next node (In this case Null)
Manish- address of the previous node (2000)
The linked list before reversing has its head at the first node (10) and tail at (20). The role of ‘Head’ is played by Bhoomika and ‘Tail’ is played by Ananya B.
So in the picture above we have a head node(10) pointing to the next node (20) and then also has a previous pointer but there’s nothing there that’s why it’s NULL. If we go to the node ( 20 ), you
can see it’s pointing to the next node ( 30 ) as well as it’s pointing to the previous node (20).Similarly we have the the tail node (30) pointing to the previous node (20) and the next node pointing to NULL as there’s no node next.
The main aim of the activity was to reverse the head to the tail position and tail to the head position. In order to do so we begin by swapping the addresses of 2000(Devika) and NULL (Deepanshu).Then we swap 1000 (Ananya D ) and 3000(Pooja ). Lastly we swap 2000(Manish) and NULL (Ajay). For the reverse to be complete, we lastly interchange the location of head(Bhoomika ) and tail (Ananya B).
The picture above shows the end of the illustration. Reversal of the double linked list is complete with the positions of the head and tail interchanged. We also observe the addresses in the next and previous positions of the nodes have changed thus reversing the linkage.
The activity which was conducted by my fellow students under the guidance of our teacher, Mr Srinidhi Kulkarni, was a fun learning exercise for all. The activity truly gave us a realistic idea on how the reversal of the linked list works thus enhancing our knowledge in this particular topic of data structures. I can positively conclude that the activity was a huge success in achieving its main objective for the class. The class really appreciates the opportunity as it helped us to introduce personal talents, master and help others master the subject.
REVERSING A DOUBLE LINKED LIST written by-Anagha Bharadwaj (3rd Sem CSE)
RELATIONSHIP BETWEEN TRANSPORT LAYER AND NETWORK LAYER
Course: COMPUTER NETWORKS AND SECURITY (18CS52)
A transport-layer protocol provides logical-communication between processes running on different hosts. Whereas, a network-layer protocol provides logical-communication between hosts. Transport layer protocols are implemented in the end-systems but not in network-routers. Within an end-system, a transport protocol moves messages from application-processes to the network-layer and vice versa. But doesn’t say anything about how the messages are moved within the network-core.
Students of 5th Semester, B Section, Computer Science and Engineering have role played on the above mentioned topic. Students had to act out roles which represented hosts, processes, transport layer protocol and network layer protocol.
• Better understanding of the topic.
• Appeal to different learning style and incorporated active learning.
• Presentation, communication, social and creativity skills.
• Problem solving skills
Faculty Name: Dr. Manoj Kumar M
Associate Professor, Dept. of CSE
Subject: Database Management System -17CS53
Faculty: Dr. S. Prabhanjan
Students: 5th SemesterStudents
Google Classroom is a blended learning platform for schools that aims to simplify creating, distributing, and grading assignments in a paperless way. Google Classroom help students and teachers communicate, collaborate, organize, and manage assignments, go paperless, and much more.
Assignment and quiz were organized through Google classroom.
Flip Class: March – 2020
Course: Design and Analysis of Algorithms
Course Code: 18CS42
Program & Semester: CSE – IV
|1JT18CS050||SHISHIRA N||Module 1: Fundamental Data Structures: Stacks, Queues||09.03.2020
|1JT18CS037||NIKITA AGARWAL||Module1: Fundamental Data Structures: Graphs, Trees||09.03.2020
|1JT18CS048||SANJANA V||Module1: Fundamental Data Structures: Sets and Dictionaries||09.03.2020
Dusk and Dawn
Management Event – Dusk and Dawn held on 04-11-2019
Students of 5 th semester were divided into 11 groups of 5 to 6 students. Each group consisting of both boys and girls. Each group has selected a case study about a company, of their choice.
Each group deliberated about the success or failure of a company highlighting the reasons for success or failure.
Dr. Harsha, Associate Professor, Dept of ISE and Mr. Madhu, Associate Professor, Dept of CSE judged the students presentation. 2 groups were awarded prizes for best presentation.
We thank HOD-CSE, Principal and Management for encouraging us to conduct this event.
The event was coordinated by Prof. Srinidhi Kulkarni, Dept of CSE.
CPU Sim is an educational software package written in Java. CPU Sim provides students an active learning environment in which they can design, modify, and compare various computer architectures at the register-transfer level and higher. They can run assembly language or machine language programs for those architectures through simulation. CPU Sim is a complete development environment, including dialog boxes for designing the CPU architecture, a text editor for editing assembly language programs, an assembler, several display windows for viewing the registers and RAMs during the execution of programs, and many debugging features such as the ability to step forward or backward during execution, inspecting and optionally changing the values in the registers and RAMs after each step. These features and suggested uses of CPU Sim in computer organization classes. With CPU Sim, instructors can give students hands-on experience with the following topics in the computer organization (18CS34)
- Numeric data representation and number bases
- Representation of non-numeric data
- Microprogrammed realization of the CPU
- Control unit; instruction fetch, decode, and execution
- Instruction types (data manipulation, control, I/O)
- Instruction formats
- Assembly/machine language programming
- Addressing modes
- Main memory organization and operations
Date: Aug-Jan 2019-2020
Technical Blog Writing
Coordinator : A. Nagaraj, Associate Professor, Dept of CSE, JIT
Technical Blog Writing event was organized on 28-02-2019, for the students of Computer Science and Engineering.
3 topics were given
- Impact of Social Media on Indian Society
- Engineering Education in India and its relevance
- Impact of AI and ML on Job Scenario in India
Students have liked the event and they have requested the department to conduct such activities.
The event was coordinated by A. Nagaraj, Associate Professor, Department of Computer Science and Engineering, JIT.
A talk on Enterprise Resource Planning (ERP)
A talk on Enterprise Resource Planning (ERP) was arranged for the students of 6 th Semester CSE on 26-04-2019. This talk was arranged as a pre requisite to industrial visit to Ms InCap Ltd, Hirehalli Industrial Area, Tumkur. The talk was delivered by Mr. Nagaraj. A, Associate Professor, Department of CSE.
ERP and its importance in a manufacturing unit was discussed in detail. Some of the topics covered are listed below.
> Importance of Incoming goods inspection
> Planning Process
> Scheduling process
> Bill of Materials (BOM)
> Product Mix
> Vendor development
> Quality control
> Importance of inspection and every stage
> Customer satisfaction
> Case studies
The event was co-ordinated by Mr. Srinidhi Kulkarni, Asst Professor, Department of CSE.
The students have liked the event, since case studies were discussed.